Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck pass
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 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.

Depends on

Used by

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