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.
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 .
Depends on
Used by
- Balancing and the Hopf-link character identity Lemma
- Colored signed twist surgery, circumcision, and paired-handle cancellation Lemma
- Modular Gauss sums, the Kirby color, and its slide identity Lemma
- Outside-alcove rank-one tiltings have zero pivotal dimension Lemma
- Partial-trace closure of negligible morphisms Lemma
- RT capped operators: geometric Gram factors and exact signature gluing Lemma
- RT handlebody pairings and surgery gluing Lemma
- The complete Kirby-color band-slide identity with open colored graph coupons Lemma
- The ribbon trace equals the framed-closure evaluation Lemma
- In a spherical category the left and right traces agree Theorem
- The rank-one tilting quotient is the truncated fusion category Theorem
- The rank-one tilting quotient matches the Temperley-Lieb ribbon convention Theorem
- The writhe-normalized ribbon trace is an unframed link invariant Theorem
Dependency tree · two levels
14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Proposition 4.7.3 (standard reference, not scraped)