Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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 complete locally small category with a small coseparating set and intersections of all subobject collections has an initial object

Statement

Let C be complete and locally small, let Φ be a supplied small coseparating set, and suppose that every collection of subobjects of any fixed object has an intersection as a greatest lower bound. Then C has an initial object.

The intersection hypothesis is about collections of subobjects and is not being represented as a limit of a proper-class diagram.

Facts & Assumptions

Given: The category C, the supplied coseparating set Φ, and the intersection hypothesis in the Statement.

[L2]

Local smallness makes each C(C,K) a set (Small, locally small, and large categories).

[L3]

A coseparating set detects distinct parallel maps by postcomposition (Separating and coseparating sets of objects).

[L4]

For a family of subobjects of C indexed by a set I, an intersection is a greatest lower bound in the subobject order: a subobject [p] with [p]≤[mi] for every i, such that every [q] with [q]≤[mi] for all i satisfies [q]≤[p] (Intersection of a supplied family of subobjects as its greatest lower bound). The hypothesis of this theorem extends the same greatest-lower-bound condition to possibly proper collections of subobjects, and that extension is supplied by the Statement, not by the cited definition.

[L7]

In a pullback square, the pullback of a monomorphism is a monomorphism (A pullback of a monomorphism is a monomorphism, and a pushout of an epimorphism is an epimorphism).

Proof

technique · constructive
1.1L1L4givenconstruct

Form the set-indexed product P=∏K∈ΦK. By the Statement's hypothesis in the sense recorded in [L4], the collection of all subobjects of P, possibly a proper collection, has an intersection i:I→P. This invokes that order-theoretic greatest lower bound directly and does not form a proper-class diagram.

2.1step 1.1L1L2L3L4L7choose

Fix an object C. By [L2], the canonical evaluation map νC:C→∏K∈Φ∏f∈C(C,K)K is a set-indexed product map, and [L3] makes it monic. Repeating each projection of P defines Δ:P→∏K∈Φ∏f∈C(C,K)K. Pull back νC along Δ to obtain PC→P with a map PC→C; that pullback of the monomorphism νC is monic by [L7], so PC→P is a subobject of P. Since i lies below every subobject of P, [L4] gives I→PC, hence a map I→C.

3.1step 1.1step 2.1L4L5L6discharge-construct∎

If f,g:I⇉C, their equalizer e:E→I is monic by [L5], and the composite i∘e:E→P is monic by [L6], hence a subobject of P. Minimality of i gives a factorisation I→E over P, so e and 1I — the latter monic by [L6] — represent the same subobject and e is invertible. Therefore f=g. Step 2.1 gives existence and this step gives uniqueness for every target, so I is initial.

Depends on

Used by

Dependency tree · two levels

21 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