Alphabeta Math
Session-authored (Fable 5 assisted)
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.

13 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 13 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Universal Properties, Representables and the Yoneda Lemma

1 · Prerequisites

2 · Summary

Locally small categories supply set-valued hom-collections, while opposite and product categories control their variance. Functors, natural transformations, and natural isomorphisms provide the laws used below; the small-source convention for functor categories separates actual presheaf categories from large-source metatheoretic notation. Initial, terminal, and comma categories supply the categorical language for universal factorisations.

The hom-assignments assemble into a bifunctor and lead to representable functors, representations, and generalized elements. Evaluation at an identity gives the Yoneda bijection, its naturality in both variables, and the contravariant form. For a small source, the Yoneda functor is fully faithful and detects object isomorphisms. Universal elements then express representations by unique factorisation, yielding compatible uniqueness, their initial or terminal descriptions in categories of elements, and the corresponding comma-category descriptions of universal arrows.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-13Open item page →

The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category

Definition

Let C be a locally small category, so every hom-collection C(a,b) is a set (Category, object, morphism, domain, codomain, identity, composition, and hom-collection, Small, locally small, and large categories). Since sets and functions form Set (Sets and functions form the large locally small category Set), the following assignments take values in Set.

For an object a, the covariant hom-assignment C(a,) sends an object b to C(a,b) and a morphism u:bc to the function

u:C(a,b)C(a,c),fuf.

The contravariant hom-assignment C(,a) sends b to C(b,a) and u:bc to

u:C(c,a)C(b,a),ggu.

Equivalently, the latter is an assignment on Cop (Opposite category Cop). Their functor laws are proved in The assignments C(a,) and C(,a) are functors to Set .

The two variables combine into the hom-assignment

C(,):Cop×CSet.

It sends (a,b) to C(a,b). A morphism (a,b)(a,b) in the product category consists of h:aa and u:bb in C (Product category and its projection functors), and its action is

C(h,u):C(a,b)C(a,b),fufh.

That this assignment is a functor, and hence a bifunctor, is proved in The hom-assignment C(,):Cop×CSet is a bifunctor .

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The assignments C(a,) and C(,a) are functors to Set

Statement

Let C be a locally small category and let a be an object. The covariant hom-assignment C(a,):CSet and the contravariant hom-assignment C(,a):CopSet of The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category are functors.

Facts & Assumptions

Given: A locally small category C, an object a, morphisms u:bc and v:cd, and the identity and associativity axioms of C.

[F1]

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

[F2]

A covariant functor preserves identities and composites; a contravariant functor from C means a covariant functor from Cop (Covariant functor, identity functor, composite functor, and contravariant functor).

Proof

technique · direct
1.1

The maps in [F1] have the asserted source and target: if f:ab then uf:ac, and if g:ca then gu:ba.

givenF1
1.2

Postcomposition by 1b fixes every f:ab, and precomposition by 1b fixes every g:ba.

givenF1
1.3

For f:ab, one has (vu)(f)=(vu)f=v(uf)=v(u(f)).

givenF1
1.4

For g:da, one has (vu)(g)=g(vu)=(gv)u=u(v(g)), which is the composition law in Cop.

givenF1
2.1

Steps 1.1--1.4 give the identity and composition laws required by [F2], so both hom-assignments are functors to Set.

step 1.1step 1.2step 1.3step 1.4F2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The hom-assignment C(,):Cop×CSet is a bifunctor

Statement

For every locally small category C, the hom-assignment

C(,):Cop×CSet

of The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category is a functor. Its restrictions in the two variables are the contravariant and covariant hom-functors of The assignments C(a,) and C(,a) are functors to Set.

Facts & Assumptions

Given: A locally small category C; morphisms h:aa, k:aa, u:bb, and v:bb; and the category axioms of C.

[L1]

The one-variable assignments C(a,) and C(,a) are functors to Set (The assignments C(a,) and C(,a) are functors to Set).

[F1]

A morphism in a product category is a pair, and identities and composition are componentwise (Product category and its projection functors).

[F2]

