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.

✓ 7 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Yang–Baxter Operators and Quantum Braid Representations — Examples

1 · Prerequisites

2 · Summary

These entries test the definitions and theorems of the companion page against small explicit models. The zero endomorphism of a one-dimensional space solves the cubic equation but is not invertible, showing that invertibility in the definition of a Yang–Baxter operator is not redundant and that the braid group cannot act through a non-invertible matrix. On graded vector spaces the diagonal operator R(eg⊗eh)=χ(g,h)eh⊗eg is an invertible Yang–Baxter operator for an arbitrary coefficient function χ:G×G→k×, with involutivity exactly when χ(g,h)χ(h,g)=1; the one-dimensional operator R=2 over Q is the basic non-involutive example, with one-dimensional braid characters that do not factor through the symmetric groups, while the flip operator on kn produces the place-permutation representation.

The last three entries turn to the trace and its normalization. A braiding alone is shown not to define a link trace, since the closure needs duality and the pivotal comparison j=uθ. Over a field k of characteristic ≠2, in the super vector spaces with the sign braiding and the parity twist the odd line has twist eigenvalue −1, so the unnormalized trace takes different values on a one-braid and its positive stabilization even though both close to the unknot; multiplying by λ−w cancels the kink and restores the invariant predicted by the writhe-normalized theorem.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6.1-sol)Open item page →

A non-invertible solution of the Yang–Baxter equation does not represent the braid group

Statement refuted

The claim refuted is: every solution of the Yang–Baxter equation on an object gives a representation of the braid group. Take C=Vectk, X=k one-dimensional, and R=0, the zero endomorphism of X⊗X≅k. The cubic relation holds because both sides are zero, so the cubic equation alone does not force invertibility. But R is not invertible, so for n≥2 the local operators Ri=0 are not automorphisms of X⊗n, and the assignment σi↦Ri cannot define a homomorphism Bn→Aut⁡(X⊗n): a Yang–Baxter operator in the sense of Yang–Baxter operators on an object is required to be invertible, and a homomorphism from a group lands in a group. The zero operator therefore witnesses, for every braid group with at least two strands, that invertibility in the definition of a Yang–Baxter operator is not redundant.

Facts & Assumptions

Given: n≥2, the field k, the one-dimensional vector space X=k, the object X⊗X≅k, the zero endomorphism R=0 of X⊗X, and the defining cubic equation of Yang–Baxter operators on an object read using the canonical associativity identifications in Vectk.

[L1]

A Yang–Baxter operator on X is an invertible morphism R ⁣:X⊗X→X⊗X satisfying (R⊗1X)(1X⊗R)(R⊗1X)=(1X⊗R)(R⊗1X)(1X⊗R) (Yang–Baxter operators on an object).

[F1]

In Vectk the tensor product X⊗X is again one-dimensional, hence nonzero, and the zero endomorphism of a nonzero vector space is not invertible: from 0∘f=id⁡ one gets id⁡=0, which fails on a nonzero vector.

Counterexample

The witness is the pair (X,R)=(k,0).

1.1L1givenalgebra

The cubic equation holds for R=0. Every factor in both composites (R⊗1X)(1X⊗R)(R⊗1X) and (1X⊗R)(R⊗1X)(1X⊗R) is a tensor product containing the zero morphism R; a composite with a zero factor is zero, so both sides are the zero endomorphism of X⊗X⊗X and the cubic relation holds.

1.2F1algebra

The morphism R is not invertible. By [F1] the object X⊗X is nonzero and 0 has no inverse as an endomorphism of it. The local operator Ri=1⊗(i−1)⊗R⊗1⊗(n−i−1) is the tensor product of R=0 with identities, hence is the zero endomorphism of the nonzero object X⊗n, so it too has no inverse.

2.1step 1.2given

No braid-group representation arises. The assignment σi↦Ri does not even land in Aut⁡(X⊗n), because Ri=0 is not invertible by step 1.2. Moreover there is no homomorphism ρ ⁣:Bn→End⁡(X⊗n) with ρ(σi)=Ri: from σiσi−1=1 one would get Riρ(σi−1)=id⁡, contradicting Riρ(σi−1)=0. So the non-invertible solution R=0 of the cubic equation gives no representation of the braid group.

3.1step 1.1step 2.1∎

Conclusion. The zero solution satisfies the Yang–Baxter equation but is not a Yang–Baxter operator in the sense of [L1], and it produces no braid-group action; the claim that the cubic equation alone suffices is therefore refuted, and invertibility is a genuine part of the definition.

