Alphabeta Math
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.

✓ 20 results · all verified · 12 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 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Duality and Rigidity in Monoidal Categories

1 · Prerequisites

2 · Summary

This page keeps three distinctions sharp. Left and right duals are different data in a general monoidal category; a categorical trace is first typed on a morphism into a double dual rather than on an arbitrary endomorphism; and rigidity alone is weaker than the tensor-category hypotheses used later in the track.

The route is duality first, then rigidity and concrete vector-space witnesses, then functorial duality and the Drinfeld morphism, and only then the trace-pivotal-ribbon ladder. The tensor-category setting for spherical structures and the equality of their traces continues on tensor-and-fusion-categories. The false statements at the end are there to stop the common collapses: braiding is not yet trace, pivotal data can vary, and left and right duals need not coincide.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Left dual and right dual object

Definition

Let (C,⊗,1,α,λ,ρ) be a monoidal category and let X be an object of C.

A left dual of X is an object X∨ together with morphisms

ev⁡X:X∨⊗X→1,coev⁡X:1→X⊗X∨

such that the composites

X→λX−11⊗X→coev⁡X⊗1X(X⊗X∨)⊗X→αX,X∨,XX⊗(X∨⊗X)→1X⊗ev⁡XX⊗1→ρXX

and

X∨→ρX∨−1X∨⊗1→1X∨⊗coev⁡XX∨⊗(X⊗X∨)→αX∨,X,X∨−1(X∨⊗X)⊗X∨→ev⁡X⊗1X∨1⊗X∨→λX∨X∨

are identity morphisms.

A right dual of X is an object ∨X together with morphisms

ev⁡X′:X⊗∨X→1,coev⁡X′:1→∨X⊗X

such that the mirror composites

X→ρX−1X⊗1→1X⊗coev⁡X′X⊗(∨X⊗X)→αX,∨X,X−1(X⊗∨X)⊗X→ev⁡X′⊗1X1⊗X→λXX

and

∨X→λ∨X−11⊗∨X→coev⁡X′⊗1∨X(∨X⊗X)⊗∨X→α∨X,X,∨X∨X⊗(X⊗∨X)→1∨X⊗ev⁡X′∨X⊗1→ρ∨X∨X

are identity morphisms.

This page uses EGNO's convention: the word "left" refers to the side on which the dual object sits in the evaluation map.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The zig-zag identities

Definition

For a left dual (X∨,ev⁡X,coev⁡X) of X, the two identity composites in Left dual and right dual object are called the zig-zag identities or snake identities for the pair (X∨,X).

For a right dual (∨X,ev⁡X′,coev⁡X′) of X, the corresponding mirror composites are the zig-zag identities for the pair (X,∨X).

Thus a dual object is exactly duality data together with the relevant pair of zig-zag identities.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

What 'left' refers to in 'left dual'

Remark

In this library, following EGNO, a left dual X∨ of X is named by the side on which X∨ appears in the evaluation map X∨⊗X→1. Some sources name duals by the side on which the original object is adjoint instead; that convention reverses the words "left" and "right" relative to this page.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A left dual of an object has that object as a right dual

Statement

If X∨ is a left dual of an object X, then X is a right dual of X∨. Dually, if ∨X is a right dual of X, then X is a left dual of ∨X.

Facts & Assumptions

Given: A left dual (X∨,ev⁡X,coev⁡X) of X.

[L1]

A right dual of X∨ requires maps X∨⊗X→1 and 1→X⊗X∨ satisfying the mirror zig-zag identities (Left dual and right dual object, The zig-zag identities).

Proof

technique · direct
1.1givenL1construct

Reuse the same two morphisms ev⁡X:X∨⊗X→1 and coev⁡X:1→X⊗X∨, but now regard them as candidate right-dual data for the object X∨ with proposed right dual X.

2.1step 1.1L1

The first right-dual zig-zag for X∨ is exactly the second left-dual zig-zag for X, and the second right-dual zig-zag for X∨ is exactly the first left-dual zig-zag for X. Both are identities by the hypotheses that X∨ is a left dual of X.

3.1step 2.1∎

Hence X is a right dual of X∨. The dual assertion is the same argument with left and right interchanged.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The unit is self-dual

Statement

In any monoidal category, the tensor unit 1 is both a left dual and a right dual of itself.

Facts & Assumptions

Given: A monoidal category with unit object 1.

[L1]

The two unitors agree on the unit object: λ1=ρ1 (The two unitors agree on the tensor unit).

[L2]

A left or right self-duality of 1 requires an evaluation 1⊗1→1 and a coevaluation 1→1⊗1 satisfying the corresponding zig-zag identities (Left dual and right dual object).

Proof

technique · direct
1.1givenL1L2construct

Take the evaluation to be λ1:1⊗1→1 and the coevaluation to be λ1−1:1→1⊗1. By [L1], this is the same pair as ρ1 and ρ1−1.

2.1step 1.1algebra

Substituting these maps into either zig-zag composite gives an instance of the triangle identity with every object equal to 1, so each composite is the identity of 1.

3.1step 2.1L2∎

Therefore 1 is a left dual of itself, and because the same maps also satisfy the mirrored unit equations, it is a right dual of itself as well.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Reversing the tensor product exchanges left and right duals

Statement

Let Crev be the reverse monoidal category of C. An object is a left dual of X in Crev if and only if it is a right dual of X in C, and similarly with "left" and "right" interchanged.

Facts & Assumptions

Given: A monoidal category C and an object X of C.

[L1]

