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.

✓ 11 results · all verified · 11 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 11 also cleared it.

Yang–Baxter Operators and Quantum Braid Representations

1 · Prerequisites

2 · Summary

This page develops the categorical source of braid-group representations. A Yang–Baxter operator on an object X of a monoidal category is an invertible R ⁣:X⊗X→X⊗X satisfying the cubic Yang–Baxter equation, read in a strict model and transported by Mac Lane strictification. The local operators on tensor powers satisfy the Artin relations, so von Dyck's theorem produces a homomorphism Bn→Aut⁡(X⊗n) for every n, with compatibility under the standard inclusions. In a strict braided category the braiding itself is the basic example; braided coherence makes the construction canonical even when associators are not identities, and an involutive operator factors through the symmetric groups while its two-strand action factors exactly when R2=1.

The second half connects these representations with the framed graphical calculus. The framed oriented tangle category is presented by the crossings, cups, caps and full twists subject to the ribbon relations, and an object of a ribbon category with its braiding, duality and twist evaluates that category: there is a unique framed-tangle evaluation functor sending the positive strand to X. Closing a braid and evaluating by the pivotal comparison jX=uXθX recovers the categorical trace. In a k-linear ribbon category with k-bilinear tensor product and End⁡(1)=k, an absolutely simple object has scalar twist θX=λid⁡X. The two Markov stabilizations multiply its trace by λ±1, so multiplying by λ−w(β) yields an invariant of oriented unframed closures. The framed-tangle presentation assumes countable choice, and this last invariance statement assumes AC through the stated Markov theorem. Braided functors intertwine the canonical braid actions, so the whole construction is functorial in the category.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Absolutely simple objects

Definition

Let k be a field and let C be a k-linear category (k-linear categories and k-linear functors). Since composition in C is k-bilinear, End⁡C(X) is a k-algebra with unit id⁡X for every object X.

An object X of C is absolutely simple when the k-algebra End⁡C(X) is one-dimensional over k, that is,

End⁡C(X)=k⋅id⁡X,id⁡X≠0.

Equivalently, the evaluation map

k⟶End⁡C(X),λ⟼λid⁡X,

is an isomorphism of k-algebras. These two formulations agree: the evaluation map is k-linear and multiplicative with 1↦id⁡X, and it is injective because λid⁡X=0 with id⁡X≠0 forces λ=0; surjectivity is exactly End⁡C(X)=k⋅id⁡X. In particular a nonzero endomorphism space k⋅id⁡X has dimension one, so an absolutely simple object is not a zero object; if C has a zero object then X≠0 automatically.

In a k-linear abelian category, a simple object with End⁡(X)=k satisfies this condition (Simple object). The converse need not hold: the representation k→1k of the two-vertex quiver has only scalar endomorphisms but has the proper nonzero subrepresentation 0→k. Thus the definition records the scalar endomorphism condition without asserting simplicity in an arbitrary abelian category. Every simple object of a locally finite k-linear abelian category over an algebraically closed field k is absolutely simple. Indeed, a nonzero endomorphism of a simple object has zero kernel and full image, hence is an isomorphism; its endomorphism algebra D is therefore a division algebra. Local finiteness makes D finite-dimensional (Locally finite k-linear abelian categories). For a∈D, a polynomial over k annihilates a by linear dependence of its powers; it splits into linear factors, and a division algebra has no zero divisors, so one factor a−λid⁡X vanishes. Thus D=k. This definition fixes no semisimplicity and no algebraic-closedness hypothesis; it records them only as the standard situation in which absolute simplicity is automatic.

If X is absolutely simple, every automorphism of X is a scalar λid⁡X with λ∈k×: it is an invertible endomorphism, hence by absolute simplicity equals some λid⁡X, and λ is invertible with inverse λ−1 because λid⁡X is invertible.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Exponent sum and writhe of a braid

Definition

For n≥2 let Bn be the braid group of the Artin presentation (The braid group by Artin presentation), with generators σ1,…,σn−1. The assignment

σi⟼1(1≤i≤n−1)

has equal values on the two sides of every defining relator of that presentation: a braid relator σiσi+1σi=σi+1σiσi+1 has three letters on each side, and a distant-commutativity relator σiσj=σjσi has two letters on each side. Hence Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group gives a unique homomorphism

wn ⁣:Bn⟶Z,wn(σi±1)=±1.

It is the exponent sum, or writhe, of a braid. If β=σi1ϵ1⋯σikϵk is an Artin word for β with ϵl∈{±1}, then wn(β)=∑lϵl: the number of positive letters minus the number of negative letters. For n=0,1 set wn=0 on the trivial group Bn.

The homomorphisms wn assemble to a function w ⁣:⨆n≥0Bn→Z. Let ιn ⁣:Bn→Bn+1, ιn(σi)=σi, be the standard inclusion, which is well defined because the defining relators of Bn are among those of Bn+1. Then

wn+1(ιn(β))=wn(β),wn+1(ιn(β)σn±1)=wn(β)±1,

for all n≥1 and β∈Bn: the first identity holds because both sides are additive over an Artin word for β and agree on generators, and the second adds the single letter σn±1. Consequently w is invariant under conjugation,

w(γβγ−1)=w(β)

for all braids γ,β for which the product is defined, since w(γβγ−1)=w(γ)+w(β)−w(γ).

The exponent sum is invariant under conjugation, while under stabilization it shifts by ±1; it is not a complete invariant of braids. For instance in B3 the braids σ1σ2 and σ2σ1 have equal exponent sum 2 and are distinct: their images under σi↦(i i+1) are the two different three-cycles. This generator assignment respects the Artin relations by direct permutation multiplication, so it extends by Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The framed oriented tangle category

Definition

Work in the smooth category and fix the slab

W:=R×[0,1]×[0,1],

with coordinates (x,y,t) and height function t. Its bottom face is R×[0,1]×{0}, its top face is R×[0,1]×{1}, and its side faces are R×{0}×[0,1] and R×{1}×[0,1].

The framed oriented tangle category T is the strict monoidal category whose objects are the finite sequences ε=(ε1,…,εm) with εj∈{+1,−1}, the empty sequence included. For a sequence of length m, prescribe boundary points (j,12,0) on the bottom and (j,12,1) on the top, 1≤j≤m, with vertical strand collars and fixed normal vector (0,1,0) on those collars. A morphism ε→ε′ is a boundary-relative isotopy class of compact oriented framed 1-manifolds properly embedded in W and disjoint from the side faces, meeting the bottom face in m points and the top face in m′ points at those prescribed positions, equal to the vertical framed collars near both faces, and with the signs ε1,…,εm at the bottom and ε1′,…,εm′′ at the top, ordered by the x-coordinate. A sign +1 means that the oriented tangent points in the increasing t direction; −1 means decreasing t, at either face. A framing is a homotopy class, relative to the fixed collars, of nonvanishing normal vector fields. Isotopies are ambient isotopies of W, constant on the side faces and on the fixed top and bottom collars, that carry the framing class of one tangle to that of the other, fix every boundary point and its framing, and preserve strand orientation. This is the boundary-relative analogue of Oriented links in the three-sphere and ambient isotopy with diagrams in the slab in place of links in the sphere; the oriented crossing signs and kink conventions are those of Oriented Reidemeister moves.

