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

A supplied pointwise right adjoint extends uniquely to a functor

Statement

Let F:C→D be a functor between locally small categories. Suppose an object Gd∈C is supplied for every d∈D, together with an isomorphism

θd:D(F(−),d)≅C(−,Gd)

natural in the variable of C. Then the object assignment d↦Gd has a unique functor structure for which the θd are natural in d, and F⊣G.

Facts & Assumptions

Given: The functor F, supplied objects Gd, and representing isomorphisms θd as in the Statement.

[F1]

A representation of a presheaf is an object together with a natural isomorphism from the corresponding representable presheaf (Presheaves, covariantly and contravariantly representable functors, and representations).

[F2]

The Yoneda bijection is natural in both the represented object and the presheaf, so a natural transformation between represented presheaves is induced by a unique morphism between their representing objects (The Yoneda bijection Nat⁡(C(a,−),F)≅F(a) is natural in both a and F).

[L1]

A natural family D(Fc,d)≅C(c,Gd) determines an adjunction (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Proof

technique · direct
1.1F1F2construct

For h:d→d′, postcomposition by h gives a natural transformation D(F(−),d)⇒D(F(−),d′). Transport it through θd and θd′; [F2] supplies a unique morphism G(h):Gd→Gd′ representing the result.

2.1step 1.1F2

Postcomposition by an identity is the identity transformation, so Yoneda uniqueness gives G(1d)=1Gd.

2.2step 1.1F2

Postcomposition by kh is the composite of postcomposition by h and by k, so Yoneda uniqueness gives G(kh)=G(k)G(h). Thus G is a functor.

3.1step 1.1step 2.1step 2.2L1

The definition in step 1.1 makes θ natural in d; it was natural in c by hypothesis. Therefore [L1] gives F⊣G.

4.1step 1.1F2∎

If another functor structure made every θd natural, its value on h would induce the same transported natural transformation, so [F2] would force it to equal G(h). The supplied object assignment also shows that no class-sized selection was made in the proof.

Depends on

Used by

Dependency tree · two levels

15 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