Remarks

The group B1 has no braid generator, so its trivial action exists independently of the chosen cubic-equation solution. The counterexample concerns n≥2.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

A diagonal Yang–Baxter operator on graded vector spaces

Example

Let G be an abelian group, let χ ⁣:G×G→k× be any function into the units of a field k, and let X=⨁g∈Gkeg be the free G-graded vector space, a direct sum with one basis vector per group element. Define a linear map

R ⁣:X⊗X⟶X⊗X,R(eg⊗eh)=χ(g,h) eh⊗eg.

Then R is invertible, with R−1(eh⊗eg)=χ(g,h)−1eg⊗eh, and R is a Yang–Baxter operator on X: both sides of the cubic relation send eg⊗eh⊗el to χ(g,h)χ(g,l)χ(h,l) el⊗eh⊗eg, and the two scalar products agree because k× is commutative. Hence A Yang–Baxter operator gives braid-group representations gives representations ρn ⁣:Bn→Aut⁡(X⊗n) with ρn(σi) acting by scalar-weighted permutations of the graded basis. If χ(g,h)χ(h,g)=1 for all g,h, then R2=1 and the actions factor through the symmetric groups; if χ(h,h)2≠1 for some h with keh≠0, then R2(eh⊗eh)=χ(h,h)2eh⊗eh shows that R is not involutive.

Facts & Assumptions

Given: an abelian group G, a field k, a function χ ⁣:G×G→k×, the G-graded vector space X=⨁g∈Gkeg, and the linear map R of the statement.

[L1]

A Yang–Baxter operator on X is an invertible R ⁣:X⊗X→X⊗X satisfying the cubic equation of Yang–Baxter operators on an object using the canonical associativity identifications in Vectk.

[L2]

A Yang–Baxter operator on X yields homomorphisms ρn ⁣:Bn→Aut⁡(X⊗n) with ρn(σi) the local operator of R (A Yang–Baxter operator gives braid-group representations).

[F1]

The symmetric group has the Coxeter presentation with generators si and relators si2=1, the braid relations and distant commutativity (The symmetric group has the Coxeter presentation), and von Dyck's theorem extends a relator-respecting generator assignment uniquely (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

Verification

1.1L1givenalgebra

Invertibility. Define R−1 on the graded basis by R−1(eh⊗eg):=χ(g,h)−1eg⊗eh and extend linearly. Then R(R−1(eh⊗eg))=χ(g,h)−1R(eg⊗eh)=eh⊗eg and R−1(R(eg⊗eh))=χ(g,h)R−1(eh⊗eg)=eg⊗eh, so R and R−1 are mutually inverse linear bijections.

1.2L1givenalgebra

The cubic relation. Applying the left-hand composite (R⊗1X)(1X⊗R)(R⊗1X) to eg⊗eh⊗el, from right to left, produces first χ(g,h)eh⊗eg⊗el, then χ(g,l)eh⊗el⊗eg, then χ(h,l)el⊗eh⊗eg. Applying the right-hand composite (1X⊗R)(R⊗1X)(1X⊗R) produces first χ(h,l)eg⊗el⊗eh, then χ(g,l)el⊗eg⊗eh, then χ(g,h)el⊗eh⊗eg. Both sides therefore act on eg⊗eh⊗el by multiplication by χ(g,h)χ(g,l)χ(h,l), and these scalars are equal in the commutative group k×; since the pure tensors of graded basis vectors span X⊗3, the cubic equation holds.

2.1L1L2step 1.1step 1.2

The braid-group actions. By steps 1.1 and 1.2 the map R is an invertible solution of the cubic equation, hence a Yang–Baxter operator on X in the sense of [L1], and [L2] gives the homomorphisms ρn with ρn(σi) acting on the graded basis by exchanging the i-th and (i+1)-st entries with the scalar χ attached to the two exchanged degrees.

2.2L1L2F1step 1.2algebra

Involutivity criterion. On a pure tensor, R2(eg⊗eh)=R(χ(g,h)eh⊗eg)=χ(g,h)χ(h,g)eg⊗eh, so R2=1X⊗X if and only if χ(g,h)χ(h,g)=1 for every pair (g,h) with keg,keh≠0. If this holds, then each local operator satisfies Ri2=1 (it is a tensor product of identities with R2) and the Ri satisfy the braid relations, so the assignment si↦Ri respects the Coxeter relators of Sn and [F1] gives homomorphisms ψn ⁣:Sn→Aut⁡(X⊗n) with ρn=ψn∘πn; the actions factor through the symmetric groups. If instead χ(h,h)2≠1 for some h with keh≠0, then R2(eh⊗eh)=χ(h,h)2eh⊗eh≠eh⊗eh, so R2≠1X⊗X and R is not involutive.

