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.

40 results · all verified · 26 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 14 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Ends Coends and Weighted Limits

1 · Prerequisites

2 · Summary

Opposite and product categories, natural transformations, cones, limits, and the Yoneda machinery already provide the ordinary categorical language used here. This page also uses the published functor category and its size control, the category of elements, representing-object uniqueness, and the comparison results that identify products, equalizers, pullbacks, and adjoint preservation as special cases of universal properties.

This page introduces dinaturality, wedges, ends, coends, and the twisted arrow category, then proves the two standard computational descriptions: as limits over Tw(C) and as equalizers or coequalizers. It next develops parametrised ends, Fubini, natural transformations as an end, the coend form of Yoneda, and the set-weighted theory of powers, weighted limits, representable weights, and hom-weighted coends, with false statements isolating the variance and existence traps.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Dinatural transformation between functors on Cop×C

Definition

Let C and D be categories (Category, object, morphism, domain, codomain, identity, composition, and hom-collection) and let

P,Q:Cop×CD

be functors on the product of Cop with C (Opposite category Cop, Product category and its projection functors, Covariant functor, identity functor, composite functor, and contravariant functor). A morphism (a,b)(a,b) of Cop×C is a pair (g,h) in which h:bb is a morphism of C and g is a morphism of Cop from a to a, that is, a morphism aa of C. Thus a morphism f:cc of C supplies the four morphisms

(f,1c):(c,c)(c,c),(1c,f):(c,c)(c,c),(1c,f):(c,c)(c,c),(f,1c):(c,c)(c,c).

A dinatural transformation α:PQ is a family of morphisms

αc:P(c,c)Q(c,c)(cOb(C))

of D such that every morphism f:cc of C satisfies the dinaturality equation

Q(1c,f)αcP(f,1c)  =  Q(f,1c)αcP(1c,f)

between morphisms P(c,c)Q(c,c). The morphism αc is the component of α at c.

The two sides pass through the six objects P(c,c), P(c,c), Q(c,c), P(c,c), Q(c,c) and Q(c,c), so the diagram expressing the dinaturality equation is a six-sided cycle and is called the hexagon:

P(c;c)Q(c;c)P(c0;c)Q(c;c0)P(c0;c0)Q(c0;c0)®cQ(1c;f)P(f;1c)P(1c0;f)®c0Q(f;1c0)

Remarks

A dinatural transformation is a family indexed by the objects of C and constrained by the morphisms of C, exactly as a natural transformation is (Natural transformation and its components); what differs is which constraint. A natural transformation between two functors on Cop×C is a family indexed by the pairs (a,b), and its naturality equation is imposed for every morphism of the product category. A dinatural transformation has components only on the diagonal, and the dinaturality equation is imposed only for the morphisms of C that connect two diagonal entries through the two off-diagonal entries displayed above.

At f=1c all four displayed morphisms of the product category are identities, so the hexagon reads αc=αc. The identity morphisms of C therefore impose no condition, and a dinatural transformation carries no analogue of the identity clause of a functor.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Composing a dinatural transformation with a natural transformation on either side gives a dinatural transformation

Statement

Let P,P,Q,Q:Cop×CD be functors (Product category and its projection functors, Opposite category Cop), let σ:PP and τ:QQ be natural transformations (Natural transformation and its components), and let α:PQ be dinatural (Dinatural transformation between functors on Cop×C). Then composing a dinatural transformation with a natural transformation on either side gives a dinatural transformation: the families

(ασ)c:=αcσc,c:P(c,c)Q(c,c),(τα)c:=τc,cαc:P(c,c)Q(c,c)

are dinatural transformations PQ and PQ respectively.

Facts & Assumptions

Given: Functors P,P,Q,Q on Cop×C, natural transformations σ:PP and τ:QQ, and a dinatural transformation α:PQ.

[F1]

A dinatural transformation α:PQ is a family αc:P(c,c)Q(c,c) such that every f:cc satisfies Q(1c,f)αcP(f,1c)=Q(f,1c)αcP(1c,f), the equation displayed by the hexagon (Dinatural transformation between functors on Cop×C).

[F2]

A natural transformation α:FG is a family αA:FAGA such that every f:AB satisfies the naturality equation GfαA=αBFf (Natural transformation and its components).

[F3]

The product category C×D has objects (C,D), morphisms (f,g):(C,D)(C,D), componentwise identities, and componentwise composition (Product category and its projection functors).

[F4]

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

Proof

technique · direct
1.1

A morphism f:cc of C supplies exactly four morphisms of Cop×C between the objects that occur in a hexagon at f, namely (f,1c):(c,c)(c,c), (1c,f):(c,c)(c,c), (1c,f):(c,c)(c,c) and (f,1c):(c,c)(c,c); the first coordinate of each is the morphism of Cop corresponding to f or an identity.

F1F3F4given
2.1

For the pre-composition case, naturality of σ at the first two morphisms of step 1.1 gives σc,cP(f,1c)=P(f,1c)σc,c and σc,cP(1c,f)=P(1c,f)σc,c, so both legs of the hexagon for ασ at f equal the corresponding leg of the hexagon for α precomposed with σc,c; those two legs agree by [F1], hence so do the legs for ασ, and ασ is dinatural.

F1F2step 1.1
3.1

For the post-composition case, naturality of τ at the last two morphisms of step 1.1 gives Q(1c,f)τc,c=τc,cQ(1c,f) and Q(f,1c)τc,c=τc,cQ(f,1c), so both legs of the hexagon for τα at f equal the corresponding leg of the hexagon for α postcomposed with τc,c; those two legs agree by [F1], hence so do the legs for τα, and τα is dinatural.

F1F2step 1.1

Remarks

Neither half assumes anything about σ or τ beyond naturality on the product category, and neither assumes that α is natural: the argument transports the hexagon for α along σ or τ and never builds a new one. What it does not give is a composition rule for two dinatural transformations, and no such rule holds: Dinatural transformations do not compose in general exhibits α and β both dinatural whose componentwise composite is not.

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

Dinatural transformations do not compose in general

Statement

There are a category C, functors P,Q,R:Cop×CSet (Product category and its projection functors, Opposite category Cop, Sets and functions form the large locally small category Set) and dinatural transformations α:PQ and β:QR (Dinatural transformation between functors on Cop×C) for which the componentwise composite (βcαc)c is not a dinatural transformation PR.

Hence the dinatural transformations between functors on Cop×C are not the morphisms of a category with componentwise composition.

Facts & Assumptions

Given: The walking arrow C, with objects 0 and 1 and one non-identity morphism u:01.

[F1]

A dinatural transformation α:PQ is a family αc:P(c,c)Q(c,c) such that every f:cc satisfies Q(1c,f)αcP(f,1c)=Q(f,1c)αcP(1c,f), the equation displayed by the hexagon (Dinatural transformation between functors on Cop×C).

[F2]

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

[F3]

Composition in a category is associative and unital: h(gf)=(hg)f,1Bf=f=f1A (Category, object, morphism, domain, codomain, identity, composition, and hom-collection).

[F4]

The product category has morphisms (f,g):(C,D)(C,D), componentwise identities, and componentwise composition (f,g)(f,g)=(ff,gg) (Product category and its projection functors).

Proof

technique · constructive
1.1

Take C to be the walking arrow. Its product with the opposite has objects (0,0),(0,1),(1,0),(1,1), and a functor T:Cop×CSet is exactly four sets T(0,0),T(0,1),T(1,0),T(1,1) together with four functions T(u,10):T(1,0)T(0,0), T(11,u):T(1,0)T(1,1), T(10,u):T(0,0)T(0,1) and T(u,11):T(1,1)T(0,1) subject to the single equation T(10,u)T(u,10)=T(u,11)T(11,u). Define P by taking all four sets to be a one-element set; define Q by Q(1,0)= and Q(0,0),Q(1,1),Q(0,1) one-element sets; define R by R(1,0)=, R(0,0)={c}, R(1,1)={d}, R(0,1)={y1,y2} with y1y2, R(10,u)(c)=y1 and R(u,11)(d)=y2.

F2F3F4givenconstruct
2.1

Each of P,Q,R satisfies the displayed functor equation, so each is a functor: for P both composites are functions between one-element sets; for Q and for R both composites are functions with domain the empty set , and any two functions with empty domain and the same codomain are equal.

F3F4step 1.1algebra
2.2

The unique family α with α0:P(0,0)Q(0,0) and α1:P(1,1)Q(1,1) is dinatural: the only non-identity morphism of C is u, and the hexagon at u is an equation between two functions P(1,0)Q(0,1) whose codomain Q(0,1) has one element.

F1step 1.1
2.3

Every family β with β0:Q(0,0)R(0,0) and β1:Q(1,1)R(1,1) is dinatural: the hexagon at u is an equation between two functions whose domain is Q(1,0)=.

F1step 1.1
3.1

The componentwise composite γ, with γ0=β0α0 and γ1=β1α1, fails the hexagon at u: the left leg R(10,u)γ0P(u,10) sends the element of the one-element set P(1,0) to y1, the right leg R(u,11)γ1P(11,u) sends it to y2, and y1y2. So α and β are dinatural and their composite is not, which is the asserted witness.

F1step 1.1step 2.1step 2.2step 2.3discharge-construct

Remarks

The two empty slots are the whole mechanism. Putting in the (1,0) position of Q and of R makes the functor equation of step 1.1 vacuous there and makes every family QR dinatural, so the second half of the composite is unconstrained; the one-element set in the (0,1) position of Q makes the first half unconstrained in the other direction. The composite then has to satisfy a hexagon whose codomain R(0,1) has two elements, and nothing has forced its two legs to agree.

A dinatural transformation may still be composed with a natural transformation on either side, and that composite is dinatural; this is Composing a dinatural transformation with a natural transformation on either side gives a dinatural transformation.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Wedges and cowedges, and the categories they form

Definition

Let T:Cop×CD be a functor (Product category and its projection functors, Opposite category Cop) and let d be an object of D (Category, object, morphism, domain, codomain, identity, composition, and hom-collection). Write Δd for the constant functor on Cop×C at d (Constant diagrams, cones, cocones, and their morphisms), which sends every object to d and every morphism to 1d.

A wedge from d to T is a dinatural transformation from a constant functor to T (Dinatural transformation between functors on Cop×C), that is, a family

ωc:dT(c,c)(cOb(C))

such that every f:cc satisfies the wedge equation

T(1c,f)ωc=T(f,1c)ωc

between morphisms dT(c,c). Dually, a cowedge from T to d is a dinatural transformation from T to a constant functor, that is, a family

ρc:T(c,c)d

such that every f:cc satisfies the cowedge equation

ρcT(f,1c)=ρcT(1c,f)

between morphisms T(c,c)d. The object d is the vertex of the wedge or cowedge, and ωc, ρc are its components.

A morphism of wedges (d,ω)(d,ω) is a morphism h:dd of D satisfying ωch=ωc for every object c; a morphism of cowedges (d,ρ)(d,ρ) is a morphism h:dd satisfying hρc=ρc for every c. Identities of D are morphisms of wedges and of cowedges, and a composite of two such morphisms again satisfies the displayed equation, so wedges over T and their morphisms form a category Wd(T), and cowedges under T and their morphisms form a category Cwd(T); associativity and the identity laws are inherited from D.

Remarks

The wedge and cowedge equations are the hexagon of Dinatural transformation between functors on Cop×C with one side made constant. For a wedge the source is Δd, so both Δd(f,1c) and Δd(1c,f) are 1d and drop out; for a cowedge the target is Δd and the two outer morphisms on the target side drop out instead.

A wedge is not a cone over a diagram indexed by C: its components sit at the diagonal values T(c,c) and its equation involves the two off-diagonal values T(c,c), whereas a cone (Constant diagrams, cones, cocones, and their morphisms) has one component per object of the index category and one equation per morphism, with no off-diagonal term. The precise comparison between the two shapes is An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite, which replaces the index category by another one.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The end and the coend of a functor Cop×CD

Definition

Let T:Cop×CD be a functor and let Wd(T) and Cwd(T) be the categories of wedges over T and of cowedges under T (Wedges and cowedges, and the categories they form).

An end of T is a terminal object of Wd(T), and a coend of T is an initial object of Cwd(T) (Initial object, terminal object, and zero object). In short: an end is a terminal wedge and a coend an initial cowedge. Neither need exist.

Written out, an end is a pair (e,ω) in which ωc:eT(c,c) is a wedge and, for every wedge (x,ξ) over T, there is exactly one morphism u:xe with

ωcu=ξcfor every object c of C.

A coend is a pair (q,ρ) in which ρc:T(c,c)q is a cowedge and, for every cowedge (x,ξ) under T, there is exactly one morphism v:qx with vρc=ξc for every c.

The vertex of an end is written cT(c,c) and the vertex of a coend cT(c,c), the subscripted integral denoting the end and the superscripted one the coend. The components ωc of the terminal wedge are the projections of the end and the components ρc of the initial cowedge the injections of the coend. The variable c in the integral notation is bound: it names the dinatural variable and nothing else.

Remarks

Because an end is a dinatural transformation (Dinatural transformation between functors on Cop×C) with a universal property rather than an element-level construction, the definition applies to any target category D whatever, and it never asserts existence. Which functors have ends, and in which targets, is a separate question answered by the comparison theorems on this page and by the hypotheses they carry.

The projections ωc are indexed by the objects of C, while the wedge equation they satisfy is indexed by its morphisms. Thus an end records the family of diagonal values together with every tie imposed through the off-diagonal values T(c,c). For a discrete category there are no nonidentity ties and the end reduces to the product of the diagonal values.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

An end and a coend are unique up to a unique isomorphism compatible with every component

Statement

Let T:Cop×CD be a functor.

If (e,ω) and (e,ω) are ends of T (The end and the coend of a functor Cop×CD), there is exactly one isomorphism u:ee satisfying ωcu=ωc for every object c of C. If (q,ρ) and (q,ρ) are coends of T, there is exactly one isomorphism v:qq satisfying vρc=ρc for every c.

An end and a coend of T are therefore unique up to a unique isomorphism compatible with every component.

Facts & Assumptions

Given: A functor T:Cop×CD, together with two ends of T and two coends of T.

[L1]

Any two initial objects in a category are joined by a unique isomorphism. Any two terminal objects are likewise joined by a unique isomorphism (Initial and terminal objects are unique up to a unique isomorphism).

[F1]

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).

[F2]

A morphism of wedges (d,ω)(d,ω) is a morphism h:dd with ωch=ωc for every c, a morphism of cowedges (d,ρ)(d,ρ) is a morphism h:dd with hρc=ρc for every c, and wedges over T and their morphisms form a category Wd(T), cowedges under T and their morphisms the category Cwd(T) (Wedges and cowedges, and the categories they form).

Proof

technique · direct
1.1

The two ends (e,ω) and (e,ω) are two terminal objects of the one category Wd(T), and the two coends are two initial objects of the one category Cwd(T).

F1F2
2.1

Applying the terminal clause of [L1] in Wd(T) gives a unique isomorphism (e,ω)(e,ω) of wedges.

L1F1step 1.1
2.2

Applying the initial clause of [L1] in Cwd(T) gives a unique isomorphism (q,ρ)(q,ρ) of cowedges.

L1F1step 1.1
3.1

An isomorphism of Wd(T) is by [F2] an isomorphism u:ee of D with ωcu=ωc for every c, and an isomorphism of Cwd(T) is an isomorphism v:qq with vρc=ρc for every c; so the two isomorphisms produced in steps 2.1 and 2.2 are exactly the ones the Statement asserts, and their uniqueness is the uniqueness given there.

F2step 2.1step 2.2

Remarks

The compatibility clause is not an extra verification: it is what being a morphism in Wd(T) or Cwd(T) means, so the published uniqueness of terminal and initial objects delivers it already. This is why the definition of an end is stated as a universal property in a category of wedges rather than as a family of morphisms with an ad hoc uniqueness clause.

An isomorphism of wedges is in particular an isomorphism of D: its inverse in Wd(T) is a morphism of D satisfying the displayed equation, and the two composites are the identities of e and e.

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

A natural transformation of functors induces a unique morphism of their ends and of their coends

Statement

Let P,P:Cop×CD be functors and let η:PP be a natural transformation (Natural transformation and its components); a wedge is a dinatural transformation from a constant functor (Dinatural transformation between functors on Cop×C).

If P and P have ends (e,ω) and (e,ω) (The end and the coend of a functor Cop×CD), then a natural transformation induces a unique morphism of ends: there is exactly one morphism η:ee satisfying

ωcη=ηc,cωcfor every object c.

If P and P have coends (q,ρ) and (q,ρ), there is exactly one morphism η:qq satisfying ηρc=ρcηc,c for every c.

Moreover 1P=1e, and (ηη)=ηη whenever η:PP and η:PP are natural and all three ends exist.

Facts & Assumptions

Given: Functors P,P:Cop×CD, a natural transformation η:PP, and ends and coends of P and of P where these are asserted to exist.

[F1]

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, and the universal property says that every wedge factors through the end by exactly one morphism (The end and the coend of a functor Cop×CD).

[F2]

A wedge from d to T is a dinatural transformation from a constant functor to T: a family ωc:dT(c,c) with T(1c,f)ωc=T(f,1c)ωc for every f:cc; dually a cowedge from T to d is a family ρc:T(c,c)d with ρcT(f,1c)=ρcT(1c,f) (Wedges and cowedges, and the categories they form).

[F3]

A natural transformation α:FG is a family αA:FAGA such that every f:AB satisfies the naturality equation GfαA=αBFf (Natural transformation and its components).

[F4]

A dinatural transformation α:PQ is a family αc:P(c,c)Q(c,c) such that every f:cc satisfies Q(1c,f)αcP(f,1c)=Q(f,1c)αcP(1c,f), the equation displayed by the hexagon (Dinatural transformation between functors on Cop×C).

Proof

technique · direct
1.1

The family ηc,cωc:eP(c,c) is a wedge from e to P: naturality of η at (1c,f):(c,c)(c,c) gives P(1c,f)ηc,c=ηc,cP(1c,f), naturality at (f,1c):(c,c)(c,c) gives P(f,1c)ηc,c=ηc,cP(f,1c), and the wedge equation for ω gives P(1c,f)ωc=P(f,1c)ωc, so both sides of the wedge equation for ηc,cωc equal ηc,c composed with that common morphism.

F2F3F4
2.1

Since (e,ω) is a terminal wedge, the wedge of step 1.1 factors through it by exactly one morphism, which is the asserted η:ee with ωcη=ηc,cωc for every c.

F1step 1.1
3.1

Taking P=P, η=1P and (e,ω)=(e,ω), the identity of e satisfies the defining equation of step 2.1, and that equation has exactly one solution, so 1P=1e.

F1step 2.1
3.2

For η:PP and η:PP with all three ends present, both ηη and (ηη) satisfy ωc()=ηc,cηc,cωc, and that equation has exactly one solution, so the two agree.

F1step 2.1
4.1

For coends, the family ρcηc,c:P(c,c)q is a cowedge under P: naturality of η at (f,1c):(c,c)(c,c) and at (1c,f):(c,c)(c,c) rewrites both sides of its cowedge equation as ρcP(f,1c)ηc,c and ρcP(1c,f)ηc,c, which agree by the cowedge equation for ρ; initiality of (q,ρ) then gives exactly one η:qq with ηρc=ρcηc,c. The induced morphism runs from the coend of P to the coend of P, in the same direction as η, and the argument is written out here rather than left to duality because the universal property used is initiality rather than terminality.

F1step 1.1step 2.1

Remarks

The two functor laws in steps 3.1 and 3.2 are proved from uniqueness alone and use nothing about η beyond its defining equation. So on any full subcategory of functors all of whose objects have a chosen end, the assignment Pe with ηη is a functor; making that statement precise for a family of parameters, where the choice has to be made for every parameter value at once, is A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The twisted arrow category and its projection to Cop×C

Definition

Let C be a category (Category, object, morphism, domain, codomain, identity, composition, and hom-collection). Its twisted arrow category Tw(C) has the following data. Its objects are the morphisms of C. For objects f:cc and g:dd, a morphism fg is a pair (a,b) with bfa=g, where a:dc and b:cd are morphisms of C; the identity of f is (1c,1c), and the composite of (a,b):fg with (a,b):gh is

(a,b)(a,b):=(aa,bb):fh.

That composite is a morphism fh because (bb)f(aa)=b(bfa)a=bga=h, associativity and the identity laws are inherited from C, and the composite of the two identities is the identity, so these data satisfy Category, object, morphism, domain, codomain, identity, composition, and hom-collection.

The twisted arrow projection is the assignment

π:Tw(C)Cop×C,(f:cc)(c,c),(a,b)(a,b),

where in the target the first coordinate a is read as the morphism cd of Cop corresponding to a:dc (Opposite category Cop, Product category and its projection functors). It preserves identities by construction, and it preserves composites because composition in Cop×C is componentwise with the first coordinate reversed, which is the order written in the display above; so π is a functor (Covariant functor, identity functor, composite functor, and contravariant functor).

Remarks

The name records the twist: a morphism of Tw(C) acts by precomposition in one coordinate and by postcomposition in the other, so the first coordinate runs backwards. That is exactly what makes π land in Cop×C rather than in C×C, and it is why a diagram indexed by Tw(C) can see a functor of two variables of opposite variance.

The opposite orientation is also in use in the literature, with Tw(C) naming what is here Tw(C)op. The orientation fixed above is in force everywhere on this page, and Orientation and notation conventions in force on this page states it alongside the integral conventions; every statement below that names Tw(C) is to be read with the definition given here and is false under the other one.

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

