How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The end 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.
Depends on
Used by
- A right adjoint preserves ends and a left adjoint preserves coends Corollary
- Ends exist over a small index category in a complete target, and coends in a cocomplete one Corollary
- Iterated ends may be taken in either order Corollary
- The hom-functor turns a coend into an end and carries an end to an end Corollary
- Ends and coends with parameters Definition
- The tensor product of a presheaf and a covariant set-valued functor Definition
- A module-valued coend computed as a quotient of a direct sum Example
- Fubini checked by hand on a product of two walking arrows Example
- The coend of the hom-bifunctor Example
- The end formula checked by hand against natural transformations on the walking arrow Example
- The tensor product of monoid sets as a coend Example
- FALSE: every functor on CᵒᵖtimesC has an end False statement
- FALSE: every functor preserves the ends that exist in its domain False statement
- FALSE: the integral notation of Yoneda's original paper means the same as the modern one False statement
- FALSE: under this page's convention a coend is the colimit of the same twisted-arrow diagram whose limit is the end False statement
- The end of a functor made mute in its contravariant variable is the ordinary limit of that functor Proposition
- Orientation and notation conventions in force on this page Remark
- A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters Theorem
- A coend is a colimit weighted by the hom-bifunctor, and an end a limit weighted by it Theorem
- A family into a parametrised end is natural, or dinatural, in the parameter exactly when its composite with the counit is Theorem
- A functor preserving twisted-arrow limits preserves ends, and dually for coends Theorem
- A module-valued coend is the direct sum of the diagonal values modulo the dinaturality submodule Theorem
- A natural transformation of functors induces a unique morphism of their ends and of their coends Theorem
- A set-valued coend is the disjoint union of the diagonal values modulo the dinaturality relation Theorem
- A weighted limit is an end of powers and a weighted colimit a coend of copowers Theorem
- An end and a coend are unique up to a unique isomorphism compatible with every component Theorem
- An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite Theorem
- An end is the equalizer of two products, and a coend the coequalizer of two coproducts Theorem
- For a small source category, the set of natural transformations is an end of the hom-bifunctor of the values Theorem
- Fubini: an end over a product index category and the two iterated ends exist together and agree Theorem
- The co-Yoneda isomorphisms: a set-valued functor is a coend against a representable Theorem
- The end of the function-set functor on a representable is evaluation Theorem
Dependency tree · two levels
10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Definition 1.1.6 and Notation 1.1.13 (standard reference, not scraped)
- B. Richter, From Categories to Homotopy Theory (author's draft), Definitions 4.4.4 and 4.4.6 (standard reference, not scraped)