Story → proofThe suitcase enters with a modularity passport. The proof needs that evidence before it can lower the level.
Bring modularity evidencehmod : P.freyCurve.IsModularFollow the story. Try a proof. Let curiosity choose how deep you go.
Walk in through the manga: seventeen chapters, sixty-four pocket pebbles, zero required formulas. The Lean source stays behind glass until you ask for it.
Straight to the mathematicsBegin at the proof map — thousands of named theorems — then climb the full ladder from clock inverses to R = T. The story keeps telling itself beside you; it will keep you honest.
Made for company: one reader who loves math and one who does not — one sofa. Whatever each of you finds carries over to the tea salon.
Seventeen chapters, one extraordinary argument. One small discovery is enough for today.
Pip’s rule: mistakes are clues. Every chapter is open, and every question allows another try.
Lower the level. Empty the room. Close the case.
Search the local catalogue in English or Japanese. Major landmarks have Japanese titles. Open the full original proof on GitHub for the complete context.
The theorem takes P, hmod and hirr, then returns ∃ f : CuspForm (Gamma0 2) 2, f≠0. obtain unpacks N, hcond and hmodN. exact passes hirr, hcond and hmodN to level_lowering_to_two_of_conductorLevel. The unused-variable linter setting reflects that hmod is not used by this implementation.
Annotated original · not a live Lean statePoint to a story clue or a highlighted term to connect the two.
Try this logical move →Source: anthropics/fermats-last-theorem @ aa2d8b3. Upstream reports verification; this reader has not independently rebuilt the project. Manga explanations are not formal proofs.
Source license & attributionPip booked a grand hotel. The mathematics keeps removing rooms.
The two branches now meet: modularity and irreducibility enter the level-lowering argument. Follow its hypotheses to obtain a nonzero cusp form at level 2; lowering is not simply deleting conditions.
These links explain the reading route. A story analogy is not a proof of this theorem.
Already familiar? Keep reading. Otherwise, open a word or follow the prerequisites from the beginning.
Story → proofThe suitcase enters with a modularity passport. The proof needs that evidence before it can lower the level.
Bring modularity evidencehmod : P.freyCurve.IsModularStory → proofThe destination room is the space of weight-two, level-two cusp forms. The guest must be nonzero for the later contradiction.
Arrive at level two, weight twoCuspForm (CongruenceSubgroup.Gamma0 2) 2Story → proofCollecting the passport is collecting conductor-level data and its conditions; the porter joke cannot supply them.
Collect the conductor dataP.modularRepOfConductorLevelStory → proofRemoving inspected luggage tags represents the deeper level-lowering theorem, which preserves the needed nonzero form.
Use the lowering theoremP.level_lowering_to_two_of_conductorLevelThe theorem takes P, hmod and hirr, then returns ∃ f : CuspForm (Gamma0 2) 2, f≠0. obtain unpacks N, hcond and hmodN. exact passes hirr, hcond and hmodN to level_lowering_to_two_of_conductorLevel. The unused-variable linter setting reflects that hmod is not used by this implementation.
The story and source are readable here. Enable JavaScript to edit proofs, try quizzes, and explore the interactive map.
Short scenes. Real logical goals. A pigeon who is very invested in your success.
Opening the casebook…
The shrinking reservation
Start with the cake-scale story. You only need to read one small piece at a time. If you are in the Fermat story, start with Story depth, then the words listed before the chapter.
You do not need to know Lean, symbols or university mathematics to begin. Definitions come first in the small stories.
Look at the small example before the general formula. Ask what changed and what stayed the same.
Close this panel to return to the exact place you were reading. These are prepared hints for this page.
Start with the first small story →