Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Dominance is necessary for an integrable highest weight module

Statement

Let V be a nonzero integrable highest-weight module for a finite GCM over C, generated by a nonzero highest vector v of weight λ. Then λP+. For every simple index i, fiλ(hi)+1v=0,fikv0(0kλ(hi)). In particular this applies to the simple highest-weight module LA(λ) whenever it is integrable.

Facts & Assumptions

Given: The stated nonzero highest vector and integrable module over C.

[F1]

Dominant integrality means that every λ(hi) is a nonnegative integer (Kac moody integral and dominant integral weights).

[F2]

Integrability gives finite-dimensional cyclic simple-root modules and local nilpotence of both simple generators (Integrability can be checked on simple root sl2 subalgebras).

[F3]

The module LA(λ) is nonzero and generated by a highest vector of weight λ (Kac moody verma module has a unique simple quotient).

[F4]

The generator relations give [ei,fi]=hi and [hi,fi]=2fi (Contragredient lie algebra before the maximal ideal quotient).

Proof

1.1

Fix i and put e=ei, f=fi, h=hi, a=λ(hi). The relation hf=f(h2) gives hfmv=(a2m)fmv by induction. Since ev=0, induction also gives efmv=m(am+1)fm1v for m1: for m=1 this is efv=hv=av, and from the formula at m we get efm+1v=fefmv+hfmv=(m(am+1)+a2m)fmv=(m+1)(am)fmv.

F4given
2.1

By F2 there is a least positive integer N such that fNv=0. Minimality gives fN1v0, including N=1 because v0. Apply e to the zero vector fNv and use 1.1: 0=N(aN+1)fN1v. In characteristic zero, N0 and the vector is nonzero, so a=N1Z0. Minimality gives every nonzero power through a and the first zero at a+1.

F2step 1.1
3.1

Apply 2.1 to each simple index; F1 gives λP+. For label zero, N=1 and the string is precisely the single nonzero vector v, with fv=0. The zero module is excluded by the nonzero highest vector hypothesis; if there are no simple indices, all asserted label conditions are vacuous. Only least integers and a fixed finite index set were used, so no choice assumption enters. F3 supplies the stated specialization to LA(λ).

F1F3step 2.1

Depends on

Used by

Dependency tree · two levels

12 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