In the reverse monoidal category, the tensor order is reversed and the unitors are swapped: λXrev=ρX and ρXrev=λX (The reverse and the opposite of a monoidal category).

[L2]

Left and right duality are defined by the explicit zig-zag composites in Left dual and right dual object.

Proof

technique · direct
1.1givenL1L2

Suppose Y is a left dual of X in Crev, with evaluation Y⊗revX=X⊗Y→1 and coevaluation 1→X⊗revY=Y⊗X.

2.1step 1.1L1L2

Writing the two left-dual zig-zag composites in Crev and then translating them with [L1] replaces ⊗rev by reversed tensor order, αrev by α−1, and the reverse unitors by the ordinary opposite ones. The result is exactly the pair of right-dual zig-zag composites for Y as a right dual of X in C.

3.1step 2.1∎

Therefore the left-dual axioms in Crev are equivalent to the right-dual axioms in C. The converse and the left/right-swapped statement are the same calculation in reverse.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Duals are unique up to a unique compatible isomorphism

Statement

If X1∨ and X2∨ are two left duals of the same object X, then there is a unique isomorphism ϕ:X1∨→X2∨ compatible with both evaluation and coevaluation:

ev⁡2∘(ϕ⊗1X)=ev⁡1,(1X⊗ϕ)∘coev⁡1=coev⁡2.

The corresponding statement for right duals is also true.

Facts & Assumptions

Given: Two left duals (X1∨,ev⁡1,coev⁡1) and (X2∨,ev⁡2,coev⁡2) of X.

[L1]

Each pair satisfies the left-dual zig-zag identities (Left dual and right dual object, The zig-zag identities).

Proof

technique · direct
1.1givenL1construct

Define ϕ:X1∨→X2∨ by the composite X1∨→ρ−1X1∨⊗1→1⊗coev⁡2X1∨⊗(X⊗X2∨)→α−1(X1∨⊗X)⊗X2∨→ev⁡1⊗11⊗X2∨→λX2∨, and define ψ:X2∨→X1∨ by the same formula with the subscripts interchanged.

2.1step 1.1L1

Postcomposing the definition of ϕ with ev⁡2 and precomposing it with coev⁡1, then using the zig-zag identities from [L1], yields the two compatibility equations in the statement. The same calculation with ψ gives the analogous equations for ψ.

3.1step 2.1L1

The composite ψϕ is the unique morphism X1∨→X1∨ compatible with ev⁡1 and coev⁡1, and the identity morphism has that same compatibility by [L1]. Expanding one copy of ϕ and one copy of ψ and then straightening with the zig-zag identities shows that ψϕ=1X1∨; similarly ϕψ=1X2∨. Thus ϕ is an isomorphism with inverse ψ.

4.1step 1.1step 2.1step 3.1∎

If χ:X1∨→X2∨ is any other morphism satisfying the two compatibility equations, insert χ into the formula of step 1.1 and use those compatibilities to collapse the same zig-zag composites; the result is χ=ϕ. Hence the compatible isomorphism is unique. The right-dual statement is the mirror argument.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Duality yields adjunctions of tensoring functors

Statement

If V∨ is a left dual of V, then the functor V∨⊗− is left adjoint to V⊗−. Equivalently, for all objects U,W there is a natural bijection

Hom⁡(V∨⊗U,W)≅Hom⁡(U,V⊗W).

Dually, −⊗V∨ is right adjoint to −⊗V.

Facts & Assumptions

Given: A monoidal category and a left dual (V∨,ev⁡V,coev⁡V) of V.

[L1]

An adjunction is unit-counit data satisfying the two triangle identities (Adjunction by unit, counit, and the triangle identities).

[L2]

The pair (V∨,ev⁡V,coev⁡V) satisfies the zig-zag identities (Left dual and right dual object).

Proof

technique · direct
1.1givenL1L2construct

For each object U, define a unit ηU:U→V⊗(V∨⊗U) by U→λU−11⊗U→coev⁡V⊗1U(V⊗V∨)⊗U→αV,V∨,UV⊗(V∨⊗U). For each object W, define a counit εW:V∨⊗(V⊗W)→W by V∨⊗(V⊗W)→αV∨,V,W−1(V∨⊗V)⊗W→ev⁡V⊗1W1⊗W→λWW.

2.1step 1.1L2

The composite (V⊗εW)∘ηV⊗W is exactly the first zig-zag for V∨ tensored with W, and the composite εV∨⊗U∘(V∨⊗ηU) is exactly the second zig-zag for V∨ tensored with U. By [L2], both are identities.

3.1step 2.1L1∎

Steps 1.1 and 2.1 provide an adjunction V∨⊗−⊣V⊗− by [L1]. Transposition under this adjunction gives the displayed hom-set bijection, and the statement for right tensoring is the mirrored construction.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A dual object in the endofunctor category is an adjoint functor

Statement

Let C be a category and write tensor product in its endofunctor category as composition. Then a left dual of an endofunctor F:C→C is exactly a left adjoint of F, and a right dual of F is exactly a right adjoint of F.

Facts & Assumptions

Given: Endofunctors L,F,R:C→C.

[L1]

A left dual of F consists of natural transformations ev⁡:L∘F⇒1C and coev⁡:1C⇒F∘L satisfying the two zig-zag identities (The zig-zag identities).

[L2]

An adjunction L⊣F is a unit 1C⇒F∘L and counit L∘F⇒1C satisfying the two triangle identities (Adjunction by unit, counit, and the triangle identities).

Proof

technique · direct
1.1givenL1L2

