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.
When a category is tensored, every limit in it is a conical enriched limit
Statement
Assume is symmetric monoidal right closed, locally small, complete, and cocomplete, and let be a tensored -category. Then the ordinary limit of every small diagram in the underlying category , when it exists, is a conical enriched limit.
Facts & Assumptions
Given: A base as in the statement, a tensored -category , a small ordinary diagram, and its limit cone in .
Tensors represent enriched hom-objects against the base: (Tensor and cotensor in a V-category).
Conical enriched limits are the constant-unit weighted enriched limits (Conical enriched limit).
Proof
Because is tensored, [L1] identifies the enriched hom-object out of with the hom-object tested against . Thus each represented enriched hom-functor is a right adjoint in the underlying category and therefore preserves ordinary limits.
Apply step 1.1 to an ordinary limit object of the underlying diagram. For every test object , the ordinary limit bijection for upgrades, through the tensor representation of [L1], to the enriched constant-weight bijection required by [L2].
Hence the ordinary limit is already a conical enriched limit.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- Emily Riehl, Categorical Homotopy Theory, Theorem 7.5.3 (standard reference, not scraped)