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.
Yang–Baxter Operators and Quantum Braid Representations
1 · Prerequisites
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Applications of the Fundamental Group
- Approximation and Compactness in C(K)
- Artin Presentation Completeness and Braid Combing
- Asymptotic Cones and the Sublinear Triangle Criterion
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Braids as Fundamental Groups of Configuration Spaces
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Chain Complexes and Homology
- Chain Homotopy and the Homotopy Category
- Chains, Antichains, Sperner and Dilworth
- Classification of Compact Connected Surfaces
- Classification of Covering Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Cup Cap Cross Products and Cohomology Rings
- Cw Complexes and Cellular Homology
- Darboux, L'Hôpital, and Taylor's Theorem
- Derived Functors
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Duality and Rigidity in Monoidal Categories
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Exactness and the Member Calculus
- Ext and Balanced Resolutions
- Exterior Powers, Orientation and Hodge Duality
- Fibrations Fiber Bundles and Homotopy Exact Sequences
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Free Products and Amalgamation
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Geodesics, the Exponential Map, Completeness, and Hopf–Rinow
- Geometric Braids and Artin Generators
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Higher Homotopy Groups and Cofiber Sequences
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Kunneth Exactness and Splittings over Principal Ideal Domains
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Long Exact Sequences in Homology
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monoidal Categories and Monoidal Functors
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordered and Unordered Configuration Spaces
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Orientations Poincare Lefschetz and Alexander Duality
- Oriented Links, Braid Closures, and Markov Equivalence
- Partitions of Unity and Paracompactness
- Permutation Statistics, Inversions and Eulerian Numbers
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Plane Graphs, Euler's Formula and the Five Colour Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Projective and Injective Resolutions
- Properties of the Integral and the Working FTC
- Punctured Disks, Mapping Classes, and Point Pushing
- Pure Braids, Fadell–Neuwirth, and Asphericity
- Rank Theorems and Embedded Submanifolds
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Relative Homology Excision and Mayer Vietoris
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sard Theorem and Transversality
- Semidirect Products, Automorphism Groups and Split Extensions
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Simply Connected Plane Domains: the Grand Equivalence
- Singular Chains and Singular Homology
- Singular Cohomology and Coefficient Theorems
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Strictification and Mac Lanes Coherence Theorem
- Subobject Lattices Generators and the Grothendieck Axioms
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor and Fusion Categories
- Tensor Fields Exterior Algebra and Differential Forms
- Tensor Products of Modules
- The Artin Action on a Free Group
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Diagram Lemmas in an Abelian Category
- The Exponential Function
- The Fundamental Group
- The Fundamental Group of the Circle
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Seifert–van Kampen Theorem
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Trees, Forests and Spanning Trees
- Uniform Spaces: the Three Definitions
- Universal Coefficients and Kunneth Theorems
- Universal Properties, Representables and the Yoneda Lemma
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Whitney Embedding Tubular Neighbourhoods and Approximation
2 · Summary
This page develops the categorical source of braid-group representations. A Yang–Baxter operator on an object of a monoidal category is an invertible 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 for every , 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 .
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 . Closing a braid and evaluating by the pivotal comparison recovers the categorical trace. In a -linear ribbon category with -bilinear tensor product and , an absolutely simple object has scalar twist . The two Markov stabilizations multiply its trace by , so multiplying by 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
Absolutely simple objects
Definition
Let be a field and let be a -linear category (k-linear categories and k-linear functors). Since composition in is -bilinear, is a -algebra with unit for every object .
An object of is absolutely simple when the -algebra is one-dimensional over , that is,
Equivalently, the evaluation map
is an isomorphism of -algebras. These two formulations agree: the evaluation map is -linear and multiplicative with , and it is injective because with forces ; surjectivity is exactly . In particular a nonzero endomorphism space has dimension one, so an absolutely simple object is not a zero object; if has a zero object then automatically.
In a -linear abelian category, a simple object with satisfies this condition (Simple object). The converse need not hold: the representation of the two-vertex quiver has only scalar endomorphisms but has the proper nonzero subrepresentation . Thus the definition records the scalar endomorphism condition without asserting simplicity in an arbitrary abelian category. Every simple object of a locally finite -linear abelian category over an algebraically closed field is absolutely simple. Indeed, a nonzero endomorphism of a simple object has zero kernel and full image, hence is an isomorphism; its endomorphism algebra is therefore a division algebra. Local finiteness makes finite-dimensional (Locally finite k-linear abelian categories). For , a polynomial over annihilates by linear dependence of its powers; it splits into linear factors, and a division algebra has no zero divisors, so one factor vanishes. Thus . 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 is absolutely simple, every automorphism of is a scalar with : it is an invertible endomorphism, hence by absolute simplicity equals some , and is invertible with inverse because is invertible.
Exponent sum and writhe of a braid
Definition
For let be the braid group of the Artin presentation (The braid group by Artin presentation), with generators . The assignment
has equal values on the two sides of every defining relator of that presentation: a braid relator has three letters on each side, and a distant-commutativity relator 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
It is the exponent sum, or writhe, of a braid. If is an Artin word for with , then : the number of positive letters minus the number of negative letters. For set on the trivial group .
The homomorphisms assemble to a function . Let , , be the standard inclusion, which is well defined because the defining relators of are among those of . Then
for all and : 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 . Consequently is invariant under conjugation,
for all braids for which the product is defined, since .
The exponent sum is invariant under conjugation, while under stabilization it shifts by ; it is not a complete invariant of braids. For instance in the braids and have equal exponent sum and are distinct: their images under 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.
The framed oriented tangle category
Definition
Work in the smooth category and fix the slab
with coordinates and height function . Its bottom face is , its top face is , and its side faces are and .
The framed oriented tangle category is the strict monoidal category whose objects are the finite sequences with , the empty sequence included. For a sequence of length , prescribe boundary points on the bottom and on the top, , with vertical strand collars and fixed normal vector on those collars. A morphism is a boundary-relative isotopy class of compact oriented framed -manifolds properly embedded in and disjoint from the side faces, meeting the bottom face in points and the top face in points at those prescribed positions, equal to the vertical framed collars near both faces, and with the signs at the bottom and at the top, ordered by the -coordinate. A sign means that the oriented tangent points in the increasing direction; means decreasing , at either face. A framing is a homotopy class, relative to the fixed collars, of nonvanishing normal vector fields. Isotopies are ambient isotopies of , 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 , the second in , 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 with its bands parallel to that plane, its blackboard framing is represented by the normal to the band surface, equal to 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 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 are:
- for each pair of signs the positive crossing and the negative crossing , the two blackboard-framed crossings of the two adjacent strands. The superscript fixes the over/under geometry, independently of their orientations: has the geometry of the positive Artin crossing on two strands, and 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, and ;
- 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;
- 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, .
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 .
Yang–Baxter operators on an object
Definition
Let be a monoidal category and let be an object of . Write for the triple tensor product and write for the -fold tensor power of . The equation below is interpreted in a strict model of : fix a monoidal equivalence from to a strict monoidal category, as in Mac Lane strictification, with tensor constraint . Put and , and read the displayed equation with in that strict category. When is strict the display below is literal.
A Yang–Baxter operator on is an invertible morphism such that
Both sides are endomorphisms of 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 . It is the Yang–Baxter equation, and an invertible solution is also called an -matrix on 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 on any object (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 is invertible with inverse 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.
Local Yang–Baxter operators on tensor powers
Definition
Let be a monoidal category, let , let be a Yang–Baxter operator on (Yang–Baxter operators on an object), and let . Write for the left-nested tensor power: , and for ; write for the -fold tensor power of .
Work first in a strict model of , obtained from a monoidal equivalence as in Mac Lane strictification, and let be the transported Yang–Baxter operator. The local Yang–Baxter operators are the automorphisms of the -fold tensor power
where in the strict model the display is literal and each is the endomorphism of acting as on the -th and -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
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 in .
Each is invertible, with inverse (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.
Framed oriented tangles have the ribbon generator-and-relation presentation
Statement
Assume (The Axiom of Countable Choice ()). Every morphism of the framed oriented tangle category 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 denotes our , its denotes our , and its denotes our ; its denotes our . The source's positive cup and cap are and , and its are . The reduced generators are therefore , , , 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
Facts & Assumptions
Given: and the category with its fixed framing and crossing conventions.
The objects, elementary tangles, composition, tensor product and boundary-relative framed isotopies are those of The framed oriented tangle category.
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.
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
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].
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.
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.
Local Yang–Baxter operators satisfy the Artin relations
Statement
Let be a monoidal category, let , let be a Yang–Baxter operator on , let , and let be the local operators of Local Yang–Baxter operators on tensor powers, so that is the local operator acting on the -th and -st tensor factors. Then
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 , an object , a Yang–Baxter operator on , an integer , and the local operators .
In a strict model the local operator is , and in general it is the bracket-corrected conjugate of that word; every is invertible (Local Yang–Baxter operators on tensor powers).
The Yang–Baxter operator satisfies the cubic equation (Yang–Baxter operators on an object).
Proof
Far commutativity in the strict model. Suppose first that is strict and . The endomorphisms and are tensor products of the identity with the single factor inserted at positions respectively ; these supports are disjoint because . Tensoring the two words and using functoriality of the tensor product, both and are the same tensor product of identities with two copies of at positions and (in the two possible orders of composition); hence .
The adjacent relation in the strict model. Suppose is strict and . Every tensor factor outside positions carries only identities in each of the words and , so both sides are tensored with an endomorphism of the three middle factors tensored with . On those three middle factors the two sides are and , which are equal by the cubic equation [L2]. Since tensoring equal morphisms with identities gives equal morphisms, .
The non-strict model. Let be the strong monoidal equivalence used in [L1], put , and let be its iterated tensor constraint. Transport as . Naturality and associativity coherence of the constraints give : apply to the bracket-corrected composite of [L1] and use the strong monoidal constraint at each tensor product. Thus sends each proposed Artin identity to the corresponding identity of steps 1.1 and 1.2, conjugated by the single isomorphism . Since an equivalence is faithful, the two identities hold in . Every comparison here is a morphism in .
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.
A ribbon object defines a unique framed-tangle evaluation functor
Statement
Assume (The Axiom of Countable Choice ()). Let be a ribbon category (Twist and ribbon structure) with chosen left duals (Left dual and right dual object), braiding (Braiding) and twist , and let . Write and . In a strict model of (Every braided monoidal category is monoidally equivalent to a strict braided one) there is a unique strict monoidal functor
from the framed oriented tangle category with
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 , those carrying a negative sign at a cup, cap or twist, receive the values forced by these data through the relations. Explicitly put , with as in A braided rigid category has a Drinfeld morphism. Then
These are the right coevaluation and evaluation on induced by the ribbon structure; they need no identification 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 , so is an invariant of framed tangles. Uniqueness needs no choice.
Facts & Assumptions
Given: , a ribbon category with chosen left duals, braiding , twist and an object .
The reduced and redundant generator presentation, including its crossing sign dictionary, is Framed oriented tangles have the ribbon generator-and-relation presentation.
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.
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.
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 they are exactly the displayed right-dual maps.
Proof
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 and , 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 and has output .
Check the exact presentation. In the dictionary of [L1], the reduced crossing receives , rather than ; 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 : naturality of at coevaluation gives balancing on , and dual-compatibility moves the second twist to the first factor. Tensor with , apply a cap and use the zig-zag and bent-crossing identities, as in [F1], to obtain exactly the twist-square relation in [L1].
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.
Return to the original category. Compose with the strong monoidal quasi-inverse in [L2], identify its strand values with and 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 , so their evaluations agree. Countable choice enters through the presentation [L1]; uniqueness and the generator computations introduce no further choice.
A Yang–Baxter operator gives braid-group representations
Statement
Let be a monoidal category, let , and let be a Yang–Baxter operator on . For every there is a unique group homomorphism
where is the braid group of The braid group by Artin presentation and are the local operators of Local Yang–Baxter operators on tensor powers. The family is compatible with the standard inclusions , , in the sense that
Facts & Assumptions
Given: a monoidal category , an object , a Yang–Baxter operator on , an integer , and the local operators on .
Each is an automorphism of , equal in a strict model to 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).
The local operators satisfy for and for , with the bracket-corrected readings in the non-strict model (Local Yang–Baxter operators satisfy the Artin relations).
For the braid group is presented by generators subject to the braid relations and the distant-commutativity relations for (The braid group by Artin presentation).
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
The assignment lands in the automorphism group. By [L1] each is an automorphism of , so the assignment is a map from the generating set of into the group .
The relators evaluate to the identity. By [L2] the values satisfy and for 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 evaluate to the identity in .
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 with . Uniqueness is the uniqueness clause of [L4]: the generators generate , so a homomorphism is determined by its values on them.
Compatibility with the standard inclusions. Fix and consider the two maps given by and by . In the strict model the local operator at position for strands is , the local operator at position for strands tensored with ; 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 by this identity, so by the uniqueness clause of [L4] applied to the presentation [L3] they agree on all of .
Conclusion. Steps 2.1 and 3.1 give, for every , the unique homomorphism with , compatible with the inclusions . The construction uses only the Yang–Baxter relations and von Dyck's theorem; no choice principle is used.
An object of a braided category carries canonical braid actions
Statement
Let be a braided monoidal category with braiding and let . For every there is a canonical group homomorphism
characterized by the property that is the local braiding of the -th and -st tensor factors: in a strict model , while in general 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 for :
For , define to be the unique homomorphism from the trivial group to , with . There are no local generators in these cases. At , let be the left unitor. Compatibility means
For the preceding compatibility formula is literal because both sides are the identity of .
The statement holds for the braiding of Braided monoidal category with no choice principle.
Facts & Assumptions
Given: a braided monoidal category with braiding , an object , and an integer .
In a strict braided monoidal category the braiding gives a Yang–Baxter operator on : it is invertible and satisfies the cubic equation (Yang–Baxter operators on an object).
A Yang–Baxter operator on yields, for every , a unique homomorphism with the local operator of at position , and these are compatible with the inclusions (A Yang–Baxter operator gives braid-group representations).
Canonical composites built from associators, unitors, braidings and their inverses are determined by their underlying braid: if two such composites on have the same underlying element of , they are equal (Braided coherence is controlled by underlying braids).
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
The strict case. For , assume first that is strict. By [L1], is a Yang–Baxter operator on , so [L2] produces the homomorphism with , and it is compatible with the inclusions. This gives the corollary in the strict case, together with the uniqueness of .
The general case. For in a general braided monoidal category, define on the fixed left-nested tensor power by conjugating the strict-model local braiding with the canonical associativity isomorphisms, as in [L3]. Each 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 hold, because the underlying braids of the two sides agree. The assignment therefore satisfies the Artin relators of [L4], and [L4] gives a unique homomorphism with these values; it is canonical because each is independent of the choices.
Zero and one strand. By [L4], and are trivial, so their unique group actions send to the identity. For both sides of the compatibility formula are . For , tensor functoriality gives ; conjugating by gives , the stated compatibility.
Compatibility with the inclusions. For , in the strict model the compatibility is step 1.1. In general, both and are canonical composite assignments on braid words with the same underlying braid in ; by [L3] they agree on every word, hence on every by [L4]. Thus .
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.
An involutive Yang–Baxter operator factors through the symmetric group
Statement
Let be a monoidal category, let , and let be a Yang–Baxter operator on with . Then for every the homomorphism of A Yang–Baxter operator gives braid-group representations factors through the canonical surjection of The braid group surjects onto the symmetric group: there is a unique homomorphism with .
Conversely, if factors through for some , then for every local operator , because lies in the kernel of ; and since , if factors through then . Consequently an involutive Yang–Baxter operator is exactly one whose two-strand braid action factors through , and an involutive Yang–Baxter operator has its braid actions factoring through for every .
Facts & Assumptions
Given: a monoidal category , an object , a Yang–Baxter operator on , the homomorphisms of A Yang–Baxter operator gives braid-group representations with the local operator of at position , and the surjection .
The local operators satisfy the Artin relations of [L3] (Local Yang–Baxter operators satisfy the Artin relations).
The symmetric group has the Coxeter presentation with generators and relations , the braid relations and the distant-commutativity relations (The symmetric group has the Coxeter presentation).
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 sends to (The braid group surjects onto the symmetric group).
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).
The local operator at position is 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
The direct implication. Assume . By [L5] the local operator satisfies : in the strict model is the tensor product of identities with , and the bracket correction of [L5] is by a common canonical isomorphism, so it preserves the identity. By [L1] the operators also satisfy the braid relations and the distant-commutativity relations. Hence the assignment from the Coxeter generators of satisfies all relators of [L2], and [L4] gives a homomorphism with .
The converse. Suppose for some homomorphism and some . Then for every , , using that in by [L2] and that is a homomorphism [L3].
Factorization. Both and are homomorphisms , and on every Artin generator they agree: by [L3] and step 1.1. By the uniqueness clause of [L4] applied to the Artin presentation, . Since is surjective, is unique with this property: two such homomorphisms agree on the image of , which is all of .
The two-strand converse. For the only local operator is , so step 1.2 gives as soon as factors through . Hence an involutive Yang–Baxter operator is exactly one whose two-strand braid action factors through : one direction is step 1.1 with together with step 2.1, the other is the present step. For , step 1.2 gives the weaker identity ; in a general monoidal category this whiskering does not by itself imply , which is why the criterion is stated at .
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: factors through exactly when . This proves the proposition. The argument uses only the Coxeter and Artin presentations and von Dyck's theorem, so no choice principle is used.
The intertwiner induced by a braided monoidal functor
Definition
Let be a braided monoidal functor between braided monoidal categories (Braided monoidal functor), with binary tensor constraint and unit constraint , which are isomorphisms because is strong monoidal (Lax, strong, and strict monoidal functors). Let .
For the -fold constraint is the canonical isomorphism
defined in a strict model of both categories by the recursion and ; in general the associativity and unit isomorphisms of the two monoidal structures are inserted in the same composite, and is independent of those insertions by Mac Lane coherence for the monoidal structure.
We call the intertwiner induced by at . It conjugates the canonical braid action on (An object of a braided category carries canonical braid actions) to of the canonical braid action on : the precise statement is that for every , which is proved in the companion theorem. Each is an isomorphism because it is a composite of the structure isomorphisms and , which are invertible by strong monoidality; in particular is a natural isomorphism between the two tensor-power functors.
The ribbon evaluation of an -colored closed braid
Definition
Let be a ribbon category with chosen left duals, twist (Twist and ribbon structure) and Drinfeld morphism of A braided rigid category has a Drinfeld morphism. Put
Then is a natural isomorphism: it is the composite of the natural isomorphism with the natural automorphism of the identity. It is monoidal up to the monoidal comparison of the double-dual functor,
which is precisely the statement that is the pivotal comparison induced by the ribbon structure; the identity follows from the tensor relation for the Drinfeld morphism together with the twist axiom and the naturality of . Iterating the comparison identifies with the corresponding composite of the and the coherence isomorphisms of the tensor power.
Let and (The braid group by Artin presentation), and let be the canonical braid action (An object of a braided category carries canonical braid actions). The ribbon evaluation of the -colored closed braid is the value
in the sense of The categorical trace of a morphism into the double dual: the composite is a morphism , which is exactly the input type of the left categorical trace. When the value is a scalar. For the group is trivial and , the left dimension of .
For put , 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 with the evaluation 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 is constructed under countable choice (The Axiom of Countable Choice ()), while the definition of above is choice-free and uses neither that functor nor that principle; only the comparison, not the trace, carries the choice cost.
The ribbon trace equals the framed-closure evaluation
Statement
Assume (The Axiom of Countable Choice ()). Let be a ribbon category with chosen left duals and twist (Twist and ribbon structure), let , let and , and let be the blackboard-framed closure of : the closed framed tangle diagram obtained from the -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 . Denote by the value of the tangle evaluation functor on a word in the elementary generators representing this closed diagram. Then
where is the ribbon trace of The ribbon evaluation of an -colored closed braid and is the tangle evaluation functor of A ribbon object defines a unique framed-tangle evaluation functor. Consequently depends only on the framed isotopy class of , and the blackboard-framed closure of the positive stabilization 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 with .
Facts & Assumptions
Given: ; a ribbon category with chosen left duals and twist ; an object ; and ; the -tangle diagram of and its blackboard-framed closure obtained by joining free ends by the identity pairing.
The ribbon trace is with , the Drinfeld morphism of A braided rigid category has a Drinfeld morphism, and the canonical braid action (The ribbon evaluation of an -colored closed braid, The categorical trace of a morphism into the double dual).
Under (The Axiom of Countable Choice ()) the tangle evaluation functor sends the positive crossing to , the cup and cap of the positive strand to and , the positive twist to , 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.
For a chosen left dual of the maps and satisfy the zig-zag identities (Left dual and right dual object).
Turaev's trace formula (1.5.a) is for , and Corollary 2.7.2 states that closing the free ends of an -graph gives (Turaev, printed pp. 21--22 and 43--44).
In the library's LEFT-dual convention, the pivotal trace is with , so . The evaluator is because the preceding target is . This translates EGNO formula (8.40) and its following trace-identification sentence; the commuting proof diagram following (8.41) explicitly uses (author final text, printed p. 220).
The left categorical trace is for (The categorical trace of a morphism into the double dual).
Proof
The word of the closed diagram. Read the closed framed diagram 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 is monoidal [L2], its value on the closed diagram is the composite of the corresponding generator values: evaluations , coevaluations , braidings and twists . By the closure corollary of [F1] this composite is exactly Turaev's trace: where applied to the -tangle of by the generator values of [L2].
The trace formula equals the library trace. By [F2] the composite of [F1] equals with : expanding by the defining composite of the Drinfeld morphism and substituting into [L4], the evaluation–coevaluation pair introduced by is cancelled against the outer evaluation by the zig-zag identities of [L3], leaving precisely Turaev's composite. Hence by [L1].
Invariance and the curl. Since is a functor and isotopic framed tangles are equal morphisms of the framed oriented tangle category [L2], the value depends only on the framed isotopy class of the closure; by step 2.1 the same holds for . The closure of 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 on a band; by the generator values of [L2] its image is , and with the declared convention the positive stabilization corresponds to the positive curl with .
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 , consumed through the existence of the functor of [L2], which rests on the classification input of the tangle lemma; with available the trace computations of steps 1.1--3.1 are finite and use no further choice.
Braided functors intertwine canonical braid actions
Statement
Let be a braided monoidal functor (Braided monoidal functor) between braided monoidal categories and let . Let be the induced intertwiner (The intertwiner induced by a braided monoidal functor), and let and be the canonical braid actions of An object of a braided category carries canonical braid actions on and on . Then for all and (The braid group by Artin presentation),
Thus the braid action on is obtained from the braid action on by transporting along the monoidal structure of .
Facts & Assumptions
Given: a braided monoidal functor with binary constraint and unit constraint , an object , an integer , and the induced isomorphism .
The binary constraint of a braided monoidal functor satisfies the braided-functor square for all objects (Braided monoidal functor).
The -fold constraint 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).
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
The identity on generators. Fix and regroup the factors into the block before positions , that pair, and the block after it, omitting empty blocks. Iterating the associativity diagram for a strong monoidal functor identifies 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 . Tensor this equality with the outer constraints. Naturality of the constraints for the two outer block combinations moves the middle morphism through them, giving . The strong monoidal associativity diagram makes the same calculation valid with the canonical rebracketings in non-strict categories.
Both assignments are homomorphisms. By [L2] and [L4] the maps are homomorphisms : the first is the conjugate of the homomorphism by the fixed isomorphism , and the second is the composite of the homomorphism with the functor . On every Artin generator they agree by step 1.1, so by the uniqueness clause of [L4] applied to the Artin presentation they agree on all of .
Conclusion. Composing the identity of step 2.1 with on the right gives for every , 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.
The ribbon evaluation is an invariant of framed colored links
Statement
Assume (The Axiom of Countable Choice ()). Let be a ribbon category and . If and , with , are braids whose blackboard-framed -colored closures are isotopic as framed oriented tangles, then
in . More generally, is an invariant of framed -colored links: the value depends only on the framed isotopy class of the closure of . Ordinary Markov stabilization is not a framed isotopy: it inserts a curl and is handled only after writhe normalization.
Facts & Assumptions
Given: ; a ribbon category , an object , braids and whose blackboard-framed -colored closures are isotopic as framed oriented tangles.
The ribbon evaluation equals the evaluation of the blackboard-framed closure: , and the same for ; moreover the closure of the stabilized braid is the closure of with one full twist added on a band (The ribbon trace equals the framed-closure evaluation).
The tangle evaluation functor assigns equal values to isotopic framed tangles: isotopic framed tangles are equal morphisms of the framed oriented tangle category, and a functor preserves equalities (A ribbon object defines a unique framed-tangle evaluation functor).
Proof
The two evaluations agree. By [L1] and . The closures are isotopic framed oriented tangles by hypothesis, so by [L2] their values under are equal. Hence .
The framing changes under stabilization. By [L1], stabilization inserts one signed full twist. A framing number is the linking number of a component with its normal push-off; a full twist changes that number by (Turaev, Chapter I §2.1, printed pp. 34--35). The sum of component framing numbers is preserved by framed isotopy, including permutation of components, and changes by here. Thus stabilization is not a framed isotopy. Its evaluations can nevertheless coincide in a particular category; the functorial invariance alone gives no stabilization identity.
Framed-link invariance. On any closed framed -colored tangle , define its evaluation to be . By [L2] this is a framed-isotopy invariant, and [L1] identifies it with whenever is the blackboard-framed closure of . On the empty tangle the strict-model evaluator is the identity of the unit, agreeing with . This constructs the general evaluation without assuming that every framing has a blackboard-braid representative.
Conclusion. Steps 1.1--1.2 give the framed-isotopy invariance of the ribbon evaluation, and step 1.2 records that ordinary Markov stabilization changes the framing and lies outside this statement. The only choice principle used is , consumed through the closure comparison of [L1] and the functor of [L2]; the final comparison of the two values is then functoriality of applied to equal morphisms.
The scalar twist controls the two Markov stabilizations
Statement
Assume (The Axiom of Countable Choice ()). Let be a field and a -linear ribbon category, with -bilinear tensor product and , let be absolutely simple (Absolutely simple objects) so that the twist acts as for a unique (Twist and ribbon structure), and let be the ribbon evaluation of The ribbon evaluation of an -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 . Then for every and , with the standard inclusion of Markov conjugation and stabilization moves,
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 and .
Facts & Assumptions
Given: ; a -linear ribbon category with -bilinear tensor product and , an absolutely simple object with , , an integer and a braid .
Under (The Axiom of Countable Choice ()) the ribbon evaluation satisfies for the blackboard-framed closure, and the closure of is the closure of with one full twist inserted on a band, evaluated to by the functor (The ribbon trace equals the framed-closure evaluation, A ribbon object defines a unique framed-tangle evaluation functor).
The positive stabilization of Markov conjugation and stabilization moves is and the negative stabilization is .
An absolutely simple object has , so every automorphism of , in particular , is a scalar with (Absolutely simple objects).
The twist is a natural automorphism of the identity and the ribbon structure satisfies the dual-compatibility (Twist and ribbon structure).
Proof
Inserting the curl. By [L1] the value equals of the blackboard-framed closure of with one full twist generator inserted in a band, the sign being fixed by the declared convention that positive stabilization corresponds to the positive curl.
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 of before the closure pairing is taken, so 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.
Evaluating the scalar. By [L3] the twist is , so the insertion in step 1.2 is multiplication by the scalar and can be taken out of the trace: , because tensor product and composition are -bilinear: in the defining evaluation--coevaluation composite a scalar multiple of the input becomes the same scalar multiple of the composite. The identification then identifies that composite with a scalar. This gives the two displayed formulas.
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 , so the two scalars in the display are exchanged. The pair of formulas is therefore always fixed against the local curl picture, as stated.
Conclusion. Steps 1.1--2.1 prove , and step 2.2 records the convention dependence. No semisimplicity or dimension hypothesis is used beyond and absolute simplicity of ; the only choice principle used is , consumed exactly through the closure comparison of [L1], which constructs the functor .
The writhe-normalized ribbon trace is an unframed link invariant
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a field and a -linear ribbon category, with -bilinear tensor product and , let be absolutely simple with , , and let be the exponent sum (Exponent sum and writhe of a braid). For put
For the empty braid , and , so . Its Markov class is isolated because stabilization requires .
Then is invariant under conjugation in each and under both stabilizations (and hence under their inverses), so, by Markov's theorem (Markov's theorem for braid closures), depends only on the oriented unframed link type of the closure : if and are equivalent oriented links then . If in addition the categorical dimension is a unit of , then is the normalization with value on the unknot; no invertibility of is needed for invariance. The Axiom of Choice is used through Markov's theorem, and it supplies countable choice (AC implies DC implies countable choice) for the stabilization lemma; the trace computations themselves are finite.
Facts & Assumptions
Given: a -linear ribbon category with -bilinear tensor product and , an absolutely simple object with and , the ribbon evaluation , and the exponent sum .
The ribbon evaluation is with a natural isomorphism, and the trace is cyclic: for and (The ribbon evaluation of an -colored closed braid, Basic properties of the categorical trace).
For every braid one has (The scalar twist controls the two Markov stabilizations); that lemma is stated under countable choice, which AC supplies here (AC implies DC implies countable choice).
The exponent sum satisfies and (Exponent sum and writhe of a braid).
Two braids have equivalent oriented closures if and only if they are related by finitely many conjugations, stabilizations and destabilizations; this is Markov's theorem, proved under the Axiom of Choice (Markov's theorem for braid closures).
The Axiom of Choice is assumed (The Axiom of Choice); it enters the argument through Markov's theorem [L4] and supplies countable choice for the stabilization lemma [L2] (AC implies DC implies countable choice). Absolute simplicity makes act by the scalar (The scalar twist controls the two Markov stabilizations).
Proof
Conjugation invariance. Fix ; write and . Then . Apply cyclicity [L1] with and : Naturality of at the morphism gives , so the argument equals . Applying cyclicity again, . Since by [L3], this gives .
Invariance under stabilizations. By [L2], , while by [L3]. Hence Destabilizations are the inverses of stabilizations, so is also invariant under them.
Markov's theorem. Steps 1.1 and 2.1 show that is unchanged by each of the Markov moves and their inverses. By Markov's theorem [L4], two braids are related by such moves exactly when their closures are equivalent oriented links; therefore depends only on the oriented unframed link type of . This uses AC through Markov's theorem, and the countable-choice input to [L2] used in step 2.1 is also supplied by AC, as recorded in [F1] and [L4].
The normalization clause. The value is an invariant of oriented links, so multiplying it by a unit leaves an invariant. On the closure of the identity , which is the unknot, one has and , so . If is not a unit of , the normalization by is not available, but the invariance statement of step 3.1 does not use it.
Conclusion. Steps 1.1--2.1 prove that the writhe-normalized ribbon trace is invariant under Markov equivalence and hence an invariant of oriented unframed link types of closures, and step 4.1 gives the further unknot normalization when is invertible. Every categorical computation is finite; the Axiom of Choice is consumed by Markov's theorem and by the countable-choice input to the stabilization lemma.
5 · Examples, counterexamples and false statements
None yet.