Alphabeta Math
Pipeline-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.

Ribbon categories and Reshetikhin–Turaev knot invariants

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Colored framed-link evaluation from a ribbon category

Definition

Assume the Axiom of Countable Choice. Let C be a ribbon category with chosen left duals and tensor unit 1. A finite oriented framed link colored in C is a finite disjoint union L of oriented smoothly embedded circles in S3, a homotopy class of nowhere-zero normal vector field on each component, and an assignment of an object of C to each component. A framed colored isotopy carries orientations, framings, and component colors. If FC is the ribbon-tangle evaluation functor, define RT⁡C(L):=FC(L)∈End⁡C(1). This value depends only on the framed colored isotopy class. It is not automatically a field scalar; if C is k-linear and End⁡C(1)=k, it is a scalar in k. The empty link is assigned 11.

Facts & Assumptions

Given: The ribbon category, its chosen left duals, a finite oriented framed link, and an object color on every component.

[F1]

For arbitrary component colors, the ribbon evaluation assigns a morphism to each colored framed tangle, is invariant under framed graph isotopy, and preserves the empty graph (Multicolored ribbon graphs with arbitrary coupons have a unique evaluation).

[A1]

Countable choice means every sequence of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: The data in the Definition and [A1].

1.1F1A1given

Under [A1], the evaluator in [F1] exists. The colored framed link is a ribbon graph with no boundary endpoints, so it assigns a morphism from the tensor unit to itself. This is an element of End⁡C(1), with no field-valued conclusion unless that endomorphism ring has been identified with a field.

2.1F1A1step 1.1given∎

If two representatives are framed colored isotopic, [F1] gives equal evaluator morphisms; the empty graph has value 11 by the same fact. Therefore the displayed assignment is well-defined on framed colored isotopy classes and has the stated empty-link value.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

The fundamental quantum sl2 module in the Kauffman-bracket ribbon convention

Definition

Let ω be an indeterminate, set A=ω−2, and put k′=Q(ω), qK=A2, and qL=A−2. Work over the scalar extension to k′ of the library Hopf algebra at qL. The parameter and Cartan-generator conversion from Korinman's convention is qL=qK−1 and KL=KK−1; the root generators E,F correspond unchanged. The vector basis order remains (v+,v−). Korinman displays these same column-action matrices for the root generators; no transpose is required. Thus the module matrices are E=(0100),F=(0010),KK=(qK00qK−1). Equivalently, for the library parameter use KL=KK−1=diag⁡(qL,qL−1) and the library coproduct convention Δ(E)=E⊗KL−1+1⊗E, Δ(F)=F⊗1+KL⊗F. The parameters qK and qL are not identified.

The object V is absolutely simple in the k′-linear representation category.

Korinman's §2.1 matrix CK=(0ω−ω50) is labeled there as the matrix of his inverse half-ribbon operator on the underlying vector space V. It is not the equivariant left-duality identification used below. Here Ω denotes specifically the Snyder–Tingley operator X, whose inverse matrix is computed independently below; it is not identified with CK.

To specify the half-ribbon action, use the Snyder–Tingley convention qST=qK, KST=KK=KL−1, EST=E, and FST=F in the same ordered basis. Since qK=ω−4, choose qST1/4=ω−1. Let X=JTw0 be their half-ribbon element and let Ω be its operator on V. On the fundamental highest- and lowest-weight vectors, their formula gives Xv+=−qST3/4v− and Xv−=qST3/4v+. The half-ribbon action therefore gives the actual inverse matrix and its square: Mat⁡(v+,v−)(Ω−1)=(0−ω3ω30),Ω2=−ω−6id⁡V=−A3id⁡V. Snyder–Tingley’s associated Hopf-algebra ribbon element is X−2; the positive categorical twist in this Kauffman-bracket convention is its inverse X2=Ω2. In the ordered basis (v+⊗v+,v+⊗v−,v−⊗v+,v−⊗v−), the positive braiding is cV,V=(A00000A−100A−1A−A−30000A). Its ribbon quantum dimension is δ=−A2−A−2. The half-ribbon and universal R-matrix are those of the topological half-ribbon representation category; the selected ribbon element is the Kauffman-bracket one, not the usual Uq(sl2) ribbon element.

