Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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.

Specializing a quantum highest weight lattice at q=1

Example

Let sl2 be the rank-one Cartan datum with λ(h1)=m∈Z≥0, and let L(m) be the explicit simple module with basis v0,…,vm, Kvt=qm−2tvt, Fvt=[t+1]qvt+1, Evt=[m−t+1]qvt−1 (Quantum Verma and simple modules for sl2, Quantum integers, factorials, Gaussian binomials and divided powers at qi). Let A=Z[q,q−1] and let VA=∑t=0mAF(t)v0⊆L(m) be the lattice generated by the highest weight vector under the divided powers of the integral form UA (The Lusztig divided-power integral form UA). Let k be a field of characteristic 0, made an A-algebra by q↦1, and put Vˉ=VA⊗Ak.

Then VA is free over A with basis F(t)v0 (0≤t≤m), and Vˉ is a k-vector space of dimension m+1 with basis the images vˉt on which Kˉ=1,Fˉvˉt=(t+1)vˉt+1,Eˉvˉt=(m−t+1)vˉt−1,Tˉ0,1vˉt=(m−2t)vˉt, with vˉ−1=vˉm+1=0. This is exactly the classical (m+1)-dimensional simple representation of sl2 on the coroot basis: Tˉ0,1 is the Cartan generator h acting by the weight m−2t, and Eˉ,Fˉ are the classical raising and lowering matrices, so the weight multiplicities are dim⁡kVˉμ=1 for μ=m,m−2,…,−m and 0 otherwise. For m=2 the specialized matrices are Eˉvˉ0=0, Eˉvˉ1=2vˉ0, Eˉvˉ2=vˉ1 and Fˉvˉ0=vˉ1, Fˉvˉ1=2vˉ2, Fˉvˉ2=0, with Tˉ0,1=diag⁡(2,0,−2), the standard adjoint-type triple.

Facts & Assumptions

Given: The rank-one datum, the simple module L(m) with its string basis, the lattice VA, and the specialization A→k, q↦1.

[F1]

F(t)v0=1[t]!Ftv0, the vectors Ftv0 (0≤t≤m) are Q(q)-independent, and the action on the string is Kvt=qm−2tvt, Fvt=[t+1]qvt+1, Evt=[m−t+1]qvt−1 (Quantum Verma and simple modules for sl2, Quantum integers, factorials, Gaussian binomials and divided powers at qi).

[F2]

Gaussian binomials with nonnegative upper entry lie in A (The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality). Also [t]!∈A and [t]!≠0; the divided powers E(r),F(r), the K±1 and the Tc,t generate UA; on a weight vector of weight μ the toral binomial Tc,t acts by the Gaussian value (μ(h)+ct)q, preserving any stable lattice to which that supplier applies (The Lusztig divided-power integral form UA, The q=1 toral specialization identifies the classical Cartan generators (b)).

[F3]

On a UA-stable label-graded lattice the specialization has Kˉ=id, Tˉi,c,t acting by the integer binomials and the classical Cartan commutators; the specialization is defined by base change of the integral form, never by substituting into rational expressions (The q=1 toral specialization identifies the classical Cartan generators (b), Specialization at q=1 recovers the classical enveloping relations (c),(d)).

[F4]

The local deformation lemma Local q=1 deformation proves integrable highest weight universality (a) gives equality of quantum and classical highest-weight characters. Its part (c) identifies the q=1 fibre of the specified ordinary-word lattice VR=∑wRFwv0, over R=Q[q](q−1), with the classical simple module. In rank one the quantum string is the (m+1)-dimensional module of Quantum Verma and simple modules for sl2 (a); the actual lattice comparison is checked below.

Verification

technique · check the lattice is preserved by the integral generators with A-valued matrices, tensor with k, and compare the resulting matrices with the classical rank-one simple representation
1.1F1F2F3algebra

The lattice. Put vt=F(t)v0, 0≤t≤m. These vectors are Q(q)-independent by [F1], so VA=⨁t=0mAvt is free. For r≥0, repeated application of the string formulas and division by [r]! give F(r)vt=(t+rr)qvt+r if t+r≤m, and 0 otherwise; likewise E(r)vt=(m−t+rr)qvt−r if r≤t, and 0 otherwise. The coefficients are Laurent integral by the Gaussian identities. Also K±1vt=q±(m−2t)vt, and Tc,svt=(m−2t+cs)qvt∈Avt, including negative upper labels by the generalized-binomial identity of [F3]'s supplier. Thus every generator of UA preserves VA. Each vt is obtained by a divided power from v0, so VA=UAv0.

1.2F1F2F3algebra

Specialization. Base change of the explicit free basis to k gives Vˉ=VA⊗Ak has the k-basis vˉ0,…,vˉm and dimension m+1. Substituting q=1 is legitimate here because the action matrices in the basis F(t)v0 are known explicitly with entries in A: Kˉ=id, Fˉvˉt=(t+1)vˉt+1, Eˉvˉt=(m−t+1)vˉt−1 and Tˉc,svˉt=(m−2t+cs)vˉt, in particular Tˉ0,1vˉt=(m−2t)vˉt; this is the operator form of [F3] on the graded lattice.

2.1F2F3F4step 1.1step 1.2algebra∎

Comparison with the classical module. The displayed operators satisfy [Eˉ,Fˉ]=Tˉ0,1, [Tˉ0,1,Eˉ]=2Eˉ and [Tˉ0,1,Fˉ]=−2Fˉ, including the string ends, so they define a classical sl2-module. It is simple: if x=∑t=0Tctvˉt≠0 with cT≠0, then EˉTx=cT∏j=1T(m−j+1)vˉ0≠0 in characteristic zero, and Fˉtvˉ0=t!vˉt generates every basis vector. The empty product covers T=0 and m=0. This is the simple highest-weight module of weight m. To apply F4 to this lattice, note that [t]! is an R-unit since its value at q=1 is t!≠0. Thus R⊗AVA=∑t=0mRFtv0=VR. Since A→k factors through R, base change of its specified fibre gives precisely Vˉ; F4 separately gives the character comparison. The m=2 matrices follow from step 1.2. Freeness here is proved by the explicit string basis, without global freeness or choice.

Depends on

Used by

Dependency tree · two levels

34 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