Exhaustion Edda
PROOF BY EXHAUSTION (CASES)
Loading audio…
Press play to listen along. The line being read lights up as you go.
Show full transcript
Loading transcript…
Exhaustion Edda runs — or, technically, ran, although in practice still helps run — the central archive of the kingdom's capital city. The archive holds, by Edda's own meticulous count, approximately seven hundred thousand documents.
She has personally touched, in some way, all of them.
This is not a boast. Edda does not boast. It is simply the consequence of forty-three years of working at the same archive, which she joined at twenty-two as the most junior assistant and which she now runs as the senior keeper. In forty-three years you can touch a lot of documents.
What Edda has come to understand — and this is the heart of the chapter — is that some questions about a collection cannot be answered by thinking about the collection abstractly. Some questions can only be answered by going through every single thing in it.
This is a thing many people do not enjoy hearing. Edda enjoys saying it anyway.
Her favourite example, which she uses in every introductory class, is this: a child once came to the archive looking for the oldest letter that mentions a particular variety of red apple — an apple called the Crinklecoat, which grows only in a small valley on the western border. The child had a school project. The school project was about the history of the Crinklecoat. The child wanted to know which letter in the archive was the earliest to mention the apple by name.
There was, Edda explained, no shortcut.
There was no master index of "letters mentioning Crinklecoat apples." There was no clever algorithm. There were two hundred and forty thousand letters in the archive. To find the earliest letter mentioning the Crinklecoat by name, somebody had to look through every letter.
The child said: "But that will take forever."
Edda said: "It will take about four weeks. I have a system. We will start with the oldest letters and work forward, and we will stop the moment we find the first one."
The child said: "That is still a lot of letters."
Edda said: "Yes."
They started the next morning. Edda made tea. She showed the child her cataloguing system. The child read letters. Edda read letters. They worked side by side, every morning for three weeks and four days, until they found the letter — a small note from a baker named Lull to his cousin, dated one hundred and twelve years ago, mentioning "the new Crinklecoat apples Cousin Bevin brought from the valley".
The child cried, just briefly, with relief. Edda made more tea.
The school project, when it was eventually finished, won the regional history prize.
Edda kept a copy of the project. She still has it, on a shelf in her office, between two thick blue ledgers.
This is, in mathematical terms, proof by exhaustion.
You break a problem into all of its possible cases. You check each one. When you have checked all of them, you have proved the claim — by the simple, deeply satisfying logic that there are no cases left to check.
When the ProofQuest academy asked Edda, at sixty-five, whether she would consider teaching the exhaustion technique to children, Edda said the now-famous line: "Finally. A technique that respects my actual job."
She did not retire from the archive when she accepted. The academy was willing to wait for her on the days she was needed at the archive. (She is needed at the archive most days. She likes the archive. She likes the academy too. She splits her time.)
Edda teaches exhaustion proofs with the calm of someone who has, over forty-three years, learned that thoroughness is not the same as inelegance. Some children come to her class expecting exhaustion to be boring. They leave understanding that it is, in some cases, the only honest answer.
She is also the cast member who most often reminds the others — quietly, at academy dinners — that not every claim has a clever shortcut. Sometimes you just have to check the seven hundred thousand letters. Sometimes the seven hundred thousand letters are the proof.
She has been right about this every time.
She still keeps a small wooden teacup at her desk in the archive. It was a gift from the Crinklecoat child, who is now a grown adult and works at a museum two cities over. The teacup is chipped on one edge. Edda has not replaced it. (She has, in her quiet way, an excellent memory for the things that matter.)
If you ask Edda what she does, she will not say I am a teacher or I am an archivist.
She will say:
"I check. I keep checking. When I have checked everything, I stop. That is the whole job."
And she will offer you tea. She always offers tea.
Hear it as an audio drama
A short play starring Exhaustion Edda, from ProofQuest. Different voices, same idea. Listen any time after you read.
Loading audio…
Read the drama script
- Narrator: From Spark and Anvil and ProofQuest — this is Edda, in chapter 1 of the ProofQuest cast.
- Narrator: This drama uses an AI-generated voice. Voiced via Gemini 2.5.
- Narrator: Exhaustion Edda is the academy's most patient teacher. Her method is the thorough one. If a claim splits into a finite number of cases, she checks each one — every single one — and only then does she declare the claim proven.
- Narrator: She is a tall heron-tween. Methodical. Steady. She wears a long apron with many small pockets, each pocket holding a card for one of the cases she's currently checking. The apron is heavier on busy days.
- Edda: I am Exhaustion Edda. I teach proof by exhaustion. When a claim breaks into a finite number of cases, I check each one. If every case works, the claim is proven. If even one case fails, the claim is false.
- Narrator: Proof by exhaustion — sometimes called proof by cases — is a technique for proving a claim by breaking it into a finite collection of cases that together cover every possibility. You then check each case individually. The proof is complete when no case is left.
- Edda: My method has three steps. One: identify a finite list of cases that covers every possibility. Two: check that the cases really do cover everything — no gaps. Three: prove the claim for each case, one by one.
- Edda: My favorite small example: the claim that for every integer N, N times N plus one is always even. Cases. Case one: N is even. Then N times N plus one is even times one more than even, which is even times odd. Even times anything is even. Done. Case two: N is odd. Then N plus one is even. So N times N plus one is odd times even. Even. Done. Two cases, both even. Together they cover all integers. Claim proven.
- Edda: The big famous example is the Four-Color Theorem. The claim was that any map can be colored with at most four colors so that no two adjacent regions share a color. The proof, when it finally arrived in 1976, used a computer to check 1,936 possible cases. Every case worked. The claim was proven.
- Narrator: Edda grew up in a small marsh village. Her family were the rope-checkers — herons who tested every knot in every net before the fishing season began. If one knot failed, the net failed. So they checked them all.
- Edda: By the time I was nine I had learned the village rule. The work is the patience. Don't skip the boring cases. They are the proof.
- Narrator: She walked to the ProofQuest academy at sixteen. The mentor Qed met her at the gate.
- Qed: What is proof by exhaustion?
- Edda: Break the claim into a finite number of cases that cover everything. Check each case. If all check out, the claim is proven. The Four-Color Theorem used 1,936 cases. Sometimes the cases are small and elegant. Sometimes they are a list a computer has to run. Either way — every case checked. No shortcuts.
- Qed: You are appointed.
- Narrator: Edda has been the academy's exhaustion-proof teacher for years. She still wears the apron with the case-pockets. She begins every first-day lesson the same way.
- Edda: I am Exhaustion Edda. Cover every case. Check every case. That is what exhaustion proof is. When a claim splits into a list — even a big list — I work through the list. If the list is finite and every entry checks out, the claim is proven. Patience over cleverness.
- Edda: Finite cases. Complete coverage. Each one checked. No shortcuts. That's the whole technique. That's what makes exhaustion proof a proof.
- Narrator: You've been listening to a Spark and Anvil chapter, written by the Spark and Anvil writing team for ages 9 to 14.
- Narrator: Apps stay free forever.
- Narrator: Curriculum aligned to Common Core math and discrete math.
- Narrator: Released under Creative Commons BY-NC-SA 4.0 for educational reuse. Visit Spark and Anvil for the full transcript.
More stories with Exhaustion Edda
Another short audio story about Exhaustion Edda. Open one when you are ready.
Proof by exhaustion
Loading audio…
Read the script
- Narrator: From Spark and Anvil and ProofQuest — this is Exhaustion Edda, in chapter 1 of the ProofQuest cast.
- Narrator: This drama uses an AI-generated voice. Voiced via Gemini 2.5.
- Narrator: Exhaustion Edda is the senior keeper of the capital's central archive. She has, over forty-three years, touched all seven hundred thousand documents.
- Narrator: Her grey hair is tied back with a simple cord, and her hands are never still — always sorting, stacking, or holding a teacup.
- Exhaustion Edda: I am Edda. I check. I keep checking. When I have checked everything, I stop. That is the whole job.
- Narrator: Edda teaches proof by exhaustion. You break a claim into a finite number of cases, and you check every single one.
- Exhaustion Edda: Some questions cannot be answered with a clever shortcut. Some questions can only be answered by going through every single thing.
- Exhaustion Edda: A child once needed the oldest letter mentioning the Crinklecoat apple. There was no index. There were two hundred and forty thousand letters.
- Narrator: They worked side by side for three weeks and four days, reading every letter in order, until they found the one they were looking for.
- Exhaustion Edda: The child said it would take forever. I said it would take about four weeks. We had a system. And tea.
- Narrator: At sixty-five, the ProofQuest academy asked her to teach her method of absolute thoroughness.
- Exhaustion Edda: I said: "Finally. A technique that respects my actual job."
- Narrator: Edda teaches that thoroughness is not inelegance. It is the most honest answer when there are no shortcuts left.
- Exhaustion Edda: You check every case. None left out. When there are no cases left to check, you have your proof.
- Narrator: You've been listening to a Spark and Anvil chapter, written by the Spark and Anvil writing team for ages 9 to 14.
- Narrator: Apps stay free forever.
- Narrator: Curriculum aligned to Common Core math and discrete math.
- Narrator: Released under Creative Commons BY-NC-SA 4.0 for educational reuse. Visit Spark and Anvil for the full transcript.
The ProofQuest ensemble
Exhaustion Edda 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.
-
Direct-Proof Dora
Direct proof: assume premises, derive conclusion by straightforward logical steps
-
Induction Ida
Weak / standard mathematical induction: base case + inductive step
-
Strong-Induction Sten
Strong induction: base case + assume all prior cases hold
-
Contradiction Cassius
Proof by contradiction (reductio ad absurdum): assume the negation, derive a contradiction
-
Contrapositive Cara
Proof by contrapositive: prove "not Q → not P" to establish "P → Q"
-
Construction Cole
Proof by construction: prove existence by explicit construction of an example
-
Pigeonhole Perch
Pigeonhole principle: if n+1 items are placed in n bins, at least one bin contains 2+ items
-
Counterexample Cricket
Disproof by counterexample — one exception topples a universal claim
-
Biconditional Bex
Biconditional proof — proving 'if and only if' in both directions
-
Uniqueness Una
Proof of uniqueness — suppose two, show they must be the same one
-
QED
Closing-mark mentor — the ∎ at the end of every proof; the gentle voice that names completion + invites the next problem