Skip to content
Field Atlas

Atlas / Mathematics / The Geometry Thread

Field · Emerged 1850s – 1950s

Algebraic Geometry

What shapes are defined by polynomial equations, and what does their geometry reveal about the equations' solutions?

6 chapters5 min read7 turning points3 open problems

Branched from
Projective Geometry + Algebraic Topology
Branched into
Arithmetic Geometry
Figures
Étienne Bézout, Bernhard Riemann, Guido Castelnuovo, Federigo Enriques, Francesco Severi, Oscar Zariski, André Weil, Alexander Grothendieck, Pierre Deligne, Andrew Wiles, Richard Taylor

In brief

Algebraic geometry studies the shapes cut out by polynomial equations: circles and conics, curves like y2=x3−xy^2 = x^3 - x, and their higher-dimensional relatives. The same object can be studied with geometry, with topology and with algebra, and each viewpoint explains things the others cannot.

In the twentieth century the subject was rebuilt so that it works over any number system, including finite ones. That turned it into one of the most powerful tools in number theory. Fermat's Last Theorem was proved in its language.

Key ideas

Algebraic variety

The set of solutions of a system of polynomial equations, regarded as a geometric shape. The circle x2+y2=1x^2 + y^2 = 1 is a variety, and so are far stranger objects in many dimensions.

Bézout's theoremEnters 1779

Two plane curves of degrees mm and nn with no common component meet in exactly mnmn points, provided you work in the projective plane, allow complex points, and count tangencies with multiplicity.

GenusEnters 1857

The number of holes in the surface formed by a curve's complex points. A line or conic has genus 0, a smooth cubic genus 1. The genus governs both the curve's topology and how many rational solutions it can have.

Elliptic curveEnters 1994 – 1995

A smooth cubic curve such as y2=x3+ax+by^2 = x^3 + ax + b, of genus 1. Its points can be added together like numbers, which makes it central to number theory and to cryptography.

SchemeEnters 1960 – 1967

Grothendieck's generalisation of a variety. Geometry can be done over any commutative ring, so the integers and finite fields become places where "shapes" live.

Zeta function of a varietyEnters 1949

A generating function that counts a variety's solutions over finite fields of every size. Weil conjectured that it behaves like Riemann's zeta function, with its zeros controlled by the variety's topology.

Chapter I

Curves as Equations

The geometry of equations begins with Descartes' coordinates. Once every point has coordinates, a curve is simply the set of points satisfying an equation: x2+y2=1x^2 + y^2 = 1 is a circle, y=x2y = x^2 a parabola. The degree of the equation becomes the first measure of a curve's complexity. Lines have degree one and conics degree two. In 1704 Newton sorted the curves of degree three into seventy-two species.

The simplest question to ask is how often two curves meet. A line meets a conic in at most two points, and two conics meet in at most four. In 1779 Étienne Bézout argued that curves of degrees mm and nn meet in mnmn points. But "at most" becomes "exactly" only if you add the points at infinity of the projective plane and allow complex coordinates. Parallel lines meet at infinity, and a line that misses a circle meets it at two complex points. That is the first reason this field's natural home is projective space.

Chapter II

Riemann's Surfaces

The second reason came from topology. In 1857 Bernhard Riemann looked at the complex solutions of a polynomial equation in two variables and saw a surface, a real two-dimensional object. For a smooth cubic curve, that surface is a torus. The number of holes, the genus, turned out to govern the curve's algebra: which functions live on it, and how it can be mapped to other curves.

From then on, the topology of complex varieties and the algebra of their equations were studied together, which is why this field's second parent is algebraic topology. Lefschetz and Hodge carried the connection into higher dimensions in the first half of the twentieth century. The link became decisive when the topology of equations over finite fields was needed.

Chapter III

The Italian Crisis

Around 1890–1930, the Italian school of Guido Castelnuovo, Federigo Enriques and Francesco Severi achieved something extraordinary: a classification of algebraic surfaces, driven by brilliant geometric intuition. But intuition ran ahead of proof. Some arguments turned out to have gaps, some claimed results could not be checked, and by the 1930s no one could say with confidence which theorems were solid.

Oscar Zariski and André Weil responded by rebuilding the field on commutative algebra, the theory of polynomial rings and their ideals. It was a second foundational repair after Hilbert's rebuilding of Euclid, and it made the subject both more rigorous and far more abstract.

Chapter IV

Counting Solutions over Finite Fields

In 1949 Weil made a conjecture that shaped the next quarter-century. Take a polynomial equation and count its solutions in finite number systems, the fields with pp, p2p^2, p3,…p^3, \ldots elements. He predicted that these counts are controlled by a zeta function with a rigid structure, and that the structure is dictated by the topology of the same equation's complex solutions. Somehow, counting over finite fields should see holes in a surface.

