Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Rank-one tensor strings and their crystal limit rule

Statement

Let i∈I, write z=qi, and let V(a), V(b) be the simple rank-one modules of nonnegative integral highest weights a,b for the subalgebra generated by Ei,Fi,Ki±1, with divided bases vj=Fi(j)v0 (0≤j≤a) and wk=Fi(k)w0 (0≤k≤b) (Divided-power commutation and the simple Uqi(sl2) string modules). Consider the tensor product with the coproduct ΔEi=Ei⊗Ki−1+1⊗Ei, ΔFi=Fi⊗1+Ki⊗Fi (The Drinfeld–Jimbo formulas define a Hopf algebra), its Kashiwara operators e~i,f~i (Uniqueness of the i-string decomposition of an integrable module) and the Z-graded Q(q)-vector space V(a)⊗V(b) with the tensor lattice L:=⨁j=0a⨁k=0bA0 (vj⊗wk) over the local ring A0 (The local ring A0 of rational functions regular at q=0). Then:

(i) L is a crystal lattice: it is a free A0-module generating V(a)⊗V(b) over Q(q), it respects the weight grading, and e~iL⊆L, f~iL⊆L.

(ii) Modulo q one has, for all 0≤j≤a, 0≤k≤b, f~i(vj⊗wk)={vj+1⊗wkif a−j>k,vj⊗wk+1if a−j≤k, and e~i(vj⊗wk)={vj−1⊗wkif a−j≥k,vj⊗wk−1if a−j<k, where terms leaving the divided-basis ranges are 0. In particular f~ib=b′ if and only if b=e~ib′ for residues b,b′ of the product basis (the partial-inverse property).

(iii) The nonzero residue strings are the chains (0,t),(1,t),…,(a−t,t),(a−t,t+1),…,(a−t,b), 0≤t≤min⁡(a,b), and they partition the rectangle 0≤j≤a, 0≤k≤b.

This is a finite, choice-free calculation, independent of the grand loop and of global integral freeness.

Facts & Assumptions

Given: The index i, z=qi, nonnegative integers a,b, the rank-one modules V(a),V(b) with divided bases, and the tensor product V(a)⊗V(b) with the coproduct of the statement.

[F1]

V(a) has basis v0,…,va with Kivj=za−2jvj, Fivj=[j+1]zvj+1, Eivj=[a−j+1]zvj−1, and divided powers act by Fi(m)vj=(j+mm)zvj+m, Ei(m)vj=(a−j+mm)zvj−m (Divided-power commutation and the simple Uqi(sl2) string modules, parts (i)-(iii)); the same holds for V(b) with basis wk=Fi(k)w0.

[F2]

ΔEi=Ei⊗Ki−1+1⊗Ei and ΔFi=Fi⊗1+Ki⊗Fi define the Hopf coproduct, so the tensor product is a module with ΔEi,ΔFi nilpotent and Ki diagonalisable with the sum of the two weights (The Drinfeld–Jimbo formulas define a Hopf algebra).

[F3]

On each V(a) there is a symmetric bilinear σ-contravariant form Ba, normalized by Ba(v0,v0)=1, with the divided-string norms Ba(Fi(r)v0,Fi(r)v0)=zr(a−r)(ar)z=:d(a,r) for 0≤r≤a, and Ba(Fi(n)h,Fi(n)h)=d(m,n)Ba(h,h) for every highest vector h of highest weight m (Cartan projection constructs the Verma contravariant form and identifies its radical).

[F4]

ord⁡z[m]z=1−m for m≥1, and ord⁡z(NR)z=−R(N−R) with leading coefficient 1 for 0≤R≤N; elements of Q(q) of nonnegative order lie in A0, and d(N,R)=zR(N−R)(NR)z lies in 1+qA0, hence is a unit of A0 (Quantum integers, factorials, Gaussian binomials and divided powers at qi, The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality, The local ring A0 of rational functions regular at q=0).

[F5]

Every element of the tensor product has a unique admissible i-string decomposition, and the Kashiwara operators e~i,f~i act on the string of a highest vector h of length A by e~iFi(n)h=Fi(n−1)h and f~iFi(n)h=Fi(n+1)h, with Fi(−1)h=Fi(A+1)h=0; M=⨁ of its string spaces (Uniqueness of the i-string decomposition of an integrable module).

[F6]

Define the symmetric bilinear product form B(x⊗y,x′⊗y′):=Ba(x,x′)Bb(y,y′). The single-factor forms of [F3] (Cartan projection constructs the Verma contravariant form and identifies its radical) make the product basis orthogonal with diagonal Gram entries d(a,j)d(b,k). Its tensor contravariance is established locally in step 1.1 from the generator values σ(Ki)=Ki, σ(Ei)=zFiKi−1, σ(Fi)=z−1KiEi and the coproduct [F2] (The Drinfeld–Jimbo formulas define a Hopf algebra); it is not asserted by the single-module Cartan-projection lemma.

Proof

technique · direct. Construct the rank-one highest vectors of the tensor product by an explicit recurrence, use the $\mathbb Q$ positivity of the residue form to identify the tensor lattice, compute the residues of the divided strings and read off the crystal rule; all steps are finite and choice-free
1.1F1F2F3algebra

Tensor contravariance and divided coproduct. Since Δ is an algebra map, Δ(σ(Ei))=zΔ(Fi)Δ(Ki−1)=zFiKi−1⊗Ki−1+1⊗zFiKi−1=(σ⊗σ)Δ(Ei), and Δ(σ(Fi))=z−1Δ(Ki)Δ(Ei)=z−1KiEi⊗1+z−1Ki⊗KiEi=(σ⊗σ)Δ(Fi); the equality for Ki±1 is immediate. Both Δσ and (σ⊗σ)Δ reverse products, so equality on generators proves equality on the rank-one algebra. Factor contravariance then gives B(Δ(X)(x⊗y),x′⊗y′)=B(x⊗y,(σ⊗σ)Δ(X)(x′⊗y′))=B(x⊗y,Δ(σ(X))(x′⊗y′)) for all X; extend by bilinearity to all tensor vectors. This proves the tensor contravariance of the product form. From ΔFi=Fi⊗1+Ki⊗Fi and the q-commutation (Ki⊗Fi)(Fi⊗1)=z−2(Fi⊗1)(Ki⊗Fi), expanding the n-th power gives ΔFi(n)=∑s=0nz−s(n−s)Fi(n−s)Kis⊗Fi(s): the coefficient of (Fi⊗1)n−s(Ki⊗Fi)s in (ΔFi)n is z−s(n−s)(ns)z, and division by [n]z! cancels the Gaussian binomials as [n]z!=(ns)z[s]z![n−s]z!.

1.2F1F2algebra

The highest vectors. For 0≤t≤min⁡(a,b) define c0=1 and cl+1=−clzb−2t+2l+2[b−t+l+1]z[a−l]z for 0≤l<t; all denominators are nonzero since l<t≤a, and set ht:=∑l=0tcl vl⊗wt−l. Substituting ΔEi and comparing the coefficient of vl−1⊗wt−l for 1≤l≤t gives cl[a−l+1]zz2(t−l)−b+cl−1[b−t+l]z, which is zero by the recurrence; the coefficients of v−1⊗wt and vt⊗w−1 vanish because those basis vectors do not exist. Hence ΔEiht=0, and ht has weight a+b−2t since Ki acts on vl⊗wt−l by za−2lzb−2(t−l)=za+b−2t.

1.3F4F6algebra

The norm criterion. For x=∑j,kαj,kvj⊗wk one has B(x,x)=∑j,kαj,k2d(a,j)d(b,k), so x∈L implies B(x,x)∈A0 because d(a,j)d(b,k)∈A0; conversely, if B(x,x)∈A0 but x∉L, take the minimal N≥1 with qNx∈L and let x‾≠0 be its residue in L/qL. Then B(qNx,qNx)=q2NB(x,x)∈qA0, while on residues the form B‾ is diagonal with all entries congruent to 1 modulo q, so B‾(x‾,x‾) is the sum of the squares of the rational residues of the coordinates of x‾, a positive rational, contradicting B‾(x‾,x‾)=0. Hence L={x:B(x,x)∈A0}.

2.1F4F6step 1.2

Valuations. By [F4], ord⁡zcl+1−ord⁡zcl=(b−2t+2l+2)+(1−(b−t+l+1))−(1−(a−l))=a−t+1 for every l, so the orders telescope to ord⁡zcl=l(a−t+1)>0 for l≥1, with ord⁡zc0=0; hence cl∈A0, c0=1 and cl∈qA0 for l>0. Therefore ht≡v0⊗wt(modqL), and by [F6] B(ht,ht)=∑lcl2d(a,l)d(b,t−l)≡d(b,t)≡1(modq), since d(a,l)∈1+qA0 and the l>0 terms lie in qA0.

2.2F1step 1.1step 1.2

Coefficients. Put ut,n:=Fi(n)ht and write ut,n=∑j,kγj,k vj⊗wk; by weight, γj,k=0 unless j+k=t+n. Applying ΔFi(n)=∑sz−s(n−s)Fi(n−s)Kis⊗Fi(s) of step 1.1 to ht and using [F1] gives the finite sum γj,k=∑lcl z−s(n−s)+s(a−2l)(jl)z(kt−l)z with s=k−t+l, over the integers l with 0≤l≤min⁡(t,j) and 0≤s≤n (the symmetry of the Gaussian binomials rewrites the divided-power coefficients).

3.1F3F4F5step 2.1step 1.3

The tensored strings lie in L. Let A:=a+b−2t and ut,n:=Fi(n)ht for 0≤n≤A. By F5, Fi(n)ht≠0 for 0≤n≤A; the span of these A+1 vectors is generated by ht and stable under Ei,Fi,Ki, so it is the simple rank-one module of highest weight A by [F1], and the form restricted to it is a nonzero contravariant form, hence by [F3] a multiple of the normalized form, with factor B(ht,ht); hence B(ut,n,ut,n)=d(A,n)B(ht,ht)∈A0 by step 2.1 and [F4]. The norm criterion of step 1.3 therefore gives ut,n∈L.

4.1step 3.1step 2.1step 2.2F4algebra

Integrality of the residue. Every summand in step 2.2 is an integer Laurent series in z: its factors cl, [m]z and (NR)z are quotients of Laurent polynomials whose denominator factors [m]z have leading coefficient ±1, so their inverses are Laurent series with integer coefficients with finitely many negative terms. Since ut,n∈L by step 3.1, each γj,k lies in A0; an element of A0 that is also an integer Laurent series has an integer residue, and the sum of the squares of the residues is 1 because B(ut,n,ut,n)≡1(modq) by step 2.1 and [F4], while the Gram entries are congruent to 1.

5.1F4step 2.2step 4.1

Distinguished coefficient. If n≤a−t, take (j,k)=(n,t). The summand with l=0 is c0z0(n0)z(tt)z=1; a summand with l≥1 has s=l and valuation l(a−t+1)+l(a−2l)−l(n−l)−l(t−l)−l(n−l)=l(2a−2n−2t+1)+l2≥l+l2>0 by the additivity of ord⁡z in [F4] (here a−t−n≥0). Hence γn,t≡1(modq).

5.2F4step 2.2step 4.1algebra

Second distinguished coefficient. If n≥a−t, take (j,k)=(a−t, n−a+2t). The summand with l=0 is zt(n−a+t)(n−a+2tt)z, of valuation t(n−a+t)−t(n−a+t)=0 and leading coefficient 1 by [F4]; a summand with l≥1 and (jl)z≠0, so l≤a−t, has s=n−a+t+l and valuation l(a−t+1)−s(n−s)+s(a−2l)−l(j−l)−(t−l)(k−t+l)=l+l2>0, where the exponent identity uses k−t+l=s. Hence γa−t, n−a+2t≡1(modq).

6.1step 4.1step 5.1step 5.2

The residues are the chain positions. By steps 5.1-5.2 the distinguished coefficient of ut,n has residue 1. Since all residues are integers and their squares sum to 1 by step 4.1, every other coefficient has residue 0. Hence the residue of ut,n is the single basis element vj⊗wk with (j,k)=(n,t) when n≤a−t and (j,k)=(a−t,n−a+2t) when n≥a−t.

7.1step 6.1algebra

Partition into chains. Fixing t and letting n run over 0,…,a+b−2t, the positions of step 6.1 are (0,t),(1,t),…,(a−t,t),(a−t,t+1),…,(a−t,b). These are the chains of the statement, and they partition the rectangle 0≤j≤a, 0≤k≤b: a cell (j,k) lies on the chain of t=min⁡(k,a−j), and then it is the position n=j if k=t and n=a−t+k−t if k>t (then j=a−t), which determines the position uniquely. The total number of vectors ut,n is ∑t=0min⁡(a,b)(a+b−2t+1)=(a+1)(b+1).

8.1step 3.1step 6.1step 7.1algebra

A0-basis. The matrix expressing the family {ut,n} in the product basis reduces modulo q to a permutation matrix by steps 6.1-7.1, hence has determinant congruent to ±1 modulo q, a unit of A0; the adjugate identity over A0 makes the matrix invertible over A0. Since {ut,n}⊆L by step 3.1 and both families have (a+1)(b+1) members, {ut,n} is an A0-basis of L.

9.1step 7.1step 8.1F5algebra∎

The crystal rule. By [F5] the operators act on the strings by e~iFi(n)ht=Fi(n−1)ht and f~iFi(n)ht=Fi(n+1)ht, with the endpoint terms zero; since the strings form the A0-basis of L by step 8.1, both operators preserve L and shift the residues along the chains of step 7.1. Reading off which tensor factor changes gives the two displayed rules: along (n,t)↦(n+1,t) the first factor moves exactly when a−(n)> t, that is a−j>k, and along (a−t,k)↦(a−t,k+1) the second factor moves, which is the case a−j≤k; the e~i-rule is read in the reverse direction, where the first factor moves exactly when a−j≥k. Terms leaving the ranges are 0. For residues b=vj⊗wk and b′: if a−j>k then f~ib=vj+1⊗wk and a−(j+1)≥k, so e~ib′=b; if a−j≤k then f~ib=vj⊗wk+1 and a−j<k+1, so e~ib′=b; the converse implications follow by the same two evaluations of the displayed rules. Hence f~ib=b′ if and only if b=e~ib′. No choice is used, and neither the grand loop nor any freeness over Z[q,q−1] enters.

Depends on

Used by

Dependency tree · two levels

46 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