Under the tensor-by-composition convention, the data named in [L1] and [L2] are literally the same pair of natural transformations with the same sources and targets.

2.1step 1.1L1L2

The two zig-zag identities for a left dual in the composition monoidal structure are exactly the two triangle identities for an adjunction, because both say that the composites F⇒coev⁡FFLF⇒Fev⁡FandL⇒Lcoev⁡LFL⇒ev⁡LL are identities.

3.1step 2.1∎

Therefore L is a left dual of F exactly when L⊣F. The same comparison with the mirrored data shows that R is a right dual of F exactly when F⊣R.

CorollaryStatement: AI-generatedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A second proof that adjoints are unique

Statement

If an endofunctor F has two left adjoints L1 and L2, then there is a unique natural isomorphism L1≅L2 compatible with the two adjunction structures. The corresponding statement for right adjoints is also true.

Facts & Assumptions

Given: Endofunctors L1,L2,F:C→C and adjunctions L1⊣F and L2⊣F.

[L1]

An adjunction to F is the same thing as a dual object of F in the composition monoidal category (A dual object in the endofunctor category is an adjoint functor).

[L2]

Duals of a fixed object are unique up to a unique compatible isomorphism (Duals are unique up to a unique compatible isomorphism).

Proof

technique · direct
1.1givenL1

By [L1], the two adjunctions L1⊣F and L2⊣F make L1 and L2 into two left duals of the same object F in the endofunctor composition monoidal category.

2.1step 1.1L1L2

Applying [L2] to those two duals yields a unique compatible isomorphism L1≅L2. Compatibility with the duality data is exactly compatibility with the units and counits of the two adjunctions by [L1].

3.1step 2.1∎

Hence left adjoints of a fixed functor are unique up to unique compatible natural isomorphism. The right-adjoint statement is the same argument with right duals.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Rigid object and rigid monoidal category

Definition

An object of a monoidal category is rigid if it has both a left dual and a right dual in the sense of Left dual and right dual object.

A monoidal category is rigid if every object in it is rigid.

Muger's notes also use the word autonomous for the same condition, and Joyal-Street use compact in the non-symmetric setting.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Finite-dimensional vector spaces are rigid

Statement

For any field k, every finite-dimensional k-vector space is rigid in the monoidal category Vectk.

Facts & Assumptions

Given: A finite-dimensional k-vector space V.

[L1]

The category Vectk is monoidal under ⊗k (Modules over a commutative ring form a monoidal category).

[L2]

If (v1,…,vn) is a basis of V, then the dual family (v1∗,…,vn∗) is a basis of V∗ and satisfies vi∗(vj)=δij (The dual family of a finite basis is a basis of the dual space, with the same dimension).

Proof

technique · direct
1.1givenL2L3construct

By [L3], choose a basis (v1,…,vn) of V. Let (v1∗,…,vn∗) be the dual basis from [L2], and define ev⁡:V∗⊗V→k,f⊗v↦f(v), coev⁡:k→V⊗V∗,1↦∑i=1nvi⊗vi∗.

2.1step 1.1L2algebra

For each basis vector vj, the first zig-zag sends vj to ∑i=1nvi∗(vj)vi=∑i=1nδijvi=vj. By linearity it is the identity on V.

2.2step 1.1L2algebra

For each dual basis vector vj∗, the second zig-zag sends vj∗ to ∑i=1nvj∗(vi)vi∗=∑i=1nδjivi∗=vj∗. By linearity it is the identity on V∗.

3.1step 2.1step 2.2L1∎

Thus V∗ is a left dual of V. The same formulas, read in the mirrored order, make V∗ a right dual of V as well, so V is rigid. Since V was arbitrary and [L1] supplies the monoidal structure, every finite-dimensional object of Vectk is rigid.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The dual of a morphism

Definition

Assume chosen left duals X∨ and Y∨ of objects X and Y. For a morphism f:X→Y, its left dual morphism

f∨:Y∨→X∨

is the composite

Y∨→ρ−1Y∨⊗1→1⊗coev⁡XY∨⊗(X⊗X∨)→α−1(Y∨⊗X)⊗X∨→(1⊗f)⊗1(Y∨⊗Y)⊗X∨→ev⁡Y⊗11⊗X∨→λX∨.

Equivalently, f∨ is the unique morphism making the transpose squares with evaluation and coevaluation commute. The right dual of a morphism is defined by the mirrored formula once right duals are chosen.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Left duality is a contravariant antimonoidal functor

Statement

After choosing a left dual X∨ for each object X, the assignment X↦X∨ and f↦f∨ defines a contravariant functor (−)∨:Cop→C. Moreover, for all objects X,Y, the object Y∨⊗X∨ is a left dual of X⊗Y, so there is a unique compatible isomorphism

(X⊗Y)∨≅Y∨⊗X∨,

and likewise 1∨≅1.

Facts & Assumptions

Given: Chosen left duals for all objects of a left rigid monoidal category.

[L1]

The dual of a morphism is defined by the transpose formula in The dual of a morphism.

[L3]

A fixed object has at most one left dual up to unique compatible isomorphism (Duals are unique up to a unique compatible isomorphism).

[L4]

The tensor unit is a left dual of itself (The unit is self-dual).

Proof

technique · direct
1.1givenL1

Expanding the definition from [L1] with f=1X and then straightening the resulting coevaluation-evaluation pair by the zig-zag identities shows (1X)∨=1X∨.

1.2L3algebra

