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

Left duality is a contravariant antimonoidal functor

Statement

After choosing a left dual X∨ for each object X, the assignment X↦X∨ and f↦f∨ defines a contravariant functor (−)∨:Cop→C. Moreover, for all objects X,Y, the object Y∨⊗X∨ is a left dual of X⊗Y, so there is a unique compatible isomorphism

(X⊗Y)∨≅Y∨⊗X∨,

and likewise 1∨≅1.

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

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

1.2L3algebra

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

2.1step 1.1L1algebra

For morphisms X→fY→gZ, the defining composite for (g∘f)∨ contains the block g∘f between one coevaluation and one evaluation. Splitting that block into g followed by f yields exactly the composite for f∨∘g∨, so (g∘f)∨=f∨∘g∨. Hence (−)∨ is contravariant.

3.1step 1.2L3L4∎

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

Depends on

Used by

Dependency tree · two levels

6 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