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.

Separation of the negative half by iterated skew derivations

Statement

Let (I,A,D,P,P∨,q) be a finite symmetrizable Cartan datum with aii=2 for all i (Symmetrizable Cartan data for quantum groups), let Uq−=⨁ν∈Q+Uq−[−ν] be the negative half of the Drinfeld–Jimbo algebra Uq(g) over Q(q) (The Drinfeld-Jimbo quantized enveloping algebra by generators and relations, Positive, negative and toral quantum subalgebras and their root gradings), and let ei′,ei′′ be the skew derivations of Kashiwara's skew derivations ei′ and ei′′ on the negative half.

(i) One step. If x∈Uq−[−ν] with ν≠0 satisfies ei′(x)=0 for all i∈I, then x=0.

(ii) Iterated separation. For every 0≠x∈Uq−[−ν] there is a sequence i1,…,ik∈I with ν=αi1+⋯+αik (the multiset is uniquely determined by ν, because the simple roots freely generate Q, and k=ht⁡(ν)) such that eik′⋯ei2′ei1′(x)≠0. Here the composite is read with the rightmost factor applied first, so the first chosen derivation ei1′ acts first; equivalently, the common kernel, on Uq−[−ν], of all composites ei1′⋯eik′ over all such sequences is zero.

The same statements hold with ei′′ in place of ei′. This separation property is used by the crystal development and the categorification pairing.

Facts & Assumptions

