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.
Duality and Rigidity in Monoidal Categories
1 · Prerequisites
- Adjunctions Units and Counits
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Categories, Functors and Natural Transformations
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Homomorphisms and the Isomorphism Theorems
- Limits and Colimits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monoidal Categories and Monoidal Functors
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinals, Cardinals, and Transfinite Recursion
- Preadditive and Additive Categories and Biproducts
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Tensor Products of Modules
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
Left dual and right dual object
Definition
Let be a monoidal category and let be an object of .
A left dual of is an object together with morphisms
such that the composites
and
are identity morphisms.
A right dual of is an object together with morphisms
such that the mirror composites
and
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.
The zig-zag identities
Definition
For a left dual of , the two identity composites in Left dual and right dual object are called the zig-zag identities or snake identities for the pair .
For a right dual of , the corresponding mirror composites are the zig-zag identities for the pair .
Thus a dual object is exactly duality data together with the relevant pair of zig-zag identities.
What 'left' refers to in 'left dual'
Remark
In this library, following EGNO, a left dual of is named by the side on which appears in the evaluation map . 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.
A left dual of an object has that object as a right dual
Statement
If is a left dual of an object , then is a right dual of . Dually, if is a right dual of , then is a left dual of .
Facts & Assumptions
Given: A left dual of .
A right dual of requires maps and satisfying the mirror zig-zag identities (Left dual and right dual object, The zig-zag identities).
Proof
Reuse the same two morphisms and , but now regard them as candidate right-dual data for the object with proposed right dual .
The first right-dual zig-zag for is exactly the second left-dual zig-zag for , and the second right-dual zig-zag for is exactly the first left-dual zig-zag for . Both are identities by the hypotheses that is a left dual of .
Hence is a right dual of . The dual assertion is the same argument with left and right interchanged.
The unit is self-dual
Statement
In any monoidal category, the tensor unit is both a left dual and a right dual of itself.
Facts & Assumptions
Given: A monoidal category with unit object .
The two unitors agree on the unit object: (The two unitors agree on the tensor unit).
A left or right self-duality of requires an evaluation and a coevaluation satisfying the corresponding zig-zag identities (Left dual and right dual object).
Proof
Take the evaluation to be and the coevaluation to be . By [L1], this is the same pair as and .
Substituting these maps into either zig-zag composite gives an instance of the triangle identity with every object equal to , so each composite is the identity of .
Therefore 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.
Reversing the tensor product exchanges left and right duals
Statement
Let be the reverse monoidal category of . An object is a left dual of in if and only if it is a right dual of in , and similarly with "left" and "right" interchanged.
Facts & Assumptions
Given: A monoidal category and an object of .
In the reverse monoidal category, the tensor order is reversed and the unitors are swapped: and (The reverse and the opposite of a monoidal category).
Left and right duality are defined by the explicit zig-zag composites in Left dual and right dual object.
Proof
Suppose is a left dual of in , with evaluation and coevaluation .
Writing the two left-dual zig-zag composites in and then translating them with [L1] replaces by reversed tensor order, by , and the reverse unitors by the ordinary opposite ones. The result is exactly the pair of right-dual zig-zag composites for as a right dual of in .
Therefore the left-dual axioms in are equivalent to the right-dual axioms in . The converse and the left/right-swapped statement are the same calculation in reverse.
Duals are unique up to a unique compatible isomorphism
Statement
If and are two left duals of the same object , then there is a unique isomorphism compatible with both evaluation and coevaluation:
The corresponding statement for right duals is also true.
Facts & Assumptions
Given: Two left duals and of .
Each pair satisfies the left-dual zig-zag identities (Left dual and right dual object, The zig-zag identities).
Proof
Define by the composite and define by the same formula with the subscripts interchanged.
Postcomposing the definition of with and precomposing it with , 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 .
The composite is the unique morphism compatible with and , 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 ; similarly . Thus is an isomorphism with inverse .
If 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.
Duality yields adjunctions of tensoring functors
Statement
If is a left dual of , then the functor is left adjoint to . Equivalently, for all objects there is a natural bijection
Dually, is right adjoint to .
Facts & Assumptions
Given: A monoidal category and a left dual of .
An adjunction is unit-counit data satisfying the two triangle identities (Adjunction by unit, counit, and the triangle identities).
The pair satisfies the zig-zag identities (Left dual and right dual object).
Proof
For each object , define a unit by For each object , define a counit by
The composite is exactly the first zig-zag for tensored with , and the composite is exactly the second zig-zag for tensored with . By [L2], both are identities.
Steps 1.1 and 2.1 provide an adjunction by [L1]. Transposition under this adjunction gives the displayed hom-set bijection, and the statement for right tensoring is the mirrored construction.
A dual object in the endofunctor category is an adjoint functor
Statement
Let be a category and write tensor product in its endofunctor category as composition. Then a left dual of an endofunctor is exactly a left adjoint of , and a right dual of is exactly a right adjoint of .
Facts & Assumptions
Given: Endofunctors .
A left dual of consists of natural transformations and satisfying the two zig-zag identities (The zig-zag identities).
An adjunction is a unit and counit satisfying the two triangle identities (Adjunction by unit, counit, and the triangle identities).
Proof
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.
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 are identities.
Therefore is a left dual of exactly when . The same comparison with the mirrored data shows that is a right dual of exactly when .
A second proof that adjoints are unique
Statement
If an endofunctor has two left adjoints and , then there is a unique natural isomorphism compatible with the two adjunction structures. The corresponding statement for right adjoints is also true.
Facts & Assumptions
Given: Endofunctors and adjunctions and .
An adjunction to is the same thing as a dual object of in the composition monoidal category (A dual object in the endofunctor category is an adjoint functor).
Duals of a fixed object are unique up to a unique compatible isomorphism (Duals are unique up to a unique compatible isomorphism).
Proof
By [L1], the two adjunctions and make and into two left duals of the same object in the endofunctor composition monoidal category.
Applying [L2] to those two duals yields a unique compatible isomorphism . Compatibility with the duality data is exactly compatibility with the units and counits of the two adjunctions by [L1].
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.
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.
Finite-dimensional vector spaces are rigid
Statement
For any field , every finite-dimensional -vector space is rigid in the monoidal category .
Facts & Assumptions
Given: A finite-dimensional -vector space .
The category is monoidal under (Modules over a commutative ring form a monoidal category).
If is a basis of , then the dual family is a basis of and satisfies (The dual family of a finite basis is a basis of the dual space, with the same dimension).
Finite-dimensional means that has such a finite basis (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis).
Proof
By [L3], choose a basis of . Let be the dual basis from [L2], and define
For each basis vector , the first zig-zag sends to By linearity it is the identity on .
For each dual basis vector , the second zig-zag sends to By linearity it is the identity on .
Thus is a left dual of . The same formulas, read in the mirrored order, make a right dual of as well, so is rigid. Since was arbitrary and [L1] supplies the monoidal structure, every finite-dimensional object of is rigid.
The dual of a morphism
Definition
Assume chosen left duals and of objects and . For a morphism , its left dual morphism
is the composite
Equivalently, 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.
Left duality is a contravariant antimonoidal functor
Statement
After choosing a left dual for each object , the assignment and defines a contravariant functor . Moreover, for all objects , the object is a left dual of , so there is a unique compatible isomorphism
and likewise .
Facts & Assumptions
Given: Chosen left duals for all objects of a left rigid monoidal category.
The dual of a morphism is defined by the transpose formula in The dual of a morphism.
A fixed object has at most one left dual up to unique compatible isomorphism (Duals are unique up to a unique compatible isomorphism).
The tensor unit is a left dual of itself (The unit is self-dual).
Proof
Expanding the definition from [L1] with and then straightening the resulting coevaluation-evaluation pair by the zig-zag identities shows .
The usual tensoring of the chosen dual pairs gives evaluation and coevaluation maps exhibiting as a left dual of . Since is the chosen left dual of the same object, [L3] gives a unique compatible isomorphism
For morphisms , the defining composite for contains the block between one coevaluation and one evaluation. Splitting that block into followed by yields exactly the composite for , so . Hence is contravariant.
By [L4], the tensor unit is itself a left dual of . Applying [L3] to the chosen left dual and this canonical one gives a unique compatible isomorphism . Together with step 1.2, this supplies the unit comparison, so is antimonoidal.
The double dual is a monoidal functor
Statement
With chosen left duals, the double-dual assignment is a monoidal endofunctor.
Facts & Assumptions
Given: Chosen left duals on a left rigid monoidal category.
Left duality is a contravariant antimonoidal functor (Left duality is a contravariant antimonoidal functor).
Proof
By [L1], is contravariant, so applying it twice yields a covariant endofunctor .
Again by [L1], there are compatible isomorphisms and . Dualizing once more reverses the order a second time, so the composite comparison gives together with a unit isomorphism .
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.
In a rigid category every morphism of monoidal functors is an isomorphism
Statement
Let be strong monoidal functors from a rigid monoidal category to a monoidal category . Then every monoidal natural transformation is a natural isomorphism.
Facts & Assumptions
Given: A rigid monoidal category , a monoidal category , strong monoidal functors , and a monoidal natural transformation .
Every object of has chosen duals because is rigid (Rigid object and rigid monoidal category).
A monoidal natural transformation respects both the tensor structure and the unit structure (Monoidal natural transformation).
Compatible maps between two left duals of the same object are unique (Duals are unique up to a unique compatible isomorphism).
Proof
Because is rigid, choose for each object a left dual . Since and are strong monoidal, they send the duality maps of to duality maps of and : after transporting the images of and across the strong monoidal structure isomorphisms, is a left dual of and is a left dual of .
Define using the transported duality maps by the composite This construction uses and as left duals of and from step 1.1; it does not identify a left dual of with .
Expand using step 2.1. Naturality of , together with its tensor and unit compatibility from [L2], moves across the coevaluation and evaluation; the remaining composite is the zig-zag identity for the dual pair . Hence . The mirrored calculation uses the zig-zag identity for and gives . Thus every component is an isomorphism, so is a natural isomorphism.
A braided rigid category has a Drinfeld morphism
Statement
In a braided rigid monoidal category there is a natural isomorphism
called the Drinfeld morphism (or Drinfeld isomorphism), defined by
Write
for the monoidal comparison of the double-dual functor. Then
Thus need not be monoidal: the double braiding is precisely its monoidality obstruction.
Facts & Assumptions
Given: A braided rigid monoidal category with braiding and chosen left duals.
Braiding is natural and satisfies the two hexagons (Braiding). Duals satisfy the evaluation/coevaluation zig-zags (Rigid object and rigid monoidal category).
Double duality has the monoidal comparisons (The double dual is a monoidal functor). In calculations, reassociations, unit constraints and chosen-dual comparison maps are understood.
Proof
Bending a crossing. For any object , naturality at evaluation and coevaluation, followed by the two hexagons and the zig-zags, gives Indeed expand in naturality at , then tensor on the left with and apply to cancel the adjacent cup and cap. Replacing throughout by gives the companion identity for . These are algebraic identities, independent of a graphical calculus.
A second left dual of . Put and . These give as a left dual of . To check the first zig-zag, expand ; 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 . For the other zig-zag expand ; the companion bending identity cancels the crossing pair and leaves .
Comparison and inverse. If and are left duals of an object , the maps and are inverse: substitution of either composite permits first the zig-zag and then the zig-zag, leaving the identity. They are the unique maps intertwining the evaluations, since tensoring that intertwining equation with recovers the displayed formula. Apply this to , from step 2.1, and with its chosen duality. The comparison is precisely the displayed , and its inverse is Thus and . For , the mate equations for , and naturality of show that both and intertwine the same evaluation pairing; uniqueness of the comparison gives .
Tensor relation. Work first with the canonical tensor dual . Its evaluation is , and the coevaluation of its dual is . Insert these into the formula for . Expand its middle braiding using, successively, and . This produces the four crossings of with . Bend the crossing across its evaluation and the crossing across its evaluation by the two identities of step 1.1. The remaining and crossings and their cups and caps are respectively and , while the two bent crossings on the input are . Consequently the expanded composite is . Reinsert the chosen-dual comparison from [L2] and multiply on the right by to obtain exactly the stated identity. Steps 3.1 and 4.1 prove the natural-isomorphism and obstruction claims.
The categorical trace of a morphism into the double dual
Definition
Fix a rigid monoidal category with chosen left duals. For a morphism , the left categorical trace of is the endomorphism of the unit
For a morphism , the right categorical trace of is
So a bare endomorphism is not yet an input to categorical trace; one first needs a comparison between and a double dual.
What is needed before a trace can be written
Remark
The hypothesis ladder is strict.
- Rigidity is what types and at all, because their formulas use evaluation and coevaluation maps.
- A chosen comparison turns an endomorphism into a traceable morphism . 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 from A braided rigid category has a Drinfeld morphism already makes 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.
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
Equivalently, it is a natural family of isomorphisms such that
after transporting along the monoidal structure of the double-dual functor.
The dimension of an object relative to a pivotal structure
Definition
Let be a pivotal structure on a rigid monoidal category. The dimension of an object relative to is
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.
Basic properties of the categorical trace
Statement
Let be a rigid monoidal category, let and , and suppress the monoidal and chosen-dual comparison maps. For write and for its left and right actions on , transported from and by the unit constraints.
- .
- If the category is additive, then .
- The general tensor formula is . If , this becomes . 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 -linear monoidal category with -bilinear tensor product and .
- For every endomorphism , .
The corresponding right-trace duality, additivity and cyclicity statements hold. For right-trace inputs and , the general tensor formula is
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 and , and when needed an additive structure.
Chosen left duality is contravariant and antimonoidal, with evaluation and coevaluation satisfying the two zig-zags (Left duality is a contravariant antimonoidal functor).
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.
A braiding is natural and satisfies the two hexagon identities (Braiding).
Proof
Sliding a morphism. The defining mate identities for are and . Apply the first identity to . Postcomposing with gives , where the last trace is taken on . This proves clause 1 without identifying a double dual with the original object.
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 for the injections and projections of . Relative to , its coevaluation is , and its evaluation pairs matching summands by and different summands by zero. These formulas satisfy the zig-zags since is the identity for and zero otherwise, so uniqueness of duals permits their use for the chosen dual. Inserting leaves exactly the two diagonal trace composites. Their sum is , proving clause 2.
Nested tensor trace. Use . The coevaluation of is . The evaluation of its dual first pairs the middle and then the outer . Substitute into this composite. Evaluating the middle pair gives situated between and . Thus the result is exactly . If , the inserted scalar instead acts on the left of the whole evaluation input. Naturality of that left action at moves it to the output unit, giving . 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.
Cyclicity, including different objects. More generally, for and , the first mate identity in step 1.1 and then the second identity applied to give . Thus . Taking , and proves clause 4. The mirrored mate identities give the corresponding right-trace cyclicity.
Sufficient hypotheses and right trace. In a braided category the hexagon at , with unit constraints inserted, makes the unit-transported an idempotent automorphism of , hence the identity. Naturality of at gives . Compatibility with the unit identifies with the composite , so . Alternatively, in a -linear category with bilinear tensor and , each has both actions . For the right tensor trace, use the coevaluation of : first close the middle pair with , leaving immediately to the left of . The remaining composite is exactly . 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 alone does not imply equality of its two actions. For example, take the rigid matrix category whose simple objects satisfy for and , with unit and . Choose the usual matrix-unit evaluations and coevaluations. If and , their left traces are the two orthogonal unit projections . Their product is zero, whereas . The nested formula remains valid: , while .
Twist and ribbon structure
Definition
Let be a braided rigid monoidal category with braiding , and fix left duals for all objects together with the dual-morphism operation of The dual of a morphism.
A twist on is a natural automorphism such that
for all objects and .
A ribbon structure is a twist satisfying the dual-compatibility condition
A twist on a braided rigid category is the same thing as a pivotal structure of Drinfeld type
Statement
Let be a braided tensor category and let be its Drinfeld isomorphism. For a natural automorphism of the identity functor, put
Then is a pivotal structure if and only if is a twist.
Facts & Assumptions
Given: A braided tensor category, its Drinfeld isomorphism , and a natural automorphism of the identity functor.
EGNO formula (8.35) and the sentence after it state exactly that is a tensor isomorphism if and only if is a twist.
The Drinfeld morphism exists, and in a braided tensor category it is an isomorphism (A braided rigid category has a Drinfeld morphism).
A pivotal structure is precisely a monoidal natural isomorphism (Pivotal structure).
A twist is precisely a natural automorphism satisfying the double-braiding tensor law (Twist and ribbon structure).
Proof
By [L1], the family is invertible, so every natural isomorphism can be written uniquely as for a natural automorphism of the identity.
The tensor relation for from the Drinfeld-morphism theorem inserts exactly one double braiding between and . Therefore the condition that be monoidal is equivalent to the condition that absorb that double braiding, namely which is the twist law from [L3].
Hence is a pivotal structure exactly when is a twist.
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 -linear abelian rigid monoidal category over an algebraically closed field with , 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
Not every monoidal category is rigid
Statement refuted
Every monoidal category is rigid.
Facts & Assumptions
Given: A field , the monoidal category , and the infinite-dimensional vector space .
A vector space with no finite basis is infinite-dimensional (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis).
Counterexample
Let be a field and let be the category of all -vector spaces with the usual tensor product and unit object . This is a monoidal category, and is infinite-dimensional by [L1].
Assume for contradiction that had a left dual . Because is a single tensor in an algebraic tensor product, it is a finite sum with . Applying the first zig-zag identity to any gives so every vector of lies in the span of the finite set .
Step 1.2 makes finite-dimensional, contradicting that has no finite basis. Therefore has no left dual, hence is not rigid, so is a monoidal category that is not rigid.
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 , its endofunctor category under composition, and the monotone maps defined in the proof.
Counterexample
Let be the ordered set of integers regarded as a small category, so there is a unique morphism exactly when . Let , , , and . Directly from the defining inequalities, Thus and .
Let be the full subcategory of 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 . 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 , and their units and counits lie in the full subcategory. Hence every object of has both duals and is rigid.
In the endofunctor category of a poset, a natural transformation exists exactly when for all , so two endofunctors are isomorphic exactly when they are equal pointwise. Here , so there is no natural transformation and therefore no isomorphism . Thus the object has nonisomorphic left and right duals.
If the chosen left duality on uses left adjoints, then and . Since , the endofunctors and are not isomorphic. Therefore in this rigid monoidal category neither left/right duals nor double duals are forced to collapse.
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 .
The trace ladder states that rigidity is needed to define categorical trace at all (What is needed before a trace can be written).
A pivotal structure is the extra comparison needed to turn an endomorphism into a traceable morphism (Pivotal structure).
Refutation
By the hypothesis ladder in What is needed before a trace can be written, categorical trace is first defined on a morphism or , so rigidity is already required before any trace expression is even well typed.
Even in a rigid category, an endomorphism does not itself have the required source and target. One needs a pivotal structure to insert a comparison or , as recorded in Pivotal structure.
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: 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 of all vector spaces and its infinite-dimensional object .
The trace formulas require evaluation and coevaluation maps (What is needed before a trace can be written).
The symmetric monoidal category of all vector spaces has an infinite-dimensional object with no categorical dual (Not every monoidal category is rigid).
Refutation
The usual symmetry makes braided, but [L2] shows that its object has no evaluation and coevaluation satisfying the zig-zag identities.
Consequently the trace composites described in [L1] cannot even be formed for . The braiding supplies swaps but does not supply the missing duality maps.
Therefore braiding without rigidity does not suffice to define categorical trace. The statement is false.
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.
The category contains an object whose left and right duals are not isomorphic (Left and right duals, and double duals, need not collapse).
Refutation
The counterexample Left and right duals, and double duals, need not collapse constructs the composition-closed rigid monoidal subcategory generated by an adjoint chain, containing an object whose left dual is and whose right dual is .
In that category, endofunctors are isomorphic only when they agree pointwise, but and . So .
Hence there exists an object whose left and right duals are not isomorphic, so the statement is false.
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.
That category is a counterexample to universal rigidity (Not every monoidal category is rigid).
Refutation
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.
Therefore that monoidal category is not rigid.
So the universal statement is false.
Sources
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definitions 2.10.1-2.10.2
- Michael Muger, Tensor Categories: A Selective Guided Tour, Section 1.5
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, formulas (2.43)-(2.46)
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Remark 2.10.3
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Section 2.10
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Proposition 2.10.5
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Proposition 2.10.8
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Exercise 2.10.4
- Emily Riehl, Category Theory in Context, Definition 4.1.1
- Emily Riehl, Category Theory in Context, Proposition 4.2.4
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definition 2.10.11
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Example 2.10.12
- nLab, rigid monoidal category
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definition 4.7.7
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Exercise 2.10.15
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, formula (8.30), Proposition 8.9.3, and Proposition 8.10.6
- A. Bruguières and A. Virelizier, Hopf monads, Lemma 8.1 and Remark 8.2
- T. Shibata and K. Shimizu, Modified traces and the Nakayama functor, Section 6.4
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definition 4.7.1
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Remark 4.7.2 and Sections 8.9-8.10
- A. Bruguieres and A. Virelizier, Hopf monads, Lemma 8.1
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definitions 4.7.7-4.7.8
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definition 4.7.11
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Proposition 4.7.3
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definition 8.10.1
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, formula (8.35) and Proposition 8.10.6
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definitions 4.1.1 and 4.2.3
- Keith Conrad, Infinite-Dimensional Dual Spaces
- Michael Muger, Tensor Categories: A Selective Guided Tour, p. 16
- MathOverflow, The dual of a dual in a rigid tensor category
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definition 4.7.1 and Remark 4.7.2
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Sections 8.9-8.10