Solutions to all three questions of the University of Oxford Part A paper on rings and modules, sat on 23 June 2021. Source: Oxford-released examination PDF, parent PDF pages 223–225; paper pages 1–3.
We prove the stated Eisenstein criterion directly. Assume . Suppose in the polynomial ring . Since the principal ideal domain is an integral domain, polynomial degree is additive under polynomial multiplication, and the product of the leading coefficients of is the leading coefficient of . These two coefficients are therefore units. Multiplying and by inverse units, without changing their product, makes both factors monic polynomials.
If either factor is a constant polynomial, that factor is now , so the original factor was a unit. It remains to rule out and .
The prime element generates a maximal ideal in the principal ideal domain . Indeed, if , then , and the irreducible element property of forces either or . Consequently is a field. Apply reduction modulo an ideal to every coefficient. The monic polynomial factors retain their polynomial degrees, and the hypotheses give
The polynomial ring over a field is a unique factorization domain, and is an irreducible polynomial. Thus its only monic polynomial divisors in are powers of . Hence and . Both have zero constant term, so and . This gives , a contradiction.
The monic polynomial has positive polynomial degree, so it is a nonzero nonunit. Every factorization therefore has a unit factor, proving
Regard as the polynomial ring . The coefficient ring is a Euclidean domain, hence a principal ideal domain. The element is a prime element: the quotient ring is an integral domain.
The monic polynomial has its other coefficients divisible by , while . Part (a)(i), with playing the role of and the indeterminate, proves that is an irreducible polynomial.
Now use the automorphism of a polynomial ring
Its inverse fixes and sends to . A ring isomorphism preserves units and factorizations, hence preserves irreducible elements. Since
we obtain
Applying the Eisenstein criterion directly to the second expression with the prime element would fail, since ; the change of indeterminate supplies the required argument.
All principal ideals in this part are taken inside the subring , rather than inside . First, is a subring: sums and additive inverses retain zero coefficient of , and the coefficient of in a product is . It contains .
The principal ideal is precisely
Indeed, multiplying an element of by gives a possible term of polynomial degree and terms of polynomial degrees at least , with no term. Conversely, dividing any displayed polynomial by gives a polynomial with no term, hence an element of .
Given , let be its coefficients of , respectively. Subtracting these terms leaves an element of , so
For uniqueness, if two such representatives differ by an element of , their difference has possible monomials only , whereas every element of has zero coefficients at all three. Comparing coefficients gives , , .
In particular, . Treating as the principal ideal of instead would incorrectly discard this surviving term.
Set and . Part (b)(i) gives a unique representative for each element of the quotient ring . By polynomial division, each element of the quotient ring likewise has a unique representative . Thus the proposed map is well-defined and a bijection.
It preserves addition and . To verify multiplication, all terms of polynomial degree at least lie in . Hence
In the other quotient ring, , giving exactly the same coefficient formula:
Therefore
is a ring isomorphism. Both sides are examples of a truncated polynomial ring; the generator on the left is the class of , whose square is nonzero and whose cube vanishes.
No such property exists. The ring isomorphism in part (b)(ii) identifies quotient rings by elements having different irreducible element behaviour.
The element is an irreducible element of . It is nonzero and a nonunit. Every nonzero nonunit of has polynomial degree at least : the only possible polynomials of smaller polynomial degree are constant polynomials, and every nonzero constant polynomial is a unit. If with both nonunits, additivity of polynomial degree in the integral domain would give
which is impossible. Thus one factor must be a unit.
In , however, is a product of two nonunits, so is not an irreducible element. If a ring isomorphism invariant characterized irreducible elements by the indicated quotient ring, the irreducible element would imply that has . Its isomorphic quotient ring would then have , incorrectly making an irreducible element.
Consequently,
The required property is
For a nonzero element of an integral domain , this follows from
Indeed, in the quotient ring exactly when . The prime element condition says this forces or , exactly the absence of zero divisors in the quotient ring. The nonunit condition makes the quotient ring nonzero. Being an integral domain is preserved by every ring isomorphism.
With the usual definition of a prime element, is understood. The prime ideal formulation works for every ideal of any commutative ring, including the zero ideal; it avoids this convention about elements.
Choose a finite generating set of a module for the finitely generated module . For any , the surjectivity of the module homomorphism gives with . Write . Since is a module homomorphism,
Thus
is a finitely generated module. The argument includes , in which case surjectivity forces and the empty generating set of a module suffices.
Let generate the submodule , and let generate the quotient module . Choose each as a representative of its class. For any , there are such that
Therefore . Expressing that difference using the generating set of a module gives
Hence
is a finitely generated module. This proves that finite generation is preserved by module extensions.
Let denote the standard basis of a module of the free module . Since the module homomorphism is surjective, choose such that for each . Define
Uniqueness of coordinates in a basis of a module makes this well-defined, and the formula preserves addition and scalar multiplication, so is a module homomorphism. For every ,
Thus . This is the lifting property of a free module; only the surjectivity of is needed for this part.
Put , , and . The kernel of a module homomorphism is a submodule, so its image is a submodule. For , , showing . Thus the quotient module exists. Also .
Consider the restriction to of the natural module homomorphism :
Its kernel of a module homomorphism is . We have . Conversely, if , choose with . Then
so and . Hence .
The map is surjective. Given , use the surjectivity of to choose with . Set . Then
Thus is a preimage of the arbitrary class .
By the first isomorphism theorem for modules, induces the module isomorphism
Explicitly, replacing by with leaves its class modulo unchanged, proving well-definedness. Its formula preserves addition and scalar multiplication. If its value is zero, , so , proving injectivity; surjectivity was proved above. These checks give all the requested properties of the induced map.
Assume is a finitely generated module. The restriction is a surjective module homomorphism, so part (a)(i) makes a finitely generated module.
The free module has its finite standard basis of a module. Its quotient module is therefore a finitely generated module by part (a)(i). Part (c) transfers this property to the isomorphic quotient module . Finally apply part (a)(ii) to the submodule . It follows that
More concretely, take the images under of finitely many generators of , and adjoin lifts in of finitely many generators of . This finite list generates . The argument shows why finite presentation of a module is independent of the chosen finite generating set of a module.
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 matrix
has 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.
Every multiple of is a multiple of both and , so .
For the reverse inclusion, let lie in this intersection of ideals. Since are coprime integers, Bézout's identity supplies with . Multiplying by gives
Thus , and . Consequently
Here 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 homomorphism
By part (b)(i), its kernel of a group homomorphism is
It is surjective. Indeed, choose with by Bézout's identity. For any prescribed classes and , the integer
satisfies and . The first isomorphism theorem for groups therefore gives
This 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 write
The 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, giving
In 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 module
after 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 gives
For 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 is
Equality is forced, so . As every retained factor is greater than , there can be only one. Consequently
The 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 (0)

There are currently no matching articles.