# Linear Algebra/Polynomials of Maps and Matrices/Solutions

## Solutions[edit]

*This exercise is recommended for all readers.*

- Problem 1

What are the possible minimal polynomials if a matrix has the given characteristic polynomial?

What is the degree of each possibility?

- Answer

For each, the minimal polynomial must have a leading coefficient of and Theorem 1.8, the Cayley-Hamilton Theorem, says that the minimal polynomial must contain the same linear factors as the characteristic polynomial, although possibly of lower degree but not of zero degree.

- The possibilities are , , , and . Note that the has been dropped because a minimal polynomial must have a leading coefficient of one. The first is a degree one polynomial, the second is degree two, the third is degree three, and the fourth is degree four.
- The possibilities are , , and . The first is a quadratic polynomial, that is, it has degree two. The second has degree three, and the third has degree four.
- We have , , , and . They are polynomials of degree two, three, three, and four.
- The possiblities are , , , and . The degree of is three, the degree of is four, the degree of is four, and the degree of is five.

*This exercise is recommended for all readers.*

- Problem 2

Find the minimal polynomial of each matrix.

- Answer

In each case we will use the method of Example 1.12.

- Because is triangular, is also triangular
- As in the prior item, the fact that the matrix is triangular makes computation of the characteristic polynomial easy.
- Again, the matrix is triangular.
- This case is also triangular, here upper triangular.
- The characteristic polynomial is
- The characteristic polynomial is this.

- Problem 3

Find the minimal polynomial of this matrix.

- Answer

Its characteristic polynomial has complex roots.

As the roots are distinct, the characteristic polynomial equals the minimal polynomial.

*This exercise is recommended for all readers.*

- Problem 4

What is the minimal polynomial of the differentiation operator on ?

- Answer

We know that is a dimension space and that the differentiation operator is nilpotent of index (for instance, taking , and the fourth derivative of a cubic is the zero polynomial). Represent this operator using the canonical form for nilpotent transformations.

This is an matrix with an easy characteristic polynomial, . (*Remark:* this matrix is where .) To find the minimal polynomial as in Example 1.12 we consider the powers of . But, of course, the first power of that is the zero matrix is the power . So the minimal polynomial is also .

*This exercise is recommended for all readers.*

- Problem 5

Find the minimal polynomial of matrices of this form

where the scalar is fixed (i.e., is not a variable).

- Answer

Call the matrix and suppose that it is . Because is triangular, and so is triangular, the characteristic polynomial is . To see that the minimal polynomial is the same, consider .

Recognize it as the canonical form for a transformation that is nilpotent of degree ; the power is zero first when is .

- Problem 6

What is the minimal polynomial of the transformation of that sends to ?

- Answer

The case provides a hint. A natural basis for is . The action of the transformation is

and so the representation is this upper triangular matrix.

Because it is triangular, the fact that the characteristic polynomial is is clear. For the minimal polynomial, the candidates are ,

,

,

and . Because , , and are not right, must be right, as is easily verified.

In the case of a general , the representation is an upper triangular matrix with ones on the diagonal. Thus the characteristic polynomial is . One way to verify that the minimal polynomial equals the characteristic polynomial is argue something like this: say that an upper triangular matrix is -upper triangular if there are nonzero entries on the diagonal, that it is -upper triangular if the diagonal contains only zeroes and there are nonzero entries just above the diagonal, etc. As the above example illustrates, an induction argument will show that, where has only nonnegative entries, is -upper triangular. That argument is left to the reader.

- Problem 7

What is the minimal polynomial of the map projecting onto the first two coordinates?

- Answer

The map twice is the same as the map once: , that is, and so the minimal polynomial is of degree at most two since will do. The fact that no linear polynomial will do follows from applying the maps on the left and right side of (where is the zero map) to these two vectors.

Thus the minimal polynomial is .

- Problem 8

Find a matrix whose minimal polynomial is .

- Answer

This is one answer.

- Problem 9

What is wrong with this claimed proof of Lemma 1.9: "if then "? (Cullen 1990)

- Answer

The must be a scalar, not a matrix.

- Problem 10

Verify Lemma 1.9 for matrices by direct calculation.

- Answer

The characteristic polynomial of

is . Substitute

and just check each entry sum to see that the result is the zero matrix.

*This exercise is recommended for all readers.*

- Problem 11

