The Class Group - Examples and Constructions
Computing class groups explicitly requires combining theoretical bounds with computational techniques for ideal arithmetic.
Let with and discriminant .
The Minkowski bound is:
So every ideal class has a representative with norm . Check primes up to 5:
- where : non-principal (if principal, impossible)
- : factors as
- : principal
We find is principal, so has order 2. Therefore and .
For , we have and Minkowski bound .
Factor small primes:
- : ramifies
- : splits
Computing: and are non-principal. Check relations: for some .
Working through the arithmetic shows has order 3, giving and .
For quadratic fields , Gauss developed genus theory to analyze class group structure.
The class group contains a subgroup of squares of ideal classes. The quotient is an elementary abelian 2-group whose structure is determined by the factorization of .
For with distinct odd primes , the genus group has order , explaining part of the class group structure.
Modern computational algebra systems compute class groups via:
- Buchmann's algorithm: Use relation matrix of small prime ideals
- Compute regulator: Find fundamental units
- Evaluate : Use class number formula
- Verify: Check consistency of computed
This combination of algebraic and analytic methods is essential for large discriminants.
The Hilbert class field is the maximal unramified abelian extension of . Its key properties:
- All prime ideals of split completely or remain prime in
- has class number 1 (principal ideal domain)
For , since , we have itself.
For with , the Hilbert class field is with .
For , the tower of Hilbert class fields:
can be infinite! Golod-Shafarevich constructed examples where this tower never terminates, showing class numbers can grow arbitrarily fast in such towers.