Composition and tensor product. The composition of ε→ε′ and ε′→ε′′ is stacking: put the first tangle in R×[0,1]×[0,12], the second in R×[0,1]×[12,1], and glue along the common boundary. The tensor product is horizontal juxtaposition, placing the first factor to the left of the second and normalizing the ordered endpoints to the prescribed positions for the concatenated sequence. Use horizontal embeddings with disjoint image strips and fixed vertical collars, followed by an order-preserving horizontal adjustment near the boundary. Different such adjustments are isotopic relative to the prescribed framed collars: interpolate the increasing horizontal coordinate maps, whose derivatives remain positive, and extend through the collars. Thus the result is independent of those adjustments. The vertical collars make stacking smooth; different height rescalings and collar lengths are related by increasing height reparametrizations relative to the boundary. These isotopies prove associativity, the identity laws, strict associativity of juxtaposition on isotopy classes, and interchange. The empty sequence is the strict tensor unit. Hence these operations define a strict monoidal category.

Blackboard framing and elementary tangles. When a tangle is drawn in the interior picture plane y=12 with its bands parallel to that plane, its blackboard framing is represented by the normal to the band surface, equal to (0,1,0) away from small crossing neighborhoods and on the fixed collars. A diagram is a projection to the picture plane; at crossings the bands are separated in the y direction, rather than literally contained in that plane. All elementary tangles below carry the blackboard framing relative to the plane of the picture. The elementary morphisms of T are:

  1. for each pair of signs (ε,ε′) the positive crossing Xε,ε′+ ⁣:(ε,ε′)→(ε′,ε) and the negative crossing Xε,ε′− ⁣:(ε,ε′)→(ε′,ε), the two blackboard-framed crossings of the two adjacent strands. The superscript fixes the over/under geometry, independently of their orientations: X+ has the geometry of the positive Artin crossing on two + strands, and X− has the inverse geometry. For mixed endpoint signs its oriented crossing sign is reversed. Following the two strands, the crossing sends the left bottom endpoint to the right top endpoint and conversely, which is why the sign sequence is reversed in the target. The two crossings are mutually inverse, Xε′,ε+Xε,ε′−=id⁡(ε,ε′) and Xε′,ε−Xε,ε′+=id⁡(ε,ε′);
  2. for each sign ε the blackboard-framed cup ∪ε ⁣:∅→(ε,−ε) and cap ∩ε ⁣:(−ε,ε)→∅, single arcs with both endpoints on the top face respectively the bottom face, oriented by the sign; these are not invertible;
  3. for each sign ε the positive full twist φε+ ⁣:(ε)→(ε) and the negative full twist φε− ⁣:(ε)→(ε), the blackboard-framed bands carrying one positive respectively negative full twist of the band; they are mutually inverse, φε+φε−=φε−φε+=id⁡.

All isotopies are ambient isotopies of the slab fixing the boundary points and their framings, so isotopic framed colored tangles represent the same morphism of T.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Yang–Baxter operators on an object

Definition

Let C be a monoidal category and let X be an object of C. Write X⊗3 for the triple tensor product and write 1X⊗k for the k-fold tensor power of id⁡X. The equation below is interpreted in a strict model of C: fix a monoidal equivalence from C to a strict monoidal category, as in Mac Lane strictification, with tensor constraint JA,B:E(A)⊗E(B)→E(A⊗B). Put X′=E(X) and R′=JX,X−1E(R)JX,X, and read the displayed equation with X′,R′ in that strict category. When C is strict the display below is literal.

A Yang–Baxter operator on X is an invertible morphism R ⁣:X⊗X→X⊗X such that

(R⊗1X)(1X⊗R)(R⊗1X)=(1X⊗R)(R⊗1X)(1X⊗R).

Both sides are endomorphisms of X⊗3 in the strict model, so the display is a well-formed equality of morphisms of the strict model; transported back along the equivalence it is a well-formed statement about X. It is the Yang–Baxter equation, and an invertible solution R is also called an R-matrix on X in the categorical sense. Invertibility is part of the data: a solution of the cubic equation that is not invertible is not a Yang–Baxter operator in this sense.

In a strict braided monoidal category the braiding gives the basic example R=cX,X on any object X (Braided monoidal category): the Yang–Baxter equation for the braiding is In a strict braided monoidal category the braiding satisfies the Yang-Baxter equation, and cX,X is invertible with inverse cX,X−1 because each component of a braiding is an isomorphism. In a general braided monoidal category the same example is read in a strict model via the braided strictification of the category.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Local Yang–Baxter operators on tensor powers

Definition

Let C be a monoidal category, let X∈C, let R be a Yang–Baxter operator on X (Yang–Baxter operators on an object), and let n≥2. Write X⊗n for the left-nested tensor power: X⊗0:=1, X⊗1:=X and X⊗(k+1):=X⊗k⊗X for k≥1; write 1X⊗k for the k-fold tensor power of id⁡X.

Work first in a strict model C′ of C, obtained from a monoidal equivalence as in Mac Lane strictification, and let R′ ⁣:X′⊗X′→X′⊗X′ be the transported Yang–Baxter operator. The local Yang–Baxter operators are the automorphisms of the n-fold tensor power

Ri:=1X⊗(i−1)⊗R⊗1X⊗(n−i−1)∈Aut⁡C(X⊗n),1≤i≤n−1,

where in the strict model the display is literal and each Ri is the endomorphism of X′⊗n acting as R′ on the i-th and (i+1)-st tensor factors and as the identity elsewhere.

Outside the strict model the same operators are obtained by conjugating the displayed word with canonical associativity isomorphisms: the composite

X⊗n→ κ X⊗(i−1)⊗(X⊗X)⊗X⊗(n−i−1)→ 1⊗(i−1)⊗R⊗1⊗(n−i−1) X⊗(i−1)⊗(X⊗X)⊗X⊗(n−i−1)→ κ−1 X⊗n,

where κ is any canonical morphism between the two parenthesised tensor words built from associators and unitors, is independent of the chosen κ by Mac Lane coherence in canonical-map form (Mac Lane coherence in canonical-map form), and it is this composite that defines Ri in C.

Each Ri is invertible, with inverse 1X⊗(i−1)⊗R−1⊗1X⊗(n−i−1) (respectively its bracket-corrected conjugate): the displayed inverse is a two-sided inverse of the displayed word in the strict model, and conjugation by κ preserves the inverse relation.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Framed oriented tangles have the ribbon generator-and-relation presentation

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Every morphism of the framed oriented tangle category T of The framed oriented tangle category is a finite composite of tensor products of identities, crossings, cups, caps and full twists.

A complete presentation on this elementary family is Turaev's reduced presentation (3.1.a), (3.2.a)--(3.2.h), together with the expressions (2.5.d)--(2.5.e) and (3.1.b)--(3.1.c) defining its additional orientation variants. Thus two elementary words represent the same framed tangle exactly when these relations and the strict monoidal axioms relate them.

