Alphabeta Math
PropositionStatement: 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 weyl group preserves roots and root multiplicities

Statement

For every finite GCM, W permutes Δ, and dimgwβ=dimgβ. Each simple reflection is implemented on root spaces by a Lie automorphism of g. For a symmetrizer D, the form on the root span with (αi,αj)=diaij is W-invariant.

Facts & Assumptions

Given: A finite GCM, its simple triples and the specified Weyl action.

[F1]

The reflection formula is fixed. (Simple reflections and the kac moody weyl group).

[F2]

Serre vanishing holds before generation. (Serre elements vanish before Serre generation).

[F3]

Root spaces form a direct weight decomposition with finite multiplicities. (Kac moody root spaces are finite dimensional).

Proof

1.1

For D=adei, F2 gives nilpotence on each ej; the relations give Dfj=δijhi, D2fi=2ei, D3fi=0, and D2h=0. For any derivation, Dm[x,y]=k=0m(mk)[Dkx,Dmky], proved by induction and Pascal addition. Hence nilpotence on generators propagates to every finite bracket word and every finite sum. The same holds for adfi. Their pointwise finite exponentials preserve brackets by the binomial identity, with inverses obtained by negating the derivation.

F2given
2.1

Set Ti=exp(adfi)exp(adei)exp(adfi). On the triple, the finite expansions use exp(adfi)ei=eihifi, exp(adfi)hi=hi+2fi, and exp(adei)fi=fihiei. Substitution gives Tiei=fi, Tifi=ei, and Tihi=hi. It fixes kerαi in h. Writing h=(hαi(h)hi/2)+αi(h)hi/2 gives Tih=hαi(h)hi.

F1step 1.1
3.1

For xgβ, [h,Tix]=Ti[Ti1h,x]=β(sih)Tix=(siβ)(h)Tix. The inverse automorphism gives a bijection between these spaces. Products of Ti implement each word in the generators of W, proving root and multiplicity invariance. Only the induced weight action, not independence of the lift from a word, is required.

F1F3step 2.1
4.1

If DA is symmetric, extend (αi,αj)=diaij bilinearly. For λ in the root span, (αi,λ)=diλ(hi) and (αi,αi)=2di. Expanding (λλ(hi)αi,μμ(hi)αi) cancels the two cross terms against 2diλ(hi)μ(hi), leaving (λ,μ). This computation allows a degenerate form.

F1given

Sources

Source comparison: Kleshchev, Lemma 3.1.2 and §3.2, pp.37–42.

Depends on

Used by

Dependency tree · two levels

9 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