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.
Simple root power relations generate the integrable quotient
Statement
For put and let be the highest vector of . Set . Then is a nonzero integrable highest-weight module of weight . This holds for every finite GCM over .
Facts & Assumptions
Given: The dominant weight, Verma module and displayed submodule.
Verma universality, negative PBW spanning, top dimension one and support in hold by Universal property and pbw character of kac moody verma modules.
Each is a nonnegative integer (Kac moody integral and dominant integral weights).
Integrability is the weight decomposition together with local nilpotence of both simple generators (Integrable kac moody module).
The negative Serre relations hold (Serre elements vanish before Serre generation).
Submodules and quotients in have the induced weight decompositions (Kac moody category o).
The Cartan and opposite-generator commutator relations hold (Contragredient lie algebra before the maximal ideal quotient).
Proof
Put . From F6, . Starting with , the recurrence gives by induction; substituting gives . If , F6 gives , hence . Thus every simple raising generator kills , and so does their generated algebra . Its weight is by F6. Universality and negative PBW spanning in F1 imply that has support in , even if . Since , this cone misses . Therefore their sum misses the one-dimensional top. By F5 the quotient is a weight module, and its surviving top vector generates it; in particular it is nonzero.
Fix and put on . On Lie generators its nilpotence follows from F4 and F6: for , , for , , , , and . These Lie generators also generate the enveloping algebra as an associative algebra. In the enveloping algebra, induction using the derivation rule and Pascal addition gives . If and , every summand vanishes for . Induction on product length and a maximum for finite sums show that for each there is with .
On a quotient weight vector of weight , write . Applying would give weight , outside because its -coordinate difference is . The quotient support is contained in that cone by F1 and 1.1, so this power vanishes. Taking the maximum exponent over the finitely many weight components of a vector proves local nilpotence of every .
In any associative algebra, . For the assertion is ; multiplication on the left by , followed by and Pascal addition, proves the induction step. Apply this identity to and take , where is from 1.2. Terms with vanish because . For , and the defining relation kills the term. Every quotient vector is for some , so is locally nilpotent.
The weight decomposition in 1.1 and both nilpotence conclusions give integrability by F3. If , the imposed relation is and the same bound is . For choose . Empty sets of simple roots impose no relations and give the one-dimensional Cartan Verma module by F1. All sums defining elements, polynomial expansions and bounds are finite; no AC or assertion that Serre elements generate a defining ideal enters.
Depends on
Used by
Dependency tree · two levels
15 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, Lectures on Infinite Dimensional Lie Algebras (standard reference, not scraped)
- Perrin, Introduction to Kac-Moody Groups and Lie Algebras (standard reference, not scraped)