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.
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.
Depends on
- The twisted arrow category and its projection to $\mathcal C^{\mathrm{op}}\times\mathcal C$
- An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite
- The end and the coend of a functor $\mathcal C^{\mathrm{op}}\times\mathcal C\to\mathcal D$
- Opposite category $\mathcal C^{\mathrm{op}}$
- The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category
- The hom-assignment $\mathcal C(-,-):\mathcal C^{\mathrm{op}}\times\mathcal C\to\mathbf{Set}$ is a bifunctor
- Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties
- Sets and functions form the large locally small category $\mathbf{Set}$
- A set-valued coend is the disjoint union of the diagonal values modulo the dinaturality relation
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Remark 1.2.3 (standard reference, not scraped)