Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

Comma-category limit and colimit formulae compute Kan extensions

Statement

Let K:CD and F:CE be functors, and fix dD.

For the comma category (Kd), let

πd:(Kd)CE

be the diagram sending (c,u:Kcd) to F(c).

If πd has a colimit cocone λ(c,u):F(c)Ld, then Ld has the objectwise universal property of the left Kan extension value at d: for every functor M:DE and natural transformation α:FMK, there is a unique morphism αd:LdM(d) with

αdλ(c,u)=M(u)αc.

Dually, if the diagram

σd:(dK)CE

has a limit cone ρ(c,u):RdF(c), then Rd has the objectwise universal property of the right Kan extension value at d: for every functor M:DE and natural transformation β:MKF, there is a unique morphism βd:M(d)Rd with

ρ(c,u)βd=βcM(u).

If such colimits, respectively limits, are supplied for every d, then their values and the uniquely forced arrow maps assemble into a functor LanKF, respectively RanKF. The left unit component ηc:F(c)LanKF(Kc) is the leg at (c,1Kc), and the right counit component εc:RanKF(Kc)F(c) is the leg at (c,1Kc).

Facts & Assumptions

Given: Functors K:CD and F:CE; an object d of D; the comma categories (Kd) and (dK); and the diagrams πd and σd described in the Statement.

[F1]

The objects of (Kd) are pairs (c,u:Kcd) and the objects of (dK) are pairs (c,u:dKc), with the usual commuting-arrow morphisms (Comma category, slice category, and coslice category).

[F2]

A colimit is an initial cocone and a limit is a terminal cone: morphisms out of a colimit, and into a limit, are uniquely determined by their composites with the structure maps (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties, Constant diagrams, cones, cocones, and their morphisms).

[F3]

A left Kan extension (L,η) of F along K is initial among pairs (M,α) with α:FMK, and a right Kan extension (R,ε) is terminal among pairs (M,β) with β:MKF (Left and right Kan extensions).

Proof

technique · direct
1.1

Let α:FMK. For each object (c,u:Kcd) of (Kd), the morphism M(u)αc:F(c)M(d) is natural in (c,u) because α is natural, so it is a cocone under πd. By [F2] there is a unique morphism αd:LdM(d) with αdλ(c,u)=M(u)αc for every (c,u). This is exactly the left objectwise universal property at d.

F1F2F3
1.2

Let β:MKF. For each object (c,u:dKc) of (dK), the morphism βcM(u):M(d)F(c) is natural in (c,u), hence a cone over σd. By [F2] there is a unique morphism βd:M(d)Rd with ρ(c,u)βd=βcM(u) for every (c,u). This is exactly the right objectwise universal property at d.

F1F2F3
2.1

Suppose the colimits are supplied for all d. For v:dd, the family λ(c,vu):F(c)Ld is a cocone under πd, so [F2] gives a unique morphism LanKF(v):LdLd with LanKF(v)λ(c,u)=λ(c,vu); uniqueness makes identities and composition hold, so the values assemble into a functor, and the leg at (c,1Kc) is the unit component ηc. The same argument with the cones of step 1.2 assembles the supplied limits into RanKF, with counit component εc the leg at (c,1Kc).

F1F2step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

10 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