The twisted arrow category is the category of elements of the hom-bifunctor

Statement

Let C be a locally small category (Small, locally small, and large categories) and let C(,):Cop×CSet be its hom-bifunctor (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The hom-assignment C(,):Cop×CSet is a bifunctor). Write C(,) for its category of elements (The category of elements of a covariant functor or a presheaf) and π:C(,)Cop×C for the projection sending ((a,b),x) to (a,b).

The assignment

Φ:Tw(C)C(,),(f:cc)((c,c),f),(a,b)(a,b)

is an isomorphism of categories (The twisted arrow category and its projection to Cop×C): it is a bijection on objects and on morphisms, it preserves identities and composites, and it satisfies πΦ=π.

Facts & Assumptions

Given: A locally small category C.

[F4]

A category C is locally small when every C(A,B) is a set (Small, locally small, and large categories).

[L1]

For every locally small category C, the hom-assignment C(,):Cop×CSet is a functor (The hom-assignment C(,):Cop×CSet is a bifunctor).

[F2]

The hom-assignment sends (a,b) to C(a,b), and a morphism (a,b)(a,b) of the product category, consisting of h:aa and u:bb, acts by C(h,u):C(a,b)C(a,b),fufh (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[F1]

The category of elements F of a functor F:CSet has objects the pairs (c,x) with xF(c), and a morphism (c,x)(d,y) given by a morphism f:cd in C satisfying F(f)(x)=y; identities and composition are those of C (The category of elements of a covariant functor or a presheaf).

[F3]

The objects of Tw(C) are the morphisms of C, and for f:cc and g:dd a morphism fg is a pair (a,b) with bfa=g, where a:dc and b:cd (The twisted arrow category and its projection to Cop×C).

[F5]

The product category has morphisms (f,g):(C,D)(C,D), componentwise identities, and componentwise composition (f,g)(f,g)=(ff,gg) (Product category and its projection functors).

Proof

technique · direct
1.1

Because C is locally small, every hom-collection C(a,b) is a set and the hom-assignment is a functor into Set on Cop×C, so its category of elements is formed by the published construction.

L1F2F4
2.1

An object of C(,) is a pair ((c,c),x) with xC(c,c); since a morphism of C is determined by, and determines, its domain, its codomain and its member of the corresponding hom-collection, the assignment (f:cc)((c,c),f) is a bijection from the objects of Tw(C) to the objects of C(,).

F1F3F5step 1.1
3.1

A morphism ((c,c),f)((d,d),g) of C(,) is a morphism (a,b):(c,c)(d,d) of Cop×C, that is a pair with a:dc and b:cd in C, satisfying C(a,b)(f)=g; by the displayed action of [F2] that equation reads bfa=g, which is the defining condition of a morphism fg of Tw(C). So Φ is a bijection on each morphism collection, and it changes neither the pair (a,b) nor the variance.

F1F2F3step 2.1
4.1

Identities and composites agree because both categories take them from Cop×C: the identity of f is (1c,1c) on both sides and the composite of (a,b) with (a,b) is (aa,bb) on both sides. Hence Φ is a functor, bijective on objects and morphisms, so an isomorphism of categories; and πΦ(f)=(c,c)=π(f) on objects with πΦ(a,b)=(a,b)=π(a,b) on morphisms, so πΦ=π.

F3step 2.1step 3.1

Remarks

The identification is what keeps this page from re-minting a published construction: every statement below that computes an end as a limit over Tw(C) may equally be read as a statement about C(,), and the smallness of Tw(C) for small C is the smallness of that category of elements.

Local smallness is used exactly once, in step 1.1, and it is used to know that C(a,b) is a set so that the hom-assignment is Set-valued. Without it there is no hom-bifunctor to take elements of, while Tw(C) is still defined; so the twisted arrow category is the more primitive of the two constructions.

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

An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite

Statement

Let T:Cop×CD be a functor and let π:Tw(C)Cop×C be the twisted arrow projection (The twisted arrow category and its projection to Cop×C).

Ends. The assignments ωξ with ξf:=T(1c,f)ωc for f:cc, and ξω with ωc:=ξ1c, are mutually inverse and give an isomorphism of categories Wd(T)Cone(Tπ) that leaves the vertex unchanged (Wedges and cowedges, and the categories they form, Constant diagrams, cones, cocones, and their morphisms). Consequently an end is the limit over the twisted arrow category: a wedge (e,ω) is an end of T exactly when the corresponding cone is a limit of Tπ (The end and the coend of a functor Cop×CD, Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties), either exists exactly when the other does, and then

cT(c,c)    limTw(C)Tπ

by the unique isomorphism compatible with every component (Any two limits, or any two colimits, of one diagram are uniquely isomorphic compatibly with their structure maps).

Coends. Let πsw:Tw(C)opCop×C (Opposite category Cop) send an object f:cc to the pair (c,c), with the domain and the codomain of f swapped, and send the morphism gf of Tw(C)op determined by (a,b):fg to the morphism (b,a):(d,d)(c,c). Then πsw is a functor, Cwd(T)Cocone(Tπsw) by mutually inverse assignments leaving the vertex unchanged, and a coend of T is exactly a colimit of Tπsw:

cT(c,c)    colimTw(C)opTπsw.

Facts & Assumptions

Given: A functor T:Cop×CD and the twisted arrow projection π.

[F1]

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

[F2]

A cone over D:JC with apex c is a family λj:cD(j) satisfying D(u)λj=λk for u:jk; a cocone under D is a family ρj:D(j)c satisfying ρkD(u)=ρj; a morphism of cones (c,λ)(c,λ) is h:cc with λjh=λj (Constant diagrams, cones, cocones, and their morphisms).

[F3]

The objects of Tw(C) are the morphisms of C, a morphism fg is a pair (a,b) with bfa=g for a:dc and b:cd, and the projection π sends f:cc to (c,c) and (a,b) to (a,b) (The twisted arrow category and its projection to Cop×C).

[F4]

A limit of D is a terminal cone: explicitly, for every cone (X,ξ) there exists a unique morphism u:XL such that λju=ξj for every j. A colimit is an initial cocone (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F5]

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).

[F6]

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

[L1]

If (L,λ) and (L,λ) are limits of one diagram D, there is a unique isomorphism u:LL satisfying λju=λj for every j; dually for colimits (Any two limits, or any two colimits, of one diagram are uniquely isomorphic compatibly with their structure maps).

Proof

technique · direct
1.1

Let ω be a wedge with vertex X and put ξf:=T(1c,f)ωc for f:cc, so that ξf:XTπ(f). This family is a cone over Tπ: for a morphism (a,b):fg of Tw(C), with g:dd and bfa=g, functoriality of T gives T(a,b)T(1c,f)=T(a,bf)=T(1d,bf)T(a,1c), the wedge equation at a:dc gives T(a,1c)ωc=T(1d,a)ωd, and T(1d,bf)T(1d,a)=T(1d,bfa)=T(1d,g); hence Tπ(a,b)ξf=T(1d,g)ωd=ξg.

F1F2F3
1.2

Let ξ be a cone over Tπ with apex X and put ωc:=ξ1c. The pairs (1c,f):1cf and (f,1c):1cf are morphisms of Tw(C), since f1c1c=f and 1c1cf=f, so the cone equation at each of them gives T(1c,f)ωc=ξf and T(f,1c)ωc=ξf; the two left-hand sides are therefore equal and ω is a wedge.

F1F2F3
1.3

The assignment πsw is a functor: it sends the identity (1c,1c) of f to the identity of (c,c), and if (a,b):fg and (a,b):gh then their composite in Tw(C) is (aa,bb), whose image (bb,aa) is exactly the composite in Cop×C of the images (b,a) and (b,a), taken in the order these two morphisms compose in Tw(C)op.

F3F6
2.1

The two assignments are mutually inverse: from a wedge, ξ1c=T(1c,1c)ωc=ωc; from a cone, the family rebuilt in step 1.1 has T(1c,f)ξ1c=ξf by the first computation of step 1.2. A morphism h of the vertices satisfies ωch=ωc for every c exactly when it satisfies ξfh=ξf for every f, since each family determines the other by the displayed formulas. So Wd(T) and Cone(Tπ) are isomorphic categories over the identity on vertices, terminal objects correspond, and by [F5] and [F4] an end of T is precisely a limit of Tπ; [L1] then supplies the unique component-compatible isomorphism between any two such limits.

F4F5L1step 1.1step 1.2
3.1

For cowedges, put ρf:=σcT(f,1c) for a cowedge σ and f:cc, so ρf:Tπsw(f)=T(c,c)X. Given (a,b):fg, so a morphism gf of Tw(C)op sent by Tπsw to T(b,a), functoriality gives T(f,1c)T(b,a)=T(bf,a)=T(bf,1c)T(1d,a), the cowedge equation at bf:cd gives σcT(bf,1c)=σdT(1d,bf), and T(1d,bf)T(1d,a)=T(1d,bfa)=T(1d,g), so ρfT(b,a)=σdT(1d,g)=σdT(g,1d)=ρg by the cowedge equation at g; conversely σc:=ρ1c recovers a cowedge from a cocone through the two morphisms of step 1.2 read in Tw(C)op, and the two assignments are mutually inverse exactly as in step 2.1. Hence Cwd(T)Cocone(Tπsw), initial objects correspond, and a coend of T is a colimit of Tπsw over Tw(C)op, the integrand being read with domain and codomain swapped.

F3F5F6step 1.3step 2.1

Remarks

The swap in the coend clause is not cosmetic and is not a consequence of formal duality applied carelessly. Dualising D turns a cowedge under T into a wedge over T viewed in Dop, and the index category that then computes it is the opposite of the twisted arrow category, with the integrand evaluated at (c,c) rather than (c,c). Taking the colimit of Tπ over Tw(C)op instead — the same diagram whose limit is the end — gives a different object, and FALSE: under this page's convention a coend is the colimit of the same twisted-arrow diagram whose limit is the end computes both on a two-object category to show they differ.

No smallness hypothesis appears anywhere above: the two categories are isomorphic whatever the size of C, and the statement is about which universal objects exist, not about whether the index category is a set. The size hypothesis enters only when existence is to be deduced from completeness, which is Ends exist over a small index category in a complete target, and coends in a cocomplete one.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The end of a functor made mute in its contravariant variable is the ordinary limit of that functor

Statement

Let F:CD be a functor and let F:Cop×CD be given by F(c1,c2):=F(c2) on objects and F(f1,f2):=F(f2) on morphisms (Product category and its projection functors, Opposite category Cop), so that F ignores its contravariant variable.

Then the end of a functor made mute in its contravariant variable is the ordinary limit of that functor: the wedges over F are exactly the cones over F and the morphisms between them are the same morphisms (Wedges and cowedges, and the categories they form, Constant diagrams, cones, cocones, and their morphisms), so F has an end exactly when F has a limit (The end and the coend of a functor Cop×CD, Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties) and then

cF(c,c)=limcCF(c).

Dually, the cowedges under F are exactly the cocones under F, so F has a coend exactly when F has a colimit, and then cF(c,c)=colimcCF(c).

Facts & Assumptions

Given: A functor F:CD and the assignment F displayed in the Statement.

[F1]

A functor satisfies F(1A)=1FA,F(gf)=FgFf (Covariant functor, identity functor, composite functor, and contravariant functor).

[F2]

The product category has componentwise identities and componentwise composition (f,g)(f,g)=(ff,gg) (Product category and its projection functors).

[F3]

A dinatural transformation α:PQ satisfies Q(1c,f)αcP(f,1c)=Q(f,1c)αcP(1c,f) for every f:cc, the equation displayed by the hexagon (Dinatural transformation between functors on Cop×C).

[F4]

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

[F5]

A cone over D:JC with apex c is a family λj:cD(j) satisfying D(u)λj=λk for u:jk, a cocone is a family ρj:D(j)c satisfying ρkD(u)=ρj, and a morphism of cones is h:cc with λjh=λj (Constant diagrams, cones, cocones, and their morphisms).

[F6]

A limit of D is a terminal cone: explicitly, for every cone (X,ξ) there exists a unique morphism u:XL such that λju=ξj for every j; a colimit is an initial cocone (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F7]

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).

Proof

technique · direct
1.1

The assignment F is a functor: F(1c1,1c2)=F(1c2)=1F(c2), and a composite in Cop×C has second coordinate the composite of the second coordinates, so F of it is F of that composite, which is the composite of the values of F.

F1F2
2.1

For a family αc:XF(c,c)=F(c) the wedge equation at f:cc reads F(1c,f)αc=F(f,1c)αc, that is F(f)αc=αc, which is the cone equation of [F5] verbatim; likewise the cowedge equation reads αc=αcF(f), which is the cocone equation. The wedge and cone conditions on one family are therefore the same equation, not merely equivalent ones.

F3F4F5step 1.1
3.1

A morphism of wedges over F is a morphism h of D with ωch=ωc for every c, and that is exactly the defining condition of a morphism of cones over F; so the two categories have the same objects and the same morphisms, and a terminal object of one is a terminal object of the other. By [F7] and [F6], F has an end exactly when F has a limit, and the two are the same object with the same components.

F5F6F7step 2.1
4.1

The same argument in the dual direction gives that the cowedges under F and their morphisms are the cocones under F and their morphisms, so an initial object of one category is an initial object of the other, and F has a coend exactly when F has a colimit, with the same vertex and components.

F5F7step 2.1step 3.1

Remarks

This is the sense in which ends generalise limits rather than sitting beside them: a diagram indexed by C becomes a two-variable functor that does not use its first variable, and its end is the limit already defined. The proof cites the published cone and limit definitions and restates neither, so no second notion of limit is introduced here.

Nothing in the argument needs C to be small or D to have any limits: the two universal properties are identified as conditions, and the existence of an object satisfying them is transported in both directions.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Ends exist over a small index category in a complete target, and coends in a cocomplete one

Statement

Let C be a small category (Small, locally small, and large categories) and let T:Cop×CD be a functor.

If D is complete, then T has an end. If D is cocomplete, then T has a coend (Finite, small, and large limits and colimits; complete and cocomplete categories, The end and the coend of a functor Cop×CD).

These conditions are sufficient and are not asserted to be necessary: the definition of an end asks only that a terminal wedge exist, and a particular functor on a large C, or into a target that is not complete, may still have one.

Facts & Assumptions

Given: A small category C and a functor T on Cop×C with values in a complete, respectively cocomplete, category D.

[F1]

The objects of Tw(C) are the morphisms of C, and a morphism fg is a pair (a,b) of morphisms of C with bfa=g (The twisted arrow category and its projection to Cop×C).

[F2]

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

[L1]

The wedges over T are the cones over Tπ, so an end is the limit over the twisted arrow category, and a coend is a colimit over Tw(C)op of the integrand read with domain and codomain swapped (An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite).

[F3]

A category is complete when it has all small limits and cocomplete when it has all small colimits, a diagram being small when its indexing category is small; Completeness and cocompleteness do not assert the existence of limits or colimits of large diagrams (Finite, small, and large limits and colimits; complete and cocomplete categories).

Proof

technique · direct
1.1

Tw(C) is small. Its objects are the morphisms of C, which form a set because C is small. A morphism of Tw(C) carries its domain f, its codomain g and the pair (a,b), so the collection of all of them is a subclass of the fourfold product Mor(C)×Mor(C)×Mor(C)×Mor(C), cut out by the equation bfa=g; a subclass of a set is a set, and no choice is used to form it.

F1F2given
2.1

The diagram Tπ is therefore a small diagram in D, so completeness of D supplies a limit for it, and by [L1] that limit is an end of T.

L1F3step 1.1
3.1

The opposite of a small category is small, since it has the same objects and the same morphisms, so Tπsw is a small diagram as well and cocompleteness of D supplies a colimit for it, which by [L1] is a coend of T.

L1F3step 1.1

Remarks

The smallness count is carried out rather than asserted because it is where a size hypothesis could quietly be dropped: it is the morphisms of Tw(C), not only its objects, that have to form a set before Tπ counts as a small diagram, and that in turn needs Mor(C) to be a set rather than merely each hom-set to be one. A locally small but large C is not enough.

Sufficiency is all that is claimed. That the hypotheses cannot simply be dropped is FALSE: every functor on Cop×C has an end, which exhibits a small index category and a target that is not complete in which an end fails to exist.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-26Open item page →

An end is the equalizer of two products, and a coend the coequalizer of two coproducts

Statement

Let C be a small category (Small, locally small, and large categories) and let T:Cop×CD be a functor. Suppose the two products

cOb(C)T(c,c),(f:cc)Mor(C)T(c,c)

exist in D (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations), and write Λ,P for the two morphisms between them determined by qfΛ=T(1c,f)pc and qfP=T(f,1c)pc for f:cc, where p and q are the projections of the first and second product.

Then an end is the equalizer of two products (Equalizers and coequalizers as limits and colimits of a parallel pair, The end and the coend of a functor Cop×CD): T has an end exactly when Λ,P have an equalizer, and then

cT(c,c)=eq(cT(c,c)  ΛP  f:ccT(c,c)).

Dually, if the coproducts cT(c,c) and (f:cc)T(c,c) exist, a coend is the coequalizer of two maps between coproducts: the two morphisms Λ,P determined on the f-summand by Λȷf=ιcT(f,1c) and Pȷf=ιcT(1c,f) have a coequalizer exactly when T has a coend, and then the coend is that coequalizer. Note that the f-summand of the second coproduct is T(c,c), with the domain and codomain of f interchanged.

Facts & Assumptions

Given: A small category C, a functor T on Cop×C, and the displayed products and coproducts wherever they are assumed to exist.

[F1]

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

[F2]

A product of (Ai)iI is an object P with projections pi such that every family fi:XAi has a unique pairing fiiI:XP,pifi=fi(iI), and dually a coproduct has injections ιi with unique copairings (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).

[F5]

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

[F3]

An equalizer of f,g:AB is a morphism e:EA satisfying fe=ge such that, whenever h:XA satisfies fh=gh, there is a unique u:XE with eu=h; a coequalizer is the dual (Equalizers and coequalizers as limits and colimits of a parallel pair).

[F6]

A limit of D is a terminal cone: explicitly, for every cone (X,ξ) there exists a unique morphism u:XL such that λju=ξj for every j (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F4]

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).

Proof

technique · direct
1.1

Because C is small, Ob(C) and Mor(C) are sets, so the two displayed families are set-indexed and the products named in the hypothesis are products of set-indexed families; no product over a proper class is formed anywhere below. The morphisms Λ and P exist and are unique because a morphism into a product is determined by its components.

F1F2F5given
2.1

For an object X, the pairing of [F2] is a bijection between morphisms u:XcT(c,c) and families αc:XT(c,c), given by αc=pcu. Under it, Λu=Pu holds exactly when qfΛu=qfPu for every f, that is exactly when T(1c,f)αc=T(f,1c)αc for every f:cc, which is the wedge equation. So the equalising morphisms XcT(c,c) correspond exactly to the wedges with vertex X, in both directions.

F1F2F3step 1.1
3.1

The correspondence of step 2.1 is compatible with precomposition: for h:XX the family attached to uh is (αch). So a morphism of wedges (X,α)(X,α) is exactly a morphism h with uh=u, and a terminal wedge is exactly a universal equalising morphism. By [F3] and [F4] that says T has an end exactly when Λ,P have an equalizer, and then the end is the equalizer, with ωc=pce; the same statement read through [F6] identifies both with the limit of the parallel pair.

F3F4F6step 2.1
4.1

Dually, the copairing of [F2] is a bijection between morphisms v:cT(c,c)X and families ρc:T(c,c)X, and vΛ=vP holds exactly when ρcT(f,1c)=ρcT(1c,f) for every f:cc, which is the cowedge equation; the same compatibility with postcomposition then makes an initial cowedge exactly a coequalizer of Λ,P. The indexing is written out rather than left to duality because the f-summand of the second coproduct is T(c,c) and not T(c,c).

F4step 3.1

Remarks

The two index sets are the objects and the morphisms of C, and they are not the objects and morphisms of Tw(C); this formula is therefore not an instance of the general construction of a limit from products and equalizers applied to An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite, and it is proved here from the wedge universal property directly.

The identity morphisms of C contribute components to the second product, and they cost nothing: at f=1c the equalising condition of step 2.1 reads αc=αc. Restricting the second product to the non-identity morphisms would give the same equalizer, but the unrestricted indexing is what makes the two morphisms Λ and P definable by a single formula.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

A set-valued coend is the disjoint union of the diagonal values modulo the dinaturality relation

Statement

Let C be a small category (Small, locally small, and large categories) and let T:Cop×CSet be a functor (Sets and functions form the large locally small category Set). Write

cT(c,c)={(c,x):cOb(C), xT(c,c)}

for the disjoint union of the diagonal values, and let be the least equivalence relation on it (Equivalence relation, equivalence class, and the quotient set A/) containing

(c,  T(f,1c)(x))    (c,  T(1c,f)(x))for every f:cc and every xT(c,c).

Then T has a coend, and it is the disjoint union of the diagonal values modulo the dinaturality relation (The end and the coend of a functor Cop×CD):

cT(c,c)=(cT(c,c))/,ρc(x)=[(c,x)].

Both generating elements are named with their summands: the pair is generated by an element x of the off-diagonal value T(c,c), pushed into the summand at c by T(f,1c) and into the summand at c by T(1c,f).

Facts & Assumptions

Given: A small category C and a functor T:Cop×CSet.

[F1]

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

