<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 · LeanOriginal source ↗

Pip’s rule: mistakes are clues. Every chapter is open, and every question allows another try.

Modularity, the 3–5 trick, and compatible pieces.

Choose your depthProof terms and exact dependencies.
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 the two sides of modularity lifting and why connecting them requires real work.

D.universal
The universal mapping property packaged in the deformation-ring data.
Base change
Transport an algebraic object along a homomorphism.
Where the metaphor ends

Workshops are a metaphor for algebraic parameter spaces. This excerpt constructs a surjection R → T; surjectivity alone is not a proof that R and T are isomorphic.

</>S_GaloisRep_DeformationRingData_exists_surjective_algHom_of_heckeGaloisRepDatum.lean
Original source ↗ · L7–9Pinned revision aa2d8b3
theorem solution {𝒪 : Type} [CommRing 𝒪] [IsDomain 𝒪] [IsDiscreteValuationRing 𝒪] [IsAdicComplete (IsLocalRing.maximalIdeal 𝒪) 𝒪] {ρbar : ResidualGaloisRep (IsLocalRing.ResidueField 𝒪)} {𝒟 : ∀ ⦃A : Type⦄ [CommRing A] [IsLocalRing A] [Algebra 𝒪 A], GaloisRepAdic A → Prop} (D : GaloisRep.DeformationRingData 𝒪 ρbar 𝒟) {N : ℕ} [NeZero N] {S : Set ℕ} {θ : CuspForm.heckeAlgebra N 2 S →+* IsLocalRing.ResidueField 𝒪} {T : Type} [CommRing T] [IsLocalRing T] [IsNoetherianRing T] [IsAdicComplete (IsLocalRing.maximalIdeal T) T] [Algebra 𝒪 T] [IsLocalHom (algebraMap 𝒪 T)] [Module.Finite 𝒪 T] [Module.Free 𝒪 T] (H : CuspForm.HeckeGaloisRepDatum N S 𝒪 θ T) (hS : ∀ q : ℕ, q.Prime → q ∣ N → q ∈ S) (h𝒟 : 𝒟 H.ρ) (hres : H.ρ.residual.IsEquiv (ρbar.baseChangeAlong (IsLocalRing.ResidueField.map (algebraMap 𝒪 T)))) : ∃ φ : D.R →ₐ[𝒪] T, Function.Surjective φ ∧ ∃ hφ : IsLocalHom (φ : D.R →+* T), (D.ρ.baseChangeAlong (φ : D.R →+* T) hφ).IsEquiv H.ρ := by
obtain ⟨φ, ⟨hφ, he⟩, -⟩ := D.universal T H.residue_surjective H.ρ h𝒟 hres
exact ⟨φ, H.surjective_of_isEquiv_baseChangeAlong hS D.ρ φ hφ he, hφ, he⟩

👩🏻‍🎨 Mika · Source reading guide

D.universal is instantiated with T, H.ρ and the admissibility and residual-equivalence witnesses. The proof unpacks φ, its local-hom property and base-change equivalence, then H.surjective_of_isEquiv_baseChangeAlong supplies surjectivity. Numerous typeclasses on the first line are actual assumptions, not decoration.

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 12/17 · Lean

The workshops agree

One workshop builds possible lifts. The other builds modular ones.

How we got here

The earlier chapters used lifting as a tool. We now look inside its algebraic machinery: deformation data and Hecke data are connected by a map. The distribution story practiced reading algebraic structure, but does not prove the ring comparison here.

These links explain the reading route. A story analogy is not a proof of this theorem.

Take it to the tea salon
PIP
“Two workshops, different jobs. I make tea. Finally, familiar mathematics.”
Two workshops

Story → proofThe two workshops represent deformation data and Hecke data. The stated comparison map must reach every target element.

Every target order is reachedFunction.Surjective φ
MIKA
“The first workshop organizes every permitted lift through one order form. This is the universal property.”
A universal order form

Story → proofThe order form is universality: an allowed lift determines the comparison map, rather than an arbitrary factory connection.

The universal order formD.universal
MIKA
“Yes: that is surjectivity. Several inputs might still reach the same output, so an isomorphism needs more.”
Read the guarantee

Story → proofThe bridge and guarantee card are the map and its compatibility evidence. Surjectivity alone does not guarantee an isomorphism.

Compatibility comes with the maphφ, he

The idea behind the story

D.universal is instantiated with T, H.ρ and the admissibility and residual-equivalence witnesses. The proof unpacks φ, its local-hom property and base-change equivalence, then H.surjective_of_isEquiv_baseChangeAlong supplies surjectivity. Numerous typeclasses on the first line are actual assumptions, not decoration.

Why pass h𝒟 and hres to D.universal?

  • They certify admissibility and residual compatibility of the candidate lift.
  • They are optional comments.

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

The map is only part of the machinery. Patching builds the compatible structure needed deeper in the argument.

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 workshops agree

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 →