Contents

AssociativityEdit

Associativity is a foundational concept in mathematics that governs how binary operations are grouped when applied to more than two operands. In its essence, a binary operation combines two inputs to produce a third, and associativity guarantees that the result does not depend on how we parenthesize a chain of applications. Formally, if * is a binary operation on a set S, then for all a, b, c in S we have (a * b) * c = a * (b * c). This simple law underwrites a great deal of structure across algebra, analysis, and beyond.

The breadth of associativity becomes visible as soon as one moves from single operations to entire systems. When associativity holds, one can freely regroup operations without changing the outcome, which is crucial for defining and manipulating expressions with many factors. This is why familiar operations such as addition and multiplication of integers are associative, and why function composition is treated as a binary operation on the set of all functions. Likewise, matrix multiplication is associative, which supports the standard construction of ring (algebra)-like structures from sets of matrices and enables reliable algebraic manipulation of linear transformations.

In contrast, many operations are not associative, and recognizing this can be a source of subtlety and error. For example, subtraction and division do not satisfy the associativity law in general, as shown by simple counterexamples like (5 - 3) - 2 versus 5 - (3 - 2). Non-associativity also appears in more exotic algebraic systems, such as the octonions, where multiplication is not associative but satisfies weaker properties (for instance, alternativity). These contrasts illuminate how the presence or absence of associativity shapes the available theory and applications of an algebraic system.

Definition and basic properties

  • Formal definition: An operation * on a set S is associative if for all a, b, c in S, (a * b) * c = a * (b * c). This can be written as a general law that applies to any triple of elements. binary operation.
  • Basic consequences: If * is associative and there exists an identity element e in S with a * e = e * a = a for all a in S, then (S, *) is a monoid; if inverses also exist for every element, the structure becomes a group. These ideas are developed within semigroup theory and its extensions.
  • Related properties: Associativity is distinct from commutativity (the order of operands does not matter) and from various forms of weakening or strengthening of the law (such as associativity up to isomorphism in certain categorical frameworks).

Classic examples and non-examples

  • Examples of associative operations:
    • Addition on integers or real numbers: (a + b) + c = a + (b + c). addition
    • Multiplication on numbers: (a · b) · c = a · (b · c). multiplication
    • Function composition: (f ∘ g) ∘ h = f ∘ (g ∘ h). function composition
    • Matrix multiplication: (AB)C = A(BC) for conformable matrices. matrix multiplication
    • String concatenation: (xy)z = x(yz). string concatenation (assuming the concatenation operation is defined as the binary operation)
  • Non-associative examples:

Structures built on associativity

  • Semigroups: sets with an associative binary operation. semigroup
  • Monoids: semigroups with an identity element. monoid
  • Groups: monoids where every element has an inverse. group
  • Rings and algebras: many familiar rings use associative multiplication, enabling a rich interplay between addition and multiplication. ring (algebra)
  • Non-associative generalizations: some systems preserve enough structure to be useful without full associativity, prompting study of non-associative algebra and related notions like alternativity.

Higher-level perspectives

  • Category theory: associativity can be viewed up to isomorphism, and the precise way in which multiple ways of composing morphisms relate is governed by the associator. The coherence of these associators is captured by axioms such as the pentagon axiom and the broader coherence (category theory) principle. category theory associator pentagon axiom
  • Computation and reasoning: associativity allows us to reorder and regroup computations without changing results, which underpins efficient evaluation strategies in algorithms and parallel processing. In programming languages, operator associativity influences how expressions are parsed and evaluated, with practical consequences for both correctness and performance. operator precedence

Historical and practical notes

  • Real-world practice often treats associativity as a given property of the mathematical objects under consideration, but mathematicians routinely examine what happens when associativity is relaxed or replaced by alternative laws. This inquiry leads to a spectrum of algebraic theories with diverse applications in geometry, physics, and computer science. algebra matrix category theory

See also