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 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.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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
- G. M. Kelly, Basic Concepts of Enriched Category Theory (TAC Reprints 10), (3.1)-(3.2) (standard reference, not scraped)