Proving it required a topology for varieties over finite fields, where there is no ordinary notion of nearness. Alexander Grothendieck built one. Through the 1960s he rewrote the entire field in the language of schemes, which let geometry happen over any commutative ring, including the integers. With collaborators in his Paris seminar he constructed étale cohomology. In 1974 his student Pierre Deligne used it to prove the deepest of Weil's conjectures.

Chapter V

A Closer Look: Counting Points on a Curve Modulo 5

Weil's conjectures begin with a simple act: count the solutions of an equation in a finite number system. Take the elliptic curve

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

and work modulo 5, where the only numbers are 0,1,2,3,40, 1, 2, 3, 4 and arithmetic wraps around. The squares modulo 5 are 0,1,40, 1, 4 (22=42^2 = 4, 32=9≡43^2 = 9 \equiv 4, 42=16≡14^2 = 16 \equiv 1). Try each xx:

xxx3−x(mod5)x^3 - x \pmod 5solutions yy
00y=0y = 0
10y=0y = 0
26≡16 \equiv 1y=1,4y = 1, 4
324≡424 \equiv 4y=2,3y = 2, 3
460≡060 \equiv 0y=0y = 0

That is 7 solutions, plus one "point at infinity" in the projective plane, 8 in all. A naive guess, one point per value of xx plus the point at infinity, would give p+1=6p + 1 = 6. In 1933 Helmut Hasse proved that for any elliptic curve and prime pp the count NN satisfies

∣N−(p+1)∣≤2p.|N - (p + 1)| \le 2\sqrt{p} .

Here ∣8−6∣=2≤25≈4.47|8 - 6| = 2 \le 2\sqrt 5 \approx 4.47. Hasse's bound is the Riemann hypothesis for elliptic curves: it says the zeros of the curve's zeta function lie on a critical line. Weil proved the analogue for all curves in the 1940s and conjectured it for all varieties. The error term 2p2\sqrt p is controlled by the curve's genus, its topology over the complex numbers. That link between counting and topology is what Grothendieck's cohomology and Deligne's 1974 proof finally explained.

Chapter VI

From Geometry to Fermat

By then algebraic geometry had become the working language of number theory. Its most famous result is Fermat's Last Theorem: xn+yn=znx^n + y^n = z^n has no solutions in positive whole numbers for n>2n > 2. It was proved by showing that a hypothetical solution would produce an elliptic curve, a cubic of genus 1, too strange to exist. Andrew Wiles announced the proof in 1993. After a gap was found, he repaired it with Richard Taylor in 1994. The number-theoretic side of that story, from Mordell and Taniyama to Frey and Ribet, is told in arithmetic geometry, where this field and the Number Theory Thread meet.

The field's frontier now runs through two Millennium Prize Problems. The Hodge conjecture asks whether topology is always witnessed by algebra. The Birch and Swinnerton-Dyer conjecture asks whether an elliptic curve's rational points can be read from an analytic function. Beneath both lies an older foundational question, settled by Hironaka in 1964 for characteristic zero but still open over fields of prime characteristic: whether every singular variety can be smoothed out.

Applications

Where it is used

  • Cryptography

    Elliptic-curve cryptography

    The points of an elliptic curve over a finite field form a group in which one operation is easy to perform and hard to reverse. Proposed independently by Neal Koblitz and Victor Miller in 1985, elliptic-curve cryptography now secures most web connections and cryptocurrency signatures with far shorter keys than older methods.

    › Sources (2)
    • Koblitz, N. (1987). Elliptic curve cryptosystems. Mathematics of Computation 48(177): 203–209.
    • Miller, V. S. (1986). Use of elliptic curves in cryptography. In Advances in Cryptology — CRYPTO '85, Lecture Notes in Computer Science 218: 417–426.
  • Communications

    Error-correcting codes from polynomials

    Reed–Solomon codes encode data as values of a polynomial over a finite field, so that damaged pieces can be reconstructed from the rest. They protect QR codes, optical discs and signals from deep-space probes. Codes built on higher-genus curves, called algebraic-geometry codes, extend the idea.

    › Sources (1)
    • Reed, I. S. & Solomon, G. (1960). Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics 8(2): 300–304.
  • Robotics

    Solving the equations of a robot arm

    The positions a jointed robot arm can reach are the solutions of polynomial equations in its joint angles. Computational algebraic geometry, especially Gröbner bases, solves these systems exactly for motion planning and inverse kinematics.

    › Sources (1)
    • Cox, D., Little, J. & O'Shea, D. (2015). Ideals, Varieties, and Algorithms (4th ed.). Springer.
  • String theory↗ Physics · Quantum Field Theory

    Mirror symmetry and counting curves

    In 1991 physicists used string theory's "mirror symmetry" to predict how many rational curves of each degree lie on a particular Calabi–Yau threefold, the quintic. That was a problem algebraic geometers had struggled with for decades. The predictions were later proved, and the exchange created a new branch of the field.

    › Sources (1)
    • Candelas, P., de la Ossa, X. C., Green, P. S. & Parkes, L. (1991). A pair of Calabi–Yau manifolds as an exactly soluble superconformal theory. Nuclear Physics B 359(1): 21–74.
  • Evolutionary biology↗ Biology · Evolutionary Biology

    Algebraic statistics for evolutionary trees

    Models of DNA evolution along a tree predict probabilities of site patterns that satisfy polynomial equations, called phylogenetic invariants. Treating statistical models as algebraic varieties helps decide which evolutionary tree best fits the data.

    › Sources (1)
    • Pachter, L. & Sturmfels, B. (eds.) (2005). Algebraic Statistics for Computational Biology. Cambridge University Press.