3.1step 1.1step 1.2step 2.1step 2.2∎

Conclusion. The diagonal map R(eg⊗eh)=χ(g,h)eh⊗eg is always an invertible Yang–Baxter operator on the free graded vector space, its square is the diagonal map with coefficients χ(g,h)χ(h,g), and it is involutive exactly when those coefficients are 1. All computations are on a spanning set of pure tensors and use no choice principle.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

A non-involutive one-dimensional Yang–Baxter operator

Example

Over k=Q, let X=Qe be one-dimensional and put R(e⊗e)=2 e⊗e. Then R is invertible, with inverse multiplication by 12, and satisfies the Yang–Baxter equation: both sides act on the single basis vector e⊗e⊗e of X⊗3 by multiplication by 8. The representation of A Yang–Baxter operator gives braid-group representations on X⊗n is therefore one-dimensional, with ρn(σi)=2 for every i, so ρn(β)=2w(β) with w the exponent sum (Exponent sum and writhe of a braid). Since R2=4, the operator is not involutive: by An involutive Yang–Baxter operator factors through the symmetric group the two-strand action does not factor through S2, and in fact no ρn with n≥2 factors through Sn, because a factorization would force ρn(σi)2=1 while ρn(σi)2=4. The character Bn→Q×, β↦2w(β), is a genuine non-involutive braid character, and for n≥2 it fails symmetric-group factorization; its one-strand action is trivial. It separates the two Markov stabilizations since w shifts by ±1 there.

Facts & Assumptions

Given: the field k=Q, the one-dimensional vector space X=Qe, and the endomorphism R of X⊗X with R(e⊗e)=2 e⊗e.

[L1]

A Yang–Baxter operator on X is an invertible R ⁣:X⊗X→X⊗X satisfying the cubic equation (Yang–Baxter operators on an object); it yields homomorphisms ρn ⁣:Bn→Aut⁡(X⊗n) sending σi to the local operator at position i (A Yang–Baxter operator gives braid-group representations).

[L2]

If ρ2 factors through π2 ⁣:B2→S2, then R2=1X⊗X; more generally, if ρn factors through πn for some n≥2, then Ri2=1X⊗n for every i (An involutive Yang–Baxter operator factors through the symmetric group).

[F1]

The exponent sum w ⁣:Bn→Z is additive on Artin words and w(σi±1)=±1 (Exponent sum and writhe of a braid); in particular ρn(β)=2w(β) for a one-dimensional representation with ρn(σi)=2.

Verification

1.1L1givenalgebra

Invertibility and the cubic equation. Multiplication by 2 on the one-dimensional space X⊗X≅Q is invertible with inverse multiplication by 12. Both the left- and the right-hand side of the cubic equation are, on the single basis vector e⊗e⊗e of the one-dimensional space X⊗3, multiplication by 2⋅2⋅2=8; hence they agree, and R is a Yang–Baxter operator on X in the sense of [L1].

2.1L1F1step 1.1

The one-dimensional braid character. Since X⊗n is one-dimensional, each local operator Ri is multiplication by 2, so [L1] gives ρn(σi)=2 for every i, and additivity of the exponent sum [F1] on Artin words gives ρn(β)=2w(β) for every β∈Bn.

3.1L2F1step 2.1algebra

Non-involutivity and failure of factorization. From R2(e⊗e)=4 e⊗e we get R2=4⋅1X⊗X≠1X⊗X. By [L2] the two-strand action ρ2 does not factor through π2. For any n≥2, if ρn factored through πn then [L2] would give Ri2=1X⊗n; but Ri2 is multiplication by 4 on the one-dimensional space X⊗n, so Ri2≠1. Hence no ρn with n≥2 factors through Sn; for n=1 the braid and symmetric groups are trivial and the action factors through them, and the character of step 2.1 is a genuine non-involutive braid character. Finally, since w(ιn(β)σn±1)=w(β)±1, the values 2w on the two stabilizations of a braid differ by a factor 4, so the character separates them.

4.1step 1.1step 2.1step 3.1∎

Conclusion. The one-dimensional operator R=2⋅id⁡ is an invertible, non-involutive solution of the Yang–Baxter equation, and its braid actions are the one-dimensional characters 2w that, for n≥2, do not factor through the symmetric groups. All computations are finite and use no choice principle.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The flip operator gives the permutation representation

