In mathematics, the Gauss class number problem, as usually understood, is to provide for each n ≥ 1 a complete list of imaginary quadratic fields having class number n. It is named after Carl Friedrich Gauss. It can also be stated in terms of discriminants. There are related questions for real quadratic fields and for the behavior as. The difficulty is in effective computation of bounds: for a given discriminant, it is easy to compute the class number, and there are several ineffective lower bounds on class number, but effective bounds are harder.
Gauss's original conjectures
The problems are posed in Gauss's Disquisitiones Arithmeticae of 1801. Gauss discusses imaginary quadratic fields in Article 303, stating the first two conjectures, and discusses real quadratic fields in Article 304, stating the third conjecture. ;Gauss Conjecture : ;Gauss Class Number Problem : For given low class number, Gauss gives lists of imaginary quadratic fields with the given class number and believes them to be complete. ;Infinitely many real quadratic fields with class number one: Gauss conjectures that there are infinitely many real quadratic fields with class number one. The original Gauss class number problem for imaginary quadratic fields is significantly different and easier than the modern statement: he restricted to even discriminants, and allowed non-fundamental discriminants.
Status
;Gauss Conjecture: Solved, Heilbronn, 1934. ;Low class number lists: Class number 1: solved, Baker, Stark, Heegner. ;Infinitely many real quadratic fields with class number one: Open.
For imaginary quadratic number fields, the discriminants of class number 1 are: The non-fundamental discriminants of class number 1 are: Thus, the even discriminants of class number 1, fundamental and non-fundamental are:
In 1934, Hans Heilbronn proved the Gauss Conjecture. Equivalently, for any given class number, there are only finitely many imaginary quadratic number fields with that class number. Also in 1934, Heilbronn and Edward Linfoot showed that there were at most 10 imaginary quadratic number fields with class number 1. The result was ineffective : it did not give bounds on the size of the remaining field. In later developments, the case n = 1 was first discussed by Kurt Heegner, using modular forms and modular equations to show that no further such field could exist. This work was not initially accepted; only with later work of Harold Stark and Bryan Birch was the position clarified, and Heegner's work understood. See Stark–Heegner theorem, Heegner number. Practically simultaneously, Alan Baker proved what we now know as Baker's theorem on linear forms in logarithms of algebraic numbers, which resolved the problem by a completely different method. The case n = 2 was tackled shortly afterwards, at least in principle, as an application of Baker's work. The complete list of imaginary quadratic fields with class number one is with k one of The general case awaited the discovery of Dorian Goldfeld in 1976 that the class number problem could be connected to the L-functions of elliptic curves. This effectively reduced the question of effective determination to one about establishing the existence of a multiple zero of such an L-function. With the proof of the Gross-Zagier theorem in 1986, a complete list of imaginary quadratic fields with a given class number could be specified by a finite calculation. All cases up to n = 100 were computed by Watkins in 2004.
Real quadratic fields
The contrasting case of real quadratic fields is very different, and much less is known. That is because what enters the analytic formula for the class number is not h, the class number, on its own — but h log ε, where ε is a fundamental unit. This extra factor is hard to control. It may well be the case that class number 1 for real quadratic fields occurs infinitely often. The Cohen–Lenstra heuristics are a set of more precise conjectures about the structure of class groups of quadratic fields. For real fields they predict that about 75.446% of the fields obtained by adjoining the square root of a prime will have class number 1, a result that agrees with computations.
