Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Simple root string in an integrable kac moody module

Example

Let v≠0 have weight η in an integrable module and satisfy eiv=0 for a fixed simple index i. Then m=η(hi)∈Z≥0, and its cyclic simple-root module has basis v,fiv,…,fimv, with weights η−kαi. Reflection sends the index k to m−k. This describes that cyclic module, not the entire intersection of an arbitrary module's support with η+Zαi.

Facts & Assumptions

Given: The stated nonzero i-highest vector; no highest-vector condition for the other indices is imposed.

[F1]

Both ei and fi are locally nilpotent (Integrable kac moody module).

[F2]

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

[F3]

The reflection formula is siξ=ξ−ξ(hi)αi, with αi(hi)=2 (Simple reflections and the kac moody weyl group).

[F4]

Reflected weight spaces in the ambient module are isomorphic without AC (Integrable weight sets and multiplicities are weyl invariant).

Verification

1.1F1F2given

Write e=ei,f=fi,h=hi and initially a=η(hi). F2 gives hfkv=(a−2k)fkv. From ev=0 and efk+1v=fefkv+hfkv, induction gives efkv=k(a−k+1)fk−1v. Let N≥1 be the least exponent with fNv=0, supplied by F1. Then fN−1v≠0 and 0=efNv=N(a−N+1)fN−1v forces a=N−1=m∈Z≥0. Thus precisely the powers from 0 through m are nonzero.

2.1F2F3step 1.1

The span S of these powers is invariant under e,f,h by the formulas in 1.1, and contains v. Conversely every vector in the list is obtained by applying a power of f to v. Hence S is exactly the cyclic simple-root module. Full Cartan commutation in F2 gives weight η−kαi to fkv. These weights are distinct, since αi(hi)=2, so the nonzero vectors are independent. Their raising coefficients are k(m−k+1), nonzero for 1≤k≤m and zero at the highest endpoint.

3.1F3F4step 1.1step 2.1∎

Directly using F3, si(η−kαi)=η−kαi−(m−2k)αi=η−(m−k)αi. Within S, the explicit map fkv↦fm−kv between each pair of one-dimensional weight spaces is a linear isomorphism. F4 additionally identifies the corresponding full ambient weight spaces, without a finite-multiplicity assumption. At k=0 and k=m this exchanges the endpoints. If m=0, the sole vector is killed by both e,f and the reflection fixes its weight. Zero v is excluded; no assumption about other weight strings or the whole coset intersection was made. Only finite strings and F4's choice-free maps are used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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