Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Quantum Verma and simple modules for sl2

Example

Use the standard rank-one datum P=Zω, P∨=Zh, α=2ω, ⟨ω,h⟩=1 and d1=1. Thus Uq(g) is generated by E,F,K±1 with q1=q. For m∈Z, put λ=mω and write [t]=(qt−q−t)/(q−q−1).

The Verma module M(m) has ordinary-power basis ut=Ftu0, t≥0, where u0=vλ. Its actions are Kut=qm−2tut,Fut=ut+1,Eut=[t][m−t+1]ut−1(t≥1),Eu0=0. The divided-power basis vt=F(t)u0=ut/[t]! instead satisfies Kvt=qm−2tvt,Fvt=[t+1]vt+1,Evt=[m−t+1]vt−1(t≥1),Ev0=0.

(a) For m≥0, the submodule generated by Fm+1u0 is the tail spanned by ut, t≥m+1. Its quotient L(m) is simple of dimension m+1, with divided-power basis v0,…,vm and the second set of actions, with v−1=vm+1=0. For m=0 it is trivial.

(b) For m=−1, the raising coefficients in the divided-power basis are [−t]=−[t]≠0 for every t≥1. Hence M(−1)=L(−1) is irreducible, infinite-dimensional and not integrable. Its highest weight is integral and is not dominant.

(c) For every m<0, m−t+1≠0 at all t≥1, so the same conclusions hold. Thus dominance in The integrable quantum highest weight module exists and is unique is essential.

Facts & Assumptions

Given: The rank-one Cartan datum, the Verma module M(m)=Uq−v0 with Uq−=Q(q)[F], and the generators E,F,K±1.

[F1]

M(λ) is free of rank one over Uq− with basis ut=Ftu0, has weights λ−Q+={λ−tα1}={m−2t:t≥0}, and satisfies Kv0=qmv0, Ev0=0, KF=q−2FK (Quantum Verma modules M(λ), highest weight vectors, and the simple highest weight quotient L(λ), Quantum weight modules, weights in P, and integrability).

[F2]

EFt=FtE+Ft−11q−q−1∑s=0t−1(q−2sK−q2sK−1) for t≥1, and [m−t+1]=qm−t+1−q−m+t−1q−q−1 (Divided-power commutation and the simple Uqi(sl2) string modules (ii), Quantum integers, factorials, Gaussian binomials and divided powers at qi).

[F3]

[j]=0 for an integer j if and only if j=0, and [j]≠0 otherwise; more precisely [−t]=−[t] for t≥1 (Quantum integers, factorials, Gaussian binomials and divided powers at qi).

[F4]

For λ∈P+ the Serre quotient M(λ)/∑iUq(g)Fiλ(hi)+1vλ is the simple module L(λ) and is universal among integrable cyclic highest weight modules of weight λ (The integrable quantum highest weight module exists and is unique).

Verification

technique · read the rank-one Verma string from the commutation formula, split off the finite string when the highest weight is nonnegative, and prove irreducibility in the negative cases by the largest-index raising argument
1.1F1F2F3algebra

Basis and action. By [F1], the ordinary-power vectors ut=Ftu0 are a basis, with Kut=qm−2tut and Fut=ut+1. Evaluating [F2] on u0 gives Eut=(∑s=0t−1(qm−2s−q−m+2s)/(q−q−1))ut−1. The geometric sums satisfy ∑s=0t−1q−2s=q−(t−1)[t] and ∑s=0t−1q2s=qt−1[t], so Eut=[t][m−t+1]ut−1. Dividing by [t]! gives the displayed actions on vt=F(t)u0.

2.1step 1.1F1F3F4algebra

The dominant quotient. For m≥0, Eum+1=0 by step 1.1. The tail spanned by ut, t≥m+1, is stable under E,F,K±1 by those formulas, and it is exactly the submodule generated by um+1 because repeated F generates every tail vector. Therefore its quotient has basis v0,…,vm and the stated truncated divided-power actions. For a nonzero vector x=∑t=0Tctvt with largest occupied index T≤m, ETx=cT∏j=1T[m−j+1]v0≠0: lower-index terms are killed. Any submodule containing x contains v0 and then every vt, so the quotient is simple. The empty product covers T=0 and m=0 gives the trivial module.

2.2step 1.1F1F3algebra

The boundary m=−1. Here Evt=−[t]vt−1 for t≥1. For a nonzero finite sum x=∑t=0Tctvt with cT≠0, ETx=cT∏j=1T(−[j])v0≠0, including the empty product when T=0. A submodule containing x therefore contains v0 and every vt; M(−1) is simple. It is infinite-dimensional by its basis, and Ftu0=ut≠0 for all t, so it is not integrable. The label −1 is integral and is not dominant.

3.1step 1.1step 2.1step 2.2F1F3F4algebra∎

For m<0, all scalars [m−j+1], j≥1, are nonzero. The same largest-index argument gives ETx=cT∏j=1T[m−j+1]v0≠0 for each nonzero finite sum. Thus M(m)=L(m) is simple, infinite-dimensional and non-integrable, with integral non-dominant highest weight. The explicit dominant strings in step 2.1 and these negative cases prove all stated conclusions.

Depends on

Used by

Dependency tree · two levels

19 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