Let v+∗,v−∗ be the ordinary dual basis. The left-dual action on V∗ is the contragredient action (x⋅f)(v)=f(S(x)v) for the antipode S of the stated library Hopf convention. Identify the displayed copy of V with this left dual V∨ by v+↦v−∗ and v−↦−A−2v+∗. In this identification the evaluation and coevaluation maps are B(v+⊗v−)=1,B(v−⊗v+)=−A−2,B(v+⊗v+)=B(v−⊗v−)=0, U(1)=−A2v+⊗v−+v−⊗v+. These are the explicit duality maps used in the closure trace.

The positive Artin generator is drawn with braid height increasing upward; the left input strand ends on the right, and the right input strand passes over it:

ii+1

The uninterrupted strand in the drawing is the overpassing strand. This is the crossing convention for the displayed matrix; the proof below uses its matrix entries and the half-ribbon source formulas, not the drawing.

Facts & Assumptions

Given: The generic parameter A, the basis (v+,v−), and the two explicitly distinguished parameters qK=A2 and qL=A−2.

[F1]

The Drinfeld–Jimbo presentation has KEK−1=q2E, KFK−1=q−2F, and EF−FE=(K−K−1)/(q−q−1) in the sl2 case (The Drinfeld-Jimbo quantized enveloping algebra by generators and relations).

[F2]

In the library convention, Δ(E)=E⊗K−1+1⊗E, Δ(F)=F⊗1+K⊗F, and the antipode is S(E)=−EK, S(F)=−K−1F, S(K)=K−1 (The Drinfeld–Jimbo formulas define a Hopf algebra).

[F3]

A braiding is a natural isomorphism cX,Y:X⊗Y→Y⊗X satisfying the two hexagon identities (Braiding).

[F4]

A ribbon twist is a natural automorphism satisfying θX⊗Y=(θX⊗θY)∘cY,X∘cX,Y and compatible with duality (Twist and ribbon structure).

[F5]

Korinman's full-text §2.1 gives the generic two-dimensional module, the displayed matrix of its inverse half-ribbon operator CK, the positive braiding matrix, and the Kauffman-bracket quantum dimension −qK−qK−1; the parameter, Cartan-generator, and column-action conversions used here are stated in the Definition (Korinman, §2.1).

[F6]

Snyder–Tingley Lemma 3.10 computes the action of X=JTw0 on highest- and lowest-weight vectors; Theorems 3.11 and 5.2 establish its standard braiding and half-ribbon structure, with associated Hopf-algebra ribbon element v=X−2 satisfying Δ(v)=(v⊗v)(R21R)−1 (Snyder–Tingley, §§3, 5).

[F7]

Absolute simplicity means End⁡(V)=k′id⁡V (Absolutely simple objects).

[F8]

A left dual has evaluation V∨⊗V→1 and coevaluation 1→V⊗V∨ satisfying both snake identities (Left dual and right dual object).

Proof

technique · direct

Given: The data in the Definition.

1.1F1F2givenalgebra

The displayed E,F,KK satisfy the sl2 relations: conjugating E by KK multiplies its only nonzero entry by qK2, conjugating F multiplies its only nonzero entry by qK−2, and EF−FE=diag⁡(1,−1)=(KK−KK−1)/(qK−qK−1), with nonzero denominator since qK−qK−1=ω−4−ω4≠0 in k′. Replacing (qK,KK) by (qL,KL)=(qK−1,KK−1) leaves the commutator quotient unchanged and gives the stated library toral relations. The coproduct conversion in the Definition is exactly [F2] after this substitution.

1.2F7givenalgebra

Any UqK(sl2)-endomorphism of V commutes with KK, whose distinct eigenvalues force it to be diagonal in (v+,v−). Commuting with E(v−)=v+ forces the two diagonal entries to agree. Thus End⁡(V)=k′id⁡V, which is [F7]'s absolute-simplicity condition.

1.3F3F5F6givenalgebra

In Korinman's convention the positive braiding is PD(1+(qK−qK−1)E⊗F), where P is the flip and D=diag⁡(A,A−1,A−1,A) in the displayed tensor basis. Since E2=F2=0, (E⊗F)2=0 and the source q-exponential truncates after its linear term. Applying this operator to the four basis vectors gives, in order, Av+⊗v+, A−1v−⊗v+, A−1v+⊗v−+(A−A−3)v−⊗v+, and Av−⊗v−. These are exactly the columns of the displayed matrix; [F6] supplies the half-ribbon completion in which this finite action is a braiding.

1.4F2F5F8givenalgebra

