Associative Law

In mathematics, the associative property is a property of some binary operations, which means that rearranging the parentheses in an expression will not change the result. 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 (after rewriting the expression with parentheses and in infix notation if necessary), rearranging the parentheses in such an expression will not change its value. Consider the following equations:

$\begin (2 + 3) + 4 &= 2 + (3 + 4) = 9 \,\\ 2 \times (3 \times 4) &= (2 \times 3) \times 4 = 24 . \end$

Even though the parentheses were rearranged on each line, the values of the expressions were not altered. Since this holds true when performing addition and multiplication on any real numbers, it can be said that "addition and multiplication of real numbers are associative operations".

Associativity is not the same as commutativity, which addresses whether the order of two operands affects the result. For example, the order does not matter in the multiplication of real numbers, that is, , so we say that the multiplication of real numbers is a commutative operation. However, operations such as function composition and matrix multiplication are associative, but (generally) not commutative.

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. In contrast to the theoretical properties of real numbers, the addition of floating point numbers in computer science is not associative, and the choice of how to associate an expression can have a significant effect on rounding error.

Definition

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

Here, ∗ is used to replace the symbol of the operation, which may be any symbol, and even the absence of symbol (juxtaposition) as for multiplication.

The associative law can also be expressed in functional notation thus: .

Generalized associative law

If a binary operation is associative, repeated application of the operation produces the same result regardless of how valid pairs of parentheses are inserted in the expression. This is called the generalized associative law. For instance, a product of four elements may be written, without changing the order of the factors, in five possible ways:

*
*
*
*
*

If the product operation is associative, the generalized associative law says that all these expressions will yield the same result. So unless the expression with omitted parentheses already has a different meaning (see below), the parentheses can be considered unnecessary and "the" product can be written unambiguously as

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

An example where this does not work is the logical biconditional . It is associative; thus, is equivalent to , but most commonly means , which is not equivalent.

Examples

Some examples of associative operations include the following.

\mboxx,y,z\in\mathbb.

, 6= Taking the intersection or the union of sets:
$\left. \begin (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 \right\}\mboxA,B,C.$
, 7= If is some set and denotes the set of all functions from to , then the operation of function composition on is associative:$(f\circ g)\circ h=f\circ(g\circ h)=f\circ g\circ h\qquad\mboxf,g,h\in S.$
, 8= Slightly more generally, given four sets , , and , with , , and , then

$(f\circ g)\circ h=f\circ(g\circ h)=f\circ g\circ h$

as before. In short, composition of maps is always associative.
, 9= In category theory, composition of morphisms is associative by definition. Associativity of functors and natural transformations follows from associativity of morphisms.
, 10= Consider a set with three elements, , , and . The following operation:

is associative. Thus, for example, . This operation is not commutative.
, 11= Because matrices represent linear functions, and matrix multiplication represents function composition, one can immediately conclude that matrix multiplication is associative.
, 12= For real numbers (and for any totally ordered set), the minimum and maximum operation is associative: $\max(a, \max(b, c)) = \max(\max(a, b), c) \quad \text \quad \min(a, \min(b, c)) = \min(\min(a, b), c).$

Propositional logic

Rule of replacement

In standard truth-functional propositional logic, ''association'', or ''associativity'' are two valid rules of replacement. The rules allow one to move parentheses in logical expressions in logical proofs. The rules (using logical connectives notation) are:

$(P \lor (Q \lor R)) \Leftrightarrow ((P \lor Q) \lor R)$

and

$(P \land (Q \land R)) \Leftrightarrow ((P \land Q) \land R),$

where "$\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 (and their converses, since is commutative) are truth-functional tautologies.

;Associativity of disjunction
:$((P \lor Q) \lor R) \leftrightarrow (P \lor (Q \lor R))$
;Associativity of conjunction
:$((P \land Q) \land R) \leftrightarrow (P \land (Q \land R))$
;Associativity of equivalence
:$((P \leftrightarrow Q) \leftrightarrow R) \leftrightarrow (P \leftrightarrow (Q \leftrightarrow R))$

Joint denial is an example of a truth functional connective that is ''not'' associative.

Non-associative operation

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

$(x*y)*z\ne x*(y*z)\qquad\mboxx,y,z\in S.$

For such an operation the order of evaluation ''does'' matter. For example:
; Subtraction
:$(5-3)-2 \, \ne \, 5-(3-2)$
; Division
:$(4/2)/2 \, \ne \, 4/(2/2)$
; Exponentiation
:$2^ \, \ne \, (2^1)^2$
; Vector cross product
:$\begin \mathbf \times (\mathbf \times \mathbf) &= \mathbf \times \mathbf = -\mathbf \\ (\mathbf \times \mathbf) \times \mathbf &= \mathbf \times \mathbf = \mathbf \end$

Also although addition is associative for finite sums, it is not associative inside infinite sums ( series). 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+1)+\dots = 1.$

