Exercise 3.D.19

Answers

Proof. _(a)_ Let P = Pm() for some positive integer m. Suppose p P. We have m deg p deg Tp. Therefore Tp P. T restricted to P is an operator on P and, since T is injective, T restricted to P is also injective and, thus, surjective. This means that T maps to every polynomial with a degree less or equal to m. Because m was arbitrary, it follows that T is surjective.

_(b)_ Suppose there exists p Pm() such that deg p = m and deg Tp < deg p. Let n = deg Tp. T restricted to Pn() is surjective, hence there exists q Pn() such that Tq = Tp. Since m > n, it follows that p q0, but

T(p q) = Tp Tq = Tp Tp = 0

This is a contradiction to the fact that T is injective, therefore we cannot have deg Tp < deg p. □

User profile picture
2017-10-06 00:00
Comments