Skip to content
Field Atlas

Atlas / Mathematics / The Number Theory Thread

Field · Emerged 1922 – 1983

Arithmetic Geometry

What does the shape of an equation's solution set reveal about its solutions in whole or rational numbers?

6 chapters4 min read5 turning points1 open problem

Branched from
Algebraic Number Theory + Analytic Number Theory + Algebraic Geometry
Branched into
Public-Key Cryptography
Figures
Louis Mordell, André Weil, Yutaka Taniyama, Goro Shimura, Gerd Faltings, Gerhard Frey, Jean-Pierre Serre, Ken Ribet, Richard Taylor, Christophe Breuil

In brief

Arithmetic geometry studies equations with whole-number or fractional solutions, the Diophantine equations of Fermat, by looking at the geometric shape their solutions form. The guiding discovery is that shape controls arithmetic. Curves with no holes have either no rational points or infinitely many, curves with one hole (elliptic curves) have rational points forming a finitely generated group, and curves with two or more holes have only finitely many.

It is where the number theory thread rejoins geometry. It is the setting of the proof of Fermat's Last Theorem, and many of the deepest open problems in mathematics live here.

Key ideas

Rational pointEnters 1922

A solution to an equation in which every coordinate is a fraction. Finding all rational points on a curve is the modern form of Diophantus' problems.

Genus decidesEnters 1983

The number of holes in a curve's complex surface decides the character of its rational points: genus 0, none or infinitely many; genus 1, a finitely generated group; genus 2 or more, finitely many.

Mordell–Weil group and rankEnters 1922

The rational points of an elliptic curve can be added, and every one is built from finitely many generators. The number of independent generators is the curve's rank.

Modular formEnters 1955 – 1967

A function on the complex upper half-plane with an enormous amount of symmetry. Modularity says every elliptic curve over the rationals is secretly encoded by one.

Frey curveEnters 1985 – 1990

The elliptic curve y2=x(x−an)(x+bn)y^2 = x(x - a^n)(x + b^n) built from a hypothetical solution an+bn=cna^n + b^n = c^n of Fermat's equation. It would be too strange to be modular, and that is how Fermat's Last Theorem was proved.

Chapter I

Where Two Threads Meet

Diophantus asked for fractional solutions to equations, and for two thousand years such problems were solved one at a time by ingenuity. Arithmetic geometry turns them into questions about shape. The complex solutions of a polynomial equation in two variables form a surface, and its number of holes, the genus, turns out to govern the rational solutions.

That idea needs three parents. From algebraic geometry it takes the geometry of curves and, later, Grothendieck's schemes. From algebraic number theory it takes number fields and Galois theory. From analytic number theory it takes L-functions, which package a curve's arithmetic into an analytic function.

Chapter II

Mordell's Finiteness

In 1922 Louis Mordell proved that on an elliptic curve, a smooth cubic of genus 1, all the rational points can be generated from finitely many of them by a geometric "chord and tangent" addition. He also guessed that curves of genus 2 or more have only finitely many rational points.

That conjecture stood until 1983, when Gerd Faltings proved it, using machinery Grothendieck's school had built for entirely different reasons. The picture was now complete: genus 0, none or infinitely many rational points; genus 1, a finitely generated group; genus 2 and up, finitely many.

Chapter III

Modularity

In 1955 a young Japanese mathematician, Yutaka Taniyama, suggested that elliptic curves might be connected to modular forms, highly symmetric functions from a quite different part of mathematics. His colleague Goro Shimura made the idea precise: every elliptic curve over the rationals should correspond to a modular form. Taniyama died in 1958. The conjecture spread through André Weil's 1967 paper, and who deserved credit for it was argued about for decades.

Chapter IV

The Road to Fermat

In the mid-1980s Gerhard Frey noticed something remarkable. A solution to Fermat's equation an+bn=cna^n + b^n = c^n would produce an elliptic curve, y2=x(x−an)(x+bn)y^2 = x(x - a^n)(x + b^n), so strange that it could not be modular. Ken Ribet proved this in 1986. Fermat's Last Theorem would follow from the modularity conjecture.

Andrew Wiles had wanted to prove Fermat's theorem since childhood. On hearing of Ribet's result he worked in secret for seven years and announced a proof in 1993. A gap was found, and he repaired it with Richard Taylor in 1994. The proof is recorded on the algebraic geometry page, the field whose tools it used. By 2001 Christophe Breuil, Brian Conrad, Fred Diamond and Taylor had proved modularity for every elliptic curve over the rationals.

Chapter V

A Closer Look: Making New Solutions from Old

Fermat claimed that the only whole-number solutions of

y2=x3−2y^2 = x^3 - 2

