Nalanda

mathematics / ConceptMTH-CN-003

Commutative, associative, and distributive structure

The commutative, associative, and distributive laws state precisely which rearrangements of an arithmetic expression are guaranteed to leave its value unchanged, and part of what makes an operation interesting is which of these guarantees it fails.

Essence

Some rearrangements of a calculation are free: you can reorder, regroup, or split terms and the answer will not move. Knowing exactly which rearrangements are free turns arithmetic from a fixed sequence of steps into a set of moves you can choose among to make the work easier.

In brief

Adding seventeen and twenty five in your head is easier if you add twenty five and seventeen instead, or if you break seventeen into ten plus seven and add each piece separately. Both moves feel harmless, and they are, but the reason they are harmless is not obvious: nothing forces an operation to tolerate reordering or splitting. This entry names exactly which rearrangements are guaranteed to preserve a result, calling them the commutative, associative, and distributive laws, and treats them not as rules to memorize but as properties an operation happens to have, properties that could in principle be absent, and sometimes are.

The full treatment

First look: rearranging a pile of stones

Lay out three stones, then four stones, then five stones in a row and count the total. Now rearrange the same stones into a group of four, then three, then five, and count again. The total does not change, and neither would it change for any other order you tried. This is worth pausing on: the physical act of counting does not care what order you group the stones in, because counting only asks how many stones are present, not what sequence you touched them in. That invariance under reordering is the seed of the commutative and associative laws, before either has a name or a symbol.

Building the idea: three separate guarantees

Three distinct rearrangements turn out to be free for addition and for multiplication, and it is worth keeping them apart because they answer three different questions.

The commutative law answers: does the order of the two things being combined matter? For addition, a plus b equals b plus a, for any quantities a and b: three plus four equals four plus three. For multiplication, a times b equals b times a.

The associative law answers: when combining three or more things, does the order in which you group your pairwise combinations matter? For addition, the quantity a plus b, then combined with c, equals a combined with the quantity b plus c, written (a plus b) plus c equals a plus (b plus c). You can add the first two numbers first, or the last two, and land on the same total.

The distributive law answers a different kind of question: when one operation is applied across a group already combined by another operation, does it matter whether you combine first and then apply the second operation, or apply the second operation to each piece first and then combine? Concretely, a times the quantity (b plus c) equals (a times b) plus (a times c). Multiplying a sum is the same as multiplying each addend and then summing the products.

Why the distributive law is a geometric fact, not an accident

Draw a rectangle of width a and height (b plus c), where the height is subdivided into a piece of length b and a piece of length c. The whole rectangle's area is a times (b plus c). But you can also compute the area as two smaller rectangles stacked on top of each other, one of width a and height b, contributing a times b, and one of width a and height c, contributing a times c, and the total area is the sum of these two pieces, (a times b) plus (a times c). Since both descriptions compute the area of the exact same physical rectangle, the two expressions must be equal. This is not a rule imposed on multiplication from outside, it is a direct consequence of what area means and what it means to subdivide a shape, and it is essentially the proof Euclid gives geometrically in Book II of the Elements.

The formal model: an operation can lack these properties

None of these three laws is automatic for every operation you might define. Subtraction is not commutative: five minus three does not equal three minus five (two versus negative two), so order matters. Subtraction is not associative either: (ten minus five) minus two equals three, but ten minus (five minus two) equals seven, so grouping matters. This matters because it shows the commutative and associative laws are genuine properties of addition and multiplication specifically, discovered by checking whether reordering or regrouping changes the result, not general facts about all arithmetic operations. An operation earns the label "commutative" or "associative" only by being tested against the definition and found to satisfy it; the labels are not free.

Derivation: using the laws to simplify a real calculation

