Fermat's Last Theorem – The Road to the Proof¶
Overview
From a 17th-century lawyer's conjecture to Andrew Wiles' 109-page proof (1995). This article series traces the entire journey – from elementary number theory through the language of modern mathematics to the famous \(R = T\) theorem.
The Conjecture¶
Fermat's Last Theorem states:
has no solution in positive integers \(x, y, z\) for \(n \geq 3\).
Pierre de Fermat noted in 1637 in the margin of his copy of Diophantus' Arithmetica that he had found a "truly marvelous proof" that the margin was too small to contain. 358 years later, Andrew Wiles' proof appeared in the Annals of Mathematics.
The Journey in Three Acts¶
🔢 Act 1: Elementary Number Theory¶
The starting point: What does the conjecture state, and which special cases could be proven early on?
| # | Article | Topic |
|---|---|---|
| 1 | What Is Fermat's Last Theorem? | History, Fermat, 350 years of searching |
| 2 | The Proof for \(n=4\) | Fermat's own proof (Infinite Descent) |
| 3 | Primes and Why They Suffice | Reduction to prime exponents |
| 4 | The Proof for \(n=3\) | Euler, Gauss, algebraic numbers |
🔧 Act 2: Tools of Modern Mathematics¶
Before the proof come the tools. Each of these topics is self-contained and is referenced in the proof articles.
- Groups – Symmetry as Language
- Rings and Fields
- Galois Theory
- p-adic Numbers
- Elliptic Curves
- Modular Forms
🏔️ Act 3: The Proof¶
From the Taniyama-Shimura Conjecture through Galois representations to the \(R = T\) theorem.
| # | Article | Topic |
|---|---|---|
| 1 | The Taniyama-Shimura Conjecture | Every elliptic curve is modular |
| 2 | Frey's Idea and Ribet's Theorem | TSC ⟹ FLT |
| 3 | Galois Representations | Elliptic curves as matrices |
| 4 | Deformation Theory | How to deform representations |
| 5 | \(R = T\) – The Heart of the Proof | Wiles' central theorem |
| 6 | The Taylor-Wiles Trick | The minimal case |
| 7 | The 3-5 Switch and the Conclusion | The finale |
| 8 | What Came After | Full TSC, Langlands program |
Recommended Order¶
The articles build on each other. The recommended path:
- Elementary Number Theory (Act 1) – as an introduction
- Tools (Act 2) – as needed, or when a proof article refers to them
- The Proof (Act 3) – strictly in order
Prerequisites
For mathematical foundations (logic, sets, arithmetic, algebra) there is the Prerequisites section. Those articles are linked from the storyline when needed.