Here the source's Xδ denotes our X+,+δ, its Zδ denotes our X+,−−δ, and its Yδ denotes our X−,+−δ; its Tδ denotes our X−,−δ. The source's positive cup and cap are ∪+ and ∩+, and its φ,φ′ are φ++,φ+−. The reduced generators are therefore X+,+δ, X+,−−δ, φ+±1, ∪+ and ∩+. The other cups, caps and crossings are the expressions above; a twist on a negative strand is obtained by bending the corresponding twisted positive strand with a cup and cap. Turaev's convention that a positive strand points downwards is transported to ours by reversing all strand orientations; this preserves composition, tensor product and framed isotopy. Crossing superscripts in his mixed-orientation pictures are oriented signs, explaining the minus signs in the dictionary.

The reduced relations are Yang--Baxter, the two zig-zags, inverse crossings and twists, curl slide, the bent-crossing inverse relation (3.2.g), and the twist-square relation (3.2.h). For example, the latter has the well-typed form

(φ++)2=(∩+⊗1+)(1−⊗X+,++)(X+,−−⊗1+)(∪+⊗1+).

Facts & Assumptions

Given: ACω and the category T with its fixed framing and crossing conventions.

[L1]

The objects, elementary tangles, composition, tensor product and boundary-relative framed isotopies are those of The framed oriented tangle category.

[F1]

Turaev, Chapter I, Lemma 3.1.1 and formulas (2.5.d)--(2.5.e), (3.1.b)--(3.1.c), printed pp. 40, 49--50, express every elementary orientation variant in the reduced generators (3.1.a). Lemma 3.3, printed p. 51, proves completeness of (3.2.a)--(3.2.h) for that reduced family. Its proof in §§4.1--4.8, printed pp. 57--69, treats diagrams in the strip relative to its boundary: it checks the oriented second and third Reidemeister moves, changes of height position, and insertion/deletion of a positive-negative curl pair. It does not allow deletion of a single curl.

[F2]

Turaev, Chapter I §2.1, printed pp. 34--35, identifies ribbon bands and annuli with homotopy classes of normal framings; Figure 2.3 turns a signed full twist into the corresponding blackboard curl.

Proof

technique · direct
1.1L1F1F2givenconstruct

Match the models. Thicken a framed core to a sufficiently narrow band, choosing the transverse band direction from its oriented tangent and normal framing. Conversely take the oriented core and surface normal of a band. Homotopies of the framing give isotopies of the narrow bands, relative to the collars; taking cores reverses this construction on isotopy classes. The compact tangle lies a positive distance from the side faces, so the thickness can be chosen uniformly small. This is the ribbon/framing correspondence of [F2], with fixed collars at open ends. Reverse all strand orientations to match the source's endpoint convention and use the displayed crossing dictionary. It identifies our model with the single-color, coupon-free case of [F1].

2.1F1step 1.1construct

Generate and remove redundant generators. By [F1], a generic diagram has finitely many crossing and extremum levels. Cutting between them gives a word in elementary tangles; the source's formulas express its orientation variants in the reduced family. Conversely these formulas represent the indicated elementary tangles by boundary-relative band isotopies. Thus every elementary word can be replaced by a reduced word without changing its morphism.

3.1F1F2step 1.1step 2.1∎

Soundness and completeness. The source checks each reduced relation by a band isotopy, and its complete boundary-relative proof in [F1] shows that equal reduced words are related by those relations and the strict monoidal axioms. Apply step 2.1 to any two equal elementary words, apply that completeness theorem to the resulting reduced words, and undo the replacements. This proves completeness for the enlarged family; soundness follows from the same isotopies. The assumed countable choice is available for the generic-position input. No inference from an unframed closed-link move theorem to a framed boundary-relative theorem is required.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Local Yang–Baxter operators satisfy the Artin relations

Statement

Let C be a monoidal category, let X∈C, let R be a Yang–Baxter operator on X, let n≥2, and let R1,…,Rn−1 be the local operators of Local Yang–Baxter operators on tensor powers, so that Ri∈Aut⁡C(X⊗n) is the local operator acting on the i-th and (i+1)-st tensor factors. Then

RiRj=RjRiwhenever ∣i−j∣>1,

RiRi+1Ri=Ri+1RiRi+1for 1≤i≤n−2.

In the non-strict model the identities are those of the bracket-corrected local operators defined in Local Yang–Baxter operators on tensor powers.

Facts & Assumptions

Given: a monoidal category C, an object X, a Yang–Baxter operator R on X, an integer n≥2, and the local operators R1,…,Rn−1.

[L1]

In a strict model the local operator is Ri=1X⊗(i−1)⊗R⊗1X⊗(n−i−1), and in general it is the bracket-corrected conjugate of that word; every Ri is invertible (Local Yang–Baxter operators on tensor powers).

[L2]

The Yang–Baxter operator satisfies the cubic equation (R⊗1X)(1X⊗R)(R⊗1X)=(1X⊗R)(R⊗1X)(1X⊗R) (Yang–Baxter operators on an object).

Proof

technique · direct
1.1L1givenalgebra

Far commutativity in the strict model. Suppose first that C is strict and ∣i−j∣>1. The endomorphisms Ri and Rj are tensor products of the identity with the single factor R inserted at positions {i,i+1} respectively {j,j+1}; these supports are disjoint because ∣i−j∣>1. Tensoring the two words and using functoriality of the tensor product, both RiRj and RjRi are the same tensor product of identities with two copies of R at positions {i,i+1} and {j,j+1} (in the two possible orders of composition); hence RiRj=RjRi.

1.2L1L2givenalgebra

The adjacent relation in the strict model. Suppose C is strict and 1≤i≤n−2. Every tensor factor outside positions i,i+1,i+2 carries only identities in each of the words RiRi+1Ri and Ri+1RiRi+1, so both sides are 1X⊗(i−1) tensored with an endomorphism of the three middle factors tensored with 1X⊗(n−i−2). On those three middle factors the two sides are (R⊗1X)(1X⊗R)(R⊗1X) and (1X⊗R)(R⊗1X)(1X⊗R), which are equal by the cubic equation [L2]. Since tensoring equal morphisms with identities gives equal morphisms, RiRi+1Ri=Ri+1RiRi+1.

2.1L1step 1.1step 1.2algebra

The non-strict model. Let E:C→C′ be the strong monoidal equivalence used in [L1], put X′=E(X), and let Jn:X′⊗n→E(X⊗n) be its iterated tensor constraint. Transport R as R′=J2−1E(R)J2. Naturality and associativity coherence of the constraints give E(Ri)=JnRistrJn−1: apply E to the bracket-corrected composite of [L1] and use the strong monoidal constraint at each tensor product. Thus E sends each proposed Artin identity to the corresponding identity of steps 1.1 and 1.2, conjugated by the single isomorphism Jn. Since an equivalence is faithful, the two identities hold in C. Every comparison here is a morphism in C′.

3.1step 1.1step 1.2step 2.1∎

Conclusion. Steps 1.1 and 1.2 prove the two families of identities in the strict model, and step 2.1 transports them to the bracket-corrected operators of the non-strict model. This proves the lemma. The argument is a finite computation in the tensor product and uses no choice principle.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

A ribbon object defines a unique framed-tangle evaluation functor

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Let C be a ribbon category (Twist and ribbon structure) with chosen left duals (Left dual and right dual object), braiding c (Braiding) and twist θ, and let X∈C. Write X+1:=X and X−1:=X∨. In a strict model of C (Every braided monoidal category is monoidally equivalent to a strict braided one) there is a unique strict monoidal functor

