Motivation

The Falling-Tiles Picture

Imagine a long row of thin rectangular tiles standing on their edges, close enough together that if one tips it knocks over its neighbour. If the very first tile is pushed, when are we guaranteed that every tile in the row eventually falls? Exactly when two conditions both hold:

• the first tile falls, and
• whenever some tile falls, it necessarily knocks down the tile right after it.

Together these two facts guarantee the toppling never stops partway — tile 1 falls, which forces tile 2 to fall, which forces tile 3, and so on without end. This simple physical picture is exactly the logical skeleton of mathematical induction: a starting fact, plus a rule that carries truth from one step to the next, together certify the whole infinite chain.

The Natural Numbers as the Smallest Inductive Set

This idea can be made precise inside the real numbers $\mathbb{R}$. Call a subset $S \subseteq \mathbb{R}$ an inductive set if it satisfies the same two "falling tile" conditions numerically:

The set of natural numbers $\mathbb{N} = \{1, 2, 3, \ldots\}$ is itself inductive, and in fact it is the smallest inductive subset of $\mathbb{R}$ — any inductive subset of $\mathbb{R}$ must contain all of $\mathbb{N}$. This is the deep reason mathematical induction works at all: proving "$P(1)$ holds" together with "$P(k)$ true $\implies P(k+1)$ true" is precisely showing that the set of integers for which $P(n)$ holds is an inductive set — and since $\mathbb{N}$ is the smallest such set, that set must in fact be all of $\mathbb{N}$.

A Motivating Illustration

Suppose, from checking small cases, we suspect that

$1 + 2 + 3 + \cdots + n = \frac{n(n+1)}{2}.$ …