Exercise 7.3.16

Answers

1.
Let f(t) be the characteristic polynomial of T. Then we have f(T)(x) = T0(x) = 0 W1. So there must be some monic polynomial p(t) of least positive degree for which p(T)(x) W1. If h(t) is a polynomial for which h(T)(x) W1, we have
h(t) = p(t)q(t) + r(t)

for some polynomial q(t) and r(t) such that the degree of r(t) is less than the degree of p(t) by Division Algorithm. This means that

r(T)(x) = h(T)(x) p(T)p(T)(x) W1

since W1 is T-invariant. Hence the degree of r(t) must be 0. So p(t) divides h(t). Thus g1(t) = p(t) is the unique monic polynomial of least positive degree such that g1(T)(x) W1.

2.
This has been proven in the previous argument.
3.
Let p(t) and f(t) be the minimal and characteristic polynomials of T. Then we have p(T)(x) = f(T)(x) = 0 W1. By the previous question, we get the desired conclusion.
4.
Observe that g2(T)(x) W2 W1. So g1(t) divides g2(t) by the previous arguments.
User profile picture
2011-06-27 00:00
Comments