Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-16
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 category satisfying the explicit SAFT intersection hypotheses is cocomplete

Statement

Let C be complete and locally small with a supplied small coseparating set. Assume either the supplied-well-powering branch or the direct class-intersection and preservation branch of Special adjoint functor theorem, objectwise form with explicit intersection smallness or preservation data for every diagonal functor Δ:C→CJ with J small. Then C is cocomplete.

If the resulting initial comma objects are supplied for every diagram, they assemble into the colimit functor left adjoint to Δ.

Facts & Assumptions

Given: The hypotheses in the Statement and a small category J.

[L1]

For small J, the functor category CJ is locally small under the displayed size hypotheses (If C is small and D is locally small then [C,D] is locally small; if both are small it is small).

[L2]

Completeness and cocompleteness mean existence of all small limits and colimits (Finite, small, and large limits and colimits; complete and cocomplete categories).

[L3]

A colimit of D:J→C is an initial object (Q,ρ) of Cocone⁡(D): for every cocone (X,ξ) there is a unique u:Q→X with uρj=ξj for every j (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[L4]

Objectwise SAFT supplies the required initial comma object under either explicit intersection branch, and supplied initial objects assemble into a left adjoint (Special adjoint functor theorem, objectwise form with explicit intersection smallness or preservation data, Special adjoint functor theorem, data-supplied functor form).

Proof

technique · direct
1.1L1L2L4

The diagonal Δ preserves all small limits. Let E:K→C be a small diagram with limiting cone (lim⁡E,λk) in C, which exists by the completeness in [L2]. A cone over ΔE with apex G∈CJ is a family of maps G→ΔE(k) natural in J and compatible over K, so at each j∈J its components form a cone over E with apex G(j); the universal property of lim⁡E gives a unique map G(j)→lim⁡E for each j, and uniqueness makes that family automatically natural in J. Hence (Δ(lim⁡E),Δλk) is a limiting cone and Δ is continuous, which is the hypothesis both branches of [L4] require. No selection is involved, because each component mediator is unique. Its domain has the stated SAFT data and its codomain is locally small by [L1], so [L4] gives an initial object in (D↓Δ) for every D∈CJ, including the empty diagram.

2.1step 1.1L2L3L4∎

An object of (D↓Δ) is a natural transformation D⇒ΔX, that is, a family ξj:D(j)→X commuting with the arrows of J — exactly a cocone under D with vertex X — and its morphisms are the maps of vertices commuting with those families, exactly the morphisms of Cocone⁡(D). So the initial object of step 1.1 is an initial cocone, which by [L3] is a colimit of D. Since J and D were arbitrary, [L2] makes C cocomplete. When the initial objects are supplied as a family, the functor form in [L4] identifies their assembly as the colimit functor.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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