A line of cubics that are all cyclic
Worth reading first: Twenty-seven million cubics, sorted by their symmetry · The quartics whose roots stay paired.
The cubic census sorted every monic cubic with coefficients up to 150 by its Galois group and found the full group of six permutations in 98.7% of them. The three rotations, the cyclic group , turned up in about cubics of a box of side — a share that falls like one over the square root of the volume and tends to nothing. The quartic census found the same law one degree up, and ended on a question the boxes could frame and not answer: a cubic drawn at random from a box has the full group almost surely, but some families of cubics may have a smaller group always. Which families force the smaller group, and why?
For quartics the even ones were such a family: none of them has the full group , because their roots come in pairs . For cubics the answer is less visible and more beautiful. In 1974 Daniel Shanks wrote down the cubics
and every one of them, for every whole and indeed every rational , has the three rotations as its group. They lie on a straight line in the space of coefficients, and that line runs through a region where the rotations are vanishingly rare.
The test the family passes
The quintic essay gave the test that separates the two possible groups of an irreducible cubic: the group is the three rotations exactly when the discriminant is a perfect square. For the cubic the discriminant is
and substituting , , and expanding gives, after the terms collapse,
The discriminant is not merely a square for many values of ; it is the square of a polynomial, so it is a square for every value at once. The hero checks it at the marked member: at the cubic is , and its discriminant is .
Irreducibility is just as uniform. A monic cubic with whole coefficients that factors has a whole-number root dividing its constant term, so the only candidates are 1 and . But , which is odd and never zero, and for every . So no member of the family factors over the rationals, every member has a square discriminant, and every member has the cyclic group. The family is a line of exceptions.
The roots in the hero are real at every , as they must be: a square discriminant is a positive one, and a cubic with positive discriminant has three real roots. For large one root runs off to infinity, close to , while the other two settle near and , at about and . The picture’s left half mirrors its right half through : the member at has as its roots the reciprocals of the roots at , which is the family’s one obvious symmetry and a hint that it has a less obvious one.
A map that turns the roots
The less obvious one is in the hero’s list. At the roots are , and , and the map sends the first to the second, the second to the third and the third back to the first. This is not special to . Substitute into and clear denominators:
an identity in both and . So whenever is a root, so is , and so is the root after that. Applying the map three times returns every number to itself — as a matrix it is , whose cube is minus the identity — so it cycles the three roots of each member without fixing any.
This is the Galois group made visible, and visible in a strong form. For a general cyclic cubic the theorem says that some rational function of a root gives the next root, but says nothing about which function, and it changes from cubic to cubic. Here it is one function for the whole family, a single Möbius transformation with rational coefficients, and the family is precisely the cubics whose roots it permutes. That is the reason the discriminant is a square: the square root of the discriminant is , a quantity unchanged by cycling the roots, and since cycling is the only symmetry available it must be rational.
There is a converse with a long reach. Every cyclic cubic field — every field of degree three whose symmetries are the rotations — is generated by a root of for some rational value of . The family is, in the language of Galois theory, a generic polynomial for the cyclic group of order three: specialise its one parameter and every cyclic cubic field appears, while every specialisation gives a cyclic field or nothing new. The whole of the cubic census’s rare category lives on this one line in disguise, each field reached at some fraction even when the box found it at quite different coefficients.
Equilateral triangles on a circle
A Möbius transformation of order three has two fixed points, and here they are the roots of , the complex cube roots of unity and — the same numbers that, as chaos on the line between two roots found for Newton’s method, a change of variable can carry to and . Make that change, . It sends the real line onto the unit circle, since a real is equally far from and from its conjugate, and it turns the map into multiplication by a cube root of unity, a plain turn of the circle by a third.
Now every member of the family is three points on the circle that a turn by a third permutes: an equilateral triangle. The figure places the roots of six members and checks the side lengths, which agree to a millionth of the radius. The member is decided by where one corner sits, and the table records that position modulo 120°: at , at , rising towards as grows. Conversely any equilateral triangle on the circle with its corners at real points — which on this circle is every point except the image of infinity — is the root set of a cubic whose coefficients are fixed by the triangle, and that cubic is for the corresponding . The family is the circle’s worth of triangles, one for each angle, and the parameter is an angle in disguise.
So a question about Galois groups has become a question about a regular polygon. A cyclic cubic, seen through the right coordinate, is a triangle that a rotation preserves, in exactly the way that the roots of , which the polygon an equation forces drew, are a triangle that the same rotation preserves. The difference is that those roots are fixed and these slide round the circle with .
A diagonal through the box
To see how exceptional the line is, the figure takes the slice of the cubic box in which the constant term is and colours every cubic with and between and by its group, deciding each exactly: it has a rational root if or is a root, and otherwise its group is the rotations exactly when the discriminant, computed in whole numbers, is a perfect square.
Of the 6,561 cubics in the slice, 159 factor and 6,276 have the full group. The remaining 126 are cyclic, and 78 of them lie on one line, — Shanks’s family with , filled along its whole length inside the square. The other 48 are scattered, without a pattern the eye can follow. They are cyclic for reasons of their own, each one a coincidence of whole numbers; and each of them, by the converse above, has a field that some member of the family also generates, at a value of that is a fraction rather than a whole number.
The slice also shows why the boxes never noticed the line. A box of side meets it in about cubics, while the cyclic cubics in the box number about . So the family’s whole-number members are a share of the box’s cyclic cubics that itself falls like . The census counts coincidences scattered through the box, and the family is a structure that the census sees as a thin and shrinking sliver of them.
Why one family can and another cannot
The real question is which families do this, and the discriminant turns it into geometry. A one-parameter family of irreducible cubics has a square discriminant at exactly when there is a number with , which is to say when the curve has a point above . For Shanks’s family that curve is , which falls apart into two parabolas , each with a point above every whatever. The family is cyclic everywhere because its discriminant curve contains a copy of the line.
Try a family that looks just as innocent, . Its discriminant is , which is not the square of anything, and the curve is an elliptic curve. Elliptic curves have only finitely many points with whole coordinates — Carl Ludwig Siegel’s theorem of 1929 — so the family can be cyclic only finitely often among whole . The search runs through every up to a million and finds one: , where . The cubic is cyclic, its roots being , and , and it is the only cyclic member of its family in the range searched. The curve itself is an old acquaintance: multiplying through by 16 and writing , turns it into , which is the elliptic curve hiding in Fermat’s equation — the curve whose shortage of rational points is Fermat’s last theorem for cubes, the case Euler settled. A question about which cubics have the rotations as their group has landed on the exponent three of Fermat.
That is the general shape of the answer, and it is Hilbert’s irreducibility theorem read in reverse. A family’s group at a typical parameter is its group over the field of rational functions in — where the discriminant either is or is not a square of a polynomial — and Hilbert proved in 1892 that every whole-number specialisation outside a thin set keeps that group. So a cubic family is cyclic always when its discriminant is a square in , as Shanks’s is; it is cyclic at a thin set of when the discriminant curve has a few points, as is; and which kind a family is can be read off one polynomial identity.
A norm in the discriminant
The square root of the discriminant has its own structure. With again a complex cube root of unity,
the norm of the Eisenstein integer — a whole number of the form , in the system of integers which primes a form takes used for . A prime that leaves remainder 2 on division by 3 stays prime among the Eisenstein integers, so it can divide a norm only to an even power. The table factorises for from to 12, and every prime in it is 3 or leaves remainder 1; the check runs to without exception.
Those are exactly the primes that can be ramified in a cyclic cubic field, the only primes that can divide its conductor. When is itself a prime — at , giving — the field the member cuts out is the unique cubic field inside the -th roots of unity, the field generated by the Gauss periods that the sums that obey a smaller equation built from sums of roots of unity. At the cubic is , the minimal polynomial of , the period equation for the heptagon. Shanks’s family runs through the period cubics of a sequence of primes, and fills in between them with fields of composite conductor.
Units with nothing to spare
The constant term of is , so the three roots multiply to 1, and each is an algebraic integer whose inverse is also an algebraic integer: each root is a unit of its field. Two of them, and its image , are independent, and by Dirichlet’s theorem a cyclic cubic field, all three of whose embeddings are real, has a unit group of rank two. The regulator — the area of the parallelogram the units’ logarithms span — measures how large units must be. For these two it is computed in the figure for up to 200, and it tracks , within a few per cent by the end of the range.
That is about as small as possible. The roots are near , near and near , and no unit of a field of this size can be much smaller in logarithm than . Shanks’s reason for calling these the simplest cubic fields was what this forces. The class number formula ties the product of the class number and the regulator to the discriminant and an -value, and that product grows roughly like the square root of the field’s discriminant, which for these fields is about . With the regulator held down near , the class number must take up the rest, so the fields of this family have class numbers growing roughly like : they are a supply of cyclic cubic fields where unique factorisation fails badly, with units known in closed form. The same unit-for-unit trade appeared in the real fields that factorise uniquely with the roles reversed, where a large regulator left room for a class number of one.
What the pictures establish and what they do not
The identities are exact. That the discriminant is is a polynomial identity, checked at every drawn member in whole-number arithmetic; that no member factors is a two-line argument; that the Möbius map permutes the roots is an identity, and the hero verifies the permutation numerically at the marked member. The equilateral triangles are an exact consequence of the map becoming a rotation, and the figure measures the sides to confirm the drawing rather than the fact.
The slice and the curve search are exact computations with finite reach. The slice decides each of its 6,561 cubics in whole numbers, so its counts are exact for that slice and say nothing about other slices beyond suggesting their shape. The search on is exhaustive to a million and Siegel’s theorem guarantees finiteness, but no picture here proves that is the only whole point on that curve; for this curve that is known by other methods, and the figure is evidence rather than proof. The regulator figure computes the regulator of the two units the roots supply, which is the regulator of the field only if those two generate the full unit group, and the comparison with is a measurement over two hundred members, not an asymptotic theorem.
And the picture of a family as a line through the box shows one family. It does not show the other generic families for the cyclic cubic — there are many, related to Shanks’s by changes of parameter — or how their lines sit in the box together.
Still open: families of every shape
For cubics the story is complete: the families that are always cyclic are the ones whose discriminant is a square in the parameter, and Shanks’s is the model for all of them. In higher degree the corresponding question is the inverse Galois problem with parameters. For a finite group , is there a polynomial with coefficients in whose group is and whose specialisations give every field with group — a generic polynomial, as Shanks’s is for the cyclic group of order three? For many groups there is, including the symmetric groups and the cyclic groups of small order. For the cyclic group of order eight there provably is not over the rationals, a consequence of the failure of Grunwald’s theorem at the prime 2. For most groups nobody knows.
And for groups where any family at all is known, the best one is a further question. Shanks’s family is simple in a precise sense — one parameter, small coefficients, explicit units — and families of comparable simplicity for cyclic quartic, quintic and sextic fields were found by Marie-Nicole Gras and Emma Lehmer, with units as explicit and class numbers as large. Whether every abelian group has such a simplest family, and what simplest should mean when it does, is a question about how much of the structure of a whole class of fields can be packed into one polynomial.
A rotation written into the coefficients
Every cubic is irreducible with discriminant , so every one has the three rotations as its Galois group, and the rotation is the single map , which on the right circle is a turn by a third that makes each member’s roots an equilateral triangle. The family is a straight line of cyclic cubics in a box where the full group fills nearly everything, and it reaches every cyclic cubic field at some rational . Whether a family is cyclic always, sometimes or almost never is decided by the curve : a parabola gives a point at every , and the elliptic curve of gives a point only at among the first million.
Shares its objects with
Essays that name at least two of the same things, and that neither author linked.
- Three real roots and no real radicals — both name discriminant, galois group, roots of unity
- Every third coefficient — both name cyclic group, roots of unity
- How a polynomial breaks modulo the primes — both name galois group, irreducible polynomial
- The lattice that runs the other way — both name galois group, roots of unity
- Three ways to pair four roots — both name discriminant, galois group
- Two fields that every prime confuses — both name galois group, irreducible polynomial
Named objects
A dashed tag is an object no other essay names yet.
Cyclic groupDiscriminantGalois groupIrreducible polynomialRoots of unityUnit