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.
Density computed for a presheaf on a two-object discrete category
Example
Let be the discrete category on two objects and . Define a presheaf by
Then the category of elements of has three objects and no non-identity morphisms, and the density theorem identifies as the coproduct
in .
Facts & Assumptions
Given: The discrete two-object category and the presheaf above.
The category of elements has objects with ; because is discrete, it has no non-identity arrows between distinct such objects (The category of elements of a covariant functor or a presheaf).
The Yoneda embedding sends and to the representables and (The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding, Sets and functions form the large locally small category ).
The density theorem expresses as the colimit of the diagram indexed by whose values are the representables at those objects (Density theorem for a small category).
Verification
The category of elements of has the three objects , , and , and no non-identity morphisms, by [F1].
Therefore the density diagram of [L1] is the discrete three-object diagram with values , , and , by [F2]. Its colimit is the coproduct .
Applying [L1] to this presheaf gives exactly that coproduct as .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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.