Definition:Associative Operation

From ProofWiki
Jump to navigation Jump to search


Let $S$ be a set.

Let $\circ : S \times S \to S$ be a binary operation.

Then $\circ$ is associative if and only if:

$\forall x, y, z \in S: \paren {x \circ y} \circ z = x \circ \paren {y \circ z}$


Arbitrary Non-Associative Order 3 Structure

Consider the algebraic structure of order $3$ defined by the Cayley table:

$\begin{array}{c|cccc} \circ & a & b & c \\ \hline a & b & c & b \\ b & b & a & c \\ c & a & c & c \\ \end{array}$

\(\ds \paren {a \circ a} \circ b\) \(=\) \(\ds b \circ b\)
\(\ds \) \(=\) \(\ds a\)
\(\ds a \circ \paren {a \circ b}\) \(=\) \(\ds a \circ c\)
\(\ds \) \(=\) \(\ds b\)

demonstrating non-associativity.

Also note that $a \circ b \ne b \circ a$, so $\circ$ is non-commutative as well.

Also see

Historical Note

The term associative was coined by William Hamilton in about $1844$ while thinking about octonions, which aren't.