Domino Chain Animation — Push One, Watch Induction Reach n = 50

Mathematical induction has one image that does more explaining than a thousand words of text: a long line of dominoes. You set them up so that every tile, if knocked, falls into the next. Then you push the first one. What happens next is the engine of every induction proof you will ever write — one tile falls, which knocks the next, which knocks the next, propagating the motion all the way to the end of the chain.

The animation below lets you push the first domino and watch the fall reach n = 50. Each tile represents a statement P(1), P(2), P(3), \dots. The fall of tile k represents P(k) being established. The guarantee that tile k will knock tile k+1 is the inductive step — the conditional P(k) \Rightarrow P(k+1). The push you apply to tile 1 is the base case.

The chain reaction

Kick-start at tile:

Fifty dominoes stand on a baseline. Press "Push" and tile $k$ (default $1$) is kicked with a small angular velocity. Each domino integrates its fall under gravity; when a falling tile hits its neighbour, angular velocity is transferred. The cascade propagates until every tile to the right is down. Slide the kick-start index to launch from anywhere.

What the animation is actually showing

The animation compresses an entire induction proof into two interactions you can see:

The push. This is the base case: you personally knock over tile 1. Before the push, the chain is just a lot of potential. Verifying P(1) is exactly this action — making the first statement actually true rather than hoping it is.
The spacing. Every adjacent pair of tiles is close enough that tile k, when it falls, definitely strikes tile k+1. This is the inductive step: the conditional "if P(k) is true, then P(k+1) is true." You verify this spacing once, for an arbitrary k, and the guarantee extends to every pair at once.

Why one argument covers infinitely many pairs: the spacing argument does not depend on which k you pick. The proof that tile k knocks tile k+1 is the same argument for k = 7 as for k = 42 as for k = 1{,}000. Because the argument is uniform in k, verifying it for one arbitrary k verifies it for all k simultaneously — which is why induction with a base case and a uniform inductive step is enough to establish every P(n) at once.

Together, push + spacing give you every tile. You never personally knock over tile 50. Tile 50 falls because tile 49 knocks it, because tile 48 knocked tile 49, because... going all the way back to your original push on tile 1. The chain transports the base case to every position in the sequence.

Why the picture is not "circular"

A common beginner worry: "If the induction step assumes P(k) and proves P(k+1), isn't that assuming what you want to prove?" The domino picture settles this cleanly. You are not assuming that tile 50 will fall. You are showing that whichever tile just fell, the next one must fall too. That is a local claim about adjacent tiles, not a global claim about where the chain ends. The global claim — tile 50 falls — is an inescapable consequence of the local claim plus the push. It is not an assumption; it is an outcome.

This is why the two pieces of an induction proof are asymmetric. The base case is a specific verification — you check P(1) directly, with whatever hands-on computation the statement requires. The inductive step is a conditional verification — you do not check any particular P(k+1); you check that if P(k) held, then P(k+1) would follow. The first is a fact; the second is a mechanism.

What you can read off the visualisation

Three things the chain shows that are hard to capture in equations alone:

Distance does not matter to induction. The argument that tile 49 falls is not longer or harder than the argument that tile 3 falls. In both cases, you reach the tile by the same local rule applied repeatedly. When you see induction proving a result for n = 10^9, it is not doing 10^9 separate calculations — it is applying one short argument, recursively, to reach whatever n you care about.
Every tile is reached. No tile is skipped. The fall propagates through every index between 1 and 50, in order. This is the sense in which induction proves P(n) for all positive integers n: not by a global argument, but by the guaranteed chain reaching every one.
Break a single link and the chain stops. If one pair of dominoes is spaced too far apart — so tile k falls but does not hit tile k+1 — everything past that point stays upright. That is the failure mode illustrated by the "missing inductive step" variant, and it is why verifying the inductive step for every k (not just some of them) is essential.

The standard induction statement, domino-style

Every induction proof has a standard shape, which in the domino language reads:

(Base case) Push tile 1. Verify that tile 1 has actually fallen.
(Inductive step) Argue that, for an arbitrary k, if tile k has fallen then tile k+1 must also fall.
(Conclusion) By the chain reaction, every tile falls — that is, P(n) holds for all n \geq 1.

Step 1 is direct verification. Step 2 is the conditional argument. Step 3 is what the chain gives you for free. Every successful induction proof is this shape, whether the statement is a summation formula, a divisibility claim, an inequality, or a combinatorial identity.

The one-line takeaway

Induction is the formal name for a chain reaction. The base case lights the first tile; the inductive step guarantees every tile knocks the next; the conclusion is that the whole row falls. If you can see the chain in the animation, you can write the proof.