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.
The restriction of a diagonalisable endomorphism to an invariant subspace is diagonalisable
Statement
If is diagonalisable and is -invariant, then the restriction is diagonalisable.
Facts & Assumptions
Given: A diagonalisable endomorphism and a -invariant subspace .
The minimal polynomial of divides (The minimal polynomial of a restriction to an invariant subspace divides the original minimal polynomial).
Diagonalisability is equivalent to the minimal polynomial being a product of distinct linear factors (An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors).
A polynomial splits over when it factors into linear factors over (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
The polynomial ring over a field is a unique factorisation domain (For every field , is a unique factorisation domain).
Proof
By [L2], is split and squarefree. By [L1], is a monic divisor of it, so unique factorisation [L4] and the meaning of splitting in [L3] make the restriction polynomial split and squarefree as well.
Apply the reverse implication of [L2] to . This includes , whose minimal polynomial is .
Depends on
- The minimal polynomial of a restriction to an invariant subspace divides the original minimal polynomial
- An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors
- Polynomials that split and splitting fields of a polynomial or a family of polynomials
- For every field $F$, $F[x]$ is a unique factorisation domain
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 44 results over 7 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Keith Conrad, The Minimal Polynomial and Some Applications, §5, Lemma 5.1 (standard reference, not scraped)