The bilinear map B and vector U(1) are UqK(sl2) intertwiners. The KK-weights in each nonzero pairing and coevaluation term multiply to 1. For the only nonzero E-pairing, Δ(E)(v−⊗v−)=qK−1v+⊗v−+v−⊗v+, whose B-value is qK−1−qK−1=0; the other basis inputs give zero or a multiple of v+⊗v+, also killed by B. For F, the only nonzero check is Δ(F)(v+⊗v+)=v−⊗v++qK−1v+⊗v−, whose B-value is −qK−1+qK−1=0. On coevaluation, Δ(E) sends −qKv+⊗v−+v−⊗v+ to −qKv+⊗v++qKv+⊗v+=0, and Δ(F) sends it to −qKv−⊗v−+qKv−⊗v−=0; the KK-weight is zero. Since these checks hold on the generators and Δ,ε are algebra maps, they establish invariance of B and U for every algebra element. The Hopf identity ∑x(1)⊗x(2)S(x(3))=x⊗1 then gives B(xv,w)=∑B(x(1)v,x(2)S(x(3))w)=∑ε(x(1))B(v,S(x(2))w)=B(v,S(x)w). Thus ϕ(v)=B(v,−) intertwines the stated contragredient action. Its matrix from V to V∗ has nonzero determinant A−2, so it is an isomorphism. Transporting the standard coevaluation 1↦v+⊗v+∗+v−⊗v−∗ by ϕ−1 gives exactly the displayed U. The snake composites are identities: (B⊗1)(1⊗U) returns v+ and v− with coefficients B(v+,v−)=1 and (−A2)B(v−,v+)=1, respectively, while (1⊗B)(U⊗1) returns them with coefficients (−A2)B(v−,v+)=1 and B(v+,v−)=1. By [F8], these are the defining left-dual identities. The closed loop is B(U(1))=−A2−A−2=δ. Thus these maps give the stated self-duality and quantum dimension.

2.1F4F6step 1.3algebra∎

For sl2, the fundamental highest weight λ satisfies (λ,λ)=1/2, (λ,ρ)=1/2, and ⟨2λ,ρ∨⟩=1. Snyder–Tingley’s formula [F6] therefore gives Xv+=−qST3/4v− and Xv−=qST3/4v+. With qST1/4=ω−1, this yields Mat⁡(Ω)=(0ω−3−ω−30) and Mat⁡(Ω−1)=(0−ω3ω30), whose square is Ω2=−A3I. The Hopf ribbon identity in [F6] gives Δ(v−1)=(v−1⊗v−1)R21R; since the monodromy R21R is cY,XcX,Y, this inverse acts as the categorical twist for the balancing convention in [F4]. Thus the positive categorical twist is v−1=X2=Ω2.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Ribbon evaluation from a colored braid word

Definition

An effective field is a field whose elements have finite encodings and whose exact addition, subtraction, multiplication, equality test, and inversion of nonzero elements are terminating procedures. Input a finite-dimensional strict matrix realization over an effective field k of a k-linear ribbon category with End⁡(1)=k, finite-dimensional color objects with fixed bases, exact matrices for every braiding and inverse braiding used, the evaluation and coevaluation maps for the closure, the twist matrices, and the matrix JW of the ribbon-induced pivotal comparison jW=uW∘θW:W→W∨∨ for W=Va1⊗⋯⊗Van, where uW is the Drinfeld morphism. Also input a finite braid word β on n≥1 strands and the top color tuple (a1,…,an). The matrices are assumed to satisfy the stated ribbon-category axioms; an implementation does not infer those axioms from arbitrary matrices.

Use the strand-position permutation homomorphism π:Bn→Sym⁡({1,…,n}) given by π(σi)=(i i+1). Read the braid letters in composition order, updating the current color tuple at each crossing by swapping its adjacent colors. For a positive letter σi, use the matrix of 1⊗⋯⊗cVai,Vai+1⊗⋯⊗1, and for a negative letter σi−1 use 1⊗⋯⊗cVai+1,Vai−1⊗⋯⊗1, whose source adjacent factors are Vai⊗Vai+1. Here the subscripts always refer to the current tuple before the swap. Let the blackboard-framed closure join the bottom and top endpoint at each position by the identity pairing. Reject the input if the final color tuple differs from the initial tuple: the tuple records the colors at the paired endpoints, so equality is exactly the condition that the closure carries a consistent color on every component. Starting with the identity matrix, multiply the typed crossing matrices in word order to obtain Mβ:W→W, then return the finite matrix contraction ev⁡W∨((JWMβ)⊗1W∨)coev⁡W∈k. In ordinary dual-basis coordinates this contraction is the matrix trace Tr⁡(JWMβ). No algorithm is asserted for arbitrary abstract ribbon categories without effective finite matrix data.

