How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Semisimple endomorphisms as endomorphisms diagonalisable over an algebraic closure, and nilpotent endomorphisms
Definition
Let be a finite-dimensional vector space over a field , and let be linear. The endomorphism is semisimple when its minimal polynomial is separable in the sense of Repeated roots in extension fields and separable polynomials.
Equivalently, choose any basis of , regard the matrix of as a matrix over an algebraic closure from An algebraic closure of a field, and let it act on . That endomorphism is diagonalisable over . This is basis-independent because the minimal polynomial is unchanged by field extension, and an endomorphism is diagonalisable exactly when its minimal polynomial splits with distinct roots.
The endomorphism is nilpotent when for some positive integer, equivalently when it is nilpotent in the sense of Nilpotent endomorphisms and their nilpotency index.
Depends on
- An algebraic closure of a field
- A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation
- Nilpotent endomorphisms and their nilpotency index
- Repeated roots in extension fields and separable polynomials
- The annihilator ideal is nonzero and has a unique monic generator; $p(T)=0$ if and only if $\mu_T\mid p$
- For a matrix over a field, extending the scalar field does not change its minimal polynomial
- An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors
Used by
Dependency tree · two levels
29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Meinolf Geck, On the Jordan-Chevalley decomposition of a matrix (standard reference, not scraped)