FX ⁣:T⟶C

from the framed oriented tangle category T with

FX(+)=X,FX(−)=X∨,

FX(Xε,ε′+)=cXε,Xε′,FX(Xε,ε′−)=(cXε′,Xε)−1,FX(∪+1)=coev⁡X,FX(∩+1)=ev⁡X,FX(φ+1±1)=θX±1,

where the cup and cap are the coevaluation and evaluation maps attached to the chosen left duals and the signs are the blackboard conventions of The framed oriented tangle category. The remaining elementary tangles of T, those carrying a negative sign at a cup, cap or twist, receive the values forced by these data through the relations. Explicitly put jX=uXθX:X→X∨∨, with u as in A braided rigid category has a Drinfeld morphism. Then

FX(∪−)=(1X∨⊗jX−1)coev⁡X∨,FX(∩−)=ev⁡X∨(jX⊗1X∨),FX(φ−±1)=θX∨±1.

These are the right coevaluation and evaluation on X induced by the ribbon structure; they need no identification X∨∨=X on objects. For a general ribbon category the same assignment determines a strong monoidal functor, unique up to the canonical coherence isomorphisms of the strictification. Isotopic framed tangles are equal morphisms of T, so FX is an invariant of framed tangles. Uniqueness needs no choice.

Facts & Assumptions

Given: ACω, a ribbon category C with chosen left duals, braiding c, twist θ and an object X.

[L1]

The reduced and redundant generator presentation, including its crossing sign dictionary, is Framed oriented tangles have the ribbon generator-and-relation presentation.

[L2]

Braided strictification is Every braided monoidal category is monoidally equivalent to a strict braided one. A strong monoidal equivalence transports evaluation, coevaluation and twist along its tensor constraints; applying its faithful underlying functor checks the zig-zag, balancing and ribbon-duality equations in the target.

[L3]

The left-dual zig-zags, braiding hexagons, and natural dual-compatible twist are those of Left dual and right dual object, Braiding and Twist and ribbon structure. The Drinfeld composite is A braided rigid category has a Drinfeld morphism.

[F1]

Turaev, Chapter I Theorem 2.5, printed pp. 39--40, and its deduction §3.5, printed pp. 53--55, construct the strict monoidal evaluator and prove uniqueness. The reduction to one color and the crossing dictionary are [L1]. The proof checks the Yang--Baxter, zig-zag, inverse and slide relations, proves the bent-crossing formulas from hexagons and evaluation naturality, and proves (3.2.h) from balancing and dual-compatibility. Formulas (2.5.d)--(2.5.e) are the reversed cups and caps; after expansion of uθ they are exactly the displayed right-dual maps.

Proof

technique · direct
1.1L1L2L3givenconstruct

Transport the structure. Use [L2] to work in a strict braided model and transport the chosen duals and twist by its strong monoidal constraints. The equations in [L3] are preserved by that transport. Send a signed word to the ordered tensor product of X and X∨, with the empty word sent to the unit, and use the displayed generator values. Their sources and targets agree with the elementary tangles; in particular ∩− has input X⊗X∨ and ∪− has output X∨⊗X.

2.1L1L3F1step 1.1algebra

Check the exact presentation. In the dictionary of [L1], the reduced crossing Z+ receives (cX∨,X)−1, rather than cX,X∨; this is the mixed-orientation value of [F1]. The reduced generator assignment is consequently precisely [F1] under the same axioms [L3]. Its complete algebraic check therefore proves every reduced relation, and its formulas for the redundant generators give all remaining values. For clarity, the twist-square check begins with (θX2⊗1X∨)coev⁡X=cX,X∨−1cX∨,X−1coev⁡X: naturality of θ at coevaluation gives balancing on X⊗X∨, and dual-compatibility moves the second twist to the first factor. Tensor with 1X, apply a cap and use the zig-zag and bent-crossing identities, as in [F1], to obtain exactly the twist-square relation in [L1].

3.1L1F1step 1.1step 2.1construct

Extend and prove uniqueness. Since the values satisfy a complete presentation, they define a strict monoidal functor on all words. Two such functors agree on reduced generators, hence on every word; the redundant values are forced by their defining expressions. Thus the strict-model evaluator exists and is unique.

4.1L1L2step 3.1∎

Return to the original category. Compose with the strong monoidal quasi-inverse in [L2], identify its strand values with X and X∨ using the unit of the equivalence, and transport generator values along those isomorphisms. The resulting functor has the anchor values interpreted through its tensor and unit constraints. Any other strong monoidal evaluator with these normalized values is compared on each signed word by its iterated tensor constraint; those comparisons commute with each generator and therefore with every word by [L1]. They form the canonical monoidal natural isomorphism identifying the two evaluators. Finally, equal framed tangles are equal morphisms in T, so their evaluations agree. Countable choice enters through the presentation [L1]; uniqueness and the generator computations introduce no further choice.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

A Yang–Baxter operator gives braid-group representations

Statement

Let C be a monoidal category, let X∈C, and let R be a Yang–Baxter operator on X. For every n≥2 there is a unique group homomorphism

ρn ⁣:Bn⟶Aut⁡C(X⊗n),ρn(σi)=Ri,

where Bn is the braid group of The braid group by Artin presentation and R1,…,Rn−1 are the local operators of Local Yang–Baxter operators on tensor powers. The family (ρn)n≥2 is compatible with the standard inclusions ιn ⁣:Bn→Bn+1, ιn(σi)=σi, in the sense that

ρn+1(ιn(β))=ρn(β)⊗1Xfor all β∈Bn.

Facts & Assumptions

Given: a monoidal category C, an object X, a Yang–Baxter operator R on X, an integer n≥2, and the local operators R1,…,Rn−1 on X⊗n.

[L1]

Each Ri is an automorphism of X⊗n, equal in a strict model to 1X⊗(i−1)⊗R⊗1X⊗(n−i−1) and in general to its bracket-corrected conjugate; the correction is independent of the chosen canonical isomorphisms by coherence (Local Yang–Baxter operators on tensor powers).

[L2]

The local operators satisfy RiRj=RjRi for ∣i−j∣>1 and RiRi+1Ri=Ri+1RiRi+1 for 1≤i≤n−2, with the bracket-corrected readings in the non-strict model (Local Yang–Baxter operators satisfy the Artin relations).

[L3]

For n≥2 the braid group Bn is presented by generators σ1,…,σn−1 subject to the braid relations σiσi+1σi=σi+1σiσi+1 and the distant-commutativity relations σiσj=σjσi for ∣i−j∣>1 (The braid group by Artin presentation).

[L4]