Facts & Assumptions

Given: The effective field, valid finite-dimensional matrix ribbon data, the braid word, and its top color tuple.

[F1]

For f:W→W∨∨, the left categorical trace is the composite ev⁡W∨(f⊗1W∨)coev⁡W (The categorical trace of a morphism into the double dual).

[F2]

The Drinfeld morphism uW:W→W∨∨ is a natural isomorphism defined by the displayed evaluation/braiding/coevaluation composite, and satisfies dY,Z(uY⊗uZ)=uY⊗ZcZ,YcY,Z (A braided rigid category has a Drinfeld morphism).

[F3]

For current adjacent colors A,B, the supplied positive crossing is cA,B:A⊗B→B⊗A and the negative crossing is cB,A−1:A⊗B→B⊗A. The matrices satisfy the ribbon-category axioms by the input condition.

[F4]

For n≥2, Bn is generated by σ1,…,σn−1 with the Artin braid and distant-commutativity relations, and B1 is trivial (The braid group by Artin presentation).

[F5]

Sym⁡({1,…,n}) is the group of bijections of the strand-label set under composition, and (i i+1) is the transposition interchanging i and i+1 (The symmetric group Sym⁡(X): the bijections of a set X under composition).

[F6]

The twist is natural and satisfies θY⊗Z=(θY⊗θZ)cZ,YcY,Z and ribbon dual compatibility (Twist and ribbon structure).

[F7]

The chosen evaluation and coevaluation maps satisfy the two snake identities (Left dual and right dual object).

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Framed colored-braid representative independence

Statement

Assume countable choice. Let C be a ribbon category with chosen left duals. If two finite colored braids have color-preserving endpoint permutations and their blackboard-framed closures are isotopic as oriented framed links by an isotopy preserving each component color, then their evaluations agree in End⁡C(1). Thus the framed colored evaluation of a closed braid is independent of its colored-braid representative whenever the represented framed colored links are the same.

Facts & Assumptions

Given: Countable choice, a ribbon category, two finite colored braids, and a framed colored isotopy between their closures.

[F1]

The colored framed-link evaluation is the framed ribbon-tangle functor applied to the closed link and takes values in End⁡C(1) (Colored framed-link evaluation from a ribbon category).

[F2]

The multicolored ribbon-tangle evaluator is invariant under every boundary-relative framed graph isotopy and handles arbitrary object colors with the chosen duality maps (Multicolored ribbon graphs with arbitrary coupons have a unique evaluation).

[A1]

