Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-05
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 V is symmetric monoidal right closed, locally small, complete, and cocomplete, and that its collection of objects is a set. Let A be a small V-category and let F:A→V be a V-functor. If the weighted colimit

∫AF(A)⊗A(A,−)

exists, then it is naturally isomorphic to F. Thus F is a weighted colimit of representable enriched functors.

Facts & Assumptions

Given: A base V as in the statement, a small V-category A, and a V-functor F:A→V.

[L1]

The strong enriched Yoneda lemma identifies F(K) with the particular end ∫A[A(K,A),FA] (Strong enriched Yoneda lemma as a particular end).

[L2]

Enriched weighted limits and colimits are defined by enriched hom-object representation (Enriched weighted limit).

[L3]

The representables are the functors A(A,−) (Representable enriched functor).

Proof

technique · direct
1.1L2L3given

Evaluate the displayed coend at an object K of A. By [L2] and [L3], its value is CK:=∫AF(A)⊗A(A,K).

2.1L1L2step 1.1algebra

Fix X∈V and define a V-functor GX:Aop→V by GX(A)=[F(A),X]. The coend universal property and the closed structure give natural isomorphisms [CK,X]≅∫A[F(A)⊗A(A,K),X]≅∫A[A(A,K),[F(A),X]]. In Aop one has Aop(K,A)=A(A,K), so applying [L1] to GX identifies the last end with GX(K)=[F(K),X].

3.1L1step 2.1∎

The isomorphism [CK,X]≅[F(K),X] from step 2.1 is natural in X. The enriched Yoneda principle therefore gives CK≅F(K). These isomorphisms are natural in K, so they assemble into an isomorphism of V-functors between the displayed weighted colimit and F.

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