The algebraic property of a binary operation that swapping the order of the two operands does not change the result: for all a, b in the domain, a·b = b·a.

Principle

Commutativity permits reordering of operands in a binary operation without affecting outcomes; it is the invariance under the transposition of the two inputs.

Demonstration

Real-number addition: 2+5 = 5+2. Scalar multiplication by real numbers commutes with scalar multiplication (ab = ba). In contrast, matrix multiplication generally fails: AB ≠ BA in general.

Misapplication

Assuming operators commute when they do not — for example swapping two noncommuting matrices, or commuting linear operators that act on overlapping subspaces — leads to incorrect simplifications and wrong spectral conclusions.

Consequence

When commutativity holds, expressions can be rearranged to canonical forms, polynomial identities simplify (symmetric polynomials), and algebraic structures like commutative rings arise with simpler ideal theory.

Reversal

Noncommutative operations (e.g., matrix multiplication, composition of some linear maps, operator multiplication in quantum mechanics) require order to be preserved; reversing order can change results and introduce brackets like [A,B] = AB−BA.

Boundary

Applies to a specified binary operation on a set and does not follow from associativity or distributivity. Commutativity may hold elementwise (elements that commute) even if the operation is not globally commutative.

Semantic Tension

Confused with symmetry under all permutations: commutativity is invariance under pairwise swap, while full permutation invariance for many arguments is a stronger property. Also related but distinct from centrality: an element commuting with all others vs global commutativity.

Synthesis

Commutative Law states that for a given binary operation the order of the two operands can be exchanged without changing the result, enabling reordering, symmetric simplifications, and specific algebraic theories when global commutativity holds.