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.
Every finite-dimensional irreducible module has a highest-weight vector
Statement
Assume the Axiom of Choice. Let be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra and a chosen positive system, and let be a finite-dimensional irreducible representation of (Irreducible, completely reducible, and faithful representations). Then contains a highest weight vector for the chosen positive roots (Highest-weight vectors and modules); consequently is a highest weight module for some highest weight .
Facts & Assumptions
Given: The Axiom of Choice, such , a chosen positive system, and a nonzero finite-dimensional irreducible module .
The Axiom of Choice is assumed; among the facts used below, it enters through the weight decomposition [L1] (The Axiom of Choice). The algebraic shift property [L2] has no choice hypothesis.
is a direct sum over its finitely many weights, and each weight space is finite dimensional (Finite-dimensional modules decompose into weight spaces).
If and , then , with allowed (Root vectors shift weights).
The root order is a partial order on the weights, and a positive root satisfies , so for every weight (Root order on weights, Simple roots form a signed integral basis).
is the sum of the root spaces with (Positive and negative nilpotent subalgebras and the Borel).
Proof
By [L1] the set of weights of is finite and nonempty, because has a nonzero weight space.
has a maximal element: enumerating and starting from , replace the current element by a strictly larger element of whenever one exists; the resulting chain is strictly increasing in the partial order [L3] and therefore has at most terms, so the procedure stops at a weight above which no weight of lies.
Choose , which is possible because is a weight by step 2.1.
Let and . If , then by [L2], so would be a weight of strictly above by [L3], contradicting the maximality of from step 2.1. Hence for every in every positive root space, and therefore by [L4].
By step 4.1 the vector is a highest weight vector of weight (Highest-weight vectors and modules); since is irreducible and nonzero, the subrepresentation generated by is all of , so is a highest weight module of highest weight .
The existence of a highest weight vector in is proved.
Depends on
- Finite-dimensional modules decompose into weight spaces
- Root vectors shift weights
- Root order on weights
- Highest-weight vectors and modules
- Irreducible, completely reducible, and faithful representations
- Positive and negative nilpotent subalgebras and the Borel
- Simple roots form a signed integral basis
- The Axiom of Choice
Used by
Dependency tree · two levels
27 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
- Alexander Kirillov Jr., An Introduction to Lie Groups and Lie Algebras (standard reference, not scraped)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)