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

The i-string decomposition of the negative half

Statement

Let Uq− be the negative half of the Drinfeld–Jimbo algebra with its skew derivations ei′,ei′′:Uq−→Uq− (Kashiwara's skew derivations ei′ and ei′′ on the negative half, Positive, negative and toral quantum subalgebras and their root gradings), fix i∈I, and write fi(n)=Fin/[n]i! for the divided powers (Quantum integers, factorials, Gaussian binomials and divided powers at qi). Then:

(i) ei′ is locally nilpotent on Uq−, and the endomorphism Pi:=∑m≥0(−1)mqi−m(m−1)/2Fi(m)ei′ m∈End⁡Q(q)(Uq−) is well defined (each sum is finite on each element) and is the projection onto Ker⁡ei′ along fiUq−. In particular ei′Pi=0, PiFi=0, Pi2=Pi, Piu=u for u∈Ker⁡ei′, and Uq−=Ker⁡ei′⊕fiUq−.

(ii) Every u∈Uq− has a unique i-string decomposition u=∑n≥0fi(n)un,un∈Ker⁡ei′,un=0 for n≫0, and the components are given by un=qin(n−1)/2Piei′ nu.

(iii) The Kashiwara operators on the negative half, defined on the string decomposition by e~iu:=∑n≥1fi(n−1)un,f~iu:=∑n≥0fi(n+1)un, are Q(q)-linear endomorphisms of Uq− with e~if~i=id⁡Uq−; e~iu=0 if and only if u∈Ker⁡ei′; f~i is injective and f~i(1)=Fi. Both operators preserve the root grading and shift its degree by ∓αi, that is e~i(Uq−[−ν])⊆Uq−[−ν+αi] and f~i(Uq−[−ν])⊆Uq−[−ν−αi].

No choice principle is used. Here ei′ n denotes the ordinary n-fold power of the derivation, not its divided power. The same projector and every string coefficient preserve the Z[q,q−1] divided-power lattice UA− (The Lusztig divided-power integral form UA), as proved by the integral skew-string supplier; this does not assert that lattice's freeness.

Facts & Assumptions

Given: The negative half Uq−, the skew derivations ei′,ei′′, a fixed i, and the divided powers fi(n)=Fin/[n]i!.

[F1]

Uq−=⨁ν∈Q+Uq−[−ν] is graded by the positive root lattice, with deg⁡Fj=−αj and Uq−[0]=Q(q)⋅1; the grading is the restriction of the root grading of Uq(g) (Positive, negative and toral quantum subalgebras and their root gradings).

[F2]

The maps ei′,ei′′:Uq−→Uq− are Q(q)-linear, vanish on 1, satisfy ei′(Fj)=δij, the Leibniz rule ei′(xy)=ei′(x)y+qi⟨wt(x),hi⟩xei′(y) on homogeneous x of actual weight wt(x), and similarly for ei′′ with the opposite twist; they satisfy ei′Fj=qi−aijFjei′+δij and decrease positive height by one, so ei′(Uq−[−ν])⊆Uq−[−ν+αi] (zero when ν−αi∉Q+) and ei′ is locally nilpotent (Kashiwara's skew derivations ei′ and ei′′ on the negative half).

[F3]

[m]i=(qim−qi−m)/(qi−qi−1)∈Q(q)× for m≥1, fi(m)=Fim/[m]i!, and fi(m)fi(n)=(m+nm)ifi(m+n) with Fifi(n−1)=[n]ifi(n); all displayed scalars are nonzero (Quantum integers, factorials, Gaussian binomials and divided powers at qi).

[F4]

Gaussian identity: for N≥0, ∑r=0N(−1)rqi−r(N−1)(Nr)i equals 1 for N=0 and 0 for N≥1; the Gaussian quotient is invariant under qi↦qi−1 and the identity is the inversion of the Gauss product formula (The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality, parts (iii)-(iv)).

[F5]

Integral skew-string supplier: the operator Pi of (i) is finite on each vector and projects Uq− onto Ker⁡ei′ along FiUq−; every x∈UA− has a unique finite expansion x=∑nFi(n)xn with ei′xn=0 and xn=qin(n−1)/2Pi(ei′)nx∈UA−; the projector and coefficients preserve UA−, with no global basis or freeness assumed (Integral skew-string coefficients on the divided-power negative half).

Proof

technique · direct. The projector and its finite-sum properties are those of the integral skew-string supplier [F5]; the negative-half string decomposition, the operator identities and the grading shifts are then read off string by string, with the Gaussian identity [F4] supplying the only arithmetic input
1.1F2F3algebra

The q-boson relation. By [F2] with j=i and aii=2, ei′Fi=qi−2Fiei′+1; applying the Leibniz rule to Fir and summing the geometric series gives ei′(Fir)=qi−(r−1)[r]iFir−1, and dividing by [r]i! yields ei′Fi(r)=qi−(r−1)Fi(r−1)+qi−2rFi(r)ei′ for r≥1.

2.1step 1.1F3algebra

Iterated deletion. If ei′u=0, then induction on n using step 1.1 gives (ei′)nFi(m)u=qi−nm+n(n+1)/2Fi(m−n)u for 0≤n≤m, while (ei′)nFi(m)u=(ei′)n−mu=0 for n>m.

2.2F1F2step 1.1

Termination. By [F2] the derivation ei′ lowers positive height by one, so for homogeneous x∈Uq−[−ν] one has (ei′)nx=0 whenever n>∑jνj=ht⁡(ν); hence on each x only finitely many terms of the sum defining Pi are nonzero, and Pi is a well-defined Q(q)-linear endomorphism of Uq−.

3.1F3F4step 1.1step 2.1step 2.2F5

The projection. For u∈Ker⁡ei′ and M≥0, steps 2.1 and [F3] give PiFi(M)u=∑m=0M(−1)mqi−m(m−1)/2qi−mM+m(m+1)/2(Mm)iFi(M)u=(∑m=0M(−1)mqi−m(M−1)(Mm)i)Fi(M)u, which by the Gaussian identity [F4] equals u for M=0 and 0 for M≥1. Hence PiFi=0, Pi fixes Ker⁡ei′, and Pi kills fiUq−; moreover ei′Pi=0 by the cancellation of consecutive terms in ei′Fi(m)ei′ m using step 1.1, so Pi2=Pi and Pi is the projection onto Ker⁡ei′ along fiUq−, with Uq−=Ker⁡ei′⊕fiUq− because u=Piu+(u−Piu) lies in the two subspaces.

4.1F1F3F5step 2.2step 3.1algebra

Existence of the string decomposition. The algebra Uq− is spanned over Q(q) by finite words in the Fj, and each such word belongs to UA− because Fj=Fj(1). Thus write u=∑a=1tcaxa with ca∈Q(q) and xa∈UA−. Apply [F5] to each xa and use the Q(q)-linearity of Pi and ei′ to obtain u=∑nfi(n)un, where un:=∑aca(xa)n=qin(n−1)/2Piei′ nu∈Ker⁡ei′. This sum is finite by step 2.2. The field-valued decomposition therefore follows from the integral one without assuming an integral basis or freeness.

5.1step 2.1step 3.1step 4.1

Uniqueness and the coefficient formula. Suppose u=∑mfi(m)vm with vm∈Ker⁡ei′ and vm=0 for m large. Applying ei′ n and then Pi for fixed n: by step 2.1, ei′ nfi(m)vm=qi−nm+n(n+1)/2fi(m−n)vm for m≥n and 0 for m<n, and by step 3.1, Pifi(m−n)vm=0 for m>n while Pivn=vn; hence Piei′ nu=qi−n(n−1)/2vn, that is vn=qin(n−1)/2Piei′ nu=un. Thus the components of step 4.1 are determined by u, giving uniqueness and the displayed coefficient formula.

6.1step 4.1step 5.1

The Kashiwara operators. Given the unique decomposition u=∑nfi(n)un of steps 4.1-5.1, the prescriptions e~iu:=∑n≥1fi(n−1)un and f~iu:=∑n≥0fi(n+1)un are well-defined Q(q)-linear maps by uniqueness; shifting the index shows e~if~iu=∑n≥0fi(n)un=u, so e~if~i=idUq−.

7.1step 4.1step 5.1step 6.1

Kernel, injectivity and value at 1. For u=∑nfi(n)un one has e~iu=0 exactly when un=0 for every n≥1, that is u=u0∈Ker⁡ei′; hence ker⁡e~i=Ker⁡ei′. If f~iu=0, then ∑nfi(n+1)un=0 is a decomposition with all top coefficients un in Ker⁡ei′, so uniqueness in step 5.1 forces un=0 for all n, that is u=0; hence f~i is injective. Finally 1∈Ker⁡ei′ has decomposition 1=fi(0)⋅1, so f~i(1)=fi(1)=Fi.

7.2F1step 6.1

Root grading. Let u∈Uq−[−ν] be homogeneous. Since fi(n) raises the degree by −nαi, the components un of steps 4.1-5.1 may be taken homogeneous of degree −ν+nαi (decompose u and each un into finitely many homogeneous pieces and compare degrees), so fi(n−1)un has degree −ν+αi and fi(n+1)un has degree −ν−αi; hence e~i(Uq−[−ν])⊆Uq−[−ν+αi] and f~i(Uq−[−ν])⊆Uq−[−ν−αi].

8.1F5step 6.1∎

Integrality and choice. By [F5] the projector Pi and every coefficient un=qin(n−1)/2Piei′ nu preserve the divided-power lattice UA−, and the shifts of step 6.1 preserve it as well; no freeness of UA− is asserted. All constructions used unique decompositions, finite sums and the explicit operator Pi; no choice principle is used.

Depends on

Used by

Dependency tree · two levels

16 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