let be a field. A function is a polynomial (of degree ) if there exists , () for each to such that for each . The set of all polynomials of is written . This set is a vector space, where addition of two polynomial functions is defined as the function that maps for each . Similarly, the product of two polynomials is defined as the map . Finally, the scalar multiplication of a polynomial , is defined as the map .
It is left to the reader to verify that with the addition and scalar multiplication defined above, is a vector space.
Powers of an operator
Let be a vector space over and an operator on . Then is defined as composed on itself times. It's pretty clear the the usual power laws hold good. And is the identity operator.
Now, if we want to apply the polynomial to the operator , if , then we define .
This is well defined, because the set of operators on , usually denoted is itself a vector space, over , 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 as function composition.
We observe that (informally, replacing the symbol with another symbol ) doesn't change anything.
It is clear that for any field polynomial , the operator polynomial is also an operator on , that is for any and any . Notice that
(we are using the linearity of )
Similarly we can show that .
Notice that using the identity polynomial , we can write any operator as the polynomial operator .
Null space and range of a polynomial operator is invariant under that operator.
let be an operator on a vector space , and an operator polynomial. Then and are both invariant under .
take , then, . We want to show that , that is using polynomial notation, But the compsition is equal to , where is the product of and the identity polynomial. polynomial products are commutative hence . Hence .
let , then for some , . Taking on both sides, and moving things around, we get .