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 formal character of a finite-dimensional weight module
Definition
Assume the Axiom of Choice (The Axiom of Choice). Let be a finite-dimensional -module, where is a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra , and let be its weight-space decomposition, with the weight space of Weight and weight space (Finite-dimensional modules decompose into weight spaces). The formal character of is the finite sum with integer coefficients taken in the completed formal character ring of The completed formal character ring; equivalently, is the coefficient family on , which has finite support by the cited decomposition.
We write for the multiplicity of as a weight of the finite-dimensional simple module of highest weight (Highest-weight classification), so that ; the coefficients are nonnegative integers and for all but finitely many .
Depends on
Used by
- The Borel-Weil-Bott Euler character is a signed dual Weyl character Corollary
- Regularized evaluation of the Weyl character quotient at one Lemma
- The BGG Euler identity gives the Weyl numerator Lemma
- Characters of finite-dimensional modules are Weyl-invariant Proposition
- Formal characters are additive and multiplicative Proposition
- Tensor-product multiplicities are character structure constants Proposition
- Freudenthal's weight multiplicity recursion Theorem
- Kostant's weight multiplicity formula Theorem
- Steinberg's tensor-product multiplicity formula Theorem
- The Weyl character formula Theorem
- The Weyl denominator identity Theorem
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
- P. Etingof, Lie Groups and Lie Algebras II (MIT 18.755, Spring 2024), complete lectures (standard reference, not scraped)
- A. Moreau, Representation Theory of Lie Algebras (M2, Université Paris-Saclay, 2025--2026) (standard reference, not scraped)