The usual tensoring of the chosen dual pairs gives evaluation and coevaluation maps exhibiting Y∨⊗X∨ as a left dual of X⊗Y. Since (X⊗Y)∨ is the chosen left dual of the same object, [L3] gives a unique compatible isomorphism (X⊗Y)∨≅Y∨⊗X∨.

2.1step 1.1L1algebra

For morphisms X→fY→gZ, the defining composite for (g∘f)∨ contains the block g∘f between one coevaluation and one evaluation. Splitting that block into g followed by f yields exactly the composite for f∨∘g∨, so (g∘f)∨=f∨∘g∨. Hence (−)∨ is contravariant.

3.1step 1.2L3L4∎

By [L4], the tensor unit 1 is itself a left dual of 1. Applying [L3] to the chosen left dual 1∨ and this canonical one gives a unique compatible isomorphism 1∨≅1. Together with step 1.2, this supplies the unit comparison, so (−)∨ is antimonoidal.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The double dual is a monoidal functor

Statement

With chosen left duals, the double-dual assignment X↦X∨∨ is a monoidal endofunctor.

Facts & Assumptions

Given: Chosen left duals on a left rigid monoidal category.

[L1]

Left duality is a contravariant antimonoidal functor (Left duality is a contravariant antimonoidal functor).

Proof

technique · direct
1.1givenL1

By [L1], (−)∨:Cop→C is contravariant, so applying it twice yields a covariant endofunctor (−)∨∨:C→C.

1.2L1algebra

Again by [L1], there are compatible isomorphisms (X⊗Y)∨≅Y∨⊗X∨ and 1∨≅1. Dualizing once more reverses the order a second time, so the composite comparison gives X∨∨⊗Y∨∨≅(Y∨⊗X∨)∨≅(X⊗Y)∨∨ together with a unit isomorphism 1≅1∨∨.

2.1step 1.1step 1.2∎

Since the monoidal comparison maps are obtained by composing those of the antimonoidal functor with itself, their coherence is inherited from the coherence in [L1]. Therefore (−)∨∨ is a monoidal endofunctor.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

In a rigid category every morphism of monoidal functors is an isomorphism

Statement

Let F,G:C→D be strong monoidal functors from a rigid monoidal category C to a monoidal category D. Then every monoidal natural transformation η:F⇒G is a natural isomorphism.

Facts & Assumptions

Given: A rigid monoidal category C, a monoidal category D, strong monoidal functors F,G:C→D, and a monoidal natural transformation η:F⇒G.

[L1]

Every object of C has chosen duals because C is rigid (Rigid object and rigid monoidal category).

[L2]

A monoidal natural transformation respects both the tensor structure and the unit structure (Monoidal natural transformation).

[L4]

Compatible maps between two left duals of the same object are unique (Duals are unique up to a unique compatible isomorphism).

Proof

technique · direct
1.1givenL1construct

Because C is rigid, choose for each object X a left dual X∨. Since F and G are strong monoidal, they send the duality maps of X to duality maps of F(X) and G(X): after transporting the images of ev⁡X and coev⁡X across the strong monoidal structure isomorphisms, F(X∨) is a left dual of F(X) and G(X∨) is a left dual of G(X).

2.1step 1.1L2construct

Define ξX:G(X)→F(X) using the transported duality maps by the composite G(X)≅1⊗G(X)→coev⁡F(X)⊗1F(X)⊗F(X∨)⊗G(X)→1⊗ηX∨⊗1F(X)⊗G(X∨)⊗G(X)→1⊗ev⁡G(X)F(X)⊗1≅F(X). This construction uses F(X∨) and G(X∨) as left duals of F(X) and G(X) from step 1.1; it does not identify a left dual of F(X∨) with F(X).

3.1step 1.1step 2.1L2L4∎

Expand ξXηX using step 2.1. Naturality of η, together with its tensor and unit compatibility from [L2], moves ηX across the coevaluation and evaluation; the remaining composite is the zig-zag identity for the dual pair F(X∨),F(X). Hence ξXηX=1F(X). The mirrored calculation uses the zig-zag identity for G(X∨),G(X) and gives ηXξX=1G(X). Thus every component ηX is an isomorphism, so η is a natural isomorphism.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

A braided rigid category has a Drinfeld morphism

Statement

In a braided rigid monoidal category there is a natural isomorphism

uX:X→X∨∨,

called the Drinfeld morphism (or Drinfeld isomorphism), defined by

X→1X⊗coev⁡X∨X⊗X∨⊗X∨∨→cX,X∨⊗1X∨∨X∨⊗X⊗X∨∨→ev⁡X⊗1X∨∨X∨∨.

Write

dX,Y:X∨∨⊗Y∨∨→∼(X⊗Y)∨∨

for the monoidal comparison of the double-dual functor. Then

dX,Y∘(uX⊗uY)=uX⊗Y∘cY,X∘cX,Y.

Thus u need not be monoidal: the double braiding is precisely its monoidality obstruction.

Facts & Assumptions

Given: A braided rigid monoidal category with braiding c and chosen left duals.

[L1]

Braiding is natural and satisfies the two hexagons (Braiding). Duals satisfy the evaluation/coevaluation zig-zags (Rigid object and rigid monoidal category).

[L2]

Double duality has the monoidal comparisons dX,Y (The double dual is a monoidal functor). In calculations, reassociations, unit constraints and chosen-dual comparison maps are understood.

Proof

technique · direct
1.1L1givenalgebra

