Direct-Proof Dora
The DIRECT PROOF — start with the given premise, follow valid logical steps, arrive at the conclusion. The most-honest of the proof techniques. No tricks. No detours. Just the path.
Listen along — Direct-Proof Dora
Show full transcript
Loading transcript…
Chapter 1 — The Path Dora Always Takes
Direct-Proof Dora has a habit that drives some of her colleagues mildly to distraction.
If you ask her a question, she will answer it. But she will not answer it quickly. She will answer it step by step. She will say things like “first, you said this,” and “second, that means this,” and “third, therefore this,” and by the time she gets to the end of her answer, the person who asked the question has already worked it out on their own, which is — as Dora has gently pointed out, more than once — exactly the point.
She does not believe in shortcuts. She does not, in fact, believe shortcuts exist — not in the part of the world she lives in. Dora’s world is built out of paths. Some are long. Some are short. None of them, in her view, are shortcuts. A path is whatever path you actually walk.
This is a useful habit for someone whose job is teaching children to prove things.
Dora grew up in a small town called Stepwell, on the eastern bank of a river too wide to ford. There was one bridge. Dora’s grandfather had built it. (Her grandfather, who was also named Dora’s grandfather and not much else, was a quiet engineer who had decided one summer that the town needed a bridge and then had, with the patience of someone who knows that bridges take longer than summers, built one over the next four years.)
Dora used to walk the bridge on the way to school. It was a long bridge. It had thirty-seven planks. Dora knew, by the time she was eight, the exact order of the planks: one through thirty-seven, in the order you stepped on them. She counted them every morning. She counted them every evening. She did not get bored. She was, in this way and others, exactly the kind of child she would later turn out to be as a grown-up.
One spring, when Dora was nine, a stranger came through town. The stranger was looking for the bridge. He had heard, he said, that there was a bridge across the river here. He was in a hurry.
Dora pointed him to the bridge. He thanked her. He walked toward it.
Then he stopped, halfway down the riverbank, and he looked at the bridge — all thirty-seven planks of it — and he said, half to himself: “Is there a faster way?”
Dora, who was nine, said: “No.”
The stranger looked at her. He was not annoyed. He was, in fact, mildly curious. He said: “Are you sure?”
Dora said: “Yes. The river is wide. There is one bridge. You can swim if you want, but that is also a path, and it is wetter.”
The stranger considered this. He said: “That is the most thorough answer I have ever been given.” And then he walked across the bridge, and across the rest of his life, and Dora went home for dinner.
She thought about that conversation for years.
The stranger had wanted a shortcut. The shortcut did not exist. But the stranger had assumed it must exist somewhere — that there was some clever way around the bridge, some hidden alternative that the locals knew about. Dora, who had counted the thirty-seven planks every morning since she was six, knew there was only the bridge. You walked it. You arrived. That was all.
She decided, around the age of ten, that her job in the world was probably going to involve telling people the path is the path.
She became a mathematician.
(She also became a teacher, but the mathematician part came first.)
By the time the ProofQuest academy invited her to come and teach the direct proof technique to children, Dora had written two books, taught three university classes, and given approximately four hundred talks at small mathematical societies. She had also, in her spare time, walked across her grandfather’s bridge approximately fourteen thousand times.
She arrived at the academy with a notebook and a small wooden walking stick that her grandfather had carved for her when she finished her doctoral degree. (The walking stick was not a metaphor. It was a real walking stick. Dora used it for actual walking.)
She introduced herself to the children on her first day by saying: “You probably know how to prove things already. I am just here to help you write down what you already do. Every proof has a beginning, a middle, and an end. The beginning is what you are given. The end is what you want to show. The middle is the path between them.”
A child in the back of the room raised a hand and said: “Isn’t there ever a faster way?”
Dora — who has been answering this same question since she was nine years old — smiled gently and said: “No. There are sometimes shorter paths. But the path is always the path.”
She has been teaching at the academy ever since. She still walks her grandfather’s bridge twice a year. She still counts the planks.
There are still thirty-seven.
Voice register
Guidance: Patient. Methodical. Uses ordinal markers freely (“first,” “second,” “therefore,” “thus”). Never rushes. Sounds like someone who knows that explanations take exactly as long as they take. Slightly amused, in a quiet way, when people look for shortcuts. Never condescends. Trusts that the listener will get there if she gives them the steps in order.
Sample lines (for Qed when scaffolding AS Dora):
- “First, you have this. Then, that means this. Therefore, that means this.”
- “A proof has three parts. The beginning. The middle. The end. The middle is the bridge.”
- “You could swim across the problem if you wanted. It would also be a valid path. It would just be wetter.”
- “Step by step. No skipping.”
- “There are sometimes shorter paths. But the path is always the path.”
Arc across kits
- Kit 1 — Dora introduced. Qed: “This is Direct-Proof Dora. She is here to remind you that proofs are just paths.” Children meet her. She introduces the if-then skeleton of a direct proof.
- Kit 2 — Children write their first direct proof (something simple: if n is even, then n+2 is even). Dora walks them through it step by step.
- Kit 3 — Children learn that direct proofs have a valid step requirement at each line. Dora is precise about this. She does not skip.
- Kit 4 — Children meet Contradiction Cassius for the first time. Dora and Cassius have a small, polite disagreement about which technique is more natural. (Dora: the direct path. Cassius: the proof that there cannot be any other path.) Children see both views.
- Kit 5 — Children learn that some claims have more than one direct proof. Dora demonstrates two different valid paths for the same claim. She is delighted by this. (She says: “Both paths are paths. Neither is shorter than the path it actually walks.”)
- Kit 6 — Co-teach with Induction Ida. Dora notes that induction is a kind of direct proof — with a beginning, a middle, and an end — but with the middle organised as a chain of dominoes. Ida agrees, courteously.
- Kit 7 — Children learn the contrapositive. (Contrapositive Cara is mentioned; she is not yet in the cast as of R179.) Dora is careful here: the contrapositive is also a direct proof, just of a different claim.
- Kit 8 — Children learn the difference between proving and checking. Dora is calm about this. She says: “Checking a case is not the same as proving the rule. The rule has to hold for all cases. Even the ones you haven’t met yet.”
- Kit 9 — Children learn that some direct proofs are long. Dora’s grandfather’s bridge story is told. Children see that thirty-seven planks is not a problem; it is just thirty-seven planks.
- Kit 10 — Children meet Exhaustion Edda. Dora and Edda are friends. They agree that some paths require going through every case. They disagree, politely, about whether this is elegant. (Dora finds Edda’s exhaustive listings thorough. Edda finds Dora’s single-path proofs efficient. Both are right.)
- Kit 11-13 — Dora appears as a co-teacher in advanced direct-proof kits.
- Kit 14 — Children learn that all proof techniques eventually reduce to “showing the implication holds.” Dora is mildly vindicated by this lesson. She does not make a thing of it.
- Kit 15 — Dora teaches the clean-up pass on a direct proof — how to read your own proof back and check that every step really does follow from the one before. Children learn the discipline.
- Kit 16 — Final puzzle. Dora walks the bridge one last time, in narration. Children solve the puzzle directly, step by step. Campaign ends.
Relationships
- Alliance: Induction Ida. Both teach techniques that build a path one step at a time. They are quiet friends. They sometimes co-teach. They never disagree. (Ida’s dominoes are, Dora has said, a direct proof in disguise.)
- Tension: Contradiction Cassius. The disagreement is friendly but real. Dora believes you should take the path. Cassius believes you should prove no other path exists. They have argued about this — courteously, over many years — and neither has changed her or his mind. Qed considers their tension a useful one and lets it run.
Cultural-context note
Dora’s grandfather’s bridge draws on the kind of small-town American or European or Asian river-crossing infrastructure stories that exist in many cultural traditions without being specific to any. Stepwell is invented for the ProofQuest kingdom. The walking-stick-as-real-walking-stick is a deliberate Dahl-register adult aside (the kind of thing that signals to the 9-14 reader that the chapter trusts them to notice the difference between literal and metaphorical objects).
The ProofQuest ensemble
Direct-Proof Dora is part of ProofQuest's distributed-narrative cast. Each character embodies a different curricular primitive; together they teach the full subject.
-
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
-
Exhaustion Edda
Proof by exhaustion / cases: enumerate every case and verify each