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.
Integrable highest weight modules for rank one gcm
Example
For and , the module has basis with where . It is simple and integrable of dimension .
Facts & Assumptions
Given: , label integral, and the simple highest-weight module with a specified nonzero highest vector .
Dominant labels give an integrable simple highest-weight module (Integrability criterion for simple highest weight kac moody modules).
Its lowering powers are nonzero through exponent and zero at exponent (Dominance is necessary for an integrable highest weight module).
The minimal Cartan for has dimension and (Realization of a generalized cartan matrix).
The relations are , , (Contragredient lie algebra before the maximal ideal quotient).
Highest-weight modules are spanned by negative enveloping words on the highest vector (Universal property and pbw character of kac moody verma modules).
Verification
The negative algebra is generated by its sole generator , so every bracket of length at least two is zero, beginning with and inducting on bracket length. Hence F5 spans by powers of on . Put . By F1 and F2, exactly the powers through are nonzero. F4 gives by induction from the highest label. These eigenvalues are distinct, so the vectors are independent: Lagrange polynomials in isolate each coefficient in a finite relation. Thus they form a basis.
The formula for is the definition of . Starting with , the recurrence gives the coefficient recurrence , . Summing yields , proving the displayed formula for . It includes and at gives zero consistently with .
The formulas directly check the brackets on every basis vector. Whenever the corresponding shifted vector is present, and ; at the omitted endpoints both sides vanish. For , . At , this is ; at , it is . For all three operators act as zero and all relations hold. Both and vanish. If a submodule is nonzero, interpolation in gives some in it; then , with empty product for . Applying then supplies every basis vector, proving simplicity directly. No AC is used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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)