The rational canonical form of a linear operator on a finite-dimensional vector space over a field is a direct sum of companion matrices, where the monic nonconstant invariant factors of a linear operator satisfy . Their degrees sum to the dimension of the space. It exists over any field and classifies similar matrices, without requiring their eigenvalues to lie in that field. It comes from the structure theorem for finitely generated modules over a principal ideal domain, applied to the module in which the indeterminate acts as the given operator.
For a nonzero finite-dimensional cyclic linear operator, identify its module with , where is the monic minimal polynomial. Its kernel consists of classes of with . If , coprimality gives , so the kernel is zero. If , it consists precisely of the multiples of modulo , a one-dimensional space. Thus the multiplicity of zero as a root of does not increase the nullity. The same companion block reads off invertibility from the constant term and gives the characteristic and minimal polynomials directly, while explicitly listing eigenvalues may require factoring .
Let an invertible matrix have monic invariant factors of a linear operator of degrees . Their constant coefficients are nonzero, since their product is the characteristic polynomial and . On a cyclic block, implies , so , where is monic of degree . The vector remains cyclic for : multiplying by the invertible map gives the reversed original cyclic basis. Thus this polynomial is the minimal polynomial of the inverse block.
Normalized reciprocation preserves divisibility because when both constant coefficients are nonzero. Consequently the rational canonical form of is the direct sum of the companion matrices . The normalization by is essential to make each reciprocal polynomial monic.
Let on a nonzero finite-dimensional vector space over a field, with . An invariant block for is also invariant for . If is its cyclic vector basis, then is another basis: the binomial theorem gives a triangular change-of-basis matrix with diagonal . The monic polynomial annihilates this block, and its degree is , so it is the block's minimal polynomial. In the new cyclic basis the block is .
The substitution preserves divisibility of the monic invariant factors of a linear operator. Apply it to every block to obtain the rational canonical form of . If , then is a scalar matrix instead: all invariant factors are , one for each dimension. This exceptional case cannot be obtained by dividing by .
Let act on a nonzero finite-dimensional vector space over a field , with minimal polynomial an irreducible polynomial of polynomial degree . The nonconstant invariant factors of a linear operator all divide , so each equals . Their degrees sum to the dimension of a vector space, giving and rational canonical form consisting of copies of the companion matrix . Equivalently, make the vector space a module over the field by letting act as ; a basis over this field gives the same block decomposition.
For with irreducible of degree d and partition , its automorphism group has order . The endomorphism algebra has dimension ; its semisimple quotient is , and units are precisely lifts of units in that quotient.
Fix an irreducible polynomial f of degree d with nonzero constant term. In , the number of matrices whose minimal polynomial is a power of f is . The primary matrix centralizer formula is identical to the unipotent centralizer formula over , and summing reciprocal centralizer orders reduces to counting nilpotent matrices by the Fitting decomposition.
For a finite-dimensional vector space regarded as an -module through a linear operator, the monic invariant factors give the decomposition . Their product is the characteristic polynomial and the largest is the minimal polynomial.
Suppose the rational canonical form of is , with monic nonconstant invariant factors of a linear operator satisfying . Each block has minimal polynomial and characteristic polynomial , because a cyclic operator has equal minimal and characteristic polynomials. The determinant of a block diagonal matrix is the product of block determinants, giving . A polynomial kills the direct sum exactly when it kills each block, equivalently when every divides it. Thus is their least common multiple, which the divisibility chain reduces to . On the zero vector space both polynomials are conventionally one.

Articles by others on the same topic (0)

There are currently no matching articles.