Algebra

A line of cubics that are all cyclic

In a box of cubics the full group of six symmetries is almost universal, and the three rotations are a rare exception. Daniel Shanks's x³ − tx² − (t + 3)x − 1 has the rotations at every whole t, and at every rational one. Its discriminant is the square of t² + 3t + 9, its roots are turned into one another by x ↦ −1/(1 + x), and on a suitable circle every member is an equilateral triangle.

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 A3A_3, turned up in about 5H3/25H^{3/2} cubics of a box of side HH — 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 x4+bx2+dx^4 + bx^2 + d were such a family: none of them has the full group S4S_4, because their roots come in pairs ±r\pm r. For cubics the answer is less visible and more beautiful. In 1974 Daniel Shanks wrote down the cubics

ft(x)=x3−t x2−(t+3) x−1,f_t(x) = x^3 - t\,x^2 - (t + 3)\,x - 1,

and every one of them, for every whole tt and indeed every rational tt, 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.

Three roots that one map rotates, for every t. Shanks cubic roots for t in [-9,6]; at t=2: 3.507019, -0.221876, -1.285142; map permutation 1,2,0.
Fig. 1 The three real roots of x3−tx2−(t+3)x−1x^3 - tx^2 - (t + 3)x - 1 as tt runs from −9-9 to 6, one colour for each branch, with the member at t=2t = 2 marked and its roots listed; the map x↦−1/(1+x)x \mapsto -1/(1 + x) sends each of them to the next.

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 x3+ax2+bx+cx^3 + ax^2 + bx + c the discriminant is

a2b2−4b3−4a3c−27c2+18abc,a^2b^2 - 4b^3 - 4a^3c - 27c^2 + 18abc,

and substituting a=−ta = -t, b=−(t+3)b = -(t + 3), c=−1c = -1 and expanding gives, after the terms collapse,

t4+6t3+27t2+54t+81=(t2+3t+9)2.t^4 + 6t^3 + 27t^2 + 54t + 81 = (t^2 + 3t + 9)^2.

The discriminant is not merely a square for many values of tt; 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 t=2t = 2 the cubic is x3−2x2−5x−1x^3 - 2x^2 - 5x - 1, and its discriminant is 192=36119^2 = 361.

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 −1-1. But ft(1)=−2t−3f_t(1) = -2t - 3, which is odd and never zero, and ft(−1)=1f_t(-1) = 1 for every tt. 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 tt, as they must be: a square discriminant is a positive one, and a cubic with positive discriminant has three real roots. For large tt one root runs off to infinity, close to t+1t + 1, while the other two settle near 00 and −1-1, at about −1/t-1/t and −1−1/t-1 - 1/t. The picture’s left half mirrors its right half through x↦1/xx \mapsto 1/x: the member at −3−t-3 - t has as its roots the reciprocals of the roots at tt, 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 t=2t = 2 the roots are 3.507023.50702, −0.22188-0.22188 and −1.28514-1.28514, and the map x↦−1/(1+x)x \mapsto -1/(1 + x) sends the first to the second, the second to the third and the third back to the first. This is not special to t=2t = 2. Substitute −1/(1+x)-1/(1 + x) into ftf_t and clear denominators:

(1+x)3ft ⁣(−11+x)=−ft(x),(1 + x)^3 f_t\!\left(\frac{-1}{1 + x}\right) = -f_t(x),

an identity in both xx and tt. So whenever ρ\rho is a root, so is −1/(1+ρ)-1/(1 + \rho), and so is the root after that. Applying the map three times returns every number to itself — as a matrix it is (0−111)\begin{pmatrix} 0 & -1 \\ 1 & 1 \end{pmatrix}, 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 (ρ1−ρ2)(ρ2−ρ3)(ρ3−ρ1)(\rho_1 - \rho_2)(\rho_2 - \rho_3)(\rho_3 - \rho_1), 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 ftf_t for some rational value of tt. 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 tt even when the box found it at quite different coefficients.

Equilateral triangles on a circle

Every member is an equilateral triangle on a circle. t=-1: roots 1.24698,-0.44504,-1.80194, angle 67.26; t=0: roots 1.87939,-0.34730,-1.53209, angle 80.00; t=1: roots 2.65109,-0.27389,-1.37720, angle 89.27; t=2: roots 3.50702,-0.22188,-1.28514, angle 95.61; t=5: roots 6.29590,-0.13706,-1.15883, angle 105.48; t=20: roots 21.09267,-0.04526,-1.04741, angle 115.41
Fig. 2 The real line wrapped onto a circle by z=(x−ω)/(x−ωˉ)z = (x - \omega)/(x - \bar\omega), with the roots of six members drawn on it. Each member’s three roots are the corners of an exact equilateral triangle.

