The class number is a degree
Worth reading first: Counting the classes that break factorisation · How a polynomial breaks modulo the primes.
Units that form a lattice ended at a formula in which the class number and the regulator of a field appear only as a product, so that the hardest thing to compute about a field’s units hides the hardest thing to compute about its ideals. For the fields there are no units to hide behind — the regulator is 1 — and the class number can be counted directly. Counting the classes that break factorisation did that: every positive form of discriminant is a point of the upper half-plane, the reduced forms are exactly the points in one small region, and the class number is how many there are.
That makes a count. This essay is about a stranger description of the same number, which turns it into a degree. There is a single function on the upper half-plane whose value at the reduced points are numbers that belong together as the roots of one polynomial with whole-number coefficients — a polynomial of degree exactly , and irreducible, so that each of its roots is an algebraic number of degree . A field with one class gets a root of degree one, which is to say a whole number, and the whole number leaves a fingerprint visible to anybody with a calculator.
A function that cannot tell equivalent forms apart
Two forms are equivalent when a change of variables of determinant one turns one into the other, and on the points such a change acts as with whole and — the modular group. A function on the half-plane that does not change under any of these moves takes one value on each class of forms, so it is a function of the class rather than of the form.
The simplest such function is Klein’s . Write , which is small when is high up the half-plane, and set
where is the sum of the cubes of the divisors of . Both and change under the modular group, but by factors that cancel in the ratio, and is unchanged. Expanded in powers of it begins
with whole-number coefficients throughout. Everything below is computed from these series in exact fixed-point arithmetic, carried to 140 decimal places: the exponential, sine and cosine that give , then and the product, then .
For there are three reduced forms, and the pair , and the figure evaluates at the three points. The first, high up at where is about , gives , real and negative. The other two, lower down where is larger, give a conjugate pair . None of the three looks special. Multiply out , though, and the product is
with every coefficient within of a whole number before rounding. The three values are the three roots of one cubic with whole coefficients. Each is an algebraic integer of degree three, and the three are conjugates of one another in exactly the way and are.
Which values come out real is itself readable from the picture. The forms and are mirror images across the imaginary axis — their points are and — and because every coefficient of ’s expansion is a real whole number, is the complex conjugate of . So mirror-image forms give a conjugate pair, and a form that is its own mirror image, with or or , gives a real value. Those self-mirrored forms are exactly the classes equal to their own inverse under composition, the classes of order one or two, and Gauss’s genus theory counts them: there are , where is the number of primes dividing . So the number of real roots of the class polynomial is : one for and for , whose discriminants are prime, two for , where both roots are real. The geometry of the half-plane, the genus theory of forms and the reality of an algebraic number are one fact read three ways.
One degree for each class
The cubic is no accident of . For every negative discriminant , the product of over the reduced forms is a polynomial with whole-number coefficients, called Hilbert’s class polynomial , and it is irreducible — it cannot be factored over the rationals — so its degree, the number of reduced forms, is the degree of each of its roots. The table computes it for nine discriminants, with class numbers 1, 2, 3, 4, 5, 7 and 11. For , with two classes, the two values of are , and their polynomial is . For , with eleven classes, the polynomial has degree eleven and a largest coefficient of 68 digits; before rounding, every one of its twelve coefficients was within of a whole number, which is a whole number recovered from eleven transcendental-looking series by multiplication alone.
The theory that predicts this is complex multiplication, the part of number theory Leopold Kronecker called the dearest dream of his youth. The values at the points of a field’s forms are called singular moduli, and their properties go beyond being algebraic. Adjoining any one of them to produces a field whose symmetries over are exactly the class group — the classes of forms, multiplied by Gauss’s composition, permute the values of among themselves. That field is the Hilbert class field, the largest extension in which every prime ideal of the base becomes principal, and writes it down explicitly. In the language of the tower of degrees, the extension has degree over and over the rationals, and the class group is its Galois group.
The coefficients grow because the root at the top form dominates. With the top point has , so there is about , and the constant term of is a product of all values. That is why computing this way needs precision that grows with times , and why 140 places are plenty for and would not be for a discriminant with a thousand classes.
When the degree is one
A field with one class has one reduced form, and its class polynomial has degree one: is itself a whole number. The nine such fields give
for , and the figure finds each by evaluating the series and rounding — the computed value was within of the whole number even for 163, where it has eighteen digits. That they are all perfect cubes is a theorem of Weber’s: has a cube root, , which is itself a modular function for a smaller group and takes algebraic-integer values at these points, so for class number one that cube root is a whole number too. That is times a square has the same kind of explanation, through a square root of .
The factorisations hide a further surprise. Every prime appearing in the table is smaller than the discriminant: and , all well below 163. A random eighteen-digit number almost always has a prime factor in the millions. Benedict Gross and Don Zagier explained it in 1985: the difference of two singular moduli, here and , is divisible only by primes that divide numbers of the form , which are bounded by the discriminants. Their paper on singular moduli was the arithmetic preparation for the theorem with Goldfeld that later made the class number problem effective.
The cubic modulo p
A polynomial with whole coefficients can be reduced modulo any prime, and how a polynomial breaks modulo the primes found that the way it factors is a census of its symmetries. For the class polynomial the census has a meaning in terms of forms. The figure takes every prime from 29 to 599, counts the roots of modulo by trying every residue, and separately searches for whole numbers with one of the three reduced forms equal to . The cubic has three roots exactly when takes the value , none when does, and one when no form of discriminant takes at all — on all 100 primes, without exception.
That is a statement which primes a form takes could not make with congruences. For the primes it takes are the ones leaving remainder 1 on division by 4, a condition on alone. For no condition of that kind exists, because the class group has order three and is not a group of residues; a prime such as 59 is taken by while 31 is taken by , and no list of residues, for any modulus, sorts all the primes of one kind from the other. What decides it is a polynomial: is taken by the principal form exactly when splits completely modulo . That is the general shape of the answer, and the class polynomial is what supplies it for every .
The census matches the symmetries, too. The splitting field of has the symmetries of a triangle, the same group as , and the shares in the figure — 14, 36 and 50 out of 100 for three, none and one root — are on their way to , and , the shares of the identity, the rotations and the flips. And a much smaller cubic does the same job. Modulo every one of these primes, has as many roots as , because its real root, the plastic number , generates the same cubic field as ; the class polynomial is simply the most extravagant description of that field.
How near is nearly whole
Now the near-integer. At the point of the reduced form , the variable equals , real, negative and tiny. The expansion of becomes
If has one class, the left side is a whole number, say, and rearranging,
So is a whole number minus a correction, and the size of the correction is the question. The figure plots each term of the expansion on a logarithmic scale for the four largest with one class. The first term is itself, the second is 744, and from then on each term is a coefficient of — which grows, roughly like — times , which shrinks much faster. At the first correction is and each later one is about fifteen powers of ten smaller still, so the whole tail is one number, , to all the precision anyone could want. At the first correction is a fifth and the later ones are not negligible, which is why is an unimpressive near-miss.
Twelve nines
The arithmetic gives
twelve nines after the decimal point, short of by , and the predicted correction agrees with the measured shortfall to every digit the figure prints. Charles Hermite noticed the near-miss in 1859. Martin Gardner announced in his April column of 1975 that Ramanujan had proved to be a whole number, and a good many readers believed him for a month, which is a measure of how implausible the true explanation sounds: a transcendental number that misses being whole because a quadratic field happens to factor uniquely.
The other three are weaker versions of the same event. falls short of by , and of by , each shortfall again . There is no fifth, because there is no tenth field of class number one; the essay that counted the classes traced the history of that theorem, and Kurt Heegner’s original proof of it in 1952 went through modular functions of exactly this kind: he showed that a tenth field would force a singular modulus with properties no whole number can have.
The coefficient 196,884 has its own story, and it is the one connection here that nobody predicted. John McKay noticed in 1978 that it is one more than 196,883, the smallest dimension in which the Monster — the largest sporadic finite simple group, with about elements — can act by rotations. The next coefficient, 21,493,760, is , a sum of the Monster’s first three dimensions, and the pattern continues. John Conway and Simon Norton named it monstrous moonshine in 1979, and Richard Borcherds proved it in 1992. So the number that holds a trillionth short of whole is, minus one, the size of the Monster’s smallest stage.
Where the class polynomial does work
The class polynomial is not only a curiosity; it is how a particular kind of elliptic curve is built. Every value of is the -invariant of an elliptic curve — two curves are the same over the complex numbers exactly when their -invariants agree — and the singular moduli are the -invariants of the curves with complex multiplication, whose lattices of periods are the ideals of an imaginary quadratic field. Reduce modulo a prime , find a root, and the curve with that -invariant over the field of elements has a number of points that is known in advance: if , it has points, the numbers give or take twice the square root found always lie within of .
That is the complex multiplication method, and it runs in the other direction from the usual problem. Counting the points of a random curve modulo a large prime is a hard computation; choosing , solving , and taking a root of produces a curve whose count is known before it is written down. It is how curves with a prescribed number of points are generated for cryptography, and in the reverse direction it is the engine of Atkin and Morain’s elliptic curve primality proving, which certifies primes of many thousands of digits by building such curves modulo the candidate. The precision needed to compute — growing with — is the practical limit on which discriminants the method can use, which is why the coefficient sizes in the table matter outside this essay.
What the computations show and what they assume
The coefficients are measured, not quoted. Every value of is computed to 140 decimal places from the defining series, the products are expanded in the same arithmetic, and the distance of each coefficient from the nearest whole number is reported: for , for , where eleven roots and the growth of the coefficients use up the precision. That the coefficients are exactly whole is the theorem of complex multiplication, which no finite computation proves; the computation shows that they are whole to far more places than any coincidence could supply.
The census modulo primes is exact. Roots modulo are found by trying every residue, the forms’ values by searching every small pair, and the agreement is checked on every prime from 29 to 599. It is evidence for the statement about all primes, and the theorem behind it — that the principal form takes exactly when splits completely modulo , for primes not dividing the polynomial’s discriminant — is class field theory.
And the picture shows only imaginary fields. A real quadratic field has indefinite forms, whose points lie on the real line rather than in the upper half-plane, and has nothing to say there; real fields that factorise uniquely counted their classes by cycles of forms instead, with no single number whose degree is the class number.
Still open: the same dream for the real fields
Kronecker’s dream was to generate every abelian extension of a field by special values of explicit functions. For the rationals, the exponential does it: the roots of unity, values of at rational , generate every abelian extension of , which is the Kronecker–Weber theorem. For an imaginary quadratic field, and its companions do it, as here. David Hilbert asked in 1900, as the twelfth of his problems, for the functions that would do the same for every number field.
For real quadratic fields, no analogue of is known. Harold Stark conjectured in the 1970s that the values of certain derivatives of -series are logarithms of units generating the right extensions, and the conjecture has been checked numerically in many cases; Samit Dasgupta and Mahesh Kakde gave a -adic answer for totally real fields in 2021, through units constructed -adically rather than by a complex function. A description as concrete as “evaluate this function at the points of the reduced forms” is still missing for , and the question of what replaces the upper half-plane and the modular group there is one of the central open problems connecting number theory to analysis.
A count that is also a degree
The class number of is a count of reduced forms and also the degree of an algebraic number: the modular function at the reduced points gives conjugate values whose polynomial has whole-number coefficients. For the three values make a cubic whose roots modulo each prime say which form takes that prime; for eleven values make a polynomial of degree eleven; and for the nine fields with one class the value is a whole number, always a cube, built from small primes only. At that whole number sits next to , separated by a correction of 196,884 times a trillionth of a trillionth of its size — a coefficient that, less one, counts the dimensions of the Monster’s smallest representation.
Shares its objects with
Essays that name at least two of the same things, and that neither author linked.
- On the circle and never home — both name algebraic integer, minimal polynomial, unique factorisation
- Class groups drawn at random — both name class number, quadratic form
- Euler's sixty-five convenient numbers — both name class number, quadratic form
- Factoring uniquely with no way to divide — both name algebraic integer, unique factorisation
- The integers a field contains — both name algebraic integer, minimal polynomial
Named objects
A dashed tag is an object no other essay names yet.
Algebraic integerClass numberGalois groupMinimal polynomialModular groupQuadratic formUnique factorisation