Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 corrected finite rank-one R series gives the full tilting ribbon structure

Statement

For every ℓ≥3, the full tilting category of The specified rank-one divided-power tilting category is rigid and braided by cM,N=flip⁡∘RM,N, where

RM,N=D∑r≥0qr(r+1)/2(1−q−2)r[r]q!EM(r)⊗FN(r),D∣Mm⊗Nn=smn.

The sum is finite on every pair of objects. Its pivotal map is jM(x)(φ)=φ(Kx) and its ribbon twist is θM=uM−1jM, with u the Drinfeld map. For V=Δ(1), the self-dual cup and cap are

w=v+⊗v−−q−1v−⊗v+,b(v+⊗v−)=−q,b(v−⊗v+)=1,

with b(v±⊗v±)=0. They obey both snakes, b(w)=−δ and Frobenius–Schur sign −1 for j. Nevertheless dim⁡jV=δ. If U=−wb, then U2=δU, the adjacent TL relations hold, and

cV,V=sI−s−1U,T=qU−I=−s cV,V−1.

The Δ(2) and trivial channels have crossing eigenvalues s,−s−3 and Hecke eigenvalues −1,q2, respectively. Their twists are s8,1; θV=s3I. The Δ(2) channel is removed in the negligible quotient when ℓ=3. More generally θΔ(a)=sa(a+2)I for 0≤a≤ℓ−1. These assertions include even ℓ and use no small-quantum-group substitution.

Facts & Assumptions

Given: The full toral characters, q=s2=eπi/ℓ and the positive-K Hopf convention.

[F1]

The specified rank-one divided-power tilting category specifies the generators, coproduct, antipode, weight-pairing D and divided-power formula.

[F2]

Rank-one Weyl strings, tensor filtrations, and tilting classification proves that every finite tilting is a finite sum of summands of powers of V; Outside-alcove rank-one tiltings have zero pivotal dimension proves simplicity of Δ(a) for a<ℓ and its positive-K trace.

[F3]

The Drinfeld–Jimbo formulas define a Hopf algebra gives the generic Hopf identities, transported to [F1]'s convention as stated there; The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality gives the integral Gaussian identities.

[F4]

Rigid object and rigid monoidal category, Braiding, Pivotal structure and Twist and ribbon structure fix the snakes, hexagons, pivotal and dual-compatible twist conditions. A braided rigid category has a Drinfeld morphism gives u and its tensor defect.

Proof

1.1F1F4givenalgebra

In the basis (v+,v−), K=diag⁡(q,q−1), E12=1 and F21=1. Substitution in the coproduct shows that w and b are invariant for E,F,K. They preserve total integral weight, hence all toral binomials. Divided powers of index r≥3 vanish on V⊗2 by weight range, and the index-2 actions are ordinary squares divided by nonzero [2]; invariance therefore holds for the full divided-power algebra. The two direct contractions (1⊗b)(w⊗1) and (b⊗1)(1⊗w) each send v± to itself. Their closed composite is −q−q−1=−δ. Every invariant cup and cap is a scalar multiple of these, by solving the weight-zero E equation, and the snakes force the two scalars' product to be 1; that loop cannot become +δ by rescaling. With B=(0−q10) one has KBt=−B, or b(y,Kx)=−b(x,y). This is the exact negative pivotal symmetry sign.

1.2F1F3algebra

Work generically over Q(s) and put t=q−2. In ordinary powers the nilpotent series is f(Z)=∑r≥0arZr, where ar=qr(r−1)/2(q−q−1)r/[r]q!=(q−q−1)r/(r)!t and (r)!t=∏j=1r(1+t+⋯+tj−1). If AB=q2BA, Pascal induction gives (A+B)r=∑i+j=r[ri]tAiBj; dividing by (r)!t proves f(A+B)=f(A)f(B). On weight spaces DijEiDij−1=EiKj and DijFjDij−1=Ki−1Fj. Hence (Δ⊗1)R=D13D23f(E1K2F3)f(E2F3)=R13R23, because E1K2F3 and E2F3 q2-commute and D23−1F3D23=K2F3. Likewise (1⊗Δ)R=D12D13f(E1K2−1F3)f(E1F2)=R13R12, using K2−1F2=q2F2K2−1 and D12−1E1D12=E1K2−1. These are coefficientwise identities of finite series on any fixed tensor powers.

