Start Learning Numbers 5 | Natural Numbers (Multiplication) [dark version]

Multiplication for natural numbers is built from scratch using a recursive definition: it’s treated as a function that takes two natural numbers and returns a natural number, then its behavior is pinned down by how it acts on 0 and how it changes when one factor increases by 1. The key payoff is that once this definition is fixed, multiplication becomes “well defined” for every pair of natural numbers—without listing infinitely many cases.

The starting point is the idea that writing repeated addition like “5 + 5 + 5 + 5” is tedious, so multiplication is introduced as a shorthand: “5 times 4” corresponds to having five copies of 4. The transcript then handles edge cases to force consistent meaning. If a number occurs once, multiplying by 1 should leave it unchanged (so 1 times 4 equals 4). If a number occurs zero times, the result must be 0, so 0 times 4 is defined as 0.

To define multiplication across all inputs, it’s framed as a map from two natural numbers to one natural number. The definition is recursive, mirroring the earlier approach used for addition. First, the “base case” fixes the value when the first input is 0: 0 times m is 0 for any natural number m. Next comes the “successor step,” which dictates how multiplication behaves when the first input increases from n to n+1. The rule is that (n+1) times m equals (n times m) plus m. An example makes the recursion concrete: if 5 times 2 is the sum of five 2s, then 6 times 2 must be the previous result plus one more 2.

With the recursive definition in place, familiar algebraic properties follow. Parentheses can be rearranged freely in products (associativity), the order of factors can be swapped (commutativity), and 1 acts as the multiplicative identity: 1 times m always equals m. The transcript also emphasizes that 0 plays a parallel role to addition’s identity, since 0 times m is always 0.

Finally, multiplication is connected to addition through the distributive law: n times (m+k) equals n times m plus n times k. A proof by induction on n is sketched. The base case checks n=0, where both sides reduce to 0. The induction step assumes the distributive law holds for n and then shows it holds for n+1 by using the recursive definition of multiplication, substituting the induction hypothesis, and applying commutativity and associativity of addition to regroup terms into the required form.

Overall, multiplication isn’t treated as a pre-given operation; it’s constructed so that it behaves exactly as repeated addition should, while still supporting the standard laws needed for algebraic manipulation.