Play ProofQuest

Induction Ida

MATHEMATICAL INDUCTION

Loading audio…

Press play to listen along. The line being read lights up as you go.

Show full transcript

Loading transcript…

01 Opening
Induction Ida beat 1 of 5

Every year, in the town of Lattice, a special festival took place. Lattice sat in the kingdom's southern hill region. It was a three-day walk from the bustling capital. The locals called their annual celebration the Cascade.

The Cascade was one event. It lasted about thirty seconds.

Each family in Lattice contributed special dominoes. These were crafted from wood, painted in bright colors. They were slightly heavier than typical playing dominoes, designed to tip cleanly. The day before the festival, the entire town gathered in the central square. They worked together, meticulously setting up the dominoes. A single, winding chain snaked through the square. It went around the fountain, along the edges of the market stalls. The chain climbed the steps of the town hall, then descended past the bakery. Laying the full chain took most of an afternoon. The town's current record, set seven years ago, was one thousand four hundred and twelve pieces.

On the festival day, as the sun dipped below the hills, a hush fell over the crowd. The mayor, holding the official honor for that year, stepped forward. He bent down and gently pushed the first domino.

02 Induction Ida
Induction Ida beat 2 of 5

Everything else fell on its own.

A roar rose from the crowd. The town quickly put up bunting, and the bakery sold out of its special festival biscuits. Strangers hugged. Soon, the dominoes were swept away. Plans for next year's Cascade began immediately. Then, the whole town went home.

The Cascade was more than just a festival for Ida. It was the place where she began to understand the world like a mathematician.

Ida's family, the Latticefords, had overseen the Cascade preparations for generations. They were known as the festival-domino-makers. Ida grew up watching her mother carefully arrange long curves of dominoes across the town square. She started helping as soon as she could walk. By age seven, Ida could lay a hundred dominoes on her own. She managed this without accidentally knocking any over. This skill was harder than it seemed. It required a particular knack: setting down the next piece without bumping the one before. You simply could not be in a hurry.

At twelve, Ida was already a careful and capable domino-setter. Yet, she wasn't a mathematician then. That transformation began the year the chain stretched nine hundred and fifty pieces long. It was the year her mother gave her the ultimate honor: she would push the first domino.

It was a tremendous honor, but also a heavy responsibility for Ida. She had spent the entire afternoon laying her own section of the chain. She checked each piece three times, making sure it stood perfectly. At twelve, she was the youngest person to push the first domino in seventeen years.

03 Induction Ida
Induction Ida beat 3 of 5

She bent down at sunset. She pushed the first domino.

It fell into the second. The second fell into the third. The third fell into the fourth.

Ida watched the chain unfold.

In those thirty seconds, Ida watched with intense focus. She saw something with the piercing clarity only a twelve-year-old sometimes possesses. Adults, she realized, often forgot this simple truth. She had pushed only one domino. The other nine hundred and forty-nine had fallen entirely on their own. She hadn't touched them. She hadn't even been close to them. The entire chain, every single piece, had toppled. This happened because the first one fell, and because each domino was placed close enough to the next one to knock it down in turn.

She thought, then and there: That is everything I need to know.

Ida walked home that night, humming a quiet tune. Her sister, Sten, then nine, didn't understand why. Sten, now known as Strong-Induction Sten, had eaten three festival biscuits. At that moment, she simply didn't care about humming.

04 Induction Ida
Induction Ida beat 4 of 5

Ida wrote down what she had figured out, in her own twelve-year-old handwriting, in a notebook her grandmother had given her. The notebook page said:

"To knock down all the dominoes, you only need to do two things:

1. Knock down the first one.

2. Make sure each domino is close enough to the next one to knock it down too.

That's it. The rest happens by itself."

That night, Ida didn't know this principle had a name. She didn't know it was hundreds of years old. She certainly didn't know mathematicians called it induction. They used it to prove things about every natural number. She couldn't have known that in eight years, she would arrive at the ProofQuest academy. There, she would introduce herself by saying, "I am the dominoes person." And the academy master would look up from his notes, a smile on his face, and say, "Oh good. We have been waiting for you."

05 Closing
Induction Ida beat 5 of 5

She just knew, that night in Lattice, that she had figured out something important.

Ida has taught mathematical induction ever since that night. She still returns home for the Cascade each year. She no longer pushes the first domino, as that honor rotates among the townspeople. But she always sets up her share of the chain. She still does not hurry.

