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 shifted integrable character numerator is Weyl skew
Statement
Let be finite and symmetrizable and . Then is Weyl skew: as coefficient arrays in the formal downward-cone completion. The character symmetry used here requires no AC.
Facts & Assumptions
Given: The stated datum, and .
The denominator is skew by The Kac Moody denominator is Weyl skew.
Dominant integral labels are defined in Kac moody integral and dominant integral weights.
Local nilpotence and weight decomposition mean Integrable kac moody module.
Every vector lies in a finite-dimensional simple-root submodule by Integrability can be checked on simple root sl2 subalgebras.
is integrable by Integrability criterion for simple highest weight kac moody modules.
The dual reflection is by Simple reflections and the kac moody weyl group.
The Cartan and simple-root brackets are Contragredient lie algebra before the maximal ideal quotient.
Characters and finite coefficient multiplication are Kac Moody formal character completion.
The Verma module belongs to by Universal property and pbw character of kac moody verma modules, and is its quotient by Kac moody verma module has a unique simple quotient; F8 makes quotients of -modules remain in .
Proof
Fix and write . By F2 and F5 the module has the local nilpotence in F3, while F8 and F9 give and hence well-defined finite-dimensional weight spaces. Thus is defined on each vector by finite sums. Its inverse is : each adjacent exponential cancellation is the finite binomial identity on a vector. F4 permits all computations involving on a finite-dimensional invariant subspace containing the vector under consideration.
The brackets in F7 give conjugations , and . These follow by expanding the finite exponentials, or by differentiating their polynomial conjugations and using the first two commutators. Consequently the successive conjugations of in are , then , then . For an arbitrary , put . F7 makes commute with , so . The polynomial identities hold on every vector by step 1.1; commutation with requires no finite-dimensional invariant space for the whole Cartan.
If , step 2.1 and give . Thus is an isomorphism, with the inverse from step 1.1. The two finite dimensions in F8 are equal, including when both spaces are zero. Hence as coefficient arrays.
Transform the coefficient sum for by . Relabelling its pairs of exponents bijectively gives the coefficient sum for ; it is finite because its preimage is a coefficient sum of the original product, finite by F8. F1 and step 3.1 therefore give . Iterating a finite word gives the claimed determinant sign. No assertion of an action on arbitrary completion elements is needed. All exponential identities were finite on each vector and no bases of infinitely many spaces were selected.
Depends on
- The Kac Moody denominator is Weyl skew
- Kac moody integral and dominant integral weights
- Integrable kac moody module
- Integrability can be checked on simple root sl2 subalgebras
- Integrability criterion for simple highest weight kac moody modules
- Universal property and pbw character of kac moody verma modules
- Kac moody verma module has a unique simple quotient
- Simple reflections and the kac moody weyl group
- Contragredient lie algebra before the maximal ideal quotient
- Kac Moody formal character completion
Used by
Dependency tree · two levels
23 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, Section 10.1 (standard reference, not scraped)
- Perrin, Section 11.2 (standard reference, not scraped)