Regard as a matrix over the rational numbers. Part (a)(ii), with , gives its characteristic polynomial . Therefore, writing for the imaginary unit,
The matrix is not zero: otherwise would have noninteger diagonal entries. It consequently has rank of a matrix one over the fraction field of the Gaussian integers.
By part (b)(i), is a Euclidean domain, hence a principal ideal domain, so apply Smith normal form. There exist such that
Indeed, invertible multiplication preserves rank of a matrix, so exactly one diagonal entry is nonzero. For , multiplication on the right gives . Since is an invertible matrix,
The Smith normal form supplies a kernel basis lemma ensures that the null vector is a column of an invertible matrix over ; an arbitrary nonzero solution over would not itself establish that requirement.
Over a principal ideal domain , an -by- matrix is in Smith normal form if all entries off the main diagonal vanish and its nonzero diagonal entries occur first and satisfy
All remaining diagonal entries are zero. The zero matrix is allowed, with . For an arbitrary matrix , the Smith normal form theorem gives invertible matrices and with
where the right side is interpreted as a rectangular diagonal matrix when necessary. The are determined up to multiplication by units. Positivity can be required over , but is not a condition over the Gaussian integers.
The Gaussian integers form an integral domain, since they are a subring of the complex numbers. Use the Gaussian integer norm
which is a positive integer for nonzero and satisfies .
For with , write . Choose integers with and , put , and set . Then
Thus division with remainder has either or a strictly smaller Gaussian integer norm. This proves that is a Euclidean function and
In the basis , the linear map given by sends to the second basis vector and sends to . Equivalently,
Multiplying on the left by the matrix inverse gives
This change of basis produces the companion matrix found in part (a)(ii).
Let be nonzero. If the columns were linearly dependent over the rational numbers, then for some . Applying once more would give
so . Since , this forces , impossible in . Thus the two columns are linearly independent, and the square matrix
is an invertible matrix.
The nonconstant invariant factors of a linear operator satisfy . By part (a)(i), is an irreducible polynomial, so every must equal . Their polynomial degrees sum to , giving .
The companion matrix of , in the basis of , is
Therefore, for each fixed even , every such has rational canonical form
There are no such matrices when is odd. This is an instance of the rational canonical form with irreducible minimal polynomial principle; equality of minimal polynomials alone does not determine rational canonical form in general.
Since , its minimal polynomial divides . The polynomial is an irreducible polynomial over the rational numbers: a reducible quadratic would have a rational root, whereas for every .
Because , the constant polynomial one evaluates to the nonzero identity matrix , so . Both and are monic polynomials; hence the only remaining divisor is
For every , truncate before coordinate :
This lies in . For , . For , , which is divisible by . In particular the integer sequence
belongs to and satisfies .
Apply the module homomorphism . Since ,
Fixing any coordinate , the integer is therefore divisible by for every . The only such integer is zero: if , choose with , which rules out for any nonzero integer . Thus every coordinate of vanishes, contradicting part (b)(iii).
It follows that
The decisive property is vanishing of infinitely divisible integer sequences, namely .
Consider
The map sending a sequence of signs to is a bijection from onto . This is an uncountable set by the Cantor diagonal argument: given a proposed list of its elements, define . Then differs from at coordinate for every .
Since is countable, cannot be contained in it. Consequently there exists
Under the temporary assumption that is a basis of a module for , part (a)(v) applied to the countably generated submodule gives a countable set such that . By part (a)(iv),
Use part (a)(iii) to project onto the second direct summand. This gives a module homomorphism with
It remains to check the required size of this kernel. Enumerate as , with the finite case treated the same way. Every element of is a finite sum of these elements with integer coefficients. For each , the set is the image of the countable set , so it is countable. Taking their countable union proves
This is the countability of countably generated abelian groups argument; it uses the countability of the scalar ring .
For , let have and for . If and , then can be nonzero only where or is nonzero, and can be nonzero only where is nonzero. These are finite sets. Since , this proves that is a submodule.
Every has the finite expression
Evaluating at coordinate recovers the coefficient of , so the expression is unique. Thus is a basis of a module for , and
is a free module. By contrast, the ambient module of integer sequences allows arbitrary integer sequences.
Choose a countable generating family for . For each , the expression of in the basis of a module has a finite set of nonzero coefficients, its coordinate support in a free module. Let
By the countable union of countable sets property, is a countable set. Every belongs to , so all finite -linear combinations of the do too. Therefore
Here and below, countable includes finite. The same construction applies to a finite or empty generating family. This is the countable basis support lemma.
Put and , the submodules generated by the two parts of the basis of a module. Every finite expression in the basis of a module splits into its terms and its terms. Thus .
If , there are finite expressions
Subtracting gives a finite relation among distinct members of , because . Their linear independence in a module forces every coefficient to vanish, so . Hence
This proves the basis partition gives a module direct sum lemma, also when one part is empty.
In the direct sum of modules , every has a unique expression , with and . Define
The uniqueness makes this well-defined. For , and ,
so is a module homomorphism. Finally, exactly when , equivalently . Therefore . Its image is , and , so it is the projection onto that direct summand.
Yes. An -module over a field is a vector space. Start with a finite generating list. If it is linearly dependent, one vector has a nonzero coefficient in a linear relation; dividing by that coefficient expresses the vector using the others, so it can be removed without changing the span. Repeating terminates with a linearly independent generating list, which is a basis and therefore a basis of a module.
Thus every finitely generated module over a field is a free module. For the zero module, the empty list is the required basis of a module.
A subset is a basis of a module if every has a unique expression
Uniqueness concerns the entire family of coefficients, including the zero coefficients. Equivalently, generates and is linearly independent in a module: every finite relation , with , has all .
A module is a free module if it has a basis of a module. An infinite basis of a module still uses only finite sums in each expression; arbitrary infinite sums are not part of the module operations.
Using the assumed square-free polynomial property, factor
into distinct monic polynomials that are irreducible polynomials, with . Part (b)(iii) identifies with , where .
By the first isomorphism theorem for rings, the image from part (c)(i) is , where is the kernel of a ring homomorphism. By part (a)(ii), for ideals . A field has only the zero ideal and the whole field as ideals, so each is either or the zero ring. Consequently, for a subset ,
This is the quotient of a finite product of fields principle. The subset is nonempty because , whereas the zero ring has only one unit. By part (a)(i),
Each factor is a positive integer. Since is a prime number, exactly one factor is and all remaining factors are one. Thus
so is a Mersenne prime. If with , then would be a proper divisor of ; thus is itself a prime number, although only the displayed form is needed.
The assumed square-free polynomial property can also be checked directly: in characteristic of a ring two, the formal derivative of is because is odd. These two polynomials have greatest common divisor one, since does not divide , so no repeated irreducible polynomial factor occurs.
Choose a generator of the cyclic group , so . Part (a)(iii) gives a unital ring homomorphism . Its image lies in the centre of , so even if is not a commutative ring, evaluating a polynomial at defines a ring homomorphism
Because , it factors through the quotient ring to give
Its image is the subring . Every unit of is a unit of , because an inverse in also lies in . Conversely, every member of is for some , and both and its inverse lie in . Hence
The inverse argument matters: merely belonging to a subring would not by itself make an ambient unit invertible there.
The polynomial ring is a Euclidean domain under polynomial degree, hence a principal ideal domain. By part (b)(i), each
is a field. By polynomial division, every residue class has exactly one representative of polynomial degree less than . Thus form a basis over , and .
For , the ideals and are distinct maximal ideals, so they are comaximal ideals: their sum is an ideal properly containing and must be the whole ring. The Chinese remainder theorem for ideals and part (b)(ii) therefore give the ring isomorphism
In particular, this is a product of finite fields of the required sizes. The map preserves multiplication as well as addition and is surjective by the Chinese remainder theorem for ideals.
Every multiple of is a multiple of each , giving one inclusion. For the reverse inclusion, a principal ideal domain is a unique factorization domain, so each irreducible element is a prime element.
Let . The case is immediate. Otherwise, write . Since and the prime element cannot divide the non-associate irreducible element , it divides . Write , and repeat. At stage , the prime element divides none of , so it divides the remaining factor. Hence , proving

There are unlisted articles, also show them or only show them.