Play ProofQuest

Strong-Induction Sten

STRONG INDUCTION

A story read by Strong-Induction Sten

Loading audio…

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

Show full transcript

Loading transcript…

01 Opening
Strong-Induction Sten beat 1 of 5

Strong-Induction Sten is, as the chapter title suggests, the kind of person who inherits things.

He inherited his nose from his father. He inherited his height from his mother. He inherited his love of festival biscuits from his grandfather. He inherited his belief that you should use everything you already have from a series of older cousins who pointed out, repeatedly, throughout his childhood, that there was a perfectly good library at the end of the street.

This is a chapter about why Sten became the kind of mathematician he is.

Sten was, as the previous chapter mentioned, three years younger than his sister Ida. He grew up in the same town (Lattice), in the same family (Latticeford), in the same domino-festival tradition. He helped set up the Cascade every year. He pushed the first domino at fifteen, which was a great honour, and he too watched the whole chain fall, and he too noticed that he had only pushed one piece.

02 Strong-Induction Sten
Strong-Induction Sten beat 2 of 5

He thought: Yes. I see why Ida likes this.

But Sten also noticed, that day and other days, that his sister's domino technique had a particular shape. She only used the previous one. She knocked down domino k, and domino k knocked down domino k+1, and the rest happened by itself.

Sten thought, watching her work: That's fine. But what about the dominoes she already knocked down?

This will sound like a small thought. It was not small.

What Sten realised — and he realised it slowly, over the course of several years — was that when you are proving things about, say, the natural numbers, by the time you are trying to prove the case for n=10, you have already proved n=1, n=2, n=3, ..., n=9. They are already established. You are allowed to use them. All of them.

Ida's technique used the previous one. Sten thought: Why not use all of them?

03 Strong-Induction Sten
Strong-Induction Sten beat 3 of 5

He brought this up at the dinner table when he was sixteen.

Ida (who was nineteen and home from her first year at the academy) said: "You can. It's allowed. It's just a different version of the technique. It's called strong induction."

Sten said: "How is that different?"

Ida said: "In ordinary induction, you only assume the case for k. In strong induction, you assume the cases for everything up to k. It's still valid. Some proofs need it. Most don't."

Sten said: "Why would anyone NOT use the strong version?"

Ida said: "Because it isn't always necessary."

04 Strong-Induction Sten
Strong-Induction Sten beat 4 of 5

Sten said: "It isn't always necessary, but it's never wrong. So I'd just use it."

Ida said: "You're allowed to. Most mathematicians don't, because it feels heavier."

Sten said: "It only feels heavier."

Their mother (who was excellent at deflecting domino arguments at the dinner table) suggested they pass the bread.

Sten went on to study mathematics, like his sister. He arrived at the ProofQuest academy three years after Ida did. He introduced himself by saying, "Hello. I am the dominoes-but-also-everything-already-fallen person." The academy master said, "Oh. We have your sister. Are you also the dominoes person?" Sten said, "Yes. But I assume more." The academy master, who had been at the academy for a long time, immediately understood and hired him.

Sten teaches strong induction. He is the cast member who, when proving something about case k+1, gets to use every previously-proven case. This is occasionally exactly what a proof requires. There are theorems — about the structure of prime numbers, about the depth of certain trees, about the way certain recursive algorithms terminate — that cannot be proved by ordinary induction at all. They need strong induction. Sten teaches all of them.

05 Closing
Strong-Induction Sten beat 5 of 5

He is, in person, mildly relaxed. He says "obviously" a lot, which is sometimes annoying but is usually accurate. He believes — and has said, more than once, in front of his sister — that strong induction is just induction, but with more friends in the room.

Ida finds this analogy slightly grumpy.

She finds it more grumpy because it is correct.

Sten and Ida are very close. They write letters when they are at different academies. (Sten now teaches at the southern branch; Ida at the central.) Their letters are warm and full of next case discussions. They send each other interesting recursion problems. They argue about whose technique is more elegant (Ida says ordinary; Sten says strong; neither has changed her or his mind). Their mother, who is now seventy-two and still runs the family domino business in Lattice, considers this argument the only thing her children ever fight about.

At the next Cascade festival, both of them will be home. They will set up their share of the chain — Ida's careful, Sten's slightly faster — and they will help the youngest cousin push the first domino, and they will watch the chain fall, and afterward they will go to the bakery and eat festival biscuits and continue arguing about which kind of induction is the real one.

Their mother has, by now, learned to bring earplugs.

Hear it as an audio drama

