Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Ribbon categories and Reshetikhin–Turaev knot invariants — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Flip-category colored unlink and braid evaluations

Example

Let k be a field and let V be a d-dimensional finite-dimensional vector space with the ribbon structure of finite-dimensional vector spaces, ordinary flip braiding, standard duality, and trivial twist. For each n≥1 and β∈Bn, put W=V⊗n, let ρ(β) be the braid action, and let jW:W→W∨∨ be the ribbon-induced pivotal comparison. Define the finite blackboard-framed braid-closure value by the categorical trace tnV(β)=Tr⁡L(jWρ(β)). Then tnV(β)=dc(π(β)), where π:Bn→Sym⁡({1,…,n}) is the homomorphism π(σi)=(i i+1) and c(π(β)) is the number of cycles in its disjoint-cycle decomposition, including fixed points as one-cycles. Thus the one-component unknot has value d, the two-component unlink has value d2, and the closure of the positive generator σ1∈B2 has value d.

The two-strand positive generator used in the last calculation is shown schematically below; its endpoint permutation is the transposition (1 2).

12

Facts & Assumptions

Given: The vector space V, the flip ribbon structure, n≥1, and a braid β∈Bn.

[F1]

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).

[F2]

The Drinfeld morphism in a braided rigid category is given by the evaluation–braiding–coevaluation composite (A braided rigid category has a Drinfeld morphism).

[F3]

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).

[F4]

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.

[F5]

A generator assignment on Bn 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

technique · direct

Given: The data in the Example and [F1]–[F5].

1.1F1F2F4F5givenconstruct

If n=1, the braid group is trivial and π is its unique homomorphism. If n≥2, put si=(i i+1). For ∣i−j∣>1, si and sj commute because they have disjoint supports; for adjacent indices, both sisi+1si and si+1sisi+1 equal (i i+2). 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 W=V⊗n is the factor permutation given by π(β). The twist is identity. Let w1,…,wdn be the tensor basis of W and w1∗,…,wdn∗ its ordinary dual basis. Substitution in [F2]'s formula gives uW(wr)(ws∗)=1 when r=s and 0 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.

2.1F3step 1.1algebra

Fix a basis e1,…,ed of V. A basis tensor ei1⊗⋯⊗ein 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 c(π(β)), including fixed points. There are d independent choices for each cycle, hence exactly dc(π(β)) fixed basis tensors. A permutation matrix has trace equal to its number of fixed basis vectors, proving the formula.

3.1step 2.1givenalgebra∎

The identity in B1 has one permutation cycle, the identity in B2 has two, and σ1 has the transposition permutation with one cycle. Substitution into the formula gives d, d2, and d, respectively; the latter closure is a single component because its endpoint permutation has one cycle. These calculations include d=0 because every listed cycle count is positive.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

A decomposable color with nonscalar twist has no single writhe correction

Statement refuted

Assume the Axiom of Choice. The counterexample uses the following category: objects are finite-dimensional rational vector spaces U with a linear involution SU:U→U satisfying SU2=1U; morphisms f:U→W are rational-linear maps satisfying fSU=SWf, with ordinary addition and scalar multiplication on each morphism space; tensor product has involution SU⊗SW, the unit is Q with identity involution, and associators and unitors are the usual vector-space maps. The braiding is the ordinary flip u⊗w↦w⊗u. The chosen left dual of U is U∗ with involution SU∗=(SU−1)∗, evaluation ev⁡U(f⊗u)=f(u), and coevaluation coev⁡U(1)=∑iei⊗ei for any basis (ei) and its dual basis (ei). The twist is θU=SU. This is a Q-linear ribbon category with End⁡C(Q)=Q. For X=Qe+⊕Qe− with SX=diag⁡(1,−1), the twist is invertible and nonscalar, its one-strand identity ribbon trace is 0, and its positive two-strand stabilization ribbon trace is 2. Therefore no nonzero scalar writhe correction works.

