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.

Duality yields adjunctions of tensoring functors

Statement

If V∨ is a left dual of V, then the functor V∨⊗− is left adjoint to V⊗−. Equivalently, for all objects U,W there is a natural bijection

Hom⁡(V∨⊗U,W)≅Hom⁡(U,V⊗W).

Dually, −⊗V∨ is right adjoint to −⊗V.

Facts & Assumptions

Given: A monoidal category and a left dual (V∨,ev⁡V,coev⁡V) of V.

[L1]

An adjunction is unit-counit data satisfying the two triangle identities (Adjunction by unit, counit, and the triangle identities).

[L2]

The pair (V∨,ev⁡V,coev⁡V) satisfies the zig-zag identities (Left dual and right dual object).

Proof

technique · direct
1.1givenL1L2construct

For each object U, define a unit ηU:U→V⊗(V∨⊗U) by U→λU−11⊗U→coev⁡V⊗1U(V⊗V∨)⊗U→αV,V∨,UV⊗(V∨⊗U). For each object W, define a counit εW:V∨⊗(V⊗W)→W by V∨⊗(V⊗W)→αV∨,V,W−1(V∨⊗V)⊗W→ev⁡V⊗1W1⊗W→λWW.

2.1step 1.1L2

The composite (V⊗εW)∘ηV⊗W is exactly the first zig-zag for V∨ tensored with W, and the composite εV∨⊗U∘(V∨⊗ηU) is exactly the second zig-zag for V∨ tensored with U. By [L2], both are identities.

3.1step 2.1L1∎

Steps 1.1 and 2.1 provide an adjunction V∨⊗−⊣V⊗− by [L1]. Transposition under this adjunction gives the displayed hom-set bijection, and the statement for right tensoring is the mirrored construction.

Depends on

Used by

Dependency tree · two levels

5 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