A map from the generators of a presented group to a group extends uniquely to a homomorphism if and only if the evaluation of every relator is the identity, and the extension is onto precisely when the images generate the target (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

Proof

technique · direct
1.1L1given

The assignment lands in the automorphism group. By [L1] each Ri is an automorphism of X⊗n, so the assignment σi↦Ri is a map from the generating set {σ1,…,σn−1} of Bn into the group Aut⁡C(X⊗n).

1.2L1L2L3algebra

The relators evaluate to the identity. By [L2] the values Ri satisfy σiσi+1σi=σi+1σiσi+1 and σiσj=σjσi for ∣i−j∣>1 with the bracket-corrected readings in the non-strict model. Since identities of morphisms in a strict model are preserved by the bracket correction of [L1] (the correction is by a common canonical isomorphism for the fixed tensor power), both families of defining relators of Bn evaluate to the identity in Aut⁡C(X⊗n).

2.1L3L4step 1.1step 1.2construct

Extension and uniqueness. By [L4] applied to the presentation [L3] and the map of step 1.1, whose relators evaluate to the identity by step 1.2, there is a unique homomorphism ρn ⁣:Bn→Aut⁡C(X⊗n) with ρn(σi)=Ri. Uniqueness is the uniqueness clause of [L4]: the generators generate Bn, so a homomorphism is determined by its values on them.

3.1L1L3L4step 2.1algebra

Compatibility with the standard inclusions. Fix n≥2 and consider the two maps Bn→Aut⁡C(X⊗n+1) given by β↦ρn+1(ιn(β)) and by β↦ρn(β)⊗1X. In the strict model the local operator at position i for n+1 strands is 1X⊗(i−1)⊗R⊗1X⊗(n−i)=(1X⊗(i−1)⊗R⊗1X⊗(n−i−1))⊗1X, the local operator at position i for n strands tensored with 1X; in the non-strict model the same identity holds for the bracket-corrected operators by coherence, as in [L1]. Both displayed maps are homomorphisms and they agree on every generator σi by this identity, so by the uniqueness clause of [L4] applied to the presentation [L3] they agree on all of Bn.

4.1step 2.1step 3.1∎

Conclusion. Steps 2.1 and 3.1 give, for every n≥2, the unique homomorphism ρn with ρn(σi)=Ri, compatible with the inclusions ιn. The construction uses only the Yang–Baxter relations and von Dyck's theorem; no choice principle is used.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

An object of a braided category carries canonical braid actions

Statement

Let C be a braided monoidal category with braiding c and let X∈C. For every n≥2 there is a canonical group homomorphism

ρn ⁣:Bn⟶Aut⁡C(X⊗n)

characterized by the property that ρn(σi) is the local braiding of the i-th and (i+1)-st tensor factors: in a strict model ρn(σi)=1X⊗(i−1)⊗cX,X⊗1X⊗(n−i−1), while in general cX,X is transported by the associativity isomorphisms and the result is independent of those choices by braided coherence (Braided coherence is controlled by underlying braids). The actions are compatible with the standard inclusions ιn ⁣:Bn→Bn+1 for n≥1:

ρn+1(ιn(β))=ρn(β)⊗1X.

For n=0,1, define ρn to be the unique homomorphism from the trivial group Bn to Aut⁡(X⊗n), with X⊗0=1. There are no local generators in these cases. At n=0, let λX:1⊗X→X be the left unitor. Compatibility means

ρ1(ι0(e))=λX(ρ0(e)⊗1X)λX−1=1X.

For n=1 the preceding compatibility formula is literal because both sides are the identity of X⊗X.

The statement holds for the braiding of Braided monoidal category with no choice principle.

Facts & Assumptions

Given: a braided monoidal category C with braiding c, an object X, and an integer n≥0.

[L1]

In a strict braided monoidal category the braiding gives a Yang–Baxter operator R=cX,X on X: it is invertible and satisfies the cubic equation (Yang–Baxter operators on an object).

[L2]

A Yang–Baxter operator R on X yields, for every n≥2, a unique homomorphism ρn ⁣:Bn→Aut⁡(X⊗n) with ρn(σi) the local operator of R at position i, and these are compatible with the inclusions ιn (A Yang–Baxter operator gives braid-group representations).

[L3]

Canonical composites built from associators, unitors, braidings and their inverses are determined by their underlying braid: if two such composites on X⊗n have the same underlying element of Bn, they are equal (Braided coherence is controlled by underlying braids).

[L4]

The braid group is presented by the Artin generators and relations (The braid group by Artin presentation), and von Dyck's theorem extends a generator assignment that respects the relators, uniquely (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

Proof

technique · direct
1.1L1L2givenconstruct

The strict case. For n≥2, assume first that C is strict. By [L1], R:=cX,X is a Yang–Baxter operator on X, so [L2] produces the homomorphism ρn ⁣:Bn→Aut⁡(X⊗n) with ρn(σi)=1X⊗(i−1)⊗R⊗1X⊗(n−i−1)=1X⊗(i−1)⊗cX,X⊗1X⊗(n−i−1), and it is compatible with the inclusions. This gives the corollary in the strict case, together with the uniqueness of ρn.

1.2L3L4givenconstruct

The general case. For n≥2 in a general braided monoidal category, define cˇi on the fixed left-nested tensor power X⊗n by conjugating the strict-model local braiding with the canonical associativity isomorphisms, as in [L3]. Each cˇi±1 is a canonical composite built from associators, unitors and braidings, so [L3] shows that the composite does not depend on the chosen canonical isomorphisms and that the braid relations and the distant-commutativity relations between the cˇi hold, because the underlying braids of the two sides agree. The assignment σi↦cˇi therefore satisfies the Artin relators of Bn [L4], and [L4] gives a unique homomorphism ρn ⁣:Bn→Aut⁡(X⊗n) with these values; it is canonical because each cˇi is independent of the choices.

1.3L4givenalgebra

Zero and one strand. By [L4], B0 and B1 are trivial, so their unique group actions send e to the identity. For n=1 both sides of the compatibility formula are 1X⊗X. For n=0, tensor functoriality gives ρ0(e)⊗1X=11⊗X; conjugating by λX gives 1X=ρ1(ι0(e)), the stated compatibility.

2.1L3L4step 1.2algebra

Compatibility with the inclusions. For n≥2, in the strict model the compatibility is step 1.1. In general, both β↦ρn+1(ιn(β)) and β↦ρn(β)⊗1X are canonical composite assignments on braid words with the same underlying braid ιn(β) in Bn+1; by [L3] they agree on every word, hence on every β by [L4]. Thus ρn+1(ιn(β))=ρn(β)⊗1X.

3.1step 1.1step 1.2step 2.1step 1.3∎

Conclusion. Steps 1.1--1.2 construct the canonical homomorphisms in the strict and general case, and steps 1.3 and 2.1 give the compatibility with the standard inclusions. The construction uses only the braiding, its coherence and von Dyck's theorem; no choice principle is used, since all composites are finite and the canonical isomorphisms are explicitly determined.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

An involutive Yang–Baxter operator factors through the symmetric group

Statement

Let C be a monoidal category, let X∈C, and let R be a Yang–Baxter operator on X with R2=1X⊗X. Then for every n≥2 the homomorphism ρn ⁣:Bn→Aut⁡(X⊗n) of A Yang–Baxter operator gives braid-group representations factors through the canonical surjection πn ⁣:Bn→Sn of The braid group surjects onto the symmetric group: there is a unique homomorphism ψn ⁣:Sn→Aut⁡(X⊗n) with ρn=ψn∘πn.

Conversely, if ρn factors through πn for some n≥2, then Ri2=1X⊗n for every local operator Ri, because σi2 lies in the kernel of πn; and since ρ2(σ1)=R, if ρ2 factors through π2 then R2=1X⊗X. Consequently an involutive Yang–Baxter operator is exactly one whose two-strand braid action factors through S2, and an involutive Yang–Baxter operator has its braid actions factoring through Sn for every n.

Facts & Assumptions

Given: a monoidal category C, an object X, a Yang–Baxter operator R on X, the homomorphisms ρn of A Yang–Baxter operator gives braid-group representations with ρn(σi)=Ri the local operator of R at position i, and the surjection πn ⁣:Bn→Sn.

[L1]

The local operators satisfy the Artin relations of [L3] (Local Yang–Baxter operators satisfy the Artin relations).

[L2]

The symmetric group Sn has the Coxeter presentation with generators s1,…,sn−1 and relations si2=1, the braid relations and the distant-commutativity relations (The symmetric group has the Coxeter presentation).

[L3]

The braid group has the Artin presentation (The braid group by Artin presentation as used in A Yang–Baxter operator gives braid-group representations), and the canonical surjection πn sends σi to si (The braid group surjects onto the symmetric group).

[L4]

A generator assignment that respects the relators of a presented group extends uniquely to a homomorphism; precomposition with a surjection is injective on homomorphisms (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

[L5]

The local operator at position i is 1X⊗(i−1)⊗R⊗1X⊗(n−i−1) in a strict model and its bracket-corrected conjugate in general (A Yang–Baxter operator gives braid-group representations, Local Yang–Baxter operators satisfy the Artin relations).

Proof

technique · direct
1.1L1L2L4L5givenconstruct

The direct implication. Assume R2=1X⊗X. By [L5] the local operator satisfies Ri2=1X⊗n: in the strict model Ri2 is the tensor product of identities with R2, and the bracket correction of [L5] is by a common canonical isomorphism, so it preserves the identity. By [L1] the operators Ri also satisfy the braid relations and the distant-commutativity relations. Hence the assignment si↦Ri from the Coxeter generators of Sn satisfies all relators of [L2], and [L4] gives a homomorphism ψn ⁣:Sn→Aut⁡(X⊗n) with ψn(si)=Ri.

1.2L2L3givenalgebra

The converse. Suppose ρn=ψ∘πn for some homomorphism ψ and some n≥2. Then for every i, Ri2=ρn(σi)2=ψ(πn(σi))2=ψ(πn(σi)2)=ψ(πn(σi2))=ψ(1)=1X⊗n, using that si2=1 in Sn by [L2] and that πn is a homomorphism [L3].

2.1L3L4step 1.1algebra

Factorization. Both ρn and ψn∘πn are homomorphisms Bn→Aut⁡(X⊗n), and on every Artin generator σi they agree: ρn(σi)=Ri=ψn(si)=ψn(πn(σi)) by [L3] and step 1.1. By the uniqueness clause of [L4] applied to the Artin presentation, ρn=ψn∘πn. Since πn is surjective, ψn is unique with this property: two such homomorphisms agree on the image of πn, which is all of Sn.

3.1L5step 1.2step 2.1algebra

The two-strand converse. For n=2 the only local operator is R1=R, so step 1.2 gives R2=1X⊗X as soon as ρ2 factors through π2. Hence an involutive Yang–Baxter operator is exactly one whose two-strand braid action factors through S2: one direction is step 1.1 with n=2 together with step 2.1, the other is the present step. For n≥3, step 1.2 gives the weaker identity (R2)⊗1X⊗(n−2)=1X⊗n; in a general monoidal category this whiskering does not by itself imply R2=1, which is why the criterion is stated at n=2.

4.1step 1.1step 1.2step 2.1step 3.1∎

Conclusion. Step 1.1 with step 2.1 shows that an involutive Yang–Baxter operator has all its braid actions factoring through the symmetric groups, and steps 1.2 and 3.1 give the converse at the level of the two-strand action: ρ2 factors through π2 exactly when R2=1. This proves the proposition. The argument uses only the Coxeter and Artin presentations and von Dyck's theorem, so no choice principle is used.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The intertwiner induced by a braided monoidal functor

Definition

Let F ⁣:C→D be a braided monoidal functor between braided monoidal categories (Braided monoidal functor), with binary tensor constraint JX,Y ⁣:F(X)⊗F(Y)→F(X⊗Y) and unit constraint J0 ⁣:1→F(1), which are isomorphisms because F is strong monoidal (Lax, strong, and strict monoidal functors). Let X∈C.

For n≥1 the n-fold constraint is the canonical isomorphism

Jn ⁣:F(X)⊗n⟶F(X⊗n),

defined in a strict model of both categories by the recursion J1=1F(X) and Jn+1=JX⊗n,X∘(Jn⊗1F(X)); in general the associativity and unit isomorphisms of the two monoidal structures are inserted in the same composite, and Jn is independent of those insertions by Mac Lane coherence for the monoidal structure.

We call Jn the intertwiner induced by F at X. It conjugates the canonical braid action on F(X)⊗n (An object of a braided category carries canonical braid actions) to F of the canonical braid action on X⊗n: the precise statement is that Jn∘ρnD(β)=F(ρnC(β))∘Jn for every β∈Bn, which is proved in the companion theorem. Each Jn is an isomorphism because it is a composite of the structure isomorphisms JX,Y and J0, which are invertible by strong monoidality; in particular Jn is a natural isomorphism between the two tensor-power functors.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The ribbon evaluation of an X-colored closed braid

Definition

Let C be a ribbon category with chosen left duals, twist θ (Twist and ribbon structure) and Drinfeld morphism uX ⁣:X→X∨∨ of A braided rigid category has a Drinfeld morphism. Put

jX:=uX θX  ⁣: X⟶X∨∨.

Then j is a natural isomorphism: it is the composite of the natural isomorphism u with the natural automorphism θ of the identity. It is monoidal up to the monoidal comparison dX,Y ⁣:X∨∨⊗Y∨∨→(X⊗Y)∨∨ of the double-dual functor,

jX⊗Y=dX,Y∘(jX⊗jY),

which is precisely the statement that uθ is the pivotal comparison induced by the ribbon structure; the identity follows from the tensor relation dX,Y∘(uX⊗uY)=uX⊗Y∘cY,X∘cX,Y for the Drinfeld morphism together with the twist axiom θX⊗Y=(θX⊗θY)∘cY,X∘cX,Y and the naturality of θ. Iterating the comparison identifies jX⊗n with the corresponding composite of the jX and the coherence isomorphisms of the tensor power.

Let n≥1 and β∈Bn (The braid group by Artin presentation), and let ρn ⁣:Bn→Aut⁡C(X⊗n) be the canonical braid action (An object of a braided category carries canonical braid actions). The ribbon evaluation of the X-colored closed braid is the value

tn(β):=Tr⁡L ⁣(jX⊗n∘ρn(β))∈End⁡C(1),

in the sense of The categorical trace of a morphism into the double dual: the composite jX⊗n∘ρn(β) is a morphism X⊗n→(X⊗n)∨∨, which is exactly the input type of the left categorical trace. When End⁡C(1)=k the value tn(β) is a scalar. For n=1 the group B1 is trivial and t1(e)=Tr⁡L(jX), the left dimension of X.

For n=0 put t0(e)=11, the evaluation of the empty closed tangle. This is a separate convention; no generator or dual pairing is needed for the empty diagram.

The identification of tn(β) with the evaluation FX(β^fr) of the blackboard-framed closure of β under the functor of A ribbon object defines a unique framed-tangle evaluation functor is the content of the closure-comparison lemma of this page; it must be proved before the trace is used as a link evaluation, and it is not assumed here. The functor FX is constructed under countable choice ACω (The Axiom of Countable Choice (ACω)), while the definition of tn above is choice-free and uses neither that functor nor that principle; only the comparison, not the trace, carries the choice cost.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The ribbon trace equals the framed-closure evaluation

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Let C be a ribbon category with chosen left duals and twist θ (Twist and ribbon structure), let X∈C, let n≥1 and β∈Bn, and let β^fr be the blackboard-framed closure of β: the closed framed tangle diagram obtained from the (n,n)-tangle diagram of β by joining its top boundary points to its bottom boundary points by the identity pairing in the blackboard framing, with every band colored by X. Denote by FX(β^fr) the value of the tangle evaluation functor on a word in the elementary generators representing this closed diagram. Then

tn(β)=FX(β^fr)∈End⁡C(1),

where tn is the ribbon trace of The ribbon evaluation of an X-colored closed braid and FX is the tangle evaluation functor of A ribbon object defines a unique framed-tangle evaluation functor. Consequently tn(β) depends only on the framed isotopy class of β^fr, and the blackboard-framed closure of the positive stabilization ιn(β)σn is the framed closure of β with one positive curl added on a band, while the closure of the negative stabilization adds one negative curl; with Turaev's convention the positive curl is the generator φX with FX(φX)=θX.

Facts & Assumptions

Given: ACω; a ribbon category C with chosen left duals and twist θ; an object X; n≥1 and β∈Bn; the (n,n)-tangle diagram of β and its blackboard-framed closure obtained by joining free ends by the identity pairing.

[L1]

The ribbon trace is tn(β)=Tr⁡L(jX⊗nρn(β)) with j=uθ, the Drinfeld morphism u of A braided rigid category has a Drinfeld morphism, and the canonical braid action ρn (The ribbon evaluation of an X-colored closed braid, The categorical trace of a morphism into the double dual).

[L2]

Under ACω (The Axiom of Countable Choice (ACω)) the tangle evaluation functor FX sends the positive crossing to cX,X, the cup and cap of the positive strand to coev⁡X and ev⁡X, the positive twist to θX, and is a monoidal functor; isotopic framed tangles have equal values (A ribbon object defines a unique framed-tangle evaluation functor). The elementary tangles of the framed oriented tangle category and the reading of a closed diagram as a word in the generators are as in The framed oriented tangle category.

[L3]

For a chosen left dual Y∨ of Y the maps ev⁡Y ⁣:Y∨⊗Y→1 and coev⁡Y ⁣:1→Y⊗Y∨ satisfy the zig-zag identities (Left dual and right dual object).

[F1]

Turaev's trace formula (1.5.a) is tr⁡(f)=dV∘cV,V∨∘((θVf)⊗1V∨)∘bV for f∈End⁡(V), and Corollary 2.7.2 states that closing the free ends of an (n,n)-graph Φ gives F(Φ‾)=tr⁡(F(Φ)) (Turaev, printed pp. 21--22 and 43--44).

[F2]

In the library's LEFT-dual convention, the pivotal trace is Tr⁡(f)=ev⁡X∨∘(ψXf⊗1X∨)∘coev⁡X with ψ=uθ, so Tr⁡(f)=Tr⁡L(ψXf). The evaluator is ev⁡X∨ because the preceding target is X∨∨⊗X∨. This translates EGNO formula (8.40) and its following trace-identification sentence; the commuting proof diagram following (8.41) explicitly uses ev⁡X∗ (author final text, printed p. 220).

[L4]

The left categorical trace is Tr⁡L(a)=ev⁡Y∨∘(a⊗1Y∨)∘coev⁡Y for a ⁣:Y→Y∨∨ (The categorical trace of a morphism into the double dual).

Proof

technique · direct
1.1L2F1construct

The word of the closed diagram. Read the closed framed diagram β^fr as a word in the elementary generators of the framed oriented tangle category: the diagram of β contributes its crossings, and the closing bands contribute, at the free ends, one coevaluation and one evaluation pair together with the crossings and twists produced by the blackboard framing of the closing bands. Since FX is monoidal [L2], its value on the closed diagram is the composite of the corresponding generator values: evaluations ev⁡, coevaluations coev⁡, braidings c and twists θ. By the closure corollary of [F1] this composite is exactly Turaev's trace: FX(β^fr)=tr⁡(ρn(β))=ev⁡X⊗n∘cX⊗n,(X⊗n)∨∘((θX⊗nρn(β))⊗1(X⊗n)∨)∘coev⁡X⊗n, where ρn(β)=FX applied to the (n,n)-tangle of β by the generator values of [L2].

2.1L1L3L4F2step 1.1algebra

The trace formula equals the library trace. By [F2] the composite of [F1] equals Tr⁡L(ψX⊗nρn(β)) with ψ=uθ: expanding ψX=uXθX by the defining composite of the Drinfeld morphism and substituting into [L4], the evaluation–coevaluation pair introduced by u is cancelled against the outer evaluation by the zig-zag identities of [L3], leaving precisely Turaev's composite. Hence FX(β^fr)=Tr⁡L(jX⊗nρn(β))=tn(β) by [L1].

3.1L2step 1.1step 2.1construct

Invariance and the curl. Since FX is a functor and isotopic framed tangles are equal morphisms of the framed oriented tangle category [L2], the value FX(β^fr) depends only on the framed isotopy class of the closure; by step 2.1 the same holds for tn(β). The closure of ιn(β)σn±1 is obtained from the closure of β by adding one crossing and one band to the last strand, which in the blackboard framing is the insertion of one full twist φX±1 on a band; by the generator values of [L2] its image is θX±1, and with the declared convention the positive stabilization corresponds to the positive curl φX+ with FX(φX+)=θX.

4.1L1L2step 1.1step 2.1step 3.1∎

Conclusion. Steps 1.1 and 2.1 identify the ribbon trace with the functor's value on the blackboard-framed closure, step 3.1 records the framed-isotopy invariance and the local curl picture used by the stabilization lemma. Multiplicativity and cyclicity of the trace, where used, are the published properties of Basic properties of the categorical trace. The only choice principle used is ACω, consumed through the existence of the functor FX of [L2], which rests on the classification input of the tangle lemma; with FX available the trace computations of steps 1.1--3.1 are finite and use no further choice.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Braided functors intertwine canonical braid actions

Statement

Let F ⁣:C→D be a braided monoidal functor (Braided monoidal functor) between braided monoidal categories and let X∈C. Let Jn ⁣:F(X)⊗n→F(X⊗n) be the induced intertwiner (The intertwiner induced by a braided monoidal functor), and let ρnC and ρnD be the canonical braid actions of An object of a braided category carries canonical braid actions on X⊗n and on F(X)⊗n. Then for all n≥2 and β∈Bn (The braid group by Artin presentation),

Jn∘ρnD(β)=F(ρnC(β))∘Jn.

Thus the braid action on F(X)⊗n is obtained from the braid action on X⊗n by transporting along the monoidal structure of F.

Facts & Assumptions

Given: a braided monoidal functor F ⁣:C→D with binary constraint JX,Y and unit constraint J0, an object X∈C, an integer n≥2, and the induced isomorphism Jn ⁣:F(X)⊗n→F(X⊗n).

[L1]

The binary constraint of a braided monoidal functor satisfies the braided-functor square JY,X∘cF(X),F(Y)′=F(cX,Y)∘JX,Y for all objects X,Y (Braided monoidal functor).

[L2]

The n-fold constraint Jn is a canonical isomorphism built from the constraints and coherence isomorphisms, so it is compatible with the tensor structure; the canonical braid actions are built from the braidings and the coherence isomorphisms (The intertwiner induced by a braided monoidal functor, An object of a braided category carries canonical braid actions).

[L4]

A generator assignment respecting the Artin relators extends uniquely to a homomorphism (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group); the braid group has the Artin presentation (The braid group by Artin presentation).

Proof

technique · direct
1.1L1L2givenalgebra

The identity on generators. Fix 1≤i<n and regroup the factors into the block before positions i,i+1, that pair, and the block after it, omitting empty blocks. Iterating the associativity diagram for a strong monoidal functor identifies Jn with the constraints for these blocks followed by their tensor product of iterated constraints; this follows by induction on block length from the recursion in [L2]. On the middle pair [L1] gives JX,XcF(X),F(X)′=F(cX,X)JX,X. Tensor this equality with the outer constraints. Naturality of the constraints for the two outer block combinations moves the middle morphism through them, giving JnρnD(σi)=F(ρnC(σi))Jn. The strong monoidal associativity diagram makes the same calculation valid with the canonical rebracketings in non-strict categories.

2.1L2L4step 1.1algebra

Both assignments are homomorphisms. By [L2] and [L4] the maps β↦Jn∘ρnD(β)∘Jn−1andβ↦F(ρnC(β)) are homomorphisms Bn→Aut⁡D(F(X⊗n)): the first is the conjugate of the homomorphism ρnD by the fixed isomorphism Jn, and the second is the composite of the homomorphism ρnC with the functor F. On every Artin generator σi they agree by step 1.1, so by the uniqueness clause of [L4] applied to the Artin presentation they agree on all of Bn.

3.1step 1.1step 2.1∎

Conclusion. Composing the identity of step 2.1 with Jn on the right gives Jn∘ρnD(β)=F(ρnC(β))∘Jn for every β∈Bn, which is the stated intertwining identity. The argument is a finite computation with the structure isomorphisms and one application of von Dyck's theorem, so no choice principle is used.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The scalar twist controls the two Markov stabilizations

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Let k be a field and C a k-linear ribbon category, with k-bilinear tensor product and End⁡C(1)=k, let X∈C be absolutely simple (Absolutely simple objects) so that the twist acts as θX=λid⁡X for a unique λ∈k× (Twist and ribbon structure), and let t be the ribbon evaluation of The ribbon evaluation of an X-colored closed braid. Fix the convention of The ribbon trace equals the framed-closure evaluation that a positive stabilization closes to the positive curl with FX(φX+)=θX. Then for every n≥1 and β∈Bn, with ιn the standard inclusion of Markov conjugation and stabilization moves,

tn+1(ιn(β) σn)=λ tn(β),tn+1(ιn(β) σn−1)=λ−1 tn(β).

With the opposite drawing convention, in which the positive stabilization closes to the inverse curl, the two scalars are exchanged; the pair of formulas must always be fixed by the local curl picture. No semisimplicity or dimension hypothesis is used beyond absolute simplicity of X and End⁡(1)=k.

Facts & Assumptions

Given: ACω; a k-linear ribbon category C with k-bilinear tensor product and End⁡(1)=k, an absolutely simple object X with θX=λid⁡X, λ∈k×, an integer n≥1 and a braid β∈Bn.

[L1]

Under ACω (The Axiom of Countable Choice (ACω)) the ribbon evaluation satisfies tn(β)=FX(β^fr) for the blackboard-framed closure, and the closure of ιn(β)σn±1 is the closure of β with one full twist φX±1 inserted on a band, evaluated to θX±1 by the functor (The ribbon trace equals the framed-closure evaluation, A ribbon object defines a unique framed-tangle evaluation functor).

[L2]

The positive stabilization of Markov conjugation and stabilization moves is β↦ιn(β)σn and the negative stabilization is β↦ιn(β)σn−1.

[L3]

An absolutely simple object X has End⁡(X)=kid⁡X, so every automorphism of X, in particular θX, is a scalar λid⁡X with λ∈k× (Absolutely simple objects).

[L4]

The twist is a natural automorphism of the identity and the ribbon structure satisfies the dual-compatibility (Twist and ribbon structure).

Proof

technique · direct
1.1L1L2givenconstruct

Inserting the curl. By [L1] the value tn+1(ιn(β)σn±1) equals FX of the blackboard-framed closure of β with one full twist generator φX±1 inserted in a band, the sign being fixed by the declared convention that positive stabilization corresponds to the positive curl.

1.2L1L4construct

Sliding the curl to the seam. In the framed tangle calculus the inserted full twist can be slid along its band without changing the morphism of the framed oriented tangle category: the curl-slide relations move a small curl past crossings and past the cup and cap ends of a band, and the twist is natural [L4], so the framed closure of β with the curl inserted anywhere on a band is the same framed tangle as the closure of β with the twist inserted at the closure seam of that band. Moving the curl to the seam and evaluating, the twist acts on the last tensor factor X of X⊗n before the closure pairing is taken, so tn+1(ιn(β)σn±1)=Tr⁡L ⁣(jX⊗n(ρn(β)∘(1⊗(n−1)⊗θX±1))), where the insertion is the twist on the last tensor factor; this is the same formula obtained by applying the closure-comparison lemma to the modified diagram.

2.1L3step 1.2algebra

Evaluating the scalar. By [L3] the twist is θX±1=λ±1id⁡X, so the insertion in step 1.2 is multiplication by the scalar λ±1 and can be taken out of the trace: Tr⁡L(jρn(β)λ±1)=λ±1Tr⁡L(jρn(β))=λ±1tn(β), because tensor product and composition are k-bilinear: in the defining evaluation--coevaluation composite a scalar multiple of the input becomes the same scalar multiple of the composite. The identification End⁡(1)=k then identifies that composite with a scalar. This gives the two displayed formulas.

2.2L1step 1.1given

Convention warning. The identification of positive stabilization with the positive curl is a drawing convention: with the opposite convention the inserted curl in step 1.1 is φX∓1, so the two scalars in the display are exchanged. The pair of formulas is therefore always fixed against the local curl picture, as stated.

3.1step 1.1step 1.2step 2.1step 2.2∎

Conclusion. Steps 1.1--2.1 prove tn+1(ιn(β)σn±1)=λ±1tn(β), and step 2.2 records the convention dependence. No semisimplicity or dimension hypothesis is used beyond End⁡(1)=k and absolute simplicity of X; the only choice principle used is ACω, consumed exactly through the closure comparison of [L1], which constructs the functor FX.

5 · Examples, counterexamples and false statements

None yet.

Sources