Example

Take C=Vectk, X=kn for n≥0, with standard basis e1,…,en, and R(ei⊗ej)=ej⊗ei. Then R2=1 and R is a Yang–Baxter operator on X: both sides of the cubic relation act on ei⊗ej⊗el by the permutation of the three basis vectors reversing the order. By An involutive Yang–Baxter operator factors through the symmetric group the action ρm ⁣:Bm→Aut⁡(X⊗m) of A Yang–Baxter operator gives braid-group representations factors through Sm, and on the basis ei1⊗⋯⊗eim the generator σj acts by exchanging the entries in positions j and j+1. Thus ρm is the place-permutation representation of Bm through Sm: for m=2 and n≥2, R swaps e1⊗e2 with e2⊗e1 and fixes e1⊗e1 and e2⊗e2.

For m=0,1, use the trivial action on X⊗m, with X⊗0=k; it is also the place-permutation action of the trivial group Sm. If n=0 and m≥1, the tensor power is the zero space and its unique automorphism is its identity, so the same conclusion holds.

Facts & Assumptions

Given: the field k, the vector space X=kn with basis e1,…,en, and the linear flip R(ei⊗ej)=ej⊗ei on X⊗X.

[L1]

A Yang–Baxter operator on X is an invertible R ⁣:X⊗X→X⊗X satisfying the cubic equation (Yang–Baxter operators on an object), and it gives homomorphisms ρm ⁣:Bm→Aut⁡(X⊗m) with ρm(σj) the local operator at position j (A Yang–Baxter operator gives braid-group representations).

[L2]

If R2=1X⊗X, then for every m≥2 the homomorphism ρm factors through πm ⁣:Bm→Sm, and ψm(sj)=ρm(σj) (An involutive Yang–Baxter operator factors through the symmetric group).

Verification

1.1L1givenalgebra

The flip is an involutive Yang–Baxter operator. On the basis, R2(ei⊗ej)=R(ej⊗ei)=ei⊗ej, so R2=1X⊗X. For the cubic relation, the left-hand composite applied to ei⊗ej⊗el reverses the order of the three factors: R⊗1 exchanges the first two, then 1⊗R exchanges the last two, then R⊗1 the first two, giving el⊗ej⊗ei; the right-hand composite produces the same by the mirror computation. Since the pure tensors span X⊗3, the cubic equation holds and R is a Yang–Baxter operator on X.

2.1L1step 1.1

The action on pure tensors. For m≥2, by [L1] the local operator at position j is 1⊗(j−1)⊗R⊗1⊗(m−j−1), which on the basis vector ei1⊗⋯⊗eim exchanges the entries in positions j and j+1; thus each ρm(σj) is the corresponding place permutation.

3.1L2step 1.1step 2.1

Factorization and identification of the representation. By [L2] and R2=1 the action ρm factors as ψm∘πm with ψm(sj)=ρm(σj); by step 2.1 the value ψm(sj) is the place permutation exchanging positions j and j+1. Since the sj generate Sm, ψm is the place-permutation representation of Sm on X⊗m, and ρm is that representation composed with πm.

4.1step 1.1step 3.1given

The two-strand case. For m=2 and n≥2 the operator R swaps e1⊗e2 with e2⊗e1 and fixes ei⊗ei for i=1,2; this is the place-permutation representation of S2, in agreement with step 3.1.

5.1step 1.1step 3.1step 4.1∎

Conclusion and small strand counts. For m=0,1, the braid and symmetric groups are trivial and their actions send the sole element to the identity, the place permutation on X⊗m. If n=0 and m≥1, the tensor power is zero and its unique endomorphism is its identity. The flip operator is an involutive Yang–Baxter operator, and its braid actions are exactly the place-permutation representations of the symmetric groups, pulled back along the canonical surjections Bm→Sm. All computations are finite and linear and use no choice principle.

CounterexampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The unnormalized ribbon trace is not an unframed Markov invariant

Statement refuted

The claim refuted is: the unnormalized ribbon evaluation tn(β) is invariant under Markov stabilization, hence defines an invariant of oriented unframed links. Assume ACω (The Axiom of Countable Choice (ACω)). Take k of characteristic ≠2 and let C be the category of Z/2-graded finite-dimensional vector spaces with the sign braiding c(v⊗w)=(−1)∣v∣∣w∣w⊗v and the twist θV=(−1)∣v∣v on homogeneous vectors, which makes C a ribbon category. Let X be the odd one-dimensional object, so End⁡(X)=k and θX=−id⁡X, giving λ=−1. Then The scalar twist controls the two Markov stabilizations gives

