### Associative

**
Template:Transformation rules
**

In mathematics, the **associative property**^{[1]} is a property of some binary operations. In propositional logic, **associativity** is a valid rule of replacement for expressions in logical proofs.

Within an expression containing two or more occurrences in a row of the same associative operator, the order in which the operations are performed does not matter as long as the sequence of the operands is not changed. That is, rearranging the parentheses in such an expression will not change its value. Consider, for instance, the following equations:

- $(5+2)+1=5+(2+1)=8\; \backslash ,$

- $5\backslash times(5\backslash times3)=(5\backslash times5)\backslash times3=75\; \backslash ,$

Consider the first equation. Even though the parentheses were rearranged (the left side requires adding 5 and 2 first, then adding 1 to the result, whereas the right side requires adding 2 and 1 first, then 5), the value of the expression was not altered. Since this holds true when performing addition on any real numbers, we say that "addition of real numbers is an associative operation."

Associativity is not to be confused with commutativity. Commutativity justifies changing the order or sequence of the operands within an expression while associativity does not. For example,

- $(5+2)+1=5+(2+1)\; \backslash ,$

is an example of associativity because the parentheses were changed (and consequently the order of operations during evaluation) while the operands 5, 2, and 1 appeared in exactly the same order from left to right in the expression. In contrast,

- $(5+2)+1=(2+5)+1\; \backslash ,$

is an example of commutativity, not associativity, because the operand sequence changed when the 2 and 5 switched places.

Associative operations are abundant in mathematics; in fact, many algebraic structures (such as semigroups and categories) explicitly require their binary operations to be associative.

However, many important and interesting operations are non-associative; some examples include subtraction, exponentiation and the vector cross product.

## Contents

## Definition

Formally, a binary operation $*$ on a set *S* is called **associative** if it satisfies the **associative law**:

- $(x\; *\; y)\; *\; z=x\; *\; (y\; *\; z)\backslash qquad\backslash mbox\{for\; all\; \}x,y,z\backslash in\; S.$

Here, $*$ is used to replace the symbol of the operation, which may be any symbol, and even the absence of symbol like for the multiplication.

- $(xy)z=x(yz)\; =\; xyz\; \backslash qquad\backslash mbox\{for\; all\; \}x,y,z\backslash in\; S.$

The associative law can also be expressed in functional notation thus: $f(f(x,y),z)\; =\; f(x,f(y,z))$.

## Generalized associative law

If a binary operation is associative, repeated application of the operation produces the same result regardless how valid pairs of parenthesis are inserted in the expression.^{[2]} This is called the **generalized associative law**. For instance, a product of four elements may be written in five possible ways:

- ((ab)c)d
- (ab)(cd)
- (a(bc))d
- a((bc)d)
- a(b(cd))

If the product operation is associative, the generalized associative law says that all these formulas will yield the same result, making the parenthesis unnecessary. Thus "the" product can be written unambiguously as

- abcd.

As the number of elements increases, the number of possible ways to insert parentheses grows quickly, but they remain unnecessary for disambiguation.

## Examples

Some examples of associative operations include the following.

- The concatenation of the three strings
`"hello"`

,`" "`

,`"world"`

can be computed by concatenating the first two strings (giving`"hello "`

) and appending the third string (`"world"`

), or by joining the second and third string (giving`" world"`

) and concatenating the first string (`"hello"`

) with the result. The two methods produce the same result; string concatenation is associative (but not commutative).

- In arithmetic, addition and multiplication of real numbers are associative; i.e.,

- $$

\left. \begin{matrix} (x+y)+z=x+(y+z)=x+y+z\quad \\ (x\,y)z=x(y\,z)=x\,y\,z\qquad\qquad\qquad\quad\ \ \, \end{matrix} \right\} \mbox{for all }x,y,z\in\mathbb{R}.

- Because of associativity, the grouping parentheses can be omitted without ambiguity.

- Addition and multiplication of complex numbers and quaternions is associative. Addition of octonions is also associative, but multiplication of octonions is non-associative.

- The greatest common divisor and least common multiple functions act associatively.

- $$

\left. \begin{matrix} \operatorname{gcd}(\operatorname{gcd}(x,y),z)= \operatorname{gcd}(x,\operatorname{gcd}(y,z))= \operatorname{gcd}(x,y,z)\ \quad \\ \operatorname{lcm}(\operatorname{lcm}(x,y),z)= \operatorname{lcm}(x,\operatorname{lcm}(y,z))= \operatorname{lcm}(x,y,z)\quad \end{matrix} \right\}\mbox{ for all }x,y,z\in\mathbb{Z}.

- Taking the intersection or the union of sets:

- $$

