Semisimple operator
In mathematics, a linear operator T : V → V on a vector space V is semisimple if every T-invariant subspace has a complementary T-invariant subspace.[1] If T is a semisimple linear operator on V, then V is a semisimple representation of T. Equivalently, a linear operator is semisimple if its minimal polynomial is a product of distinct irreducible polynomials.[2]
A linear operator on a finite-dimensional vector space over an algebraically closed field is semisimple if and only if it is diagonalizable.[1][3]
Over a perfect field, the Jordan–Chevalley decomposition expresses an endomorphism as a sum of a semisimple endomorphism s and a nilpotent endomorphism n such that both s and n are polynomials in x.
Notes
[edit | edit source]- ^ a b Lam (2001), p. 39
- ^ Jacobson 1979, A paragraph before Ch. II, § 5, Theorem 11.
- ^ This is trivial by the definition in terms of a minimal polynomial but can be seen more directly as follows. Such an operator always has an eigenvector; if it is, in addition, semi-simple, then it has a complementary invariant hyperplane, which itself has an eigenvector, and thus by induction is diagonalizable. Conversely, diagonalizable operators are easily seen to be semi-simple, as invariant subspaces are direct sums of eigenspaces, and any basis for this space can be extended to an eigenbasis.
References
[edit | edit source]- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
 | This linear algebra-related article is a stub. You can help Wikipedia by expanding it. |