t2(σ1)=λ t1(e)=−t1(e),

while the closures of e∈B1 and of σ1∈B2 are both the unknot, the second being the positive stabilization of the first. Since t1(e)=Tr⁡L(jX)=dX=1≠0, the two values 1 and −1 differ, so the unnormalized trace is not invariant under positive stabilization and is not an unframed link invariant; writhe normalization is required, as in the companion example.

Facts & Assumptions

Given: ACω; a field k with char⁡k≠2, the category C of Z/2-graded finite-dimensional vector spaces with the sign braiding and the parity twist, and the odd one-dimensional object X.

[L1]

A twist on a braided rigid monoidal category is a natural automorphism θ of the identity with θV⊗W=(θV⊗θW)cW,VcV,W and dual-compatibility (θV)∨=θV∨; a ribbon category is a braided rigid monoidal category with a twist (Twist and ribbon structure).

[L2]

Assume End⁡(1)=k and X absolutely simple, so θX=λid⁡X with λ∈k×; then tn+1(ιn(β)σn±1)=λ±1tn(β) (The scalar twist controls the two Markov stabilizations, Absolutely simple objects); that lemma is stated under countable choice (The Axiom of Countable Choice (ACω)), which is assumed here.

[L3]

The positive stabilization of e∈B1 is σ1∈B2, and a stabilization preserves the oriented closure up to ambient isotopy: the closures of a braid and of its stabilizations are equivalent oriented links (Markov conjugation and stabilization moves, Markov moves preserve the oriented closure up to isotopy, The closure of a geometric braid).

[F1]

The ribbon evaluation is tn(β)=Tr⁡L(jX⊗nρn(β)) with j=uθ; for n=1 and the trivial braid e, t1(e)=Tr⁡L(jX)=dX, the categorical dimension of X (The scalar twist controls the two Markov stabilizations and the defining formula of the ribbon evaluation).

Counterexample

1.1L1givenalgebra

The model is a ribbon category. The usual graded duals of finite-dimensional spaces give rigidity. The sign braiding is a symmetric braiding, so it is in particular braided; the parity twist is a natural automorphism of the identity, and on homogeneous vectors θV⊗W=(−1)∣v∣+∣w∣ equals (θV⊗θW)cW,VcV,W because the double braiding is the identity; the dual of a homogeneous space has the same parity, so θV∨=(θV)∨. Hence [L1] makes C a ribbon category.

1.2L1F1L2givenalgebra

The odd line and its twist eigenvalue. The odd one-dimensional space X has End⁡(X)=k, so it is absolutely simple, and θX=−id⁡X, so λ=−1∈k× because char⁡k≠2. Its categorical dimension is dX=t1(e)=1: the defining composite of [F1] is Tr⁡L(jX) with jX=uXθX, and on the odd line the Drinfeld morphism is uX=−id⁡X while θX=−id⁡X, so jX=id⁡X and dX=Tr⁡L(id⁡X)=1.

2.1L2step 1.2algebra

The two values differ. By [L2] applied to β=e∈B1 and its positive stabilization σ1∈B2, t2(σ1)=λ t1(e)=(−1)⋅1=−1, while t1(e)=1 by step 1.2. The two values differ.

3.1L3step 2.1given

The closures are the same oriented link. By [L3] the closures of e and of its stabilization σ1 are equivalent oriented links; both are the unknot, the closure of σ1 being a one-component diagram with a single positive kink. If the unnormalized evaluation were an invariant of oriented unframed links, it would take equal values on the closures of e and σ1; step 2.1 shows that it does not.

4.1step 1.1step 1.2step 2.1step 3.1∎

Conclusion. The unnormalized ribbon trace takes the values −1 and 1 on two braids whose closures are equivalent oriented links, so it is not invariant under positive stabilization and not an unframed link invariant; the writhe factor is necessary, as the companion example shows. All computations are finite; the only choice principle used is ACω, consumed through the stabilization lemma [L2].

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Writhe normalization cancels a ribbon kink

Example

