4 - Polynomials on operators

Field polynomials

let F be a field. A function p:FF is a polynomial (of degree n) if there exists aiF, (an10) for each i=0 to n1 such that p(z)=i=0n1aizi for each zF. The set of all polynomials of F is written P(F). This set is a vector space, where addition of two polynomial functions p1+p2 is defined as the function that maps zp1(z)+p2(z) for each zF. Similarly, the product of two polynomials p1p2 is defined as the map zp1(z)p2(z). Finally, the scalar multiplication of a polynomial λp, λF is defined as the map zλp(z).
It is left to the reader to verify that P(F) with the addition and scalar multiplication defined above, is a vector space.

Powers of an operator

Let V be a vector space over F and f an operator on V. Then fn is defined as f composed on itself n times. It's pretty clear the the usual power laws hold good. And f0 is the identity operator.

Now, if we want to apply the polynomial pP(F) to the operator f, if p(z)=i=0n1aizi, then we define p(f):=i=0n1aifi.
This is well defined, because the set of operators on V, usually denoted L(V) is itself a vector space, over F, where (as usual) addition of linear maps is defined by pointwise addition, and scalar multiplication as pointwise scalar multiplication. We can also define multiplication on L(V) as function composition.
We observe that pq(f)=p(f)q(f)=q(f)p(f) (informally, replacing the symbol z with another symbol f) doesn't change anything.
It is clear that for any field polynomial p, the operator polynomial p(f) is also an operator on V, that is p(f)L(V) for any pP(F) and any fL(V). Notice that p(f)(u1+u2)=i=1n1aifi(u1+u2)=i=1nai(fi(u1))+i=1nai(fi(u2))=p(f)(u1)+p(f)(u2))
(we are using the linearity of fi)
Similarly we can show that p(f)(λv)=λp(f)(v).
Notice that using the identity polynomial 1(z)=z, we can write any operator f as the polynomial operator 1(f).

Null space and range of a polynomial operator is invariant under that operator.

let f be an operator on a vector space V, and p(f) an operator polynomial. Then Kern(p(f)) and p(f)(V) are both invariant under f.

proof: take uKern(p(f)), then, p(f)(u)=0. We want to show that f(u)Kern(p(f)), that is p(f)(f(u))=0 using polynomial notation, p(f)(1(f)(u))=0 But the compsition p(f)1(f) is equal to p 1(f), where p 1 is the product of p and the identity polynomial. polynomial products are commutative hence p 1(f)=1 p(f)=1(f)p(f). Hence =p(f)(1(f)(u))=1(f)(p(f)(u))=1(f)(0)=0.
let up(f)(V), then for some v, p(f)(v)=u. Taking 1(f) on both sides, and moving things around, we get p(f)(f(v))=f(u).