Putting Together

The numbers you join are called addends; the answer is the sum. An addition sentence records a joining story: 6 ducks on the pond, 2 more land, 6 + 2 = 8. Swapping the addends never changes the sum, because the same objects get counted — only your starting pile differs.

A row of dots shows why. Draw 5 dots, then 3 more. Read the row left to right: 5 + 3. Read it right to left: 3 + 5. Same dots, same total — 8 both times.

You do not need to recount from one. To add 5 + 3, start at 5 — a count you already trust — and count on three more: six, seven, eight. Addition within 20 is counting on, done with control. Choose the larger addend as your start: 2 + 9 goes faster as 9, then ten, eleven.

The swap rule has a name: the commutative property of addition. It earns its keep right there — it lets you turn a slow sum into a fast one before you begin.

Put addition on the number line: a + b means stand at a, then step b to the right. The claim a + b = b + a is now a real statement about two different walks ending at the same point — not obvious, and worth an argument. The dot-row supplies one: a row of a dots followed by b dots is the same row as b dots followed by a, read in reverse, and reversal cannot change how many.

Addition also answers the set question: one bag of a marbles and another of b hold a + b together — provided no marble sits in both bags. That caveat, disjointness, does quiet work; it returns in every careful counting argument you will ever make.

Five crackers and three crackers make one pile. Count the pile: eight. We write 5 + 3 = 8. The plus sign means put together.

Now count the other way. Three first, then five. Still eight. You can add the parts in either order. The whole stays the same.

Define addition recursively from the successor operation S: a + 0 = a, and a + S(b) = S(a + b). Adding b is applying successor b times — counting on, made formal. From these two lines, associativity and commutativity are theorems, each proved by induction; commutativity needs two lemmas first: 0 + a = a and S(a) + b = S(a + b).

The cardinal view: for disjoint finite sets, the union's size is the sum of the sizes. The two views agree — a bijection argument identifies counting on with disjoint union — and that agreement is the honest content of 5 + 3 = 8: any five things and any other three things, together, match any eight things one to one.

In Peano arithmetic the recursion a + 0 = a, a + S(b) = S(a + b) defines addition uniquely — the recursion theorem licenses the definition — and commutativity is a theorem proved by double induction. The proof is not free: in weaker systems such as Robinson's Q, commutativity of addition is unprovable. Induction is exactly the missing power.

Structurally, (ℕ, +, 0) is the free commutative monoid on one generator; disjoint union is the coproduct in the category of finite sets, and cardinality carries coproducts to sums. Pushing two piles of crackers together is computing a coproduct and applying a functor — the same act, described at a different altitude.