Bending a crossing. For any object Y, naturality at evaluation and coevaluation, followed by the two hexagons and the zig-zags, gives cX∨,Y=(ev⁡X⊗1Y⊗1X∨)(1X∨⊗cX,Y−1⊗1X∨)(1X∨⊗1Y⊗coev⁡X). Indeed expand cY,X⊗X∨=(1X⊗cY,X∨)(cY,X⊗1X∨) in naturality at coev⁡X, then tensor on the left with X∨ and apply ev⁡X to cancel the adjacent cup and cap. Replacing cA,B throughout by cB,A−1 gives the companion identity for cY,X∨−1. These are algebraic identities, independent of a graphical calculus.

2.1L1step 1.1algebraconstruct

A second left dual of X∨. Put eX′=ev⁡XcX,X∨:X⊗X∨→1 and hX′=cX∨,X−1coev⁡X:1→X∨⊗X. These give X as a left dual of X∨. To check the first zig-zag, expand (eX′⊗1X)(1X⊗hX′); move the crossing incident to the cup across that cup by step 1.1, cancel the resulting inverse crossing pair, and the remaining composite is (1X⊗ev⁡X)(coev⁡X⊗1X)=1X. For the other zig-zag expand (1X∨⊗eX′)(hX′⊗1X∨); the companion bending identity cancels the crossing pair and leaves (ev⁡X⊗1X∨)(1X∨⊗coev⁡X)=1X∨.

3.1L1step 2.1algebraconstruct

Comparison and inverse. If (A,eA,hA) and (B,eB,hB) are left duals of an object Z, the maps (eA⊗1B)(1A⊗hB):A→B and (eB⊗1A)(1B⊗hA):B→A are inverse: substitution of either composite permits first the Z,B zig-zag and then the A,Z zig-zag, leaving the identity. They are the unique maps intertwining the evaluations, since tensoring that intertwining equation with hB recovers the displayed formula. Apply this to Z=X∨, A=X from step 2.1, and B=X∨∨ with its chosen duality. The comparison is precisely the displayed uX, and its inverse is vX=(ev⁡X∨⊗1X)(1X∨∨⊗cX∨,X−1)(1X∨∨⊗coev⁡X). Thus vXuX=1X and uXvX=1X∨∨. For f:X→Y, the mate equations for f,f∨, and naturality of c show that both uYf and f∨∨uX intertwine the same evaluation pairing; uniqueness of the comparison gives uYf=f∨∨uX.

4.1L1L2step 1.1step 3.1algebra∎

Tensor relation. Work first with the canonical tensor dual (X⊗Y)∨=Y∨⊗X∨. Its evaluation is ev⁡Y(1Y∨⊗ev⁡X⊗1Y), and the coevaluation of its dual is (1Y∨⊗coev⁡X∨⊗1Y∨∨)coev⁡Y∨. Insert these into the formula for uX⊗Y. Expand its middle braiding using, successively, cA⊗B,C=(cA,C⊗1B)(1A⊗cB,C) and cA,B⊗C=(1B⊗cA,C)(cA,B⊗1C). This produces the four crossings of X,Y with Y∨,X∨. Bend the X,Y∨ crossing across its Y evaluation and the Y,X∨ crossing across its X evaluation by the two identities of step 1.1. The remaining X,X∨ and Y,Y∨ crossings and their cups and caps are respectively uX and uY, while the two bent crossings on the input are cX,Y−1cY,X−1. Consequently the expanded composite is uX⊗Y=(uX⊗uY)cX,Y−1cY,X−1. Reinsert the chosen-dual comparison dX,Y from [L2] and multiply on the right by cY,XcX,Y to obtain exactly the stated identity. Steps 3.1 and 4.1 prove the natural-isomorphism and obstruction claims.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The categorical trace of a morphism into the double dual

Definition

Fix a rigid monoidal category with chosen left duals. For a morphism a:X→X∨∨, the left categorical trace of a is the endomorphism of the unit

Tr⁡L(a):1→coev⁡XX⊗X∨→a⊗1X∨X∨∨⊗X∨→ev⁡X∨1.

For a morphism b:X∨∨→X, the right categorical trace of b is

Tr⁡R(b):1→coev⁡X∨X∨⊗X∨∨→1X∨⊗bX∨⊗X→ev⁡X1.

So a bare endomorphism X→X is not yet an input to categorical trace; one first needs a comparison between X and a double dual.

RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-09-04Open item page →

What is needed before a trace can be written

Remark

The hypothesis ladder is strict.

  • Rigidity is what types Tr⁡L(a) and Tr⁡R(b) at all, because their formulas use evaluation and coevaluation maps.
  • A chosen comparison jX:X→X∨∨ turns an endomorphism x:X→X into a traceable morphism jXx. A pivotal structure supplies such comparisons as monoidal isomorphisms.
  • Sphericality is an additional condition guaranteeing that the left and right traces agree.
  • In a braided rigid category, the Drinfeld morphism uX:X→X∨∨ from A braided rigid category has a Drinfeld morphism already makes Tr⁡L(uXx) well typed. This Drinfeld morphism is already a natural isomorphism under the bare braided-rigid hypotheses, but it need not be monoidal; a twist is what combines with it to produce a pivotal structure.
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Pivotal structure

Definition

Let (−)∨∨ be the monoidal endofunctor of The double dual is a monoidal functor.

A pivotal structure on a rigid monoidal category is an isomorphism of monoidal functors

a:id⁡C→∼(−)∨∨.

Equivalently, it is a natural family of isomorphisms aX:X→∼X∨∨ such that

aX⊗Y=aX⊗aY,a1=11

after transporting along the monoidal structure of the double-dual functor.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The dimension of an object relative to a pivotal structure