\left. \begin{matrix} (A\cap B)\cap C=A\cap(B\cap C)=A\cap B\cap C\quad \\ (A\cup B)\cup C=A\cup(B\cup C)=A\cup B\cup C\quad \end{matrix} \right\}\mbox{for all sets }A,B,C.

- If
*M*is some set and*S*denotes the set of all functions from*M*to*M*, then the operation of functional composition on*S*is associative:

- $(f\backslash circ\; g)\backslash circ\; h=f\backslash circ(g\backslash circ\; h)=f\backslash circ\; g\backslash circ\; h\backslash qquad\backslash mbox\{for\; all\; \}f,g,h\backslash in\; S.$

- Slightly more generally, given four sets
*M*,*N*,*P*and*Q*, with*h*:*M*to*N*,*g*:*N*to*P*, and*f*:*P*to*Q*, then

- $(f\backslash circ\; g)\backslash circ\; h=f\backslash circ(g\backslash circ\; h)=f\backslash circ\; g\backslash circ\; h$

- as before. In short, composition of maps is always associative.

- Consider a set with three elements, A, B, and C. The following operation:

× A B C A A A A B A B C C A A A

- is associative. Thus, for example, A(BC)=(AB)C = A. This mapping is not commutative.

- Because matrices represent linear transformation functions, with matrix multiplication representing functional composition, one can immediately conclude that matrix multiplication is associative.

## Propositional logic

Template:Transformation rules

### Rule of replacement

In standard truth-functional propositional logic, *association*,^{[3]}^{[4]} or *associativity*^{[5]} are two valid rules of replacement. The rules allow one to move parentheses in logical expressions in logical proofs. The rules are:

- $(P\; \backslash or\; (Q\; \backslash or\; R))\; \backslash Leftrightarrow\; ((P\; \backslash or\; Q)\; \backslash or\; R)$

and

- $(P\; \backslash and\; (Q\; \backslash and\; R))\; \backslash Leftrightarrow\; ((P\; \backslash and\; Q)\; \backslash and\; R),$

where "$\backslash Leftrightarrow$" is a metalogical symbol representing "can be replaced in a proof with."

### Truth functional connectives

*Associativity* is a property of some logical connectives of truth-functional propositional logic. The following logical equivalences demonstrate that associativity is a property of particular connectives. The following are truth-functional tautologies.

**Associativity of disjunction**:

- $(P\; \backslash or\; (Q\; \backslash or\; R))\; \backslash leftrightarrow\; ((P\; \backslash or\; Q)\; \backslash or\; R)$
- $((P\; \backslash or\; Q)\; \backslash or\; R)\; \backslash leftrightarrow\; (P\; \backslash or\; (Q\; \backslash or\; R))$

**Associativity of conjunction**:

- $((P\; \backslash and\; Q)\; \backslash and\; R)\; \backslash leftrightarrow\; (P\; \backslash and\; (Q\; \backslash and\; R))$
- $(P\; \backslash and\; (Q\; \backslash and\; R))\; \backslash leftrightarrow\; ((P\; \backslash and\; Q)\; \backslash and\; R)$

**Associativity of equivalence**:

- $((P\; \backslash leftrightarrow\; Q)\; \backslash leftrightarrow\; R)\; \backslash leftrightarrow\; (P\; \backslash leftrightarrow\; (Q\; \backslash leftrightarrow\; R))$
- $(P\; \backslash leftrightarrow\; (Q\; \backslash leftrightarrow\; R))\; \backslash leftrightarrow\; ((P\; \backslash leftrightarrow\; Q)\; \backslash leftrightarrow\; R)$

## Non-associativity

A binary operation $*$ on a set *S* that does not satisfy the associative law is called **non-associative**. Symbolically,

- $(x*y)*z\backslash ne\; x*(y*z)\backslash qquad\backslash mbox\{for\; some\; \}x,y,z\backslash in\; S.$

For such an operation the order of evaluation *does* matter. For example:

- $$

(5-3)-2 \, \ne \, 5-(3-2)

- $$

(4/2)/2 \, \ne \, 4/(2/2)

- $$

2^{(1^2)} \, \ne \, (2^1)^2 Also note that infinite sums are not generally associative, for example:

- $$

(1-1)+(1-1)+(1-1)+(1-1)+(1-1)+(1-1)+\dots \, = \, 0 whereas

- $$

