How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Ribbon categories and Reshetikhin–Turaev knot invariants
1 · Prerequisites
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- 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
- Bruhat Decomposition and Flags over Finite Fields
- 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
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- 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
- Crossing signs, writhe, and linking number
- 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
- Divisibility, Greatest Common Divisors and Bézout's Identity
- 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
- Finite Weyl Invariants, Bruhat Order, and Kostant Harmonics
- 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
- Hecke Markov Traces and Polynomial Link Invariants
- 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
- Kac Moody Algebras from Generalized Cartan Matrices
- Kauffman bracket state sum and the Jones polynomial
- 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
- Modular Categories, Verlinde Formula, and TQFT
- 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
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Principal Series Representations of GL N over a Finite Field
- 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
- Quantized Enveloping Algebras and Quantum Serre Relations
- 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
- Splitting Fields
- 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
- Temperley–Lieb Diagram Algebra and Catalan Basis
- Temperley–Lieb Root-of-Unity and Modular Representation Theory
- Temperley–Lieb Semisimplicity and Generic Structure
- Tensor and Fusion Categories
- Tensor Coherence and Algebraic Descent
- Tensor Fields Exterior Algebra and Differential Forms
- Tensor Products of Modules
- The Artin Action on a Free Group
- The Ascoli–Arzelà Theorem
- The Burau Representations
- 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 Field of Fractions and Localisation
- 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
- Yang–Baxter Operators and Quantum Braid Representations
- Young Diagrams Tableaux and Permutation Modules
2 · Logical flowchart
3 · Definitions, theorems and proofs
Colored framed-link evaluation from a ribbon category
Definition
Assume the Axiom of Countable Choice. Let be a ribbon category with chosen left duals and tensor unit . A finite oriented framed link colored in is a finite disjoint union of oriented smoothly embedded circles in , a homotopy class of nowhere-zero normal vector field on each component, and an assignment of an object of to each component. A framed colored isotopy carries orientations, framings, and component colors. If is the ribbon-tangle evaluation functor, define This value depends only on the framed colored isotopy class. It is not automatically a field scalar; if is -linear and , it is a scalar in . The empty link is assigned .
Definition references
Facts & Assumptions
Given: The ribbon category, its chosen left duals, a finite oriented framed link, and an object color on every component.
For arbitrary component colors, the ribbon evaluation assigns a morphism to each colored framed tangle, is invariant under framed graph isotopy, and preserves the empty graph (Multicolored ribbon graphs with arbitrary coupons have a unique evaluation).
Countable choice means every sequence of nonempty sets has a choice function (The Axiom of Countable Choice ()).
Proof
Given: The data in the Definition and [A1].
Under [A1], the evaluator in [F1] exists. The colored framed link is a ribbon graph with no boundary endpoints, so it assigns a morphism from the tensor unit to itself. This is an element of , with no field-valued conclusion unless that endomorphism ring has been identified with a field.
If two representatives are framed colored isotopic, [F1] gives equal evaluator morphisms; the empty graph has value by the same fact. Therefore the displayed assignment is well-defined on framed colored isotopy classes and has the stated empty-link value.
The fundamental quantum sl2 module in the Kauffman-bracket ribbon convention
Definition
Let be an indeterminate, set , and put , , and . Work over the scalar extension to of the library Hopf algebra at . The parameter and Cartan-generator conversion from Korinman's convention is and ; the root generators correspond unchanged. The vector basis order remains . Korinman displays these same column-action matrices for the root generators; no transpose is required. Thus the module matrices are Equivalently, for the library parameter use and the library coproduct convention , . The parameters and are not identified.
The object is absolutely simple in the -linear representation category.
Korinman's §2.1 matrix is labeled there as the matrix of his inverse half-ribbon operator on the underlying vector space . It is not the equivariant left-duality identification used below. Here denotes specifically the Snyder–Tingley operator , whose inverse matrix is computed independently below; it is not identified with .
To specify the half-ribbon action, use the Snyder–Tingley convention , , , and in the same ordered basis. Since , choose . Let be their half-ribbon element and let be its operator on . On the fundamental highest- and lowest-weight vectors, their formula gives and . The half-ribbon action therefore gives the actual inverse matrix and its square: Snyder–Tingley’s associated Hopf-algebra ribbon element is ; the positive categorical twist in this Kauffman-bracket convention is its inverse . In the ordered basis , the positive braiding is Its ribbon quantum dimension is . The half-ribbon and universal -matrix are those of the topological half-ribbon representation category; the selected ribbon element is the Kauffman-bracket one, not the usual ribbon element.
Let be the ordinary dual basis. The left-dual action on is the contragredient action for the antipode of the stated library Hopf convention. Identify the displayed copy of with this left dual by and . In this identification the evaluation and coevaluation maps are These are the explicit duality maps used in the closure trace.
The positive Artin generator is drawn with braid height increasing upward; the left input strand ends on the right, and the right input strand passes over it:
The uninterrupted strand in the drawing is the overpassing strand. This is the crossing convention for the displayed matrix; the proof below uses its matrix entries and the half-ribbon source formulas, not the drawing.
Definition references
Drinfeld–Jimbo algebra presentation
Left-dual maps and snake identities
Korinman, Finite presentations for stated skein algebras and lattice gauge field theory, §2.1
Snyder and Tingley, The half-twist for representations, §§3–5
Etingof, Gelaki, Nikshych, and Ostrik, Tensor Categories, §§8.3, 8.9–8.10
Facts & Assumptions
Given: The generic parameter , the basis , and the two explicitly distinguished parameters and .
The Drinfeld–Jimbo presentation has , , and in the case (The Drinfeld-Jimbo quantized enveloping algebra by generators and relations).
In the library convention, , , and the antipode is , , (The Drinfeld–Jimbo formulas define a Hopf algebra).
A braiding is a natural isomorphism satisfying the two hexagon identities (Braiding).
A ribbon twist is a natural automorphism satisfying and compatible with duality (Twist and ribbon structure).
Korinman's full-text §2.1 gives the generic two-dimensional module, the displayed matrix of its inverse half-ribbon operator , the positive braiding matrix, and the Kauffman-bracket quantum dimension ; the parameter, Cartan-generator, and column-action conversions used here are stated in the Definition (Korinman, §2.1).
Snyder–Tingley Lemma 3.10 computes the action of on highest- and lowest-weight vectors; Theorems 3.11 and 5.2 establish its standard braiding and half-ribbon structure, with associated Hopf-algebra ribbon element satisfying (Snyder–Tingley, §§3, 5).
Absolute simplicity means (Absolutely simple objects).
A left dual has evaluation and coevaluation satisfying both snake identities (Left dual and right dual object).
Proof
Given: The data in the Definition.
The displayed satisfy the relations: conjugating by multiplies its only nonzero entry by , conjugating multiplies its only nonzero entry by , and , with nonzero denominator since in . Replacing by leaves the commutator quotient unchanged and gives the stated library toral relations. The coproduct conversion in the Definition is exactly [F2] after this substitution.
Any -endomorphism of commutes with , whose distinct eigenvalues force it to be diagonal in . Commuting with forces the two diagonal entries to agree. Thus , which is [F7]'s absolute-simplicity condition.
In Korinman's convention the positive braiding is , where is the flip and in the displayed tensor basis. Since , and the source -exponential truncates after its linear term. Applying this operator to the four basis vectors gives, in order, , , , and . These are exactly the columns of the displayed matrix; [F6] supplies the half-ribbon completion in which this finite action is a braiding.
The bilinear map and vector are intertwiners. The -weights in each nonzero pairing and coevaluation term multiply to . For the only nonzero -pairing, , whose -value is ; the other basis inputs give zero or a multiple of , also killed by . For , the only nonzero check is , whose -value is . On coevaluation, sends to , and sends it to ; the -weight is zero. Since these checks hold on the generators and are algebra maps, they establish invariance of and for every algebra element. The Hopf identity then gives . Thus intertwines the stated contragredient action. Its matrix from to has nonzero determinant , so it is an isomorphism. Transporting the standard coevaluation by gives exactly the displayed . The snake composites are identities: returns and with coefficients and , respectively, while returns them with coefficients and . By [F8], these are the defining left-dual identities. The closed loop is . Thus these maps give the stated self-duality and quantum dimension.
For , the fundamental highest weight satisfies , , and . Snyder–Tingley’s formula [F6] therefore gives and . With , this yields and , whose square is . The Hopf ribbon identity in [F6] gives ; since the monodromy is , this inverse acts as the categorical twist for the balancing convention in [F4]. Thus the positive categorical twist is .
Ribbon evaluation from a colored braid word
Definition
An effective field is a field whose elements have finite encodings and whose exact addition, subtraction, multiplication, equality test, and inversion of nonzero elements are terminating procedures. Input a finite-dimensional strict matrix realization over an effective field of a -linear ribbon category with , finite-dimensional color objects with fixed bases, exact matrices for every braiding and inverse braiding used, the evaluation and coevaluation maps for the closure, the twist matrices, and the matrix of the ribbon-induced pivotal comparison for , where is the Drinfeld morphism. Also input a finite braid word on strands and the top color tuple . The matrices are assumed to satisfy the stated ribbon-category axioms; an implementation does not infer those axioms from arbitrary matrices.
Use the strand-position permutation homomorphism given by . Read the braid letters in composition order, updating the current color tuple at each crossing by swapping its adjacent colors. For a positive letter , use the matrix of and for a negative letter use , whose source adjacent factors are . Here the subscripts always refer to the current tuple before the swap. Let the blackboard-framed closure join the bottom and top endpoint at each position by the identity pairing. Reject the input if the final color tuple differs from the initial tuple: the tuple records the colors at the paired endpoints, so equality is exactly the condition that the closure carries a consistent color on every component. Starting with the identity matrix, multiply the typed crossing matrices in word order to obtain , then return the finite matrix contraction In ordinary dual-basis coordinates this contraction is the matrix trace . No algorithm is asserted for arbitrary abstract ribbon categories without effective finite matrix data.
Definition references
Correctness and termination of this procedure ↗
Mixed-color ribbon-tangle evaluation
Drinfeld morphism and its tensor relation
Balancing and ribbon dual compatibility
Duality maps and snake identities
Permutations of the strand labels
Turaev, Quantum Invariants of Knots and 3-Manifolds, Chapter I, Theorem 2.5 and §§3–4
Etingof, Gelaki, Nikshych, and Ostrik, Tensor Categories, §§8.9–8.10
Facts & Assumptions
Given: The effective field, valid finite-dimensional matrix ribbon data, the braid word, and its top color tuple.
For , the left categorical trace is the composite (The categorical trace of a morphism into the double dual).
The Drinfeld morphism is a natural isomorphism defined by the displayed evaluation/braiding/coevaluation composite, and satisfies (A braided rigid category has a Drinfeld morphism).
For current adjacent colors , the supplied positive crossing is and the negative crossing is . The matrices satisfy the ribbon-category axioms by the input condition.
For , is generated by with the Artin braid and distant-commutativity relations, and is trivial (The braid group by Artin presentation).
is the group of bijections of the strand-label set under composition, and is the transposition interchanging and (The symmetric group : the bijections of a set under composition).
The twist is natural and satisfies and ribbon dual compatibility (Twist and ribbon structure).
The chosen evaluation and coevaluation maps satisfy the two snake identities (Left dual and right dual object).
Framed colored-braid representative independence
Statement
Assume countable choice. Let be a ribbon category with chosen left duals. If two finite colored braids have color-preserving endpoint permutations and their blackboard-framed closures are isotopic as oriented framed links by an isotopy preserving each component color, then their evaluations agree in . Thus the framed colored evaluation of a closed braid is independent of its colored-braid representative whenever the represented framed colored links are the same.
Statement references
Facts & Assumptions
Given: Countable choice, a ribbon category, two finite colored braids, and a framed colored isotopy between their closures.
The colored framed-link evaluation is the framed ribbon-tangle functor applied to the closed link and takes values in (Colored framed-link evaluation from a ribbon category).
The multicolored ribbon-tangle evaluator is invariant under every boundary-relative framed graph isotopy and handles arbitrary object colors with the chosen duality maps (Multicolored ribbon graphs with arbitrary coupons have a unique evaluation).
Countable choice is assumed for the cited construction of the multicolored tangle evaluator (The Axiom of Countable Choice ()).
Proof
Given: The data in the Statement and [A1].
Under [A1], each braid closure is a framed colored link with empty boundary. By [F1], its value is the endomorphism of the tensor unit assigned by the multicolored framed-tangle evaluator, and its component labels are exactly the colors carried around the permutation cycles.
The isotopy hypothesis is a framed graph isotopy that preserves the labels. By [F2], the two closed tangles have equal evaluation morphisms. Applying [F1] identifies those morphisms with the two braid-closure values, proving equality in . This statement concerns framed isotopy; an ordinary Markov stabilization that changes framing is not an additional move here.
Scalar twist correction removes the framing
Statement
Assume the Axiom of Choice. Let be a field and let be a -linear ribbon category with -bilinear tensor product and . Let be absolutely simple, so its twist is for a unique . For and , let be the value of the blackboard-framed -colored closure and let be the exponent sum, with positive Artin generator and positive stabilization conventions fixed as in the supplied ribbon-trace formulas. Then depends only on the oriented unframed link type of when every component has color . This statement makes no normalization by the categorical dimension.
Statement references
Ribbon trace on a closed braid
Equality of the trace and framed-closure value
Exact stabilization scalars and curl convention
Absolute simplicity and scalar automorphisms
Exponent sum and its Markov changes
Markov classification of oriented braid closures
Etingof, Gelaki, Nikshych, and Ostrik, Tensor Categories, §8.10, formula (8.35)
Turaev, Quantum Invariants of Knots and 3-Manifolds, Chapter I, §§1.5 and 2.7
Facts & Assumptions
Given: The Axiom of Choice; the -linear ribbon category and absolutely simple color in the Statement; a braid with .
The algebraic ribbon trace is , where is a natural pivotal comparison (The ribbon evaluation of an -colored closed braid). Under countable choice, this equals the blackboard-framed closure value used in the Statement (The ribbon trace equals the framed-closure evaluation).
Categorical trace is cyclic: for the stated typed morphisms (Basic properties of the categorical trace).
The two stabilization values are when positive stabilization closes to the positive curl (The scalar twist controls the two Markov stabilizations).
The exponent sum is unchanged by conjugation and satisfies (Exponent sum and writhe of a braid).
Two braids have equivalent oriented closures exactly when they are related by conjugations, stabilizations, and destabilizations (Markov's theorem for braid closures).
The Axiom of Choice implies countable choice (AC implies DC implies countable choice).
Absolute simplicity means , so each automorphism of is a unique nonzero scalar multiple of the identity (Absolutely simple objects).
The Axiom of Choice is the assumption that every family of nonempty sets has a choice function (The Axiom of Choice).
Proof
Given: The hypotheses in the Statement and [F1]–[F6], [A1]–[A2].
By [F6], the assumed Axiom of Choice supplies countable choice, so [F1]'s closure comparison identifies every in the Statement with the algebraic trace. Fix and put , . Apply [F2] with and to obtain . Naturality of gives , so this is . The exponent sum is unchanged by [F4], hence is invariant under conjugation.
For a positive or negative stabilization, [F3] multiplies by and [F4] changes by . Hence . The scalar is available because [A1] makes the invertible twist a unique ; the positive sign is fixed by [F3]. Thus is invariant under both stabilizations and their inverses.
By [F5], any two braids with equivalent oriented unframed closures are connected by finitely many conjugations, stabilizations, and destabilizations. Steps 1.1 and 2.1 preserve under each such move, so the corrected value depends only on the oriented unframed link type. The Axiom of Choice [A2] is used in [F5] and supplies the countable-choice hypothesis of [F3] by [F6]; no choice is used in the finite trace or scalar calculations.
Correctness and termination of the colored-braid evaluation procedure
Statement
For every valid input of the colored-braid evaluation algorithm, where the braid word has letters and the total tensor-product dimension is , the procedure terminates after exactly crossing-matrix updates and one finite pivotal-trace contraction. It returns the ribbon-category evaluation of that framed colored braid closure in the given matrix realization. The stated bound concerns the number of matrix updates; each update is a finite exact matrix multiplication over the effective field.
Statement references
Facts & Assumptions
Given: A valid effective matrix input, a color-preserving braid word of length , and the algorithm specified above.
The algorithm initializes the identity matrix, multiplies the typed positive or inverse braiding matrix for each word letter, checks final color preservation, and returns the finite contraction (Ribbon evaluation from a colored braid word).
Proof
Given: The hypotheses in the Statement and [F1].
After updates, induction on shows that the running matrix is the composite of the first typed crossing maps in composition order. The base case is the identity of ; the update rule in [F1] composes exactly the next generator or its inverse, proving the induction step. There are precisely letters, so there are precisely updates.
At , [F1] identifies the matrix with . Its final-color check makes it an endomorphism of , and the output contraction is the categorical pivotal trace of that endomorphism, hence the defined closure evaluation. Every update is one finite matrix multiplication and the last contraction is finite; the effective-field procedures terminate, so the algorithm terminates and has the asserted value.
The fundamental quantum sl2 ribbon trace matches the Hecke and bracket evaluations
Statement
Assume the Axiom of Countable Choice. Let be an indeterminate, , , and . Use the fundamental module, positive crossing, duality maps, and twist fixed in the preceding definition. For every and , let be the categorical ribbon trace of its blackboard-framed closure and let be its exponent sum. With and , the exact identities are Here is the normalized type-A Hecke Markov trace with braid generator sent to , and is the Kauffman bracket in the fixed crossing chart. The second identity is a value-by-value normalization formula; it does not by itself assert a Jones-polynomial specialization.
Statement references
Fundamental module matrices, duality, and twist
Categorical braid-closure trace
Framed tangle evaluator and generator assignments
Ribbon trace as framed-closure evaluation
Hecke–bracket trace dictionary
Kauffman bracket chart and state sum
Positive Artin crossing convention
Korinman, Finite presentations for stated skein algebras and lattice gauge field theory, §2.1
Snyder and Tingley, The half-twist for representations, §§3–5
Kauffman, Combinatorial Knot Theory and the Jones Polynomial, §2
Facts & Assumptions
Given: is indeterminate, , , and the fundamental ribbon module with its stated basis, braiding, and duality maps.
The fundamental module has the displayed positive braiding matrix and scalar twist (The fundamental quantum sl2 module in the Kauffman-bracket ribbon convention).
Its self-dual evaluation and coevaluation are the maps whose closed-loop value is (The fundamental quantum sl2 module in the Kauffman-bracket ribbon convention).
The ribbon evaluation of the -colored closed braid is the left categorical trace (The ribbon evaluation of an -colored closed braid).
The Kauffman bracket chart has the over-strand from southwest to northeast, its A-smoothing joins left endpoints, its B-smoothing joins top endpoints, and the loop value is (Kauffman bracket smoothing and loop value).
The positive Artin half twist has label pass below the midpoint and label pass above, and its over/under projected tangents are and in the stated projection coordinates (Oriented crossing signs, diagram writhe, and blackboard framing).
The Hecke–bracket trace dictionary states for , , and (Hecke–bracket trace dictionary and local descent).
The braid exponent sum is a homomorphism with (The exponent sum of a braid).
The Axiom of Countable Choice, , selects an element from every countable family of nonempty sets (The Axiom of Countable Choice ()).
Under , the framed tangle evaluator is monoidal, sends crossings to braidings and cups and caps to the chosen duality maps, and assigns equal values to framed-isotopic tangles (A ribbon object defines a unique framed-tangle evaluation functor).
Under , the categorical ribbon trace equals the framed tangle evaluation of the blackboard-framed closure (The ribbon trace equals the framed-closure evaluation).
Proof
Given: The data in the Statement and [A1], [F1]–[F9].
In the ordered basis of [F1], direct subtraction gives . Writing and , shows entrywise that . Hence and . The explicit snake equalities in [F2] give the adjacent tensor relations: because the middle composites and then are identities; the reversed calculation gives . Distant placements commute because they act on disjoint tensor factors.
Use source coordinates with their standard positive orientation and positive projection coordinates on the braid box. For , the map has determinant . It sends the source over direction to and the source under direction to , whose determinant is . The source left/right pairs have constant , hence constant braid position and give the through pairing ; the source top/bottom pairs have constant , hence constant braid time and give the cup-cap . The displayed page coordinates reverse the positive projection orientation; their visual quarter-turn is not the orientation comparison. Thus the A/B crossing expansion is . Its inverse is , since their product is . By [A1] and [F8]–[F9], the categorical ribbon trace is the framed tangle evaluation of this braid closure, and that evaluator is monoidal with the stated crossing and duality maps. Expanding a braid word into the two smoothing choices therefore gives the bracket weights in [F4]. Because the closure has strands, each complete smoothing is a nonempty closed 1-manifold, hence a union of at least one circle. Its categorical value is by monoidality in [F8] and the loop value [F2], whereas the bracket state sum uses ; the extra single factor is independent of the state. Thus .
The matrix trace in [F3] closes the tensor-word braid with the duality maps of [F2]. Substituting each crossing into the trace expansion from step 2.1 therefore gives the first identity in the Statement. The Hecke formula [F6] then yields . By [F7], . The twist in [F1] is , so multiplying by gives the second displayed identity. The only choice assumption is [A1], used in step 2.1 to invoke the published trace-to-closure identification; no stronger choice principle or division by is used. Since is indeterminate, the specialization is taken in the rational-function field where .
4 · Examples, counterexamples and false statements
None yet.
Sources
- V. G. Turaev, Quantum Invariants of Knots and 3-Manifolds, Chapter I, Theorem 2.5 and §§3–4
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, §§8.9–8.10
- Julien Korinman, Finite presentations for stated skein algebras and lattice gauge field theory, Algebraic & Geometric Topology 23 (2023), §2.1, subsection “Relation with Uqsl2 and Oq[SL2]”, printed pp. 1256–1257 (PDF pp. 10–11)
- Noah Snyder and Peter Tingley, The half-twist for U_q(g) representations, Algebra & Number Theory 3 (2009), §§3–5, printed pp. 810–830
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, §8.3.13 and §§8.9–8.10
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, §8.10
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, §8.10, formula (8.35) and the normalized RT invariant
- V. G. Turaev, Quantum Invariants of Knots and 3-Manifolds, Chapter I, §§1.5 and 2.7
- Louis H. Kauffman, Combinatorial Knot Theory and the Jones Polynomial, arXiv:2204.12104v2, §2