Number Fields and Rings of Integers - Examples and Constructions
Constructing explicit examples of number fields and computing their rings of integers provides insight into the general theory.
The field has ring of integers . This is a unique factorization domain. The units are , and the discriminant is .
The prime factorization in reveals:
- Primes split: for some prime
- The prime ramifies:
- Primes remain prime in
For , let be a primitive -th root of unity. The -th cyclotomic field is , with degree (Euler's totient function).
The ring of integers is , and the discriminant is
Cyclotomic fields have rich arithmetic: they played a crucial role in the proof of Fermat's Last Theorem for regular primes.
Quadratic fields split into two types:
- Real quadratic fields (): Have infinitely many units. For example, has fundamental unit with
- Imaginary quadratic fields (): Have finitely many units. Only nine imaginary quadratic fields have class number 1:
The question of which number fields have class number 1 (i.e., is a UFD) is deep and largely open for degrees . For imaginary quadratic fields, the list above is complete (Baker-Heegner-Stark theorem).
Consider where . This is a totally real cubic field (all three embeddings are real). Computing requires checking when elements of satisfy monic polynomials over .
For this field, , meaning the ring of integers is monogenic. However, not all number fields are monogenic; some require multiple generators.
Constructing number fields with prescribed properties is an active area of research. Tools include:
- Compositum: If are number fields, their compositum is the smallest number field containing both
- Galois closure: Every number field embeds in a Galois extension
- Class field theory: Constructs abelian extensions with controlled ramification