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.

Integral skew-string coefficients on the divided-power negative half

Statement

Let Uq− be the negative half of the Drinfeld–Jimbo algebra with its Kashiwara skew derivations ei′,ei′′ (Kashiwara's skew derivations ei′ and ei′′ on the negative half), let A=Z[q,q−1] and let UA− be the divided-power half generated by the Fi(r) (The Lusztig divided-power integral form UA). Then:

(i) ei′ preserves UA−: ei′(UA−)⊆UA−.

(ii) Define, for x∈Uq−, Pix:=∑n≥0(−1)nqi−n(n−1)/2 Fi(n)(ei′)nx, the sum being finite on each x because ei′ is locally nilpotent, and the powers (ei′)n being ordinary, not divided, powers of the derivation. Then Pi is a well-defined Q(q)-linear map with ei′Pi=0 that fixes ker⁡ei′ pointwise and annihilates FiUq−; hence Uq−=ker⁡ei′⊕FiUq− and Pi is the projection onto ker⁡ei′ along FiUq−.

(iii) Every x∈UA− has a unique finite expansion x=∑n≥0Fi(n)xn,ei′xn=0, with xn=qin(n−1)/2Pi(ei′)nx∈UA− for every n; the sum is finite because (ei′)nx=0 for large n. Consequently the string operators e~i(∑nFi(n)xn):=∑n≥1Fi(n−1)xn and f~i(∑nFi(n)xn):=∑n≥0Fi(n+1)xn preserve UA−.

No global A-basis and no freeness of UA− over A is assumed or asserted.

Facts & Assumptions

Given: The negative half Uq−=⨁ν∈Q+Uq−[−ν], the maps ei′, ei′′ of Kashiwara's skew derivations ei′ and ei′′ on the negative half, the divided powers x(m)=xm/[m]i!, and the A-algebra UA−.

[F1]

ei′(Fj)=δij, ei′ is Q(q)-linear, and ei′ satisfies the twisted Leibniz rule ei′(xy)=ei′(x)y+qi⟨wt⁡(x),hi⟩xei′(y) for homogeneous x, with the operator identity ei′Fj=qi−aijFjei′+δij; in particular ei′(Fiy)=qi−2Fiei′(y)+y and ei′(Fjy)=qi−aijFjei′(y) for j≠i (Kashiwara's skew derivations ei′ and ei′′ on the negative half).

[F2]

ei′ is locally nilpotent: for every homogeneous x of degree −ν and every k>ht⁡(ν) one has (ei′)kx=0 (Kashiwara's skew derivations ei′ and ei′′ on the negative half (d)).

[F3]

Every word in the Fj of degree −ν has exactly νi letters Fi; UA− consists of the finite A-linear combinations of the products Fj1(r1)⋯Fjm(rm) of divided powers, and these are Q(q)-linear combinations of words (The Lusztig divided-power integral form UA, Positive, negative and toral quantum subalgebras and their root gradings).

[F4]

Divided-power multiplication: Fi(n)Fi(m)=Fin+m[n]i![m]i!=(n+mn)iFi(n+m), and the Gaussian coefficients are Laurent polynomials in qi with integer coefficients (Quantum integers, factorials, Gaussian binomials and divided powers at qi, The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality (iv)).

[F5]

Gauss product identity and its inversion: for N≥0, ∏j=0N−1(1+qi2jz)=∑r=0Nqir(N−1)(Nr)izr; hence ∑r=0N(−1)rqir(N−1)(Nr)i=0 for N≥1, and applying the field involution qi↦qi−1 (which fixes every Gaussian coefficient) gives ∑r=0N(−1)rqi−r(N−1)(Nr)i=0 for N≥1, while the sum equals 1 for N=0 (The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality (iii), Quantum integers, factorials, Gaussian binomials and divided powers at qi).

Verification

Proof technique: compute ei′ and its powers on divided-power words, use the resulting explicit q-binomial sum for the projector, and read the decomposition and the integrality of its coefficients off that computation.

1.1givenF1F4algebra

The deletion rule. From ei′Fi=qi−2Fiei′+1 and ei′(1)=0, induction on r≥1 gives ei′(Fir)=(∑s=0r−1qi−2s)Fir−1=qi−(r−1)[r]iFir−1. Dividing by the nonzero [r]i! yields ei′(Fi(r))=qi−(r−1)Fi(r−1). For j≠i, the relation ei′Fj=qi−aijFjei′ and ei′(1)=0 give ei′(Fjr)=0, hence ei′(Fj(r))=0.

2.1step 1.1F1F3algebra

ei′ preserves UA−: by [F3] it suffices to check a divided-power word w=Fj1(r1)⋯Fjm(rm), by induction on m using the twisted Leibniz rule of [F1] and the deletion rule of step 1.1: ei′(w)=ei′(Fj1(r1))w′+qi⟨wt⁡(Fj1(r1)),hi⟩Fj1(r1)ei′(w′), where w′ is the restricted word, the first factor is 0 or qi−(r1−1)Fi(r1−1)∈UA− by step 1.1, the scalar qi⟨−r1αj1,hi⟩=qi−r1aij1∈A, and ei′(w′)∈UA− by induction; products of divided powers lie in UA−. By [F1] linearity extends this to all of UA−.

2.2step 1.1F1algebra

Powers of the derivation on a string: if u∈ker⁡ei′ then for 0≤n≤m, (ei′)nFi(m)u=qi−nm+n(n+1)/2Fi(m−n)u. For n=0 this is clear; for the induction step, ei′(Fi(m−n)u)=ei′(Fi(m−n))u+qi−2(m−n)Fi(m−n)ei′(u)=qi−(m−n−1)Fi(m−n−1)u, where the second summand vanishes because ei′u=0; multiplying by qi−nm+n(n+1)/2 gives the exponent −(n+1)m+(n+1)(n+2)/2 as required.

3.1step 2.2givenalgebra

The projector: Pi is well defined by [F2], and Q(q)-linear. Consecutive terms cancel in ei′Pi: applying ei′ to the n-th term gives (−1)nqi−n(n−1)/2[ei′(Fi(n))(ei′)n+qi−2nFi(n)(ei′)n+1]=(−1)nqi−n(n−1)/2[qi−(n−1)Fi(n−1)(ei′)n+qi−2nFi(n)(ei′)n+1] by steps 1.1, 2.2, and the contribution of the second part of the n-th term cancels the first part of the (n+1)-st term because −n(n−1)/2−2n=−n(n+1)/2−(n); the n=0 contribution of the second part is (ei′)1 and equals the first part of the n=1 term, so ei′Pi=0. If ei′x=0 then (ei′)nx=0 for n≥1, so Pix=Fi(0)(ei′)0x=x: Pi fixes ker⁡ei′ pointwise.

3.2step 2.2F4F5algebra

Pi annihilates Fiker⁡ei′: for u∈ker⁡ei′ and m≥1, step 2.2 gives (ei′)n(Fi(m)u)=qi−nm+n(n+1)/2Fi(m−n)u for n≤m, and (ei′)n(Fi(m)u)=qi−n(m−1)Fi(m−1)(ei′u)=0 for n>m (the surviving term of the Leibniz expansion at the first step where the derivative reaches u); hence Pi(Fi(m)u)=∑n=0m(−1)nqi−n(n−1)/2Fi(n)qi−nm+n(n+1)/2Fi(m−n)u=∑n=0m(−1)nqi−nm+n(mn)iFi(m)u=[∑n=0m(−1)nqi−n(m−1)(mn)i]Fi(m)u, using [F4] for Fi(n)Fi(m−n). By [F5] the bracket is 1 for m=0 and 0 for m≥1; hence Pi fixes ker⁡ei′ and annihilates Fi(m)ker⁡ei′ for every m≥1.

4.1step 2.2step 3.1step 3.2F2algebra

Decomposition and uniqueness: for x∈Uq− let m be maximal with (ei′)mx≠0 (finite by [F2]) or m=0 if ei′x=0, and put xm:=qim(m−1)/2Pi(ei′)mx; then ei′xm=qim(m−1)/2ei′Pi(ei′)mx=0 by step 3.1, and x′:=x−Fi(m)xm satisfies (ei′)mx′=(ei′)mx−qi−m(m−1)/2xm=0 by step 2.2 and step 3.1, so ord⁡(x′)≤m−1. Descending induction on m therefore writes x=∑nFi(n)xn with ei′xn=0 and xn=qin(n−1)/2Pi(ei′)nx: at each stage the coefficient of the remainder agrees with the claimed formula because Pi annihilates the subtracted strings Fi(m−n)xm by step 3.2, so Pi(ei′)nx′=Pi(ei′)nx for n<m. If also x=∑nFi(n)yn with ei′yn=0, subtract the two finite expansions and put zn:=xn−yn. If some zn is nonzero, let N be its largest index. Applying (ei′)N to 0=∑nFi(n)zn gives 0=qi−N(N−1)/2zN by step 2.2, a contradiction. Thus every zn=0, proving uniqueness.

5.1step 2.1step 3.1step 3.2step 4.1F2F3algebra∎

Integrality and conclusion: each xn=qin(n−1)/2Pi(ei′)nx lies in UA−, because ei′ preserves UA− by step 2.1, every (ei′)nx is therefore in UA−, the coefficients qi±m(m−1)/2 and (−1)m lie in A, and each Fi(m) is a generator of UA−; hence the finite sum Pi( ⋅ ) of the definition lies in UA− on UA−. Consequently every string coefficient xn of an x∈UA− is integral. For the projection claim, apply step 4.1 to the expansion of an arbitrary y: Fiy=∑n≥1[n]iFi(n)yn−1 decomposes with all string coefficients in ker⁡ei′ and zero n=0 coefficient, so Pi(Fiy)=0 by the formula; hence Uq−=ker⁡ei′⊕FiUq− with Pi the projection along FiUq−, and x0=Pix∈UA− whenever x∈UA−. Finally the string operators of (iii) are well defined by the uniqueness of the expansion, and they preserve UA− because they only shift the divided-power labels n↦n±1 of the integral coefficients xn∈UA−. No global A-basis and no freeness of UA− was used anywhere.

Depends on

Used by

Dependency tree · two levels

15 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