Compute 17 times 8 in your head. Rather than multiplying directly, use the distributive law in reverse: rewrite 17 as (10 plus 7), so 17 times 8 equals (10 plus 7) times 8, which by the distributive law equals (10 times 8) plus (7 times 8), that is, 80 plus 56, equals 136. Each step is licensed by a named law: splitting 17 into 10 plus 7 changes nothing because addition just recombines them; applying the distributive law to expand the product is guaranteed to preserve the value; and the final addition can be performed in either order, by the commutative law, without affecting the answer. The calculation was restructured into two easier pieces, and every restructuring step is backed by an explicit guarantee, not by hope.

Lineage

The distributive law appears geometrically in Euclid's Elements, Book II, proved through the subdivision of rectangles centuries before algebraic notation existed to state it symbolically. Practical use of commuting and regrouping sums and products is at least as old, present wherever merchants and accountants reordered tallies for convenience. The explicit, symbolic statement of these laws as general properties of arithmetic, separable from any particular numbers, took shape in the early nineteenth century, notably in George Peacock's attempt to place algebra on a rigorous symbolic footing. That same century produced the sharpest illustration of these laws' limits: William Rowan Hamilton's 1843 discovery of the quaternions, a number-like system in which multiplication is associative but not commutative, proved that commutativity is a genuine, checkable property of a system rather than a necessary feature of all algebra.

The strongest case for it

These three laws earn their keep because they license every technique for restructuring a calculation to make it easier or more revealing, mental arithmetic shortcuts, factoring and expanding algebraic expressions, and rearranging long sums or products in a spreadsheet or a proof. Every time a student is told they may add a list of numbers in whatever order is convenient, or expand a bracketed expression term by term, the commutative, associative, and distributive laws are the reason that freedom is legitimate rather than a lucky habit. Their reach extends far past arithmetic: they are exactly the properties that define what mathematicians call a commutative ring, and checking whether a new mathematical system, matrices, functions, symmetries, satisfies or fails each law is one of the first and most informative questions asked about it.

The strongest case against it

The central danger is assuming these laws apply universally when they are, in fact, specific properties that must be checked for each operation and each mathematical system. Subtraction and division fail commutativity and associativity, as shown above, and learners who overgeneralize "you can rearrange things" from addition to subtraction produce systematically wrong answers, for instance computing ten minus five minus two as ten minus three by grouping the last two terms incorrectly. Matrix multiplication, encountered later, is associative but generally not commutative, order of multiplication changes the result, which surprises anyone who assumed commutativity was a fact about multiplication itself rather than a fact about multiplication of ordinary numbers specifically. The honest boundary is this: commutativity, associativity, and distributivity are properties an operation may have, verified case by case, never properties to assume by default once you leave the safety of ordinary addition and multiplication of numbers.

Where it stands now

The commutative, associative, and distributive laws for the addition and multiplication of numbers are settled beyond dispute, provable directly from the construction of the number systems in question. Their real ongoing relevance is as a template: modern algebra is substantially organized around asking, for any new operation or system encountered, which of these three properties it satisfies, and the answer to that question is often the single most useful fact you can learn about an unfamiliar mathematical structure.

Test yourself

A shopkeeper needs to compute the total cost of an order: 6 units at 25 each, plus 6 units at 15 each. Show two different ways to compute this total, one that adds the two products directly, and one that uses the distributive law to combine the 25 and 15 before multiplying by 6, and confirm both give the same answer. Then construct your own example, using subtraction instead of addition inside a similar bracketed expression with a multiplier outside, and show explicitly that distributing the multiplier across a difference still works, while showing separately why swapping the order of a subtraction inside such an expression does change the result. State precisely which law justifies the first move and which failure of a law explains the second.

Primary sources and further reading

  • Euclid, Elements, Book II (-300)Geometric proofs of what is now called the distributive law, expressed through the area of a subdivided rectangle.
  • George Peacock, A Treatise on Algebra (1830)An early explicit formulation of the laws governing arithmetic operations as a general symbolic system.
  • Charles C. Pinter, A Book of Abstract Algebra (1990)Modern treatment of commutativity, associativity, and distributivity as structural properties an operation may or may not have.
Commutative, associative, and distributive structure · Nalanda