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

For a presheaf P, Nat⁡(C(−,a),P)≅P(a) naturally in a and P

Statement

Let C be locally small, let a be an object, and let P:Cop→Set be a presheaf. Evaluation at the identity gives a bijection

EPa:Nat⁡(C(−,a),P)→≅P(a),EPa(α)=αa(1a),

whose inverse sends x∈P(a) to the natural transformation with c-component f:c→a↦P(f)(x). It is natural in both variables. In particular, for h:a→a′ and β:C(−,a′)⇒P,

EPa(β∘C(−,h))=P(h)(EPa′(β)),

and postcomposition by a natural transformation P⇒Q corresponds to its component at a.

Facts & Assumptions

Given: The locally small category C, object a, presheaf P, and the morphisms and natural transformations in the statement.

[L1]

For a covariant functor F:D→Set, evaluation at the identity is a bijection Nat⁡(D(d,−),F)→F(d) whose inverse sends x∈F(d) to the transformation with component αcx(f)=F(f)(x) (Evaluation at the identity gives Nat⁡(C(a,−),F)≅F(a) and proves that the natural-transformation collection is a set), and this bijection is natural in d and in F (The Yoneda bijection Nat⁡(C(a,−),F)≅F(a) is natural in both a and F).

[F1]

The opposite category has the same objects and satisfies Cop(a,c)=C(c,a) (Opposite category Cop).

[L2]

A theorem derived from category axioms has a formal dual obtained by reversing morphisms and composition (Every theorem about categories has a formal dual obtained by reversing morphisms and composition).

Proof

technique · direct
1.1

Apply [L1] to D=Cop, the object a, and the covariant functor P of [F2]; by [F1], its hom-functor Cop(a,−) is C(−,a), and the inverse formula becomes f:c→a↦P(f)(x).

L1F1F2
1.2

Under the same translation, a morphism h:a→a′ in C is reversed in Cop, so naturality in the object becomes the displayed equation with C(−,h) and P(h); naturality in P is unchanged.

L1F1L2
2.1

Steps 1.1 and 1.2 prove the bijection, its inverse formula, and both naturalities.

step 1.1step 1.2∎

Depends on

Used by

Dependency tree · two levels

14 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