Definition
Polynomial module associated with a linear operator
A linear operator T defines an F[X]-module whose action factors through the operator algebra F[T].
Let be an -vector space and an -linear map. The polynomial module associated with is the -module on whose action is
This is the unique action of the polynomial ring for which constants act by the original scalar multiplication and . Finite dimensionality is not required.
Evaluation and the operator algebra
Write for the ring of -linear maps from to itself, with pointwise addition and composition as multiplication. For , define . The operator algebra generated by is
Here is an indeterminate, whereas is an operator. Distinct polynomials can determine the same operator.
Polynomial evaluation defines a surjective unital ring homomorphism
To prove this, let and . Addition is coefficientwise, so . Since is -linear, it commutes with every scalar operator . Hence
Also and for . These identities show that is a commutative unital -subalgebra, even though may be noncommutative. Surjectivity follows from the definition of .
The kernel and quotient identification
The kernel is the ideal
It is an ideal because evaluation is a ring homomorphism: if and , then and .
There is an isomorphism of -algebras
Indeed, if and only if , which is equivalent to . This proves both well-definedness and injectivity. Surjectivity and preservation of addition, multiplication, identity, and scalars follow from the corresponding properties of evaluation.
If is finite-dimensional and nonzero, then
where is the minimal polynomial of . To see existence, put . The operators are linearly dependent in the -dimensional space . Thus contains a nonzero polynomial. Choose a monic one of least degree. No nonzero constant annihilates nonzero , so this degree is positive. For , polynomial division gives , with or . Evaluation gives , so minimality forces . Conversely every multiple of belongs to . The monic generator is unique.
Finite dimensionality is needed here to guarantee a nonzero annihilating polynomial, not for evaluation or the quotient identification. If , then and is the zero ring.
The two module structures and faithfulness
The -action is evaluation of operators on vectors:
For and , linearity and composition give
These are the module axioms. Restricting scalars along gives the original -action . Equivalently, the action factors through by ; this is independent of the representative because every element of acts as zero.
An action is faithful if the only scalar that annihilates every vector is zero. The -action is faithful: an operator satisfying for every is the zero operator. The -action has annihilator , so it is faithful exactly when . In particular it is not faithful when is finite-dimensional and nonzero. Faithfulness does not require every nonzero scalar to act injectively.
Example: a two-dimensional nilpotent operator
Let with basis , and define , . Then but . For ,
Applying to shows that if and only if . Thus , , and
The coefficients are unique, since . Multiplication satisfies
Over , the nonzero scalar annihilates all of , so the action is not faithful. Over , the scalar is already zero; a scalar annihilating must have , so the action is faithful. The nonzero scalar still kills , illustrating that faithfulness concerns annihilating every vector.
The vector generates both modules. More precisely,
is an -module isomorphism, whereas , , is an -module isomorphism. The first uses polynomial scalars acting through the quotient; the second identifies with the regular module of the operator algebra.
Morphisms and invariant subspaces
For operators on and on , a linear map is an -module homomorphism exactly when .
The condition says that the square below commutes:
A subspace is an -submodule exactly when it is -invariant.
For finite-dimensional nonzero , the minimal polynomial generates the annihilator of this module. The construction is the bridge to rational canonical form from the module structure theorem.
References
- The polynomial identities above verify existence directly; the images of constants and prove uniqueness. The intertwining condition extends from to every polynomial by induction and linearity.