How anthropics/fermats-last-theorem works
This repository is a machine-checked Lean proof of Fermat’s Last Theorem, accompanied by offline proof-browsing pages and independent kernel-checking workflows. The principal result is stated in Theorems/Thm_fermat_last_theorem.lean; the README identifies the argument as Frey–Serre–Ribet–Wiles–Taylor–Wiles and says P2M/Sol/ proofs import the statements they cite. The README also describes theorem and definition pages, search, and landmark graphs. No source excerpts were provided, so edges use only README-documented relationships; internal proof-stage links are omitted where their implementation is not documented.
Main entry points: html Offline pages · Sol Proof modules · PROOF-PATH.md Proof path · comparator Comparator check
Components 16
Formal proof
- FLT statement
- Proof statements
Theorems - Proof modules
P2M/Sol - Definitions
Definitions - Proof path
PROOF-PATH.md
Proof browser
- Offline pages
html - Theorem pages
html - Definition pages
html - Proof route
html/route - Name search
html - Landmark graph
html/dag
Independent checks
- Comparator check
verification/comparator - Nanoda check
verification/nanoda
Other components
- Lean user
- Lean kernel
- Nanoda kernel
Connections 10
- Proof modules → Proof statements: import cited
README.md - Proof path → FLT statement: names proof theorem
README.md - Lean user → Offline pages: browses offline
README.md - Offline pages → Theorem pages: presents
README.md - Offline pages → Definition pages: presents
README.md - Offline pages → Proof route: presents
README.md - Offline pages → Name search: provides
README.md - Offline pages → Landmark graph: presents
README.md - Comparator check → Lean kernel: checks build
README.md - Nanoda check → Nanoda kernel: checks export
README.md