Given: The negative half Uq− with its root grading and its skew derivations ei′,ei′′ (Kashiwara's skew derivations ei′ and ei′′ on the negative half), the simple roots and their symmetric Cartan form, and the generic halves of the published generic-half theorem with parameter z.

[F1]

Every element of Uq− is a finite Q(q)-linear combination of words Fj1⋯Fjm; the word Fj1⋯Fjm lies in Uq−[−ν] for ν=αj1+⋯+αjm, every word of that degree has exactly ht⁡(ν)=m letters, and the simple roots freely generate Q, so the multiset of indices of ν is unique (Triangular decomposition of a quantized enveloping algebra, Symmetrizable Cartan data for quantum groups).

[F2]

The derivations are Q(q)-linear, vanish on 1, satisfy ei′(Fj)=ei′′(Fj)=δij, obey ei′(Fjy)=qi−aijFjei′(y)+δijy and ei′′(Fjy)=qiaijFjei′′(y)+δijy for all y∈Uq−, and lower the height by one: ei′(Uq−[−ν]) and ei′′(Uq−[−ν]) lie in Uq[−(ν−αi)], the target being 0 when ν−αi∉Q+. Iterating the commutation relation gives the word deletion formula ei′(Fj1⋯Fjm)=∑t:jt=iqi−aij1−⋯−aijt−1Fj1⋯Fjt^⋯Fjm, where the hat omits one letter, and qi−aijs=q−⟨αjs,αi⟩ because qi=qdi and diaij=djaji (Kashiwara's skew derivations ei′ and ei′′ on the negative half, Symmetrizable Cartan data for quantum groups).

[F3]

ψ is the involutive semilinear algebra automorphism with ψ(q)=q−1, ψ(Ei)=Ei, ψ(Fi)=Fi, ψ(Kh)=K−h; it preserves Uq− and its grading, and ei′′=ψei′ψ (Kashiwara's skew derivations ei′ and ei′′ on the negative half (e)).

[F4]

The published generic-half theorem (ii) provides algebras H+, H− over Q(z), presented by the separate symmetric quantum Serre relations with zi=zdi. They are graded braided Hopf algebras: generators are primitive, the counit kills positive height, and the tensor square carries the braided product (u⊗v)(u′⊗v′)=z−⟨deg⁡u′,deg⁡v⟩uu′⊗vv′ with negative degrees for H−. It provides a nondegenerate pairing ⟨⋅,⋅⟩:H+×H−→Q(z), zero on unequal opposite degrees, with ⟨ei,fj⟩=δij/(zi−zi−1), ⟨1,1⟩=1 and ⟨1,y⟩=ε(y); opposite graded components are dual, and both braided Hopf adjunctions ⟨x,yy′⟩=∑⟨x(1),y⟩⟨x(2),y′⟩ and ⟨xx′,y⟩=∑⟨x,y(1)⟩⟨x′,y(2)⟩ hold. The theorem assumes AC, used only in its formal embedding argument (Generic quantum Serre halves have classical PBW ranks and a nondegenerate Hopf pairing, The Axiom of Choice).

[F5]

The defining Serre relations of the Drinfeld–Jimbo negative half Serreij− are the separate symmetric quantum Serre relations of [F4] at z=q, and H+ is presented by the same relations with ei in place of fi; since q is transcendental, z↦q identifies Q(z) with Q(q). Hence there are algebra isomorphisms φ+:Uq−→H+ with φ+(Fi)=ei and φ−:Uq−→H− with φ−(Fi)=fi (The Drinfeld-Jimbo quantized enveloping algebra by generators and relations, Generic quantum Serre halves have classical PBW ranks and a nondegenerate Hopf pairing, Triangular decomposition of a quantized enveloping algebra).

[F6]

qi−qi−1≠0 in Q(q) and zi−zi−1≠0 in Q(z) (Kashiwara's skew derivations ei′ and ei′′ on the negative half [F6]).

Verification

technique · transport the published generic braided pairing to the actual Serre quotient by the degree-multiplicative normalization $c_\nu=\prod_i(q_i-q_i^{-1})^{n_i}$, verify the $e_i'$-adjunction by an explicit braided-coproduct computation, derive the matching-permutation word formula and symmetry from it, and then separate iteratively by peeling words
1.1F4F5F6algebra

The normalized pairing on the half. Apply the substitution z↦q of [F5] to the pairing of [F4], getting a nondegenerate Q(q)-valued pairing ⟨⋅,⋅⟩:H+×H−→Q(q), still zero on unequal opposite degrees, with ⟨ei,fj⟩=δij/(qi−qi−1), ⟨1,1⟩=1, ⟨1,y⟩=ε(y), dual opposite graded components, and the two adjunctions of [F4]. Define the degree character c:Q+→Q(q)× by cν=∏i(qi−qi−1)ni for ν=∑iniαi, and the rescaled pairing ⟨x,y⟩c:=cν⟨x,y⟩ for x∈H+[ν], y∈H−[−ν], extended by zero on unequal opposite degrees, where H±[±ν] are the graded components of [F4]. Then c is multiplicative because ν↦ni is additive and the two coproduct factors of a homogeneous element have degrees adding to its own; each nonzero term of the adjunctions therefore acquires the scalar cν(1)cν(2)=cν, so ⟨x,yy′⟩c=∑⟨x(1),y⟩c⟨x(2),y′⟩c and ⟨xx′,y⟩c=∑⟨x,y(1)⟩c⟨x′,y(2)⟩c. Moreover ⟨ei,fj⟩c=(qi−qi−1)δij/(qi−qi−1)=δij and ⟨1,1⟩c=1, and ⟨⋅,⋅⟩c is nondegenerate on every pair of opposite graded components because each cν is a nonzero scalar. AC is inherited here from [F4] and used nowhere else in this item; the remaining steps are choice-free.

1.2F4F6algebra

Generators pair only with height one from the left. If u=ab∈H− is a product of two elements of positive degree, then ⟨ei,u⟩=0 for every i. Indeed ei is primitive in H+ [F4], so the first adjunction gives ⟨ei,ab⟩=⟨ei,a⟩⟨1,b⟩+⟨1,a⟩⟨ei,b⟩, and ⟨1,a⟩=ε(a) and ⟨1,b⟩=ε(b) both vanish because a and b have positive degree [F4]. Every homogeneous element of H−[−μ] with ht⁡(μ)≥2 is a linear combination of such products: on the free algebra its defining word splits after the first letter, and the product of the two positive-degree classes is the class of that word, so the class lies in the span of products of two positive-degree elements. Hence ⟨ei,u⟩=0 whenever u∈H−[−μ] and ht⁡(μ)≥2; by the same argument, scaled by cαi≠0, also ⟨ei,u⟩c=0.

1.3step 1.1step 1.2F1F2F4F5algebra

The ei′-adjunction. Define B(P,Q):=⟨φ+(P),φ−(Q)⟩c on Uq−×Uq−, where φ± are the isomorphisms of [F5] and the pairing is extended by zero when the degrees of P and Q differ. Then B is bilinear and homogeneous, and B(1,1)=⟨1,1⟩c=1. We prove B(FkP,Q)=B(P,ek′Q) for all k, P and all Q the class of a word w=Fj1⋯Fjm; since the classes of words span Uq− [F1] and both sides are Q(q)-linear in Q (using [F2] for ek′), this gives the adjunction for all Q. Let y:=φ−(w)=fj1⋯fjm. Because φ− is an algebra homomorphism [F5] and Δ is an algebra map into the braided tensor square with primitive generators [F4], Δ(y)=∑Sγ(S)φ−(wS)⊗φ−(wSc) over all subsets S⊆{1,…,m}, where wS is the subword with letters in S and γ(S)=∏s<t, s∉S, t∈Sq−⟨αjs,αjt⟩ records precisely the braided cross-scalars of the product expansion. The second rescaled adjunction and multiplicativity of φ+ then give B(FkP,w)=∑Sγ(S) ⟨ek,φ−(wS)⟩c ⟨φ+(P),φ−(wSc)⟩c. By step 1.2 the factor ⟨ek,φ−(wS)⟩c vanishes when ∣S∣≥2; it vanishes when ∣S∣=0 because φ−(w∅)=1 and ⟨ek,1⟩=0 [F4]; and when S={t} it equals δjtk⟨ek,fk⟩c=δjtk by [F4] and step 1.1, while for jt≠k it vanishes by the degree support of the pairing. Hence B(FkP,w)=∑t:jt=kq−∑s<t⟨αjs,αk⟩ B(P,w∖t), and the right-hand side is B(P,ek′(w)) by the deletion formula of [F2], because qi−aijs=q−⟨αjs,αi⟩. This proves the adjunction, which is axiom (R) of The Lusztig-Kashiwara bilinear form on the negative half: the recursion; by the uniqueness proved there, B is the normalized Lusztig–Kashiwara form determined by (R), (H) and (N).

1.4step 1.3F2algebra

The matching-permutation formula and symmetry. For words u=Fi1⋯Fik and v=Fj1⋯Fjk′ one has B(u,v)=0 unless k=k′ and the multisets of letters agree, in which case B(Fi1⋯Fik,Fj1⋯Fjk)=∑σq−∑s<t, σ(s)>σ(t)⟨αis,αit⟩, where σ runs over the bijections {1,…,k}→{1,…,k} with jσ(t)=it for all t and the inner sum is over the pairs 1≤s<t≤k with σ(s)>σ(t). The vanishing statement is the homogeneity (H) of step 1.3, and the formula is proved by induction on k: for k=0 both sides equal ε of the argument, giving 1 on the empty word and 0 otherwise; for k≥1, step 1.3 and the deletion formula expand B(Fi1u′,v) as ∑t:jt=i1q−∑s<t⟨αjs,αi1⟩B(u′,v∖t), and for each t the induction hypothesis and the bijection σ↔(σ(1)=t, σ∣{2,…,k}) exhibit the terms with σ(1)=t, the cross-pairs (1,s) with σ(s)<t contributing ∏r<tq−⟨αjr,αi1⟩ because the letters jr with r<t are exactly the letters is with σ(s)<t. Finally, σ↦σ−1 bijects the matching permutations of (u,v) onto those of (v,u), and inversion pairs correspond with the same two letters in the reversed roles while ⟨αis,αit⟩=⟨αit,αis⟩, so each term matches: B is symmetric on words, hence on Uq− by bilinearity.

2.1step 1.3F1algebra

Part (i): one-step separation. Let x∈Uq−[−ν] satisfy ei′(x)=0 for all i, and let w=Fi1⋯Fik be any word of degree ν (then k=ht⁡(ν)≥1). Iterating step 1.3 along the letters of w and using (H) with B(1,z)=ε(z) gives B(w,x)=ε(eik′⋯ei1′(x))=ε(0)=0. Words span the finite-dimensional piece Uq−[−ν] [F1], so B(y,x)=0 for every y∈Uq−[−ν]. The restriction of B to Uq−[−ν] has zero left kernel by the nondegeneracy of step 1.1, so x=0.

3.1step 1.3step 2.1F1algebra

Part (ii): iterated separation. Let 0≠x∈Uq−[−ν]. By the nondegeneracy of step 1.1 there is y with B(y,x)≠0; decomposing y into graded components and using the homogeneity of B, some word w of degree ν satisfies B(w,x)≠0. Write w=Fi1⋯Fik; iterating step 1.3 as in step 2.1 gives B(w,x)=ε(eik′⋯ei1′(x)), hence eik′⋯ei1′(x)≠0, and ν=αi1+⋯+αik with the multiset unique by [F1]. This is the displayed claim with the sequence i1,…,ik, the first applied derivation ei1′ being the rightmost factor; and if a vector were killed by every composite ei1′⋯eik′ over all such sequences, then applying this to a single reversed order would force B(w,x)=0 for every word w and hence x=0 by nondegeneracy, so the common kernel is zero. This proves (ii).

4.1step 2.1step 3.1F3algebra∎

The ei′′ version. Let 0≠x∈Uq−[−ν]. By [F3], ei′′=ψei′ψ, ψ is an involutive algebra automorphism of Uq− preserving the grading, and ψ(x)≠0. Apply step 3.1 to ψ(x): there is a sequence i1,…,ik with ν=αi1+⋯+αik and eik′⋯ei1′(ψ(x))≠0. Since ψ(ei′(y))=ei′′(ψ(y)) for all i,y and ψ2=id, induction on the number of factors gives ψ(eik′⋯ei1′(ψ(x)))=eik′′⋯ei1′′(x), which is therefore nonzero because ψ is injective; so (ii) holds with ei′′ in place of ei′. The same computation with step 2.1 proves the one-step statement for ei′′. No canonical basis, integral form, freeness or character statement is used: the argument is the full field-level separation claim on the actual Serre quotient.

Depends on

Used by

Dependency tree · two levels

32 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