And when children come to her class for the first time and ask, nervously, whether the technique called induction is hard, Ida always says the same thing:

"You knock down the first one. You show that each one knocks down the next one. That's all. The rest happens by itself."

She adds, after a small pause:

"It also helps if you don't hurry."

Hear it as an audio drama

A short play starring Induction Ida, from ProofQuest. Different voices, same idea. Listen any time after you read.

Loading audio…

Read the drama script
  1. Narrator: From Spark and Anvil and ProofQuest — this is Ida, in chapter 1 of the ProofQuest cast.
  2. Narrator: This drama uses an AI-generated voice. Voiced via Gemini 2.5.
  3. Narrator: Induction Ida is one of the academy's most clever teachers. Her method is the cleanest in mathematics. You prove that the first thing works, and then you prove that each thing makes the next one work — and you've proven all of them, at once, for free.
  4. Narrator: She is a tall mouse-tween. Bright-eyed. Patient with the setup but quick once the chain starts falling. She carries a long line of small wooden dominoes on a tray. When she tips the first one, the rest fall in turn.
  5. Ida: I am Induction Ida. I teach mathematical induction. To prove a claim is true for every positive integer, I prove two things. One: the claim holds for the smallest case. Two: if the claim holds for some case K, it holds for K plus one. Then it holds for all cases — the dominoes fall in turn.
  6. Narrator: Mathematical induction is a proof technique that establishes a statement about all positive integers in two steps. The base case shows the statement is true for the smallest value, usually one or zero. The inductive step shows that if the statement is true for any value K, then it's true for K plus one. Together, these two steps prove the statement for every positive integer.
  7. Ida: My favorite small example: the sum of the first N positive integers equals N times N plus one all over two. The claim says one plus two plus three plus all the way up to N equals N times N plus one over two. I prove the base case first. For N equals one, the left side is one. The right side is one times two over two, which is one. The base case checks.
  8. Ida: Now the inductive step. Assume the formula works for some K. So one plus two plus all the way to K equals K times K plus one over two. I add K plus one to both sides. The left side becomes one plus two plus all the way to K plus one. The right side becomes K times K plus one over two, plus K plus one. Combine the right side over a common denominator. K times K plus one, plus two times K plus one, all over two. Factor. K plus one times K plus two, all over two. That's the formula for K plus one. Done. The dominoes fall.
  9. Ida: Once the base case is proven, and the inductive step is proven, you don't need to check each integer separately. The dominoes do the work. Number one falls. That tips number two. That tips number three. And so on, forever. The claim is proven for every positive integer at once.
  10. Narrator: Ida grew up in a small village near a long pier. Her family were the wood-stackers. Mice who built towers of small kindling logs and showed children how the first push made the whole tower come down.
  11. Ida: By the time I was eight I had noticed something. If you set up the dominoes correctly — first one falls, each one tips the next — you don't have to push each domino. You just push the first one. The chain takes over.
  12. Narrator: She walked to the ProofQuest academy at sixteen. The mentor Qed met her at the door.
  13. Qed: What is mathematical induction?
  14. Ida: Two steps. Prove the base case — the claim holds for the smallest value. Prove the inductive step — if the claim holds for any value K, it holds for K plus one. Together, those two steps prove the claim for every positive integer. The dominoes do the work. You don't have to check each integer separately.
  15. Qed: You are appointed.
  16. Narrator: Ida has been the academy's induction teacher for years. She still carries the line of dominoes. She begins every first-day lesson the same way.
  17. Ida: I am Induction Ida. Base case. Inductive step. Dominoes fall. That is what induction is. When you need to prove a claim for every positive integer at once, induction is usually the cleanest path. Show the first case works. Show each case implies the next. Done — for all of them.
  18. Ida: Base case. Inductive step. Whole chain. Infinite proof for finite work. That's the whole technique. That's what makes induction induction.
  19. Narrator: You've been listening to a Spark and Anvil chapter, written by the Spark and Anvil writing team for ages 9 to 14.
  20. Narrator: Spark and Anvil is a 501(c)(3) public charity. Apps stay free forever.
  21. Narrator: Curriculum aligned to Common Core math and discrete math.
  22. Narrator: Released under Creative Commons BY-NC-SA 4.0 for educational reuse. Visit Spark and Anvil for the full transcript.

The ProofQuest ensemble

Induction Ida is one of the friends in ProofQuest. Each friend shows you one idea by how they act; meet them all and you have the whole subject.