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.
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.
Depends on
- Colored framed-link evaluation from a ribbon category
- The ribbon evaluation of an $X$-colored closed braid
- The ribbon trace equals the framed-closure evaluation
- The scalar twist controls the two Markov stabilizations
- Absolutely simple objects
- Exponent sum and writhe of a braid
- Basic properties of the categorical trace
- Markov's theorem for braid closures
- The Axiom of Choice
- AC implies DC implies countable choice
Used by
Dependency tree · two levels
39 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
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, §8.10, formula (8.35) and the normalized RT invariant (standard reference, not scraped)
- V. G. Turaev, Quantum Invariants of Knots and 3-Manifolds, Chapter I, §§1.5 and 2.7 (standard reference, not scraped)