Countable choice is assumed for the cited construction of the multicolored tangle evaluator (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: The data in the Statement and [A1].

1.1F1F2A1given

Under [A1], each braid closure is a framed colored link with empty boundary. By [F1], its value is the endomorphism of the tensor unit assigned by the multicolored framed-tangle evaluator, and its component labels are exactly the colors carried around the permutation cycles.

2.1F1F2step 1.1given∎

The isotopy hypothesis is a framed graph isotopy that preserves the labels. By [F2], the two closed tangles have equal evaluation morphisms. Applying [F1] identifies those morphisms with the two braid-closure values, proving equality in End⁡C(1). This statement concerns framed isotopy; an ordinary Markov stabilization that changes framing is not an additional move here.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Scalar twist correction removes the framing

Statement

Assume the Axiom of Choice. Let k be a field and let C be a k-linear ribbon category with k-bilinear tensor product and End⁡C(1)=k. Let X be absolutely simple, so its twist is θX=λid⁡X for a unique λ∈k×. For n≥1 and β∈Bn, let tn(β) be the value of the blackboard-framed X-colored closure and let w(β) be the exponent sum, with positive Artin generator and positive stabilization conventions fixed as in the supplied ribbon-trace formulas. Then JX(β^):=λ−w(β)tn(β) depends only on the oriented unframed link type of β^ when every component has color X. This statement makes no normalization by the categorical dimension.

Facts & Assumptions

Given: The Axiom of Choice; the k-linear ribbon category and absolutely simple color in the Statement; a braid β∈Bn with n≥1.

[F1]

The algebraic ribbon trace is Tr⁡L(jX⊗nρn(β)), where j=uθ is a natural pivotal comparison (The ribbon evaluation of an X-colored closed braid). Under countable choice, this equals the blackboard-framed closure value tn(β) used in the Statement (The ribbon trace equals the framed-closure evaluation).

[F2]

Categorical trace is cyclic: Tr⁡L(ac)=Tr⁡L(c∨∨a) for the stated typed morphisms (Basic properties of the categorical trace).

[F3]

The two stabilization values are tn+1(ιn(β)σn±1)=λ±1tn(β) when positive stabilization closes to the positive curl (The scalar twist controls the two Markov stabilizations).

[F4]

The exponent sum is unchanged by conjugation and satisfies w(ιn(β)σn±1)=w(β)±1 (Exponent sum and writhe of a braid).

[F5]

Two braids have equivalent oriented closures exactly when they are related by conjugations, stabilizations, and destabilizations (Markov's theorem for braid closures).

[F6]

The Axiom of Choice implies countable choice (AC implies DC implies countable choice).

[A1]

Absolute simplicity means End⁡C(X)=kid⁡X, so each automorphism of X is a unique nonzero scalar multiple of the identity (Absolutely simple objects).

[A2]

The Axiom of Choice is the assumption that every family of nonempty sets has a choice function (The Axiom of Choice).

Proof

technique · direct

Given: The hypotheses in the Statement and [F1]–[F6], [A1]–[A2].

1.1F1F2F4F6givenalgebra

By [F6], the assumed Axiom of Choice supplies countable choice, so [F1]'s closure comparison identifies every tn in the Statement with the algebraic trace. Fix γ∈Bn and put j=jX⊗n, ρ=ρn. Apply [F2] with a=jρ(γ)ρ(β) and c=ρ(γ)−1 to obtain tn(γβγ−1)=Tr⁡L((ρ(γ)−1)∨∨jρ(γ)ρ(β)). Naturality of j gives (ρ(γ)−1)∨∨j=jρ(γ)−1, so this is tn(β). The exponent sum is unchanged by [F4], hence JX is invariant under conjugation.

2.1F3F4A1step 1.1algebra

For a positive or negative stabilization, [F3] multiplies tn by λ±1 and [F4] changes w by ±1. Hence λ−w(ιnβσn±1)tn+1(ιnβσn±1)=λ−w(β)∓1λ±1tn(β)=λ−w(β)tn(β). The scalar is available because [A1] makes the invertible twist a unique λ∈k×; the positive sign is fixed by [F3]. Thus JX is invariant under both stabilizations and their inverses.

3.1F3F4F5F6A2step 1.1step 2.1given∎

By [F5], any two braids with equivalent oriented unframed closures are connected by finitely many conjugations, stabilizations, and destabilizations. Steps 1.1 and 2.1 preserve JX under each such move, so the corrected value depends only on the oriented unframed link type. The Axiom of Choice [A2] is used in [F5] and supplies the countable-choice hypothesis of [F3] by [F6]; no choice is used in the finite trace or scalar calculations.

TheoremStatement: AI-adaptedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Correctness and termination of the colored-braid evaluation procedure

Statement

For every valid input of the colored-braid evaluation algorithm, where the braid word has m letters and the total tensor-product dimension is D, the procedure terminates after exactly m crossing-matrix updates and one finite pivotal-trace contraction. It returns the ribbon-category evaluation of that framed colored braid closure in the given matrix realization. The stated bound concerns the number of matrix updates; each update is a finite exact matrix multiplication over the effective field.

Facts & Assumptions

Given: A valid effective matrix input, a color-preserving braid word of length m, and the algorithm specified above.

[F1]

The algorithm initializes the identity matrix, multiplies the typed positive or inverse braiding matrix for each word letter, checks final color preservation, and returns the finite contraction ev⁡W∨((JWMβ)⊗1W∨)coev⁡W (Ribbon evaluation from a colored braid word).

Proof

technique · direct

Given: The hypotheses in the Statement and [F1].

1.1F1giveninduction

After j updates, induction on j shows that the running matrix is the composite of the first j typed crossing maps in composition order. The base case j=0 is the identity of W; the update rule in [F1] composes exactly the next generator or its inverse, proving the induction step. There are precisely m letters, so there are precisely m updates.

2.1F1step 1.1givenconstruct∎

At j=m, [F1] identifies the matrix with Mβ. Its final-color check makes it an endomorphism of W, and the output contraction is the categorical pivotal trace of that endomorphism, hence the defined closure evaluation. Every update is one finite matrix multiplication and the last contraction is finite; the effective-field procedures terminate, so the algorithm terminates and has the asserted value.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

4 · Examples, counterexamples and false statements

None yet.

Sources