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 serre quotient has weyl symmetry and no residual kac moody kernel
Statement
For symmetrizable , let be the quotient of by the ideal generated by both families of Serre elements. The natural surjection has zero kernel. Before this identification, finite adjoint exponentials on implement simple reflections and preserve the root multiplicities of its kernel.
Facts & Assumptions
Given: The Serre quotient and its Q-grading, before identifying it with g(A).
The relation ideals have homogeneous generators satisfying the Casimir constraint. (Kac moody relation module embeds in verma modules and obeys the casimir constraint).
The Serre elements vanish in g(A). (Serre elements vanish before Serre generation).
The simple reflection is lambda minus its coroot coordinate times alpha_i. (Simple reflections and the kac moody weyl group).
The root form obeys the symmetrizer convention. (Invariant bilinear form for a symmetrizable kac moody algebra).
Proof
F2 puts the Serre ideal inside , yielding the surjection and kernel . Thus the Cartan embeds in ; its other weights have one sign because it is a homogeneous quotient of . Pure multiples of a simple root are absent beyond , since each free half has that property. The simple components map injectively to , so the kernel has no simple or zero weights.
On , is nilpotent on every by the defining Serre relations, on by , , , and on by . The binomial identity proves local nilpotence on all bracket words. The same calculation holds for and in . The finite exponentials and their negative-exponent inverses preserve brackets. Their product sends to and fixes in the Cartan, by the three-term simple-triple expansions. Thus , and for of weight . The quotient map commutes with these finite polynomials, so and its inverse preserve the kernel.
If the positive kernel is nonzero, let have the smallest height among its nonzero weights. By F1 every element of is a finite sum of iterated positive adjoints of constrained homogeneous generators. A generator of smaller height maps to zero in the positive kernel by minimality, as do all of its adjoints. Any surviving term at degree must therefore be a generator in degree itself. Consequently .
For every , step 2.1 produces a nonzero kernel vector at . Since is not simple, it has a positive coefficient at some index other than ; otherwise it would be a forbidden pure multiple. That coefficient is unchanged by , so the one-sign property forces . Minimality gives , hence . F4 now gives , contradicting step 2.2. The positive kernel vanishes. The sign-changing involution preserves S and r and interchanges signs, so the negative kernel also vanishes. There is no zero kernel component by step 1.1.
Sources
Source comparison: Kleshchev, Theorem 9.3.5, pp.125–126; direct Serre-quotient exponential construction from §3.2.
Depends on
Used by
Dependency tree · two levels
16 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.