are x=3x = 3, y=±5y = \pm 5, and he was right. But in fractions there are infinitely many, and geometry produces them.

The equation defines an elliptic curve. Draw the tangent line to the curve at the point (3,5)(3, 5). By implicit differentiation its slope is 3x22y=2710\frac{3x^2}{2y} = \frac{27}{10}. A line meets a cubic curve in three points, counted with multiplicity, and the tangent touches at (3,5)(3, 5) twice, so it must cross the curve at exactly one more point. Because the line and the point have rational coordinates, the algebra forces that third point to be rational too. Working it out gives

x=(2710)2−2⋅3=129100,y=3831000,x = \left(\tfrac{27}{10}\right)^2 - 2 \cdot 3 = \frac{129}{100}, \qquad y = \frac{383}{1000},

and indeed (3831000)2=(129100)3−2\left(\frac{383}{1000}\right)^2 = \left(\frac{129}{100}\right)^3 - 2. Reflecting in the xx-axis gives (129100,−3831000)\left(\frac{129}{100}, -\frac{383}{1000}\right). Repeating the construction with tangents and chords through known points produces ever more complicated fractions, without end. Diophantus and Bachet used tricks like this. The modern view sees an addition law: the chord-and-tangent construction makes the rational points into a group.

Mordell's 1922 theorem says that group is always generated by finitely many points. For this curve, one point, (3,5)(3, 5), generates all of them: the rank is 1. The Birch and Swinnerton-Dyer conjecture predicts that rank from the curve's L-function. For curves of genus 2 or more, Faltings proved that no such endless supply exists: there are only finitely many rational points.

Chapter VI

Beyond Fermat

The deepest questions remain open. The Birch and Swinnerton-Dyer conjecture, recorded with algebraic geometry, asks for the rank of an elliptic curve from its L-function. The abc conjecture, a simple-looking statement about a+b=ca + b = c, would imply much of the subject at once. In 2012 Shinichi Mochizuki released a claimed proof of more than 500 pages in a framework almost no one else uses. Six years later Peter Scholze and Jakob Stix identified a step they believe fails. The proof has been published, but it has not persuaded most of the field. Whether the fog has lifted there is itself disputed.

Applications

Where it is used

  • Cryptography

    Factoring integers with elliptic curves

    Hendrik Lenstra's elliptic curve method (1987) factors large numbers by trying random elliptic curves until one reveals a factor. It remains one of the best ways to find medium-sized prime factors, which is exactly what attackers of weak encryption keys need.

    › Sources (1)
    • Lenstra, H. W. (1987). Factoring integers with elliptic curves. Annals of Mathematics 126(3): 649–673.

Open problems

Where the map runs out

Conjectured, unproven

The abc conjecture

A claimed proof (Mochizuki, 2012; published 2021) is not accepted by most number theorists as of 2026.

If a+b=ca + b = c for whole numbers with no common factor, then cc is rarely much larger than the product of the distinct primes dividing abcabc. Proposed by Masser and Oesterlé in 1985, it would imply Fermat's Last Theorem for large exponents, Faltings's theorem, and a long list of other results, often in sharper forms.

Why it is hard

It ties addition to the prime factorisation of numbers, which is exactly the interaction that number theory controls worst. Shinichi Mochizuki's claimed proof uses a new "inter-universal Teichmüller theory" spanning more than 500 pages. In 2018 Peter Scholze and Jakob Stix identified a step they consider fatally flawed. Mochizuki disputes their reading, and the proof was published in 2021 in a journal he edits. Outside his circle, few regard the question as settled.

What resolving it unlocks

A verified proof would settle a vast range of Diophantine questions at once, and it would give effective bounds where only finiteness is now known.

› Sources (3)
  • Oesterlé, J. (1988). Nouvelles approches du « théorème » de Fermat. Séminaire Bourbaki 694.
  • Mochizuki, S. (2021). Inter-universal Teichmüller theory I–IV. Publications of the Research Institute for Mathematical Sciences 57(1–2).
  • Scholze, P. & Stix, J. (2018). Why abc is still a conjecture. Manuscript.

Further reading

  1. Singh, S. (1997). Fermat's Last Theorem (US title: Fermat's Enigma). Fourth Estate / Walker.

    The popular story of the 358-year hunt, from Fermat's margin to Wiles.

  2. Silverman, J. H. & Tate, J. (2015). Rational Points on Elliptic Curves (2nd ed.). Springer.

    An undergraduate introduction to elliptic curves by two masters of the subject.

  3. Hindry, M. & Silverman, J. H. (2000). Diophantine Geometry: An Introduction. Springer.

    A graduate text on the finiteness theorems of Mordell, Weil and Faltings.