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.
Ends Coends and Weighted Limits
1 · Prerequisites
- Adjunctions Units and Counits
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Homomorphisms and the Isomorphism Theorems
- Limits and Colimits
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Universal Properties, Representables and the Yoneda Lemma
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 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
Dinatural transformation between functors on
Definition
Let and be categories (Category, object, morphism, domain, codomain, identity, composition, and hom-collection) and let
be functors on the product of with (Opposite category , Product category and its projection functors, Covariant functor, identity functor, composite functor, and contravariant functor). A morphism of is a pair in which is a morphism of and is a morphism of from to , that is, a morphism of . Thus a morphism of supplies the four morphisms
A dinatural transformation is a family of morphisms
of such that every morphism of satisfies the dinaturality equation
between morphisms . The morphism is the component of at .
The two sides pass through the six objects , , , , and , so the diagram expressing the dinaturality equation is a six-sided cycle and is called the hexagon:
Remarks
A dinatural transformation is a family indexed by the objects of and constrained by the morphisms of , exactly as a natural transformation is (Natural transformation and its components); what differs is which constraint. A natural transformation between two functors on is a family indexed by the pairs , 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 that connect two diagonal entries through the two off-diagonal entries displayed above.
At all four displayed morphisms of the product category are identities, so the hexagon reads . The identity morphisms of therefore impose no condition, and a dinatural transformation carries no analogue of the identity clause of a functor.
Composing a dinatural transformation with a natural transformation on either side gives a dinatural transformation
Statement
Let be functors (Product category and its projection functors, Opposite category ), let and be natural transformations (Natural transformation and its components), and let be dinatural (Dinatural transformation between functors on ). Then composing a dinatural transformation with a natural transformation on either side gives a dinatural transformation: the families
are dinatural transformations and respectively.
Facts & Assumptions
Given: Functors on , natural transformations and , and a dinatural transformation .
A dinatural transformation is a family such that every satisfies , the equation displayed by the hexagon (Dinatural transformation between functors on ).
A natural transformation is a family such that every satisfies the naturality equation (Natural transformation and its components).
The product category has objects , morphisms , componentwise identities, and componentwise composition (Product category and its projection functors).
The opposite category has the same objects and (Opposite category ).
Proof
A morphism of supplies exactly four morphisms of between the objects that occur in a hexagon at , namely , , and ; the first coordinate of each is the morphism of corresponding to or an identity.
For the pre-composition case, naturality of at the first two morphisms of step 1.1 gives and , so both legs of the hexagon for at equal the corresponding leg of the hexagon for precomposed with ; those two legs agree by [F1], hence so do the legs for , and is dinatural.
For the post-composition case, naturality of at the last two morphisms of step 1.1 gives and , so both legs of the hexagon for at equal the corresponding leg of the hexagon for postcomposed with ; those two legs agree by [F1], hence so do the legs for , and is dinatural.
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.
Dinatural transformations do not compose in general
Statement
There are a category , functors (Product category and its projection functors, Opposite category , Sets and functions form the large locally small category ) and dinatural transformations and (Dinatural transformation between functors on ) for which the componentwise composite is not a dinatural transformation .
Hence the dinatural transformations between functors on are not the morphisms of a category with componentwise composition.
Facts & Assumptions
Given: The walking arrow , with objects and and one non-identity morphism .
A dinatural transformation is a family such that every satisfies , the equation displayed by the hexagon (Dinatural transformation between functors on ).
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
Composition in a category is associative and unital: (Category, object, morphism, domain, codomain, identity, composition, and hom-collection).
The product category has morphisms , componentwise identities, and componentwise composition (Product category and its projection functors).
Proof
Take to be the walking arrow. Its product with the opposite has objects , and a functor is exactly four sets together with four functions , , and subject to the single equation . Define by taking all four sets to be a one-element set; define by and one-element sets; define by , , , with , and .
Each of satisfies the displayed functor equation, so each is a functor: for both composites are functions between one-element sets; for and for both composites are functions with domain the empty set , and any two functions with empty domain and the same codomain are equal.
The unique family with and is dinatural: the only non-identity morphism of is , and the hexagon at is an equation between two functions whose codomain has one element.
Every family with and is dinatural: the hexagon at is an equation between two functions whose domain is .
The componentwise composite , with and , fails the hexagon at : the left leg sends the element of the one-element set to , the right leg sends it to , and . So and are dinatural and their composite is not, which is the asserted witness.
Remarks
The two empty slots are the whole mechanism. Putting in the position of and of makes the functor equation of step 1.1 vacuous there and makes every family dinatural, so the second half of the composite is unconstrained; the one-element set in the position of makes the first half unconstrained in the other direction. The composite then has to satisfy a hexagon whose codomain 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.
Wedges and cowedges, and the categories they form
Definition
Let be a functor (Product category and its projection functors, Opposite category ) and let be an object of (Category, object, morphism, domain, codomain, identity, composition, and hom-collection). Write for the constant functor on at (Constant diagrams, cones, cocones, and their morphisms), which sends every object to and every morphism to .
A wedge from to is a dinatural transformation from a constant functor to (Dinatural transformation between functors on ), that is, a family
such that every satisfies the wedge equation
between morphisms . Dually, a cowedge from to is a dinatural transformation from to a constant functor, that is, a family
such that every satisfies the cowedge equation
between morphisms . The object is the vertex of the wedge or cowedge, and , are its components.
A morphism of wedges is a morphism of satisfying for every object ; a morphism of cowedges is a morphism satisfying for every . Identities of are morphisms of wedges and of cowedges, and a composite of two such morphisms again satisfies the displayed equation, so wedges over and their morphisms form a category , and cowedges under and their morphisms form a category ; associativity and the identity laws are inherited from .
Remarks
The wedge and cowedge equations are the hexagon of Dinatural transformation between functors on with one side made constant. For a wedge the source is , so both and are and drop out; for a cowedge the target is and the two outer morphisms on the target side drop out instead.
A wedge is not a cone over a diagram indexed by : its components sit at the diagonal values and its equation involves the two off-diagonal values , 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.
The end and the coend of a functor
Definition
Let be a functor and let and be the categories of wedges over and of cowedges under (Wedges and cowedges, and the categories they form).
An end of is a terminal object of , and a coend of is an initial object of (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 in which is a wedge and, for every wedge over , there is exactly one morphism with
A coend is a pair in which is a cowedge and, for every cowedge under , there is exactly one morphism with for every .
The vertex of an end is written and the vertex of a coend , the subscripted integral denoting the end and the superscripted one the coend. The components of the terminal wedge are the projections of the end and the components of the initial cowedge the injections of the coend. The variable 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 ) with a universal property rather than an element-level construction, the definition applies to any target category 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 are indexed by the objects of , 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 . For a discrete category there are no nonidentity ties and the end reduces to the product of the diagonal values.
An end and a coend are unique up to a unique isomorphism compatible with every component
Statement
Let be a functor.
If and are ends of (The end and the coend of a functor ), there is exactly one isomorphism satisfying for every object of . If and are coends of , there is exactly one isomorphism satisfying for every .
An end and a coend of are therefore unique up to a unique isomorphism compatible with every component.
Facts & Assumptions
Given: A functor , together with two ends of and two coends of .
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).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
A morphism of wedges is a morphism with for every , a morphism of cowedges is a morphism with for every , and wedges over and their morphisms form a category , cowedges under and their morphisms the category (Wedges and cowedges, and the categories they form).
Proof
The two ends and are two terminal objects of the one category , and the two coends are two initial objects of the one category .
Applying the terminal clause of [L1] in gives a unique isomorphism of wedges.
Applying the initial clause of [L1] in gives a unique isomorphism of cowedges.
An isomorphism of is by [F2] an isomorphism of with for every , and an isomorphism of is an isomorphism with for every ; 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.
Remarks
The compatibility clause is not an extra verification: it is what being a morphism in or 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 : its inverse in is a morphism of satisfying the displayed equation, and the two composites are the identities of and .
A natural transformation of functors induces a unique morphism of their ends and of their coends
Statement
Let be functors and let be a natural transformation (Natural transformation and its components); a wedge is a dinatural transformation from a constant functor (Dinatural transformation between functors on ).
If and have ends and (The end and the coend of a functor ), then a natural transformation induces a unique morphism of ends: there is exactly one morphism satisfying
If and have coends and , there is exactly one morphism satisfying for every .
Moreover , and whenever and are natural and all three ends exist.
Facts & Assumptions
Given: Functors , a natural transformation , and ends and coends of and of where these are asserted to exist.
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; 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 ).
A wedge from to is a dinatural transformation from a constant functor to : a family with for every ; dually a cowedge from to is a family with (Wedges and cowedges, and the categories they form).
A natural transformation is a family such that every satisfies the naturality equation (Natural transformation and its components).
A dinatural transformation is a family such that every satisfies , the equation displayed by the hexagon (Dinatural transformation between functors on ).
Proof
The family is a wedge from to : naturality of at gives , naturality at gives , and the wedge equation for gives , so both sides of the wedge equation for equal composed with that common morphism.
Since is a terminal wedge, the wedge of step 1.1 factors through it by exactly one morphism, which is the asserted with for every .
Taking , and , the identity of satisfies the defining equation of step 2.1, and that equation has exactly one solution, so .
For and with all three ends present, both and satisfy , and that equation has exactly one solution, so the two agree.
For coends, the family is a cowedge under : naturality of at and at rewrites both sides of its cowedge equation as and , which agree by the cowedge equation for ; initiality of then gives exactly one with . The induced morphism runs from the coend of to the coend of , 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.
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 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.
The twisted arrow category and its projection to
Definition
Let be a category (Category, object, morphism, domain, codomain, identity, composition, and hom-collection). Its twisted arrow category has the following data. Its objects are the morphisms of . For objects and , a morphism is a pair with , where and are morphisms of ; the identity of is , and the composite of with is
That composite is a morphism because , associativity and the identity laws are inherited from , 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
where in the target the first coordinate is read as the morphism of corresponding to (Opposite category , Product category and its projection functors). It preserves identities by construction, and it preserves composites because composition in 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 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 rather than in , and it is why a diagram indexed by can see a functor of two variables of opposite variance.
The opposite orientation is also in use in the literature, with naming what is here . 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 is to be read with the definition given here and is false under the other one.
The twisted arrow category is the category of elements of the hom-bifunctor
Statement
Let be a locally small category (Small, locally small, and large categories) and let be its hom-bifunctor (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The hom-assignment is a bifunctor). Write for its category of elements (The category of elements of a covariant functor or a presheaf) and for the projection sending to .
The assignment
is an isomorphism of categories (The twisted arrow category and its projection to ): it is a bijection on objects and on morphisms, it preserves identities and composites, and it satisfies .
Facts & Assumptions
Given: A locally small category .
A category is locally small when every is a set (Small, locally small, and large categories).
For every locally small category , the hom-assignment is a functor (The hom-assignment is a bifunctor).
The hom-assignment sends to , and a morphism of the product category, consisting of and , acts by (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
The category of elements of a functor has objects the pairs with , and a morphism given by a morphism in satisfying ; identities and composition are those of (The category of elements of a covariant functor or a presheaf).
The objects of are the morphisms of , and for and a morphism is a pair with , where and (The twisted arrow category and its projection to ).
The product category has morphisms , componentwise identities, and componentwise composition (Product category and its projection functors).
Proof
Because is locally small, every hom-collection is a set and the hom-assignment is a functor into on , so its category of elements is formed by the published construction.
An object of is a pair with ; since a morphism of is determined by, and determines, its domain, its codomain and its member of the corresponding hom-collection, the assignment is a bijection from the objects of to the objects of .
A morphism of is a morphism of , that is a pair with and in , satisfying ; by the displayed action of [F2] that equation reads , which is the defining condition of a morphism of . So is a bijection on each morphism collection, and it changes neither the pair nor the variance.
Identities and composites agree because both categories take them from : the identity of is on both sides and the composite of with is on both sides. Hence is a functor, bijective on objects and morphisms, so an isomorphism of categories; and on objects with on morphisms, so .
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 may equally be read as a statement about , and the smallness of for small 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 is a set so that the hom-assignment is -valued. Without it there is no hom-bifunctor to take elements of, while is still defined; so the twisted arrow category is the more primitive of the two constructions.
An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite
Statement
Let be a functor and let be the twisted arrow projection (The twisted arrow category and its projection to ).
Ends. The assignments with for , and with , are mutually inverse and give an isomorphism of categories 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 is an end of exactly when the corresponding cone is a limit of (The end and the coend of a functor , 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
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 (Opposite category ) send an object to the pair , with the domain and the codomain of swapped, and send the morphism of determined by to the morphism . Then is a functor, by mutually inverse assignments leaving the vertex unchanged, and a coend of is exactly a colimit of :
Facts & Assumptions
Given: A functor and the twisted arrow projection .
A wedge from to is a dinatural transformation from a constant functor to : a family with for every ; a cowedge from to is a family with ; a morphism of wedges is a morphism of the vertices commuting with every component (Wedges and cowedges, and the categories they form).
A cone over with apex is a family satisfying for ; a cocone under is a family satisfying ; a morphism of cones is with (Constant diagrams, cones, cocones, and their morphisms).
The objects of are the morphisms of , a morphism is a pair with for and , and the projection sends to and to (The twisted arrow category and its projection to ).
A limit of is a terminal cone: explicitly, for every cone there exists a unique morphism such that for every . A colimit is an initial cocone (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
The opposite category has the same objects and reverses every morphism: (Opposite category ).
If and are limits of one diagram , there is a unique isomorphism satisfying for every ; dually for colimits (Any two limits, or any two colimits, of one diagram are uniquely isomorphic compatibly with their structure maps).
Proof
Let be a wedge with vertex and put for , so that . This family is a cone over : for a morphism of , with and , functoriality of gives , the wedge equation at gives , and ; hence .
Let be a cone over with apex and put . The pairs and are morphisms of , since and , so the cone equation at each of them gives and ; the two left-hand sides are therefore equal and is a wedge.
The assignment is a functor: it sends the identity of to the identity of , and if and then their composite in is , whose image is exactly the composite in of the images and , taken in the order these two morphisms compose in .
The two assignments are mutually inverse: from a wedge, ; from a cone, the family rebuilt in step 1.1 has by the first computation of step 1.2. A morphism of the vertices satisfies for every exactly when it satisfies for every , since each family determines the other by the displayed formulas. So and are isomorphic categories over the identity on vertices, terminal objects correspond, and by [F5] and [F4] an end of is precisely a limit of ; [L1] then supplies the unique component-compatible isomorphism between any two such limits.
For cowedges, put for a cowedge and , so . Given , so a morphism of sent by to , functoriality gives , the cowedge equation at gives , and , so by the cowedge equation at ; conversely recovers a cowedge from a cocone through the two morphisms of step 1.2 read in , and the two assignments are mutually inverse exactly as in step 2.1. Hence , initial objects correspond, and a coend of is a colimit of over , the integrand being read with domain and codomain swapped.
Remarks
The swap in the coend clause is not cosmetic and is not a consequence of formal duality applied carelessly. Dualising turns a cowedge under into a wedge over viewed in , and the index category that then computes it is the opposite of the twisted arrow category, with the integrand evaluated at rather than . Taking the colimit of over 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 , 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.
The end of a functor made mute in its contravariant variable is the ordinary limit of that functor
Statement
Let be a functor and let be given by on objects and on morphisms (Product category and its projection functors, Opposite category ), so that 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 are exactly the cones over 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 has an end exactly when has a limit (The end and the coend of a functor , Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties) and then
Dually, the cowedges under are exactly the cocones under , so has a coend exactly when has a colimit, and then .
Facts & Assumptions
Given: A functor and the assignment displayed in the Statement.
A functor satisfies (Covariant functor, identity functor, composite functor, and contravariant functor).
The product category has componentwise identities and componentwise composition (Product category and its projection functors).
A dinatural transformation satisfies for every , the equation displayed by the hexagon (Dinatural transformation between functors on ).
A wedge from to is a dinatural transformation from a constant functor to : a family with for every ; a cowedge from to is a family with ; a morphism of wedges is a morphism of the vertices commuting with every component (Wedges and cowedges, and the categories they form).
A cone over with apex is a family satisfying for , a cocone is a family satisfying , and a morphism of cones is with (Constant diagrams, cones, cocones, and their morphisms).
A limit of is a terminal cone: explicitly, for every cone there exists a unique morphism such that for every ; a colimit is an initial cocone (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
Proof
The assignment is a functor: , and a composite in has second coordinate the composite of the second coordinates, so of it is of that composite, which is the composite of the values of .
For a family the wedge equation at reads , that is , which is the cone equation of [F5] verbatim; likewise the cowedge equation reads , which is the cocone equation. The wedge and cone conditions on one family are therefore the same equation, not merely equivalent ones.
A morphism of wedges over is a morphism of with for every , and that is exactly the defining condition of a morphism of cones over ; 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], has an end exactly when has a limit, and the two are the same object with the same components.
The same argument in the dual direction gives that the cowedges under and their morphisms are the cocones under and their morphisms, so an initial object of one category is an initial object of the other, and has a coend exactly when has a colimit, with the same vertex and components.
Remarks
This is the sense in which ends generalise limits rather than sitting beside them: a diagram indexed by 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 to be small or 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.
Ends exist over a small index category in a complete target, and coends in a cocomplete one
Statement
Let be a small category (Small, locally small, and large categories) and let be a functor.
If is complete, then has an end. If is cocomplete, then has a coend (Finite, small, and large limits and colimits; complete and cocomplete categories, The end and the coend of a functor ).
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 , or into a target that is not complete, may still have one.
Facts & Assumptions
Given: A small category and a functor on with values in a complete, respectively cocomplete, category .
The objects of are the morphisms of , and a morphism is a pair of morphisms of with (The twisted arrow category and its projection to ).
A category is small when both and are sets. (Small, locally small, and large categories).
The wedges over are the cones over , so an end is the limit over the twisted arrow category, and a coend is a colimit over 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).
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
is small. Its objects are the morphisms of , which form a set because is small. A morphism of carries its domain , its codomain and the pair , so the collection of all of them is a subclass of the fourfold product , cut out by the equation ; a subclass of a set is a set, and no choice is used to form it.
The diagram is therefore a small diagram in , so completeness of supplies a limit for it, and by [L1] that limit is an end of .
The opposite of a small category is small, since it has the same objects and the same morphisms, so is a small diagram as well and cocompleteness of supplies a colimit for it, which by [L1] is a coend of .
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 , not only its objects, that have to form a set before counts as a small diagram, and that in turn needs to be a set rather than merely each hom-set to be one. A locally small but large is not enough.
Sufficiency is all that is claimed. That the hypotheses cannot simply be dropped is FALSE: every functor on has an end, which exhibits a small index category and a target that is not complete in which an end fails to exist.
An end is the equalizer of two products, and a coend the coequalizer of two coproducts
Statement
Let be a small category (Small, locally small, and large categories) and let be a functor. Suppose the two products
exist in (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations), and write for the two morphisms between them determined by and for , where and 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 ): has an end exactly when have an equalizer, and then
Dually, if the coproducts and exist, a coend is the coequalizer of two maps between coproducts: the two morphisms determined on the -summand by and have a coequalizer exactly when has a coend, and then the coend is that coequalizer. Note that the -summand of the second coproduct is , with the domain and codomain of interchanged.
Facts & Assumptions
Given: A small category , a functor on , and the displayed products and coproducts wherever they are assumed to exist.
A wedge from to is a dinatural transformation from a constant functor to : a family with for every ; a cowedge from to is a family with ; a morphism of wedges is a morphism of the vertices commuting with every component (Wedges and cowedges, and the categories they form).
A product of is an object with projections such that every family has a unique pairing , and dually a coproduct has injections with unique copairings (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).
A category is small when both and are sets. (Small, locally small, and large categories).
An equalizer of is a morphism satisfying such that, whenever satisfies , there is a unique with ; a coequalizer is the dual (Equalizers and coequalizers as limits and colimits of a parallel pair).
A limit of is a terminal cone: explicitly, for every cone there exists a unique morphism such that for every (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
Proof
Because is small, and 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 exist and are unique because a morphism into a product is determined by its components.
For an object , the pairing of [F2] is a bijection between morphisms and families , given by . Under it, holds exactly when for every , that is exactly when for every , which is the wedge equation. So the equalising morphisms correspond exactly to the wedges with vertex , in both directions.
The correspondence of step 2.1 is compatible with precomposition: for the family attached to is . So a morphism of wedges is exactly a morphism with , and a terminal wedge is exactly a universal equalising morphism. By [F3] and [F4] that says has an end exactly when have an equalizer, and then the end is the equalizer, with ; the same statement read through [F6] identifies both with the limit of the parallel pair.
Dually, the copairing of [F2] is a bijection between morphisms and families , and holds exactly when for every , which is the cowedge equation; the same compatibility with postcomposition then makes an initial cowedge exactly a coequalizer of . The indexing is written out rather than left to duality because the -summand of the second coproduct is and not .
Remarks
The two index sets are the objects and the morphisms of , and they are not the objects and morphisms of ; 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 contribute components to the second product, and they cost nothing: at the equalising condition of step 2.1 reads . 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 definable by a single formula.
A set-valued coend is the disjoint union of the diagonal values modulo the dinaturality relation
Statement
Let be a small category (Small, locally small, and large categories) and let be a functor (Sets and functions form the large locally small category ). Write
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 ) containing
Then 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 ):
Both generating elements are named with their summands: the pair is generated by an element of the off-diagonal value , pushed into the summand at by and into the summand at by .
Facts & Assumptions
Given: A small category and a functor .
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
A category is small when both and are sets. (Small, locally small, and large categories).
Every small diagram has a colimit; it is the quotient of the tagged union by the least equivalence relation containing for (Set has all small colimits, realized as a quotient of a set-indexed disjoint union).
The coproduct of an indexed family regarded as a diagram on the discrete category is its colimit, with injections through which every family factors by a unique copairing (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).
For a small whose displayed coproducts exist, a coend is the coequalizer of two maps between coproducts, namely of the two morphisms determined on the -summand by into the summand at and by into the summand at , the -summand being (An end is the equalizer of two products, and a coend the coequalizer of two coproducts).
A coequalizer of is a morphism satisfying such that, whenever satisfies , there is a unique with (Equalizers and coequalizers as limits and colimits of a parallel pair).
A binary relation on is an equivalence relation when it is reflexive on , symmetric and transitive; the quotient set is the set of equivalence classes and the quotient map is surjective (Equivalence relation, equivalence class, and the quotient set ).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
Proof
Since is small, the objects and the morphisms of 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 and exist in and are the displayed disjoint unions.
By [L1] the coend of is the coequalizer, if it exists, of the two functions given on the summand at by and , where ranges over .
The quotient map coequalises and , because every pair is one of the generating pairs of . If is a function on with , then is an equivalence relation containing every generating pair, so it contains ; hence is constant on classes and factors as for a unique , uniqueness because is surjective. So is a coequalizer of and .
Therefore the coequalizer of step 2.1 exists, and by [L1] and [F3] the coend of is the quotient set of step 3.1, with the initial cowedge given by .
Remarks
The source of a generating pair is the off-diagonal value , indexed by running the other way; this is the same swap that appears in the description of a coend as a colimit over (An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite). If 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 both are the identity of and the generating pair is , which every equivalence relation contains already.
A module-valued coend is the direct sum of the diagonal values modulo the dinaturality submodule
Statement
Let be a unital ring, let be a small category (Small, locally small, and large categories) and let be a functor (Left modules over a fixed ring and module homomorphisms form the large locally small category ). Write for the coordinate inclusions of the direct sum (The direct sum of an indexed family of modules) and let
be the submodule generated by those elements (Submodule of a module, Generated submodule, cyclic and finitely generated modules, module basis and free module).
Then 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 , Quotient module with scalar multiplication on additive cosets):
where is the quotient homomorphism. As in the set-valued case, the generating element lies in the off-diagonal value , and the two terms of the generator sit in the summands at and at respectively.
Facts & Assumptions
Given: A unital ring , a small category , and a functor from to left -modules.
For a fixed ring , left -modules and module homomorphisms form a large locally small category (Left modules over a fixed ring and module homomorphisms form the large locally small category ).
A category is small when both and are sets. (Small, locally small, and large categories).
The direct sum is the submodule of the direct product consisting of the families of finite support, with coordinate inclusions ; If , both product and direct sum are the zero module. (The direct sum of an indexed family of modules).
A subset is a submodule when it is a subgroup of the additive group of and is closed under scalars: (Submodule of a module).
The submodule generated by is , the smallest submodule of containing (Generated submodule, cyclic and finitely generated modules, module basis and free module).
For the quotient module has the cosets as elements and scalar action (Quotient module with scalar multiplication on additive cosets).
For every family of homomorphisms there is a unique homomorphism such that for every . It is given by the finite sum of the over the support (Universal property of a direct sum of modules).
If is a homomorphism and satisfies , there is a unique homomorphism such that , equivalently (A module homomorphism vanishing on factors uniquely through ).
A cowedge from to is a dinatural transformation from to a constant functor: a family with for every (Wedges and cowedges, and the categories they form).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
Proof
Since is small its objects form a set, so is a set-indexed family of left -modules and the direct sum with its coordinate inclusions is formed.
The displayed generating elements lie in , so is the smallest submodule containing them, and with quotient homomorphism is a left -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.
The family is a cowedge from to : for and the difference is applied to a generator of , hence zero, and each is a homomorphism because the coordinate inclusion and the quotient map are.
Let be any cowedge. By [L1] there is a unique homomorphism with ; the cowedge equations for the family make every displayed generator lie in , and is a submodule, so by [F2]. By [L2] there is a unique with , hence with for every ; and any homomorphism with satisfies , so by the uniqueness in [L1] and by the uniqueness in [L2]. So is an initial cowedge, that is a coend of .
If is empty the index set is empty, so by [F1] the direct sum is the zero module, the generating set is empty, is the zero submodule and 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 . This is the asserted presentation of the coend in every case.
Remarks
The route is deliberately through the direct-sum and quotient universal properties rather than through a cocompleteness theorem for -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 the generator is , so identity morphisms enlarge by nothing; and if is discrete there are no non-identity morphisms at all, is the zero submodule and the coend is the direct sum of the diagonal values.
A functor preserving twisted-arrow limits preserves ends, and dually for coends
Statement
Let be a functor and let be a functor.
Ends. If preserves -limits (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors, The twisted arrow category and its projection to ) and is an end of (The end and the coend of a functor ), then is an end of ; so a functor preserving twisted-arrow limits preserves ends.
Coends. If preserves -colimits and is a coend of , then is a coend of .
Small index. If in addition is small (Small, locally small, and large categories), then every continuous satisfies the first hypothesis and every cocontinuous 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 and , and an end or a coend of where one is assumed.
The wedges over are exactly the cones over , by and , so an end is the limit over the twisted arrow category; dually the cowedges under are the cocones under and a coend is a colimit over (An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite).
preserves -limits if the image under of every limiting cone over is limiting over ; the terms for colimits use cocones (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).
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).
The objects of are the morphisms of , and a morphism is a pair of morphisms of subject to one equation (The twisted arrow category and its projection to ).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
A category is small when both and are sets. (Small, locally small, and large categories).
Proof
By [L1] the wedge over with vertex corresponds to the cone over with , and is an end of exactly when is a limiting cone; dually the cowedge corresponds to the cocone under with , and is a coend exactly when is a colimiting cocone.
Suppose preserves -limits. Then is a limiting cone over . Functoriality gives , so is exactly the cone that [L1] attaches to the family , which is therefore a wedge over ; being limiting, it makes an end of .
Suppose preserves -colimits. Then is a colimiting cocone under , and is the cocone that [L1] attaches to ; so is a cowedge under and is a coend of .
If is small then is small, since its objects are the morphisms of and its morphisms form a subclass of a fourfold product of with itself; the opposite of a small category is small. So a continuous , which by [F2] preserves all small limits, preserves -limits and step 2.1 applies, and a cocontinuous preserves -colimits and step 2.2 applies.
Remarks
The hypothesis is stated at the strength the proof uses, preservation of limits indexed by , and not as continuity: in this library a continuous functor is one preserving all small limits, and is small only when 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.
A right adjoint preserves ends and a left adjoint preserves coends
Statement
Let be a functor and let be an adjunction with and (Adjunction by unit, counit, and the triangle identities).
If has an end (The end and the coend of a functor ), then carries it to an end of . If has a coend and is an adjunction with , then carries that coend to a coend of .
No smallness hypothesis on 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 is one such whenever is a diagram at all.
Facts & Assumptions
Given: A functor on and an adjunction whose right or left half is applied to it.
An adjunction consists of functors with unit and counit satisfying the triangle identities The direction means that is left adjoint to and is right adjoint to (Adjunction by unit, counit, and the triangle identities).
If a diagram has a limit and , then is a limit of . Thus 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).
If is a left adjoint and a diagram has a colimit, then applying 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).
If preserves -limits and has an end, then of that end is an end of , so a functor preserving twisted-arrow limits preserves ends; dually a functor preserving -colimits carries a coend to a coend (A functor preserving twisted-arrow limits preserves ends, and dually for coends).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
Proof
By [F1] the functor of the adjunction is a right adjoint, and by [L2] a right adjoint preserves every limit that exists, at arbitrary legitimate indexing categories. In particular it preserves -limits, and no size hypothesis on is used to say so.
So satisfies the hypothesis of [L1] at the indexing category , and therefore carries an end of to an end of .
Dually, by [L3] a left adjoint preserves every colimit that exists, hence preserves -colimits, and by the coend clause of [L1] it carries a coend of to a coend of .
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.
The hom-functor turns a coend into an end and carries an end to an end
Statement
Let be small (Small, locally small, and large categories), let be locally small, let be a functor and let be an object of (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
From a coend to an end. Write for the functor , whose action on a morphism of the product category is precomposition with , so that . If has a coend (The end and the coend of a functor ), then the hom-functor turns a coend into an end: has an end and
From an end to an end. If has an end, then carries it to an end of , so
Facts & Assumptions
Given: A small , a locally small , a functor on with values in , and an object of .
A category is small when both and are sets. (Small, locally small, and large categories).
The objects of are the morphisms of , and a morphism is a pair of morphisms of with (The twisted arrow category and its projection to ).
The opposite category has the same objects and reverses every morphism, , and strictly (Opposite category ).
The hom-assignment sends to , and a morphism of the product category consisting of and acts by (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
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).
For every object of a locally small category and every small diagram with a colimit there is a natural bijection (Hom(X,−) is continuous, while Hom(−,X) sends every existing small colimit to a limit of sets).
For every object of a locally small category , the covariant hom-functor preserves all small limits that exist (Hom(X,−) is continuous, while Hom(−,X) sends every existing small colimit to a limit of sets).
If preserves -limits and has an end, then of that end is an end of , so a functor preserving twisted-arrow limits preserves ends (A functor preserving twisted-arrow limits preserves ends, and dually for coends).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
Proof
Since is small, is small and so is its opposite, so the coend of is the colimit of a small diagram; and strictly. Moreover is a functor, because precomposition with is functorial in by the displayed action of [F4] read in , and for its composite with the twisted arrow projection has value , which is applied to the value of the swapped projection at .
Apply [L1] to the small diagram whose colimit is the coend, indexed by : it gives a bijection between and the limit over of the diagram identified in step 1.1, which is the composite of with the twisted arrow projection. By [L4] read in the direction from limits to ends, that limit is an end of , so has an end and the displayed bijection is the first assertion.
For the second assertion, [L2] says preserves all small limits that exist, and -limits are small by step 1.1, so preserves them; by [L3] it therefore carries an end of to an end of , which is the displayed bijection.
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 is what makes both right-hand sides -valued, and smallness of is what makes the diagram indexed by small, which is the hypothesis the published statement about colimits carries. Neither can simply be dropped.
Ends and coends with parameters
Definition
Let , and be categories and let
be a functor (Product category and its projection functors, Covariant functor, identity functor, composite functor, and contravariant functor). For an object of write for the functor obtained by holding the first variable at and the identity of ; that this is a functor is immediate from the functor laws for applied to morphisms whose first coordinate is .
A parametrised end of is a choice, for every object of , of an end of (The end and the coend of a functor ): that is, an end taken in the two dinatural variables with the remaining variables held fixed. Its vertex at is written and its wedge components (Wedges and cowedges, and the categories they form). A parametrised coend is a choice of a coend of for every , with vertex and cowedge components .
The variable 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 : 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 is the one that appears in the Fubini theorem, where the parameter itself is later made dinatural.
A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters
Statement
Let be a functor and suppose given a parametrised end of (Ends and coends with parameters): an end of for every object of (The end and the coend of a functor , 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 to each such that satisfies the functor laws (Covariant functor, identity functor, composite functor, and contravariant functor) and, for every object of , the family is natural in the parameter, that is
The statement is about a given choice of ends. It does not assert that a functor on can be produced from the bare hypothesis that each has an end.
Facts & Assumptions
Given: A functor on and a chosen end of for every object of .
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; 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 ).
A wedge from to is a dinatural transformation from a constant functor to : a family with for every (Wedges and cowedges, and the categories they form).
A parametrised end of is a choice, for every object of the parameter category, of an end taken in the two dinatural variables with the remaining variables held fixed (Ends and coends with parameters).
For a natural transformation of functors on whose ends exist, a natural transformation induces a unique morphism of ends: there is exactly one with for every (A natural transformation of functors induces a unique morphism of their ends and of their coends).
A functor satisfies (Covariant functor, identity functor, composite functor, and contravariant functor).
Proof
For the family , indexed by the objects of , is a natural transformation : its naturality equation at a morphism is the equality of the two ways of writing applied to the composite of with and of with , and these composites agree in because composition there is componentwise.
By [L1] applied to that natural transformation, terminality of the chosen end at gives exactly one morphism satisfying for every ; so an arrow map with the required naturality exists and no other assignment has it.
The identity of satisfies the equation defining , since is the identity of by [F4]; by the uniqueness in step 2.1, .
For and , both and satisfy , the first because by [F4]; by the uniqueness in step 2.1 they are equal.
So with the arrow map of step 2.1 is a functor and every 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.
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 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 , which may be a proper class. The library's treatment of chosen limits carries the same hypothesis for the same reason.
A family into a parametrised end is natural, or dinatural, in the parameter exactly when its composite with the counit is
Statement
Let be a functor with a chosen parametrised end (Ends and coends with parameters), with counit components and 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.
Natural clause. Let be a functor and let be a family indexed by the objects of . Then a family into a parametrised end is natural in the parameter exactly when its composite with the counit is: is a natural transformation (Natural transformation and its components) if and only if, for every object of , the family is natural in .
Dinatural clause. Suppose instead the parameter category is (Opposite category , Product category and its projection functors), let be an object of , and let be a family indexed by the objects of . Then is a wedge from to (Wedges and cowedges, and the categories they form) if and only if, for every object of , the family is a wedge from to .
Facts & Assumptions
Given: A functor on with a chosen parametrised end and its functor structure ; for the natural clause a functor and a family ; for the dinatural clause a parameter category of the form , an object and a family .
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; 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 ).
A wedge from to is a dinatural transformation from a constant functor to : a family with ; precomposing a wedge with a morphism of the vertex again gives a wedge (Wedges and cowedges, and the categories they form).
A parametrised end of is a choice, for every object of the parameter category, of an end taken in the two dinatural variables with the remaining variables held fixed (Ends and coends with parameters).
A chosen parametrised end carries exactly one functor structure making every counit component natural in the parameter, characterised by (A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters).
A natural transformation is a family such that every satisfies the naturality equation (Natural transformation and its components).
A morphism of is a pair whose first coordinate is a morphism of and whose second is a morphism of , with componentwise composition (Product category and its projection functors).
The opposite category has the same objects and reverses every morphism: (Opposite category ).
Proof
Fix and an object of . The two morphisms at issue for the natural clause are and , and their composites with are and, by the defining equation of [L1], . Two morphisms whose composites with agree for every 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 .
For the forward direction of the natural clause, suppose is natural in . Then for every the family is the composite of the natural family with the family , which is natural by [L1]; a composite of two natural families is natural by the naturality equation of [F3] applied twice, so is natural in .
For the converse direction of the natural clause, suppose every is natural in . Its naturality equation at reads , so by step 1.1 the morphisms and have the same composite with for every and are therefore equal. Since was arbitrary, is natural in the parameter.
For the dinatural clause, fix in . The wedge equation for at is , an equation between morphisms , where and are the two morphisms of that the wedge equation names. Composing with and applying the defining equation of [L1] at each of them turns the two sides into and , whose equality for every is exactly the wedge equation for the family over . So the wedge equation for implies the one downstairs by composition, and conversely if it holds downstairs for every then the two morphisms of the wedge equation for agree after composition with every , hence are equal by step 1.1.
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.
A wedge on a product index category is exactly a family dinatural in each variable separately
Statement
Let , and be categories and let
be a functor. Reindexing the source as (Product category and its projection functors, Opposite category ), write for its values, contravariant in the first two slots and covariant in the last two.
Let be an object of and let be a family indexed by the objects of . Then a wedge on a product index category is exactly a family dinatural in each variable separately: is a wedge from to (Wedges and cowedges, and the categories they form) if and only if
- for every in and every object of , , and
- for every in and every object of , .
The equivalence is asserted for wedges, whose source is the constant functor at . It is not asserted for a dinatural transformation between two varying functors (Dinatural transformation between functors on ).
Facts & Assumptions
Given: A functor as displayed, an object of , and a family .
A wedge from to is a dinatural transformation from a constant functor to : a family with for every morphism of the index category (Wedges and cowedges, and the categories they form).
A dinatural transformation satisfies for every , the equation displayed by the hexagon (Dinatural transformation between functors on ).
The product category has objects the pairs, componentwise identities, and componentwise composition (Product category and its projection functors).
The opposite category has the same objects and reverses every morphism: (Opposite category ).
A functor satisfies (Covariant functor, identity functor, composite functor, and contravariant functor).
Proof
A morphism of is a pair with and , and under the reindexing the wedge equation of [F2] at that morphism reads , an equation between morphisms . The two displayed conditions of the Statement are this equation at and at .
For the forward direction, if is a wedge then the equation of step 1.1 holds at every morphism of , in particular at and at , which are the two displayed conditions.
For the converse direction, assume the two conditions and fix . Since acts independently in its four slots, , so the first condition rewrites the left-hand side of step 1.1 as . Factoring again as and applying the second condition at gives , which is the right-hand side of step 1.1. Factoring in the other order gives the same result, because each factorisation is a composite in of the same pair of morphisms in different slots. At the first condition is the identity equation and the chain reduces to the second condition alone; at it reduces to the first, so the reduction is not circular.
The two directions together give the asserted equivalence. What the converse direction spends is that the source of is the constant functor at : 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.
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 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.
Fubini: an end over a product index category and the two iterated ends exist together and agree
Statement
Let be a functor, reindexed as a functor on (Product category and its projection functors, Opposite category ).
Assume a chosen family of inner ends in each of the two orders (Ends and coends with parameters): an end for every pair of objects of , and an end for every pair of objects of , 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
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 or is used or claimed.
Facts & Assumptions
Given: A functor as displayed, together with a chosen family of inner ends in each of the two orders and their functor structures.
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; 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 ).
A wedge from to is a dinatural transformation from a constant functor to : a family with ; 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).
A parametrised end of is a choice, for every object of the parameter category, of an end taken in the two dinatural variables with the remaining variables held fixed (Ends and coends with parameters).
The product category has objects the pairs, componentwise identities, and componentwise composition (Product category and its projection functors).
The opposite category has the same objects and reverses every morphism: , and strictly (Opposite category ).
A functor satisfies (Covariant functor, identity functor, composite functor, and contravariant functor).
A family indexed by the objects of 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 and at (A wedge on a product index category is exactly a family dinatural in each variable separately).
A chosen parametrised end carries exactly one functor structure making every counit component natural in the parameter, characterised by (A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters).
For a parameter category , a family into a parametrised end is natural, or dinatural, in the parameter exactly when its composite with the counit is: a family is a wedge over if and only if every is a wedge over the integrand with the dinatural variables held at (A family into a parametrised end is natural, or dinatural, in the parameter exactly when its composite with the counit is).
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
Under the reindexing, is a functor of four slots, contravariant in the first two and covariant in the last two, and holding the two -slots fixed at a pair leaves a functor of the two -slots whose chosen end is , with counit natural in the parameter by [L2]. Symmetrically for with the roles of and exchanged.
Fix an object of . Given a wedge from to , [L1] makes it dinatural in each variable separately; dinaturality in at fixed is exactly the wedge equation for the family over the integrand with the -slots held at , so by [F1] there is exactly one with for every . By [L3], applied with parameter category , that family is a wedge over if and only if every , which is , is dinatural in at fixed — which is the other half of [L1]. Conversely a wedge over produces , dinatural in because is a wedge precomposed with , and dinatural in by [L3] again, hence a wedge over by [L1].
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 satisfies for every exactly when it satisfies for every : one direction is composition with , and the other is the uniqueness in [F1]. So the wedge category of and the wedge category of are isomorphic over the identity on vertices, terminal objects correspond, and exists exactly when does, with the same vertex.
The same argument with the roles of and exchanged, applied to the chosen family , gives that exists exactly when 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.
For the coend clause, let on objects and on morphisms, read as a functor ; 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 . Its diagonal values are those of , and by [F2] a wedge from to in is precisely a cowedge from to in , a morphism of wedges being a morphism of cowedges reversed; so a terminal wedge over is an initial cowedge under , that is a coend of . Applying steps 3.1 and 4.1 to in , with the chosen family of inner coends of as the chosen family of inner ends of , gives the coend clause in full.
Remarks
The route is through the universal property and not through a formula. In particular the target 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 is indexed by the objects of and constrained by its morphisms, and it is only after the source is written as that the two one-variable conditions can be separated at all.
Iterated ends may be taken in either order
Statement
Let 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
commuting with every component of the two wedges over the product index category that they induce (The end and the coend of a functor ). 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 on with chosen inner-end families in both orders and their functor structures in the remaining parameters.
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
A parametrised end of is a choice, for every object of the parameter category, of an end taken in the two dinatural variables with the remaining variables held fixed (Ends and coends with parameters).
The product category has objects the pairs, componentwise identities, and componentwise composition (Product category and its projection functors).
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
By [L1] each of the two iterated ends exists exactly when the end over the product index category exists, and each is then joined to it by exactly one isomorphism commuting with every component of the induced wedge.
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.
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.
For a small source category, the set of natural transformations is an end of the hom-bifunctor of the values
Statement
Let be small and locally small (Small, locally small, and large categories), and let be functors. Write for the functor , whose action on a morphism of the product category sends to (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The hom-assignment is a bifunctor, Sets and functions form the large locally small category ).
Then 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 ): the evaluation family is a terminal wedge over , so
Facts & Assumptions
Given: A small category , a locally small category , and functors .
A category is small when both and are sets, and locally small when every is a set; a small category is locally small (Small, locally small, and large categories).
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
The functor category has functors as objects and natural transformations as morphisms (Functor category ).
If is small and is locally small, then is locally small (If is small and is locally small then is locally small; if both are small it is small).
For every locally small category , the hom-assignment is a functor (The hom-assignment is a bifunctor).
The hom-assignment sends to , and a morphism of the product category consisting of and acts by (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
A natural transformation is a family such that every satisfies the naturality equation (Natural transformation and its components).
A wedge from to is a dinatural transformation from a constant functor to : a family with for every (Wedges and cowedges, and the categories they form).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
Proof
Local smallness of makes every a set, so by [L1] and [F3] the assignment is a functor into , being the hom-bifunctor of composed with in the contravariant slot and in the covariant one. Smallness of together with local smallness of makes locally small by [L2], so , which is a hom-collection of that category by [F5], is a set. The two hypotheses buy different things and neither is redundant.
A family satisfies the wedge equation at exactly when, for every , : the two sides of the wedge equation are and , and by [F3] the first sends to and the second sends to . By [F4] that is exactly the condition that for each the family is a natural transformation , and the equivalence holds in both directions.
The evaluation family , , is a wedge, since for natural the condition of step 2.1 is its naturality equation. Given any wedge with vertex , the function lands in by step 2.1 and satisfies for every ; and any with that property has for every , so it is that function. Hence the evaluation wedge is terminal.
By [F1] a terminal wedge is an end, so with the evaluation family is an end of , which is the displayed equality.
Remarks
The two size hypotheses do different work in this sufficient construction. Local smallness of makes the integrand -valued, and smallness of 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 impose nothing: at the condition of step 2.1 reads . If is discrete the wedge condition is vacuous and the end is the product of the sets , which is also what an unconstrained family is.
The end of the hom-bifunctor is the commutative monoid of natural endomorphisms of the identity functor
Statement
Let 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
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 ), 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 and its identity functor.
A category is small when both and are sets; a small category is locally small (Small, locally small, and large categories).
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: , 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).
The hom-assignment sends to , and a morphism of the product category consisting of and acts by (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
The functor category has functors as objects and natural transformations as morphisms (Functor category ).
The identity natural transformation has components , and the vertical composite of and is given componentwise by (Identity natural transformation and vertical composition).
The horizontal composite of and has components (Whiskering and horizontal composition of natural transformations).
A monoid is a set with an associative operation and a two-sided identity , so that It is commutative when the operation is (Semigroup and monoid).
Whenever the expressions are defined, (Horizontal and vertical composition of natural transformations satisfy the interchange law).
If a set carries two unital binary operations with the same unit satisfying , then the operations coincide and their common operation is commutative (Eckmann–Hilton: two unital operations satisfying interchange coincide and are commutative).
Proof
A small category is locally small, so [L1] applies with and : the integrand is the hom-bifunctor by [F1], and the theorem gives , a hom-collection of the functor category by [F2] and hence a set.
Write . Vertical composition is defined on and by [F3] is associative componentwise with two-sided unit . Horizontal composition is also defined on , since source and target functors are all , and by [F4] it has the same two-sided unit: and . So carries two unital operations with a common unit.
The published interchange law [L2] is exactly the hypothesis of [L3] for those two operations, read with , , , . Hence the two operations coincide and their common operation is commutative, so is a commutative monoid; by step 1.1 the end of the hom-bifunctor is that monoid.
Remarks
The component formula of Whiskering and horizontal composition of natural transformations already gives when every functor involved is , 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.
The end of the function-set functor on a representable is evaluation
Statement
Let be small (Small, locally small, and large categories) and let be an object of . Write for the hom-set of , which is the set of functions (Sets and functions form the large locally small category , The set of all functions ).
Covariant case. For , let , a functor (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category). Then
Contravariant case. For a presheaf (Opposite category ), let , again a functor . Then
So the end of the function-set functor on a representable is evaluation (The end and the coend of a functor ), the isomorphism sending a family to its value at the identity of .
Facts & Assumptions
Given: A small category , an object of , a functor and a presheaf .
A category is small when both and are sets; a small category is locally small (Small, locally small, and large categories).
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
The functions form the set , and Thus holds if and only if . (The set of all functions ).
The covariant hom-assignment sends to and to , while the contravariant hom-assignment sends to precomposition (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
The opposite category has the same objects and reverses every morphism: (Opposite category ).
A wedge from to is a family with for every , and a morphism of wedges is a morphism of the vertices commuting with every component (Wedges and cowedges, and the categories they form).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
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: , with the integrand (For a small source category, the set of natural transformations is an end of the hom-bifunctor of the values).
For locally small the evaluation maps are bijections natural in both variables, given by (The Yoneda bijection is natural in both and ).
For locally small , an object and a presheaf , evaluation at the identity gives a bijection (For a presheaf , naturally in and ).
Proof
The variance of each integrand is fixed before anything is computed. In the representable sits inside the first argument of a function set, and reverses that argument, so is contravariant while is covariant; hence is a functor on of the shape with and both covariant on . In the same two reversals apply to and to , and both are contravariant on , so has the shape with and functors on .
An end over of a functor on is an end over of the functor with its two slots exchanged. Indeed, writing , a morphism of is a morphism of , and the wedge equation becomes , which is the wedge equation for at that morphism of . The two wedge categories therefore have the same objects and the same morphisms.
For the covariant case, has the shape required by [L1] with source and target , which is locally small by [F4], so . By [L2] evaluation at the identity is a bijection from that set to .
For the contravariant case, step 1.2 rewrites as the end over of , and is small with , so [L1] applied with source gives , the natural transformations being taken between presheaves. By [L3], evaluation at the identity is a bijection from that set to . The contravariant published corollary is used here rather than the covariant statement read in an opposite category.
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 in both cases, which is where the object enters: the component of the wedge at is the only one that sees the identity, and it is what the published Yoneda bijection inverts.
The co-Yoneda isomorphisms: a set-valued functor is a coend against a representable
Statement
Let be locally small (Small, locally small, and large categories) and let be an object of . A set-valued functor is a coend against a representable (The end and the coend of a functor , The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding):
Covariant coend form. For , let (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The Cartesian product , Sets and functions form the large locally small category ), a functor . Then has a coend and
the initial cowedge being for and .
Contravariant coend form. For a presheaf (Opposite category ), let . Then has a coend and
the initial cowedge being for and .
End forms. If in addition is small, the two dual formulas and 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 , an object , a functor and a presheaf .
A category is locally small when every is a set (Small, locally small, and large categories).
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
The elements of are exactly the ordered pairs with and : Thus holds if and only if for some and some . (The Cartesian product ).
The covariant hom-assignment sends to , and the contravariant hom-assignment sends to , (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
A functor satisfies ; a contravariant functor is a functor on the opposite category, so it reverses composites (Covariant functor, identity functor, composite functor, and contravariant functor).
A cowedge from to is a dinatural transformation from to a constant functor: a family with for every (Wedges and cowedges, and the categories they form).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; 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 ).
For small , the end of the function-set functor on a representable is evaluation: and (The end of the function-set functor on a representable is evaluation).
Proof
Both integrands are functors on with values in , local smallness making each hom-collection a set. In the slot is contravariant because is, and is covariant because is; explicitly and for , and . In the slot is contravariant because is and is covariant because is; explicitly and for and .
The family is a cowedge from to : on an element of the left side gives and the right side gives , and these agree by functoriality of .
The family is a cowedge from to : on an element of the left side gives and the right side gives , and these agree because reverses composites.
The cowedge of step 2.1 is initial. Let be any cowedge and put for . Applying the cowedge equation of at the morphism to the element of gives , that is , so for every . Any with satisfies , so is unique.
The cowedge of step 2.2 is initial by the same computation in the other variance. Let be a cowedge and put for . The cowedge equation of at applied to in gives , that is ; and forces uniqueness.
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 be small, which the coend forms do not need.
Remarks
Every class in the coend has a representative in the summand at with first coordinate : the cowedge equation applied to moves to , which is why the counit at 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 . The end forms need small, because they pass through the set of natural transformations.
The tensor product of a presheaf and a covariant set-valued functor
Definition
Let be a category, let be a presheaf (Presheaves, covariantly and contravariantly representable functors, and representations, Opposite category ) and let be a covariant functor (Sets and functions form the large locally small category ). The assignment
is a functor (Product category and its projection functors, The Cartesian product ): it is contravariant in because is, covariant in because is, and the two slots act independently, on the two coordinates of the Cartesian product.
The tensor product of and over is the coend of the product of a presheaf and a covariant set-valued functor (The end and the coend of a functor ), when it exists:
Its cowedge components are written , and the cowedge equation reads for , and .
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 for two covariant and is not defined.
The name records the analogy with a tensor product of modules: the cowedge equation moves an element of across the product exactly as a scalar moves across , and The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category supplies the actions when and are hom-functors. The analogy is made precise for a one-object on this page's companion, where the two functors are a right and a left action of a monoid.
Set-weighted limits and colimits
Definition
Let be a small category, let be locally small (Small, locally small, and large categories) and let be a diagram. Because is small and is locally small, the functor category is locally small (Functor category , If is small and is locally small then is locally small; if both are small it is small, Sets and functions form the large locally small category ), so each collection of natural transformations named below is a set (Natural transformation and its components).
A weight for a limit is a functor . A weighted limit is an object of 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
where is the covariant hom-functor composed with (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category). Written out, the isomorphism is a bijection natural in between morphisms and families of functions satisfying for every and .
A weight for a colimit is a presheaf (Opposite category ). A weighted colimit is an object of with
naturally in the second variable, where sends to and is obtained by composing the contravariant hom-functor with .
The natural transformation corresponding to the identity of is the counit cylinder of the weighted limit, with components ; 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 , and a weight for a colimit is contravariant, matching . 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 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.
A weighted limit and a weighted colimit are unique up to a unique compatible isomorphism
Statement
Let be small, locally small, a diagram and a weight (Set-weighted limits and colimits).
If and are weighted limits , with counit cylinders and , there is exactly one isomorphism satisfying for every object of and every .
Dually, for a weight , any two weighted colimits are joined by exactly one isomorphism commuting with the components of their counit cylinders.
Facts & Assumptions
Given: A small , a locally small , a diagram , a weight , and two weighted limits, respectively two weighted colimits, of that data.
A weighted limit 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).
A presheaf is contravariantly representable when there is an object and a natural isomorphism ; The pair is a representation of , and is a representing object, with the covariant case using (Presheaves, covariantly and contravariantly representable functors, and representations).
A universal element of a presheaf is a pair with such that the maps are the components of a natural isomorphism; for a covariant the maps are on . A universal element is therefore a representation whose isomorphism is named by a distinguished element (Universal elements of covariant functors and presheaves).
If a presheaf has universal elements and , There is a unique isomorphism satisfying ; the covariant clause is the same statement with (Representing objects are unique up to a unique isomorphism compatible with their universal elements).
Proof
Write , a presheaf on . By [F1] a weighted limit is exactly a representing object for in the contravariant sense of [F3], so the data " is a weighted limit" and " represents " are the same data.
The counit cylinder is the universal element of that representation: under the representing isomorphism , the element lies in and satisfies for every , which is the display of [F2]; conversely a universal element determines the representing isomorphism by that same formula. Componentwise , so the equation of the Statement, , is exactly . This identification is the whole content of the theorem.
By [L1] applied to with the two universal elements and , there is exactly one isomorphism with ; by step 2.1 that is exactly one isomorphism with for every and every .
For weighted colimits the represented functor is covariant in , 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.
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.
A weighted limit of a set-valued diagram is the set of natural transformations from the weight
Statement
Let be a small category and let be functors (Sets and functions form the large locally small category ). Then the weighted limit of by in 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 ):
Its counit cylinder is , and its elements are exactly the natural transformations (Natural transformation and its components).
Facts & Assumptions
Given: A small category and two functors .
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
The functor category has functors as objects and natural transformations as morphisms (Functor category ).
If is small and is locally small, then is locally small (If is small and is locally small then is locally small; if both are small it is small).
The covariant hom-assignment sends to (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
A weighted limit is an object that represents the functor sending an object to the set of natural transformations from the weight, that is naturally in , the counit cylinder corresponding to the identity (Set-weighted limits and colimits).
A natural transformation is a family such that every satisfies the naturality equation (Natural transformation and its components).
The singleton is the set whose only element is : (The unordered pair and the singleton ).
Proof
Since is small and is locally small, [L1] and [F6] make a set, and likewise a set for every set , the functor being the covariant hom-functor of [F4] composed with .
For a set the assignments with , and with , are mutually inverse bijections between and : 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 for all is the same family of equations as .
The bijection of step 2.1 is natural in : for the family attached to has components , which is the family attached to postcomposed with . So represents in the sense of [F1] and is a weighted limit ; its counit cylinder is the family attached to the identity of , namely .
Taking to be a one-element set reads off the elements: by [F3] a function is determined by its single value, so is in bijection with and with , and step 3.1 identifies the two. Hence an element of is exactly a natural transformation .
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 ": in it is literally the set of -shaped families in , 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.
The power and the copower of an object by a set
Definition
Let be a locally small category (Small, locally small, and large categories, Category, object, morphism, domain, codomain, identity, composition, and hom-collection), let be an object of and let be a set. Write for the category with one object and only its identity morphism, and for the diagram picking out . A natural transformation between two functors is a single morphism in the target category between their values, since the only naturality equation is at an identity. When that morphism is a function.
The power of by , written or , is the weighted limit of the one-object diagram at the constant weight (Set-weighted limits and colimits): an object with a bijection
natural in , where the right-hand side is the set of functions (The set of all functions , Sets and functions form the large locally small category , The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
The copower of by , written , is the corresponding weighted colimit: an object with a bijection
natural in . Neither object need exist.
The counit of the power is the family indexed by , obtained by applying the bijection to the identity of ; dually the copower carries injections .
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 -enriched names power and copower are the ones in force on this page.
A power by a set is the product of that many copies and a copower is the coproduct
Statement
Let be locally small, let be an object of and let be a set. Write for the constant -indexed family at (An indexed family is a function with domain ; is its range).
Then the power (The power and the copower of an object by a set) exists exactly when the product 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 exists exactly when the coproduct exists, and a copower is the coproduct.
For the power is a terminal object and the copower an initial object.
Facts & Assumptions
Given: A locally small category , an object and a set .
The covariant hom-assignment sends an object to a set of morphisms, and 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 ).
The power is the weighted limit of the one-object diagram at the constant weight , characterised by a bijection natural in ; the copower is characterised dually by (The power and the copower of an object by a set).
An indexed family with index set is a function with domain , written (An indexed family is a function with domain ; is its range).
A product of is an object with projections such that every family has a unique pairing ; a coproduct is dual (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).
The empty product is therefore terminal and the empty coproduct initial. (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).
A limit of a diagram is a terminal cone: explicitly, for every cone there exists a unique morphism such that for every ; 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
By [F1] the power is characterised by a bijection, natural in , between morphisms and functions .
By [F2], [F4] and [F5] the product of the constant family is characterised by a bijection, natural in , between morphisms and -indexed families of morphisms ; and an -indexed family of elements of the set is by [F4] exactly a function . So the two universal properties are properties of the same functor of .
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 , is the family of projections of the product, since both are obtained by applying the bijection to the identity. The dual argument, with in place of and copairings in place of pairings, identifies the copower with the coproduct of the same constant family.
For the only function is the empty one, so the bijection of step 1.1 says that is a one-element set for every , that is, is terminal; dually is initial. This agrees with the published convention that The empty product is therefore terminal and the empty coproduct initial.
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.
A weighted limit is an end of powers and a weighted colimit a coend of copowers
Statement
Let be small, let be locally small, let be a diagram and let be a weight (Set-weighted limits and colimits).
Limit clause. Suppose given a functorial choice of powers: a functor together with bijections
natural in , in and in , so that each is a power (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 with vertex correspond bijectively and naturally in to the natural transformations (Wedges and cowedges, and the categories they form, Natural transformation and its components). Consequently has an end exactly when exists (The end and the coend of a functor ), and then
Colimit clause. For a weight (Opposite category ) and a functorial choice of copowers , with bijections natural in all three variables, the cowedges under with vertex correspond to the natural transformations , so has a coend exactly when exists, and then .
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 is not assumed.
Facts & Assumptions
Given: A small , a locally small , a diagram , a weight , and a functorial choice of powers, respectively of copowers, as displayed.
A weighted limit is an object that represents the functor sending an object to the set of natural transformations from the weight, that is naturally in ; a weighted colimit is characterised dually by (Set-weighted limits and colimits).
The power is the weighted limit of the one-object diagram at the constant weight with , characterised by a bijection natural in ; the copower is characterised dually (The power and the copower of an object by a set).
The covariant hom-assignment sends to , and the contravariant one to precomposition (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
A natural transformation is a family such that every satisfies the naturality equation (Natural transformation and its components).
A representation of a functor is an object together with a natural isomorphism from the corresponding hom-functor; The pair is a representation of , and is a representing object (Presheaves, covariantly and contravariantly representable functors, and representations).
A wedge from to is a dinatural transformation from a constant functor to : a family with ; a cowedge satisfies ; a morphism of either is a morphism of the vertices commuting with every component (Wedges and cowedges, and the categories they form).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
The opposite category has the same objects and reverses every morphism: (Opposite category ).
Proof
A family corresponds, componentwise under , to a family of functions , and the correspondence is a bijection because each is.
The family satisfies the wedge equation at exactly when satisfies the naturality equation at . Both sides of the wedge equation are morphisms , and applying at turns them into functions : naturality of in the covariant slot at sends to , and naturality of in the contravariant slot at sends to . Their equality for every is the equation , which by [F5] is naturality of as a transformation ; and since is a bijection the implication runs in both directions.
The correspondence of steps 1.1 and 2.1 is natural in , because is, so a morphism carries the wedge to the wedge and the transformation to postcomposed with . Hence a terminal wedge over is exactly a representing object for in the sense of [F6], so by [F1] and [F3] the end of exists exactly when does, and the two are the same object.
For the colimit clause, a family corresponds under the copower bijections to functions , and applying the bijection at to the two sides of the cowedge equation at gives and for ; their equality is the naturality equation of as a transformation of presheaves on , using [F8] to read and on . The correspondence is natural in , so an initial cowedge under is exactly a representing object for , and the coend of exists exactly when does.
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 is not by itself a functor on ; 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 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.
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 be small, let be locally small (Small, locally small, and large categories) and let be a diagram.
Limit clause. Let be a weight, let be its category of elements (The category of elements of a covariant functor or a presheaf) and let be the projection . 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 with apex are exactly the natural transformations , so exists exactly when does and then .
Colimit clause. Let be a weight (Opposite category ), let be its category of elements, whose morphisms are the of with , and let again be the projection. Then a weighted colimit is an ordinary colimit over it: the cocones under with apex are exactly the natural transformations , so exists exactly when does and then .
Both clauses use the published category of elements as it stands, with no opposite inserted, and if is small then is small.
Facts & Assumptions
Given: A small , a locally small , a diagram , and a weight of the variance named in each clause.
A weighted limit is an object that represents the functor sending an object to the set of natural transformations from the weight, that is naturally in ; the weighted colimit is characterised by (Set-weighted limits and colimits).
The category of elements of a functor has objects with and ; its identities and composition are those of (The category of elements of a covariant functor or a presheaf).
For a covariant , a morphism of is a morphism in satisfying (The category of elements of a covariant functor or a presheaf).
For a presheaf , a morphism of is a morphism in satisfying (The category of elements of a covariant functor or a presheaf).
A cone over with apex is a family satisfying for , and a morphism of cones is with (Constant diagrams, cones, cocones, and their morphisms).
A cocone under with apex is a family satisfying for (Constant diagrams, cones, cocones, and their morphisms).
A limit is a terminal cone: explicitly, for every cone there exists a unique morphism such that for every (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
A colimit is an initial cocone: explicitly, for every cocone there exists a unique morphism such that for every . (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
The covariant hom-assignment sends to (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
The contravariant hom-assignment sends to (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
The opposite category has the same objects and reverses every morphism: (Opposite category ).
A category is small when both and are sets. (Small, locally small, and large categories).
Two representing objects of one functor are joined by a unique compatible isomorphism: There is a unique isomorphism satisfying the compatibility equation with the universal elements (Representing objects are unique up to a unique isomorphism compatible with their universal elements).
Proof
Fix . A natural transformation assigns to each object of a function . A cone over with apex assigns to each object of a morphism , since . So both are families of morphisms indexed by the pairs with .
If is small then is small. Its objects are the pairs with in the set and in the set , so they form a set; and a morphism of carries its domain, its codomain and the underlying morphism of , so the morphisms form a subclass of and hence a set. No choice is used.
Setting matches the two families of step 1.1 bijectively, and it matches the two conditions as well. Naturality of at says for every . A morphism of is an with , and the cone condition at it says . Substituting makes these the same equation, so the two conditions are one equation and not merely equivalent ones.
The bijection of step 2.1 is natural in : precomposing every with corresponds to postcomposing every with , and it carries a morphism of cones to a morphism of the transformations and back. So a terminal cone over is exactly a representing object for ; by [F1] and [F5] the weighted limit exists exactly when the ordinary limit does and the two are the same object, unique by [L1].
For the colimit clause the same matching is made in the other variance. A cocone under with apex assigns to every object of and satisfies for every morphism , which by [F11] is an of with . A natural transformation of presheaves on assigns and its naturality equation at reads for . Setting and substituting makes the two families and the two equations the same.
The bijection of step 3.2 is natural in by the same computation with postcomposition in place of precomposition, so an initial cocone under is exactly a representing object for : the weighted colimit exists exactly when the ordinary colimit over does, and then they agree.
Remarks
The published category of elements is used exactly as defined, with no opposite inserted. Its projection to is covariant in both the covariant and the presheaf case, and the colimit is taken over itself. A source that forms the category of elements of the weight viewed as a covariant functor on will write "the opposite category of elements" for the same category read backwards; inserting an 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 selected. The smallness count of step 1.2 is recorded because the existence corollary for weighted limits spends exactly it.
A limit weighted by a -valued weight on a small index category exists in a complete target, and the weighted colimit in a cocomplete one
Statement
Let be a small category (Small, locally small, and large categories), let be locally small and let be a diagram.
If is complete (Finite, small, and large limits and colimits; complete and cocomplete categories), then for every weight the weighted limit exists (Set-weighted limits and colimits). If is cocomplete, then for every weight the weighted colimit exists.
Local smallness of is part of the hypothesis and cannot be dropped: the definition of a weighted limit is a representation of a -valued functor built from the hom-sets of .
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 , a locally small category that is complete, respectively cocomplete, a diagram , and a weight of the variance named in each clause.
A category is small when both and are sets. (Small, locally small, and large categories).
The category of elements has objects the pairs with , 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).
A weighted limit 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 small and locally small (Set-weighted limits and colimits).
For small the category of elements is small, and a weighted limit is an ordinary limit over the category of elements of the weight: exists exactly when 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).
Under the same hypotheses, a weighted colimit an ordinary colimit over it: exists exactly when 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).
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
The category of elements is small. Its objects are the pairs with in the set and in the set , hence a set; and a morphism of is determined by its domain, its codomain and the underlying morphism of , 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.
For the limit clause, is a diagram indexed by , which is small by step 1.1, so completeness of supplies a limit for it. By [L1] the weighted limit then exists and is that limit; is locally small, so the weighted limit is defined at all.
For the colimit clause, the same diagram over the small category has a colimit because is cocomplete, and by [L2] the weighted colimit exists and is that colimit.
Both clauses are sufficiency only. A weighted limit is by [F5] an object representing the displayed functor, so completeness or cocompleteness of is not necessary for a particular weighted object to exist. Smallness of remains part of the definition in force here, and no converse is claimed.
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 -valued, which is why the hypothesis is stated on the weight and not only on .
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.
A colimit of a set-valued functor is the set of connected components of its category of elements
Statement
Let be a small category (Small, locally small, and large categories) and let be a functor (Sets and functions form the large locally small category ). Let be its category of elements (The category of elements of a covariant functor or a presheaf) and let be the quotient of its set of objects by the least equivalence relation (Equivalence relation, equivalence class, and the quotient set ) containing every pair for which there is a morphism ; 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
(Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties), the colimiting cocone sending to the class of the object .
Facts & Assumptions
Given: A small category and a functor .
A category is small when both and are sets. (Small, locally small, and large categories).
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
The category of elements of a functor has objects with and ; and a morphism given by a morphism in satisfying (The category of elements of a covariant functor or a presheaf).
Every small diagram has a colimit; it is the quotient of the tagged union by the least equivalence relation containing for (Set has all small colimits, realized as a quotient of a set-indexed disjoint union).
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 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).
A colimit of is an initial cocone: explicitly, for every cocone there exists a unique morphism such that for every . (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
Proof
By [F1] the objects of are exactly the pairs with , which is exactly the tagged union named in [L1]; and a morphism of exists precisely when some has , that is, precisely for the pairs that generate the equivalence relation of [L1].
The least equivalence relation containing the generating pairs of [L1] is therefore the least equivalence relation on the objects of containing every pair joined by a morphism, and by [F2] its classes are the classes defining . 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].
By [L1] the colimit of is the quotient of the tagged union by that relation, with cocone components sending to the class of ; by step 2.1 that quotient is , and by [F4] the universal property of the colimit is the one asserted. If is empty, or every is empty, both sides are the empty set.
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 -colimit construction and the morphisms of , 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.
Weighting by the constant singleton gives exactly the ordinary limit
Statement
Let be small, let be locally small and let be a diagram. Write for the weight that is constantly a one-element set (The unordered pair and the singleton ).
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 are exactly the cones over with apex (Constant diagrams, cones, cocones, and their morphisms), so exists exactly when does and then
Dually, for the constant singleton weight on , the weighted colimit exists exactly when does and then the two agree.
Facts & Assumptions
Given: A small , a locally small , a diagram , and the constant singleton weight.
The singleton is the set whose only element is : (The unordered pair and the singleton ).
The covariant hom-assignment sends to , and the contravariant one to precomposition (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
A weighted limit 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).
A cone over with apex is a family satisfying for ; a cocone satisfies , and a morphism of cones is with (Constant diagrams, cones, cocones, and their morphisms).
A limit of is a terminal cone: explicitly, for every cone there exists a unique morphism such that for every ; a colimit is an initial cocone (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
The category of elements has objects with and ; a morphism is a morphism in satisfying ; and its identities and composition are those of (The category of elements of a covariant functor or a presheaf).
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
A natural transformation has components , and by [F6] each is determined by the single morphism , every function out of a one-element set being determined by its value. Naturality at reads , that is , which is the cone condition of [F3]. The correspondence is a bijection in both directions.
The bijection of step 1.1 is natural in , since precomposing every with corresponds to postcomposing every with . So an object represents exactly when it is a terminal cone over ; by [F1] and [F2] the weighted limit exists exactly when the ordinary limit does, and they are the same object with the same components.
For the colimit clause, a natural transformation of presheaves on has components determined by morphisms , and its naturality equation at reads , the cocone condition of [F3]; the correspondence is natural in , so exists exactly when does and the two agree.
The same conclusion follows from [L1] by a second route: the category of elements of the constant singleton weight has, by [F5], one object for each object of and one morphism for each morphism of , the defining equation being vacuous because the weight's values are one-element sets; so the projection is an isomorphism onto and is . This is a comparison, not a redefinition: the ordinary limit is the published one and is restated nowhere.
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 replaces the index category by , which has one copy of for each element of ; the constant singleton weight leaves exactly one copy of each, and larger weights make more.
Weighting by a representable evaluates the diagram
Statement
Let be small, let be locally small (Small, locally small, and large categories), let be a diagram and let be an object of .
Limit clause. For the covariant representable weight (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):
Colimit clause. For the contravariant representable weight , the weighted colimit exists and
Facts & Assumptions
Given: A small , a locally small , a diagram and an object of .
A category is small when both and are sets; a small category is locally small (Small, locally small, and large categories).
The covariant hom-assignment sends to , and the contravariant hom-assignment sends to precomposition (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
A representation of a functor is an object with a natural isomorphism from the corresponding hom-functor; The pair is a representation of , and is a representing object (Presheaves, covariantly and contravariantly representable functors, and representations).
A weighted limit is an object that represents the functor sending an object to the set of natural transformations from the weight, that is naturally in ; the weighted colimit is characterised by (Set-weighted limits and colimits).
For locally small the evaluation maps are bijections natural in both variables; in particular, for , (The Yoneda bijection is natural in both and ).
For locally small , an object and a presheaf , evaluation at the identity gives a bijection , natural in both variables (For a presheaf , naturally in and ).
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
Fix an object of . The functor is the covariant hom-functor of [F4] composed with , and it takes values in sets because is locally small. By [L1] applied in , which is locally small by [F5], evaluation at is a bijection from to .
That bijection is natural in . A morphism induces the natural transformation , and the naturality of [L1] in its functor variable gives , which is precisely compatibility with precomposition by . Hence represents in the sense of [F6], so by [F1] it is a weighted limit , unique up to the unique compatible isomorphism by [L3].
For the colimit clause the weight and the diagram are both presheaves on , so [L2] gives a bijection from to , evaluation at again. Its naturality in the presheaf variable makes it natural in , now with respect to postcomposition, so represents and by [F1] it is the weighted colimit . The two clauses use the published Yoneda statement of matching variance, and neither is obtained from the other.
Remarks
The two clauses give the same object 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 by the category of elements of the weight. For the covariant representable weight that category has as an initial object, since a morphism out of it to is a morphism with ; 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 .
A representable functor carries a weighted limit to the weighted limit of the composed diagram
Statement
Let be small, let be locally small (Small, locally small, and large categories), let be a diagram and let be an object of .
Limit clause. Let be a weight and suppose exists (Set-weighted limits and colimits). Then the weighted limit of the composed diagram by the same weight exists and
(The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The hom-assignment is a bifunctor).
Colimit clause. Let be a weight (Opposite category ) and suppose exists. Then
a weighted limit in of the presheaf , 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 , a locally small , a diagram , an object , and a weight of the variance named in each clause whose weighted limit or colimit is assumed to exist.
A category is small when both and are sets; a small category is locally small (Small, locally small, and large categories).
The covariant hom-assignment sends to , and the contravariant hom-assignment sends to precomposition (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
For every locally small category the hom-assignment is a functor, and its restrictions in the two variables are the contravariant and covariant hom-functors (The hom-assignment is a bifunctor).
The opposite category has the same objects and reverses every morphism: (Opposite category ).
A weighted limit is an object that represents the functor sending an object to the set of natural transformations from the weight, that is naturally in ; the weighted colimit is characterised by (Set-weighted limits and colimits).
A representation of a functor is an object with a natural isomorphism from the corresponding hom-functor; The pair is a representation of , and is a representing object (Presheaves, covariantly and contravariantly representable functors, and representations).
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).
For a small and functors , a weighted limit of a set-valued diagram is the set of natural transformations from the weight: (A weighted limit of a set-valued diagram is the set of natural transformations from the weight).
Proof
By [L2] and [F2] the assignment is a functor , its values being sets because is locally small, and is small by hypothesis. So [L1] applies to the pair and and gives , in particular the right-hand side of the limit clause exists.
By [F1] and [F3] the defining property of is a bijection natural in . 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].
For the colimit clause, [F6] makes a presheaf on , that is a functor on , which is small with ; so [L1] applied with source identifies with , and [F1] gives a canonical bijection from that set to . The object produced is a weighted limit in over , and calling it a weighted colimit would reverse the variance of the weight.
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 , 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 by testing against objects of 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 , 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.
A coend is a colimit weighted by the hom-bifunctor, and an end a limit weighted by it
Statement
Let be small (Small, locally small, and large categories), let be locally small and let be a functor. Take the index category to be (Product category and its projection functors, Opposite category ) and itself as the diagram.
Coend clause. Let be the weight , that is the hom-bifunctor (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category, The hom-assignment is a bifunctor) composed with the interchange of the two slots, which is what makes it a functor on and not on . Then the cowedges under with vertex are exactly the natural transformations , naturally in , so has a coend exactly when exists (The end and the coend of a functor , Set-weighted limits and colimits) and then
End clause. Let be the hom-bifunctor itself, . Then the wedges over with vertex are exactly the natural transformations , naturally in , so has an end exactly when exists and then .
Facts & Assumptions
Given: A small category , a locally small category and a functor on with values in .
A category is small when both and are sets. (Small, locally small, and large categories).
The product category has morphisms , componentwise identities, and componentwise composition (Product category and its projection functors).
The opposite category has the same objects and reverses every morphism: , and strictly (Opposite category ).
The hom-assignment sends to , and a morphism of the product category consisting of and acts by (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
For every locally small category , the hom-assignment is a functor (The hom-assignment is a bifunctor).
A wedge from to is a dinatural transformation from a constant functor to : a family with ; a cowedge is a family with (Wedges and cowedges, and the categories they form).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
A weighted limit 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 by naturally in (Set-weighted limits and colimits).
A representation of a functor is an object together with a natural isomorphism from the corresponding hom-functor; The pair is a representation of , and is a representing object (Presheaves, covariantly and contravariantly representable functors, and representations).
Proof
The index category is small with , and is by [F6]. The assignment is the functor of [L1] composed with the interchange of the two slots, which is an isomorphism , so is a functor on ; the interchange is what the variance requires, and writing the hom-bifunctor on instead would give the weight of the end clause, not of the coend clause. A morphism of is a pair with and in , and sends to by [F4].
For the coend clause, send a cowedge with vertex to the family for , which equals by the cowedge equation of [F2] at . It is natural: for as in step 1.1, both and reduce, by the factorisations of supplied by [F5] and the cowedge equation at , to . Conversely a natural gives , whose cowedge equation at is naturality of at read against naturality at , both of which compute . The two assignments are mutually inverse, since and naturality recovers from .
For the end clause, send a wedge with vertex to for , which equals by the wedge equation of [F2] at . A morphism of is a pair with and , and both and reduce, by the same factorisations and the wedge equation at , to . Conversely a natural gives , and naturality at and at gives the two sides of the wedge equation.
Both correspondences are natural in : postcomposing a cowedge with postcomposes every with , and precomposing a wedge with precomposes every with . So by [F1] and [F8] an initial cowedge under is exactly a representing object for and a terminal wedge exactly a representing object for ; by [F3] the coend of exists exactly when does and the end exactly when does, with equality in each case.
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 is a presheaf on , so it is a functor on , 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.
Why weights are needed once the base of enrichment is not
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 , and only those two.
First, that a cone is a natural transformation out of a constant weight: the weight exists because 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 into the legs 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 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 , so that a hom-object is an object of 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 , maps from 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 into the hom-objects. The first feature is not automatic either, since a constant assignment into has to be shown to be a -functor before it can serve as a weight, and that is a condition on , not a triviality.
What survives untouched is the definition used on this page: a weighted limit is a representing object for the functor sending 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.
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 ): is the terminal wedge and the initial cowedge. The variable is bound in both.
The twisted arrow category. has the morphisms of as objects and a morphism is a pair with , so its projection lands in (The twisted arrow category and its projection to , Opposite category ).
Which category computes a coend. Under those two conventions an end is a limit over and a coend is a colimit over 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 there is here. Under the reversed orientation the projection lands in and every statement on this page naming 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: dinatural transformations compose
Statement
False claim: for functors and dinatural transformations and (Dinatural transformation between functors on ), the componentwise composite is a dinatural transformation ; so the functors on and the dinatural transformations between them form a category.
Facts & Assumptions
Given: The walking arrow , with objects and and one non-identity morphism , and the category as target.
A dinatural transformation is a family such that every satisfies , the equation displayed by the hexagon (Dinatural transformation between functors on ).
There are a category, three set-valued functors on 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).
For natural and and dinatural , 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
The witness is restated in full so that this item stands alone. Take to be the walking arrow, so that a functor is four sets and four functions subject to one equation. Let have all four values a one-element set; let have and one-element sets; and let have , , and with , with and . Let and be the families whose components are the only functions available between one-element sets.
Both families are dinatural and their composite is not. The hexagon for at is an equation between two functions into the one-element set , so it holds; the hexagon for at is an equation between two functions out of , so it holds; and the two legs of the hexagon for the composite send the element of to and to 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.
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.
Remarks
The mechanism is the empty slot. Putting in the position of and of 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 position of 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: every functor on has an end
Statement
False claim: every functor has an end (The end and the coend of a functor ).
Facts & Assumptions
Given: The discrete category on the set of natural numbers, the full subcategory of whose objects are the finite sets, and the functor with for every pair of objects.
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
A subcategory has a subclass of the objects and, for each pair, a subclass of the morphisms; The subcategory is full when for every pair of its objects (Subcategory and full subcategory).
A category is small when both and are sets. (Small, locally small, and large categories).
A wedge from to is a family with for every (Wedges and cowedges, and the categories they form).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; 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 ).
For small and a target where the displayed objects exist, an end is the equalizer of two products, the first indexed by the objects of and the second by its morphisms (An end is the equalizer of two products, and a coend the coequalizer of two coproducts).
A product of is an object with projections such that every family has a unique pairing (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).
A set is finite when for some , and then is that unique (The cardinality of a finite set).
For every there is no injection (The pigeonhole principle on ).
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
Let be discrete on , so its only morphisms are identities and it is small by [F6]; let be the full subcategory of on the finite sets, which is a category by [F3] and [F4]; and let send every pair of objects to the two-element set and every morphism to an identity, which is a functor because every morphism of is an identity. The index category is deliberately small, so that smallness of the index is not what is at issue.
A wedge over with vertex is an unconstrained family: by [F8] the wedge equation is imposed only at morphisms of , and all of those are identities, at which it reads . So a wedge with vertex is exactly a family of functions indexed by , and by [L1] and [F2] an end of is exactly a product of the diagonal values in .
No object of has that property. Suppose were an end, with by [F5]. Take the vertex to be a one-element set, which is an object of ; the wedges with that vertex are the families with , and the families that are at exactly one of the numbers and elsewhere are pairwise distinct. By [F1] each factors through by exactly one morphism from a one-element set, that is by exactly one element of , and distinct wedges give distinct elements; this is an injection , hence an injection , which [L2] forbids. So has no end and the claim is false.
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.
Remarks
The witness turns on the target, not on the index. Taking to be all of 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: 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 and the projection as fixed on this page (The twisted arrow category and its projection to ), the coend of a functor is the colimit over of the very diagram whose limit is the end (The end and the coend of a functor , Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
Facts & Assumptions
Given: The walking arrow , with objects and and one non-identity morphism , and its hom-bifunctor as the integrand.
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
The hom-assignment sends to , and a morphism of the product category consisting of and acts by (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
For every locally small category , the hom-assignment is a functor (The hom-assignment is a bifunctor).
The objects of are the morphisms of , a morphism is a pair with , and sends to (The twisted arrow category and its projection to ).
A colimit is an initial cocone: for every cocone there exists a unique morphism such that for every ; a limit is a terminal cone, and Explicitly, for every cone there exists a unique morphism such that for every . (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
The opposite category has the same objects and reverses every morphism: (Opposite category ).
The wedges over are the cones over , so an end is the limit over the twisted arrow category; the coend is the colimit over 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).
For small and a set-valued integrand, the coend is the disjoint union of the diagonal values modulo the dinaturality relation, generated by the pairs and for and (A set-valued coend is the disjoint union of the diagonal values modulo the dinaturality relation).
Refutation
Take to be the walking arrow and , a functor into by [L3]. Its values are , , and . By [F1] the objects of are , and ; a morphism is the pair and a morphism is the pair , while a morphism out of would need a component in and there is none. So is a cospan, and takes the value at , at and at .
The colimit of over 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 is exactly a function , and by [F5] the initial such is itself.
The coend has two elements. By [L2] it is the quotient of by the relation generated by the pairs indexed by a morphism and an element of ; the only non-identity morphism is , and 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.
One element is not two, so the coend is not the colimit of over and the claim is false. The correct description is [L1]: the coend is the colimit over , by [F3] the same objects with every arrow reversed, of the functor sending to — domain and codomain interchanged. On this witness that diagram takes the values , and , its index category is a span, and its colimit is the two-element set, as it must be.
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 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 is empty.
FALSE: every functor preserves the ends that exist in its domain
Statement
False claim: if has an end and is any functor, then carries that end to an end of (The end and the coend of a functor , 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.
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).
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).
A product of is an object with projections such that every family has a unique pairing (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).
A limit of a diagram is a terminal cone: explicitly, for every cone there exists a unique morphism such that for every ; 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).
A subcategory is full when for every pair of its objects, so a full subcategory is determined entirely by its objects (Subcategory and full subcategory).
preserves -limits if the image under of every limiting cone over is limiting over (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).
An end of is a terminal object of the category of wedges over and a coend an initial object of the category of cowedges under ; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
For and , the end of a functor made mute in its contravariant variable is the ordinary limit of that functor: (The end of a functor made mute in its contravariant variable is the ordinary limit of that functor).
If preserves -limits and has an end, then of that end is an end of , so a functor preserving twisted-arrow limits preserves ends (A functor preserving twisted-arrow limits preserves ends, and dually for coends).
Refutation
Regard a poset as a category by [L2] and [F5], so that a morphism exists exactly when and monotone maps are exactly the functors. Let be the discrete category on two objects and let pick out two elements and of a poset . By [F2] and [F6] a product of and in 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 on , since has the same limit.
First witness. Let be the four-element poset with , and incomparable, and let be the two-element chain . The map with and is monotone, hence a functor by [L2]. The greatest lower bound of and in is , so by step 1.1 the end exists and is ; but the greatest lower bound of and in is , while . So carries the end to an element that is not the end of the composite, and by [F4] it does not preserve it.
Second witness, with a full and faithful functor. Let be the four-element poset with , , and incomparable, so that the greatest lower bound of and in is . Let be the full subposet on , which by [F3] is a full subcategory, and in which the greatest lower bound of and is . The inclusion is monotone, hence a functor, and it carries the end computed in to , which is not the end computed in .
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 -limits preserves the ends indexed by , and a right adjoint has that property for every . Neither witness is a right adjoint.
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: every weighted limit is the ordinary limit of the diagram it weights
Statement
False claim: for every weight and every diagram , the weighted limit is the ordinary limit of (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 , with objects and and one non-identity morphism ; the diagram with a two-element set and a one-element set; and the weight with a two-element set and a one-element set.
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
A natural transformation is a family such that every satisfies the naturality equation (Natural transformation and its components).
A weighted limit is an object that represents the functor sending an object to the set of natural transformations from the weight (Set-weighted limits and colimits).
A limit of is a terminal cone: explicitly, for every cone there exists a unique morphism such that for every (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
For a cospan , a pullback is its limit, consisting of with two projections whose composites with and agree and through which every compatible pair factors uniquely (Pullbacks and pushouts as limits and colimits of cospans and spans).
A set is finite when for some , and then is that unique ; equal cardinalities mean equinumerosity (The cardinality of a finite set).
For a small and set-valued and , a weighted limit of a set-valued diagram is the set of natural transformations from the weight: (A weighted limit of a set-valued diagram is the set of natural transformations from the weight).
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).
A weighted limit with the constant singleton weight is exactly the ordinary limit: (Weighting by the constant singleton gives exactly the ordinary limit).
Refutation
Fix the witness. Let be the walking arrow, let and with the only function between them, and let and with the only function between them. Both are functors, since the only equations to check involve identities.
The ordinary limit of has two elements. A cone over with apex is a pair of functions and with , so is determined by and a cone is exactly a function ; by [F2] the limit is , a set with two elements.
The weighted limit has four elements. By [L2] it is the set of natural transformations ; such a transformation is a pair of functions and , and its naturality equation at is an equation between two functions into the one-element set , hence automatic. So there are exactly as many as there are functions , namely four.
Four is not two, so is not the ordinary limit of and the claim is false. The same count follows from [L1] and [F3]: the category of elements of has the objects , and 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 along itself, which for a map from a two-element set to a one-element set has four elements.
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 . 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.
Remarks
The weight is doing something visible here: it duplicates the object of the index category, so the limit is taken over a diagram with two copies of mapping into 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 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: 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 , 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.
The vertex of an end is written and the vertex of a coend , so the subscripted integral denotes the end and the superscripted one the coend (The end and the coend of a functor ).
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).
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
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.
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.
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.
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
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Definition 1.1.1
- B. Richter, From Categories to Homotopy Theory (author's draft), Definition 4.4.1
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Exercise 1.2
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Chapter 1 introduction and Exercise 1.2
- B. Richter, From Categories to Homotopy Theory (author's draft), §4.4
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Definition 1.1.4 and Remark 1.1.5
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Definition 1.1.6 and Notation 1.1.13
- B. Richter, From Categories to Homotopy Theory (author's draft), Definitions 4.4.4 and 4.4.6
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Definition 1.1.6 and Remark 1.1.5
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Remark 1.1.7
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), §2.1
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Definition 1.2.2
- B. Richter, From Categories to Homotopy Theory (author's draft), Definitions 4.5.1 and 4.5.2
- E. Riehl, Categorical Homotopy Theory, §7.1
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Remark 1.2.3
- B. Richter, From Categories to Homotopy Theory (author's draft), Proposition 4.5.3
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Remark 1.2.5
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (2.2)
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Remark 1.2.4
- E. Riehl, Categorical Homotopy Theory, (7.1.6)
- B. Richter, From Categories to Homotopy Theory (author's draft), Example 4.4.7
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Theorem 1.2.7
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Corollary 1.2.8
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (2.3)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), §2.1 and (2.5)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (2.5)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (2.6)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (2.7)-(2.9)
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Theorem 1.3.1
- B. Richter, From Categories to Homotopy Theory (author's draft), Proposition 4.6.3
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (2.8)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (2.9)
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Theorem 1.4.1
- B. Richter, From Categories to Homotopy Theory (author's draft), Example 4.4.5
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Remark 1.4.3
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), §2.2
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Proposition 2.2.1
- E. Riehl, Categorical Homotopy Theory, Definitions 7.1.1 and 7.2.1
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.1)-(3.6)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.1)-(3.2)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.7)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.42) and (3.44)
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Definition 2.2.3
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), §3.7
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Example 2.2.4
- E. Riehl, Categorical Homotopy Theory, (7.1.3)
- E. Riehl, Categorical Homotopy Theory, (7.1.8) and (7.2.4)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.33)-(3.34)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.35)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.26)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.10)
- E. Riehl, Categorical Homotopy Theory, Example 7.1.4
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.8)
- E. Riehl, Categorical Homotopy Theory, Example 7.2.9
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), §3.9
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Notation 1.1.13 and Remarks 1.1.14 and 1.1.16
- B. Richter, From Categories to Homotopy Theory (author's draft), Notation 4.6.1 and Remark 4.6.2
- E. Riehl, Categorical Homotopy Theory, Example 7.1.16
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Remarks 1.1.14 and 1.1.16
- B. Richter, From Categories to Homotopy Theory (author's draft), Remark 4.6.2