Assume the Axiom of Choice. In the ribbon category of Z/2-graded finite-dimensional vector spaces over a field k of characteristic ≠2 with the sign braiding and the parity twist, let X be the odd one-dimensional object, so λ=θX=−1 and dX=Tr⁡L(jX)=1. For β=e∈B1 and its positive stabilization σ1∈B2, The scalar twist controls the two Markov stabilizations gives t1(e)=1 and t2(σ1)=(−1) t1(e)=−1, so the unnormalized values differ by the factor λ−1=−1. The exponent sums are w(e)=0 and w(σ1)=1 (Exponent sum and writhe of a braid), so the normalized values

JX(e^)=λ−0t1(e)=1,JX(σ1^)=λ−1t2(σ1)=(−1)−1⋅(−1)=1

agree: the writhe factor cancels the kink and produces the invariant of the unframed unknot predicted by The writhe-normalized ribbon trace is an unframed link invariant. The common value is 1 here; since dX=1 is a unit, the further normalization dX−1JX is trivial and also gives 1 on the unknot.

Facts & Assumptions

Given: AC; the field k with char⁡k≠2; the category of Z/2-graded finite-dimensional vector spaces with the sign braiding and the parity twist; its odd one-dimensional object X; the braid e∈B1 and its positive stabilization σ1∈B2.

[L1]

The model is a ribbon category with End⁡(1)=k and X absolutely simple, θX=λid⁡X, so the stabilization lemma gives tn+1(ιn(β)σn±1)=λ±1tn(β); that lemma is stated under countable choice, which AC supplies here (AC implies DC implies countable choice); in this model λ=−1 and the odd line has dX=Tr⁡L(jX)=1, so t1(e)=1 and t2(σ1)=−1 (The scalar twist controls the two Markov stabilizations, Absolutely simple objects).

[F1]

A ribbon twist satisfies balancing and dual-compatibility (Twist and ribbon structure); the Drinfeld composite and left trace are those of A braided rigid category has a Drinfeld morphism and The categorical trace of a morphism into the double dual.

[F2]

The trivial one-braid closes to the unknot, and stabilization preserves its oriented closure under countable choice (The closure of a geometric braid, Markov moves preserve the oriented closure up to isotopy). AC supplies that choice assumption as recorded in [L1].

[L2]

The exponent sum satisfies w(σ1)=w(ι1(e)σ1)=w(e)+1=1 and w(e)=0 (Exponent sum and writhe of a braid); the positive stabilization is β↦ιn(β)σn (Markov conjugation and stabilization moves).

[L3]

Assume AC: the writhe-normalized trace JX(β^)=λ−w(β)tn(β) is an invariant of oriented unframed link types of closures (The writhe-normalized ribbon trace is an unframed link invariant, The Axiom of Choice).

Verification

1.1F1givenalgebra

Verify the model and dimension. Even linear maps and graded duals give the rigid k-linear category, with the ordinary evaluation and basis coevaluation satisfying the zig-zags. The sign braiding is natural; its hexagons are (−1)p(q+r)=(−1)pq(−1)pr and the analogous identity in the first variable, and its square is the identity. Parity is natural, multiplicative on tensor products and unchanged on duals, so it is a ribbon twist by [F1]. The odd line has only scalar endomorphisms and twist −1. For a dual basis e,e∨, the Drinfeld composite gives uX(e)=−e∨∨, hence jX(e)=e∨∨; coevaluation 1↦e⊗e∨ and evaluation e∨∨⊗e∨↦1 give dX=1.

1.2L2given

The writhe exponents. The trivial one-braid has exponent sum w(e)=0, and its positive stabilization σ1 has w(σ1)=1 by [L2].

2.1L1L2F2step 1.1given

The unnormalized values and the kink. By [L1], t1(e)=1 and t2(σ1)=λt1(e)=−1. By [F2], the closures both represent the unknot, so the unnormalized evaluation changes by the factor −1 under the positive stabilization, the kink contribution modelled by the scalar twist λ=−1.

3.1L3step 2.1step 1.2algebra

The normalized values agree. Substituting steps 2.1 and 1.2, JX(e^)=λ−w(e)t1(e)=(−1)0⋅1=1,JX(σ1^)=λ−w(σ1)t2(σ1)=(−1)−1⋅(−1)=1. The two normalized values are equal, in accordance with [L3].

4.1step 2.1step 1.2step 3.1∎

Conclusion. The writhe factor λ−w cancels exactly the kink contribution λ contributed by the stabilization, so the normalized evaluation is the same on the closure of e and on its positive stabilization, as the invariant theorem predicts; the common value is 1, and the dimension normalization by dX=1 is trivial here. All computations are finite; the Axiom of Choice is assumed through [L3] and supplies the countable-choice input to [L1], as recorded there.

Sources