Dirichlet's Unit Theorem - Examples and Constructions
Computing fundamental units requires combining continued fractions, lattice reduction, and numerical approximation techniques.
For with square-free, the fundamental unit is obtained from the continued fraction expansion of .
For : with period 5.
The convergents give solutions to :
- : gives
- : gives
Therefore (or if allowing norm ).
Consider where (totally real cubic field).
The three real embeddings give fundamental units. Using LLL algorithm on the unit lattice:
Verification requires checking these are independent under the logarithmic embedding and that they generate modulo torsion.
For (cyclotomic field of conductor 7):
- Degree
- Signature: , so unit rank
Fundamental units can be taken as:
Computing embeddings numerically and evaluating the logarithmic map gives regulator .
Computational algorithms for units:
- LLL reduction: Reduce basis of unit lattice
- Enumeration: Search for small-norm elements systematically
- Class group computation: Use relation with regulator via class number formula
- -adic methods: Use -adic logarithms for cyclotomic fields
Modern systems (Pari/GP, Magma, SageMath) implement these efficiently.
In abelian extensions of imaginary quadratic fields, Stark units provide explicit generators for unit groups.
For and its ray class field , the Stark unit is:
This unit, predicted by Stark's conjectures, has special properties: its -function values encode arithmetic data of the extension.
For a finite set of primes, the -units are elements invertible outside :
By Dirichlet's -unit theorem: .
For and : .
-units are crucial for solving unit equations and studying integral points on varieties.
If are number fields with unit groups , the unit group of the compositum relates via:
The index is bounded and connected to ramification. For linearly disjoint extensions, the regulator satisfies:
with equality when are linearly disjoint over .