# Associative property

# Associative property

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, (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:

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 or not the order of two operands changes the result. For example, the order does not matter in the multiplication of real numbers, that is, *a* × *b* = *b* × *a*, so we say that the multiplication of real numbers is a commutative operation.

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 *S* is called **associative** if it satisfies the **associative law**:

- (

*x*∗

*y*) ∗

*z*=

*x*∗ (

*y*∗

*z*) for all

*x*,

*y*,

*z*in

*S*.

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.

- (

*xy*)

*z*=

*x*(

*yz*) =

*xyz*for all

*x*,

*y*,

*z*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 of how valid pairs of parentheses are inserted in the expression.^{[2]} 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 formulas will yield the same result. So unless the formula 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 thelogical biconditional. It is associative, thus A(BC) is equivalent to (AB)C, but ABC most commonly means (AB and BC), which is not equivalent.`

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.,

The trivial operation

*x*∗*y*=*x*(that is, the result is the first argument, no matter what the second argument is) is associative but not commutative. Likewise, the trivial operation*x*∘*y*=*y*(that is, the result is the second argument, no matter what the first argument is) is associative but not commutative.Addition and multiplication of complex numbers and quaternions are 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.

Taking the intersection or the union of sets:

If

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

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

- 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 operation is not commutative.

Because matrices represent linear functions, and matrix multiplication represents function composition, one can immediately conclude that matrix multiplication is associative.

^{[3]}

Propositional logic

Rule of replacement

In standard truth-functional propositional logic, *association*,^{[4]}^{[5]} or *associativity*^{[6]} 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:

and

`where "" is ametalogicalsymbolrepresenting "can be replaced in aproofwith."`

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. ^{[7]}

**Associativity of disjunction**:

**Associativity of conjunction**:

**Associativity of equivalence**:

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

Non-associative operation

`A binary operationon a set`

*S*that does not satisfy the associative law is called**non-associative**. Symbolically,For such an operation the order of evaluation *does* matter. For example:

Subtraction

Division

Exponentiation

Also note that infinite sums are not generally associative, for example:

whereas

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; these tend to come from some specific applications or areas such as combinatorial mathematics. Other examples are Quasigroup, Quasifield, Non-associative ring, Non-associative algebra 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.^{[8]}

To illustrate this, consider a floating point representation with a 4-bit mantissa: (1.0002×20 + 1.0002×20) + 1.0002×24 = 1.0002×21 + 1.0002×24 = 1.0012×24 1.0002×20 + (1.0002×20 + 1.0002×24) = 1.0002×20 + 1.0002×24 = 1.0002×24

Even though most computers compute with a 24 or 53 bits of mantissa,^{[9]} 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.^{[10]}^{[11]}

Notation for non-associative operations

`In general, parentheses must be used to indicate theorder of evaluationif a non-associative operation appears more than once in an expression (unless the notation specifies the order in another way, like). However,mathematiciansagree 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.,

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

Both left-associative and right-associative operations occur. Left-associative operations include the following:

Subtraction and division of real numbers:

^{[12]}^{[13]}^{[14]}^{[15]}^{[16]}

Function application:

Right-associative operations include the following:

Exponentiation of real numbers in superscript notation:

- 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:

- Formatted correctly, the superscript inherently behaves as a set of parentheses; e.g. in the expressionthe addition is performedbeforethe exponentiation despite there being no explicit parentheseswrapped around it. Thus given an expression such as, the full exponentof the baseis evaluated first. However, in some contexts, especially in handwriting, the difference between,andcan be hard to see. In such a case, right-associativity is usually implied.

Function definition

- Using right-associative notation for these operations can be motivated by theCurry-Howard correspondenceand by thecurryingisomorphism.

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

Exponentiation of real numbers in infix notation:

^{[17]}

Knuth's Up-arrow operators:

Taking the cross product of three vectors:

Taking the pairwise average of real numbers:

Taking the relative complement of sets is not the same as . (Compare material nonimplication in logic.)

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 a 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

*Algebra*(1st ed.). Springer. p. 24. ISBN 978-0387905181. Definition 1.1 (i) a(bc) = (ab)c for all a, b, c in G.

*Modern Algebra: an Introduction*(3rd ed.). New York: Wiley. p. 78. ISBN 978-0-471-51001-7. If are elements of a set with an associative operation, then the product is unambiguous; this is, the same element will be obtained regardless of how parentheses are inserted in the product

*IEEE Standard for Floating-Point Arithmetic*. IEEE. doi:10.1109/IEEESTD.2008.4610935. ISBN 978-0-7381-5753-5. IEEE Std 754-2008.

*Effects of Floating-Point non-Associativity on Numerical Computations on Massively Multithreaded Systems*(PDF), retrieved 2014-04-08

*ACM Computing Surveys*.

**23**(1): 5–48. doi:10.1145/103162.103163. Retrieved 2016-01-20. ([2], [3])