Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 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 highest weight modules for rank one gcm

Example

For A=[2] and mZ0, the module LA(m) has basis v0,,vm with hvk=(m2k)vk,fvk=vk+1,evk=k(mk+1)vk1, where v1=vm+1=0. It is simple and integrable of dimension m+1.

Facts & Assumptions

Given: A=[2], label m0 integral, and the simple highest-weight module with a specified nonzero highest vector v0.

[F1]

Dominant labels give an integrable simple highest-weight module (Integrability criterion for simple highest weight kac moody modules).

[F2]

Its lowering powers are nonzero through exponent m and zero at exponent m+1 (Dominance is necessary for an integrable highest weight module).

[F3]

The minimal Cartan for [2] has dimension 21=1 and α(h)=2 (Realization of a generalized cartan matrix).

[F4]

The relations are [h,e]=2e, [h,f]=2f, [e,f]=h (Contragredient lie algebra before the maximal ideal quotient).

[F5]

Highest-weight modules are spanned by negative enveloping words on the highest vector (Universal property and pbw character of kac moody verma modules).

Verification

1.1

The negative algebra is generated by its sole generator f, so every bracket of length at least two is zero, beginning with [f,f]=0 and inducting on bracket length. Hence F5 spans LA(m) by powers of f on v0. Put vk=fkv0. By F1 and F2, exactly the powers through m are nonzero. F4 gives hvk=(m2k)vk by induction from the highest label. These m+1 eigenvalues are distinct, so the vectors are independent: Lagrange polynomials in h isolate each coefficient in a finite relation. Thus they form a basis.

F1F2F3F4F5given
2.1

The formula for f is the definition of vk. Starting with ev0=0, the recurrence efk+1v0=fefkv0+hfkv0 gives the coefficient recurrence ck+1=ck+m2k, c0=0. Summing yields ck=kmk(k1)=k(mk+1), proving the displayed formula for e. It includes k=0 and at k=m+1 gives zero consistently with vm+1=0.

F4step 1.1
3.1

The formulas directly check the brackets on every basis vector. Whenever the corresponding shifted vector is present, [h,e]vk=2k(mk+1)vk1=2evk and [h,f]vk=2vk+1=2fvk; at the omitted endpoints both sides vanish. For 0<k<m, [e,f]vk=((k+1)(mk)k(mk+1))vk=(m2k)vk. At k=0<m, this is mv0; at k=m>0, it is mvm. For m=0 all three operators act as zero and all relations hold. Both em+1 and fm+1 vanish. If a submodule is nonzero, interpolation in h gives some vk in it; then ekvk=(j=1kj(mj+1))v00, with empty product 1 for k=0. Applying f then supplies every basis vector, proving simplicity directly. No AC is used.

step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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