##  [Associative Law](/associative-law-2) 

 Definition

The algebraic property of a binary operation whereby the grouping (parenthesization) of operands does not change the result: for all a, b, c in the domain, (a·b)·c = a·(b·c).

 

 

 

 

 

 





## Principle

Principle

If an operation is associative, any finite sequence of operands can be combined without reference to parentheses; the operation defines a coherent n-ary composition independent of grouping.

 

 

 

 

 





## Demonstration

Demonstration

Addition of real numbers: (1+2)+3 = 1+(2+3) = 6. Matrix multiplication is associative: (AB)C = A(BC) for conformable matrices. Function composition is associative: (f∘g)∘h = f∘(g∘h).

 

 

 

 

## Misapplication

Misapplication

Treating subtraction or ordinary division as associative and rewriting (a−b)−c as a−(b−c) without checking leads to incorrect results; also assuming an operation on a new structure is associative without proof.

 

 

 

 

 





## Consequence

Consequence

Associativity permits omission of parentheses when writing long products, enables the definition of semigroups and monoids, and supports inductive definitions and algorithms that combine terms in arbitrary pairings.

 

 

 

 

## Reversal

Reversal

Non-associative operations (e.g., subtraction on numbers, certain binary operations defined on loops, or the multiplication in some nonassociative algebras) depend on explicit grouping: (a·b)·c may differ from a·(b·c).

 

 

 

 

 





## Boundary

Boundary

Applies to a given binary operation on a specified set; it does not imply commutativity or distributivity and does not automatically extend to mixed operations. Associativity may hold for some elements and fail for others (partial associativity).

 

 

 

 

 





## Semantic Tension

Semantic Tension

Often conflated with commutativity (order invariance): associativity concerns grouping, commutativity concerns order. In category theory a weaker, coherence-based form of associativity appears (associator morphisms) rather than strict equality.

 

 

 

 

 





## Synthesis

Synthesis

Associative Law states that for a specific binary operation on a set, the outcome of combining several operands is independent of how they are parenthesized, enabling consistent multi-operand composition and algebraic structures built from repeated application of the operation.