Facts & Assumptions

Given: The false claim in the preceding section, the braid trace convention, and the Axiom of Choice.

[F1]

The ribbon evaluation of an X-colored closed braid is tn(β)=Tr⁡L(jX⊗nρn(β)) with j=uθ (The ribbon evaluation of an X-colored closed braid).

[F2]

The scalar writhe-correction theorem assumes an absolutely simple color whose twist is the scalar λid⁡X with λ≠0 (Scalar twist correction removes the framing).

[F3]

Under the Axiom of Choice, two braids have equivalent oriented closures exactly when related by conjugations, stabilizations, and destabilizations (Markov's theorem for braid closures).

[F4]

A braiding is a natural isomorphism satisfying the two hexagon identities (Braiding).

[F5]

A ribbon twist is natural, obeys the balancing identity, and is compatible with duality (Twist and ribbon structure).

[F6]

Left-dual evaluation and coevaluation satisfy the two snake identities (Left dual and right dual object).

[F7]

The Drinfeld morphism is defined by composing coevaluation, the braiding, and evaluation (A braided rigid category has a Drinfeld morphism).

[F8]

The ribbon-induced pivotal comparison j=uθ is monoidal, with jU⊗W=dU,W(jU⊗jW) (The ribbon evaluation of an X-colored closed braid).

[F9]

Under countable choice, the algebraic ribbon trace equals the blackboard-framed closure evaluation for any color X, without a simplicity or scalar-twist hypothesis (The ribbon trace equals the framed-closure evaluation). AC implies countable choice (AC implies DC implies countable choice).

[A1]

The Axiom of Choice is assumed (The Axiom of Choice).

Counterexample

1.1F1F4F5F6F7givenconstruct

Let C have objects finite-dimensional rational vector spaces U equipped with a linear involution SU (SU2=1), and morphisms commuting with the involutions. Use SU⊗W=SU⊗SW, the ordinary flip braiding, standard vector-space duality, and define θU=SU. This is a ribbon category: the twist is natural because every morphism commutes with S; its tensor rule is SU⊗W=SU⊗SW and the double flip is the identity; and on the dual, SU∗=(SU−1)T=SUT=(θU)∗, giving ribbon dual compatibility. The unit is Q with trivial involution, so End⁡(1)=Q. By [F7], the Drinfeld morphism in this symmetric vector-space category is the canonical double-dual identification: on v∈U and f∈U∗ its evaluation is uU(v)(f)=f(v). Thus the ribbon-induced pivotal map jU=uUθU is the canonical double-dual identification composed with SU.

2.1F1F2F8step 1.1algebra

Take X=Qe+⊕Qe− with SX=diag⁡(1,−1). It is decomposable and its twist is invertible but nonscalar. For the identity e∈B1, [F1] gives t1(e)=Tr⁡(SX)=1+(−1)=0. For σ1∈B2, the braid action is the flip P. By [F8], under the canonical vector-space double-dual comparison, jX⊗X has matrix SX⊗SX, so the trace of (SX⊗SX)P is 2: the basis tensors e+⊗e+ and e−⊗e− contribute diagonal entries 1, while the two mixed basis tensors are exchanged and contribute no diagonal entries.

3.1F2F3F9step 2.1A1algebra∎

By [A1] and [F9], countable choice holds and the traces in step 2.1 are the actual blackboard-framed closure values; the comparison applies to this nonsimple color. The braid σ1 is the positive Markov stabilization of the identity braid in B1, so [F3] says their oriented unframed closures are equivalent. Their exponent sums are w(e)=0 and w(σ1)=1. For any proposed λ∈Q×, the corrected values are 0 and 2λ−1, which are unequal because 2≠0 and λ is invertible. Thus these framed evaluations admit no scalar writhe correction giving an unframed invariant. The counterexample has precisely the missing hypothesis identified by [F2]: its invertible twist is not scalar on the decomposable color.

Sources