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
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.
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.
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).
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
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.
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.
Each entry of the matrix from part (b)(iii) has unique real and imaginary integer coefficients. Write
It already belongs to the general linear group . Expanding the relation from part (b)(iii) gives
The real and imaginary parts must both vanish, so
These are the required identities, with .

Articles by others on the same topic (0)

There are currently no matching articles.