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 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.
Depends on
- An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite
- The twisted arrow category and its projection to $\mathcal C^{\mathrm{op}}\times\mathcal C$
- The end and the coend of a functor $\mathcal C^{\mathrm{op}}\times\mathcal C\to\mathcal D$
- Finite, small, and large limits and colimits; complete and cocomplete categories
- Small, locally small, and large categories
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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
- B. Richter, From Categories to Homotopy Theory (author's draft), Proposition 4.5.3 (standard reference, not scraped)