The Langlands Program
In January 1967, a 30-year-old mathematician named Robert
Langlands handed André Weil a seventeen-page handwritten letter, apologising in the first
line: "If you are willing to read it as pure speculation I would appreciate that; if not — I am sure
you have a waste basket handy." It did not go in the basket. That letter sketched a web of
conjectures so vast and so precise that half a century later it is routinely called the grand
unified theory of mathematics — a single organising vision linking three subjects that had no
business being related: the arithmetic of prime numbers and Galois symmetry, the
analysis of highly symmetric functions, and the L-functions that turn out to be the
common language of both.
This page is a bird's-eye tour of that vision. It is deliberately a map, not a proof — most of the
Langlands program is still conjectural, and we will be honest about exactly which
pieces are theorems and which are dreams. But the pieces that are proved include some of the
deepest results of the last hundred years, Fermat's Last Theorem among them.
Three worlds that turned out to be one
The Langlands program is best pictured as a Rosetta Stone: the same information written
in three different languages, each fluent to a different tribe of mathematicians.
-
Arithmetic / Galois side. Solutions of polynomial equations and the symmetries that
permute them — encoded in Galois representations, homomorphisms
\rho:\operatorname{Gal}(\overline{\mathbb{Q}}/\mathbb{Q})\to \mathrm{GL}_n(\mathbb{C})
from the absolute Galois group into matrices. This is discrete, rigid, deeply arithmetic.
-
Analytic / Automorphic side. Functions of extreme symmetry —
automorphic forms and representations, the higher-dimensional cousins of
modular
forms, living on symmetric spaces attached to a group like
\mathrm{GL}_n. This is continuous, harmonic, analytic.
-
L-functions — the bridge. Each object on either side spins off an
L-function,
a Dirichlet series \sum a_n n^{-s} with an Euler product. Langlands'
claim, at its heart, is that the two sides produce the very same L-functions — so
they must secretly be the same objects.
The dictionary is the content. A Galois representation \rho should correspond
to an automorphic representation \pi exactly when
L(s,\rho) = L(s,\pi). Two utterly different constructions, forced to agree
coefficient by coefficient, prime by prime.
Picturing the bridge
Step through the diagram: two disconnected worlds, then the L-function each throws off, then the
astonishing bridge — reciprocity — that says the L-functions coincide, welding the arithmetic
world to the analytic one.
Reciprocity: the vast generalisation of a schoolroom gem
The heart of Langlands is reciprocity, and it has a humble ancestor everyone meets:
quadratic
reciprocity. Gauss's law says whether p is a square modulo
q is governed by whether q is a square modulo
p — a wholly unexpected symmetry between two different primes. In the 20th
century this grew into class field theory, which completely describes the
abelian Galois extensions of a number field in terms of the field's own arithmetic. Class field
theory is, in modern language, exactly the Langlands correspondence for the group
\mathrm{GL}_1 — the one-dimensional, abelian case.
-
Quadratic reciprocity (Gauss): a symmetry between two primes — the
\mathrm{GL}_1 story for a quadratic character.
-
Class field theory (Takagi, Artin): all abelian reciprocity —
\mathrm{GL}_1 over any number field. Fully proved.
-
Langlands reciprocity: the non-abelian generalisation to
\mathrm{GL}_n — every n-dimensional Galois
representation should come from an automorphic form. Largely conjectural; proved in landmark
special cases.
So Langlands took the one piece of "magic" every number theorist admires — that distant primes talk to
each other — and conjectured that it is the n=1 shadow of an
infinite-dimensional symmetry running through all of arithmetic.
Functoriality: the second pillar
Reciprocity connects the two sides. Functoriality is the internal engine on the
automorphic side, and it is arguably the deeper of the two conjectures. The L-group
{}^{L}G is a companion group Langlands attached to each reductive group
G. His principle of functoriality says: every homomorphism of L-groups
{}^{L}H \to {}^{L}G should induce a transfer of automorphic representations
from H to G, in a way that multiplies the
L-functions correctly.
That sounds abstract, but its consequences are ferociously concrete. Functoriality would imply that if
you have automorphic forms \pi and \pi', you can
build their tensor product, their symmetric powers, and so on, and each is again
automorphic — which instantly hands you the analytic continuation and functional equation of a huge stock
of L-functions. The
Rankin–Selberg
construction and the
Sato–Tate
distribution are, at bottom, functoriality cashed out. It is the master key: prove
functoriality and a hundred hard theorems fall out as corollaries.
The crown jewel: Fermat, via modularity
The most famous consequence of Langlands-style reciprocity is Fermat's Last Theorem. The
chain of ideas is a perfect miniature of the whole program:
\underbrace{a^p+b^p=c^p}_{\text{a solution}}\;\longrightarrow\;\underbrace{E:\,y^2=x(x-a^p)(x+b^p)}_{\text{Frey elliptic curve}}\;\longrightarrow\;\underbrace{\rho_E}_{\text{Galois rep}}\;\overset{?}{\longleftrightarrow}\;\underbrace{f}_{\text{modular form}}
An elliptic
curve E over \mathbb{Q} has a Galois
representation \rho_E on its p-torsion. The
Modularity Theorem (Wiles, Taylor–Wiles, then Breuil–Conrad–Diamond–Taylor) is the
Langlands reciprocity statement for these curves: every elliptic curve over
\mathbb{Q} is modular — its \rho_E comes
from a modular form, equivalently L(s,E)=L(s,f). Frey and Ribet had shown that
a Fermat solution would produce an elliptic curve too strange to be modular. So modularity and a
Fermat solution cannot both exist — and modularity is true. Fermat falls out of a single instance of the
Langlands correspondence.
Both sides are L-functions built prime by prime, and the correspondence forces the local factors to
match. On the curve, at a good prime p, you count points:
a_p = p + 1 - \#E(\mathbb{F}_p). On the modular form, you read off the
p-th Fourier coefficient a_p of its
q-expansion. Modularity is the astonishing assertion that
these two numbers are equal, for every prime. A geometric point-count on the left; a coefficient
of a harmonic function on the right — the same integer. The runnable box below computes the left-hand
side for a real curve so you can watch the sequence that a modular form must reproduce exactly.
Reciprocity you can compute
Take the elliptic curve E: y^2 = x^3 - x. For each prime
p we count its points over \mathbb{F}_p and form
a_p = p + 1 - \#E(\mathbb{F}_p). Modularity says this sequence
(a_p) is also the Fourier-coefficient sequence of a weight-2 modular
form — a genuine, checkable instance of the Langlands bridge. The point counting uses the Legendre symbol:
the number of y with y^2 \equiv t is
1+\left(\tfrac{t}{p}\right).
// Langlands reciprocity, made concrete: point-counts a_p on E: y^2 = x^3 - x.
// Modularity (a special case of Langlands) says these a_p are ALSO the Fourier
// coefficients of a weight-2 modular form. Here we compute the arithmetic side.
function legendre(t: number, p: number): number {
t = ((t % p) + p) % p;
if (t === 0) return 0;
// Euler's criterion: t^((p-1)/2) mod p is 1 (square) or p-1 (non-square).
let r = 1, base = t, e = (p - 1) / 2;
while (e > 0) {
if (e & 1) r = (r * base) % p;
base = (base * base) % p;
e = Math.floor(e / 2);
}
return r === 1 ? 1 : -1;
}
function isPrime(n: number): boolean {
if (n < 2) return false;
for (let d = 2; d * d <= n; d++) if (n % d === 0) return false;
return true;
}
// a_p = p + 1 - #E(F_p); #E = 1 (point at infinity) + sum_x (1 + legendre(x^3 - x, p))
function ap(p: number): number {
let count = 1; // the point at infinity
for (let x = 0; x < p; x++) {
const t = ((x * x % p) * x - x) % p; // x^3 - x mod p
count += 1 + legendre(t, p);
}
return p + 1 - count;
}
const primes: number[] = [];
for (let n = 3; primes.length < 10; n++) if (isPrime(n)) primes.push(n);
console.log("prime p : a_p = p + 1 - #E(F_p)");
for (const p of primes) {
const a = ap(p);
const tag = p % 4 === 3 ? " (p ≡ 3 mod 4 ⇒ supersingular, a_p = 0)" : "";
console.log(` ${String(p).padStart(3)} : ${String(a).padStart(3)}${tag}`);
}
Notice the pattern the modular form must match: a_p = 0 exactly when
p \equiv 3 \pmod 4 (these are the supersingular primes for this
CM curve), and a_p \neq 0 when p\equiv1\pmod4, where
in fact a_p = 2a for the unique way p=a^2+b^2 with
a odd. That an analytic modular form knows this purely arithmetic
pattern is the Langlands philosophy in a nutshell.
What is proved, and what is a dream
Honesty check. The Langlands program is a web of conjectures, and the map of "done vs. open" is
the most important thing to keep straight.
| Statement | Setting | Status |
|---|
| Class field theory (abelian, \mathrm{GL}_1) | number fields | Proved (Takagi–Artin) |
| Modularity of elliptic curves | \mathrm{GL}_2/\mathbb{Q} | Proved (Wiles et al.) ⇒ Fermat |
| Local Langlands | \mathrm{GL}_n over local fields | Proved (Harris–Taylor, Henniart) |
| Langlands over function fields | \mathrm{GL}_n/\mathbb{F}_q(t) | Proved (Drinfeld, L. Lafforgue) |
| Geometric Langlands | curves over \mathbb{C} | Proved 2024 (Gaitsgory et al.) |
| Global functoriality; full reciprocity | \mathrm{GL}_n/\mathbb{Q} | Open — the frontier |
Four Fields Medals sit in that table — Drinfeld (1990), Lafforgue (2002), Ngô (2010, for the
Fundamental Lemma that unblocked the trace formula), and the tradition continues. Each proved a
slice: a fixed group, a fixed field, a fixed dimension. The general statement over
\mathbb{Q}, for all n at once, remains one of the
great open problems of mathematics.
Two traps snare newcomers. First, "the Langlands program" is not a single statement you
can prove or disprove; it is a philosophy spun into a lattice of interlocking conjectures
(reciprocity, functoriality, local and global versions, the geometric analogue). When someone says
"Langlands was proved," always ask which Langlands — which group, which field, which dimension.
The honest headline is that the general program over \mathbb{Q} is
open; what is proved are powerful special cases.
Second, do not conflate reciprocity (Galois \leftrightarrow
automorphic) with functoriality (transfers within the automorphic world along
L-group maps). They are different conjectures pointing in different directions, even though each would help
prove the other. And beware the seductive slogan "grand unified theory of mathematics": it is a marketing
line, not a claim that Langlands subsumes geometry, logic, or analysis wholesale. What it genuinely unifies
is a specific — if enormous — triangle: number theory, harmonic analysis, and L-functions.
The strangest ingredient is the {}^{L}G. Why should proving things about
\mathrm{GL}_n require a second, dual group? The clue came from
harmonic analysis: the natural parameters for the representations of a group
G turned out to be governed not by G but by a group
with the roots and coroots swapped — the Langlands dual. For
\mathrm{GL}_n the dual is again \mathrm{GL}_n (it is
self-dual), which is why that case came first and cleanest; for \mathrm{SO} and
\mathrm{Sp} the dual is a genuinely different group, and the bookkeeping gets
wild. The appearance of this dual is one of those moments where mathematics seems to be hinting at a
structure deeper than the objects it is built from — and pinning down that hint is exactly what makes the
program a frontier rather than a finished theory.