Definition

Let a be a pivotal structure on a rigid monoidal category. The dimension of an object X relative to a is

dim⁡a(X):=Tr⁡L(aX)∈End⁡C(1).

The subscript is part of the notation: changing the pivotal structure changes the morphism whose trace is being taken, so the resulting dimension can change as well.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Basic properties of the categorical trace

Statement

Let C be a rigid monoidal category, let a:X→X∨∨ and b:Y→Y∨∨, and suppress the monoidal and chosen-dual comparison maps. For s∈End⁡(1) write ℓZ(s) and rZ(s) for its left and right actions on Z, transported from s⊗1Z and 1Z⊗s by the unit constraints.

  1. Tr⁡L(a)=Tr⁡R(a∨).
  2. If the category is additive, then Tr⁡L(a⊕b)=Tr⁡L(a)+Tr⁡L(b).
  3. The general tensor formula is Tr⁡L(a⊗b)=Tr⁡L(rX∨∨(Tr⁡L(b))a). If rX∨∨(Tr⁡L(b))=ℓX∨∨(Tr⁡L(b)), this becomes Tr⁡L(a⊗b)=Tr⁡L(a)Tr⁡L(b). In particular multiplicativity holds when every unit scalar has equal left and right actions on every object. This condition holds in a braided category, and also in a k-linear monoidal category with k-bilinear tensor product and End⁡(1)=k.
  4. For every endomorphism c:X→X, Tr⁡L(ac)=Tr⁡L(c∨∨a).

The corresponding right-trace duality, additivity and cyclicity statements hold. For right-trace inputs p:X∨∨→X and q:Y∨∨→Y, the general tensor formula is

Tr⁡R(p⊗q)=Tr⁡R(qℓY∨∨(Tr⁡R(p))).

It reduces to multiplicativity under the analogous equality of scalar actions, in particular under either sufficient condition above.

Facts & Assumptions

Given: A rigid monoidal category, morphisms a:X→X∨∨ and b:Y→Y∨∨, and when needed an additive structure.

[L1]

Chosen left duality is contravariant and antimonoidal, with evaluation and coevaluation satisfying the two zig-zags (Left duality is a contravariant antimonoidal functor).

[L2]

The two trace composites are The categorical trace of a morphism into the double dual. Tensor and unit comparison maps are understood in the formulas below.

[L3]

A braiding is natural and satisfies the two hexagon identities (Braiding).

Proof

technique · direct
1.1givenL1L2algebra

Sliding a morphism. The defining mate identities for f:U→V are (f⊗1U∨)coev⁡U=(1V⊗f∨)coev⁡V and ev⁡U(f∨⊗1U)=ev⁡V(1V∨⊗f). Apply the first identity to f=a:X→X∨∨. Postcomposing with ev⁡X∨ gives Tr⁡L(a)=ev⁡X∨(1X∨∨⊗a∨)coev⁡X∨∨=Tr⁡R(a∨), where the last trace is taken on X∨. This proves clause 1 without identifying a double dual with the original object.

1.2L1L2algebraconstruct

Biproducts. In an additive rigid category, tensoring by a fixed object has both adjoints, furnished by its two duals, and hence preserves finite biproducts; duality carries a biproduct to the corresponding biproduct of duals. Write iU,pU for the injections and projections of Z=X⊕Y. Relative to Z∨=X∨⊕Y∨, its coevaluation is ∑U=X,Y(iU⊗pU∨)coev⁡U, and its evaluation pairs matching summands by ev⁡U and different summands by zero. These formulas satisfy the zig-zags since pUiV is the identity for U=V and zero otherwise, so uniqueness of duals permits their use for the chosen dual. Inserting a⊕b leaves exactly the two diagonal trace composites. Their sum is Tr⁡L(a)+Tr⁡L(b), proving clause 2.

1.3L1L2algebra

Nested tensor trace. Use (X⊗Y)∨=Y∨⊗X∨. The coevaluation of X⊗Y is (1X⊗coev⁡Y⊗1X∨)coev⁡X. The evaluation of its dual Y∨⊗X∨ first pairs the middle Y∨∨,Y∨ and then the outer X∨∨,X∨. Substitute a⊗b into this composite. Evaluating the middle pair gives s=Tr⁡L(b) situated between X∨∨ and X∨. Thus the result is exactly ev⁡X∨(rX∨∨(s)a⊗1X∨)coev⁡X=Tr⁡L(rX∨∨(s)a). If rX∨∨(s)=ℓX∨∨(s), the inserted scalar instead acts on the left of the whole evaluation input. Naturality of that left action at ev⁡X∨ moves it to the output unit, giving sTr⁡L(a). Endomorphisms of the unit commute under composition by interchange, so this equals the asserted product. No equality of left and right actions is assumed in the general nested formula.

2.1L1L2step 1.1algebra

Cyclicity, including different objects. More generally, for f:U→V and h:V→U∨∨, the first mate identity in step 1.1 and then the second identity applied to f∨ give ev⁡U∨(hf⊗1)coev⁡U=ev⁡U∨(h⊗f∨)coev⁡V=ev⁡V∨(f∨∨h⊗1)coev⁡V. Thus Tr⁡L,U(hf)=Tr⁡L,V(f∨∨h). Taking U=V=X, f=c and h=a proves clause 4. The mirrored mate identities give the corresponding right-trace cyclicity.

3.1L1L2L3step 1.1step 2.1step 1.2step 1.3algebra∎