[F4]

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

[L2]

Every small diagram D:JSet has a colimit; it is the quotient of the tagged union S={(j,x):xD(j)} by the least equivalence relation containing (j,x)(k,D(u)(x)) for u:jk (Set has all small colimits, realized as a quotient of a set-indexed disjoint union).

[F5]

The coproduct of an indexed family regarded as a diagram on the discrete category I is its colimit, with injections ιi through which every family fi:AiX factors by a unique copairing (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).

[L1]

For a small C whose displayed coproducts exist, a coend is the coequalizer of two maps between coproducts, namely of the two morphisms determined on the f-summand by T(f,1c) into the summand at c and by T(1c,f) into the summand at c, the f-summand being T(c,c) (An end is the equalizer of two products, and a coend the coequalizer of two coproducts).

[F6]

A coequalizer of g,h:AB is a morphism q:BQ satisfying qg=qh such that, whenever k:BX satisfies kg=kh, there is a unique u:QX with uq=k (Equalizers and coequalizers as limits and colimits of a parallel pair).

[F2]

A binary relation on A is an equivalence relation when it is reflexive on A, symmetric and transitive; the quotient set A/ is the set of equivalence classes and the quotient map π(a)=[a] is surjective (Equivalence relation, equivalence class, and the quotient set A/).

[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).

Proof

technique · direct
1.1

Since C is small, the objects and the morphisms of C form sets, so both families in question are set-indexed. A coproduct is a colimit of a discrete diagram, and on a discrete index category the only morphisms are identities, so the least equivalence relation of [L2] is equality and the colimit is the tagged union itself. Hence cT(c,c) and f:ccT(c,c) exist in Set and are the displayed disjoint unions.

F1F4F5L2
2.1

By [L1] the coend of T is the coequalizer, if it exists, of the two functions Λ,P:f:ccT(c,c)cT(c,c) given on the summand at f:cc by Λ(f,x)=(c,T(f,1c)(x)) and P(f,x)=(c,T(1c,f)(x)), where x ranges over T(c,c).

F3L1step 1.1
3.1

The quotient map q:cT(c,c)(cT(c,c))/ coequalises Λ and P, because every pair (Λ(f,x),P(f,x)) is one of the generating pairs of . If k is a function on cT(c,c) with kΛ=kP, then {(s,t):k(s)=k(t)} is an equivalence relation containing every generating pair, so it contains ; hence k is constant on classes and factors as k=kˉq for a unique kˉ, uniqueness because q is surjective. So q is a coequalizer of Λ and P.

F2F6step 2.1
4.1

Therefore the coequalizer of step 2.1 exists, and by [L1] and [F3] the coend of T is the quotient set of step 3.1, with the initial cowedge given by ρc(x)=[(c,x)].

F3L1step 3.1

Remarks

The source of a generating pair is the off-diagonal value T(c,c), indexed by f:cc running the other way; this is the same swap that appears in the description of a coend as a colimit over Tw(C)op (An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite). If T(c,c) is empty for some pair, that summand contributes no generating pair at all, and the corresponding identifications simply do not happen.

Identity morphisms contribute nothing: at f=1c both T(1c,1c) are the identity of T(c,c) and the generating pair is ((c,x),(c,x)), which every equivalence relation contains already.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-26Open item page →

A module-valued coend is the direct sum of the diagonal values modulo the dinaturality submodule

Statement

Let R be a unital ring, let C be a small category (Small, locally small, and large categories) and let T:Cop×CR-Mod be a functor (Left modules over a fixed ring and module homomorphisms form the large locally small category R-Mod). Write ȷc:T(c,c)cT(c,c) for the coordinate inclusions of the direct sum (The direct sum of an indexed family of modules) and let

S:=  ȷc(T(f,1c)(x))ȷc(T(1c,f)(x))  :  f:cc in C, xT(c,c)  R

be the submodule generated by those elements (Submodule of a module, Generated submodule, cyclic and finitely generated modules, module basis and free module).

Then T has a coend, and it is the direct sum of the diagonal values modulo the dinaturality submodule (The end and the coend of a functor Cop×CD, Quotient module M/N with scalar multiplication on additive cosets):

cT(c,c)=(cT(c,c))/S,ρc=πȷc,

where π is the quotient homomorphism. As in the set-valued case, the generating element x lies in the off-diagonal value T(c,c), and the two terms of the generator sit in the summands at c and at c respectively.

Facts & Assumptions

Given: A unital ring R, a small category C, and a functor T from Cop×C to left R-modules.

[F5]

For a fixed ring R, left R-modules and module homomorphisms form a large locally small category R-Mod (Left modules over a fixed ring and module homomorphisms form the large locally small category R-Mod).

[F8]

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

[F1]

The direct sum iIMi is the submodule of the direct product consisting of the families of finite support, with coordinate inclusions ȷi; If I=, both product and direct sum are the zero module. (The direct sum of an indexed family of modules).

[F3]

A subset NM is a submodule when it is a subgroup of the additive group of M and is closed under scalars: rR, nNrnN (Submodule of a module).

[F2]

The submodule generated by SM is SR:={NM:SN}, the smallest submodule of M containing S (Generated submodule, cyclic and finitely generated modules, module basis and free module).

[F4]

For NM the quotient module M/N has the cosets m+N as elements and scalar action r(m+N):=rm+N (Quotient module M/N with scalar multiplication on additive cosets).

[L1]

For every family of homomorphisms fi:MiN there is a unique homomorphism f:iIMiN such that fȷi=fi for every i. It is given by the finite sum of the fi(mi) over the support (Universal property of a direct sum of modules).

[L2]

If f:MP is a homomorphism and NM satisfies Nkerf, there is a unique homomorphism fˉ:M/NP such that fˉ(m+N)=f(m), equivalently f=fˉπ (A module homomorphism vanishing on N factors uniquely through M/N).

[F7]

A cowedge from T to d is a dinatural transformation from T to a constant functor: a family ρc:T(c,c)d with ρcT(f,1c)=ρcT(1c,f) for every f:cc (Wedges and cowedges, and the categories they form).

[F6]

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).

Proof

technique · constructive
1.1

Since C is small its objects form a set, so (T(c,c))cOb(C) is a set-indexed family of left R-modules and the direct sum cT(c,c) with its coordinate inclusions ȷc is formed.

F1F5F8givenconstruct
2.1

The displayed generating elements lie in cT(c,c), so S is the smallest submodule containing them, and Q:=(cT(c,c))/S with quotient homomorphism π is a left R-module. The construction is carried out here rather than obtained from a general cocompleteness theorem, which would assert that the coend exists without exhibiting it.

F2F3F4step 1.1construct
3.1

The family ρc:=πȷc is a cowedge from T to Q: for f:cc and xT(c,c) the difference ρc(T(f,1c)(x))ρc(T(1c,f)(x)) is π applied to a generator of S, hence zero, and each ρc is a homomorphism because the coordinate inclusion ȷc and the quotient map π are.

F1F4F7step 2.1
4.1

Let λc:T(c,c)N be any cowedge. By [L1] there is a unique homomorphism λ:cT(c,c)N with λȷc=λc; the cowedge equations for the family λc make every displayed generator lie in kerλ, and kerλ is a submodule, so Skerλ by [F2]. By [L2] there is a unique λˉ:QN with λˉπ=λ, hence with λˉρc=λc for every c; and any homomorphism μ:QN with μρc=λc satisfies μπȷc=λc, so μπ=λ by the uniqueness in [L1] and μ=λˉ by the uniqueness in [L2]. So (Q,ρ) is an initial cowedge, that is a coend of T.

F6F7L1L2step 3.1
5.1

If C is empty the index set is empty, so by [F1] the direct sum is the zero module, the generating set is empty, S is the zero submodule and Q is the zero module; step 4.1 then says the zero module is the initial cowedge, which is correct because a cowedge under the empty family is just an object and the zero module is initial in R-Mod. This is the asserted presentation of the coend in every case.

F1step 4.1discharge-construct

Remarks

The route is deliberately through the direct-sum and quotient universal properties rather than through a cocompleteness theorem for R-modules: such a theorem says a colimit exists, and what is wanted here is the coequalizer itself, in a form in which an element of the coend can be named as a class of a finite sum.

At f=1c the generator is ȷc(x)ȷc(x)=0, so identity morphisms enlarge S by nothing; and if C is discrete there are no non-identity morphisms at all, S is the zero submodule and the coend is the direct sum of the diagonal values.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A functor preserving twisted-arrow limits preserves ends, and dually for coends

Statement

Let T:Cop×CD be a functor and let F:DE be a functor.

Ends. If F preserves Tw(C)-limits (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors, The twisted arrow category and its projection to Cop×C) and (e,ω) is an end of T (The end and the coend of a functor Cop×CD), then (Fe,Fω) is an end of FT; so a functor preserving twisted-arrow limits preserves ends.

Coends. If F preserves Tw(C)op-colimits and (q,ρ) is a coend of T, then (Fq,Fρ) is a coend of FT.

Small index. If in addition C is small (Small, locally small, and large categories), then every continuous F satisfies the first hypothesis and every cocontinuous F the second, so a continuous functor carries an end over a small index category to an end and a cocontinuous functor carries such a coend to a coend.

Facts & Assumptions

Given: Functors T:Cop×CD and F:DE, and an end or a coend of T where one is assumed.

[L1]

The wedges over T are exactly the cones over Tπ, by ξf=T(1c,f)ωc and ωc=ξ1c, so an end is the limit over the twisted arrow category; dually the cowedges under T are the cocones under Tπsw and a coend is a colimit over Tw(C)op (An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite).

[F1]

F preserves J-limits if the image under F of every limiting cone over D:JC is limiting over FD; the terms for colimits use cocones (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).

[F2]

A functor is continuous if it preserves all small limits and cocontinuous if it preserves all small colimits (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).

[F3]

The objects of Tw(C) are the morphisms of C, and a morphism fg is a pair of morphisms of C subject to one equation (The twisted arrow category and its projection to Cop×C).

[F4]

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).

[F5]

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

Proof

technique · direct
1.1

By [L1] the wedge ω over T with vertex e corresponds to the cone ξ over Tπ with ξf=T(1c,f)ωc, and (e,ω) is an end of T exactly when (e,ξ) is a limiting cone; dually the cowedge ρ corresponds to the cocone ζ under Tπsw with ζf=ρcT(f,1c), and (q,ρ) is a coend exactly when (q,ζ) is a colimiting cocone.

F3F4L1
2.1

Suppose F preserves Tw(C)-limits. Then (Fe,Fξ) is a limiting cone over FTπ. Functoriality gives Fξf=F(T(1c,f))Fωc=(FT)(1c,f)Fωc, so Fξ is exactly the cone that [L1] attaches to the family Fω, which is therefore a wedge over FT; being limiting, it makes (Fe,Fω) an end of FT.

F1L1step 1.1
2.2

Suppose F preserves Tw(C)op-colimits. Then (Fq,Fζ) is a colimiting cocone under FTπsw, and Fζf=Fρc(FT)(f,1c) is the cocone that [L1] attaches to Fρ; so Fρ is a cowedge under FT and (Fq,Fρ) is a coend of FT.

F1L1step 1.1
3.1

If C is small then Tw(C) is small, since its objects are the morphisms of C and its morphisms form a subclass of a fourfold product of Mor(C) with itself; the opposite of a small category is small. So a continuous F, which by [F2] preserves all small limits, preserves Tw(C)-limits and step 2.1 applies, and a cocontinuous F preserves Tw(C)op-colimits and step 2.2 applies.

F2F3F5L1step 2.1step 2.2

Remarks

The hypothesis is stated at the strength the proof uses, preservation of limits indexed by Tw(C), and not as continuity: in this library a continuous functor is one preserving all small limits, and Tw(C) is small only when C is. A blanket claim that continuous functors preserve all ends would be false for a large index category, and no such claim is made here.

Dropping the hypothesis altogether is not possible: FALSE: every functor preserves the ends that exist in its domain exhibits two finite witnesses, both monotone maps of finite posets, that carry an end to something other than the end of the composite.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A right adjoint preserves ends and a left adjoint preserves coends

Statement

Let T:Cop×CD be a functor and let FG be an adjunction with F:DD and G:DD (Adjunction by unit, counit, and the triangle identities).

If T has an end (The end and the coend of a functor Cop×CD), then G carries it to an end of GT. If T has a coend and HK is an adjunction with H:DE, then H carries that coend to a coend of HT.

No smallness hypothesis on C is imposed, because the published preservation theorem imposes none: it applies at every indexing category for which the diagram and cone categories are legitimate, and Tw(C) is one such whenever Tπ is a diagram at all.

Facts & Assumptions

Given: A functor T on Cop×C and an adjunction whose right or left half is applied to it.

[F1]

An adjunction FG consists of functors F,G with unit and counit satisfying the triangle identities (εF)(Fη)=1F,(Gε)(ηG)=1G. The direction FG means that F is left adjoint to G and G is right adjoint to F (Adjunction by unit, counit, and the triangle identities).

[L2]

If a diagram D:JD has a limit (L,λ) and FG, then (GL,Gλ) is a limit of GD. Thus G preserves every limit that exists, for arbitrary indexing categories for which the displayed diagram and cone categories are legitimate. (Right adjoints preserve every limit that exists).

[L3]

If F is a left adjoint and a diagram has a colimit, then applying F to a colimiting cocone produces a colimit of the composite. Thus left adjoints preserve every colimit that exists. (Left adjoints preserve every colimit that exists).

[L1]

If F preserves Tw(C)-limits and T has an end, then F of that end is an end of FT, so a functor preserving twisted-arrow limits preserves ends; dually a functor preserving Tw(C)op-colimits carries a coend to a coend (A functor preserving twisted-arrow limits preserves ends, and dually for coends).

[F2]

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).

Proof

technique · direct
1.1

By [F1] the functor G of the adjunction FG is a right adjoint, and by [L2] a right adjoint preserves every limit that exists, at arbitrary legitimate indexing categories. In particular it preserves Tw(C)-limits, and no size hypothesis on C is used to say so.

F1L2
2.1

So G satisfies the hypothesis of [L1] at the indexing category Tw(C), and therefore carries an end of T to an end of GT.

F2L1L2step 1.1
3.1

Dually, by [L3] a left adjoint preserves every colimit that exists, hence preserves Tw(C)op-colimits, and by the coend clause of [L1] it carries a coend of T to a coend of HT.

F2L1L3step 1.1

Remarks

The corollary is stated for a right adjoint and a left adjoint separately because the two halves of an adjunction do different things here: the right adjoint is the one that preserves the limit computing an end, and the left adjoint the one that preserves the colimit computing a coend. Applying the wrong half of an adjunction to the wrong universal object gives no information at all.

The hom-functor case is the one used most often below and is recorded separately as The hom-functor turns a coend into an end and carries an end to an end, because the covariant hom-functor turns a coend into an end rather than preserving a coend, and that change of shape is not an instance of the present corollary.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The hom-functor turns a coend into an end and carries an end to an end

Statement

