<style>button,.story-clue{pointer-events:none}button{opacity:.55}.story-clue{pointer-events:auto}.panel-select{opacity:1}#app-status{display:none}</style>
A MATHEMATICAL ADVENTURE FOR CURIOUS MINDS

A small why. A big adventure.

Follow the story. Try a proof. Let curiosity choose how deep you go.

No account. No API key. Just curiosity.

Two ways in. One table between them.

I'd rather not fight math today

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 mathematics

Begin 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.

Start with “I don’t know yet.”

Seventeen chapters, one extraordinary argument. One small discovery is enough for today.

17 chapters · StoryOriginal source ↗

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.

Choose your depthStart with the intuition.
Explore the whole proof29,511 theorems · original statements · dependencies

Search the local catalogue in English or Japanese. Major landmarks have Japanese titles. Open the full original proof on GitHub for the complete context.

Your discovery in this chapter

Understand how the earlier branches force a nonzero modular form into level two.

Level
An integer specifying part of the modular form’s symmetry condition.
Nonzero form
A form that is not identically zero.
Where the metaphor ends

A hotel level is a mnemonic for a modular form’s level, not a numerical measure of how advanced a reader is. Removing prime factors requires proved local hypotheses.

</>S_FreyPackage_level_lowering_to_two.lean
Original source ↗ · L129–134Pinned revision aa2d8b3
set_option linter.unusedVariables false in
theorem solution (P : FreyPackage) (hmod : P.freyCurve.IsModular)
(hirr : GaloisRepIsIrreducible (K := AlgebraicClosure ℚ) ℚ P.freyCurve P.p) :
∃ f : CuspForm (CongruenceSubgroup.Gamma0 2) 2, f ≠ 0 := by
obtain ⟨N, hcond, hmodN⟩ := P.modularRepOfConductorLevel
exact P.level_lowering_to_two_of_conductorLevel hirr hcond hmodN

👩🏻‍🎨 Mika · Source reading guide

A suitcase arrives with a modularity passport: a form already matched to the curve. The destination room is the tiny space of weight-two, level-two cusp forms, and the guest must arrive alive — nonzero — for the later contradiction. Level lowering then removes the inspected tags: the conductor data says how far down the level can fall while the matched form survives.

Annotated original · not a live Lean state

Point to a story clue or a highlighted term to connect the two.

Try this logical move →
Source and verification details

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 & attribution
Chapter 14/17 · Story

The shrinking reservation

Pip booked a grand hotel. The mathematics keeps removing rooms.

How we got here

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.

Take it to the tea salon

The idea behind the story

A suitcase arrives with a modularity passport: a form already matched to the curve. The destination room is the tiny space of weight-two, level-two cusp forms, and the guest must arrive alive — nonzero — for the later contradiction. Level lowering then removes the inspected tags: the conductor data says how far down the level can fall while the matched form survives.

Can Pip remove any prime-factor tag because it is inconvenient?

  • Yes. Smaller numbers are always allowed.
  • No. A theorem must justify each removal.

The story and source are readable here. Enable JavaScript to edit proofs, try quizzes, and explore the interactive map.

We have a nonzero form at level two. One final mathematical fact will make that impossible.

Read. Try. Make it click.

  1. Read the manga and choose Story, Math, or Lean depth.
  2. Open the proof playground. Edit the tactics and watch the goals change.
  3. Select a state, term, or hint. Wrong turns are part of the story.

The playground checks a small propositional language. FLT excerpts are editable reading material, not live-checked Lean proofs. The complete FLT build remains an upstream verification report.

I’m lost · Help

Mika’s help desk

The shrinking reservation

One thing at a time

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.

In simpler words

You do not need to know Lean, symbols or university mathematics to begin. Definitions come first in the small stories.

A small clue

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 →