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

The fundamental quantum sl2 ribbon trace matches the Hecke and bracket evaluations

Statement

Assume the Axiom of Countable Choice. Let A be an indeterminate, qK=A2, qL=A−2, and δ=−A2−A−2. Use the fundamental module, positive crossing, duality maps, and twist fixed in the preceding definition. For every n≥1 and β∈Bn, let tn(β) be the categorical ribbon trace of its blackboard-framed closure and let w(β) be its exponent sum. With t=A−4 and z0=−1/(t+1), the exact identities are tn(β)=δ⟨β^⟩=δn(−A)w(β)tr⁡n(πn(β))∣v=t, z=z0, (−A3)−w(β)tn(β)=δ(−A3)−w(β)⟨β^⟩. Here tr⁡n is the normalized type-A Hecke Markov trace with braid generator sent to Ti, and ⟨β^⟩ is the Kauffman bracket in the fixed crossing chart. The second identity is a value-by-value normalization formula; it does not by itself assert a Jones-polynomial specialization.

Facts & Assumptions

Given: A is indeterminate, n≥1, β∈Bn, and the fundamental ribbon module with its stated basis, braiding, and duality maps.

[F1]

The fundamental module has the displayed positive braiding matrix cV,V and scalar twist −A3id⁡V (The fundamental quantum sl2 module in the Kauffman-bracket ribbon convention).

[F2]

Its self-dual evaluation and coevaluation are the maps B,U whose closed-loop value is δ (The fundamental quantum sl2 module in the Kauffman-bracket ribbon convention).

[F3]

The ribbon evaluation of the V-colored closed braid is the left categorical trace tn(β)=Tr⁡L(jV⊗nρn(β)) (The ribbon evaluation of an X-colored closed braid).

[F4]

The Kauffman bracket chart has the over-strand from southwest to northeast, its A-smoothing joins left endpoints, its B-smoothing joins top endpoints, and the loop value is δ=−A2−A−2 (Kauffman bracket smoothing and loop value).

[F5]

The positive Artin half twist has label i pass below the midpoint and label i+1 pass above, and its over/under projected tangents are (1,−2h) and (1,2h) in the stated projection coordinates (Oriented crossing signs, diagram writhe, and blackboard framing).

[F6]

The Hecke–bracket trace dictionary states ⟨β^⟩=δn−1(−A)e(β)tr⁡n(πn(β))∣v=t,z=z0 for q=A−2, t=A−4, and z0=−1/(t+1) (Hecke–bracket trace dictionary and local descent).

[F7]

The braid exponent sum is a homomorphism with w(σi±1)=±1 (The exponent sum of a braid).

[A1]

The Axiom of Countable Choice, ACω, selects an element from every countable family of nonempty sets (The Axiom of Countable Choice (ACω)).

[F8]

Under ACω, the framed tangle evaluator is monoidal, sends crossings to braidings and cups and caps to the chosen duality maps, and assigns equal values to framed-isotopic tangles (A ribbon object defines a unique framed-tangle evaluation functor).

[F9]

Under ACω, the categorical ribbon trace tn(β) equals the framed tangle evaluation of the blackboard-framed closure (The ribbon trace equals the framed-closure evaluation).

Proof

technique · direct

Given: The data in the Statement and [A1], [F1]–[F9].

1.1F1F2givenalgebra

In the ordered basis of [F1], direct subtraction gives e:=A(cV,V−AI)=(00000−A21001−A−200000). Writing U(1)=−A2v+⊗v−+v−⊗v+ and B(v+⊗v−)=1, B(v−⊗v+)=−A−2 shows entrywise that e=UB. Hence B(U(1))=−A2−A−2=δ and e2=δe. The explicit snake equalities in [F2] give the adjacent tensor relations: e12e23e12=UB⊗1 because the middle composites (1⊗B)(U⊗1) and then (B⊗1)(1⊗U) are identities; the reversed calculation gives e23e12e23=e23. Distant placements commute because they act on disjoint tensor factors.

2.1A1F1F2F3F4F5F8F9step 1.1givenalgebra

Use source coordinates (u,v) with their standard positive orientation and positive projection coordinates (t,x) on the braid box. For h>0, the map (t,x)=(v,−2hu) has determinant 2h>0. It sends the source over direction (1,1) to (1,−2h) and the source under direction (−1,1) to (1,2h), whose determinant is 4h>0. The source left/right pairs have constant u, hence constant braid position x and give the through pairing I; the source top/bottom pairs have constant v, hence constant braid time t and give the cup-cap ei. The displayed page coordinates (x,t) reverse the positive projection orientation; their visual quarter-turn is not the orientation comparison. Thus the A/B crossing expansion is Ci=AI+A−1ei. Its inverse is Ci−1=A−1I+Aei, since their product is I+(A2+A−2+δ)ei=I. By [A1] and [F8]–[F9], the categorical ribbon trace is the framed tangle evaluation of this braid closure, and that evaluator is monoidal with the stated crossing and duality maps. Expanding a braid word into the two smoothing choices therefore gives the bracket weights in [F4]. Because the closure has n≥1 strands, each complete smoothing is a nonempty closed 1-manifold, hence a union of at least one circle. Its categorical value is δ∣S∣ by monoidality in [F8] and the loop value [F2], whereas the bracket state sum uses δ∣S∣−1; the extra single factor is independent of the state. Thus tn(β)=δ⟨β^⟩.

3.1A1F1F2F3F6F7step 2.1algebra∎

The matrix trace tn in [F3] closes the tensor-word braid with the duality maps B,U of [F2]. Substituting each crossing into the trace expansion from step 2.1 therefore gives the first identity in the Statement. The Hecke formula [F6] then yields tn(β)=δn(−A)e(β)tr⁡n(πn(β))∣v=t,z=z0. By [F7], e(β)=w(β). The twist in [F1] is λ=−A3, so multiplying tn=δ⟨β^⟩ by λ−w(β) gives the second displayed identity. The only choice assumption is [A1], used in step 2.1 to invoke the published trace-to-closure identification; no stronger choice principle or division by δ is used. Since A is indeterminate, the specialization is taken in the rational-function field where t+1≠0.

Depends on

Used by

Dependency tree · two levels

48 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