Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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.

The end of the function-set functor on a representable is evaluation

Statement

Let C be small (Small, locally small, and large categories) and let a be an object of C. Write Set(X,Y) for the hom-set of Set, which is the set YX of functions XY (Sets and functions form the large locally small category Set, The set BA of all functions AB).

Covariant case. For F:CSet, let H(c1,c2):=Set(C(a,c1),Fc2), a functor Cop×CSet (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category). Then

cSet(C(a,c),Fc)    F(a).

Contravariant case. For a presheaf P:CopSet (Opposite category Cop), let H(c1,c2):=Set(C(c2,a),Pc1), again a functor Cop×CSet. Then

cSet(C(c,a),Pc)    P(a).

So the end of the function-set functor on a representable is evaluation (The end and the coend of a functor Cop×CD), the isomorphism sending a family to its value at the identity of a.

Facts & Assumptions

Given: A small category C, an object a of C, a functor F:CSet and a presheaf P:CopSet.

[F5]

A category is small when both Ob(C) and Mor(C) are sets; a small category is locally small (Small, locally small, and large categories).

[F4]

Sets as objects and functions as morphisms form a large locally small category Set (Sets and functions form the large locally small category Set).

[F2]

The functions AB form the set BA, and Thus fBA holds if and only if f:AB. (The set BA of all functions AB).

[F1]

The covariant hom-assignment C(a,) sends b to C(a,b) and u:bc to u:C(a,b)C(a,c),fuf, while the contravariant hom-assignment C(,a) sends u to precomposition (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[F6]

The opposite category has the same objects and reverses every morphism: Cop(A,B)=C(B,A) (Opposite category Cop).

[F7]

A wedge from d to T is a family ωc:dT(c,c) with T(1c,f)ωc=T(f,1c)ωc for every f:cc, and a morphism of wedges is a morphism of the vertices commuting with every component (Wedges and cowedges, and the categories they form).

[F3]

An end of T is a terminal object of the category of wedges over T and a coend an initial object of the category of cowedges under T; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor Cop×CD).

[L1]

For a small source category and a locally small target, the set of natural transformations is an end of the hom-bifunctor of the values: Nat(F,G)=cD(Fc,Gc), with the integrand (c1,c2)D(Fc1,Gc2) (For a small source category, the set of natural transformations is an end of the hom-bifunctor of the values).

[L2]

For locally small C the evaluation maps Ea,F:Nat(C(a,),F)F(a) are bijections natural in both variables, given by ααa(1a) (The Yoneda bijection Nat(C(a,),F)F(a) is natural in both a and F).

[L3]

For locally small C, an object a and a presheaf P, evaluation at the identity gives a bijection EPa:Nat(C(,a),P)P(a),EPa(α)=αa(1a) (For a presheaf P, Nat(C(,a),P)P(a) naturally in a and P).

Proof

technique · direct
1.1

The variance of each integrand is fixed before anything is computed. In H the representable sits inside the first argument of a function set, and Set(,Y) reverses that argument, so c1Set(C(a,c1),Y) is contravariant while c2Fc2 is covariant; hence H is a functor on Cop×C of the shape (c1,c2)Set(Ac1,Bc2) with A=C(a,) and B=F both covariant on C. In H the same two reversals apply to C(,a) and to P, and both are contravariant on C, so H has the shape (c1,c2)Set(Ac2,Bc1) with A=C(,a) and B=P functors on Cop.

F1F2F4F5
1.2

An end over Cop of a functor T on (Cop)op×Cop is an end over C of the functor with its two slots exchanged. Indeed, writing T(x,y):=T(y,x), a morphism f:cc of Cop is a morphism f:cc of C, and the wedge equation T(1c,f)ωc=T(f,1c)ωc becomes T(f,1c)ωc=T(1c,f)ωc, which is the wedge equation for T at that morphism of C. The two wedge categories therefore have the same objects and the same morphisms.

F6F7
2.1

For the covariant case, H has the shape required by [L1] with source C and target Set, which is locally small by [F4], so cSet(C(a,c),Fc)=Nat(C(a,),F). By [L2] evaluation at the identity is a bijection from that set to F(a).

F3L1L2step 1.1
3.1

For the contravariant case, step 1.2 rewrites cSet(C(c,a),Pc) as the end over Cop of (x,y)Set(Ax,By), and Cop is small with C, so [L1] applied with source Cop gives Nat(C(,a),P), the natural transformations being taken between presheaves. By [L3], evaluation at the identity is a bijection from that set to P(a). The contravariant published corollary is used here rather than the covariant statement read in an opposite category.

F3F5L1L3step 1.1step 1.2step 2.1

Remarks

Both displays are ends of a function-set functor, and in each the representable occupies the argument that the function set reverses. Writing either display with the representable in the other slot changes the variance of the integrand and gives a different functor, so the two cases are stated and proved separately rather than by symmetry.

The isomorphism is evaluation at 1a in both cases, which is where the object a enters: the component of the wedge at c=a is the only one that sees the identity, and it is what the published Yoneda bijection inverts.

Depends on

Used by

Dependency tree · two levels

27 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