Prove that the minimal polynomial of an matrix has degree at most (not as might be guessed from this subsection's opening). Verify that this maximum, , can happen.

- Answer

By the Cayley-Hamilton theorem the degree of the minimal polynomial is less than or equal to the degree of the characteristic polynomial, . Example 1.12 shows that can happen.

*This exercise is recommended for all readers.*

- Problem 12

The only eigenvalue of a nilpotent map is zero. Show that the converse statement holds.

- Answer

Suppose that 's only eigenvalue is zero. Then the characteristic polynomial of is . Because satisfies its characteristic polynomial, it is a nilpotent map.

- Problem 13

What is the minimal polynomial of a zero map or matrix? Of an identity map or matrix?

- Answer

A minimal polynomial must have leading coefficient , and so if the minimal polynomial of a map or matrix were to be a degree zero polynomial then it would be . But the identity map or matrix equals the zero map or matrix only on a trivial vector space.

So in the nontrivial case the minimal polynomial must be of degree at least one. A zero map or matrix has minimal polynomial , and an identity map or matrix has minimal polynomial .

*This exercise is recommended for all readers.*

- Problem 14

Interpret the minimal polynomial of Example 1.2 geometrically.

- Answer

The polynomial can be read geometrically to say "a rotation minus two rotations of equals the identity."

- Problem 15

What is the minimal polynomial of a diagonal matrix?

- Answer

For a diagonal matrix

the characteristic polynomial is . Of course, some of those factors may be repeated, e.g., the matrix might have . For instance, the characteristic polynomial of

is .

To form the minimal polynomial, take the terms , throw out repeats, and multiply them together. For instance, the minimal polynomial of is . To check this, note first that Theorem 1.8, the Cayley-Hamilton theorem, requires that each linear factor in the characteristic polynomial appears at least once in the minimal polynomial. One way to check the other direction— that in the case of a diagonal matrix, each linear factor need appear at most once— is to use a matrix argument. A diagonal matrix, multiplying from the left, rescales rows by the entry on the diagonal. But in a product , even without any repeat factors, every row is zero in at least one of the factors.

For instance, in the product

because the first and second rows of the first matrix are zero, the entire product will have a first row and second row that are zero. And because the third row of the middle matrix is zero, the entire product has a third row of zero.

*This exercise is recommended for all readers.*

- Problem 16

A **projection** is any transformation such that . (For instance, the transformation of the plane projecting each vector onto its first coordinate will, if done twice, result in the same value as if it is done just once.) What is the minimal polynomial of a projection?

- Answer

This subsection starts with the observation that the powers of a linear transformation cannot climb forever without a "repeat", that is, that for some power there is a linear relationship where is the zero transformation. The definition of projection is that for such a map one linear relationship is quadratic, . To finish, we need only consider whether this relationship might not be minimal, that is, are there projections for which the minimal polynomial is constant or linear?

For the minimal polynomial to be constant, the map would have to satisfy that , where since the leading coefficient of a minimal polynomial is . This is only satisfied by the zero transformation on a trivial space. This is indeed a projection, but not a very interesting one.

For the minimal polynomial of a transformation to be linear would give where . This equation gives . Coupling it with the requirement that gives , which gives that and is the zero transformation or that and is the identity.

Thus, except in the cases where the projection is a zero map or an identity map, the minimal polynomial is .

- Problem 17

*The first two items of this question are review.*

- Prove that the composition of one-to-one maps is one-to-one.
- Prove that if a linear map is not one-to-one then at least one nonzero vector from the domain is sent to the zero vector in the codomain.
- Verify the statement, excerpted here, that preceeds Theorem 1.8.
... if a minimial polynomial for a transformation factors as then is the zero map. Since sends every vector to zero, at least one of the maps sends some nonzero vectors to zero. ... Rewording ...: at least some of the are eigenvalues.

- Answer

*This is a property of functions in general,*not just of linear functions. Suppose that and are one-to-one functions such that is defined. Let , so that . Because is one-to-one this implies that . Because is also one-to-one, this in turn implies that . Thus, in summary, implies that and so is one-to-one.- If the linear map is not one-to-one then there are unequal vectors , that map to the same value . Because is linear, we have and so is a nonzero vector from the domain that is mapped by to the zero vector of the codomain ( does not equal the zero vector of the domain because does not equal ).
- The minimal polynomial sends every vector in the domain to zero and so it is not one-to-one (except in a trivial space, which we ignore). By the first item of this question, since the composition is not one-to-one, at least one of the components is not one-to-one. By the second item, has a nontrivial nullspace. Because holds if and only if , the prior sentence gives that is an eigenvalue (recall that the definition of eigenvalue requires that the relationship hold for at least one nonzero ).

- Problem 18

True or false: for a transformation on an dimensional space, if the minimal polynomial has degree then the map is diagonalizable.

- Answer

This is false. The natural example of a non-diagonalizable transformation works here. Consider the transformation of represented with respect to the standard basis by this matrix.

The characteristic polynomial is . Thus the minimal polynomial is either or . The first is not right since is not the zero matrix, thus in this example the minimal polynomial has degree equal to the dimension of the underlying space, and, as mentioned, we know this matrix is not diagonalizable because it is nilpotent.

- Problem 19

Let be a polynomial. Prove that if and are similar matrices then is similar to .

- Now show that similar matrices have the same characteristic polynomial.
- Show that similar matrices have the same minimal polynomial.
- Decide if these are similar.

- Answer

Let and be similar . From the facts that

and follows the required fact that for any polynomial function we have . For instance, if then

shows that is similar to .

- Taking to be a linear polynomial we have that is similar to . Similar matrices have equal determinants (since ). Thus the characteristic polynomials are equal.
- As and are invertible, is the zero matrix when, and only when, is the zero matrix.
- They cannot be similar since they don't have the same characteristic polynomial. The characteristic polynomial of the first one is while the characteristic polynomial of the second is .

- Problem 20

- Show that a matrix is invertible if and only if the constant term in its minimal polynomial is not .
- Show that if a square matrix is not invertible then there is a nonzero matrix such that and both equal the zero matrix.

- Answer

Suppose that is minimal for .

- For the "if" argument, because is the zero matrix we have that and so the matrix is the inverse of . For "only if", suppose that (we put the case aside but it is easy) so that is the zero matrix. Note that is not the zero matrix because the degree of the minimal polynomial is . If exists then multiplying both and the zero matrix from the right by gives a contradiction.
- If is not invertible then the constant term in its minimal polynomial is zero. Thus,

*This exercise is recommended for all readers.*

- Problem 21

- Finish the proof of Lemma 1.7.
- Give an example to show that the result does not hold if is not linear.

- Answer

- For the inductive step, assume that Lemma 1.7 is true for polynomials of degree and consider a polynomial of degree . Factor and let be . Substitute:
- One example is to consider the squaring map given by . It is nonlinear. The action defined by the polynomial changes to , which is this map.

- Problem 22

Any transformation or square matrix has a minimal polynomial. Does the converse hold?

- Answer

Yes. Expand down the last column to check that is plus or minus the determinant of this.

## References[edit]

- Cullen, Charles G. (1990),
*Matrices and Linear Transformations*(Second ed.), Dover.