Sufficient hypotheses and right trace. In a braided category the hexagon at 1⊗1,Z, with unit constraints inserted, makes the unit-transported c1,Z an idempotent automorphism of Z, hence the identity. Naturality of c1,Z at s:1→1 gives c1,Z(s⊗1Z)=(1Z⊗s)c1,Z. Compatibility with the unit identifies c1,Z with the composite 1⊗Z→Z→Z⊗1, so ℓZ(s)=rZ(s). Alternatively, in a k-linear category with bilinear tensor and End⁡(1)=k, each s=λ11 has both actions λ1Z. For the right tensor trace, use the coevaluation of Y∨⊗X∨: first close the middle X∨,X∨∨ pair with p, leaving Tr⁡R(p) immediately to the left of Y∨∨. The remaining composite is exactly Tr⁡R(qℓY∨∨(Tr⁡R(p))). When left and right actions agree at this scalar, move it to the outer right of the evaluation and hence to the output unit; this proves the right multiplicative formula. The mirrored mate and biproduct calculations prove the other right-trace identities. Together with steps 1.1–1.3 and 2.1 this proves all assertions.

Remarks

Commutativity of End⁡(1) alone does not imply equality of its two actions. For example, take the rigid matrix category whose simple objects satisfy Eij⊗Ekl=0 for j≠k and Eij⊗Ejl=Eil, with unit E11⊕E22 and Eij∨=Eji. Choose the usual matrix-unit evaluations and coevaluations. If a=1E12 and b=1E21, their left traces are the two orthogonal unit projections e1,e2. Their product is zero, whereas Tr⁡L(a⊗b)=Tr⁡L(1E11)=e1. The nested formula remains valid: rE12(e2)=1E12, while ℓE12(e2)=0.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Twist and ribbon structure

Definition

Let C be a braided rigid monoidal category with braiding c, and fix left duals X∨ for all objects together with the dual-morphism operation of The dual of a morphism.

A twist on C is a natural automorphism θ∈Aut⁡(id⁡C) such that

θX⊗Y=(θX⊗θY)∘cY,X∘cX,Y

for all objects X,Y and θ1=11.

A ribbon structure is a twist satisfying the dual-compatibility condition

(θX)∨=θX∨.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

A twist on a braided rigid category is the same thing as a pivotal structure of Drinfeld type

Statement

Let C be a braided tensor category and let uX:X→X∨∨ be its Drinfeld isomorphism. For a natural automorphism θ of the identity functor, put

ψX:=uXθX.

Then ψ is a pivotal structure if and only if θ is a twist.

Facts & Assumptions

Given: A braided tensor category, its Drinfeld isomorphism u, and a natural automorphism θ of the identity functor.

[F1]

EGNO formula (8.35) and the sentence after it state exactly that ψX=uXθX is a tensor isomorphism X→X∗∗ if and only if θ is a twist.

[L1]

The Drinfeld morphism exists, and in a braided tensor category it is an isomorphism (A braided rigid category has a Drinfeld morphism).

[L2]

A pivotal structure is precisely a monoidal natural isomorphism id⁡⇒(−)∨∨ (Pivotal structure).

[L3]

A twist is precisely a natural automorphism satisfying the double-braiding tensor law (Twist and ribbon structure).

Proof

technique · direct
1.1givenF1L1construct

By [L1], the family uX is invertible, so every natural isomorphism ψX:X→X∨∨ can be written uniquely as uXθX for a natural automorphism θ of the identity.

2.1step 1.1L1L2L3

The tensor relation for u from the Drinfeld-morphism theorem inserts exactly one double braiding between uX⊗Y and uX⊗uY. Therefore the condition that ψ be monoidal is equivalent to the condition that θ absorb that double braiding, namely θX⊗Y=(θX⊗θY)∘cY,X∘cX,Y, which is the twist law from [L3].

3.1step 2.1L2L3∎

Hence ψ is a pivotal structure exactly when θ is a twist.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Rigidity alone does not make a tensor category

Remark

EGNO's term tensor category is much stronger than "rigid monoidal category". Their Definition 4.1.1 requires a locally finite k-linear abelian rigid monoidal category over an algebraically closed field with End⁡(1)≅k, and Definition 4.2.3 similarly adds the ambient hypotheses for multitensor categories.

So this page may use rigidity, pivotality, sphericality, twists, and ribbon structure, but it may not silently import fusion-category or Grothendieck-ring consequences whose proofs need those extra hypotheses.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Not every monoidal category is rigid

Statement refuted

Every monoidal category is rigid.

Facts & Assumptions

Given: A field k, the monoidal category Vectk, and the infinite-dimensional vector space V=k[x].

Counterexample

technique · direct
1.1givenL1

Let k be a field and let Vectk be the category of all k-vector spaces with the usual tensor product and unit object k. This is a monoidal category, and V:=k[x] is infinite-dimensional by [L1].

1.2assume-contraalgebra

Assume for contradiction that V had a left dual (V∨,ev⁡,coev⁡). Because coev⁡(1)∈V⊗V∨ is a single tensor in an algebraic tensor product, it is a finite sum ∑i=1mvi⊗fi with fi∈V∨. Applying the first zig-zag identity to any v∈V gives v=∑i=1mev⁡(fi⊗v)vi, so every vector of V lies in the span of the finite set {v1,…,vm}.

2.1discharge-contradiction: infinite-dimensional vector spaces cannot be finitely spanned∎

Step 1.2 makes V finite-dimensional, contradicting that k[x] has no finite basis. Therefore V has no left dual, hence is not rigid, so Vectk is a monoidal category that is not rigid.

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Left and right duals, and double duals, need not collapse

