Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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 A, let g be the quotient of g~ by the ideal generated by both families of Serre elements. The natural surjection gg(A) has zero kernel. Before this identification, finite adjoint exponentials on g 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).

[F1]

The relation ideals have homogeneous generators satisfying the Casimir constraint. (Kac moody relation module embeds in verma modules and obeys the casimir constraint).

[F2]

The Serre elements vanish in g(A). (Serre elements vanish before Serre generation).

[F3]

The simple reflection is lambda minus its coroot coordinate times alpha_i. (Simple reflections and the kac moody weyl group).

[F4]

The root form obeys the symmetrizer convention. (Invariant bilinear form for a symmetrizable kac moody algebra).

Proof

1.1

F2 puts the Serre ideal S inside r, yielding the surjection and kernel r=r/S. Thus the Cartan embeds in g; its other weights have one sign because it is a homogeneous quotient of g~. Pure multiples of a simple root are absent beyond ±αi, since each free half has that property. The simple components map injectively to g, so the kernel has no simple or zero weights.

F2given
2.1

On g, D=adei is nilpotent on every ej by the defining Serre relations, on fj by Dfj=δijhi, D2fi=2ei, D3fi=0, and on h by D2h=0. The binomial identity Dm[x,y]=k(mk)[Dkx,Dmky] proves local nilpotence on all bracket words. The same calculation holds for adfi and in g. The finite exponentials and their negative-exponent inverses preserve brackets. Their product Ti=exp(adfi)exp(adei)exp(adfi) sends (ei,hi,fi) to (fi,hi,ei) and fixes kerαi in the Cartan, by the three-term simple-triple expansions. Thus Tih=hαi(h)hi, and [h,Tix]=(siβ)(h)Tix for x of weight β. The quotient map commutes with these finite polynomials, so Ti and its inverse preserve the kernel.

F2F3step 1.1
2.2

If the positive kernel is nonzero, let α=kiαi have the smallest height among its nonzero weights. By F1 every element of rα+ 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 (α,α)=2(ρ,α)=2ikidi>0.

F1F4step 1.1
3.1

For every i, step 2.1 produces a nonzero kernel vector at siα. Since α is not simple, it has a positive coefficient at some index other than i; otherwise it would be a forbidden pure multiple. That coefficient is unchanged by si, so the one-sign property forces siα>0. Minimality gives ht(siα)=ht(α)α(hi)ht(α), hence α(hi)0. F4 now gives (α,α)=ikidiα(hi)0, 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.

F3F4step 1.1step 2.1step 2.2

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.

Sources