KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe Dirichlet Unit Theorem, ComputationallyEngineering · Engineering MathematicsLesson 796/884← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginunit groupDirichlet unit theoremfundamental unitsroots of unity
On this page

Ask about this page

KEVOS AIThe Dirichlet Unit Theorem, Computationally

KEVOS knowledge first · trusted web sources when needed

Class Groups, Units and Regulators

The Dirichlet Unit Theorem, Computationally

The structure of the unit group, its rank from the signature, and what computing units actually requires.

Engineering / MathematicsClass Groups, Units and Regulators2 min readKV-MATH-0594

The Dirichlet unit theorem gives the structure of the unit group completely: a finite cyclic torsion part and a free part of known rank. What it does not give is any way to find the generators.

The theorem

O^x is isomorphic to mu(K) x Z^(r1 + r2 - 1)mu(K) is the finite group of roots of unity in K.

Unit rank by signature

Rational numbersr1 = 1, r2 = 0, rank 0 — units are plus and minus one
Imaginary quadraticr1 = 0, r2 = 1, rank 0 — only roots of unity
Real quadraticr1 = 2, r2 = 0, rank 1 — one fundamental unit
Totally real cubicr1 = 3, rank 2
Generalrank = r1 + r2 - 1

Key point

The rank is free information: it follows from the signature, which follows from counting real roots of the defining polynomial. Knowing the rank in advance is what makes it possible to recognise when enough independent units have been found.

Roots of unity

The torsion subgroup is cyclic and easy to compute. Its order divides a bound obtained from the field degree, and candidates are tested directly.

Computing the roots of unity

  1. Bound the orderOnly roots of unity whose degree divides the field degree can occur, bounding the order.
  2. Test each candidateCheck whether the cyclotomic polynomial of that order has a root in the field.
  3. Take the largestThe group is cyclic; the largest order found generates it.

Note

For a field with a real embedding the only roots of unity are plus and minus one, since any other would be a non-real complex number of absolute value one. This settles the torsion immediately for all totally real fields.

Fundamental units

A system of fundamental units is a basis of the free part. The theorem guarantees one exists but offers no construction, and finding them is the hard part.

Caution

Fundamental units can be astronomically large. For real quadratic fields the fundamental unit routinely has hundreds of digits even for modest discriminants, which means it cannot always be written out in the standard representation and must be handled as a product of smaller elements.

Verification

A candidate system is fundamental when the units are independent and generate the full unit group. Independence is checked via the logarithmic embedding; generation is checked by comparing the regulator against the analytic class number formula.

Key point

A candidate system that is independent but not fundamental gives a regulator that is an integer multiple of the true one. Finding that integer — the index of the subgroup generated — is the final step of any unit computation.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 4.9.2. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.

Related pages

  • The Ideal Class Group
  • The Logarithmic Embedding and the Unit Lattice

Continue learning

The Ideal Class GroupArticle · Engineering MathematicsNEXT LESSON →The Logarithmic Embedding and the Unit LatticeArticle · Engineering MathematicsValuations and UniformisersArticle · Engineering MathematicsThe Regulator: Definition and ComputationArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®