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.
Every enriched functor into the base is a weighted colimit of representables when the displayed weighted colimit exists
Statement
Assume is symmetric monoidal right closed, locally small, complete, and cocomplete, and that its collection of objects is a set. Let be a small -category and let be a -functor. If the weighted colimit
exists, then it is naturally isomorphic to . Thus is a weighted colimit of representable enriched functors.
Facts & Assumptions
Given: A base as in the statement, a small -category , and a -functor .
The strong enriched Yoneda lemma identifies with the particular end (Strong enriched Yoneda lemma as a particular end).
Enriched weighted limits and colimits are defined by enriched hom-object representation (Enriched weighted limit).
The representables are the functors (Representable enriched functor).
Proof
Evaluate the displayed coend at an object of . By [L2] and [L3], its value is
Fix and define a -functor by . The coend universal property and the closed structure give natural isomorphisms In one has , so applying [L1] to identifies the last end with
The isomorphism from step 2.1 is natural in . The enriched Yoneda principle therefore gives . These isomorphisms are natural in , so they assemble into an isomorphism of -functors between the displayed weighted colimit and .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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, Chapter 3 (standard reference, not scraped)