The hom-assignment sends (h,u) to fufh (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

Proof

technique · direct
1.1

If f:ab, then ufh:ab, so [F2] defines a function C(a,b)C(a,b).

givenF2
1.2

For every f:ab, the identity pair acts by 1bf1a=f.

givenF1F2
1.3

Applying (h,u) and then (k,v) sends f to v(ufh)k=(vu)f(hk), which is the action of their componentwise composite in Cop×C.

givenF1F2
2.1

Steps 1.1--1.3 prove the functor laws, and fixing either variable recovers the postcomposition or precomposition action of [L1]; hence the hom-assignment is the asserted bifunctor.

step 1.1step 1.2step 1.3L1
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-13Open item page →

Generalized elements and their shapes

Definition

Let A and S be objects of a category C (Category, object, morphism, domain, codomain, identity, composition, and hom-collection). A generalized element of A of shape S is a morphism x:SA. The domain S is its shape.

For a set A, ordinary elements are exactly generalized elements of singleton shape: a function 1A is determined by the image of the unique point, and every element of A determines such a function. Other shapes can record more structure than singleton-shaped elements do.

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-13Open item page →

Presheaves, covariantly and contravariantly representable functors, and representations

Definition

Let C be a locally small category. A presheaf on C is a functor P:CopSet, with opposite category as in Opposite category Cop and Set as in Sets and functions form the large locally small category Set.

A covariant functor F:CSet is covariantly representable when there are an object R and a natural isomorphism

θ:C(R,)F.

The pair (R,θ) is a representation of F, and R is a representing object.

A presheaf P:CopSet is contravariantly representable when there are an object R and a natural isomorphism

θ:C(,R)P.

The same terms are used for (R,θ) and R. The hom-functors exist by The assignments C(a,) and C(,a) are functors to Set, and natural transformations and natural isomorphisms have the meanings of Natural transformation and its components and Natural isomorphism. When the variance is clear, representable is used without an adjective.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Initial and terminal objects are exactly the representations of the constant singleton functor

Statement

Let C be a locally small category and let 1:CSet and 1:CopSet denote the constant functors at a singleton set.

An object I is initial if and only if I represents the covariant constant singleton functor, and an object T is terminal if and only if T represents the contravariant constant singleton functor. Consequently the covariant functor is representable exactly when C has an initial object, and the presheaf is representable exactly when C has a terminal object.

Facts & Assumptions

Given: A locally small category C and the constant singleton functors in the statement.

[F1]

An object I is initial when every C(I,A) has exactly one morphism, and T is terminal when every C(A,T) has exactly one morphism (Initial object, terminal object, and zero object).

[F2]

A covariant functor is represented by I through a natural isomorphism C(I,)F, and a presheaf is represented by T through C(,T)P (Presheaves, covariantly and contravariantly representable functors, and representations).

[F3]

Sets and functions form the category Set (Sets and functions form the large locally small category Set).

Proof

technique · direct
1.1

If I is initial, each C(I,A) is a singleton by [F1], so its unique function to 1(A) is a bijection; these functions are natural because every map between singleton sets is the unique such map. Thus C(I,)1.

F1F2F3
1.2

Conversely, if C(I,)1, every C(I,A) is bijective with a singleton and is therefore a singleton, so I is initial.

F1F2
1.3

If T is terminal, the same componentwise construction gives C(,T)1, and any such representation makes every C(A,T) a singleton; hence the terminal equivalence holds.

F1F2F3
2.1

Steps 1.1--1.3 show that a representing object exists exactly when the corresponding initial or terminal object exists. In the empty category the constant functors still exist but there is no object that could represent either one, in agreement with both equivalences.

step 1.1step 1.2step 1.3
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Initial and terminal objects are unique up to a unique isomorphism

Statement

Any two initial objects in a category are joined by a unique isomorphism. Any two terminal objects are likewise joined by a unique isomorphism.

Facts & Assumptions

Given: A category C and either two initial objects I,I or two terminal objects T,T.

[F1]

From an initial object there is exactly one morphism to every object, and into a terminal object there is exactly one morphism from every object (Initial object, terminal object, and zero object).

[F2]

A morphism is an isomorphism when it has a two-sided inverse (Isomorphism, groupoid, and connected category).

[L1]

A formal theorem derived from the category axioms has a 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

If I and I are initial, let f:II and g:II be their unique morphisms in the indicated directions.

givenF1
1.2

The identity is the unique endomorphism of an initial object, so gf=1I and fg=1I.

F1
2.1

By steps 1.1 and 1.2, f is an isomorphism with inverse g.

step 1.1step 1.2F2
2.2

Any isomorphism II is a morphism with that source and target and must equal the unique morphism f, so the isomorphism is unique.

step 1.1F1
3.1

Applying the dual argument of [L1] to terminal objects gives a unique isomorphism TT.

step 2.1step 2.2L1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Evaluation at the identity gives Nat(C(a,),F)F(a) and proves that the natural-transformation collection is a set

Statement

Let C be a locally small category, let a be an object, and let F:CSet be a functor. Evaluation at the identity defines a bijection

Ea,F:Nat(C(a,),F)F(a),Ea,F(α)=αa(1a).

Its inverse sends xF(a) to the natural transformation αx whose component at c is

αcx:C(a,c)F(c),αcx(f)=F(f)(x).

The explicit parametrization by the set F(a) proves that the natural-transformation collection in the display is a set. The construction makes no choice from a family of nonempty sets.

Facts & Assumptions

Given: A locally small category C, an object a, a functor F:CSet, and the identity, composition, and functor laws.

[F1]

The assignment C(a,) is the functor that sends c to C(a,c) and u:cd to postcomposition fuf (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The assignments C(a,) and C(,a) are functors to Set).

[F2]

A natural transformation α:HF has components αc:H(c)F(c) satisfying F(u)αc=αdH(u) for every u:cd (Natural transformation and its components).

[F3]

A function is bijective when it is injective and surjective, equivalently when it has a two-sided inverse (Injection, surjection, bijection).

Proof

technique · constructive
1.1

For every natural transformation α:C(a,)F, the value αa(1a) lies in F(a), so evaluation defines the displayed map Ea,F.

givenF1F2construct
1.2

For xF(a) and each object c, define αcx(f):=F(f)(x) for f:ac.

givenF1construct
2.1

If u:cd, then F(u)(αcx(f))=F(u)(F(f)(x))=F(uf)(x)=αdx(uf); by [F1] and [F2], the family αx is natural.

step 1.2F1F2
2.2

Evaluation recovers x: Ea,F(αx)=αax(1a)=F(1a)(x)=x.

step 1.1step 1.2
2.3

If α:C(a,)F and f:ac, naturality at f gives αc(f)=αc(f1a)=F(f)(αa(1a))=αcEa,F(α)(f).

step 1.1step 1.2F1F2
3.1

Steps 2.2 and 2.3 make xαx a two-sided inverse to Ea,F, so [F3] gives the claimed bijection; its range is indexed by the set F(a), and every inverse value is given by a formula, so the asserted sethood and choice-freeness follow.

step 2.1step 2.2step 2.3F3discharge-construct
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The Yoneda bijection Nat(C(a,),F)F(a) is natural in both a and F

Statement

Under the hypotheses of Evaluation at the identity gives Nat(C(a,),F)F(a) and proves that the natural-transformation collection is a set, the bijections

Ea,F:Nat(C(a,),F)F(a)

are natural in both variables. Explicitly:

  1. if h:aa and α:C(a,)F, then Ea,F(αC(h,))=F(h)(Ea,F(α));
  2. if η:FG, then Ea,G(ηα)=ηa(Ea,F(α)).

Here C(h,):C(a,)C(a,) is precomposition by h. These equations make sense for every locally small C and do not require a functor category with source C.

Facts & Assumptions

Given: A locally small category C, objects a,a, a morphism h:aa, functors F,G:CSet, natural transformations α:C(a,)F and η:FG, and the category and functor laws.

[L1]

Evaluation is the bijection Ea,F(α)=αa(1a), with inverse x(fF(f)(x)) (Evaluation at the identity gives Nat(C(a,),F)F(a) and proves that the natural-transformation collection is a set).

[L2]

The hom-assignment is a bifunctor, so h:aa induces the natural transformation C(h,) with component kkh (The hom-assignment C(,):Cop×CSet is a bifunctor).

[F1]

Naturality of α says F(h)αa=αaC(a,h) (Natural transformation and its components).

[F2]

Vertical composition is componentwise: (ηα)a=ηaαa (Identity natural transformation and vertical composition).

Proof

technique · direct
1.1

By [L2], the component of C(h,) at a sends 1a to 1ah=h; hence Ea,F(αC(h,))=αa(h).

L1L2
1.2

Applying [F1] to 1a gives αa(h)=F(h)(αa(1a))=F(h)(Ea,F(α)), proving naturality in a.

L1F1
1.3

By componentwise composition, Ea,G(ηα)=(ηα)a(1a)=ηa(αa(1a))=ηa(Ea,F(α)), proving naturality in F.

L1F2
2.1

Steps 1.1--1.3 are the two required naturality squares, and their pointwise formulas use no functor category on a large source.

step 1.1step 1.2step 1.3
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

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:CopSet be a presheaf. Evaluation at the identity gives a bijection

EPa:Nat(C(,a),P)P(a),EPa(α)=αa(1a),

whose inverse sends xP(a) to the natural transformation with c-component f:caP(f)(x). It is natural in both variables. In particular, for h:aa and β:C(,a)P,

EPa(βC(,h))=P(h)(EPa(β)),

and postcomposition by a natural transformation PQ 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:DSet, evaluation at the identity is a bijection Nat(D(d,),F)F(d) whose inverse sends xF(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:caP(f)(x).

L1F1F2
1.2

Under the same translation, a morphism h:aa 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
RemarkRemark: AI-adaptedProof: Not applicableaudited 2026-08-13Open item page →

Local smallness does not make every natural-transformation collection a set, but the Yoneda construction proves sethood in the representable-source case

Local smallness says that each individual hom-collection is a set (Small, locally small, and large categories). It does not, by itself, turn an object-indexed family of components over a proper class of objects into set-coded data. For this reason Functor category [C,D] forms [C,D] as a category only when C is small, and If C is small and D is locally small then [C,D] is locally small; if both are small it is small obtains local smallness from a small source and a locally small target.

The representable-source case has additional structure. For an object a and F:CSet, the explicit formulas of Evaluation at the identity gives Nat(C(a,),F)F(a) and proves that the natural-transformation collection is a set parametrize every natural transformation C(a,)F by the set F(a). Thus this particular natural-transformation collection is a set even when C is large and locally small. No global proper-class counterexample is asserted here.

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-13Open item page →

The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding

Definition

Let C be locally small. The Yoneda assignment y sends an object a to the representable presheaf

y(a):=C(,a):CopSet

and sends a morphism f:ab to the natural transformation y(f):y(a)y(b) whose component at c is postcomposition by f:

y(f)c:C(c,a)C(c,b),gfg.

The functoriality and naturality of these formulas are instances of the hom-bifunctor The hom-assignment C(,):Cop×CSet is a bifunctor.

When C is small, Functor category [C,D] and If C is small and D is locally small then [C,D] is locally small; if both are small it is small form the presheaf category and the assignment is the functor

y:C[Cop,Set],

traditionally called the Yoneda embedding. For an arbitrary large locally small C, the same formulas are called the Yoneda assignment; no large-source functor category is silently formed. Full faithfulness is proved in The Yoneda functor is fully faithful, and it is a full embedding when its object map is injective. Under the terminology of Embedding and full embedding of categories, a fully faithful functor is a full embedding only if its object map is also injective.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The Yoneda functor is fully faithful, and it is a full embedding when its object map is injective

Statement

Let C be locally small. For all objects a,b, the Yoneda assignment induces a bijection

C(a,b)Nat(C(,a),C(,b)),fy(f),

where y(f)c(g)=fg. Thus, when C is small and y is the functor of The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding, it is fully faithful. If its object map is also injective, it is a full embedding in the library's stronger sense.

Facts & Assumptions

Given: A locally small category C and objects a,b.

[L1]

Contravariant Yoneda gives Nat(C(,a),P)P(a) by evaluation, with inverse x(fP(f)(x)) (For a presheaf P, Nat(C(,a),P)P(a) naturally in a and P).

[F1]

The Yoneda assignment sends f:ab to postcomposition gfg (The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding).

[F2]

A functor is fully faithful exactly when each induced hom-map is bijective (Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors).

[F3]

An embedding is faithful and injective on objects, and a full embedding is additionally full (Embedding and full embedding of categories).

Proof

technique · direct
1.1

Apply [L1] to P=C(,b). Evaluation sends α:C(,a)C(,b) to αa(1a)C(a,b), and its inverse sends f:ab to g:cafg, which is exactly y(f) by [F1].

L1F1
2.1

Step 1.1 makes every Yoneda hom-map bijective, so [F2] gives full faithfulness whenever the small-source Yoneda functor is formed; the same bijections hold objectwise for every locally small C.

step 1.1F2
3.1

If the object map of y is injective, step 2.1 gives both fullness and faithfulness, so [F3] makes y a full embedding.

step 2.1F3
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Objects a and b are isomorphic exactly when C(,a) and C(,b) are naturally isomorphic

Statement

Let a and b be objects of a locally small category C. Then

abC(,a)C(,b)

by a natural isomorphism of presheaves.

Facts & Assumptions

Given: Objects a,b of a locally small category C.

[L1]

The Yoneda assignment induces a bijection C(x,y)Nat(C(,x),C(,y)) for every x,y (The Yoneda functor is fully faithful, and it is a full embedding when its object map is injective).

[F1]

A natural isomorphism α:FG has a natural transformation β:GF with βα=1F and αβ=1G (Natural isomorphism).

[F2]

An isomorphism f:ab has a morphism f1:ba with f1f=1a and ff1=1b (Isomorphism, groupoid, and connected category).

Proof

technique · direct
1.1

If f:ab is an isomorphism, its Yoneda image y(f) has inverse y(f1), since the postcomposition formulas give y(f1)y(f)=y(1a) and y(f)y(f1)=y(1b); hence the representable presheaves are naturally isomorphic.

givenL1F2
1.2

Conversely, let α:C(,a)C(,b) be a natural isomorphism with inverse β. By the surjectivity in [L1], there are f:ab and g:ba with y(f)=α and y(g)=β.

L1F1choose
2.1

The inverse equations of [F1] give y(gf)=y(g)y(f)=1y(a)=y(1a) and y(fg)=y(1b); injectivity in [L1] therefore gives gf=1a and fg=1b, so f is an isomorphism.

step 1.2L1F1F2
3.1

Step 1.1 proves the forward implication and steps 1.2--2.1 prove the reverse implication.

step 1.1step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-13Open item page →

Universal elements of covariant functors and presheaves

Definition

Let C be locally small. For a functor F:CSet, a universal element is a pair (R,u) with RC and uF(R) such that the maps

θcu:C(R,c)F(c),θcu(f)=F(f)(u)

are the components of a natural isomorphism θu:C(R,)F.

For a presheaf P:CopSet, a universal element is a pair (R,u) with uP(R) such that

θcu:C(c,R)P(c),θcu(f)=P(f)(u)

are the components of a natural isomorphism θu:C(,R)P. Thus a universal element is a representation in the sense of Presheaves, covariantly and contravariantly representable functors, and representations, with its natural isomorphism specified by a distinguished element of the representing object's value.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

A representation is equivalently a universal element with a unique factorisation property

Statement

Let C be locally small.

  1. A pair (R,u) with uF(R) is universal for a functor F:CSet if and only if, for every object c and every xF(c), there is a unique morphism f:Rc such that F(f)(u)=x.
  2. A pair (R,u) with uP(R) is universal for a presheaf P:CopSet if and only if, for every object c and every xP(c), there is a unique morphism f:cR such that P(f)(u)=x.

Every representation θ determines its universal element by u=θR(1R), and the universal element recovers θ by the formulas in the statement. These correspondences are the Yoneda correspondences and are natural in the representing object and the set-valued functor.

Facts & Assumptions

Given: A locally small category C, an object R, and either a functor F:CSet with uF(R) or a presheaf P with uP(R).

[L1]

Evaluation at 1R is a bijection Nat(C(R,),F)F(R) whose inverse sends u to fF(f)(u) (Evaluation at the identity gives Nat(C(a,),F)F(a) and proves that the natural-transformation collection is a set).

[L2]

This covariant evaluation bijection is natural in both the representing object and the target functor (The Yoneda bijection Nat(C(a,),F)F(a) is natural in both a and F).

[L3]

Dually, evaluation gives Nat(C(,R),P)P(R) naturally in R and P, with inverse u(fP(f)(u)) (For a presheaf P, Nat(C(,a),P)P(a) naturally in a and P).

[F1]

A universal element is an element whose Yoneda-associated natural transformation is a natural isomorphism (Universal elements of covariant functors and presheaves).

Proof

technique · direct
1.1

By [L1], any natural transformation θ:C(R,)F satisfies θc(f)=F(f)(θR(1R)); thus a representation determines u=θR(1R) and is exactly the family θu.

L1F1
1.2

By [L3], the same argument for a presheaf identifies its representing transformation with fP(f)(u); componentwise bijectivity is exactly the stated existence and uniqueness of f:cR.

L3F1
2.1

The family θu is a natural isomorphism if and only if each function θcu:fF(f)(u) is bijective, which is equivalent to the existence and uniqueness of f:Rc for every xF(c).

step 1.1F1
3.1

The naturality assertions for the two correspondences are [L2] and [L3], so steps 1.1--2.1 prove both equivalences and the final assertion.

step 1.1step 2.1step 1.2L2L3
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Representing objects are unique up to a unique isomorphism compatible with their universal elements

Statement

Let F:CSet have universal elements (R,u) and (R,u). There is a unique isomorphism i:RR satisfying F(i)(u)=u.

If instead P:CopSet has universal elements (R,u) and (R,u), there is a unique isomorphism i:RR satisfying P(i)(u)=u.

Hence a representing object is unique up to the unique isomorphism compatible with the chosen universal elements, in either variance.

Facts & Assumptions

Given: A locally small category C and the two universal elements for the same covariant functor or presheaf appearing in the statement.

[L1]

For a covariant universal element (R,u), every xF(c) has a unique expression F(f)(u) with f:Rc; for a presheaf universal element, every xP(c) has a unique expression P(f)(u) with f:cR (A representation is equivalently a universal element with a unique factorisation property).

[F1]

A morphism is an isomorphism when it admits a two-sided inverse (Isomorphism, groupoid, and connected category).

Proof

technique · direct
1.1

In the covariant case, apply [L1] for (R,u) to uF(R) and for (R,u) to uF(R), obtaining unique morphisms i:RR and j:RR with F(i)(u)=u and F(j)(u)=u.

givenL1
1.2

In the presheaf case, [L1] applied to uP(R) and uP(R) gives unique i:RR and j:RR with P(i)(u)=u and P(j)(u)=u.

givenL1
2.1

Functoriality gives F(ji)(u)=u=F(1R)(u); uniqueness in [L1] for (R,u) gives ji=1R. Similarly, ij=1R.

step 1.1L1
3.1

By [F1], i is an isomorphism. Any compatible morphism k:RR satisfies F(k)(u)=u and therefore equals i by [L1], proving uniqueness even among all compatible morphisms.

step 1.1step 2.1L1F1
4.1

Contravariant functoriality and the same uniqueness argument give ji=1R and ij=1R; [F1] and uniqueness in [L1] then make i the unique compatible isomorphism.

step 1.2L1F1
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-13Open item page →

The category of elements of a covariant functor or a presheaf

Definition

Let F:CSet be a functor. Its category of elements F has:

  • objects (c,x) with cC and xF(c);
  • a morphism (c,x)(d,y) given by a morphism f:cd in C satisfying F(f)(x)=y.

The identity of (c,x) is 1c, and composition is composition in C. The functor laws of Covariant functor, identity functor, composite functor, and contravariant functor make the identity and composite equations hold, so these data satisfy Category, object, morphism, domain, codomain, identity, composition, and hom-collection.

For a presheaf P:CopSet, its category of elements P again has objects (c,x) with xP(c), while a morphism (c,x)(d,y) is a morphism f:cd in C satisfying

x=P(f)(y).

This reversed equation comes from the opposite category Opposite category Cop; contravariant functoriality again supplies identities and composition. A universal element in the sense of Universal elements of covariant functors and presheaves is itself an object of the appropriate category of elements.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Universal elements are initial in a covariant category of elements and terminal in a presheaf category of elements

Statement

Let C be locally small.

  1. For F:CSet, a pair (R,u) is a universal element if and only if (R,u) is initial in F.
  2. For P:CopSet, a pair (R,u) is a universal element if and only if (R,u) is terminal in P.

Facts & Assumptions

Given: A locally small category C and either a functor F:CSet or a presheaf P with the indicated pair (R,u).

[L1]

Covariant universality says that for every (c,x) there is a unique f:Rc with F(f)(u)=x; presheaf universality says there is a unique f:cR with P(f)(u)=x (A representation is equivalently a universal element with a unique factorisation property).

[F1]

In F, a morphism (R,u)(c,x) is an f:Rc satisfying F(f)(u)=x; in P, a morphism (c,x)(R,u) is an f:cR satisfying x=P(f)(u) (The category of elements of a covariant functor or a presheaf).

[F2]

An object is initial when it has exactly one morphism to every object and terminal when it has exactly one morphism from every object (Initial object, terminal object, and zero object).

Proof

technique · direct
1.1

By [F1], the morphisms (R,u)(c,x) in F are exactly the morphisms counted by the covariant condition in [L1].

L1F1
1.2

By [F1], the morphisms (c,x)(R,u) in P are exactly the morphisms counted by the presheaf condition in [L1].

L1F1
2.1

Thus that condition holds for all (c,x) if and only if (R,u) has exactly one morphism to each object of F, which by [F2] is initiality.

step 1.1F2
3.1

Thus that condition holds for all (c,x) if and only if (R,u) has exactly one morphism from each object of P, which by [F2] is terminality.

step 1.2F2
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-13Open item page →

Universal arrows from an object to a functor and from a functor to an object

Definition

Let U:DC be a functor as in Covariant functor, identity functor, composite functor, and contravariant functor and let X be an object of C.

A universal arrow from X to U is a pair (R,η) with RD and η:XU(R) such that, for every DD and f:XU(D), there is a unique h:RD satisfying

f=U(h)η.

When C is locally small, the relevant hom-assignment is a functor by The assignments C(a,) and C(,a) are functors to Set, and equivalently (R,η) is a universal element of the covariant functor C(X,U()):DSet in the sense of Universal elements of covariant functors and presheaves.

A universal arrow from U to X is a pair (R,ε) with ε:U(R)X such that, for every DD and f:U(D)X, there is a unique h:DR satisfying

f=εU(h).

When C is locally small, equivalently (R,ε) is a universal element of the presheaf C(U(),X):DopSet. The associated comma categories (XU) and (UX) are those of Comma category, slice category, and coslice category.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Universal arrows to a functor are initial in comma categories, and universal arrows from a functor are terminal

Statement

For a functor U:DC and an object XC:

  1. a pair (R,η:XU(R)) is a universal arrow from X to U if and only if it is initial as an object of (XU);
  2. a pair (R,ε:U(R)X) is a universal arrow from U to X if and only if it is terminal as an object of (UX).

Facts & Assumptions

Given: The functor U:DC, object X, and one of the pairs in the statement.

[F1]

A universal arrow from X to U gives a unique h:RD with f=U(h)η for every f:XU(D); a universal arrow from U to X gives a unique h:DR with f=εU(h) for every f:U(D)X (Universal arrows from an object to a functor and from a functor to an object).

[F2]

In (XU), a morphism (R,η)(D,f) is an h:RD with U(h)η=f; in (UX), a morphism (D,f)(R,ε) is an h:DR with εU(h)=f (Comma category, slice category, and coslice category).

[F3]

Initiality means that there is exactly one morphism from the object to every object, while terminality means that there is exactly one morphism from every object to it (Initial object, terminal object, and zero object).

Proof

technique · direct
1.1

By [F2], the morphisms (R,η)(D,f) in (XU) are exactly the morphisms h satisfying the factorisation equation in the first part of [F1].

F1F2
1.2

By [F2], the morphisms (D,f)(R,ε) in (UX) are exactly the morphisms h satisfying the second factorisation equation in [F1].

F1F2
2.1

Existence and uniqueness of such an h for every (D,f) is therefore equivalent, by [F3], to (R,η) being initial.

step 1.1F3
3.1

Existence and uniqueness of such an h for every (D,f) is therefore equivalent, by [F3], to (R,ε) being terminal.

step 1.2F3

5 · Examples, counterexamples and false statements

None yet.

Sources

Standard references

Recommended treatments; not extraction sources.