2.1F1F2step 1.1algebra

In the ordered tensor basis (++,+−,−+,−−), U=−wb has its nonzero middle block (q−1−1q−1). Thus U2=δU. The snakes give (wb)1(wb)2(wb)1=(wb)1, so also U1U2U1=U1; disjoint operators commute. The finite series on V⊗2 is R=D(1+(q−q−1)E⊗F), giving c=sI−s−1U and inverse s−1I−sU. It is a full-algebra intertwiner by direct E,F,K substitution and the divided-power/toral check of step 1.1. Its eigenvalues on ker⁡U and im⁡U are s and −s−3, respectively; im⁡U=Cw is the trivial channel. The complementary three-dimensional highest-weight string is Δ(2) by [F2]. Substitution gives qU−I=−sc−1 and the stated Hecke eigenvalues. The adjacent TL relations give Yang–Baxter: after expanding both triple products, the remaining coefficient is s−s−1δ+s−3=0.

3.1F1F3step 2.1step 1.2algebra

These tensor powers have explicit free integral tensor lattices. Their divided-power matrices are Laurent integral by the coproduct Gaussian expansion, and a toral binomial acts by the integral Gaussian at the total weight. All generic defining relations and associativity identities are therefore matrix identities over that lattice and remain true after specialization; this argument concerns finite matrices and needs no basis selection for an arbitrary completed algebra. Rewriting each series term as qr(r+1)/2(1−q−2)r[r]q!E(r)⊗F(r) makes its coefficient Laurent integral. Only finitely many r act by weight range, D has powers smn, and [r]! multiplies the term. Thus step 1.2 specializes at every ℓ≥3, including r≥ℓ, where the coefficient is zero. Inducting on tensor lengths identifies this finite series on V⊗m⊗V⊗n with the ordered block product of the elementary crossings of step 2.1. It is invertible and intertwines the entire specialized algebra. The block products satisfy both hexagons by partitioning their strands.

4.1F1F2F4step 3.1algebra

If g:M→M′ and h:N→N′ are module maps, they preserve integral weights and commute with every divided power. Consequently g⊗h commutes, in the typed sense, with each series term and D. This proves naturality with every full-algebra intertwiner directly. In particular the series and its inverse restrict to summands of tensor powers. By [F2], direct sums and such restrictions exhaust all tiltings, so invertibility, naturality and both hexagons hold throughout that category, not merely on tensor powers or on a small-quantum-group subcategory. Duals of tiltings are tilting by their two filtrations; evaluation and coevaluation for the antipode satisfy the vector-space snakes and are module maps. This proves rigidity and braiding.

5.1F1F2F4step 1.1step 4.1algebra

Since S2=Ad⁡K, jM(x)(φ)=φ(Kx) is a module map to the double dual. It is natural, invertible and monoidal because K is group-like. Form θ=u−1j using [F4]. On V∗ the matrices are E∗=−(EK−1)t, F∗=−(KF)t, with weights −1,1. Inserting them into the finite R and the evaluation formula for u gives uV=diag⁡(s−1,s−5): its second entry is s−1(1−(q−q−1)q−1)=s−5. Thus θV=s3I. The tensor defect in [F4] gives the balancing identity for θ. Dual compatibility holds on V, since it is self-dual and this twist is scalar. It then holds on every tensor power: duality reverses tensor order, the two dual crossings are the reversed crossings given by the evaluation snakes, and balancing on the two factors gives the same composite on either side. Naturality extends this equality to direct sums and summands. By [F2] these are all tiltings, proving the ribbon condition.

6.1F1F2step 2.1step 5.1algebra∎

The simple Δ(a) for a≤ℓ−1 occurs as a highest-weight summand in V⊗a by [F2]. Its highest vector is v+⊗a. Every elementary crossing there acts by s; balancing therefore gives twist (s3)asa(a−1)=sa(a+2). Naturality and the scalar endomorphism property make this its twist on the whole simple. The values at a=0,1,2 give 1,s3,s8. At ℓ=3, [F2] says Δ(2) has zero endomorphism trace and is removed in the negligible quotient; it is a genuine prequotient channel, not a retained one. Finally tr⁡(K∣V)=q+q−1=δ, despite the self-dual loop in step 1.1 being −δ. These prove all stated convention and boundary assertions.

Depends on

Used by

Dependency tree · two levels

35 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