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

Reversing the tensor product exchanges left and right duals

Statement

Let Crev be the reverse monoidal category of C. An object is a left dual of X in Crev if and only if it is a right dual of X in C, and similarly with "left" and "right" interchanged.

Facts & Assumptions

Given: A monoidal category C and an object X of C.

[L1]

In the reverse monoidal category, the tensor order is reversed and the unitors are swapped: λXrev=ρX and ρXrev=λX (The reverse and the opposite of a monoidal category).

[L2]

Left and right duality are defined by the explicit zig-zag composites in Left dual and right dual object.

Proof

technique · direct
1.1

Suppose Y is a left dual of X in Crev, with evaluation YrevX=XY1 and coevaluation 1XrevY=YX.

givenL1L2
2.1

Writing the two left-dual zig-zag composites in Crev and then translating them with [L1] replaces rev by reversed tensor order, αrev by α1, and the reverse unitors by the ordinary opposite ones. The result is exactly the pair of right-dual zig-zag composites for Y as a right dual of X in C.

step 1.1L1L2
3.1

Therefore the left-dual axioms in Crev are equivalent to the right-dual axioms in C. The converse and the left/right-swapped statement are the same calculation in reverse.

step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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