Alphabeta Math
PropositionStatement: 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.

Integrable weight sets and multiplicities are weyl invariant

Statement

In any integrable g(A)-module V, each simple reflection gives a linear isomorphism VμVsiμ. Products give isomorphisms VμVwμ for every wW, so W preserves support and weight multiplicities. No finite-dimensionality of weight spaces is required for these isomorphisms. They transport any given basis bijectively to a basis. For arbitrary spaces, assume AC when interpreting multiplicities as cardinal sizes of bases; AC is used only to supply those bases. Finite multiplicity equality and all the displayed isomorphisms are choice-free.

Facts & Assumptions

Given: An integrable weight module, a simple index i, and a weight μ.

[F1]

Both simple generators are locally nilpotent (Integrable kac moody module).

[F2]

The dual reflection formulas are siμ=μμ(hi)αi and sih=hαi(h)hi (Simple reflections and the kac moody weyl group).

[F3]

Each vector is in a finite-dimensional invariant cyclic simple-root module (Integrability can be checked on simple root sl2 subalgebras).

[F4]

The simple triple and Cartan commutator relations hold (Contragredient lie algebra before the maximal ideal quotient).

[F5]

AC is the assumption for arbitrary choices (The Axiom of Choice).

[F6]

Under AC every vector space has a basis (Every vector space has a basis).

Proof

1.1

Put e=ei, f=fi, h0=hi. Define T=exp(f)exp(e)exp(f) on V, with each exponential evaluated on a vector by its finite power sum, justified by F1. The inverse is exp(f)exp(e)exp(f): for a locally nilpotent operator x, the coefficient of xm in exp(x)exp(x) is k=0m(1)k/(k!(mk)!), equal to 1 for m=0 and zero otherwise. Every such multiplication on a vector is finite. Thus T is a well-defined linear automorphism.

F1given
1.2

On a finite invariant cyclic module from F3, e and f are nilpotent matrices. For a nilpotent matrix x, multiplication of the two finite exponential polynomials and the identity (adx)r(y)=k=0r(1)k(rk)xrkyxk give exp(x)yexp(x)=r(adx)r(y)/r!; the identity follows inductively by taking the next commutator. Apply this to the triple matrices. F4 gives conjugation by exp(f) sending h0 to h0+2f, and conjugation by exp(e) sending h0 to h0+2e and f to fh0e. Thus successive conjugations send h0 to h0+2f, then h0+2f, then h0. For a weight vector, its cyclic module is invariant under all of h: commuting a Cartan element through a word in e,f,h0 expresses its action as a scalar on the original weight vector plus words of the same kind. Every hh splits as h=hαi(h)h0/2 plus αi(h)h0/2. Since αi(h)=0, F4 makes h commute with e,f and hence with T. Consequently ThT1=hαi(h)h0=sih on all weight vectors and therefore on V.

F2F3F4given
2.1

By F2, si2=1, so 1.2 also gives T1hT=sih. For vVμ, hTv=T(sih)v=μ(sih)Tv=(siμ)(h)Tv. Thus T(Vμ)Vsiμ. Its inverse satisfies the corresponding formula and sends that space into Vμ, proving equality and an isomorphism. Compose these maps along any finite expression w=si1sir. The resulting map is invertible and implements the prescribed weight action; no assertion that different expressions give identical operators is needed.

F2step 1.1step 1.2
3.1

These isomorphisms preserve vanishing and nonvanishing of weight spaces, proving support invariance. If B is any basis of Vμ, its image is independent because applying the inverse to a finite linear relation gives one among B; it spans because the inverse of every target vector is a finite combination of B. Hence the two spaces have bases in explicit bijection. In the arbitrary-space cardinal interpretation, F5 and F6 supply B; this is the sole use of AC. Zero weight spaces have empty bases, a one-dimensional space transports its single basis vector, and the zero module has empty support. An empty Weyl word gives the identity. Zero simple labels mean a preserved weight space, without claiming T acts identically there. The isomorphism and finite-dimensional conclusions used no AC.

F5F6step 2.1

Depends on

Used by

Dependency tree · two levels

22 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