The exact orders printed in the question are inconsistent. The source PDF says that the orders of group elements are , respectively, and also imposes . Multiplying this relation by and using gives . Since also holds, subtracting gives , contradicting the stated order of a group element . Thus
The natural abelian group presentation interpretation is to impose the relations and , with no further relations, without requiring the orders of the images of the generators to stay . Under this interpretation the calculation is as follows. Since follows from , the mixed relation gives . Consequently , and together with this gives . Conversely, , , and imply every original relation. Eliminating leaves two independent cyclic groups:To verify that these relations force no further identifications, map to in . All defining relations hold, and the inverse group homomorphism sends the two standard generators to . These group homomorphisms are mutually inverse. The divisibility condition gives the requested invariant factors of a finitely generated module over . In this presented group, actually have orders .
Equivalently, the relation matrixhas nonzero Smith normal form entries , with the trivial factor omitted. The displayed direct sum of modules is the answer to the presentation interpretation; the inconsistency of the literal exact-order formulation remains.
For the reverse inclusion, let lie in this intersection of ideals. Since are coprime integers, Bézout's identity supplies with . Multiplying by givesThus , and . ConsequentlyHere Bézout's identity follows from the allowed principal ideal domain property of : the ideal is generated by their greatest common divisor, which is .
Define the group homomorphismBy part (b)(i), its kernel of a group homomorphism isIt is surjective. Indeed, choose with by Bézout's identity. For any prescribed classes and , the integersatisfies and . The first isomorphism theorem for groups therefore givesThis proves the required isomorphism and is the Chinese remainder theorem for coprime integers. It also shows that generates the direct sum of modules when these additive groups are viewed as -modules.
Let be a square-free integer. If , then is the trivial cyclic group. Otherwise, finiteness means that a direct sum of modules decomposition into cyclic groups has only finitely many nontrivial factors, each of finite group order. Omit trivial factors and writeThe integers are coprime integers whenever . If a prime number divided both, then , contradicting the square-free integer hypothesis.
Moreover, and are coprime integers: any common prime divisor would divide one of the earlier factors as well as . Thus part (b)(ii) can be applied repeatedly to combine factors, givingIn particular is a cyclic group. Under the displayed identifications, the element whose coordinate in every factor is the class of is a generator of a group.
Write . The unit group is a finite abelian group of group order , since multiplication in a field satisfies commutativity. The structure theorem for finitely generated abelian groups, applied to this finite group, gives invariant factors of a finitely generated moduleafter omitting trivial factors. If there are no factors, the unit group is trivial and hence a cyclic group.
Otherwise put . Every element satisfies , because the order of a group element in each coordinate divides . Hence all distinct nonzero elements of are roots of a polynomial . The root bound for a polynomial over a field givesFor completeness, that bound follows by induction from the factor theorem: if a nonzero polynomial vanishes at , write ; every other root of a polynomial is a root of , because a field has no zero divisors. Each new distinct root therefore uses one unit of polynomial degree.
On the other hand, the group order in the decomposition isEquality is forced, so . As every retained factor is greater than , there can be only one. ConsequentlyThe same proof establishes the more general result finite multiplicative subgroup of a field is cyclic. The square-free integer result in part (c)(i) alone would not suffice, since need not be a square-free integer; the root bound for a polynomial rules out multiple invariant factors of a finitely generated module even then.
Articles by others on the same topic
There are currently no matching articles.