Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passverified 2026-11-05 (gpt-6.1-sol)
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.

Uniqueness of a representing dual fusion product

Statement

Let C be a category and let F:Cop→VectC be a contravariant functor. A representing pair for F is an object D with an element γ∈F(D) such that, for every object M, the map HomC(M,D)→F(M) sending T to F(T)(γ) is a bijection. If (D,γ) and (D′,γ′) both represent F, then there is a unique isomorphism f:D→D′ satisfying γ=F(f)(γ′).

Statement references

The universal property used here is the abstract representing property that also defines a dual fusion product on this page.

Facts & Assumptions

Given: A contravariant functor F and two representing pairs (D,γ) and (D′,γ′).

[A1]

Both pairs satisfy the representing bijection in the Statement for every object of C.

Proof

1.1givenA1construct

Apply the representing bijection for (D′,γ′) with M=D to γ∈F(D). It gives a unique morphism f:D→D′ with γ=F(f)(γ′).

1.2givenA1construct

Apply the representing bijection for (D,γ) with M=D′ to γ′∈F(D′). It gives a unique morphism g:D′→D with γ′=F(g)(γ).

2.1givenA1step 1.1step 1.2algebra∎

By contravariance, F(g∘f)=F(f)∘F(g). Steps 1.1–1.2 give F(g∘f)(γ)=F(f)(γ′)=γ, and the identity morphism has the same image; uniqueness for (D,γ) gives g∘f=idD. The same argument gives f∘g=idD′. Any other compatible morphism is equal to f by uniqueness in the representing bijection for (D′,γ′). Thus f is the unique compatible isomorphism.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources