Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 skew kernels in a numerical quantum Serre algebra

Statement

Let I be finite, A=(ajk) a symmetric generalized Cartan matrix, and q>0 a real number with q≠1. Let S be the complex associative algebra on generators ej for j∈I, with only the numerical quantum Serre relations ∑s=0N+1(−1)s[N+1s]qejN+1−sekejs=0,j≠k,N=−ajk. Here [r]q=(qr−q−r)/(q−q−1), divided powers are ej(n)=ejn/[n]q!, and S is graded by deg⁡ej=αj. Fix i∈I and write m(β)=∑jaijβj for a root degree β=∑jβjαj.

The operators on words specified by D(ej)=D′(ej)=δij,D(xy)=D(x)y+qm(deg⁡x)xD(y),D′(xy)=qm(deg⁡y)D′(x)y+xD′(y) descend to S, commute, and are locally nilpotent. Set Bi=ker⁡D. Then S=⨁n≥0ei(n)Bi. For homogeneous b∈Bi put R(b)=eib−q−m(deg⁡b)bei,F(b)=−D′(b)q−q−1,K(b)=qm(deg⁡b)b. These define an integrable type-one Uq(sl2) action on Bi, with conventions KRK−1=q2R, KFK−1=q−2F, and RF−FR=(K−K−1)/(q−q−1). The algebra Bi is generated by the finite root strings Rr(ej), j≠i, 0≤r≤−aij. In particular, if 0≠z∈Sβ satisfies D(z)=D′(z)=0, then m(β)≤0.

Facts & Assumptions

Given: Exactly the symmetric numerical Serre presentation in the statement, with q>0 and q≠1. No presentation comparison, pairing nondegeneracy, triangular decomposition, Casimir operator, or ambient quantum-group realization is assumed.

[F1]

The numbers [r]q are nonzero for nonzero integers r, and the symmetric quantum binomials satisfy [r−s]q[rs]q=[s+1]q[rs+1]q and ∑s=0r(−1)s[rs]qzr−s=∏t=0r−1(z−qr−1−2t). The factorial definition gives the first identity and the recurrence [rs]q=q−s[r−1s]q+qr−s[r−1s−1]q. The product on the right satisfies the same recurrence for its signed coefficients: it equals (z−qr−1)q−(r−1)∏t=0r−2(qz−qr−2−2t). Induction from r=0 therefore proves the second identity.

Proof

technique · direct
1.1givenF1constructalgebra

First define D,D′ on the free algebra by the displayed word rules. Write e=ei. Both operators lower the number of letters e in a word by one, so are locally nilpotent there. For each Serre polynomial on letters ej,ek, put r=1−ajk. If i is distinct from j,k, its image under D is zero. If i=j, set a=ajk=1−r. The two terms in D(er−sekes) have respective coefficients qr−s−1[r−s]q and q2(r−s)+a+s−1[s]q on the words with the appropriate one fewer e. On a fixed resulting word er−s−1ekes, the contributions from indices s and s+1 cancel: their common q-power is qr−s−1 and their remaining coefficients cancel by [F1]. If i=k, removing its single letter gives ejr times ∑s(−1)s[rs]qqaij(r−s). Symmetry gives aij=akj=ajk=1−r, so this sum is zero by [F1]. Thus D kills every generating Serre polynomial. Its skew product rule then preserves their two-sided ideal, so it descends to S. Reversing word order interchanges D,D′ and preserves that ideal, since reversal multiplies each Serre polynomial by (−1)r. Hence D′ also descends. The degree-lowering argument proves local nilpotence on S.

2.1step 1.1algebra

The operators commute. To check this without any presentation comparison, induct on word length in the free algebra. For homogeneous words x,y of i-weights mx,my, both DD′(xy) and D′D(xy) expand to qmyDD′(x)y+D(x)D′(y)+qmx+my−2D′(x)D(y)+qmxxDD′(y), using the inductive commutation on x,y. They agree on generators, so agree on all words and on S. In particular D′ preserves Bi. The skew product rule shows that Bi is a graded subalgebra.

3.1step 1.1step 2.1constructalgebra