A Möbius transformation of order three has two fixed points, and here they are the roots of x2+x+1x^2 + x + 1, the complex cube roots of unity ω\omega and ωˉ\bar\omega — the same numbers that, as chaos on the line between two roots found for Newton’s method, a change of variable can carry to 00 and ∞\infty. Make that change, z=(x−ω)/(x−ωˉ)z = (x - \omega)/(x - \bar\omega). It sends the real line onto the unit circle, since a real xx is equally far from ω\omega and from its conjugate, and it turns the map x↦−1/(1+x)x \mapsto -1/(1 + x) 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°: 67.3°67.3° at t=−1t = -1, 80.0°80.0° at t=0t = 0, rising towards 120°120° as tt 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 ftf_t for the corresponding tt. The family is the circle’s worth of triangles, one for each angle, and the parameter tt 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 x3−1x^3 - 1, 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 tt.

A diagonal through the box

A diagonal of cyclic cubics in a plane of full ones. c=−1, |a|,|b|≤40: cyclic on line 78, cyclic elsewhere 48 ((-36,-21) (-35,-12) (-31,-25) (-30,21) (-26,13) (-21,14) (-21,30) (-20,-9) (-17,10) (-15,-9) (-14,9) (-14,21)…), reducible 159, full 6276.
Fig. 3 The 6,561 cubics x3+ax2+bx−1x^3 + ax^2 + bx - 1 with aa and bb from −40-40 to 4040, coloured when their group is the three rotations and tinted when they factor. The diagonal b=a−3b = a - 3 is Shanks’s family.

To see how exceptional the line is, the figure takes the slice of the cubic box in which the constant term is −1-1 and colours every cubic x3+ax2+bx−1x^3 + ax^2 + bx - 1 with aa and bb between −40-40 and 4040 by its group, deciding each exactly: it has a rational root if 11 or −1-1 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, b=a−3b = a - 3 — Shanks’s family with t=−at = -a, 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 tt that is a fraction rather than a whole number.

The slice also shows why the boxes never noticed the line. A box of side HH meets it in about 2H2H cubics, while the cyclic cubics in the box number about 5H3/25H^{3/2}. So the family’s whole-number members are a share of the box’s cyclic cubics that itself falls like 1/H1/\sqrt H. 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

A parabola of square discriminants and a curve with almost none. x^3 − t x − 1, |t| ≤ 1000000: square discriminant at t=3 (y=9).
Fig. 4 The square root of the discriminant as a curve over tt. For Shanks’s family it is the parabola y=t2+3t+9y = t^2 + 3t + 9, with a point at every whole tt. For x3−tx−1x^3 - tx - 1 it is the elliptic curve y2=4t3−27y^2 = 4t^3 - 27, and a search of every tt up to a million finds a whole point only at t=3t = 3.

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 tt exactly when there is a number yy with y2=disc(t)y^2 = \mathrm{disc}(t), which is to say when the curve y2=disc(t)y^2 = \mathrm{disc}(t) has a point above tt. For Shanks’s family that curve is y2=(t2+3t+9)2y^2 = (t^2 + 3t + 9)^2, which falls apart into two parabolas y=±(t2+3t+9)y = \pm(t^2 + 3t + 9), each with a point above every tt whatever. The family is cyclic everywhere because its discriminant curve contains a copy of the line.

Try a family that looks just as innocent, x3−tx−1x^3 - tx - 1. Its discriminant is 4t3−274t^3 - 27, which is not the square of anything, and the curve y2=4t3−27y^2 = 4t^3 - 27 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 tt. The search runs through every tt up to a million and finds one: t=3t = 3, where 4⋅27−27=81=924 \cdot 27 - 27 = 81 = 9^2. The cubic x3−3x−1x^3 - 3x - 1 is cyclic, its roots being 2cos⁡(π/9)2\cos(\pi/9), 2cos⁡(7π/9)2\cos(7\pi/9) and 2cos⁡(13π/9)2\cos(13\pi/9), 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 X=4tX = 4t, Y=4yY = 4y turns it into Y2=X3−432Y^2 = X^3 - 432, which is the elliptic curve hiding in Fermat’s equation u3+v3=1u^3 + v^3 = 1 — 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 tt — 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 tt, as Shanks’s is; it is cyclic at a thin set of tt when the discriminant curve has a few points, as x3−tx−1x^3 - tx - 1 is; and which kind a family is can be read off one polynomial identity.

A norm in the discriminant