1+(-1+1)+(-1+1)+(-1+1)+(-1+1)+(-1+1)+(-1+\dots \, = \, 1

The study of non-associative structures arises from reasons somewhat different from the mainstream of classical algebra. One area within non-associative algebra that has grown very large is that of Lie algebras. There the associative law is replaced by the Jacobi identity. Lie algebras abstract the essential nature of infinitesimal transformations, and have become ubiquitous in mathematics.

There are other specific types of non-associative structures that have been studied in depth. They tend to come from some specific applications. Some of these arise in combinatorial mathematics. Other examples: Quasigroup, Quasifield, Nonassociative ring.

### Notation for non-associative operations

In general, parentheses must be used to indicate the order of evaluation if a non-associative operation appears more than once in an expression. However, mathematicians agree on a particular order of evaluation for several common non-associative operations. This is simply a notational convention to avoid parentheses.

A **left-associative** operation is a non-associative operation that is conventionally evaluated from left to right, i.e.,

- $$

\left.
\begin{matrix}
x*y*z=(x*y)*z\qquad\qquad\quad\,
\\
w*x*y*z=((w*x)*y)*z\quad
\\
\mbox{etc.}\qquad\qquad\qquad\qquad\qquad\qquad\ \ \,
\end{matrix}
\right\}
\mbox{for all }w,x,y,z\in S
while a **right-associative** operation is conventionally evaluated from right to left:

- $$

\left. \begin{matrix} x*y*z=x*(y*z)\qquad\qquad\quad\, \\ w*x*y*z=w*(x*(y*z))\quad \\ \mbox{etc.}\qquad\qquad\qquad\qquad\qquad\qquad\ \ \, \end{matrix} \right\} \mbox{for all }w,x,y,z\in S Both left-associative and right-associative operations occur. Left-associative operations include the following:

- Subtraction and division of real numbers:

- $x-y-z=(x-y)-z\backslash qquad\backslash mbox\{for\; all\; \}x,y,z\backslash in\backslash mathbb\{R\};$
- $x/y/z=(x/y)/z\backslash qquad\backslash qquad\backslash quad\backslash mbox\{for\; all\; \}x,y,z\backslash in\backslash mathbb\{R\}\backslash mbox\{\; with\; \}y\backslash ne0,z\backslash ne0.$

- Function application:

- $(f\; \backslash ,\; x\; \backslash ,\; y)\; =\; ((f\; \backslash ,\; x)\; \backslash ,\; y)$

- This notation can be motivated by the currying isomorphism.

Right-associative operations include the following:

- Exponentiation of real numbers:

- $x^\{y^z\}=x^\{(y^z)\}.\backslash ,$

- The reason exponentiation is right-associative is that a repeated left-associative exponentiation operation would be less useful. Multiple appearances could (and would) be rewritten with multiplication:

- $(x^y)^z=x^\{(yz)\}.\backslash ,$

- $\backslash mathbb\{Z\}\; \backslash rarr\; \backslash mathbb\{Z\}\; \backslash rarr\; \backslash mathbb\{Z\}\; =\; \backslash mathbb\{Z\}\; \backslash rarr\; (\backslash mathbb\{Z\}\; \backslash rarr\; \backslash mathbb\{Z\})$
- $x\; \backslash mapsto\; y\; \backslash mapsto\; x\; -\; y\; =\; x\; \backslash mapsto\; (y\; \backslash mapsto\; x\; -\; y)$

- Using right-associative notation for these operations can be motivated by the Curry-Howard correspondence and by the currying isomorphism.

Non-associative operations for which no conventional evaluation order is defined include the following.

- Taking the Cross product of three vectors:

- $\backslash vec\; a\; \backslash times\; (\backslash vec\; b\; \backslash times\; \backslash vec\; c)\; \backslash neq\; (\backslash vec\; a\; \backslash times\; \backslash vec\; b\; )\; \backslash times\; \backslash vec\; c\; \backslash qquad\; \backslash mbox\{\; for\; some\; \}\; \backslash vec\; a,\backslash vec\; b,\backslash vec\; c\; \backslash in\; \backslash mathbb\{R\}^3$

- Taking the pairwise average of real numbers:

- $\{(x+y)/2+z\backslash over2\}\backslash ne\{x+(y+z)/2\backslash over2\}\; \backslash qquad\; \backslash mbox\{for\; all\; \}x,y,z\backslash in\backslash mathbb\{R\}\; \backslash mbox\{\; with\; \}x\backslash ne\; z.$

- Taking the relative complement of sets $(A\backslash backslash\; B)\backslash backslash\; C$ is not the same as $A\backslash backslash\; (B\backslash backslash\; C)$. (Compare material nonimplication in logic.)

## See also

Look up in , the free dictionary.associative property |

- Light's associativity test
- A semigroup is a set with a closed associative binary operation.
- Commutativity and distributivity are two other frequently discussed properties of binary operations.
- Power associativity, alternativity and N-ary associativity are weak forms of associativity.