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.
Kostant multiplicity in the sl3 adjoint module
Example
Assume the Axiom of Choice (The Axiom of Choice). Take with and let be the highest root, so that the adjoint module is (The adjoint highest weight is the highest root, Highest-weight classification). Compute the multiplicity of from Kostant's formula (Kostant's weight multiplicity formula): with , the terms are for , and for every , so only contributes and , the two partitions being itself and ; this matches the adjoint weights (multiplicity one each), (multiplicity one each), (multiplicity one each) and the zero weight of multiplicity two, for .
Facts & Assumptions
Given: The Axiom of Choice, the realization of with diagonal Cartan subalgebra and roots , where , the Weyl group with simple reflections , the Weyl vector , and the adjoint module .
The Axiom of Choice is assumed; it enters through the Kostant formula and the highest-weight suppliers below (The Axiom of Choice).
In this realization the positive roots are and is the highest root; the simple reflections act by , , , , and (Root systems of the classical complex Lie algebras, Classical complex matrix Lie algebras, Height and highest root, The Weyl vector rho for a chosen positive system).
with lengths , and the adjoint module is the irreducible module of highest weight ; its weights are the roots together with , with the root spaces one-dimensional and of dimension (The adjoint highest weight is the highest root, Finite semisimple Cartan, root and string structure, Weyl length equals inversion number).
, because a family with is either or , while for (The Kostant partition function).
Kostant's formula reads , and is dominant integral (Kostant's weight multiplicity formula, Integral, dominant, and strictly dominant weights).
Verification
With , and the arguments of [F4] are ; for this is with by [F3], while for it is , for it is , for it is , for it is and for it is , none of which lies in , so those partitions vanish by [F3].
The two partitions counted by are the family with and the family with , both summing to .
Steps 1.1 and 1.2 give ; the adjoint weights are the six roots, each with multiplicity one by [F2], and the zero weight whose multiplicity is the dimension of , so the weighted count is , matching the computed zero multiplicity.
Depends on
- The Axiom of Choice
- Kostant's weight multiplicity formula
- The Kostant partition function
- The adjoint highest weight is the highest root
- Height and highest root
- Root systems of the classical complex Lie algebras
- Classical complex matrix Lie algebras
- Highest-weight classification
- Integral, dominant, and strictly dominant weights
- Finite semisimple Cartan, root and string structure
- Weyl length equals inversion number
- The Weyl vector rho for a chosen positive system
Used by
Dependency tree · two levels
60 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
- P. Etingof, Lie Groups and Lie Algebras II (MIT 18.755, Spring 2024), complete lectures (standard reference, not scraped)
- B. Weber, Weyl Character Formula II: Formulas of Weyl and Kostant (Penn Math 651, March 2013) (standard reference, not scraped)