Geometry of Numbers
3 Unit theorem
To study the units of
log embedding
-
Proof. Certainly they are in the kernel. Conversely, note that anything in the kernel has bounded coefficients of the characteristic polynomial, so that there are finitely many possibilities. But its powers are in the kernel, so it must be a root of unity. □
-
Proof. Any thing whose image is near zero has bounded coefficients of the characteristic polynomial, so there are only finitely many such things. □
The units lie in the hyperplane
-
Proof. Suppose that we have a nonzero linear form on
on . We will show there is a unit such that the form on that unit is nonzero. We can assume WLOG that . Consider the region in defined by . For fixed , , we want to choose large enough such that the region has area contains a lattice point. This will happen when . Now choose any values of , and a sufficiently large will make this an equality. Now if is a nonzero lattice point in the region, then . On the other hand, for , . Thus is between and . Thus we can manufacture each to be in any interval of our choosing of a fixed size, so we can produce infinitely many such with norm at most such that the takes distinct values on each. Since there are finitely many ideals of a given norm, two must differ by a unit on which the linear form doesn’t vanish. □