Let C be small (Small, locally small, and large categories), let D be locally small, let T:Cop×CD be a functor and let X be an object of D (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

From a coend to an end. Write H:Cop×CSet for the functor H(a,b):=D(T(b,a),X), whose action on a morphism (g,h) of the product category is precomposition with T(h,g), so that H(c,c)=D(T(c,c),X). If T has a coend (The end and the coend of a functor Cop×CD), then the hom-functor turns a coend into an end: H has an end and

D(cT(c,c),X)    cD(T(c,c),X).

From an end to an end. If T has an end, then D(X,) carries it to an end of D(X,T(,)), so

D(X,cT(c,c))    cD(X,T(c,c)).

Facts & Assumptions

Given: A small C, a locally small D, a functor T on Cop×C with values in D, and an object X of D.

[F5]

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

[F1]

The objects of Tw(C) are the morphisms of C, and a morphism fg is a pair (a,b) of morphisms of C with bfa=g (The twisted arrow category and its projection to Cop×C).

[F2]

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

[F4]

The hom-assignment sends (a,b) to C(a,b), and a morphism of the product category consisting of h:aa and u:bb acts by C(h,u):C(a,b)C(a,b),fufh (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[L4]

The wedges over a functor are exactly the cones over its composite with the twisted arrow projection, and the cowedges are the cocones under the composite with the swapped projection, so an end is the limit over the twisted arrow category and a coend a colimit over its opposite (An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite).

[L1]

For every object X of a locally small category and every small diagram D with a colimit there is a natural bijection C(colimD,X)limjJopC(D(j),X). (Hom(X,−) is continuous, while Hom(−,X) sends every existing small colimit to a limit of sets).

[L2]

For every object X of a locally small category C, the covariant hom-functor C(X,) preserves all small limits that exist (Hom(X,−) is continuous, while Hom(−,X) sends every existing small colimit to a limit of sets).

[L3]

If F preserves Tw(C)-limits and T has an end, then F of that end is an end of FT, so a functor preserving twisted-arrow limits preserves ends (A functor preserving twisted-arrow limits preserves ends, and dually for coends).

[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).

Proof

technique · direct
1.1

Since C is small, Tw(C) is small and so is its opposite, so the coend of T is the colimit of a small diagram; and (Tw(C)op)op=Tw(C) strictly. Moreover H is a functor, because precomposition with T(h,g) is functorial in (g,h) by the displayed action of [F4] read in D, and for f:cc its composite with the twisted arrow projection has value H(c,c)=D(T(c,c),X), which is D applied to the value of the swapped projection at f.

F1F2F4F5
2.1

Apply [L1] to the small diagram whose colimit is the coend, indexed by Tw(C)op: it gives a bijection between D(cT(c,c),X) and the limit over Tw(C) of the diagram identified in step 1.1, which is the composite of H with the twisted arrow projection. By [L4] read in the direction from limits to ends, that limit is an end of H, so H has an end and the displayed bijection is the first assertion.

F2F3L1L4step 1.1
3.1

For the second assertion, [L2] says D(X,) preserves all small limits that exist, and Tw(C)-limits are small by step 1.1, so D(X,) preserves them; by [L3] it therefore carries an end of T to an end of D(X,T(,)), which is the displayed bijection.

F3L2L3step 1.1

Remarks

The two clauses are not the same statement read twice. The covariant hom-functor is continuous and so preserves ends; the contravariant one turns colimits into limits, and so turns a coend into an end, changing the shape of the universal object rather than preserving it. Only the second clause is an instance of preservation.

Local smallness of D is what makes both right-hand sides Set-valued, and smallness of C is what makes the diagram indexed by Tw(C) small, which is the hypothesis the published statement about colimits carries. Neither can simply be dropped.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Ends and coends with parameters

Definition

Let P, C and D be categories and let

T:P×Cop×CD

be a functor (Product category and its projection functors, Covariant functor, identity functor, composite functor, and contravariant functor). For an object p of P write T(p,,):Cop×CD for the functor obtained by holding the first variable at p and the identity of p; that this is a functor is immediate from the functor laws for T applied to morphisms whose first coordinate is 1p.

A parametrised end of T is a choice, for every object p of P, of an end of T(p,,) (The end and the coend of a functor Cop×CD): that is, an end taken in the two dinatural variables with the remaining variables held fixed. Its vertex at p is written cT(p,c,c) and its wedge components ωcp (Wedges and cowedges, and the categories they form). A parametrised coend is a choice of a coend of T(p,,) for every p, with vertex cT(p,c,c) and cowedge components ρcp.

The variable p is the parameter and the variables in the second and third slots are the dinatural variables. Nothing here asserts that the vertices assemble into a functor of p: that is a further statement, and it is proved in A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters from the choice given here.

Remarks

The definition is stated as a choice rather than as an operation for a reason that is not bookkeeping. The parameter category may have a proper class of objects, and an end is only determined up to isomorphism, so "the" end at every parameter is not a well-defined assignment until one end has been selected at each parameter. Every statement below that treats a parametrised end functorially therefore carries that choice as a hypothesis.

Several parameters are covered by the same definition, since a product of parameter categories is again a parameter category. The case P=Eop×E is the one that appears in the Fubini theorem, where the parameter itself is later made dinatural.

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

A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters

Statement

Let T:P×Cop×CD be a functor and suppose given a parametrised end of T (Ends and coends with parameters): an end (E(p),ωp) of T(p,,) for every object p of P (The end and the coend of a functor Cop×CD, Wedges and cowedges, and the categories they form).

Then there is exactly one functor structure making every counit component natural in the parameter: exactly one assignment of a morphism E(u):E(p)E(p) to each u:pp such that E satisfies the functor laws (Covariant functor, identity functor, composite functor, and contravariant functor) and, for every object c of C, the family ωc is natural in the parameter, that is

ωcpE(u)=T(u,1c,1c)ωcpfor every u:pp and every c.

The statement is about a given choice of ends. It does not assert that a functor on P can be produced from the bare hypothesis that each T(p,,) has an end.

Facts & Assumptions

Given: A functor T on P×Cop×C and a chosen end (E(p),ωp) of T(p,,) for every object p of P.

[F1]

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, and every wedge factors through a terminal one by exactly one morphism (The end and the coend of a functor Cop×CD).

[F2]

A wedge from d to T is a dinatural transformation from a constant functor to T: a family ωc:dT(c,c) with T(1c,f)ωc=T(f,1c)ωc for every f:cc (Wedges and cowedges, and the categories they form).

[F3]

A parametrised end of T is a choice, for every object p of the parameter category, of an end taken in the two dinatural variables with the remaining variables held fixed (Ends and coends with parameters).

[L1]

For a natural transformation η:PP of functors on Cop×C whose ends exist, a natural transformation induces a unique morphism of ends: there is exactly one η with ωcη=ηc,cωc for every c (A natural transformation of functors induces a unique morphism of their ends and of their coends).

[F4]

A functor satisfies F(1A)=1FA,F(gf)=FgFf (Covariant functor, identity functor, composite functor, and contravariant functor).

Proof

technique · direct
1.1

For u:pp the family T(u,1a,1b):T(p,a,b)T(p,a,b), indexed by the objects (a,b) of Cop×C, is a natural transformation T(p,,)T(p,,): its naturality equation at a morphism (g,h) is the equality of the two ways of writing T applied to the composite of (u,1a,1b) with (1p,g,h) and of (1p,g,h) with (u,1a,1b), and these composites agree in P×Cop×C because composition there is componentwise.

F1F2F3given
2.1

By [L1] applied to that natural transformation, terminality of the chosen end at p gives exactly one morphism E(u):E(p)E(p) satisfying ωcpE(u)=T(u,1c,1c)ωcp for every c; so an arrow map with the required naturality exists and no other assignment has it.

F1F3L1step 1.1
3.1

The identity of E(p) satisfies the equation defining E(1p), since T(1p,1c,1c) is the identity of T(p,c,c) by [F4]; by the uniqueness in step 2.1, E(1p)=1E(p).

F1F4step 2.1
3.2

For u:pp and u:pp, both E(u)E(u) and E(uu) satisfy ωcp()=T(uu,1c,1c)ωcp, the first because T(u,1c,1c)T(u,1c,1c)=T(uu,1c,1c) by [F4]; by the uniqueness in step 2.1 they are equal.

F4step 2.1
4.1

So E with the arrow map of step 2.1 is a functor and every ωc is natural in the parameter; and any functor structure with that naturality has an arrow map satisfying the same defining equation, hence equals this one by the uniqueness in step 2.1. That is the asserted existence and uniqueness.

step 2.1step 3.1step 3.2

Remarks

The whole argument is the uniqueness half of one universal property, used four times: once to produce the arrow map, once for each functor law, and once for the uniqueness of the structure. Nothing is checked by hand about the morphisms E(u) themselves.

Stating the theorem in the data-supplied form matters. Without a chosen end at every parameter there is no object map to make functorial, and producing one would mean selecting an end simultaneously for all objects of P, which may be a proper class. The library's treatment of chosen limits carries the same hypothesis for the same reason.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A family into a parametrised end is natural, or dinatural, in the parameter exactly when its composite with the counit is

Statement

Let T:P×Cop×CD be a functor with a chosen parametrised end (Ends and coends with parameters), with counit components ωcp:E(p)T(p,c,c) and carrying the functor structure E:PD of A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters.

Natural clause. Let X:PD be a functor and let ϕp:X(p)E(p) be a family indexed by the objects of P. Then a family into a parametrised end is natural in the parameter exactly when its composite with the counit is: ϕ is a natural transformation XE (Natural transformation and its components) if and only if, for every object c of C, the family ωcpϕp:X(p)T(p,c,c) is natural in p.

Dinatural clause. Suppose instead the parameter category is P=Qop×Q (Opposite category Cop, Product category and its projection functors), let Y be an object of D, and let ψq:YE(q,q) be a family indexed by the objects of Q. Then ψ is a wedge from Y to E (Wedges and cowedges, and the categories they form) if and only if, for every object c of C, the family ωc(q,q)ψq:YT(q,q,c,c) is a wedge from Y to T(,,c,c).

Facts & Assumptions

Given: A functor T on P×Cop×C with a chosen parametrised end and its functor structure E; for the natural clause a functor X:PD and a family ϕp:X(p)E(p); for the dinatural clause a parameter category of the form Qop×Q, an object Y and a family ψq:YE(q,q).

[F1]

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, so a wedge factors through a terminal one by exactly one morphism (The end and the coend of a functor Cop×CD).

[F2]

A wedge from d to T is a dinatural transformation from a constant functor to T: a family ωc:dT(c,c) with T(1c,f)ωc=T(f,1c)ωc; precomposing a wedge with a morphism of the vertex again gives a wedge (Wedges and cowedges, and the categories they form).

[F4]

A parametrised end of T is a choice, for every object p of the parameter category, of an end taken in the two dinatural variables with the remaining variables held fixed (Ends and coends with parameters).

[L1]

A chosen parametrised end carries exactly one functor structure making every counit component natural in the parameter, characterised by ωcpE(u)=T(u,1c,1c)ωcp (A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters).

[F3]

A natural transformation α:FG is a family αA:FAGA such that every f:AB satisfies the naturality equation GfαA=αBFf (Natural transformation and its components).

[F5]

A morphism (q,q)(q,q) of Qop×Q is a pair whose first coordinate is a morphism of Qop and whose second is a morphism of Q, with componentwise composition (f,g)(f,g)=(ff,gg) (Product category and its projection functors).

[F6]

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

Proof

technique · direct
1.1

Fix u:pp and an object c of C. The two morphisms X(p)E(p) at issue for the natural clause are ϕpX(u) and E(u)ϕp, and their composites with ωcp are (ωcpϕp)X(u) and, by the defining equation of [L1], T(u,1c,1c)(ωcpϕp). Two morphisms ZE(p) whose composites with ωcp agree for every c are equal, because the common composite family is the terminal wedge precomposed with a morphism, hence a wedge, and it has exactly one factorisation through E(p).

F1F2F4L1
2.1

For the forward direction of the natural clause, suppose ϕ is natural in p. Then for every c the family ωcϕ is the composite of the natural family ϕ with the family ωc, which is natural by [L1]; a composite of two natural families is natural by the naturality equation of [F3] applied twice, so ωcϕ is natural in p.

F3L1step 1.1
2.2

For the converse direction of the natural clause, suppose every ωcϕ is natural in p. Its naturality equation at u reads T(u,1c,1c)(ωcpϕp)=(ωcpϕp)X(u), so by step 1.1 the morphisms ϕpX(u) and E(u)ϕp have the same composite with ωcp for every c and are therefore equal. Since u was arbitrary, ϕ is natural in the parameter.

F1F3L1step 1.1
3.1

For the dinatural clause, fix u:qq in Q. The wedge equation for ψ at u is E(1q,u)ψq=E(u,1q)ψq, an equation between morphisms YE(q,q), where (1q,u) and (u,1q) are the two morphisms of Qop×Q that the wedge equation names. Composing with ωc(q,q) and applying the defining equation of [L1] at each of them turns the two sides into T(1q,u,1c,1c)(ωc(q,q)ψq) and T(u,1q,1c,1c)(ωc(q,q)ψq), whose equality for every u is exactly the wedge equation for the family ωc(,)ψ over T(,,c,c). So the wedge equation for ψ implies the one downstairs by composition, and conversely if it holds downstairs for every c then the two morphisms of the wedge equation for ψ agree after composition with every ωc(q,q), hence are equal by step 1.1.

F1F2F5F6L1step 2.2

Remarks

Only the converse directions have content, and what they spend is the uniqueness half of the end's universal property rather than its existence half: two morphisms into an end that agree after composition with every counit component are equal. The forward directions are composition, and would hold for any chosen family of objects with a counit natural in the parameter.

The dinatural clause is the step that the Fubini theorem spends. There the parameter is itself the pair of variables in which the outer end is taken, so what has to be transported across the two orders of integration is the wedge condition in that parameter rather than naturality.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A wedge on a product index category is exactly a family dinatural in each variable separately

Statement

Let C, D and E be categories and let

T:(C×D)op×(C×D)E

be a functor. Reindexing the source as Cop×Dop×C×D (Product category and its projection functors, Opposite category Cop), write T(c1,d1,c2,d2) for its values, contravariant in the first two slots and covariant in the last two.

Let X be an object of E and let ω(c,d):XT(c,d,c,d) be a family indexed by the objects of C×D. Then a wedge on a product index category is exactly a family dinatural in each variable separately: ω is a wedge from X to T (Wedges and cowedges, and the categories they form) if and only if

  • for every f:cc in C and every object d of D,   T(1c,1d,f,1d)ω(c,d)=T(f,1d,1c,1d)ω(c,d), and
  • for every g:dd in D and every object c of C,   T(1c,1d,1c,g)ω(c,d)=T(1c,g,1c,1d)ω(c,d).

The equivalence is asserted for wedges, whose source is the constant functor at X. It is not asserted for a dinatural transformation between two varying functors (Dinatural transformation between functors on Cop×C).

Facts & Assumptions

Given: A functor T as displayed, an object X of E, and a family ω(c,d):XT(c,d,c,d).

[F2]

A wedge from d to T is a dinatural transformation from a constant functor to T: a family ωc:dT(c,c) with T(1c,f)ωc=T(f,1c)ωc for every morphism f:cc of the index category (Wedges and cowedges, and the categories they form).

[F3]

A dinatural transformation α:PQ satisfies Q(1c,f)αcP(f,1c)=Q(f,1c)αcP(1c,f) for every f:cc, the equation displayed by the hexagon (Dinatural transformation between functors on Cop×C).

[F4]

The product category has objects the pairs, componentwise identities, and componentwise composition (f,g)(f,g)=(ff,gg) (Product category and its projection functors).

[F6]

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

[F5]

A functor satisfies F(1A)=1FA,F(gf)=FgFf (Covariant functor, identity functor, composite functor, and contravariant functor).

Proof

technique · direct
1.1

A morphism (c,d)(c,d) of C×D is a pair (f,g) with f:cc and g:dd, and under the reindexing the wedge equation of [F2] at that morphism reads T(1c,1d,f,g)ω(c,d)=T(f,g,1c,1d)ω(c,d), an equation between morphisms XT(c,d,c,d). The two displayed conditions of the Statement are this equation at (f,1d) and at (1c,g).

F2F3F4F6
2.1

For the forward direction, if ω is a wedge then the equation of step 1.1 holds at every morphism of C×D, in particular at (f,1d) and at (1c,g), which are the two displayed conditions.

F2F3step 1.1
3.1

For the converse direction, assume the two conditions and fix (f,g). Since T acts independently in its four slots, T(1c,1d,f,g)=T(1c,1d,1c,g)T(1c,1d,f,1d), so the first condition rewrites the left-hand side of step 1.1 as T(1c,1d,1c,g)T(f,1d,1c,1d)ω(c,d)=T(f,1d,1c,g)ω(c,d). Factoring again as T(f,1d,1c,g)=T(f,1d,1c,1d)T(1c,1d,1c,g) and applying the second condition at c gives T(f,1d,1c,1d)T(1c,g,1c,1d)ω(c,d)=T(f,g,1c,1d)ω(c,d), which is the right-hand side of step 1.1. Factoring (f,g) in the other order gives the same result, because each factorisation is a composite in Cop×Dop×C×D of the same pair of morphisms in different slots. At f=1c the first condition is the identity equation ω(c,d)=ω(c,d) and the chain reduces to the second condition alone; at g=1d it reduces to the first, so the reduction is not circular.

F2F3F4F5step 1.1step 2.1
4.1

The two directions together give the asserted equivalence. What the converse direction spends is that the source of ω is the constant functor at X: each rewriting in step 3.1 composed a one-variable equation on the target side only, with no source-side action to carry along, and for a dinatural transformation between two varying functors there is such an action in every slot, so the corresponding statement does not follow from this argument and is not asserted.

F2step 3.1

Remarks

That dinaturality is fragile under exactly this kind of extension is not a suspicion: Dinatural transformations do not compose in general exhibits two dinatural transformations on this same page whose composite is not dinatural, and the mechanism there is also a source-side action that the constant case does not have.

Both factorisations of (f,g) are checked because they are the two ways the joint equation can be reduced, and an argument that used only one of them would leave open whether the two one-variable conditions had to be imposed in a fixed order. They do not: the four slots act independently.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Fubini: an end over a product index category and the two iterated ends exist together and agree

Statement

Let T:(C×D)op×(C×D)E be a functor, reindexed as a functor T(c1,d1,c2,d2) on Cop×Dop×C×D (Product category and its projection functors, Opposite category Cop).

Assume a chosen family of inner ends in each of the two orders (Ends and coends with parameters): an end S(c1,c2)=dT(c1,d,c2,d) for every pair of objects of C, and an end S(d1,d2)=cT(c,d1,c,d2) for every pair of objects of D, each carrying the functor structure of A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters.

Then an end over a product index category and the two iterated ends exist together and agree: the three objects

(c,d)T(c,d,c,d),cdT(c,d,c,d),dcT(c,d,c,d)

are such that if any one exists then all three do, and any two of them are joined by the unique isomorphism compatible with every component (An end and a coend are unique up to a unique isomorphism compatible with every component).

The same statement holds for coends, with a chosen family of inner coends in each order and initial cowedges throughout.

No smallness hypothesis on C or D is used or claimed.

Facts & Assumptions

Given: A functor T as displayed, together with a chosen family of inner ends in each of the two orders and their functor structures.

[F1]

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, and every wedge factors through a terminal one by exactly one morphism (The end and the coend of a functor Cop×CD).

[F2]

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

[F7]

A parametrised end of T is a choice, for every object p of the parameter category, of an end taken in the two dinatural variables with the remaining variables held fixed (Ends and coends with parameters).

[F5]

The product category has objects the pairs, componentwise identities, and componentwise composition (f,g)(f,g)=(ff,gg) (Product category and its projection functors).

[F6]

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

[F8]

A functor satisfies F(1A)=1FA,F(gf)=FgFf (Covariant functor, identity functor, composite functor, and contravariant functor).

[L1]

A family indexed by the objects of C×D is a wedge on a product index category is exactly a family dinatural in each variable separately, the two conditions being the wedge equation at (f,1d) and at (1c,g) (A wedge on a product index category is exactly a family dinatural in each variable separately).

[L2]

A chosen parametrised end carries exactly one functor structure making every counit component natural in the parameter, characterised by ωcpE(u)=T(u,1c,1c)ωcp (A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters).

[L3]

For a parameter category Qop×Q, a family into a parametrised end is natural, or dinatural, in the parameter exactly when its composite with the counit is: a family ψq:YE(q,q) is a wedge over E if and only if every ωc(q,q)ψq is a wedge over the integrand with the dinatural variables held at c (A family into a parametrised end is natural, or dinatural, in the parameter exactly when its composite with the counit is).

[L4]

Two ends of one functor are joined by exactly one isomorphism commuting with every component, and dually for coends; so an end and a coend are unique up to a unique isomorphism compatible with every component (An end and a coend are unique up to a unique isomorphism compatible with every component).

Proof

technique · direct
1.1

Under the reindexing, T is a functor of four slots, contravariant in the first two and covariant in the last two, and holding the two C-slots fixed at a pair (c1,c2) leaves a functor of the two D-slots whose chosen end is S(c1,c2), with counit θd(c1,c2) natural in the parameter (c1,c2) by [L2]. Symmetrically for S with the roles of C and D exchanged.

F2F5F6F7L2given
2.1

Fix an object X of E. Given a wedge ω from X to T, [L1] makes it dinatural in each variable separately; dinaturality in d at fixed c is exactly the wedge equation for the family (ω(c,d))d over the integrand with the C-slots held at (c,c), so by [F1] there is exactly one ψc:XS(c,c) with θd(c,c)ψc=ω(c,d) for every d. By [L3], applied with parameter category Cop×C, that family ψ is a wedge over S if and only if every θd(c,c)ψc, which is ω(c,d), is dinatural in c at fixed d — which is the other half of [L1]. Conversely a wedge ψ over S produces ω(c,d):=θd(c,c)ψc, dinatural in d because θ(c,c) is a wedge precomposed with ψc, and dinatural in c by [L3] again, hence a wedge over T by [L1].

F1F2F7L1L3step 1.1
3.1

The two assignments of step 2.1 are mutually inverse, since each ψ is the unique factorisation of the ω it produces, and ω is recovered from ψ by the defining equation. A morphism h:XX satisfies ω(c,d)h=ω(c,d) for every (c,d) exactly when it satisfies ψch=ψc for every c: one direction is composition with θd(c,c), and the other is the uniqueness in [F1]. So the wedge category of T and the wedge category of S are isomorphic over the identity on vertices, terminal objects correspond, and (c,d)T(c,d,c,d) exists exactly when cS(c,c) does, with the same vertex.

F1F2step 2.1
4.1

The same argument with the roles of C and D exchanged, applied to the chosen family S, gives that (c,d)T(c,d,c,d) exists exactly when dS(d,d) does, again with the same vertex. Hence any one of the three objects exists exactly when the others do, and by [L4] any two choices of them are joined by exactly one isomorphism commuting with every component.

F1L4step 3.1
5.1

For the coend clause, let U(x1,x2):=T(x2,x1) on objects and U(g,h):=T(h,g) on morphisms, read as a functor (C×D)op×(C×D)Eop; it satisfies the functor laws by [F8] and [F6], since reversing both the pair of slots and the direction of the target twice returns the composition order of T. Its diagonal values are those of T, and by [F2] a wedge from X to U in Eop is precisely a cowedge from T to X in E, a morphism of wedges being a morphism of cowedges reversed; so a terminal wedge over U is an initial cowedge under T, that is a coend of T. Applying steps 3.1 and 4.1 to U in Eop, with the chosen family of inner coends of T as the chosen family of inner ends of U, gives the coend clause in full.

F1F2F6F8step 3.1step 4.1

Remarks

The route is through the universal property and not through a formula. In particular the target E is not assumed to have copowers, products or any other structure, and neither index category is assumed small: what is assumed is exactly that the inner ends have been chosen, which is what the statement of the theorem says.

The reindexing in step 1.1 is part of the content and not bookkeeping. A wedge over T is indexed by the objects of C×D and constrained by its morphisms, and it is only after the source is written as Cop×Dop×C×D that the two one-variable conditions can be separated at all.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Iterated ends may be taken in either order

Statement

Let T:(C×D)op×(C×D)E be a functor, reindexed as in Fubini: an end over a product index category and the two iterated ends exist together and agree, and assume chosen families of inner ends in each order together with the functor structures in their remaining parameters (Ends and coends with parameters, Product category and its projection functors).

If either iterated end exists, so does the other, and there is exactly one isomorphism

cdT(c,d,c,d)    dcT(c,d,c,d)

commuting with every component of the two wedges over the product index category that they induce (The end and the coend of a functor Cop×CD). The hypotheses are exactly those of Fubini: an end over a product index category and the two iterated ends exist together and agree and nothing is added.

Facts & Assumptions

Given: A functor T on (C×D)op×(C×D) with chosen inner-end families in both orders and their functor structures in the remaining parameters.

[F1]

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).

[F3]

A parametrised end of T is a choice, for every object p of the parameter category, of an end taken in the two dinatural variables with the remaining variables held fixed (Ends and coends with parameters).

[F4]

The product category has objects the pairs, componentwise identities, and componentwise composition (f,g)(f,g)=(ff,gg) (Product category and its projection functors).

[L1]

Under chosen families of inner ends in each order carrying their functor structures in the remaining parameters, an end over a product index category and the two iterated ends exist together and agree, any two of the three being joined by the unique isomorphism commuting with every component (Fubini: an end over a product index category and the two iterated ends exist together and agree).

Proof

technique · direct
1.1

By [L1] each of the two iterated ends exists exactly when the end over the product index category C×D exists, and each is then joined to it by exactly one isomorphism commuting with every component of the induced wedge.

F1F3F4L1
2.1

Hence if either iterated end exists, so does the end over the product index category and therefore the other iterated end; composing the isomorphism attached to one with the inverse of the isomorphism attached to the other gives an isomorphism between the two iterated ends commuting with every component, and it is the only such, since a second one would give a second isomorphism to the product-index end.

L1step 1.1

Remarks

The corollary is a statement about two objects that are each characterised by a universal property, so the isomorphism it produces is canonical in the strong sense: it is determined by the requirement that it commute with the components, and no choice is involved beyond the two chosen families of inner ends already assumed by Fubini: an end over a product index category and the two iterated ends exist together and agree.

Nothing here says that either iterated end exists. What makes the interchange usable in practice is a separate existence statement, such as Ends exist over a small index category in a complete target, and coends in a cocomplete one applied to each inner integrand.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

For a small source category, the set of natural transformations is an end of the hom-bifunctor of the values

Statement

Let C be small and D locally small (Small, locally small, and large categories), and let F,G:CD be functors. Write H:Cop×CSet for the functor H(a,b):=D(Fa,Gb), whose action on a morphism (g,h) of the product category sends u to GhuFg (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The hom-assignment C(,):Cop×CSet is a bifunctor, Sets and functions form the large locally small category Set).

Then Nat(F,G) is a set, and the set of natural transformations is an end of the hom-bifunctor of the values (The end and the coend of a functor Cop×CD): the evaluation family evc(α)=αc is a terminal wedge over H, so

Nat(F,G)=cD(Fc,Gc).

Facts & Assumptions

Given: A small category C, a locally small category D, and functors F,G:CD.

[F6]

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

[F7]

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

[F5]

The functor category [C,D] has functors CD as objects and natural transformations as morphisms (Functor category [C,D]).

[L2]

If C is small and D is locally small, then [C,D] is locally small (If C is small and D is locally small then [C,D] is locally small; if both are small it is small).

[L1]

For every locally small category C, the hom-assignment C(,):Cop×CSet is a functor (The hom-assignment C(,):Cop×CSet is a bifunctor).

[F3]

The hom-assignment sends (a,b) to C(a,b), and a morphism of the product category consisting of h:aa and u:bb acts by C(h,u):C(a,b)C(a,b),fufh (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[F4]

A natural transformation α:FG is a family αA:FAGA such that every f:AB satisfies the naturality equation GfαA=αBFf (Natural transformation and its components).

[F2]

A wedge from d to T is a dinatural transformation from a constant functor to T: a family ωc:dT(c,c) with T(1c,f)ωc=T(f,1c)ωc for every f:cc (Wedges and cowedges, and the categories they form).

[F1]

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).

Proof

technique · direct
1.1

Local smallness of D makes every D(Fa,Gb) a set, so by [L1] and [F3] the assignment H is a functor into Set, being the hom-bifunctor of D composed with F in the contravariant slot and G in the covariant one. Smallness of C together with local smallness of D makes [C,D] locally small by [L2], so Nat(F,G), which is a hom-collection of that category by [F5], is a set. The two hypotheses buy different things and neither is redundant.

F3F5F6F7L1L2given
2.1

A family ϕc:YD(Fc,Gc) satisfies the wedge equation at f:cc exactly when, for every yY, Gfϕc(y)=ϕc(y)Ff: the two sides of the wedge equation are H(1c,f)ϕc and H(f,1c)ϕc, and by [F3] the first sends y to Gfϕc(y) and the second sends y to ϕc(y)Ff. By [F4] that is exactly the condition that for each y the family (ϕc(y))c is a natural transformation FG, and the equivalence holds in both directions.

F2F3F4step 1.1
3.1

The evaluation family evc:Nat(F,G)D(Fc,Gc), ααc, is a wedge, since for α natural the condition of step 2.1 is its naturality equation. Given any wedge ϕ with vertex Y, the function y(ϕc(y))c lands in Nat(F,G) by step 2.1 and satisfies evcu=ϕc for every c; and any u with that property has u(y)c=ϕc(y) for every c, so it is that function. Hence the evaluation wedge is terminal.

F1F2step 2.1
4.1

By [F1] a terminal wedge is an end, so Nat(F,G) with the evaluation family is an end of H, which is the displayed equality.

F1step 3.1

Remarks

The two size hypotheses do different work in this sufficient construction. Local smallness of D makes the integrand Set-valued, and smallness of C guarantees that the collection of natural transformations is a set. Smallness is not necessary for every particular pair of functors: over a large source the natural transformations can still happen to form a set. No such large-source case is asserted by this theorem.

Identity morphisms of C impose nothing: at f=1c the condition of step 2.1 reads ϕc(y)=ϕc(y). If C is discrete the wedge condition is vacuous and the end is the product of the sets D(Fc,Gc), which is also what an unconstrained family is.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The end of the hom-bifunctor is the commutative monoid of natural endomorphisms of the identity functor

Statement

Let C be a small category (Small, locally small, and large categories). Then the end of its hom-bifunctor (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category) is

cC(c,c)=Nat(1C,1C),

the set of natural transformations from the identity functor to itself (For a small source category, the set of natural transformations is an end of the hom-bifunctor of the values, Functor category [C,D]), and this set is a commutative monoid (Semigroup and monoid) under vertical composition of natural transformations (Identity natural transformation and vertical composition), which coincides on it with horizontal composition (Whiskering and horizontal composition of natural transformations).

Facts & Assumptions

Given: A small category C and its identity functor.

[F6]

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).

