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.
Comma-category limit and colimit formulae compute Kan extensions
Statement
Let and be functors, and fix .
For the comma category , let
be the diagram sending to .
If has a colimit cocone , then has the objectwise universal property of the left Kan extension value at : for every functor and natural transformation , there is a unique morphism with
Dually, if the diagram
has a limit cone , then has the objectwise universal property of the right Kan extension value at : for every functor and natural transformation , there is a unique morphism with
If such colimits, respectively limits, are supplied for every , then their values and the uniquely forced arrow maps assemble into a functor , respectively . The left unit component is the leg at , and the right counit component is the leg at .
Facts & Assumptions
Given: Functors and ; an object of ; the comma categories and ; and the diagrams and described in the Statement.
The objects of are pairs and the objects of are pairs , with the usual commuting-arrow morphisms (Comma category, slice category, and coslice category).
A colimit is an initial cocone and a limit is a terminal cone: morphisms out of a colimit, and into a limit, are uniquely determined by their composites with the structure maps (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties, Constant diagrams, cones, cocones, and their morphisms).
A left Kan extension of along is initial among pairs with , and a right Kan extension is terminal among pairs with (Left and right Kan extensions).
Proof
Let . For each object of , the morphism is natural in because is natural, so it is a cocone under . By [F2] there is a unique morphism with for every . This is exactly the left objectwise universal property at .
Let . For each object of , the morphism is natural in , hence a cone over . By [F2] there is a unique morphism with for every . This is exactly the right objectwise universal property at .
Suppose the colimits are supplied for all . For , the family is a cocone under , so [F2] gives a unique morphism with ; uniqueness makes identities and composition hold, so the values assemble into a functor, and the leg at is the unit component . The same argument with the cones of step 1.2 assembles the supplied limits into , with counit component the leg at .
Depends on
- Left and right Kan extensions
- Comma category, slice category, and coslice category
- Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties
- Constant diagrams, cones, cocones, and their morphisms
- Covariant functor, identity functor, composite functor, and contravariant functor
Used by
- Pointwise Kan extensions by the comma-category formula Definition
- A left Kan extension along a full subcategory inclusion of preorders Example
- A left Kan extension along the inclusion of the rationals in the reals Example
- Induction and coinduction of permutation representations as Kan extensions Example
- The orbit-set and fixed-point constructions as Kan extensions Example
- Evaluation is the colimit over the slice category Theorem
- Evaluation is the limit over the coslice category Theorem
- Kan extensions as coends and ends Theorem
- Limits and colimits are Kan extensions along the functor to the terminal category Theorem
- Pointwise Kan extensions exist under smallness and completeness hypotheses Theorem
- The codensity monad of the small skeleton of finite sets is the ultrafilter monad Theorem
- The comma-category and representable-preservation notions of pointwise Kan extension agree Theorem
- The presheaf category on a small category is the free cocompletion Theorem
- The Yoneda embedding is its own pointwise left Kan extension 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
- E. Riehl, Category Theory in Context, 2nd ed., Theorem 6.2.1 (standard reference, not scraped)
- B. Richter, From Categories to Homotopy Theory, §§4.1-4.2 (standard reference, not scraped)