Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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.

Evaluation is the colimit over the slice category

Statement

Let F:C→E be a functor and let c be an object of C. Then the diagram

C/c⟶C⟶FE

has a colimit, and that colimit is F(c).

The proof is again direct: the identity arrow 1c:c→c is terminal in the slice category.

Facts & Assumptions

Given: A functor F:C→E and an object c of C.

[F1]

The slice category C/c has objects arrows u:d→c, and a morphism from u:d→c to u′:d′→c is an arrow a:d→d′ with u′∘a=u (Comma category, slice category, and coslice category).

[L1]

The comma-category formulas compute left Kan extensions (Comma-category limit and colimit formulae compute Kan extensions).

Proof

technique · direct
1.1F1L1

Specialize the left-Kan part of [L1] to K=1C. Then the indexing category (1C↓c) is exactly the slice category C/c of [F1].

2.1F1F2step 1.1∎

The object (c,1c) is terminal in C/c: for any object u:d→c, the required morphism from u to (c,1c) is u itself, and it is unique because its defining equation is 1c∘a=u. Therefore the image of (c,1c) under the diagram is a colimit object. That image is F(c), and its colimiting cocone has components F(u):F(d)→F(c). By [F2], this says precisely that F(c) is the colimit of the diagram on C/c.

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