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.
Left and right Kan extensions
Definition
Let , , and be categories, let be a functor, and let be a functor (Covariant functor, identity functor, composite functor, and contravariant functor).
A left Kan extension of along is a functor together with a natural transformation
(Natural transformation and its components) such that for every functor and every natural transformation , there exists a unique natural transformation with
Thus is initial among pairs with .
A right Kan extension of along is a functor together with a natural transformation
such that for every functor and every natural transformation , there exists a unique natural transformation with
Thus is terminal among pairs with .
Depends on
Used by
- A fully faithful left Kan extension that is not pointwise Counterexample
- Absolute Kan extension Definition
- Codensity monad Definition
- Global Kan extensions as adjoints to restriction Definition
- Pointwise Kan extensions as those preserved by representables Definition
- Pointwise Kan extensions by the comma-category formula Definition
- FALSE: a left Kan extension along a fully faithful functor always restricts back to the original functor False statement
- FALSE: every Kan extension is pointwise False statement
- Mac Lane's warning about left and right Kan extensions Remark
- Adjunctions as absolute Kan extensions, with the preserved converse Theorem
- Comma-category limit and colimit formulae compute Kan extensions Theorem
- Kan extensions are unique up to unique isomorphism Theorem
- Lan is left adjoint to restriction, and restriction is left adjoint to Ran Theorem
- Left adjoints preserve left Kan extensions Theorem
- The codensity construction satisfies the monad laws Theorem
Dependency tree · two levels
6 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., Definition 6.1.1 (standard reference, not scraped)
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., Chapter X.3 (standard reference, not scraped)
- B. Richter, From Categories to Homotopy Theory, §§4.1-4.2 (standard reference, not scraped)