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.
Highest weight modules lie below the top weight
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 representation generated by a highest weight vector of weight (Highest-weight vectors and modules). Then every weight of is of the form with , so that in the root order (Root order on weights), and
Facts & Assumptions
Given: The Axiom of Choice, such , a chosen positive system, and a module generated by a highest weight vector of weight .
The Axiom of Choice is assumed; it enters through the root-space theory supplying [L1], [L2] and [L4] (The Axiom of Choice).
The chosen positive system gives the direct sum with the span of the root spaces , (Triangular decomposition, Positive and negative nilpotent subalgebras and the Borel).
For an ordered basis of a finite-dimensional complex Lie algebra, the monomials form a basis of its universal enveloping algebra (Poincaré–Birkhoff–Witt theorem); applied to with an ordered basis beginning with a basis of , continuing with a basis of and ending with a basis of , this gives as a linear span, and applied to it gives that the monomials in a basis of span .
The action of on extends to a unital action of , and the subrepresentation generated by is (Lie representations are U(g)-modules, Highest-weight vectors and modules).
If and , then (Root vectors shift weights).
Every positive root is a nonzero nonnegative integral combination of the simple roots, each root space is one-dimensional, and the simple roots are linearly independent (Simple roots form a signed integral basis, Root spaces of a complex semisimple Lie algebra are one-dimensional).
Proof
by [L3], because is the subrepresentation generated by .
Applying [L2] and using that and for gives .
Fix a basis of consisting of root vectors with ; by [L2] the monomials in the span , so every element of is a linear combination of vectors , and by [L4] and [L5] the weight of such a vector is , a functional of the form with .
By step 3.1 every weight of lies in and satisfies in the root order (Root order on weights).
For the top weight, a monomial has weight exactly when ; since the are nonzero elements of and the simple roots are linearly independent by [L5], this forces for every , so the only monomial of weight is the empty one and .
Steps 2.1, 4.1 and 4.2 prove the three assertions.
Depends on
- Highest-weight vectors and modules
- Weight and weight space
- Root order on weights
- Triangular decomposition
- Poincaré–Birkhoff–Witt theorem
- Root vectors shift weights
- Simple roots form a signed integral basis
- Root spaces of a complex semisimple Lie algebra are one-dimensional
- Positive and negative nilpotent subalgebras and the Borel
- Lie representations are U(g)-modules
- The Axiom of Choice
Used by
- Orthogonality identifies the Weyl numerator Lemma
- Simple-root integrability bounds the dominant cyclic module Lemma
- The dominant cyclic generator survives Lemma
- Unique simple quotient of the dominant cyclic module Lemma
- Extremal Weyl-orbit weights Proposition
- Highest weight of the dual representation Proposition
- The highest-weight space is one-dimensional Proposition
- Top summand in a tensor product Proposition
- Highest weights for compact connected groups Theorem
- Highest-weight classification Theorem
- Simple highest-weight modules are classified by highest weight Theorem
Dependency tree · two levels
41 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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)
- Alexander Kirillov Jr., An Introduction to Lie Groups and Lie Algebras (standard reference, not scraped)