[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), the terminal wedge being evaluation (For a small source category, the set of natural transformations is an end of the hom-bifunctor of the values).

[F1]

The hom-assignment sends (a,b) to C(a,b), and a morphism of the product category consisting of h:aa and u:bb acts by C(h,u):C(a,b)C(a,b),fufh (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[F2]

The functor category [C,D] has functors CD as objects and natural transformations as morphisms (Functor category [C,D]).

[F3]

The identity natural transformation 1F has components 1FA, and the vertical composite of α:FG and β:GH is given componentwise by (βα)A=βAαA (Identity natural transformation and vertical composition).

[F4]

The horizontal composite of α:FG:CD and β:HL:DE has components (βα)A=βGAH(αA)=L(αA)βFA (Whiskering and horizontal composition of natural transformations).

[F5]

A monoid is a set with an associative operation and a two-sided identity e, so that ex  =  x  =  xefor every xM. It is commutative when the operation is (Semigroup and monoid).

[L2]

Whenever the expressions are defined, (ββ)(αα)=(βα)(βα) (Horizontal and vertical composition of natural transformations satisfy the interchange law).

[L3]

If a set carries two unital binary operations with the same unit satisfying (ab)(cd)=(ac)(bd), then the operations coincide and their common operation is commutative (Eckmann–Hilton: two unital operations satisfying interchange coincide and are commutative).

Proof

technique · direct
1.1

A small category is locally small, so [L1] applies with D=C and F=G=1C: the integrand H(a,b)=C(1Ca,1Cb)=C(a,b) is the hom-bifunctor by [F1], and the theorem gives cC(c,c)=Nat(1C,1C), a hom-collection of the functor category by [F2] and hence a set.

F1F2F6L1
2.1

Write M:=Nat(1C,1C). Vertical composition is defined on M and by [F3] is associative componentwise with two-sided unit 11C. Horizontal composition is also defined on M, since source and target functors are all 1C, and by [F4] it has the same two-sided unit: (α11C)A=αA1A=αA and (11Cα)A=1AαA=αA. So M carries two unital operations with a common unit.

F3F4F5step 1.1
3.1

The published interchange law [L2] is exactly the hypothesis of [L3] for those two operations, read with β=a, β=b, α=c, α=d. Hence the two operations coincide and their common operation is commutative, so M is a commutative monoid; by step 1.1 the end of the hom-bifunctor is that monoid.

F3F4F5L2L3step 2.1

Remarks

The component formula of Whiskering and horizontal composition of natural transformations already gives (βα)A=βAαA when every functor involved is 1C, so the coincidence of the two operations can also be read off directly. What that reading does not give is commutativity, and commutativity is the whole content: it is the conclusion of the Eckmann–Hilton argument and it is not visible in either component formula.

For a one-object category, that is a monoid, the natural endomorphisms of the identity are the elements commuting with every element, so the end of the hom-bifunctor is the centre of that monoid — a commutative monoid, as the corollary requires.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The co-Yoneda isomorphisms: a set-valued functor is a coend against a representable

Statement

Let C be locally small (Small, locally small, and large categories) and let a be an object of C. A set-valued functor is a coend against a representable (The end and the coend of a functor Cop×CD, The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding):

Covariant coend form. For F:CSet, let T(c1,c2):=C(c1,a)×F(c2) (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The Cartesian product A×B:={zP(P(AB)):aA bB z=(a,b)}, Sets and functions form the large locally small category Set), a functor Cop×CSet. Then T has a coend and

cC(c,a)×F(c)    F(a),

the initial cowedge being ρc(g,y)=F(g)(y) for g:ca and yF(c).

Contravariant coend form. For a presheaf P:CopSet (Opposite category Cop), let T(c1,c2):=C(a,c2)×P(c1). Then T has a coend and

cC(a,c)×P(c)    P(a),

the initial cowedge being ρc(g,y)=P(g)(y) for g:ac and yP(c).

End forms. If in addition C is small, the two dual formulas cSet(C(a,c),Fc)F(a) and cSet(C(c,a),Pc)P(a) hold; these are The end of the function-set functor on a representable is evaluation and are not reproved here.

Facts & Assumptions

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

[F6]

A category is locally small when every C(A,B) is a set (Small, locally small, and large categories).

[F5]

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

[F4]

The elements of A×B are exactly the ordered pairs (a,b) with aA and bB: Thus zA×B holds if and only if z=(a,b) for some aA and some bB. (The Cartesian product A×B:={zP(P(AB)):aA bB z=(a,b)}).

[F1]

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

[F7]

A functor satisfies F(1A)=1FA,F(gf)=FgFf; a contravariant functor is a functor on the opposite category, so it reverses composites (Covariant functor, identity functor, composite functor, and contravariant functor).

[F2]

A cowedge from T to d is a dinatural transformation from T to a constant functor: a family ρc:T(c,c)d with ρcT(f,1c)=ρcT(1c,f) for every f:cc (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, so a coend is a cowedge through which every cowedge factors by exactly one morphism (The end and the coend of a functor Cop×CD).

[L1]

For small C, the end of the function-set functor on a representable is evaluation: cSet(C(a,c),Fc)F(a) and cSet(C(c,a),Pc)P(a) (The end of the function-set functor on a representable is evaluation).

Proof

technique · direct
1.1

Both integrands are functors on Cop×C with values in Set, local smallness making each hom-collection a set. In T the slot c1 is contravariant because C(,a) is, and c2 is covariant because F is; explicitly T(f,1c)(g,y)=(gf,y) and T(1c,f)(g,y)=(g,F(f)(y)) for f:cc, gC(c,a) and yF(c). In T the slot c1 is contravariant because P is and c2 is covariant because C(a,) is; explicitly T(f,1c)(g,y)=(g,P(f)(y)) and T(1c,f)(g,y)=(fg,y) for gC(a,c) and yP(c).

F1F4F5F6F7
2.1

The family ρc(g,y)=F(g)(y) is a cowedge from T to F(a): on an element (g,y) of T(c,c)=C(c,a)×F(c) the left side gives ρc(gf,y)=F(gf)(y) and the right side gives ρc(g,F(f)y)=F(g)(F(f)(y)), and these agree by functoriality of F.

F2F4F7step 1.1
2.2

The family ρc(g,y)=P(g)(y) is a cowedge from T to P(a): on an element (g,y) of T(c,c)=C(a,c)×P(c) the left side gives ρc(g,P(f)y)=P(g)(P(f)(y)) and the right side gives ρc(fg,y)=P(fg)(y), and these agree because P reverses composites.

F2F4F7step 1.1
3.1

The cowedge of step 2.1 is initial. Let λc:C(c,a)×F(c)X be any cowedge and put u(z):=λa(1a,z) for zF(a). Applying the cowedge equation of λ at the morphism g:ca to the element (1a,y) of T(a,c)=C(a,a)×F(c) gives λc(1ag,y)=λa(1a,F(g)(y)), that is λc(g,y)=u(F(g)(y))=u(ρc(g,y)), so uρc=λc for every c. Any u with uρc=λc satisfies u(z)=u(ρa(1a,z))=λa(1a,z)=u(z), so u is unique.

F2F3F4step 2.1
3.2

The cowedge of step 2.2 is initial by the same computation in the other variance. Let λc:C(a,c)×P(c)X be a cowedge and put u(z):=λa(1a,z) for zP(a). The cowedge equation of λ at g:ac applied to (1a,y) in T(c,a)=C(a,a)×P(c) gives λa(1a,P(g)(y))=λc(g1a,y), that is λc(g,y)=u(ρc(g,y)); and u(z)=u(ρa(1a,z))=λa(1a,z) forces uniqueness.

F2F3F4step 2.2
4.1

By [F3] an initial cowedge is a coend, so steps 3.1 and 3.2 give the two displayed coend isomorphisms, with the stated initial cowedges. The two end forms are [L1] and are quoted, not reproved; they carry the extra hypothesis that C be small, which the coend forms do not need.

F3L1step 3.1step 3.2

Remarks

Every class in the coend has a representative in the summand at a with first coordinate 1a: the cowedge equation applied to (1a,y) moves (g,y) to (1a,F(g)y), which is why the counit at a suffices to define the inverse morphism in steps 3.1 and 3.2. That is the content of the formula, and it is what makes the coend collapse to a single value.

The coend forms need only local smallness, since they are proved from the universal property of a coend directly and never form a product or a quotient over the objects of C. The end forms need C small, because they pass through the set of natural transformations.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The tensor product of a presheaf and a covariant set-valued functor

Definition

Let C be a category, let P:CopSet be a presheaf (Presheaves, covariantly and contravariantly representable functors, and representations, Opposite category Cop) and let F:CSet be a covariant functor (Sets and functions form the large locally small category Set). The assignment

T(c1,c2):=P(c1)×F(c2)

is a functor Cop×CSet (Product category and its projection functors, The Cartesian product A×B:={zP(P(AB)):aA bB z=(a,b)}): it is contravariant in c1 because P is, covariant in c2 because F is, and the two slots act independently, on the two coordinates of the Cartesian product.

The tensor product of P and F over C is the coend of the product of a presheaf and a covariant set-valued functor (The end and the coend of a functor Cop×CD), when it exists:

PCF:=cP(c)×F(c).

Its cowedge components are written ρc:P(c)×F(c)PCF, and the cowedge equation reads ρc(P(f)(y),x)=ρc(y,F(f)(x)) for f:cc, yP(c) and xF(c).

Remarks

The variance is written into the definition rather than left to the reader. A coend needs its integrand contravariant in the first slot and covariant in the second, so a presheaf and a covariant functor are exactly the pair for which the displayed product is an integrand; two covariant functors do not give one, and the expression cF(c)×G(c) for two covariant F and G is not defined.

The name records the analogy with a tensor product of modules: the cowedge equation moves an element of C across the product exactly as a scalar moves across R, and The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category supplies the actions when P and F are hom-functors. The analogy is made precise for a one-object C on this page's companion, where the two functors are a right and a left action of a monoid.

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

Set-weighted limits and colimits

Definition

Let J be a small category, let M be locally small (Small, locally small, and large categories) and let D:JM be a diagram. Because J is small and Set is locally small, the functor category [J,Set] is locally small (Functor category [C,D], If C is small and D is locally small then [C,D] is locally small; if both are small it is small, Sets and functions form the large locally small category Set), so each collection of natural transformations named below is a set (Natural transformation and its components).

A weight for a limit is a functor W:JSet. A weighted limit {W,D} is an object of M that represents the functor sending an object to the set of natural transformations from the weight (Presheaves, covariantly and contravariantly representable functors, and representations), namely

M(,{W,D})    [J,Set](W,M(,D)):MopSet,

where M(m,D):JSet is the covariant hom-functor M(m,) composed with D (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category). Written out, the isomorphism is a bijection natural in m between morphisms m{W,D} and families of functions αj:W(j)M(m,Dj) satisfying D(u)αj(w)=αk(W(u)(w)) for every u:jk and wW(j).

A weight for a colimit is a presheaf W:JopSet (Opposite category Cop). A weighted colimit WD is an object of M with

M(WD,)    [Jop,Set](W,M(D,)):MSet,

naturally in the second variable, where M(D,m):JopSet sends j to M(Dj,m) and is obtained by composing the contravariant hom-functor M(,m):MopSet with Dop:JopMop.

The natural transformation corresponding to the identity of {W,D} is the counit cylinder of the weighted limit, with components κj:W(j)M({W,D},Dj); dually for a weighted colimit. Neither object need exist.

Remarks

The variances are the ones that read correctly against the presheaf convention in force in this library: a weight for a limit is covariant, matching the covariant hom-functor M(m,D), and a weight for a colimit is contravariant, matching M(D,m). Writing a colimit weight covariantly would ask for a natural transformation between functors of opposite variance, which is not a well-formed condition.

Nothing here mentions cones. A cone over D is recovered by taking the weight that is constantly a one-element set, and that this reproduces the ordinary limit is a theorem rather than a convention: Weighting by the constant singleton gives exactly the ordinary limit.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A weighted limit and a weighted colimit are unique up to a unique compatible isomorphism

Statement

Let J be small, M locally small, D:JM a diagram and W:JSet a weight (Set-weighted limits and colimits).

If L and L are weighted limits {W,D}, with counit cylinders κ and κ, there is exactly one isomorphism i:LL satisfying κj(w)i=κj(w) for every object j of J and every wW(j).

Dually, for a weight W:JopSet, any two weighted colimits WD are joined by exactly one isomorphism commuting with the components of their counit cylinders.

Facts & Assumptions

Given: A small J, a locally small M, a diagram D, a weight W, and two weighted limits, respectively two weighted colimits, of that data.

[F1]

A weighted limit {W,D} is an object that represents the functor sending an object to the set of natural transformations from the weight, the counit cylinder being the natural transformation corresponding to the identity; dually for a weighted colimit (Set-weighted limits and colimits).

[F3]

A presheaf P is contravariantly representable when there is an object R and a natural isomorphism θ:C(,R)P; The pair (R,θ) is a representation of F, and R is a representing object, with the covariant case using C(R,) (Presheaves, covariantly and contravariantly representable functors, and representations).

[F2]

A universal element of a presheaf P is a pair (R,u) with uP(R) such that the maps θcu:C(c,R)P(c),θcu(f)=P(f)(u) are the components of a natural isomorphism; for a covariant F the maps are θcu(f)=F(f)(u) on C(R,c). A universal element is therefore a representation whose isomorphism is named by a distinguished element (Universal elements of covariant functors and presheaves).

[L1]

If a presheaf P has universal elements (R,u) and (R,u), There is a unique isomorphism i:RR satisfying P(i)(u)=u; the covariant clause is the same statement with F(i)(u)=u (Representing objects are unique up to a unique isomorphism compatible with their universal elements).

Proof

technique · direct
1.1

Write Φ(m):=[J,Set](W,M(m,D)), a presheaf on M. By [F1] a weighted limit is exactly a representing object for Φ in the contravariant sense of [F3], so the data "L is a weighted limit" and "L represents Φ" are the same data.

F1F3
2.1

The counit cylinder is the universal element of that representation: under the representing isomorphism θ:M(,L)Φ, the element κ:=θL(1L) lies in Φ(L) and satisfies θm(h)=Φ(h)(κ) for every h:mL, which is the display of [F2]; conversely a universal element determines the representing isomorphism by that same formula. Componentwise Φ(h)(κ)j(w)=κj(w)h, so the equation of the Statement, κj(w)i=κj(w), is exactly Φ(i)(κ)=κ. This identification is the whole content of the theorem.

F1F2F3step 1.1
3.1

By [L1] applied to Φ with the two universal elements κ and κ, there is exactly one isomorphism i:LL with Φ(i)(κ)=κ; by step 2.1 that is exactly one isomorphism with κj(w)i=κj(w) for every j and every w.

L1step 2.1
4.1

For weighted colimits the represented functor m[Jop,Set](W,M(D,m)) is covariant in m, so steps 1.1 to 3.1 run with the covariant halves of [F2], [F3] and [L1] in place of the contravariant ones, and give exactly one isomorphism between two weighted colimits commuting with every component of the counit cylinders.

L1step 3.1

Remarks

A weighted limit is not merely like a representing object; by the definition in force here it is one, and every property of representations transfers without a separate argument. What has to be said explicitly is only which element of the represented set is the universal one, and that is the counit cylinder.

Uniqueness is up to a unique compatible isomorphism. Two weighted limits of the same data are isomorphic in many ways in general; exactly one of those isomorphisms respects the counit cylinders, and it is that one the statement produces.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A weighted limit of a set-valued diagram is the set of natural transformations from the weight

Statement

Let J be a small category and let W,D:JSet be functors (Sets and functions form the large locally small category Set). Then the weighted limit of D by W in Set exists, and a weighted limit of a set-valued diagram is the set of natural transformations from the weight (Set-weighted limits and colimits, Functor category [C,D]):

{W,D}=[J,Set](W,D)=Nat(W,D).

Its counit cylinder is κj(w)(α)=αj(w), and its elements are exactly the natural transformations WD (Natural transformation and its components).

Facts & Assumptions

Given: A small category J and two functors W,D:JSet.

[F2]

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

[F6]

The functor category [C,D] has functors CD as objects and natural transformations as morphisms (Functor category [C,D]).

[L1]

If C is small and D is locally small, then [C,D] is locally small (If C is small and D is locally small then [C,D] is locally small; if both are small it is small).

[F4]

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

[F1]

A weighted limit {W,D} is an object that represents the functor sending an object to the set of natural transformations from the weight, that is M(m,{W,D})[J,Set](W,M(m,D)) naturally in m, the counit cylinder corresponding to the identity (Set-weighted limits and colimits).

[F5]

A natural transformation α:FG is a family αA:FAGA such that every f:AB satisfies the naturality equation GfαA=αBFf (Natural transformation and its components).

[F3]

The singleton {x} is the set whose only element is x: t{x}t=x (The unordered pair {x,y} and the singleton {x}={x,x}).

Proof

technique · direct
1.1

Since J is small and Set is locally small, [L1] and [F6] make N:=[J,Set](W,D) a set, and likewise Φ(X):=[J,Set](W,Set(X,D)) a set for every set X, the functor Set(X,D) being the covariant hom-functor of [F4] composed with D.

F1F2F4F6L1
2.1

For a set X the assignments hα with αj(w)(x)=h(x)j(w), and αh with h(x)j(w)=αj(w)(x), are mutually inverse bijections between Set(X,N) and Φ(X): each is defined by the same formula read in the two directions, and each side of the correspondence satisfies its naturality condition exactly when the other does, since D(u)(h(x)j(w))=h(x)k(W(u)(w)) for all x is the same family of equations as Set(X,D(u))αj=αkW(u).

F4F5step 1.1
3.1

The bijection of step 2.1 is natural in X: for g:XX the family attached to hg has components w(xh(g(x))j(w)), which is the family attached to h postcomposed with Set(g,Dj). So N represents Φ in the sense of [F1] and is a weighted limit {W,D}; its counit cylinder is the family attached to the identity of N, namely κj(w)(α)=αj(w).

F1F5step 2.1
4.1

Taking X to be a one-element set {} reads off the elements: by [F3] a function {}Y is determined by its single value, so Set({},N) is in bijection with N and Φ({}) with [J,Set](W,D), and step 3.1 identifies the two. Hence an element of {W,D} is exactly a natural transformation WD.

F3F4step 3.1

Remarks

Naturality in the test object is what makes this an identification of the represented functors rather than a bijection of two sets that happen to have the same size. Step 4.1 alone, evaluating at a one-element set, would compute the underlying set of a weighted limit already known to exist; it is step 3.1 that produces one.

The proposition is the reason the weighted limit is called a limit "weighted by W": in Set it is literally the set of W-shaped families in D, and every other target is compared to this case through a representable, which is A representable functor carries a weighted limit to the weighted limit of the composed diagram.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The power and the copower of an object by a set

Definition

Let M be a locally small category (Small, locally small, and large categories, Category, object, morphism, domain, codomain, identity, composition, and hom-collection), let c be an object of M and let S be a set. Write 1 for the category with one object and only its identity morphism, and Dc:1M for the diagram picking out c. A natural transformation between two functors 1A is a single morphism in the target category A between their values, since the only naturality equation is at an identity. When A=Set that morphism is a function.

The power of c by S, written cS or Sc, is the weighted limit of the one-object diagram at the constant weight S (Set-weighted limits and colimits): an object with a bijection

M(m,cS)    Set(S,M(m,c))

natural in m, where the right-hand side is the set of functions SM(m,c) (The set BA of all functions AB, Sets and functions form the large locally small category Set, The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

The copower of c by S, written Sc, is the corresponding weighted colimit: an object with a bijection

M(Sc,m)    Set(S,M(c,m))

natural in m. Neither object need exist.

The counit of the power is the family prs:cSc indexed by sS, obtained by applying the bijection to the identity of cS; dually the copower carries injections ins:cSc.

Remarks

Both are instances of the weighted limit and colimit of a diagram on a one-object index category, so nothing new is being defined: what is new is only the name and the notation, and the reason for having them is that the two constructions occur constantly once weights are allowed.

The enriched literature calls these the cotensor and the tensor of an object by an object of the base. Those names belong with the enriched development and are not used here; the Set-enriched names power and copower are the ones in force on this page.

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

A power by a set is the product of that many copies and a copower is the coproduct

Statement

Let M be locally small, let c be an object of M and let S be a set. Write (c)sS for the constant S-indexed family at c (An indexed family (Ai)iI is a function with domain I; {Ai:iI} is its range).

Then the power cS (The power and the copower of an object by a set) exists exactly when the product sSc exists (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations), and they are then the same object with the same counit: a power by a set is the product of that many copies. Dually the copower Sc exists exactly when the coproduct sSc exists, and a copower is the coproduct.

For S= the power is a terminal object and the copower an initial object.

Facts & Assumptions

Given: A locally small category M, an object c and a set S.

[F6]

The covariant hom-assignment M(m,) sends an object to a set of morphisms, and Set is the category of sets and functions (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, Sets and functions form the large locally small category Set).

[F1]

The power cS is the weighted limit of the one-object diagram at the constant weight S, characterised by a bijection M(m,cS)Set(S,M(m,c)) natural in m; the copower is characterised dually by M(Sc,m)Set(S,M(c,m)) (The power and the copower of an object by a set).

[F4]

An indexed family with index set I is a function A with domain I, written (Ai)iI (An indexed family (Ai)iI is a function with domain I; {Ai:iI} is its range).

[F2]

A product of (Ai)iI is an object P with projections pi such that every family fi:XAi has a unique pairing fiiI:XP,pifi=fi(iI); a coproduct is dual (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).

[F3]
[F5]

A limit of a diagram is a terminal cone: explicitly, for every cone (X,ξ) there exists a unique morphism u:XL such that λju=ξj for every j; a product is the limit of a family on a discrete index category (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

Proof

technique · direct
1.1

By [F1] the power is characterised by a bijection, natural in m, between morphisms mcS and functions SM(m,c).

F1F6
2.1

By [F2], [F4] and [F5] the product of the constant family (c)sS is characterised by a bijection, natural in m, between morphisms msSc and S-indexed families of morphisms mc; and an S-indexed family of elements of the set M(m,c) is by [F4] exactly a function SM(m,c). So the two universal properties are properties of the same functor of m.

F2F4F5step 1.1
3.1

Hence an object represents one exactly when it represents the other, so the power exists exactly when the product does and any object with either property has both; the counit of the power, indexed by sS, is the family of projections of the product, since both are obtained by applying the bijection to the identity. The dual argument, with M(c,m) in place of M(m,c) and copairings in place of pairings, identifies the copower with the coproduct of the same constant family.

F1F5step 2.1
4.1

For S= the only function M(m,c) is the empty one, so the bijection of step 1.1 says that M(m,c) is a one-element set for every m, that is, c is terminal; dually c is initial. This agrees with the published convention that The empty product is therefore terminal and the empty coproduct initial.

F3step 3.1

Remarks

This is a seam: the power minted on this page is the product already defined in the library, not a second notion, and the theorem is what says so. Every later use of a power may therefore be read as a product of copies, and the notation is a convenience rather than new mathematics.

The empty case is written out because it is where a plausible-looking alternative convention would go wrong. A power by the empty set is terminal, not initial, and a copower by the empty set is initial: the direction is fixed by which side of the hom-set the exponent sits on, and it is fixed the same way as for the published empty product and coproduct.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A weighted limit is an end of powers and a weighted colimit a coend of copowers

Statement

Let J be small, let M be locally small, let D:JM be a diagram and let W:JSet be a weight (Set-weighted limits and colimits).

Limit clause. Suppose given a functorial choice of powers: a functor T:Jop×JM together with bijections

η:M(m,T(c1,c2))    Set(Wc1,M(m,Dc2))

natural in m, in c1 and in c2, so that each T(c1,c2) is a power (Dc2)Wc1 (The power and the copower of an object by a set, The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category). Then the wedges over T with vertex m correspond bijectively and naturally in m to the natural transformations WM(m,D) (Wedges and cowedges, and the categories they form, Natural transformation and its components). Consequently T has an end exactly when {W,D} exists (The end and the coend of a functor Cop×CD), and then

{W,D}  =  c(Dc)Wc.

Colimit clause. For a weight W:JopSet (Opposite category Cop) and a functorial choice of copowers T(c1,c2)=Wc1Dc2, with bijections M(T(c1,c2),m)Set(Wc1,M(Dc2,m)) natural in all three variables, the cowedges under T with vertex m correspond to the natural transformations WM(D,m), so T has a coend exactly when WD exists, and then WD=cWcDc.

The hypothesis is the functorial choice of the displayed powers. Existence of the displayed end and existence of the weighted limit are equivalent conclusions; neither is assumed. Completeness of M is not assumed.

Facts & Assumptions

Given: A small J, a locally small M, a diagram D, a weight W, and a functorial choice of powers, respectively of copowers, as displayed.

[F1]

A weighted limit {W,D} is an object that represents the functor sending an object to the set of natural transformations from the weight, that is M(m,{W,D})[J,Set](W,M(m,D)) naturally in m; a weighted colimit is characterised dually by M(WD,m)[Jop,Set](W,M(D,m)) (Set-weighted limits and colimits).

[F2]

The power (Dc2)Wc1 is the weighted limit of the one-object diagram at the constant weight S with S=Wc1, characterised by a bijection M(m,(Dc2)Wc1)Set(Wc1,M(m,Dc2)) natural in m; the copower is characterised dually (The power and the copower of an object by a set).

[F4]

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

[F5]

A natural transformation α:FG is a family αA:FAGA such that every f:AB satisfies the naturality equation GfαA=αBFf (Natural transformation and its components).

[F6]

A representation of a functor is an object together with a natural isomorphism from the corresponding hom-functor; The pair (R,θ) is a representation of F, and R is a representing object (Presheaves, covariantly and contravariantly representable functors, and representations).

[F7]

A wedge from d to T is a dinatural transformation from a constant functor to T: a family ωc:dT(c,c) with T(1c,f)ωc=T(f,1c)ωc; a cowedge satisfies ρcT(f,1c)=ρcT(1c,f); a morphism of either 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).

[F8]

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

Proof

technique · direct
1.1

A family ωc:mT(c,c) corresponds, componentwise under η, to a family of functions ω^c:WcM(m,Dc), and the correspondence is a bijection because each η is.

F1F2F4
2.1

The family ω satisfies the wedge equation at f:cc exactly when ω^ satisfies the naturality equation at f. Both sides of the wedge equation are morphisms mT(c,c), and applying η at (c,c) turns them into functions WcM(m,Dc): naturality of η in the covariant slot at f sends T(1c,f)ωc to xD(f)ω^c(x), and naturality of η in the contravariant slot at f sends T(f,1c)ωc to xω^c(W(f)(x)). Their equality for every xWc is the equation M(m,Df)ω^c=ω^cW(f), which by [F5] is naturality of ω^ as a transformation WM(m,D); and since η is a bijection the implication runs in both directions.

F4F5F7step 1.1
3.1

The correspondence of steps 1.1 and 2.1 is natural in m, because η is, so a morphism h:mm carries the wedge ω to the wedge ωh and the transformation ω^ to ω^ postcomposed with M(h,D). Hence a terminal wedge over T is exactly a representing object for m[J,Set](W,M(m,D)) in the sense of [F6], so by [F1] and [F3] the end of T exists exactly when {W,D} does, and the two are the same object.

F1F3F6step 2.1
4.1

For the colimit clause, a family ρc:T(c,c)m corresponds under the copower bijections to functions ρ^c:WcM(Dc,m), and applying the bijection at (c,c) to the two sides of the cowedge equation at f:cc gives yρ^c(W(f)(y)) and yρ^c(y)D(f) for yWc; their equality is the naturality equation of ρ^ as a transformation of presheaves on J, using [F8] to read W and M(D,m) on Jop. The correspondence is natural in m, so an initial cowedge under T is exactly a representing object for m[Jop,Set](W,M(D,m)), and the coend of T exists exactly when WD does.

F1F3F5F6F7F8step 3.1

Remarks

The functorial choice of powers is genuine extra data and is stated as a hypothesis rather than derived. A power is determined only up to isomorphism by its universal property, so a choice of one power for each pair (c1,c2) is not by itself a functor on Jop×J; what makes the displayed end meaningful is that the choice carries a functor structure whose bijections are natural in both index variables.

Nothing in the argument assumes M complete, or the weight or the diagram to be of any particular kind. What it assumes is exactly that the objects written down exist, and the conclusion is an equivalence of existence in both directions, not only a formula valid when everything is available.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-26Open item page →

A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it

Statement

Let J be small, let M be locally small (Small, locally small, and large categories) and let F:JM be a diagram.

Limit clause. Let W:JSet be a weight, let W be its category of elements (The category of elements of a covariant functor or a presheaf) and let π:WJ be the projection (c,x)c. Then a weighted limit is an ordinary limit over the category of elements of the weight (Set-weighted limits and colimits, Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties): the cones over Fπ with apex m are exactly the natural transformations WM(m,F), so {W,F} exists exactly when limWFπ does and then {W,F}=limWFπ.

Colimit clause. Let W:JopSet be a weight (Opposite category Cop), let W be its category of elements, whose morphisms (c,x)(d,y) are the f:cd of J with x=W(f)(y), and let π again be the projection. Then a weighted colimit is an ordinary colimit over it: the cocones under Fπ with apex m are exactly the natural transformations WM(F,m), so WF exists exactly when colimWFπ does and then WF=colimWFπ.

Both clauses use the published category of elements as it stands, with no opposite inserted, and if J is small then W is small.

Facts & Assumptions

Given: A small J, a locally small M, a diagram F:JM, and a weight W of the variance named in each clause.

[F1]

A weighted limit {W,F} is an object that represents the functor sending an object to the set of natural transformations from the weight, that is M(m,{W,F})[J,Set](W,M(m,F)) naturally in m; the weighted colimit is characterised by M(WF,m)[Jop,Set](W,M(F,m)) (Set-weighted limits and colimits).

[F2]

The category of elements G of a functor G:CSet has objects (c,x) with cC and xG(c); its identities and composition are those of C (The category of elements of a covariant functor or a presheaf).

[F3]

For a covariant G, a morphism (c,x)(d,y) of G is a morphism f:cd in C satisfying G(f)(x)=y (The category of elements of a covariant functor or a presheaf).

[F11]

For a presheaf P, a morphism (c,x)(d,y) of P is a morphism f:cd in C satisfying x=P(f)(y). (The category of elements of a covariant functor or a presheaf).

[F4]

A cone over D:JC with apex c is a family λj:cD(j) satisfying D(u)λj=λk for u:jk, and a morphism of cones is h with λjh=λj (Constant diagrams, cones, cocones, and their morphisms).

[F9]

A cocone under D with apex c is a family ρj:D(j)c satisfying ρkD(u)=ρj for u:jk (Constant diagrams, cones, cocones, and their morphisms).

[F5]

A limit is a terminal cone: explicitly, for every cone (X,ξ) there exists a unique morphism u:XL such that λju=ξj for every j (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F10]

A colimit is an initial cocone: explicitly, for every cocone (X,ξ) there exists a unique morphism u:QX such that uρj=ξj for every j. (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F6]

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

[F12]

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

[F7]

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

[F8]

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

[L1]

Two representing objects of one functor are joined by a unique compatible isomorphism: There is a unique isomorphism i:RR satisfying the compatibility equation with the universal elements (Representing objects are unique up to a unique isomorphism compatible with their universal elements).

Proof

technique · direct
1.1

Fix m. A natural transformation α:WM(m,F) assigns to each object c of J a function αc:W(c)M(m,Fc). A cone over Fπ with apex m assigns to each object (c,x) of W a morphism λ(c,x):mF(c), since Fπ(c,x)=F(c). So both are families of morphisms mF(c) indexed by the pairs (c,x) with xW(c).

F1F2F6F7
1.2

If J is small then W is small. Its objects are the pairs (c,x) with c in the set Ob(J) and x in the set W(c), so they form a set; and a morphism of W carries its domain, its codomain and the underlying morphism of J, so the morphisms form a subclass of Ob(W)×Ob(W)×Mor(J) and hence a set. No choice is used.

F2F3F8given
2.1

Setting λ(c,x):=αc(x) matches the two families of step 1.1 bijectively, and it matches the two conditions as well. Naturality of α at f:cd says F(f)αc(x)=αd(W(f)(x)) for every xW(c). A morphism (c,x)(d,y) of W is an f:cd with W(f)(x)=y, and the cone condition at it says F(f)λ(c,x)=λ(d,y). Substituting y=W(f)(x) makes these the same equation, so the two conditions are one equation and not merely equivalent ones.

F2F3F4step 1.1
3.1

The bijection of step 2.1 is natural in m: precomposing every λ(c,x) with h:mm corresponds to postcomposing every αc with M(h,Fc), and it carries a morphism of cones to a morphism of the transformations and back. So a terminal cone over Fπ is exactly a representing object for m[J,Set](W,M(m,F)); by [F1] and [F5] the weighted limit exists exactly when the ordinary limit does and the two are the same object, unique by [L1].

F1F4F5L1step 2.1
3.2

For the colimit clause the same matching is made in the other variance. A cocone under Fπ with apex m assigns λ(c,x):F(c)m to every object of W and satisfies λ(d,y)F(f)=λ(c,x) for every morphism (c,x)(d,y), which by [F11] is an f:cd of J with x=W(f)(y). A natural transformation α:WM(F,m) of presheaves on J assigns αc:W(c)M(Fc,m) and its naturality equation at f reads αc(W(f)(y))=αd(y)F(f) for yW(d). Setting λ(c,x):=αc(x) and substituting x=W(f)(y) makes the two families and the two equations the same.

F7F9F11F12step 2.1
4.1

The bijection of step 3.2 is natural in m by the same computation with postcomposition in place of precomposition, so an initial cocone under Fπ is exactly a representing object for m[Jop,Set](W,M(F,m)): the weighted colimit exists exactly when the ordinary colimit over W does, and then they agree.

F1F10L1step 3.2

Remarks

The published category of elements is used exactly as defined, with no opposite inserted. Its projection to J is covariant in both the covariant and the presheaf case, and the colimit is taken over W itself. A source that forms the category of elements of the weight viewed as a covariant functor on Jop will write "the opposite category of elements" for the same category read backwards; inserting an op here to match that phrase would reverse the variance and make the statement false.

No choice principle is used. What is matched at every step is a whole family against a whole family, and at no point is an element of any W(c) selected. The smallness count of step 1.2 is recorded because the existence corollary for weighted limits spends exactly it.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

A limit weighted by a Set-valued weight on a small index category exists in a complete target, and the weighted colimit in a cocomplete one

Statement

Let J be a small category (Small, locally small, and large categories), let M be locally small and let F:JM be a diagram.

If M is complete (Finite, small, and large limits and colimits; complete and cocomplete categories), then for every weight W:JSet the weighted limit {W,F} exists (Set-weighted limits and colimits). If M is cocomplete, then for every weight W:JopSet the weighted colimit WF exists.

Local smallness of M is part of the hypothesis and cannot be dropped: the definition of a weighted limit is a representation of a Set-valued functor built from the hom-sets of M.

These conditions are sufficient and are not asserted to be necessary of the target: a particular weighted limit in a category that is not complete may exist all the same. The definition on this page fixes a small index category, so no large-index weighted limit is asserted here.

Facts & Assumptions

Given: A small category J, a locally small category M that is complete, respectively cocomplete, a diagram F:JM, and a weight of the variance named in each clause.

[F3]

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

[F4]

The category of elements W has objects the pairs (c,x) with xW(c), and a morphism is a morphism of the index category subject to one equation (The category of elements of a covariant functor or a presheaf).

[F5]

A weighted limit {W,F} is an object that represents the functor sending an object to the set of natural transformations from the weight, and a weighted colimit is characterised dually; the construction presupposes J small and M locally small (Set-weighted limits and colimits).

[L1]

For small J the category of elements W is small, and a weighted limit is an ordinary limit over the category of elements of the weight: {W,F} exists exactly when limWFπ does, and then they agree (A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it).

[L2]

Under the same hypotheses, a weighted colimit an ordinary colimit over it: WF exists exactly when colimWFπ does, and then they agree (A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it).

[F6]

A category is complete when it has all small limits and cocomplete when it has all small colimits, a diagram being small when its indexing category is small; Completeness and cocompleteness do not assert the existence of limits or colimits of large diagrams (Finite, small, and large limits and colimits; complete and cocomplete categories).

Proof

technique · direct
1.1

The category of elements W is small. Its objects are the pairs (c,x) with c in the set Ob(J) and x in the set W(c), hence a set; and a morphism of W is determined by its domain, its codomain and the underlying morphism of J, so the morphisms form a subclass of a product of three sets and hence a set. The count is carried out rather than asserted, and it uses no choice; the presheaf case counts identically.

F3F4L1given
2.1

For the limit clause, Fπ is a diagram indexed by W, which is small by step 1.1, so completeness of M supplies a limit for it. By [L1] the weighted limit {W,F} then exists and is that limit; M is locally small, so the weighted limit is defined at all.

F5F6L1step 1.1
2.2

For the colimit clause, the same diagram over the small category W has a colimit because M is cocomplete, and by [L2] the weighted colimit WF exists and is that colimit.

F5F6L2step 1.1
3.1

Both clauses are sufficiency only. A weighted limit is by [F5] an object representing the displayed functor, so completeness or cocompleteness of M is not necessary for a particular weighted object to exist. Smallness of J remains part of the definition in force here, and no converse is claimed.

F5F6step 2.1step 2.2

Remarks

The smallness of the category of elements, not of the index category alone, is what the argument needs, and it is the values of the weight that supply the extra objects: a weight taking large values on a small index category would not be Set-valued, which is why the hypothesis is stated on the weight and not only on J.

The corresponding statement for ends is Ends exist over a small index category in a complete target, and coends in a cocomplete one, and the two are proved the same way: an existence hypothesis on the target, applied to an ordinary limit over a small index category that a comparison theorem has identified with the object in question.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

A colimit of a set-valued functor is the set of connected components of its category of elements

Statement

Let J be a small category (Small, locally small, and large categories) and let D:JSet be a functor (Sets and functions form the large locally small category Set). Let D be its category of elements (The category of elements of a covariant functor or a presheaf) and let π0(D) be the quotient of its set of objects by the least equivalence relation (Equivalence relation, equivalence class, and the quotient set A/) containing every pair (a,b) for which there is a morphism ab; two objects lie in the same class exactly when they are joined by a finite zigzag of morphisms, which is the connectedness condition of Isomorphism, groupoid, and connected category.

Then

colimjJD(j)  =  π0(D)

(Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties), the colimiting cocone sending xD(j) to the class of the object (j,x).

Facts & Assumptions

Given: A small category J and a functor D:JSet.

[F5]

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

[F6]

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

[F1]

The category of elements G of a functor G:CSet has objects (c,x) with cC and xG(c); and a morphism (c,x)(d,y) given by a morphism f:cd in C satisfying G(f)(x)=y (The category of elements of a covariant functor or a presheaf).

[L1]

Every small diagram D:JSet has a colimit; it is the quotient of the tagged union S={(j,x):xD(j)} by the least equivalence relation containing (j,x)(k,D(u)(x)) for u:jk (Set has all small colimits, realized as a quotient of a set-indexed disjoint union).

[F2]

A binary relation on a set is an equivalence relation when it is reflexive, symmetric and transitive; the quotient set is the set of its classes (Equivalence relation, equivalence class, and the quotient set A/).

[F3]

A category is connected when it is nonempty and any two objects can be joined by a finite zigzag of morphisms, with successive arrows allowed to point in either direction (Isomorphism, groupoid, and connected category).

[F4]

A colimit of D is an initial cocone: explicitly, for every cocone (X,ξ) there exists a unique morphism u:QX such that uρj=ξj for every j. (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

Proof

technique · direct
1.1

By [F1] the objects of D are exactly the pairs (j,x) with xD(j), which is exactly the tagged union named in [L1]; and a morphism (j,x)(k,y) of D exists precisely when some u:jk has D(u)(x)=y, that is, precisely for the pairs that generate the equivalence relation of [L1].

F1F5F6L1
2.1

The least equivalence relation containing the generating pairs of [L1] is therefore the least equivalence relation on the objects of D containing every pair joined by a morphism, and by [F2] its classes are the classes defining π0(D). Two objects lie in one class exactly when a finite chain of generating pairs, each used in either direction, joins them, which is the finite-zigzag condition of [F3].

F2F3step 1.1
3.1

By [L1] the colimit of D is the quotient of the tagged union by that relation, with cocone components sending xD(j) to the class of (j,x); by step 2.1 that quotient is π0(D), and by [F4] the universal property of the colimit is the one asserted. If J is empty, or every D(j) is empty, both sides are the empty set.

F4L1step 2.1

Remarks

Nothing about the category of elements is used beyond its objects and the existence of its morphisms: the identification is between the generating pairs of the published Set-colimit construction and the morphisms of D, and everything else is the same quotient read twice.

The empty case is not an exception. A category with no objects has no connected components, and a diagram of empty sets has the empty set as its colimit, so both sides are empty; connectedness requires nonemptiness, but a set of components does not.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Weighting by the constant singleton gives exactly the ordinary limit

Statement

Let J be small, let M be locally small and let F:JM be a diagram. Write Δ{} for the weight that is constantly a one-element set (The unordered pair {x,y} and the singleton {x}={x,x}).

Then a weighted limit with the constant singleton weight is exactly the ordinary limit (Set-weighted limits and colimits, Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties): the natural transformations Δ{}M(m,F) are exactly the cones over F with apex m (Constant diagrams, cones, cocones, and their morphisms), so {Δ{},F} exists exactly when limF does and then

{Δ{},F}=limjJF(j).

Dually, for the constant singleton weight on Jop, the weighted colimit Δ{}F exists exactly when colimF does and then the two agree.

Facts & Assumptions

Given: A small J, a locally small M, a diagram F:JM, and the constant singleton weight.

[F6]

The singleton {x} is the set whose only element is x: t{x}t=x (The unordered pair {x,y} and the singleton {x}={x,x}).

[F4]

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

[F1]

A weighted limit {W,F} is an object that represents the functor sending an object to the set of natural transformations from the weight, and a weighted colimit is characterised dually (Set-weighted limits and colimits).

[F3]

A cone over D:JC with apex c is a family λj:cD(j) satisfying D(u)λj=λk for u:jk; a cocone satisfies ρkD(u)=ρj, and a morphism of cones is h with λjh=λj (Constant diagrams, cones, cocones, and their morphisms).

[F2]

A limit of D is a terminal cone: explicitly, for every cone (X,ξ) there exists a unique morphism u:XL such that λju=ξj for every j; a colimit is an initial cocone (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F5]

The category of elements G has objects (c,x) with cC and xG(c); a morphism (c,x)(d,y) is a morphism f:cd in C satisfying G(f)(x)=y; and its identities and composition are those of C (The category of elements of a covariant functor or a presheaf).

[L1]

A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it (A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it).

Proof

technique · direct
1.1

A natural transformation α:Δ{}M(m,F) has components αj:{}M(m,Fj), and by [F6] each is determined by the single morphism λj:=αj(), every function out of a one-element set being determined by its value. Naturality at u:jk reads F(u)αj()=αk(Δ{}(u)())=αk(), that is F(u)λj=λk, which is the cone condition of [F3]. The correspondence αλ is a bijection in both directions.

F1F3F4F6
2.1

The bijection of step 1.1 is natural in m, since precomposing every λj with h:mm corresponds to postcomposing every αj with M(h,Fj). So an object represents m[J,Set](Δ{},M(m,F)) exactly when it is a terminal cone over F; by [F1] and [F2] the weighted limit exists exactly when the ordinary limit does, and they are the same object with the same components.

F1F2F3step 1.1
2.2

For the colimit clause, a natural transformation Δ{}M(F,m) of presheaves on J has components determined by morphisms ρj:F(j)m, and its naturality equation at u:jk reads ρkF(u)=ρj, the cocone condition of [F3]; the correspondence is natural in m, so Δ{}F exists exactly when colimF does and the two agree.

F1F2F3step 1.1
3.1

The same conclusion follows from [L1] by a second route: the category of elements of the constant singleton weight has, by [F5], one object (j,) for each object j of J and one morphism for each morphism of J, the defining equation being vacuous because the weight's values are one-element sets; so the projection π is an isomorphism onto J and limWFπ is limF. This is a comparison, not a redefinition: the ordinary limit is the published one and is restated nowhere.

F5L1step 2.1step 2.2

Remarks

The theorem is what makes "weighted" a genuine generalisation rather than a replacement: ordinary limits are the weighted limits at one particular weight, and every statement about weighted limits specialises to a statement already in the library. The specialisation is by a theorem and not by fiat, and the two routes in the proof agree.

The second route also explains the shape of the general comparison. Weighting by W replaces the index category J by W, which has one copy of j for each element of W(j); the constant singleton weight leaves exactly one copy of each, and larger weights make more.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Weighting by a representable evaluates the diagram

Statement

Let J be small, let M be locally small (Small, locally small, and large categories), let F:JM be a diagram and let j0 be an object of J.

Limit clause. For the covariant representable weight W=J(j0,):JSet (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, Presheaves, covariantly and contravariantly representable functors, and representations), the weighted limit exists and is the value of the diagram (Set-weighted limits and colimits):

{J(j0,),F}=F(j0).

Colimit clause. For the contravariant representable weight W=J(,j0):JopSet, the weighted colimit exists and

J(,j0)F=F(j0).

Facts & Assumptions

Given: A small J, a locally small M, a diagram F:JM and an object j0 of J.

[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]

The covariant hom-assignment C(a,) sends u:bc to u:C(a,b)C(a,c),fuf, and 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]

A representation of a functor is an object with a natural isomorphism from the corresponding hom-functor; The pair (R,θ) is a representation of F, and R is a representing object (Presheaves, covariantly and contravariantly representable functors, and representations).

[F1]

A weighted limit {W,F} is an object that represents the functor sending an object to the set of natural transformations from the weight, that is M(m,{W,F})[J,Set](W,M(m,F)) naturally in m; the weighted colimit is characterised by M(WF,m)[Jop,Set](W,M(F,m)) (Set-weighted limits and colimits).

[L1]

For locally small J the evaluation maps Ea,G:Nat(C(a,),G)G(a) are bijections natural in both variables; in particular, for η:GG, Ea,G(ηα)=ηa(Ea,G(α)) (The Yoneda bijection Nat(C(a,),F)F(a) is natural in both a and F).

[L2]

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

[L3]

Two representing objects of one functor are joined by a unique compatible isomorphism (Representing objects are unique up to a unique isomorphism compatible with their universal elements).

Proof

technique · direct
1.1

Fix an object m of M. The functor M(m,F):JSet is the covariant hom-functor of [F4] composed with F, and it takes values in sets because M is locally small. By [L1] applied in J, which is locally small by [F5], evaluation at 1j0 is a bijection from Nat(J(j0,),M(m,F)) to M(m,Fj0).

F1F4F5L1
2.1

That bijection is natural in m. A morphism h:mm induces the natural transformation M(h,F):M(m,F)M(m,F), and the naturality of [L1] in its functor variable gives Ej0(M(h,F)α)=M(h,Fj0)(Ej0(α)), which is precisely compatibility with precomposition by h. Hence F(j0) represents m[J,Set](J(j0,),M(m,F)) in the sense of [F6], so by [F1] it is a weighted limit {J(j0,),F}, unique up to the unique compatible isomorphism by [L3].

F1F6L1L3step 1.1
3.1

For the colimit clause the weight J(,j0) and the diagram M(F,m) are both presheaves on J, so [L2] gives a bijection from Nat(J(,j0),M(F,m)) to M(Fj0,m), evaluation at 1j0 again. Its naturality in the presheaf variable makes it natural in m, now with respect to postcomposition, so F(j0) represents m[Jop,Set](J(,j0),M(F,m)) and by [F1] it is the weighted colimit J(,j0)F. The two clauses use the published Yoneda statement of matching variance, and neither is obtained from the other.

F1F6L2L3step 1.1step 2.1

Remarks

The two clauses give the same object F(j0) from weights of opposite variance, and that is not an accident: a representable weight concentrates all the weighting at one object of the index category, and both the limit and the colimit then have nothing left to take. Which representable does it is fixed by the variance, and swapping the two weights would ask for a natural transformation between functors of opposite variance.

A representable weight and the constant singleton weight are both cases in which the weighted limit can be named without computing anything. For a general weight the object is described instead by A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it, which replaces J by the category of elements of the weight. For the covariant representable weight that category has (j0,1j0) as an initial object, since a morphism out of it to (c,g) is a morphism f:j0c with f=g; for the contravariant one the same pair is terminal. A limit over a category with an initial object, and a colimit over one with a terminal object, is the value there, which is why the weighted object collapses to F(j0).

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

A representable functor carries a weighted limit to the weighted limit of the composed diagram

Statement

Let J be small, let M be locally small (Small, locally small, and large categories), let F:JM be a diagram and let m be an object of M.

Limit clause. Let W:JSet be a weight and suppose {W,F} exists (Set-weighted limits and colimits). Then the weighted limit of the composed diagram M(m,F):JSet by the same weight exists and

M(m,{W,F})    {W,M(m,F)}

(The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The hom-assignment C(,):Cop×CSet is a bifunctor).

Colimit clause. Let W:JopSet be a weight (Opposite category Cop) and suppose WF exists. Then

M(WF,m)    {W,M(F,m)},

a weighted limit in Set of the presheaf M(F,m):JopSet, not a weighted colimit: the contravariant representable turns the weighted colimit into a weighted limit over the opposite index category.

Facts & Assumptions

Given: A small J, a locally small M, a diagram F, an object m, and a weight of the variance named in each clause whose weighted limit or colimit is assumed to exist.

[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).

[F2]

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

[L2]

For every locally small category the hom-assignment C(,):Cop×CSet is a functor, and its restrictions in the two variables are the contravariant and covariant hom-functors (The hom-assignment C(,):Cop×CSet is a bifunctor).

[F6]

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

[F1]

A weighted limit {W,F} is an object that represents the functor sending an object to the set of natural transformations from the weight, that is M(m,{W,F})[J,Set](W,M(m,F)) naturally in m; the weighted colimit is characterised by M(WF,m)[Jop,Set](W,M(F,m)) (Set-weighted limits and colimits).

[F3]

A representation of a functor is an object with a natural isomorphism from the corresponding hom-functor; The pair (R,θ) is a representation of F, and R is a representing object (Presheaves, covariantly and contravariantly representable functors, and representations).

[L3]

Two representing objects of one functor are joined by a unique compatible isomorphism (Representing objects are unique up to a unique isomorphism compatible with their universal elements).

[L1]

For a small J and functors W,D:JSet, a weighted limit of a set-valued diagram is the set of natural transformations from the weight: {W,D}=[J,Set](W,D) (A weighted limit of a set-valued diagram is the set of natural transformations from the weight).

Proof

technique · direct
1.1

By [L2] and [F2] the assignment M(m,F) is a functor JSet, its values being sets because M is locally small, and J is small by hypothesis. So [L1] applies to the pair W and M(m,F) and gives {W,M(m,F)}=[J,Set](W,M(m,F)), in particular the right-hand side of the limit clause exists.

F2F5L1L2
2.1

By [F1] and [F3] the defining property of {W,F} is a bijection M(m,{W,F})[J,Set](W,M(m,F)) natural in m. Composing it with the identification of step 1.1 gives the limit clause: the hom-set of the weighted limit is canonically bijective to the weighted limit of the hom-sets, with the bijection determined by the counit cylinder and unique by [L3].

F1F3L3step 1.1
3.1

For the colimit clause, [F6] makes M(F,m) a presheaf on J, that is a functor on Jop, which is small with J; so [L1] applied with source Jop identifies {W,M(F,m)} with [Jop,Set](W,M(F,m)), and [F1] gives a canonical bijection from that set to M(WF,m). The object produced is a weighted limit in Set over Jop, and calling it a weighted colimit would reverse the variance of the weight.

F1F2F6L1L3step 2.1

Remarks

This is the seam between the general definition and the case that can be computed. A weighted limit in an arbitrary locally small target is defined by a representation, and the theorem says that applying a representable functor turns it into the weighted limit in Set, which A weighted limit of a set-valued diagram is the set of natural transformations from the weight identifies outright. Everything that can be checked about {W,F} by testing against objects of M is therefore a statement about sets of natural transformations.

The colimit clause is not the dual read carelessly. Both clauses produce a weighted limit in Set, because the covariant representable preserves the shape of the universal property while the contravariant one reverses the direction of every morphism it is applied to, and the weight stays where it is.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A coend is a colimit weighted by the hom-bifunctor, and an end a limit weighted by it

Statement

Let C be small (Small, locally small, and large categories), let M be locally small and let T:Cop×CM be a functor. Take the index category to be J:=Cop×C (Product category and its projection functors, Opposite category Cop) and T itself as the diagram.

Coend clause. Let W:JopSet be the weight W(a,b):=C(b,a), that is the hom-bifunctor (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The hom-assignment C(,):Cop×CSet is a bifunctor) composed with the interchange of the two slots, which is what makes it a functor on Jop and not on J. Then the cowedges under T with vertex m are exactly the natural transformations WM(T,m), naturally in m, so T has a coend exactly when WT exists (The end and the coend of a functor Cop×CD, Set-weighted limits and colimits) and then

cT(c,c)=WT.

End clause. Let W:JSet be the hom-bifunctor itself, W(a,b)=C(a,b). Then the wedges over T with vertex m are exactly the natural transformations WM(m,T), naturally in m, so T has an end exactly when {W,T} exists and then cT(c,c)={W,T}.

Facts & Assumptions

Given: A small category C, a locally small category M and a functor T on Cop×C with values in M.

[F7]

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

[F5]

The product category has morphisms (f,g):(C,D)(C,D), componentwise identities, and componentwise composition (f,g)(f,g)=(ff,gg) (Product category and its projection functors).

[F6]

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

[F4]

The hom-assignment sends (a,b) to C(a,b), and a morphism of the product category consisting of h:aa and u:bb acts by C(h,u):C(a,b)C(a,b),fufh (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[L1]

For every locally small category C, the hom-assignment C(,):Cop×CSet is a functor (The hom-assignment C(,):Cop×CSet is a bifunctor).

[F2]

A wedge from d to T is a dinatural transformation from a constant functor to T: a family ωc:dT(c,c) with T(1c,f)ωc=T(f,1c)ωc; a cowedge is a family ρc:T(c,c)d with ρcT(f,1c)=ρcT(1c,f) (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).

[F1]

A weighted limit {W,F} is an object that represents the functor sending an object to the set of natural transformations from the weight, and a weighted colimit WF is characterised by M(WF,m)[Jop,Set](W,M(F,m)) naturally in m (Set-weighted limits and colimits).

[F8]

A representation of a functor is an object together with a natural isomorphism from the corresponding hom-functor; The pair (R,θ) is a representation of F, and R is a representing object (Presheaves, covariantly and contravariantly representable functors, and representations).

Proof

technique · direct
1.1

The index category J is small with C, and Jop is C×Cop by [F6]. The assignment W(a,b)=C(b,a) is the functor of [L1] composed with the interchange of the two slots, which is an isomorphism C×CopCop×C, so W is a functor on Jop; the interchange is what the variance requires, and writing the hom-bifunctor on J instead would give the weight of the end clause, not of the coend clause. A morphism (a,b)(a,b) of Jop is a pair (u,v) with u:aa and v:bb in C, and W sends gC(b,a) to ugv by [F4].

F4F5F6F7L1
2.1

For the coend clause, send a cowedge ρ with vertex m to the family α(a,b)(g):=ρbT(g,1b) for gC(b,a), which equals ρaT(1a,g) by the cowedge equation of [F2] at g:ba. It is natural: for (u,v) as in step 1.1, both α(a,b)(ugv) and α(a,b)(g)T(u,v) reduce, by the factorisations of T supplied by [F5] and the cowedge equation at u:aa, to ρaT(1a,ugv). Conversely a natural α gives ρc:=α(c,c)(1c), whose cowedge equation at f:cc is naturality of α at (f,1c) read against naturality at (1c,f), both of which compute α(c,c)(f). The two assignments are mutually inverse, since α(c,c)(1c)=ρc and naturality recovers α(a,b)(g) from α(b,b)(1b).

F2F4F5step 1.1
2.2

For the end clause, send a wedge ω with vertex m to α(a,b)(g):=T(1a,g)ωa for gC(a,b), which equals T(g,1b)ωb by the wedge equation of [F2] at g:ab. A morphism (a,b)(a,b) of J is a pair (u,v) with u:aa and v:bb, and both α(a,b)(vgu) and T(u,v)α(a,b)(g) reduce, by the same factorisations and the wedge equation at u:aa, to T(1a,vgu)ωa. Conversely a natural α gives ωc:=α(c,c)(1c), and naturality at (1c,f) and at (f,1c) gives the two sides of the wedge equation.

F2F4F5step 1.1
3.1

Both correspondences are natural in m: postcomposing a cowedge with h:mm postcomposes every α(a,b)(g) with h, and precomposing a wedge with h:mm precomposes every α(a,b)(g) with h. So by [F1] and [F8] an initial cowedge under T is exactly a representing object for m[Jop,Set](W,M(T,m)) and a terminal wedge exactly a representing object for m[J,Set](W,M(m,T)); by [F3] the coend of T exists exactly when WT does and the end exactly when {W,T} does, with equality in each case.

F1F3F8step 2.1step 2.2

Remarks

The variance of the weight is fixed before any computation and is the point at which the statement can go wrong. A weight for a colimit over J is a presheaf on J, so it is a functor on C×Cop, and the hom-bifunctor becomes one only after its two slots are interchanged. The weight for the end clause is the hom-bifunctor with no interchange at all.

Together with An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite this closes the loop between the two descriptions of a coend. One presents it as an ordinary colimit over a larger index category; the other presents it as a weighted colimit over the original index category, with the hom-bifunctor carrying the information that the larger index category encoded. The category of elements of the weight is what turns one into the other, by A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it.

RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-08-26Open item page →

Why weights are needed once the base of enrichment is not Set

Statement

Weighting a limit looks at first like an optional generality: by Weighting by the constant singleton gives exactly the ordinary limit the ordinary limit is the weighted limit at one particular weight, so on this page nothing is lost by working with cones alone. This remark records what that proof spends, and hence why the generality is not optional once the hom-objects of a category are no longer sets.

What the constant-singleton proof uses

Two features of Set, and only those two.

First, that a cone is a natural transformation out of a constant weight: the weight Δ{} exists because Set has a one-element set and because the assignment sending every object of the index category to it and every morphism to the identity is a functor. Second, that a function out of a one-element set is the same thing as an element of the codomain, which is what turns the components αj:{}M(m,Fj) into the legs λj:mFj of a cone.

Neither feature is about limits. Both are statements about the category in which the weight takes its values, which on this page is Set throughout, by Set-weighted limits and colimits.

Where they fail for a general base

Replace the values of the weight by the objects of some other category V, so that a hom-object M(m,Fj) is an object of V rather than a set. Then the second feature is no longer available in general: there need not be a canonical Set-like identification between elements and morphisms from the monoidal unit. In bases such as Ab, maps from Z do recover elements, but that is additional structure of the chosen base rather than a formal property of enrichment. The legs of a cone must therefore be formulated through morphisms of V into the hom-objects. The first feature is not automatic either, since a constant assignment into V has to be shown to be a V-functor before it can serve as a weight, and that is a condition on V, not a triviality.

What survives untouched is the definition used on this page: a weighted limit is a representing object for the functor sending m to the transformations out of the weight, and that definition asks nothing of the values of the weight beyond being able to form those transformations. This is the reason the weighted notion, and not the conical one, is the definition that is generalised; Kelly's §3.9 works out the resulting comparison map for a general base and shows what it fails to be.

The development that carries this out is planned for the page enriched-categories and is not available at this point in the reading order, so nothing about enriched limits is asserted here. What is asserted is only what the proofs on this page actually spend, which A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it makes explicit: the index category is replaced by the category of elements of the weight, and elements are exactly what a general base does not supply.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Orientation and notation conventions in force on this page

Statement

Three conventions are in force throughout this page, each of which is reversed by some part of the literature.

Integral signs. The subscripted integral denotes the end and the superscripted integral the coend (The end and the coend of a functor Cop×CD): cT(c,c) is the terminal wedge and cT(c,c) the initial cowedge. The variable is bound in both.

The twisted arrow category. Tw(C) has the morphisms of C as objects and a morphism fg is a pair (a,b) with bfa=g, so its projection lands in Cop×C (The twisted arrow category and its projection to Cop×C, Opposite category Cop).

Which category computes a coend. Under those two conventions an end is a limit over Tw(C) and a coend is a colimit over Tw(C)op of the integrand read with the domain and codomain of each arrow interchanged (An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite).

Why each is worth stating

Every one of the three is a choice, and the alternative choice is in print.

The reversal of the integral signs is not hypothetical: Yoneda's 1960 paper calls integration what is now the coend and writes it with a subscript, and the opposite convention to the one above is used by some modern authors as well. Anyone converting a formula from another source must check which convention that source fixed before comparing it with a formula on this page; the mathematics is unaffected and only the symbols move.

The orientation of the twisted arrow category is reversed by some sources, so that what is written Tw(C) there is Tw(C)op here. Under the reversed orientation the projection lands in C×Cop and every statement on this page naming Tw(C) has to be read with the opposite category substituted.

The third convention is a consequence of the first two rather than an independent choice, and it is the one that is easiest to get wrong, because the index category for the coend is the opposite of the index category for the end and the integrand is reindexed. Taking only one of the two changes gives a different object, and a false statement recording exactly that failure is carried on this page.

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

FALSE: dinatural transformations compose

Statement

False claim: for functors P,Q,R:Cop×CD and dinatural transformations α:PQ and β:QR (Dinatural transformation between functors on Cop×C), the componentwise composite (βcαc)c is a dinatural transformation PR; so the functors on Cop×C and the dinatural transformations between them form a category.

Facts & Assumptions

Given: The walking arrow C, with objects 0 and 1 and one non-identity morphism u:01, and the category Set as target.

[F1]

A dinatural transformation α:PQ is a family αc:P(c,c)Q(c,c) such that every f:cc satisfies Q(1c,f)αcP(f,1c)=Q(f,1c)αcP(1c,f), the equation displayed by the hexagon (Dinatural transformation between functors on Cop×C).

[L1]

There are a category, three set-valued functors on Cop×C and two dinatural transformations between them whose componentwise composite is not dinatural: dinatural transformations do not compose in general (Dinatural transformations do not compose in general).

[L2]

For natural σ:PP and τ:QQ and dinatural α:PQ, composing a dinatural transformation with a natural transformation on either side gives a dinatural transformation (Composing a dinatural transformation with a natural transformation on either side gives a dinatural transformation).

Refutation

technique · direct
1.1

The witness is restated in full so that this item stands alone. Take C to be the walking arrow, so that a functor T:Cop×CSet is four sets and four functions subject to one equation. Let P have all four values a one-element set; let Q have Q(1,0)= and Q(0,0),Q(1,1),Q(0,1) one-element sets; and let R have R(1,0)=, R(0,0)={c}, R(1,1)={d} and R(0,1)={y1,y2} with y1y2, with R(10,u)(c)=y1 and R(u,11)(d)=y2. Let α:PQ and β:QR be the families whose components are the only functions available between one-element sets.

F1givenconstruct
2.1

Both families are dinatural and their composite is not. The hexagon for α at u is an equation between two functions into the one-element set Q(0,1), so it holds; the hexagon for β at u is an equation between two functions out of Q(1,0)=, so it holds; and the two legs of the hexagon for the composite send the element of P(1,0) to y1 and to y2 respectively, which differ. This is exactly the witness of [L1], so the displayed claim is false and the dinatural transformations are not the morphisms of a category under componentwise composition.

F1L1step 1.1
3.1

What is true is the weaker statement [L2]: a dinatural transformation composed with a natural transformation on either side is again dinatural. So dinaturality is not closed under nothing; it is closed under composition with natural transformations, and the false claim is exactly the extension of that to two dinatural factors.

L2step 2.1

Remarks

The mechanism is the empty slot. Putting in the (1,0) position of Q and of R makes the hexagon for β an equation between functions with empty domain, so β is dinatural for no reason of its own; the one-element set in the (0,1) position of Q does the same for α at the other end. Nothing then constrains the composite, whose hexagon has a two-element codomain.

The claim is a genuine trap rather than a careless one, because the analogous statement for natural transformations is true and is what makes functor categories exist. What fails here is that a dinatural transformation has components only on the diagonal, so composing two of them loses the off-diagonal information that each one's hexagon was about.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-26 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: every functor on Cop×C has an end

Statement

False claim: every functor T:Cop×CD has an end (The end and the coend of a functor Cop×CD).

Facts & Assumptions

Given: The discrete category C on the set N of natural numbers, the full subcategory D of Set whose objects are the finite sets, and the functor T with T(c,c)={0,1} for every pair of objects.

[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).

[F3]

A subcategory has a subclass of the objects and, for each pair, a subclass of the morphisms; The subcategory is full when A(A,B)=C(A,B) for every pair of its objects (Subcategory and full subcategory).

[F6]

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

[F8]

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 (Wedges and cowedges, and the categories they form).

[F1]

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, so an end is a wedge through which every wedge factors by exactly one morphism (The end and the coend of a functor Cop×CD).

[L1]

For small C and a target where the displayed objects exist, an end is the equalizer of two products, the first indexed by the objects of C and the second by its morphisms (An end is the equalizer of two products, and a coend the coequalizer of two coproducts).

[F2]

A product of (Ai)iI is an object P with projections pi such that every family fi:XAi has a unique pairing fiiI:XP,pifi=fi(iI) (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).

[F5]

A set A is finite when An for some nN, and then A is that unique n (The cardinality A of a finite set).

[L2]

For every nN there is no injection σ(n)n (The pigeonhole principle on N).

[F7]

A category is complete when it has all small limits; Completeness and cocompleteness do not assert the existence of limits or colimits of large diagrams (Finite, small, and large limits and colimits; complete and cocomplete categories).

Refutation

technique · direct
1.1

Let C be discrete on N, so its only morphisms are identities and it is small by [F6]; let D be the full subcategory of Set on the finite sets, which is a category by [F3] and [F4]; and let T send every pair of objects to the two-element set {0,1} and every morphism to an identity, which is a functor because every morphism of Cop×C is an identity. The index category is deliberately small, so that smallness of the index is not what is at issue.

F3F4F6givenconstruct
2.1

A wedge over T with vertex X is an unconstrained family: by [F8] the wedge equation is imposed only at morphisms of C, and all of those are identities, at which it reads ωc=ωc. So a wedge with vertex X is exactly a family of functions X{0,1} indexed by N, and by [L1] and [F2] an end of T is exactly a product of the diagonal values in D.

F2F8L1step 1.1
3.1

No object of D has that property. Suppose E were an end, with E=n by [F5]. Take the vertex to be a one-element set, which is an object of D; the wedges with that vertex are the families (ϵc)cN with ϵc{0,1}, and the σ(n) families that are 1 at exactly one of the numbers 0,,n and 0 elsewhere are pairwise distinct. By [F1] each factors through E by exactly one morphism from a one-element set, that is by exactly one element of E, and distinct wedges give distinct elements; this is an injection σ(n)E, hence an injection σ(n)n, which [L2] forbids. So T has no end and the claim is false.

F1F2F5L2step 2.1
4.1

A large index category is a second and independent way for an end to fail, since the equalizer description of [L1] would then ask for a product over a proper class, and [F7] records that completeness asserts nothing about diagrams that are not small. The refutation above does not use that route: its index category is small, and what fails is the target.

F7step 3.1

Remarks

The witness turns on the target, not on the index. Taking D to be all of Set would make the end exist, since the required product is then available; taking the diagonal values to be one-element sets would also make it exist, since the product of one-element sets is a one-element set. It is the combination of infinitely many two-element values with a target closed under nothing infinite that removes the end.

The correct sufficient condition is on this page: Ends exist over a small index category in a complete target, and coends in a cocomplete one asks for a small index category and a complete target, and the witness above has the first without the second.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: under this page's convention a coend is the colimit of the same twisted-arrow diagram whose limit is the end

Statement

False claim: with Tw(C) and the projection π as fixed on this page (The twisted arrow category and its projection to Cop×C), the coend of a functor T:Cop×CD is the colimit over Tw(C) of the very diagram Tπ whose limit is the end (The end and the coend of a functor Cop×CD, Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

Facts & Assumptions

Given: The walking arrow C, with objects 0 and 1 and one non-identity morphism u:01, and its hom-bifunctor as the integrand.

[F6]

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

[F4]

The hom-assignment sends (a,b) to C(a,b), and a morphism of the product category consisting of h:aa and u:bb acts by C(h,u):C(a,b)C(a,b),fufh (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[L3]

For every locally small category C, the hom-assignment C(,):Cop×CSet is a functor (The hom-assignment C(,):Cop×CSet is a bifunctor).

[F1]

The objects of Tw(C) are the morphisms of C, a morphism fg is a pair (a,b) with bfa=g, and π sends f:cc to (c,c) (The twisted arrow category and its projection to Cop×C).

[F5]

A colimit is an initial cocone: for every cocone (X,ξ) there exists a unique morphism u:QX such that uρj=ξj for every j; a limit is a terminal cone, and Explicitly, for every cone (X,ξ) there exists a unique morphism u:XL such that λju=ξj for every j. (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F2]

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).

[F3]

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

[L1]

The wedges over T are the cones over Tπ, so an end is the limit over the twisted arrow category; the coend is the colimit over Tw(C)op of the integrand read with the domain and codomain of each arrow interchanged (An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite).

[L2]

For small C and a set-valued integrand, the coend is the disjoint union of the diagonal values modulo the dinaturality relation, generated by the pairs (c,T(f,1c)(x)) and (c,T(1c,f)(x)) for f:cc and xT(c,c) (A set-valued coend is the disjoint union of the diagonal values modulo the dinaturality relation).

Refutation

technique · direct
1.1

Take C to be the walking arrow and T=C(,), a functor into Set by [L3]. Its values are C(0,0)={10}, C(1,1)={11}, C(0,1)={u} and C(1,0)=. By [F1] the objects of Tw(C) are 10, 11 and u; a morphism 10u is the pair (10,u) and a morphism 11u is the pair (u,11), while a morphism out of u would need a component in C(1,0) and there is none. So Tw(C) is a cospan, and Tπ takes the value {10} at 10, {11} at 11 and {u} at u.

F1F4F6L3givenconstruct
2.1

The colimit of Tπ over Tw(C) has one element. A cocone under a cospan is determined by its component at the codomain of the two arrows, the other two components being that one precomposed with the transition maps; so a cocone with apex X is exactly a function {u}X, and by [F5] the initial such is {u} itself.

F5step 1.1
2.2

The coend has two elements. By [L2] it is the quotient of {10}{11} by the relation generated by the pairs indexed by a morphism f:cc and an element x of T(c,c); the only non-identity morphism is u:01, and T(1,0)=C(1,0) is empty, so it contributes no generating pair, while identity morphisms contribute only reflexive pairs. The relation is therefore equality and the coend is the two-element set.

F2F4L2step 1.1
3.1

One element is not two, so the coend is not the colimit of Tπ over Tw(C) and the claim is false. The correct description is [L1]: the coend is the colimit over Tw(C)op, by [F3] the same objects with every arrow reversed, of the functor sending f:cc to T(c,c) — domain and codomain interchanged. On this witness that diagram takes the values {10}, {11} and , its index category is a span, and its colimit is the two-element set, as it must be.

F2F3L1step 2.1step 2.2

Remarks

Two changes separate the correct description from the false one, and taking only one of them is what the false claim does. The index category must be reversed and the integrand must be reindexed; on this witness the reindexing is what moves the empty set from the (1,0) position, where it contributed nothing, to the apex of the diagram, where it stops the two other values from being identified.

The witness is as small as it can be. Any category in which every hom-set is nonempty in both directions would hide the failure, because the two diagrams would then have the same shape of transition maps; the walking arrow is chosen precisely because C(1,0) is empty.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-26Open item page →

FALSE: every functor preserves the ends that exist in its domain

Statement

False claim: if T:Cop×CD has an end and G:DE is any functor, then G carries that end to an end of GT (The end and the coend of a functor Cop×CD, Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).

Facts & Assumptions

Given: Two witnesses built from finite posets, regarded as categories, with monotone maps as functors.

[F5]

A preorder is a reflexive transitive relation, a map between preorders is monotone when it respects the order, and every partial order is a preorder (Preorder and monotone map).

[L2]

A preorder determines a category with at most one morphism between any two objects, and functors between such categories are exactly monotone maps (A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps).

[F2]

A product of (Ai)iI is an object P with projections pi such that every family fi:XAi has a unique pairing fiiI:XP,pifi=fi(iI) (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).

[F6]

A limit of a diagram is a terminal cone: explicitly, for every cone (X,ξ) there exists a unique morphism u:XL such that λju=ξj for every j; a product is the limit of a family on a discrete index category (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F3]

A subcategory is full when A(A,B)=C(A,B) for every pair of its objects, so a full subcategory is determined entirely by its objects (Subcategory and full subcategory).

[F4]

G preserves J-limits if the image under G of every limiting cone over D:JC is limiting over GD (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).

[F1]

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 F:CD and F(c1,c2):=F(c2), the end of a functor made mute in its contravariant variable is the ordinary limit of that functor: cF(c,c)=limF (The end of a functor made mute in its contravariant variable is the ordinary limit of that functor).

[L3]

If G preserves Tw(C)-limits and T has an end, then G of that end is an end of GT, so a functor preserving twisted-arrow limits preserves ends (A functor preserving twisted-arrow limits preserves ends, and dually for coends).

Refutation

technique · direct
1.1

Regard a poset as a category by [L2] and [F5], so that a morphism ab exists exactly when ab and monotone maps are exactly the functors. Let C be the discrete category on two objects and let F:CP pick out two elements x and y of a poset P. By [F2] and [F6] a product of x and y in P is an element below both through which every element below both factors, that is a greatest lower bound; and by [L1] that product is the end of the mute functor F on Cop×C, since F has the same limit.

F1F2F5F6L1L2construct
2.1

First witness. Let P be the four-element poset {,x,y,} with <x<, <y< and x,y incomparable, and let Q be the two-element chain {0<1}. The map ϕ with ϕ()=0 and ϕ(x)=ϕ(y)=ϕ()=1 is monotone, hence a functor by [L2]. The greatest lower bound of x and y in P is , so by step 1.1 the end exists and is ; but the greatest lower bound of ϕ(x)=1 and ϕ(y)=1 in Q is 1, while ϕ()=0. So ϕ carries the end to an element that is not the end of the composite, and by [F4] it does not preserve it.

F4L2step 1.1
2.2

Second witness, with a full and faithful functor. Let P be the four-element poset {,m,x,y} with <m, m<x, m<y and x,y incomparable, so that the greatest lower bound of x and y in P is m. Let Q be the full subposet on {,x,y}, which by [F3] is a full subcategory, and in which the greatest lower bound of x and y is . The inclusion QP is monotone, hence a functor, and it carries the end computed in Q to , which is not the end m computed in P.

F3F4L2step 1.1
3.1

Each witness refutes the displayed claim, and neither uses anything infinite: both posets have four elements and every check is a comparison of two named elements. What is true is [L3]: a functor that preserves Tw(C)-limits preserves the ends indexed by C, and a right adjoint has that property for every C. Neither witness is a right adjoint.

F1L3step 2.1step 2.2

Remarks

The two witnesses fail in opposite directions and that is deliberate. In the first the image of the end is strictly below the end of the image; in the second it is strictly below as well, but the functor is a full and faithful inclusion, so fullness and faithfulness are not what is missing. What is missing in both cases is a hypothesis about limits, and only that.

A poset is the cheapest place to see the failure because a limit there is an order-theoretic infimum and a functor is a monotone map, so the whole question becomes whether a monotone map carries greatest lower bounds to greatest lower bounds. It plainly need not.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

FALSE: every weighted limit is the ordinary limit of the diagram it weights

Statement

False claim: for every weight W and every diagram F, the weighted limit {W,F} is the ordinary limit of F (Set-weighted limits and colimits, Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

Facts & Assumptions

Given: The walking arrow J, with objects 0 and 1 and one non-identity morphism u:01; the diagram F:JSet with F(0) a two-element set and F(1) a one-element set; and the weight W:JSet with W(0) a two-element set and W(1) a one-element set.

[F5]

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

[F6]

A natural transformation α:FG is a family αA:FAGA such that every f:AB satisfies the naturality equation GfαA=αBFf (Natural transformation and its components).

[F1]

A weighted limit {W,F} is an object that represents the functor sending an object to the set of natural transformations from the weight (Set-weighted limits and colimits).

[F2]

A limit of D is a terminal cone: explicitly, for every cone (X,ξ) there exists a unique morphism u:XL such that λju=ξj for every j (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F3]

For a cospan XfZgY, a pullback is its limit, consisting of X×ZY with two projections whose composites with f and g agree and through which every compatible pair factors uniquely (Pullbacks and pushouts as limits and colimits of cospans and spans).

[F4]

A set A is finite when An for some nN, and then A is that unique n; equal cardinalities mean equinumerosity (The cardinality A of a finite set).

[L2]

For a small J and set-valued W and D, a weighted limit of a set-valued diagram is the set of natural transformations from the weight: {W,D}=[J,Set](W,D) (A weighted limit of a set-valued diagram is the set of natural transformations from the weight).

[L1]

A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it (A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it).

[L3]

A weighted limit with the constant singleton weight is exactly the ordinary limit: {Δ{},F}=limF (Weighting by the constant singleton gives exactly the ordinary limit).

Refutation

technique · direct
1.1

Fix the witness. Let J be the walking arrow, let F(0)={a,b} and F(1)={} with F(u) the only function between them, and let W(0)={p,q} and W(1)={} with W(u) the only function between them. Both are functors, since the only equations to check involve identities.

F5F6givenconstruct
2.1

The ordinary limit of F has two elements. A cone over F with apex X is a pair of functions λ0:XF(0) and λ1:XF(1) with F(u)λ0=λ1, so λ1 is determined by λ0 and a cone is exactly a function XF(0); by [F2] the limit is F(0), a set with two elements.

F2F4step 1.1
2.2

The weighted limit has four elements. By [L2] it is the set of natural transformations WF; such a transformation is a pair of functions α0:{p,q}{a,b} and α1:{}{}, and its naturality equation at u is an equation between two functions into the one-element set F(1), hence automatic. So there are exactly as many as there are functions {p,q}{a,b}, namely four.

F1F4F6L2step 1.1
3.1

Four is not two, so {W,F} is not the ordinary limit of F and the claim is false. The same count follows from [L1] and [F3]: the category of elements of W has the objects (0,p), (0,q) and (1,) and one morphism from each of the first two to the third, so it is a cospan, and the limit of the composed diagram is the pullback of F(u) along itself, which for a map from a two-element set to a one-element set has four elements.

F3L1step 2.1step 2.2
4.1

What is true is [L3]: the ordinary limit is the weighted limit at the constant singleton weight, and the witness above differs from that case exactly by having a two-element value at the object 0. By [L1] a larger value of the weight at an object puts more copies of that object into the category of elements, which is what changes the limit.

L1L3step 3.1

Remarks

The weight is doing something visible here: it duplicates the object 0 of the index category, so the limit is taken over a diagram with two copies of F(0) mapping into F(1) rather than one. That is why the answer is a pullback rather than the domain of the map.

Nothing about the witness needs the sets to be small or the target to be Set in any essential way; it is stated with three finite sets so that both sides can be counted by hand and the counts compared.

False statementConstruction: AI-adaptedVerification: Literature-sourcedprecheck passaudited 2026-08-26Open item page →

FALSE: the integral notation of Yoneda's original paper means the same as the modern one

Statement

False claim: the integral signs used in Yoneda's 1960 paper carry the same meaning as the modern ones, so a formula copied from that paper may be read directly with the conventions in force on this page (The end and the coend of a functor Cop×CD, Orientation and notation conventions in force on this page).

Facts & Assumptions

Given: The notation fixed on this page, and the historical record of Yoneda's 1960 paper as reported by the sources listed in this item's references.

[F1]

The vertex of an end is written cT(c,c) and the vertex of a coend cT(c,c), so the subscripted integral denotes the end and the superscripted one the coend (The end and the coend of a functor Cop×CD).

[L1]

The conventions in force on this page fix, among others, that the subscripted integral denotes the end and the superscripted integral the coend (Orientation and notation conventions in force on this page).

[A1]

Reported by Loregian, Remark 1.1.14, and by Richter, Remark 4.6.2: Yoneda's 1960 paper calls integration the operation now called the coend and writes it with the subscripted integral sign, and calls cointegration the operation now called the end, writing it with a starred superscript. Loregian, Remark 1.1.16, records further that the opposite of the modern convention adopted here is also in current use.

Refutation

technique · direct
1.1

On this page the subscripted integral names the terminal wedge and the superscripted integral the initial cowedge, by [F1] and [L1]. These are the two conventions the claim proposes to read a historical formula against.

F1L1given
2.1

By [A1] the historical notation attaches the subscripted sign to what is here the superscripted one. So the same symbol names the end on this page and the coend in that paper, and the two readings of one formula differ whenever the end and the coend of the integrand differ.

A1step 1.1
3.1

They do differ in general: the page's own witness on the walking arrow with the hom-bifunctor as integrand has a one-element end and a two-element coend. Hence the claim is false, and a formula transcribed from the 1960 paper must have its integral signs exchanged before it is read with the conventions of [L1]. The mathematics is unaffected by the transcription; only the symbols move.

A1L1step 2.1

Remarks

The refutation is documentary, and deliberately so. It makes no claim about what the historical paper proves, only about which symbol it attaches to which construction, and that is reported by the two references listed above rather than asserted here.

A reader converting between conventions needs one rule and no mathematics: exchange subscript and superscript, and check the source's own statement of its convention rather than assuming the modern one. That the opposite convention is also in current use, and not only historical, is what makes the check worth performing every time.

Sources