Some non-associative operations are fundamental in mathematics. They appear often as the multiplication in structures called non-associative algebras, which have also an addition and a scalar multiplication. Examples are the octonions and Lie algebras. In Lie algebras, the multiplication satisfies Jacobi identity instead of the associative law; this allows abstracting the algebraic nature of infinitesimal transformations.

Other examples are quasigroup, quasifield, non-associative ring, and commutative non-associative magmas.

Nonassociativity of floating point calculation

In mathematics, addition and multiplication of real numbers is associative. By contrast, in computer science, the addition and multiplication of floating point numbers is ''not'' associative, as rounding errors are introduced when dissimilar-sized values are joined together.

To illustrate this, consider a floating point representation with a 4-bit mantissa:

Even though most computers compute with 24 or 53 bits of mantissa, this is an important source of rounding error, and approaches such as the Kahan summation algorithm are ways to minimise the errors. It can be especially problematic in parallel computing.

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 (unless the notation specifies the order in another way, like $\dfrac$). 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 x*y*z=(x*y)*z\qquad\qquad\quad\, \\ w*x*y*z=((w*x)*y)*z\quad \\ \mbox\qquad\qquad\qquad\qquad\qquad\qquad\ \ \, \end \right\} \mboxw,x,y,z\in S$

while a right-associative operation is conventionally evaluated from right to left:

$\left. \begin x*y*z=x*(y*z)\qquad\qquad\quad\, \\ w*x*y*z=w*(x*(y*z))\quad \\ \mbox\qquad\qquad\qquad\qquad\qquad\qquad\ \ \, \end \right\} \mboxw,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"Using Order of Operations and Exploring Properties"
section 9. Virginia Department of Education.Bronstein, '' :de:Taschenbuch der Mathematik'', pages 115-120, chapter: 2.4.1.1,
:$x-y-z=(x-y)-z$
:$x/y/z=(x/y)/z$
; Function application
:$(f \, x \, y) = ((f \, x) \, y)$
This notation can be motivated by the currying isomorphism, which enables partial application.

Right-associative operations include the following:
; Exponentiation of real numbers in superscript notation
:$x^=x^$

Exponentiation is commonly used with brackets or right-associatively because a repeated left-associative exponentiation operation is of little use. Repeated powers would mostly be rewritten with multiplication:

:$(x^y)^z=x^$

Formatted correctly, the superscript inherently behaves as a set of parentheses; e.g. in the expression $2^$ the addition is performed

before the exponentiation despite there being no explicit parentheses $2^$ wrapped around it. Thus given an expression such as $x^$, the full exponent $y^z$ of the base $x$ is evaluated first. However, in some contexts, especially in handwriting, the difference between $^z=(x^y)^z$, $x^=x^$ and $x^=x^$ can be hard to see. In such a case, right-associativity is usually implied.

; Function definition
:$\mathbb \rarr \mathbb \rarr \mathbb = \mathbb \rarr (\mathbb \rarr \mathbb)$
:$x \mapsto y \mapsto x - y = x \mapsto (y \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.
; Exponentiation of real numbers in infix notationExponentiation Associativity and Standard Math Notation
Codeplea. 23 August 2016. Retrieved 20 September 2016.
:$(x^\wedge y)^\wedge z\ne x^\wedge(y^\wedge z)$
; Knuth's up-arrow operators
:$a \uparrow \uparrow (b \uparrow \uparrow c) \ne (a \uparrow \uparrow b) \uparrow \uparrow c$
:$a \uparrow \uparrow \uparrow (b \uparrow \uparrow \uparrow c) \ne (a \uparrow \uparrow \uparrow b) \uparrow \uparrow \uparrow c$
; Taking the cross product of three vectors
:$\vec a \times (\vec b \times \vec c) \neq (\vec a \times \vec b ) \times \vec c \qquad \mbox \vec a,\vec b,\vec c \in \mathbb^3$
; Taking the pairwise average of real numbers
:$\ne \qquad \mboxx,y,z\in\mathbb \mboxx\ne z.$
; Taking the relative complement of sets
:$(A\backslash B)\backslash C \neq A\backslash (B\backslash C)$.

(Compare

material nonimplication in logic.)

History

William Rowan Hamilton seems to have coined the term "associative property" around 1844, a time when he was contemplating the non-associative algebra of the octonions he had learned about from John T. Graves.

See also

* Light's associativity test
* Telescoping series, the use of addition associativity for cancelling terms in an infinite series
* A semigroup is a set with an associative binary operation.
* Commutativity and distributivity are two other frequently discussed properties of binary operations.
* Power associativity, alternativity, flexibility and N-ary associativity are weak forms of associativity.
* Moufang identities also provide a weak form of associativity.

References

{{reflist

Properties of binary operations
Elementary algebra
Functional analysis
Rules of inference