For homogeneous b∈Bi of i-weight m, D(eb)=b and D(be)=qmb, so R(b)=eb−q−mbe belongs to Bi. For homogeneous b,c∈Bi one has R(bc)=R(b)c+q−mbbR(c). Moreover direct application of the second skew rule gives D′(R(b))=(qm−q−m)b+R(D′(b)), since D′(b) has weight m−2. With F=−D′/(q−q−1), this is RF(b)−FR(b)=[m]qb. The grading gives KRK−1=q2R and KFK−1=q−2F, and K is invertible. Thus these operators satisfy every defining relation of Uq(sl2) on Bi. Their product rules are R(bc)=R(b)c+K−1(b)R(c), F(bc)=F(b)K(c)+bF(c), and K(bc)=K(b)K(c).

4.1givenF1step 3.1algebra

For j≠i put N=−aij. Iterating the definition of R gives Rr(ej)=∑s=0r(−1)sq−s(aij+r−1)[rs]qer−sejes. Indeed the case r=0 is immediate, and passing from r to r+1 uses R(Rrej)=eRrej−q−aij−2r(Rrej)e and the quantum-binomial recurrence. At r=N+1 the extra q-factor is 1, so the numerical Serre relation is exactly RN+1(ej)=0. Since F(ej)=0 and its weight is −N, the commutator in step 3.1 gives by induction F(Rrej)=[r]q[N−r+1]qRr−1ej for r≥1. The needed scalar identity is ∑t=0r−1[m+2t]q=[r]q[m+r−1]q, obtained by summing the defining geometric series. Therefore Vj=span⁡{Rr(ej):0≤r≤N} is a finite-dimensional invariant subspace with weights −N,−N+2,…,N.

5.1step 3.1step 4.1constructalgebra

Let B0 be the subalgebra generated by all these Vj, j≠i. It is contained in Bi and stable under R, by its product rule and the terminating strings of step 4.1. The normal-order identity be=qmeb−qmR(b) for homogeneous b∈B0 shows that ∑n≥0enB0 is stable under right multiplication by e. It is also stable under right multiplication by every ej with j≠i, since these lie in B0. It contains 1, hence every word in the generators and all of S. Thus S=∑n≥0enB0.

6.1F1step 1.1step 5.1algebra

This sum is direct. For b∈Bi, iterating D gives D(enb)=qn−1[n]qen−1b and Dn(enb)=qn(n−1)/2[n]q!b. If ∑n=0denbn=0 with bn∈Bi and bd≠0, application of Dd gives qd(d−1)/2[d]q!bd=0, impossible by [F1]. Consequently the expression in step 5.1 is unique. Applying D to that expression and using the directness just proved shows that an element in ker⁡D has bn=0 for every n>0. Hence Bi=B0, and rescaling en by the nonzero [n]q! gives the asserted divided-power direct sum.

7.1step 3.1step 4.1step 6.1constructalgebra

The action on Bi is integrable. Each Vj in step 4.1 is finite-dimensional with a finite set of integer weights, so its raising and lowering operators are nilpotent. The product formulas of step 3.1 make multiplication Vj1⊗⋯⊗Vjt→Bi equivariant for the coproducts Δ(R)=R⊗1+K−1⊗R, Δ(F)=F⊗K+1⊗F, Δ(K)=K⊗K. These coproduct formulas satisfy the same rank-one relations, as is verified directly using KR=q2RK and KF=q−2FK. Each finite tensor product has only finitely many weights; R increases weight by two and F decreases it by two, so both are nilpotent on it. Every element of Bi=B0 is a finite sum of products of root-string generators, hence lies in a finite sum of such invariant images. Thus R,F are locally nilpotent and K acts with eigenvalues qm, m∈Z. No complete reducibility theorem for rank-one representations is used.

8.1F1step 3.1step 4.1step 7.1algebra∎

Finally let 0≠z∈Sβ satisfy D(z)=D′(z)=0, and put m=m(β). Then z∈Bi and Fz=0. By step 7.1 there is an integer n≥0 with Rnz≠0 and Rn+1z=0. The same commutator induction as in step 4.1 yields FRrz=−[r]q[m+r−1]qRr−1z. At r=n+1 it follows that [n+1]q[m+n]qRnz=0. Both [n+1]q and Rnz are nonzero, so [m+n]q=0. Since q>0 and q≠1, a symmetric quantum integer [r]q vanishes only when r=0. Thus m=−n≤0, as required.

Source notes

This is a direct proof from the stated numerical Serre relations. The source references identify the surrounding classical literature, not a claim that their full relevant proofs have been accessed. In particular Joseph's §4.1.17 is not used as a premise here. The formulas apply directly at q=pf>1.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources