Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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 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

Depends on

Used by

Dependency tree · two levels

11 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