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.
Flip-category colored unlink and braid evaluations
Example
Let be a field and let be a -dimensional finite-dimensional vector space with the ribbon structure of finite-dimensional vector spaces, ordinary flip braiding, standard duality, and trivial twist. For each and , put , let be the braid action, and let be the ribbon-induced pivotal comparison. Define the finite blackboard-framed braid-closure value by the categorical trace . Then where is the homomorphism and is the number of cycles in its disjoint-cycle decomposition, including fixed points as one-cycles. Thus the one-component unknot has value , the two-component unlink has value , and the closure of the positive generator has value .
The two-strand positive generator used in the last calculation is shown schematically below; its endpoint permutation is the transposition .
Example references
Colored framed-link evaluation
Colored-braid matrix procedure
Permutations of the strand labels
Artin braid group generators and relations
Extension from a group presentation
Disjoint cycles, including fixed points
Existence and uniqueness of disjoint-cycle decompositions
Turaev, Quantum Invariants of Knots and 3-Manifolds, Chapter I, §§1.5 and 2.5
Facts & Assumptions
Given: The vector space , the flip ribbon structure, , and a braid .
The left categorical trace of a morphism into the double dual is the coevaluation–morphism–evaluation composite (The categorical trace of a morphism into the double dual).
The Drinfeld morphism in a braided rigid category is given by the evaluation–braiding–coevaluation composite (A braided rigid category has a Drinfeld morphism).
Every permutation of a finite set has a disjoint-cycle decomposition, unique up to reordering and cyclic rotation, and fixed points are counted as one-cycles (Every permutation of a finite set is a product of pairwise disjoint cycles, uniquely up to reordering and cyclic rotation, Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type).
In the specified vector-space ribbon structure, each positive and negative braid generator acts by the ordinary flip of the adjacent factors, and the twist is identity.
A generator assignment on that sends every Artin relator to the identity extends to a homomorphism (The braid group by Artin presentation, Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).
Proof
Given: The data in the Example and [F1]–[F5].
If , the braid group is trivial and is its unique homomorphism. If , put . For , and commute because they have disjoint supports; for adjacent indices, both and equal . These are the Artin relators, so [F5] gives the homomorphism . By [F4], each positive or negative braid generator swaps its two adjacent tensor factors, so the action on is the factor permutation given by . The twist is identity. Let be the tensor basis of and its ordinary dual basis. Substitution in [F2]'s formula gives when and otherwise, so the pivotal comparison is the canonical double-dual identification. The categorical trace formula [F1] is therefore the ordinary matrix trace of that permutation operator.
Fix a basis of . A basis tensor is fixed by the factor permutation exactly when its indices are constant on each orbit of ; by [F3], these orbits are exactly the cycles counted by , including fixed points. There are independent choices for each cycle, hence exactly fixed basis tensors. A permutation matrix has trace equal to its number of fixed basis vectors, proving the formula.
The identity in has one permutation cycle, the identity in has two, and has the transposition permutation with one cycle. Substitution into the formula gives , , and , respectively; the latter closure is a single component because its endpoint permutation has one cycle. These calculations include because every listed cycle count is positive.
Depends on
- The categorical trace of a morphism into the double dual
- The braid group by Artin presentation
- The symmetric group $\operatorname{Sym}(X)$: the bijections of a set $X$ under composition
- Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group
- Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type
- Every permutation of a finite set is a product of pairwise disjoint cycles, uniquely up to reordering and cyclic rotation
- A braided rigid category has a Drinfeld morphism
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- V. G. Turaev, Quantum Invariants of Knots and 3-Manifolds, Chapter I, §§1.5 and 2.5 (standard reference, not scraped)