Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

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.1

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:IP. This invokes that order-theoretic greatest lower bound directly and does not form a proper-class diagram.

L1L4givenconstruct
2.1

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

step 1.1L1L2L3L4L7choose
3.1

If f,g:IC, their equalizer e:EI is monic by [L5], and the composite ie:EP is monic by [L6], hence a subobject of P. Minimality of i gives a factorisation IE 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.

step 1.1step 2.1L4L5L6discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 35 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources