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.

23 results · all verified · 16 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 7 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-spherical-ribbon ladder. 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

evX:XX1,coevX:1XX

such that the composites

XλX11XcoevX1X(XX)XαX,X,XX(XX)1XevXX1ρXX

and

XρX1X11XcoevXX(XX)αX,X,X1(XX)XevX1X1XλXX

are identity morphisms.

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

evX:XX1,coevX:1XX

such that the mirror composites

XρX1X11XcoevXX(XX)αX,X,X1(XX)XevX1X1XλXX

and

XλX11XcoevX1X(XX)XαX,X,XX(XX)1XevXX1ρXX

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,evX,coevX) 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,evX,coevX) 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 XX1. 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,evX,coevX) of X.

[L1]

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

Proof

technique · direct
1.1

Reuse the same two morphisms evX:XX1 and coevX:1XX, but now regard them as candidate right-dual data for the object X with proposed right dual X.

givenL1construct
2.1

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.

step 1.1L1
3.1

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

step 2.1
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 111 and a coevaluation 111 satisfying the corresponding zig-zag identities (Left dual and right dual object).

Proof

technique · direct
1.1

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

givenL1L2construct
2.1

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.

step 1.1algebra
3.1

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.

step 2.1L2
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.1

Suppose Y is a left dual of X in Crev, with evaluation YrevX=XY1 and coevaluation 1XrevY=YX.

givenL1L2
2.1

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.

step 1.1L1L2
3.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.

step 2.1
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 ϕ:X1X2 compatible with both evaluation and coevaluation:

ev2(ϕ1X)=ev1,(1Xϕ)coev1=coev2.

The corresponding statement for right duals is also true.

Facts & Assumptions

Given: Two left duals (X1,ev1,coev1) and (X2,ev2,coev2) 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.1

Define ϕ:X1X2 by the composite X1ρ1X111coev2X1(XX2)α1(X1X)X2ev111X2λX2, and define ψ:X2X1 by the same formula with the subscripts interchanged.

givenL1construct
2.1

Postcomposing the definition of ϕ with ev2 and precomposing it with coev1, 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 ψ.

step 1.1L1
3.1

The composite ψϕ is the unique morphism X1X1 compatible with ev1 and coev1, 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 ψ.

step 2.1L1
4.1

If χ:X1X2 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.

step 1.1step 2.1step 3.1
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(VU,W)Hom(U,VW).

Dually, V is right adjoint to V.

Facts & Assumptions

Given: A monoidal category and a left dual (V,evV,coevV) 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,evV,coevV) satisfies the zig-zag identities (Left dual and right dual object).

Proof

technique · direct
1.1

For each object U, define a unit ηU:UV(VU) by UλU11UcoevV1U(VV)UαV,V,UV(VU). For each object W, define a counit εW:V(VW)W by V(VW)αV,V,W1(VV)WevV1W1WλWW.

givenL1L2construct
2.1

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

step 1.1L2
3.1

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

step 2.1L1
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:CC 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:CC.

[L1]

A left dual of F consists of natural transformations ev:LF1C and coev:1CFL satisfying the two zig-zag identities (The zig-zag identities).

[L2]

An adjunction LF is a unit 1CFL and counit LF1C satisfying the two triangle identities (Adjunction by unit, counit, and the triangle identities).

Proof

technique · direct
1.1

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.

givenL1L2
2.1

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 FcoevFFLFFevFandLLcoevLFLevLL are identities.

step 1.1L1L2
3.1

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

step 2.1
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 L1L2 compatible with the two adjunction structures. The corresponding statement for right adjoints is also true.

Facts & Assumptions

Given: Endofunctors L1,L2,F:CC and adjunctions L1F and L2F.

[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.1

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

givenL1
2.1

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

step 1.1L1L2
3.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.

step 2.1
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.1

By [L3], choose a basis (v1,,vn) of V. Let (v1,,vn) be the dual basis from [L2], and define ev:VVk,fvf(v), coev:kVV,1i=1nvivi.

givenL2L3construct
2.1

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.

step 1.1L2algebra
2.2

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.

step 1.1L2algebra
3.1

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.

step 2.1step 2.2L1
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:XY, its left dual morphism

f:YX

is the composite

Yρ1Y11coevXY(XX)α1(YX)X(1f)1(YY)XevY11Xλ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 XX and ff defines a contravariant functor ():CopC. Moreover, for all objects X,Y, the object YX is a left dual of XY, so there is a unique compatible isomorphism

(XY)YX,

and likewise 11.

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

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

givenL1
1.2

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

L3algebra
2.1

For morphisms XfYgZ, the defining composite for (gf) contains the block gf between one coevaluation and one evaluation. Splitting that block into g followed by f yields exactly the composite for fg, so (gf)=fg. Hence () is contravariant.

step 1.1L1algebra
3.1

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 11. Together with step 1.2, this supplies the unit comparison, so () is antimonoidal.

step 1.2L3L4
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 XX 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.1

By [L1], ():CopC is contravariant, so applying it twice yields a covariant endofunctor ():CC.

givenL1
1.2

Again by [L1], there are compatible isomorphisms (XY)YX and 11. Dualizing once more reverses the order a second time, so the composite comparison gives XY(YX)(XY) together with a unit isomorphism 11.

L1algebra
2.1

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.

step 1.1step 1.2
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:CD be strong monoidal functors from a rigid monoidal category C to a monoidal category D. Then every monoidal natural transformation η:FG is a natural isomorphism.

Facts & Assumptions

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

[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.1

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 evX and coevX 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).

givenL1construct
2.1

Define ξX:G(X)F(X) using the transported duality maps by the composite G(X)1G(X)coevF(X)1F(X)F(X)G(X)1ηX1F(X)G(X)G(X)1evG(X)F(X)1F(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).

step 1.1L2construct
3.1

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.

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

A braided rigid category has a Drinfeld morphism

Statement

In a braided rigid monoidal category there is a natural isomorphism

uX:XX,

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

X1XcoevXXXXcX,X1XXXXevX1XX.

Write

dX,Y:XY(XY)

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

dX,Y(uXuY)=uXYcY,XcX,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.

[F1]

Bruguières--Virelizier, Lemma 8.1, proves under the bare braided-autonomous hypotheses that the displayed natural transformation is an isomorphism, gives its explicit inverse, and proves its tensor relation; Remark 8.2 identifies symmetry as exactly the case in which it is monoidal. Shibata--Shimizu, Section 6.4, independently uses the same map as the Drinfeld isomorphism of an arbitrary braided rigid monoidal category and uses u1 in the pivotal/twist correspondence. EGNO formula (8.30) and Proposition 8.9.3 give the same map and tensor relation in their strict chosen-dual convention.

[L1]

A braiding is natural in both variables and satisfies the hexagon identities (Braiding).

[L2]

With chosen left duals, the double-dual assignment is a monoidal endofunctor, with comparison maps dX,Y of the displayed type (The double dual is a monoidal functor).

Proof

technique · direct
1.1

The displayed composite is well typed because rigidity provides coevX:1XX and evX:XX1, while the braiding supplies the middle swap. Naturality of the braiding in [L1] makes the assignment XuX natural in X.

givenF1L1
1.2

After inserting the monoidal comparison dX,Y from [L2], both sides of the displayed tensor relation are morphisms XY(XY). The relation in [F1] is exactly this compatibility in a convention that suppresses the comparison. In particular, it records the precise obstruction to u being monoidal: the double braiding appears between uXY and the transported map uXuY.

F1L2
2.1

The explicit inverse in [F1] is defined under the same braided-rigid hypotheses as the displayed map, so every uX is an isomorphism. Together with step 1.1, this makes u a natural isomorphism in every braided rigid monoidal category; step 1.2 records why it need not be monoidal.

step 1.1step 1.2F1
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:XX, the left categorical trace of a is the endomorphism of the unit

TrL(a):1coevXXXa1XXXevX1.

For a morphism b:XX, the right categorical trace of b is

TrR(b):1coevXXX1XbXXevX1.

So a bare endomorphism XX 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 TrL(a) and TrR(b) at all, because their formulas use evaluation and coevaluation maps.
  • A chosen comparison jX:XX turns an endomorphism x:XX 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:XX from A braided rigid category has a Drinfeld morphism already makes TrL(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:idC().

Equivalently, it is a natural family of isomorphisms aX:XX such that

aXY=aXaY,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

dima(X):=TrL(aX)EndC(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.

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

Spherical structure

Definition

Following EGNO, a spherical structure is a pivotal structure a on a tensor category such that

dima(X)=dima(X)

for every object X.

A spherical category is a tensor category equipped with a spherical structure.

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

Pivotal and spherical structures vary by monoidal automorphisms of the identity

Remark

If a tensor category has one pivotal structure, then every monoidal natural automorphism η of the identity functor produces another one by XηXXaXX. Equivalently, if a and b are pivotal structures, then a1b is a unique monoidal automorphism of the identity. Thus the set of pivotal structures, when nonempty, is a torsor over Aut(idC). Spherical structures are precisely the members of this set that also satisfy the spherical trace condition; changing by a monoidal automorphism need not preserve that extra condition.

This is why dima(X) keeps the subscript a: the comparison map is part of the data.

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

In a spherical category the left and right traces agree

Statement

Let C be a spherical tensor category with spherical structure a. For every object X and every endomorphism x:XX,

TrL(aXx)=TrR(xaX1).

Facts & Assumptions

Given: A spherical tensor category (C,a), an object X, and an endomorphism x:XX.

[F1]

EGNO Theorem 4.7.15 proves exactly the displayed identity for spherical tensor categories.

[L1]

The left and right traces used in the statement are the ones defined in The categorical trace of a morphism into the double dual, and aX:XX is the pivotal comparison from Pivotal structure.

Proof

technique · direct
1.1

By [L1], both composites in the statement are well typed in any pivotal category, and the extra spherical hypothesis is exactly the one assumed in [F1].

givenF1L1
1.2

Applying [F1] to the present spherical tensor category gives TrL(aXx)=TrR(xaX1).

F1
2.1

Hence in a spherical category the left and right traces agree after inserting the pivotal comparison.

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

Basic properties of the categorical trace

Statement

Let a:XX and b:YY.

  1. TrL(a)=TrR(a).
  2. If the category is additive, then TrL(ab)=TrL(a)+TrL(b).
  3. TrL(ab)=TrL(a)TrL(b).
  4. For every endomorphism c:XX, TrL(ac)=TrL(ca).

The corresponding right-trace statements hold by the same formulas with left and right exchanged.

Facts & Assumptions

Given: A rigid monoidal category, morphisms a:XX and b:YY, and when needed an additive structure.

[F1]

EGNO Proposition 4.7.3 proves exactly the four displayed properties, with the additive clause explicitly restricted to additive categories.

[L1]

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

Proof

technique · direct
1.1

The formula in [L2] for TrL(a) is obtained by inserting a between one coevaluation and one evaluation. Dualizing that composite and using the contravariant antimonoidality from [L1] reverses the order and turns it into the defining formula for TrR(a), which is the first clause recorded in [F1].

givenF1L1L2
1.2

The same proposition [F1] states that direct sums split the trace additively in additive categories, tensor products split it multiplicatively, and composing with an endomorphism may be cycled across the trace at the cost of a double dual: TrL(ac)=TrL(ca).

F1
2.1

Therefore all four displayed identities hold, and the right-trace versions follow by applying the same argument to the mirrored formulas in [L2].

step 1.1step 1.2
RemarkRemark: Literature-sourcedProof: Not suppliedaudited 2026-09-04 sources checked 2026-09-04 not proved hereOpen item page →
Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Exact-sequence additivity of trace and its missing hypotheses

Remark

EGNO Proposition 4.7.5 proves an exact-sequence additivity formula for quantum trace, but it proves it in a multitensor category, not under rigidity alone. Concretely, if a:VV preserves a subobject WV, then the source theorem says

TrL(a)=TrL(aW)+TrL(aˉ),

and likewise for right traces, where aˉ is the induced map on V/W.

This page records that theorem exactly as source-backed boundary information and does not widen it to an arbitrary rigid abelian monoidal category.

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(idC) such that

θXY=(θXθY)cY,XcX,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:XX 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 XX 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.1

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

givenF1L1construct
2.1

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

step 1.1L1L2L3
3.1

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

step 2.1L2L3
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.1

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

givenL1
1.2

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

assume-contraalgebra
2.1

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.

discharge-contradiction: infinite-dimensional vector spaces cannot be finitely spanned
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.1

Let Z be the ordered set of integers regarded as a small category, so there is a unique morphism mn exactly when mn. Let D(n)=2n, L(n)=n/2, R(n)=n/2, and H(n)=2n1. Directly from the defining inequalities, L(m)n    mD(n),D(m)n    mR(n),H(m)n    mL(n). Thus LDR and HL.

givenconstruct
2.1

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.

step 1.1algebra
3.1

In the endofunctor category of a poset, a natural transformation FG 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 LR and therefore no isomorphism LR. Thus the object D has nonisomorphic left and right duals.

step 2.1algebra
4.1

If the chosen left duality on R uses left adjoints, then D=L and D=H. Since H(0)=10=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.

step 1.1step 3.1step 2.1
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:XX.

[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:XX needed to turn an endomorphism into a traceable morphism (Pivotal structure).

Refutation

technique · direct
1.1

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

givenL1
2.1

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

step 1.1L2
3.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.

step 2.1
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.1

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

givenL2
2.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.

L1step 1.1
3.1

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

step 2.1
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.1

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.

givenL1
2.1

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

step 1.1L1
3.1

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

step 2.1
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.1

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.

givenL1
2.1

Therefore that monoidal category is not rigid.

step 1.1L1
3.1

So the universal statement is false.

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

FALSE: the left and right traces always agree

Statement

The left and right traces always agree.

Facts & Assumptions

Given: The tensor category of finite-dimensional Z-graded vector spaces and a scalar qk× with q±1.

[L1]

In spherical categories the left and right traces agree (In a spherical category the left and right traces agree).

Refutation

technique · direct
1.1

Let C be the tensor category of finite-dimensional Z-graded vector spaces over a field k, and fix qk× with q±1. The usual double-dual map is a pivotal structure, and multiplying its component on degree-n vectors by qn gives another pivotal structure a.

givenconstruct
2.1

Let X=k[1] be the one-dimensional object concentrated in degree 1. Then X=k[1], so dima(X)=q,dima(X)=q1. Since qq1, the pivotal structure a is not spherical.

step 1.1algebra
3.1

For the identity endomorphism 1X, the two trace expressions are exactly those two dimensions: TrL(aX1X)=q,TrR(1X(aX)1)=q1. They are unequal, so left and right traces do not always agree. This does not contradict In a spherical category the left and right traces agree, because the witness is deliberately non-spherical.

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

FALSE: the dimension of an object is independent of the pivotal structure

Statement

The dimension of an object is independent of the pivotal structure.

Facts & Assumptions

Given: The tensor category of finite-dimensional Z-graded vector spaces, a field element qk× with q±1, and the degree-one line X=k[1].

[L1]

Pivotal structures vary by monoidal automorphisms of the identity (Pivotal and spherical structures vary by monoidal automorphisms of the identity).

[L2]

dima(X) is defined as the trace of the chosen pivotal comparison (The dimension of an object relative to a pivotal structure).

[L3]

On graded vector spaces, multiplying the canonical double-dual map by qn in degree n gives a pivotal structure whose dimension on k[1] is q (FALSE: the left and right traces always agree).

Refutation

technique · direct
1.1

By [L1], the standard pivotal structure on graded vector spaces can be multiplied by the monoidal automorphism acting as qn in degree n. This gives the modified pivotal structure a used in [L3].

givenL1L3
2.1

The standard pivotal structure gives dim(X)=1k for the degree-1 line X=k[1], while [L3] gives dima(X)=q1k. These are exactly the quantities defined in [L2].

step 1.1L2L3
3.1

Therefore the dimension can change when the pivotal structure changes, so the statement is false.

step 2.1

Sources