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.
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.
Depends on
- Set-weighted limits and colimits
- The category of elements of a covariant functor or a presheaf
- Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties
- Constant diagrams, cones, cocones, and their morphisms
- Representing objects are unique up to a unique isomorphism compatible with their universal elements
- The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category
- Small, locally small, and large categories
- Opposite category $\mathcal C^{\mathrm{op}}$
Used by
- A limit weighted by a Set-valued weight on a small index category exists in a complete target, and the weighted colimit in a cocomplete one Corollary
- A weighted limit computing a kernel pair Example
- FALSE: every weighted limit is the ordinary limit of the diagram it weights False statement
- Why weights are needed once the base of enrichment is not Set Remark
- Weighting by the constant singleton gives exactly the ordinary limit Theorem
Dependency tree · two levels
22 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
- E. Riehl, Categorical Homotopy Theory, (7.1.8) and (7.2.4) (standard reference, not scraped)
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.33)-(3.34) (standard reference, not scraped)