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.
Local nilpotence of only the ei does not imply integrability
Statement refuted
False claim: for a Kac–Moody weight module, local nilpotence of every simple raising operator implies integrability.
For any finite GCM with at least one simple index, has every locally nilpotent, but no is locally nilpotent on its highest vector. In particular , gives a weight-module counterexample even at dominant integral highest weight.
Facts & Assumptions
Given: The Verma module for a finite GCM with at least one simple index.
Every lowering power is nonzero, and the Verma module is not integrable (A kac moody verma module is not integrable in general).
The Verma module is a weight module with support in (Universal property and pbw character of kac moody verma modules).
Counterexample
Let have weight with . Applying gives a vector of weight . For , its difference below has -coordinate , so it is not in by independence of the simple roots. F2 implies that weight space is zero, hence . Every vector has finitely many weight components; taking one plus the maximum of their -coefficients gives an exponent killing all components. For the zero vector take exponent one. Thus every is locally nilpotent on the entire module.
F1 supplies the same module's nonzero highest vector on which every power of is nonzero. It therefore fails integrability despite the verified raising condition. In the rank-one example at , the vector has weight , so step 1.1 gives , while for every . For the raising bound is one; arbitrary finite sums use the maximum bound, not a global uniform bound. The simple index set must be nonempty for the failed lowering requirement to exist. This calculation is choice-free.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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)