Choose the real embeddings and one from each complex pair . The logarithmic embedding of number field units isIt is a group homomorphism from multiplication to addition. A unit has absolute norm one, so the coordinate sum is zero and its image lies in a Euclidean hyperplane of dimension .
Here is the required discreteness argument. There are only finitely many algebraic integers of whose conjugate absolute values are bounded by a fixed constant: their monic minimal polynomials have degree at most , and each integer coefficient is an elementary symmetric function of bounded roots, hence belongs to a fixed finite range. There are finitely many such polynomials and finitely many roots of each. A bounded set of logarithms bounds all conjugate absolute values, so every compact region in the logarithmic hyperplane meets the unit image in finitely many points. Thus the image is a discrete additive subgroup.
Use the allowed Euclidean-group theorem: a discrete subgroup of a finite-dimensional real vector space is free abelian on finitely many vectors, with rank at most the dimension. Therefore has rank at most . Its kernel is finite by the same bounded-conjugate argument, now with every absolute value one. Each element of a finite multiplicative group is a root of unity, and conversely every root of unity has all logarithms zero. Thus the kernel is exactly the finite group of roots of unity, and exactly the torsion subgroup of units.
Lift generators of the free logarithmic image to units; together with the finite kernel they generate every unit. HenceThis proves the requested upper bound without invoking the existence half of the Dirichlet unit theorem. The field is a subfield of , and its only real roots of unity are .
Articles by others on the same topic
There are currently no matching articles.