Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

All generic colored Jones matrices satisfy the ribbon identities

Statement

Let A be indeterminate, F=Q(A), qK=A2, and qL=A−2. For every integer N≥1, the concrete module, finite R series, duality, pivotal comparison GN, and twist λN in the normalized colored Jones definition are admissible ribbon data. More precisely, take the F-linear category generated by all those modules under finite tensor products, chosen contragredient duals, finite direct sums, and images of module-idempotents, with all module maps as morphisms. Its braiding on weight vectors is the finite series RX,Y=DX,Y∑r≥0qKr(r−1)/2(qK−qK−1)r[r]!EXr⊗FYr,DX,Y(xh⊗yk)=Ahkxh⊗yk. The sum is finite on each pair. Its pivotal comparison on weight h is (−1)hqKh, and its twist on VN is (−1)N−1AN2−1I. These give natural invertible braidings with both hexagons, both duality snakes, the balancing identity and dual compatibility of twist. In particular all colors N, rather than a fixed bounded range of colors, are covered.

Facts & Assumptions

Given: The generic matrices and the category described in the Statement.

[F1]

The normalized color definition gives KL=qLH, Evj=[N−j]vj−1, Fvj=[j+1]vj+1, and the library coproduct Δ(E)=E⊗KL−1+1⊗E, Δ(F)=F⊗1+KL⊗F (Normalized colored Jones sequence).

[F2]

For every integer ℓ≥3, the full-weight divided-power category at q=eπi/ℓ, s=eπi/(2ℓ), has the finite R series, positive-K pivotal comparison and full ribbon identities proved in The corrected finite rank-one R series gives the full tilting ribbon structure. Its proof establishes the finite tensor hexagons, naturality on full module maps and summands, and the ribbon condition. Its final paragraph gives twist sa(a+2) on the simple Δ(a) for a<ℓ.

[F3]

For 0≤a<ℓ, the string module Δ(a) is simple and tilting, and its dual and finite tensor products are tilting (Outside-alcove rank-one tiltings have zero pivotal dimension, in its below-alcove simplicity argument, and the tilting category in The specified rank-one divided-power tilting category).

[F4]

The chosen duality, braiding and ribbon axioms are those of Left dual and right dual object, Braiding and Twist and ribbon structure. The Drinfeld morphism is a natural isomorphism with its proved tensor defect (A braided rigid category has a Drinfeld morphism).

Proof

technique · direct

Given: The data in the Statement.

1.1F1givenalgebra

Put K=KL−1. Then the generator relations and coproduct in [F1] become exactly KEK−1=qK2E, KFK−1=qK−2F, [E,F]=(K−K−1)/(qK−qK−1), Δ(E)=E⊗K+1⊗E, Δ(F)=F⊗1+K−1⊗F. The antipodes also agree: S(E)=−EK−1, S(F)=−KF. Thus this is a change of parameter and Cartan generator, not an assumption equating the two parameters. Every weight is an integer, and E,F are nilpotent on every fixed generated object by its finite weight range. The finite R series and all dual matrices are therefore rational matrices in A.

2.1F1F2F3step 1.1algebra

Fix finitely many objects, module maps, and a single proposed ribbon identity involving them. Realize every image of an idempotent inside its ambient finite tensor sum. There are finitely many rational entries, denominators, weights and matrix sizes in this identity. Specialize A=sℓ=eπi/(2ℓ) for integers ℓ greater than every color, every weight-range width and every divided-power index which can act nontrivially. Exclude the finitely many zeros of the finitely many nonzero denominator polynomials. Every color specializes to Δ(N−1) in [F3]; ordinary powers divided by [r]! specialize to its divided powers for all possibly nonzero indices, since those indices are below ℓ. Larger divided powers are zero by weight range. A generic module map preserves weights, because the generic K eigenvalues distinguish them, and commutes with these divided powers and the scalar toral characters. It is consequently a full divided-power module map after specialization, not merely a small-quantum-group map. An idempotent specializes to an idempotent module map, whose image is a tilting summand.

2.2F1F4step 1.1algebra

The contragredient action and ordinary evaluation and coevaluation in the color definition are module maps by the antipode identities: the action on their composites uses m(S⊗1)Δ=m(1⊗S)Δ=ηε. Their vector-space contractions send each basis vector or dual basis vector to itself, proving both snakes. Tensor, sum and idempotent duals use the corresponding transpose maps. Therefore the whole generated category is rigid. The unsigned pivotal comparison is jX+(x)(f)=f(Kx): S2=Ad⁡K, and K is group-like, so it is a natural monoidal module isomorphism to the double dual.

3.1F2F3step 2.1algebra

At each such specialization the finite generic series becomes exactly the one in [F2]: replacing ordinary powers by divided powers changes its coefficient to qKr(r−1)/2(qK−qK−1)r[r]!=qKr(r+1)/2(1−qK−2)r[r]!. The weight factor is Ahk=sℓhk. Thus the specialized series is a full natural braiding on all the chosen objects and maps, with both hexagons. Each entry of its generic intertwining, naturality, or hexagon equation is a rational function vanishing at infinitely many distinct sℓ. Its numerator polynomial has infinitely many roots and hence is zero. These identities therefore hold generically. Invertibility follows as well: the nilpotent series has constant term 1, hence a finite geometric-series inverse on each pair, and D is an invertible diagonal matrix. Idempotent restrictions and their inverses are compatible by naturality. This proves braiding on the full generated category.

4.1F2F4step 3.1step 2.2algebra

Let u be [F4]'s Drinfeld isomorphism, formed with the just-proved generic braiding and duality, and put θ+=u−1j+. Its tensor defect gives the balancing identity. Every matrix entry of its dual-compatibility equation is rational in A. Upon each sufficiently large specialization in step 2.1 it is precisely [F2]'s ribbon twist, so the equation holds by the same infinite-root argument as step 3.1. On VN, its specialized matrix is sℓ(N−1)(N+1)I by [F2]; infinite-root interpolation therefore gives θVN+=AN2−1I generically. This establishes the unsigned ribbon structure without importing an unproved generic universal-R assertion.

5.1F1F4step 3.1step 2.2step 4.1algebra∎

On a weight-h vector define pX=(−1)h. This is a module map because E,F change weight by 2; it is natural because module maps preserve weights, monoidal because weights add, and involutive. On dual weights −h it satisfies pX∗=(pX)∗, and p commutes with the braiding. Set j=pj+ and θ=pθ+. Substitution into the unsigned balancing and dual-compatibility equations proves the corresponding equations for θ; monoidality of p proves that j is a pivotal comparison. Since all weights of VN have parity N−1, its pivotal matrix is GN=(−1)N−1diag⁡(A2(N−1−2j)) and its twist is exactly λN=(−1)N−1AN2−1. The trace of the identity is (−1)N−1∑j=0N−1A2(N−1−2j)=dN. Every generic ribbon assertion required in the Statement has now been proved, and N was arbitrary.

Depends on

Used by

Cited to discharge well-definedness by Normalized colored Jones sequence.

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