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.
Freudenthal's weight multiplicity recursion
Statement
Assume the Axiom of Choice (The Axiom of Choice). For every dominant integral weight and every , with for every that is not a weight of and with the Weyl vector (The Weyl vector rho for a chosen positive system); the inner sum is finite by Positive root strings sum the Freudenthal correction.
Facts & Assumptions
Given: The Axiom of Choice, a dominant integral weight , an element , the positive system , the Weyl vector , and the multiplicities of the finite-dimensional simple module of highest weight .
The Axiom of Choice is assumed; it is inherited from the published Casimir and classification suppliers used in [F1] and [F2] (The Axiom of Choice).
The Casimir comparison on the weight space reads (The Casimir comparison on a weight space).
Each positive root contributes its string trace the sum being finite and the coefficients vanishing off the weights of (Positive root strings sum the Freudenthal correction).
, so the bilinear form gives , and for every that is not a weight (The Weyl vector rho for a chosen positive system, The formal character of a finite-dimensional weight module).
Expanding the shifted squares with bilinearity and symmetry of gives
Proof
By [F3] the sum of the pairings over the positive roots is , and by [F4] the Casimir coefficient and the shifted-norm difference are related by .
Substituting [F2] into the right side of [F1] gives , and step 1.1 turns the first term into .
Subtracting from both sides of step 2.1 and using the coefficient identity of step 1.1 gives , which is the asserted recursion; the inner sums are finite and the coefficients vanish off the weights of by [F2] and [F3].
Depends on
Used by
Dependency tree · two levels
22 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
- A. Moreau, Representation Theory of Lie Algebras (M2, Université Paris-Saclay, 2025--2026) (standard reference, not scraped)
- R. Borcherds, Berkeley Math 261 course notes, page on the Freudenthal multiplicity formula (standard reference, not scraped)