A short play starring Strong-Induction Sten, 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 Sten, in chapter 1 of the ProofQuest cast.
  2. Narrator: This drama uses an AI-generated voice. Voiced via Gemini 2.5.
  3. Narrator: Strong-Induction Sten is Ida's older cousin. He uses the same domino setup, but with one important difference. When proving the K-plus-one case, he gets to assume the claim holds for every value up to K — not just for K itself. That extra assumption opens proofs that ordinary induction can't reach.
  4. Narrator: He is a tall raven-tween. Calm. Methodical. He wears a long coat with many small pockets, each pocket holding a card from a previous step. The whole stack of prior steps is available when he proves the next one.
  5. Sten: I am Strong-Induction Sten. I teach strong induction. To prove a claim for every positive integer, I show the base case — and then I show that if the claim holds for every value up to and including K, it holds for K plus one. I get to use everything I've already proved. That extra power lets me reach claims ordinary induction would miss.
  6. Narrator: Strong induction is a variant of mathematical induction. Where ordinary induction assumes the claim for one value K, strong induction assumes it for all values up to K. The two are logically equivalent — anything provable by one is provable by the other — but strong induction is often more convenient when the inductive step needs to refer back to earlier values, not just the immediately preceding one.
  7. Sten: My method has two steps, just like Ida's. Step one: prove the base case. Step two: prove that if the claim holds for one, two, three, all the way up to K, then it holds for K plus one. The difference from Ida is what you get to assume — all prior values, not just the most recent.
  8. Sten: My favorite example is the fundamental theorem of arithmetic. The claim: every integer greater than one can be written as a product of primes. The base case is two. Two is prime. Done. Now the inductive step. Assume every integer between two and K can be written as a product of primes. Consider K plus one. If K plus one is prime, done. If K plus one is not prime, it can be written as A times B where both A and B are integers between two and K. By the assumption, both A and B can be written as products of primes. So K plus one is a product of primes too. Done.
  9. Sten: Notice what I did. I needed the assumption to hold for A and B — neither of which is necessarily K. Ordinary induction only gives me K. Strong induction gives me everything up to K. That's the extra power.
  10. Narrator: Sten grew up in the same village as Ida. His family were the bridge-builders. Ravens who built each span by drawing on every span they had built before — the rules, the materials, the joints, the testing.
  11. Sten: By the time I was nine I had noticed something. Some proofs needed only the previous step. Some needed any earlier step. The dominoes still fell, but the next domino had to know about the whole line behind it.
  12. Narrator: He flew to the ProofQuest academy at sixteen. The mentor Qed met him at the door.
  13. Qed: What is strong induction?
  14. Sten: Base case, then inductive step that gets to assume the claim for every prior value, not just the most recent. The dominoes still fall, but the next one can refer back to any previous one. The fundamental theorem of arithmetic is the classic example. Splitting K plus one into A times B requires the assumption to hold for arbitrary smaller values.
  15. Qed: You are appointed.
  16. Narrator: Sten has been the academy's strong-induction teacher for years. He still wears the coat with the pocket cards. He begins every first-day lesson the same way.
  17. Sten: I am Strong-Induction Sten. Base case. Then assume all the way up to K. Then prove K plus one. That is what strong induction is. When the proof of one step needs the proof of an earlier step that's not necessarily the immediate predecessor — that's when you reach for me. Strong induction gives you everything previous, all at once.
  18. Sten: Base case. Strong assumption. Inductive step. Reach back as far as you need. That's the whole technique. That's what makes strong induction strong.
  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: 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.

More stories with Strong-Induction Sten

Another short audio story about Strong-Induction Sten. Open one when you are ready.

Strong induction

Loading audio…

Read the script
  1. Narrator: From Spark and Anvil and ProofQuest — this is Strong-Induction Sten, in chapter 1 of the ProofQuest cast.
  2. Narrator: This drama uses an AI-generated voice. Voiced via Gemini 2.5.
  3. Narrator: Strong-Induction Sten is the kind of person who inherits things. He grew up watching his sister Ida’s dominoes fall, one after the other.
  4. Strong-Induction Sten: I am Sten. My sister only uses the previous domino to knock down the next. I thought: why not use all of them?
  5. Narrator: Sten realized that when you prove case ten, cases one through nine are already established facts. You are allowed to use them all.
  6. Strong-Induction Sten: This is strong induction. You assume the claim holds for *all* cases up to k, not just the one right before it.
  7. Strong-Induction Sten: My sister says it feels heavier. I say it's just induction, but with more friends in the room. Obviously.
  8. Narrator: He grew up arguing this exact point with his sister over festival biscuits and domino chains in their hometown of Lattice.
  9. Strong-Induction Sten: She would say it isn't always necessary. I would say it is never wrong, so why wouldn't you just use it?
  10. Narrator: He walked to the ProofQuest academy three years after Ida. The academy master asked if he was also a dominoes person.
  11. Strong-Induction Sten: I told him, yes. I am the dominoes person, like my sister. But I assume more.
  12. Narrator: The master, who had been at the academy for a long time, understood immediately and appointed him on the spot.
  13. Strong-Induction Sten: Some proofs can't be reached otherwise. They need all the friends they can get. It's only logical.
  14. Narrator: Assume everything below. Use everything you've already proven. That is the whole element. That is what makes Sten, Sten.
  15. Narrator: You've been listening to a Spark and Anvil chapter, written by the Spark and Anvil writing team for ages 9 to 14.
  16. Narrator: Apps stay free forever.
  17. Narrator: Curriculum aligned to Common Core math and discrete math.
  18. Narrator: Released under Creative Commons BY-NC-SA 4.0 for educational reuse. Visit Spark and Anvil for the full transcript.

The ProofQuest ensemble

Strong-Induction Sten 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.

Kids also liked

Play EthosForge Play CharterForge Play BraidPals Play CarryPals Play PatchNotes Play SpeakForge