The discriminant's root is a norm of an Eisenstein integer. t=-1: 7 = 7^1; t=0: 9 = 3^2; t=1: 13 = 13^1; t=2: 19 = 19^1; t=3: 27 = 3^3; t=4: 37 = 37^1; t=5: 49 = 7^2; t=6: 63 = 3^2·7^1; t=7: 79 = 79^1; t=8: 97 = 97^1; t=9: 117 = 3^2·13^1; t=10: 139 = 139^1; t=11: 163 = 163^1; t=12: 189 = 3^3·7^1; checked to t=2000 (2002 values).
Fig. 5 t2+3t+9t^2 + 3t + 9 for tt from −1-1 to 12, factorised. Every prime in it is 3 or leaves remainder 1 on division by 3, because it is the norm of the Eisenstein integer t−3ωt - 3\omega.

The square root of the discriminant has its own structure. With ω\omega again a complex cube root of unity,

t2+3t+9=(t−3ω)(t−3ωˉ),t^2 + 3t + 9 = (t - 3\omega)(t - 3\bar\omega),

the norm of the Eisenstein integer t−3ωt - 3\omega — a whole number of the form a+bωa + b\omega, in the system of integers which primes a form takes used for x2+xy+y2x^2 + xy + y^2. 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 t2+3t+9t^2 + 3t + 9 for tt from −1-1 to 12, and every prime in it is 3 or leaves remainder 1; the check runs to t=2,000t = 2{,}000 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 t2+3t+9t^2 + 3t + 9 is itself a prime pp — at t=−1,1,2,4,7,8,10,11t = -1, 1, 2, 4, 7, 8, 10, 11, giving p=7,13,19,37,79,97,139,163p = 7, 13, 19, 37, 79, 97, 139, 163 — the field the member cuts out is the unique cubic field inside the pp-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 t=−1t = -1 the cubic is x3+x2−2x−1x^3 + x^2 - 2x - 1, the minimal polynomial of 2cos⁡(2π/7)2\cos(2\pi/7), 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

Units given by the roots, and a regulator like (ln t)². t=1: R=1.3650, ln²t=0.0000; t=2: R=1.9522, ln²t=0.4805; t=5: R=3.6782, ln²t=2.5903; t=10: R=6.0387, ln²t=5.3019; t=50: R=15.5419, ln²t=15.3039; t=100: R=21.3467, ln²t=21.2076; t=200: R=28.1519, ln²t=28.0722
Fig. 6 For tt from 1 to 200, the regulator of the two units ρ\rho and −1/(1+ρ)-1/(1 + \rho) (solid) against (ln⁡t)2(\ln t)^2 (dashed). The roots of the family are units, and as small as a cubic field’s units can be.

The constant term of ftf_t is −1-1, 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, ρ\rho and its image −1/(1+ρ)-1/(1 + \rho), 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 tt up to 200, and it tracks (ln⁡t)2(\ln t)^2, within a few per cent by the end of the range.

That is about as small as possible. The roots are near tt, near −1/t-1/t and near −1-1, and no unit of a field of this size can be much smaller in logarithm than ln⁡t\ln t. 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 LL-value, and that product grows roughly like the square root of the field’s discriminant, which for these fields is about t2t^2. With the regulator held down near (ln⁡t)2(\ln t)^2, the class number must take up the rest, so the fields of this family have class numbers growing roughly like t2/(ln⁡t)2t^2/(\ln t)^2: 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 (t2+3t+9)2(t^2 + 3t + 9)^2 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 y2=4t3−27y^2 = 4t^3 - 27 is exhaustive to a million and Siegel’s theorem guarantees finiteness, but no picture here proves that t=3t = 3 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 (ln⁡t)2(\ln t)^2 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 GG, is there a polynomial with coefficients in Q(t1,…,tk)\mathbb{Q}(t_1, \ldots, t_k) whose group is GG and whose specialisations give every field with group GG — 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 x3−tx2−(t+3)x−1x^3 - tx^2 - (t + 3)x - 1 is irreducible with discriminant (t2+3t+9)2(t^2 + 3t + 9)^2, so every one has the three rotations as its Galois group, and the rotation is the single map x↦−1/(1+x)x \mapsto -1/(1 + x), 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 tt. Whether a family is cyclic always, sometimes or almost never is decided by the curve y2=disc(t)y^2 = \mathrm{disc}(t): a parabola gives a point at every tt, and the elliptic curve of x3−tx−1x^3 - tx - 1 gives a point only at t=3t = 3 among the first million.

Shares its objects with

Essays that name at least two of the same things, and that neither author linked.

Named objects

A dashed tag is an object no other essay names yet.

Cyclic groupDiscriminantGalois groupIrreducible polynomialRoots of unityUnit