Concept

Galois group

The group of symmetries of the roots of a polynomial that preserve every relation among them with rational coefficients. Its subgroups match the fields between the rationals and the roots, which is how it decides what can be solved by radicals.

Named by 10 essays across 3 fields — each of them below, with the objects they name alongside it.

The subgroups of a polynomial's symmetries, against the fields they name. Two lattices side by side, one of the subgroups of the symmetry group of the cube roots of two and the other of the fields between the rationals and the splitting field, drawn so that one is the other turned upside down.

The lattice that runs the other way

The symmetries of a polynomial's roots form a group, and the fields between the bottom and the top form a lattice. The two are the same picture, one of them turned over — a bigger group of symmetries fixes less, so it names a smaller field.

algebra · Galois correspondence
The three pairings of the roots of x⁴ + x + 1. Three panels each showing the same four roots of a quartic in the complex plane, joined in a different way into two pairs, with the value of the sum of the pair products beneath.

Three ways to pair four roots

Four roots can be split into two pairs in exactly three ways, and the three numbers r·r′ + r″·r‴ those pairings give are the roots of a cubic whose coefficients can be read straight off the quartic. That cubic is where Ferrari's formula gets its cube roots, and it is also a verdict: whether its roots are rational decides which of the twenty-four symmetries the quartic's roots actually have.

algebra · Galois correspondence
How often each factor pattern occurs, against the Galois group. Bars for four polynomials — x³ − 3x + 1, x³ − 2, x⁴ − 10x² + 1, x⁴ − 2 — giving the share of primes up to 20000 with each factorisation pattern, beside the predicted share from each Galois group.

How a polynomial breaks modulo the primes

Reduce x³ − 2 modulo a prime and it factors: into three linear pieces for some primes, one linear and one quadratic for others, not at all for the rest. Over the primes up to twenty thousand those three patterns occur a sixth, a half and a third of the time — exactly the shares of the identity, the flips and the rotations in the symmetry group of a triangle, the group that permutes the three cube roots of 2. A polynomial's factorisations modulo primes are a census of its Galois group.

algebra · Field extensions
The 3 periods of the 13th roots of unity, and the equation they solve. Roots of unity modulo 13 grouped by the cosets of the index-3 subgroup; the periods 0.274, 1.377, −2.651 are the roots of x³ + x² − 4x + 1.

The sums that obey a smaller equation

The twelve non-trivial thirteenth roots of unity satisfy an equation of degree twelve. Split them into three groups of four — the right three groups — and add each group: the three sums are the roots of x³ + x² − 4x + 1, an equation of degree three with whole-number coefficients. Gauss called such sums periods, found one for every divisor of p − 1, and used them to build the seventeen-gon from four quadratic equations.

algebra · Roots of unity
The twenty maps x ↦ ax + b modulo 5, as permutations of five roots. A four-by-five grid of pentagons; in each, arrows show where the map ax + b modulo 5 sends each of the five corners. Rows are the slopes 1, 4, 2, 3; columns the shifts 0 to 4.

The quintics that have a formula

No formula solves every equation of degree five, and yet x⁵ − 2 is solved by a fifth root and x⁵ − 5x + 12 by a longer expression of the same kind. A quintic can be solved by radicals exactly when the symmetries of its roots fit inside one group of twenty — the maps x ↦ ax + b on the numbers modulo 5 — and two exact tests on its coefficients say whether they do.

algebra · Galois correspondence
Cardano's formula for x³ − 3x + 1, drawn: three real roots from conjugate cube roots. The complex plane with u³ = −0.50 + 0.866i and its conjugate, their three cube roots each, and the vertical pairings whose sums are the real roots −1.879, 0.347, 1.532.

Three real roots and no real radicals

The cubic x³ − 3x + 1 has three real roots, and Cardano's formula reaches every one of them by way of the cube roots of a complex number. That detour cannot be removed: Hölder proved in 1891 that no expression built from real radicals gives a root of an irreducible cubic whose roots are all real. The proof is three lines of the Galois correspondence, and its general form says that real radicals reach all-real roots only when square roots alone would.

algebra · Galois correspondence
The five lunes that can be squared. Five crescents with arc ratios 2:1, 3:1, 3:2, 5:1, 5:3 and their equal-area kites; θ = 45.000°, 34.265°, 26.812°, 23.439°, 16.794°.

The five crescents that can be squared

The circle cannot be squared, but some regions bounded by circular arcs can: Hippocrates of Chios found a crescent with exactly the area of a triangle around 440 BC. The trick is to make two multiples of π cancel, and it works for a crescent whose two arcs turn through angles in the ratio m to n exactly when an angle defined by a polynomial can be drawn with ruler and compass. That happens for five ratios and no others.

geometry · Circle area
Every cubic x³ + bx + c up to 30, sorted by its Galois group. A 61 by 61 grid of cubics x³ + bx + c: 309 reducible, lying on lines c = −r³ − rb; 20 cyclic with square discriminant; 3392 with group S3.

Twenty-seven million cubics, sorted by their symmetry

Write down every cubic x³ + ax² + bx + c with coefficients up to 150 and sort each by its Galois group. 98.7% have all six symmetries of three roots. The rest are reducible at a rate of fifteen in every H², or cyclic at five in every H to the three-halves — and the cyclic ones turn up four times as often as chance would allow, because discriminants are not random numbers.

algebra · Galois correspondence
Even quartics never have the full group, and one step away almost all do. Even quartics x^4 + bx^2 + d to 20: reducible 199, S4 0, A4 0, D4 1338, C4 20, V4 124. With +x: reducible 157, S4 1524, A4 0, D4 0, C4 0, V4 0.

The quartics whose roots stay paired

A quartic can have five different Galois groups, and in a box of nearly fourteen million quartics they do not come in order of size. The eight-element group D₄ outnumbers the twelve-element A₄ thirty-five to one. Every even quartic has a smaller group than S₄, and moving one step off that plane restores the full group almost everywhere.

algebra · Galois correspondence
Ramanujan's tau, scaled by the power it grows like. τ(n)/n^5.5 for n ≤ 400; τ(1..8) = 1, -24, 252, -1472, 4830, -6048, -16744, 84480; largest |τ(n)|/n^5.5 for n ≤ 10000: 3.2796 at 4841.

The product raised to the twenty-fourth power

Euler's product (1 − q)(1 − q²)(1 − q³)… has the partition numbers for its reciprocal. Raise it to the twenty-fourth power and multiply by q, and the coefficients that come out — 1, −24, 252, −1472, 4830, −6048 — multiply like the primes they are indexed by, stay inside a bound Ramanujan guessed and Deligne proved fifty-eight years later, agree with a divisor sum modulo 691, and know, modulo 23, how a cubic equation factors.

number · Partitions

Named alongside it

The objects these essays reach for when they reach for this one.

DiscriminantField extensionRoots of unityConstructible numberIrreducible polynomialAlternating groupCongruenceExhaustive searchModular arithmeticPermutationPolynomialRadical extension

All concepts