Statement refuted

In every rigid monoidal category, left and right duals of an object are isomorphic and every object is isomorphic to its double dual.

Facts & Assumptions

Given: The poset category Z, its endofunctor category under composition, and the monotone maps D,L,R,H defined in the proof.

Counterexample

technique · direct
1.1givenconstruct

Let Z be the ordered set of integers regarded as a small category, so there is a unique morphism m→n exactly when m≤n. Let D(n)=2n, L(n)=⌈n/2⌉, R(n)=⌊n/2⌋, and H(n)=2n−1. Directly from the defining inequalities, L(m)≤n  ⟺  m≤D(n),D(m)≤n  ⟺  m≤R(n),H(m)≤n  ⟺  m≤L(n). Thus L⊣D⊣R and H⊣L.

2.1step 1.1algebra

Let R be the full subcategory of End⁡(Z) generated under finite composition by the identity functor and all endofunctors in the bi-infinite adjoint chain obtained by repeatedly taking left and right adjoints of D. It is a monoidal subcategory by construction. Each generator has both adjacent adjoints in the chain, and a finite composite of functors with left and right adjoints has the corresponding reversed composites as its left and right adjoints. Those composites again belong to R, and their units and counits lie in the full subcategory. Hence every object of R has both duals and R is rigid.

3.1step 2.1algebra

In the endofunctor category of a poset, a natural transformation F⇒G exists exactly when F(n)≤G(n) for all n, so two endofunctors are isomorphic exactly when they are equal pointwise. Here L(1)=1>0=R(1), so there is no natural transformation L⇒R and therefore no isomorphism L≅R. Thus the object D has nonisomorphic left and right duals.

4.1step 1.1step 3.1step 2.1∎

If the chosen left duality on R uses left adjoints, then D∨=L and D∨∨=H. Since H(0)=−1≠0=D(0), the endofunctors H and D are not isomorphic. Therefore in this rigid monoidal category neither left/right duals nor double duals are forced to collapse.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

FALSE: a trace can be defined for an endomorphism in any monoidal category

Statement

A trace can be defined for an endomorphism in any monoidal category.

Facts & Assumptions

Given: A monoidal category and an endomorphism x:X→X.

[L1]

The trace ladder states that rigidity is needed to define categorical trace at all (What is needed before a trace can be written).

[L2]

A pivotal structure is the extra comparison aX:X→X∨∨ needed to turn an endomorphism into a traceable morphism (Pivotal structure).

Refutation

technique · direct
1.1givenL1

By the hypothesis ladder in What is needed before a trace can be written, categorical trace is first defined on a morphism a:X→X∨∨ or b:X∨∨→X, so rigidity is already required before any trace expression is even well typed.

2.1step 1.1L2

Even in a rigid category, an endomorphism x:X→X does not itself have the required source and target. One needs a pivotal structure to insert a comparison aX:X→X∨∨ or aX−1:X∨∨→X, as recorded in Pivotal structure.

3.1step 2.1∎

Therefore a bare monoidal category does not supply a trace for an arbitrary endomorphism. The statement is false because the operation is not even typed without extra duality data.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

FALSE: a braiding suffices to define a trace

Statement

A braiding on a monoidal category, without rigidity, suffices to define a categorical trace.

Facts & Assumptions

Given: The symmetric monoidal category Vectk of all vector spaces and its infinite-dimensional object k[x].

[L1]

The trace formulas require evaluation and coevaluation maps (What is needed before a trace can be written).

[L2]

The symmetric monoidal category of all vector spaces has an infinite-dimensional object with no categorical dual (Not every monoidal category is rigid).

Refutation

technique · direct
1.1givenL2

The usual symmetry makes Vectk braided, but [L2] shows that its object k[x] has no evaluation and coevaluation satisfying the zig-zag identities.

2.1L1step 1.1

Consequently the trace composites described in [L1] cannot even be formed for k[x]. The braiding supplies swaps but does not supply the missing duality maps.

3.1step 2.1∎

Therefore braiding without rigidity does not suffice to define categorical trace. The statement is false.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

FALSE: left and right duals of an object are isomorphic

Statement

Left and right duals of an object are isomorphic.

Facts & Assumptions

Given: The rigid monoidal category and object constructed in the cited counterexample.

[L1]

The category R contains an object whose left and right duals are not isomorphic (Left and right duals, and double duals, need not collapse).

Refutation

technique · direct
1.1givenL1

The counterexample Left and right duals, and double duals, need not collapse constructs the composition-closed rigid monoidal subcategory R generated by an adjoint chain, containing an object D whose left dual is L(n)=⌈n/2⌉ and whose right dual is R(n)=⌊n/2⌋.

2.1step 1.1L1

In that category, endofunctors are isomorphic only when they agree pointwise, but L(1)=1 and R(1)=0. So L≇R.

3.1step 2.1∎

Hence there exists an object whose left and right duals are not isomorphic, so the statement is false.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

FALSE: every monoidal category is rigid

Statement

Every monoidal category is rigid.

Facts & Assumptions

Given: The monoidal category of all vector spaces over a field.

[L1]

That category is a counterexample to universal rigidity (Not every monoidal category is rigid).

Refutation

technique · direct
1.1givenL1

The counterexample Not every monoidal category is rigid exhibits the monoidal category of all vector spaces over a field and an infinite-dimensional object with no dual object.

2.1step 1.1L1

Therefore that monoidal category is not rigid.

3.1step 2.1∎

So the universal statement is false.

Sources