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.
Simultaneous triangularization of solvable representations
Statement
Let be finite-dimensional solvable over an algebraically closed field of characteristic zero, and let be a finite-dimensional -module. Then has a complete invariant flag. Equivalently, there is a basis in which every representing matrix is upper triangular.
Facts & Assumptions
Given: A representation of on under Lie's theorem hypotheses.
Every nonzero finite-dimensional module under these hypotheses has a common eigenvector (Lie's theorem).
Invariant subspaces and their quotients carry the restricted and induced representations (Subrepresentations, quotient representations, and intertwiners).
The canonical vector-space quotient projection is linear and surjective (The quotient vector space and its canonical projection).
Proof
If , the empty flag and empty basis have the required properties.
Assume and the corollary for smaller-dimensional modules.
By [L1], choose a common eigenvector . Its line is -invariant.
The quotient has the induced representation by [L2] and dimension one less. Step 1.2 supplies its complete invariant flag. Taking inverse images under the projection in [L3] and adjoining gives a complete invariant flag in .
A basis adapted to this finite flag makes every representing matrix upper triangular. Conversely, the spans of the first vectors in a common upper-triangular basis form the complete invariant flag. These are finite sequential basis choices and require no AC.
Depends on
Used by
Dependency tree · two levels
10 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
- Milne, Lie Algebras, Theorem 3.7 (standard reference, not scraped)