Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13
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.

A limiting cone for a diagram is exactly a colimiting cocone for the formally dual diagram in the opposite category

Statement

For D:J→C, let Dop:Jop→Cop be the same object and arrow assignment with directions reversed. A cone λ:ΔL⇒D is limiting in C if and only if the reversed family is a colimiting cocone under Dop in Cop. The dual assertion exchanges colimits and limits.

Facts & Assumptions

Given: A diagram D:J→C.

[F2]

The opposite category has the same objects and reverses all morphisms and composites (Opposite category Cop).

[L1]

A formally dual theorem follows by reversing every morphism and the order of every composite (Every theorem about categories has a formal dual obtained by reversing morphisms and composition).

Proof

technique · duality
1.1

Reversing λj:L→D(j) gives λjop:D(j)→L. The cone equation D(u)λj=λk reverses to the cocone equation λjopD(u)op=λkop.

F2
1.2

A cone morphism h:(X,ξ)→(L,λ) reverses to a cocone morphism from (L,λop) to (X,ξop), and this operation is bijective on morphisms.

F2algebra
2.1

Consequently terminality of (L,λ) among cones is exactly initiality of (L,λop) among cocones. By [F1], this proves both directions of the asserted equivalence.

F1step 1.1step 1.2
3.1

Applying the same translation a second time gives the colimit-to-limit statement. Any later appeal to duality uses this exact reversal of objects, arrows, hypotheses, and conclusion, as required by [L1].

L1step 2.1∎

Depends on

Used by

Dependency tree · two levels

6 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