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.
Weyl Kac character formula
Statement
Let be a finite symmetrizable GCM and a dominant integral weight. With and , one has These are equivalent coefficientwise identities in the downward-cone completion.
Facts & Assumptions
Given: The stated datum and highest weight.
Kac Moody denominator identity identifies with its locally finite alternant.
Only the highest dot orbit can occur in the integrable numerator identifies every coefficient of the numerator, proves orbit distinctness, and bounds by the height of .
Integrability criterion for simple highest weight kac moody modules supplies integrability for dominant integral .
Proof
F3 permits application of F2. Its complete coefficient description gives the first displayed equality. In particular no additional exponents or cancellations from a stabilizer are omitted. Its length bound proves that at any fixed depth only finitely many Weyl terms occur. F1 ensures that the denominator here is the actual root-multiplicity product, not a product with artificial imaginary-root multiplicities.
The series has constant coefficient one and other support in . Its inverse is the formal geometric series in : at depth only powers at most contribute, and finite telescoping verifies both inverse identities. Multiplying step 1.1 by gives the second formula, with finite coefficient sums because each simple-root coordinate is bounded by the target depth. Conversely multiplication by recovers the first. At this is F1, since the trivial module is the simple highest-weight module of weight zero. Empty root data give a single monomial. All operations are formal and choice-free.
Depends on
Used by
Dependency tree · two levels
14 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
- Kleshchev, Theorem 10.2.1 (standard reference, not scraped)
- Perrin, Theorem 11.2.1 (standard reference, not scraped)