Open problems

Where the map runs out

Open

The Hodge conjecture

Open as of 2026. A Clay Millennium Prize Problem.

For a smooth projective variety over the complex numbers, certain topological features, the "Hodge classes" in its cohomology, are conjectured to always come from actual algebraic subvarieties, combined with rational coefficients. Topology would then always be witnessed by algebra.

Why it is hard

There is no general method for building algebraic subvarieties out of topological data. The conjecture is known for classes of the lowest nontrivial degree (Lefschetz, 1924) but not beyond, and a stronger version with integer coefficients is known to be false. Any proof must therefore use the rational coefficients in an essential way.

What resolving it unlocks

It would make topology a reliable guide to algebraic geometry. It is also a pillar of Grothendieck's envisioned theory of motives, a universal cohomology behind all the others.

› Sources (1)
  • Deligne, P. (2006). The Hodge conjecture. In J. Carlson, A. Jaffe & A. Wiles (eds.), The Millennium Prize Problems: 45–53. Clay Mathematics Institute / AMS.

Open

The Birch and Swinnerton-Dyer conjecture

Open as of 2026. Known when the analytic rank is 0 or 1. A Clay Millennium Prize Problem.

An elliptic curve can have infinitely many rational points, generated by a finite number of them (the rank). Birch and Swinnerton-Dyer conjectured in the 1960s, from early computer experiments, that the rank can be read off from the behaviour of an analytic function, the curve's LL-function, at a single point.

Why it is hard

Rational points are notoriously hard to find or rule out, and there is no general algorithm guaranteed to compute the rank. The work of Gross–Zagier and Kolyvagin proves the conjecture only when the LL-function vanishes to order 0 or 1. Beyond that, no known method produces the predicted points.

What resolving it unlocks

It would give a way to decide how many rational solutions a cubic equation has. It would also settle, for example, which whole numbers are the areas of right triangles with rational sides, the ancient "congruent number" problem.

› Sources (1)
  • Wiles, A. (2006). The Birch and Swinnerton-Dyer conjecture. In J. Carlson, A. Jaffe & A. Wiles (eds.), The Millennium Prize Problems: 31–41. Clay Mathematics Institute / AMS.

Open

Resolution of singularities in positive characteristic

Proved over fields of characteristic zero (Hironaka, 1964) and in dimension up to three in positive characteristic. Open beyond.

Varieties can have singular points, such as sharp corners or places where a curve crosses itself. Can every variety be modified into a smooth one without changing it elsewhere? Hironaka proved it can when the numbers involved have characteristic zero. Over fields of prime characteristic, the question remains open in dimension four and above.

Why it is hard

Hironaka's proof uses an induction on dimension through special smooth hypersurfaces that simply do not exist in positive characteristic. There, singularities can get worse under the standard repairs, and no replacement strategy has worked in general.

What resolving it unlocks

Many theorems of arithmetic geometry assume a smooth model is available and must be worked around when it is not. A general resolution would remove that obstacle throughout the subject.

› Sources (1)
  • Hironaka, H. (1964). Resolution of singularities of an algebraic variety over a field of characteristic zero, I, II. Annals of Mathematics 79: 109–203, 205–326.

Further reading

  1. Reid, M. (1988). Undergraduate Algebraic Geometry. Cambridge University Press.

    A short, lively first course on curves and conics, with memorable asides on the field's culture.

  2. Cox, D., Little, J. & O'Shea, D. (2015). Ideals, Varieties, and Algorithms (4th ed.). Springer.

    A computational introduction needing only linear algebra, with applications to robotics and geometry theorem proving.

  3. Hartshorne, R. (1977). Algebraic Geometry. Springer.

    The standard graduate text in Grothendieck's language of schemes. Demanding.

  4. Dieudonné, J. (1985). History of Algebraic Geometry. Trans. J. D. Sally. Wadsworth.

    A participant's history, from ancient conics to Grothendieck.