# Class number problem

In mathematics, the **Gauss class number problem** (**for imaginary quadratic fields**), as usually understood, is to provide for each *n* ≥ 1 a complete list of imaginary quadratic fields (for negative integers *d*) 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 (meaning that they involve a constant that is not computed), but effective bounds (and explicit proofs of completeness of lists) are harder.

## Gauss's original conjectures

The problems are posed in Gauss's Disquisitiones Arithmeticae of 1801 (Section V, Articles 303 and 304).[1]

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**(**Class number tends to infinity**)**Gauss Class Number Problem**(**Low class number lists**)- For given low class number (such as 1, 2, and 3), 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 (1966), Stark (1967), Heegner (1952).
- Class number 2: solved, Baker (1971), Stark (1971)[2]
- Class number 3: solved, Oesterlé (1985)[2]
- Class numbers h up to 100: solved, Watkins 2004[3]
**Infinitely many real quadratic fields with class number one**- Open.

## Lists of discriminants of class number 1

For imaginary quadratic number fields, the (fundamental) 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 (Gauss's original question) are:

## Modern developments

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 9 known ones, and at most one further). The result was ineffective (see effective results in number theory): 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.[4]

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.[5] This effectively reduced the question of effective determination to one about establishing the existence of a multiple zero of such an L-function.[5] With the proof of the Gross-Zagier theorem in 1986, a complete list 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.[3]

## 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[6] 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.[7]

## Notes

- The Gauss Class-Number Problems, by H. M. Stark
- Ireland, K.; Rosen, M. (1993),
*A Classical Introduction to Modern Number Theory*, New York, New York: Springer-Verlag, pp. 358–361, ISBN 978-0-387-97329-6 - Watkins, M. (2004),
*Class numbers of imaginary quadratic fields*, Mathematics of Computation,**73**, pp. 907–938, doi:10.1090/S0025-5718-03-01517-5 - Baker (1990)
- Goldfeld (1976)
- Cohen, ch. 5.10
- te Riele & Williams

## References

- Goldfeld, Dorian (July 1985), "Gauss' Class Number Problem For Imaginary Quadratic Fields" (PDF),
*Bulletin of the American Mathematical Society*,**13**(1): 23–37, doi:10.1090/S0273-0979-1985-15352-2 - Heegner, Kurt (1952), "Diophantische Analysis und Modulfunktionen",
*Mathematische Zeitschrift*,**56**(3): 227–253, doi:10.1007/BF01174749, MR 0053135 - te Riele, Herman; Williams, Hugh (2003), "New Computations Concerning the Cohen-Lenstra Heuristics" (PDF),
*Experimental Mathematics*,**12**(1): 99–113, doi:10.1080/10586458.2003.10504715 - Cohen, Henri (1993),
*A Course in Computational Algebraic Number Theory*, Berlin: Springer, ISBN 978-3-540-55640-4 - Baker, Alan (1990),
*Transcendental number theory*, Cambridge Mathematical Library (2nd ed.), Cambridge University Press, ISBN 978-0-521-39791-9, MR 0422171