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 jointly weakly initial set has an initial object, without class-indexed choice

Statement

Let C be complete and locally small. If C has a supplied jointly weakly initial set S, then C has an initial object. The construction uses only the small diagram on S and one existential witness for each fixed target; it makes no class-indexed choice.

Facts & Assumptions

Given: A complete locally small category C and a supplied jointly weakly initial set S (Weakly initial object and jointly weakly initial set).

[L1]

Completeness provides a limit for every small diagram, including the equalizer diagrams used below (Finite, small, and large limits and colimits; complete and cocomplete categories).

[L2]

Local smallness makes every hom-collection a set, and a category is small when both its objects and morphisms form sets (Small, locally small, and large categories).

[L3]

The full subcategory on a supplied set of objects contains all morphisms between those objects (Subcategory and full subcategory).

[L4]

A limiting cone (L,pS) has a unique mediating map from every cone over the same diagram (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[L5]

An equalizer of f,g:A⇉B is a morphism e:E→A with fe=ge such that every h:X→A with fh=gh factors as h=eu for a unique u:X→E (Equalizers and coequalizers as limits and colimits of a parallel pair).

[L7]

A morphism f:A→B is an isomorphism if there is g:B→A with g∘f=1A and f∘g=1B (Isomorphism, groupoid, and connected category); a morphism is monic when it is left-cancellable (Monomorphism and epimorphism by left and right cancellation).

Proof

technique · constructive
1.1L1L2L3L4construct

Regard S as the full subcategory it spans. Its objects form a set, and by [L2] the union of the hom-sets between them is a set, so this full subcategory is small. By [L1] its inclusion has a limiting cone (L,pS:L→S)S∈S. This remains valid when S is empty: then joint weak initiality implies that C has no objects, so the theorem's hypotheses cannot hold for a category with a target object.

2.1step 1.1choose

Fix one target C. Joint weak initiality supplies some S0∈S and one map h:S0→C, so h∘pS0:L→C exists. The witness is chosen only for this fixed target, not simultaneously for a proper class of targets; hence L is weakly initial.

2.2step 1.1L1L2L4construct

By [L2] the collection C(L,L) is a set, so the one-object category whose arrows are the endomorphisms of L is small, and sending its object to L and each arrow to itself is a diagram. By [L1] that diagram has a limit; write its single leg as j:I→L. The cone condition says exactly that α∘j=j for every α∈C(L,L), and j is monic, since j∘x=j∘y makes x and y both mediate the same cone, so the uniqueness clause of [L4] gives x=y.

3.1step 2.1step 2.2choose

I is weakly initial: for a target C, step 2.1 supplies a map L→C and composing it with j gives I→C. Again one witness is used for one fixed target.

4.1step 2.1step 2.2step 3.1L1L5L6L7discharge-construct∎

Let f,g:I⇉C and let m:K→I be their equalizer, which exists by [L1] and is monic by [L6]; it satisfies fm=gm by [L5]. Step 2.1 gives u:L→K, so j∘m∘u:L→L is an endomorphism of L and step 2.2 gives (j∘m∘u)∘j=j. Rewriting the left side as j∘(m∘u∘j) and cancelling the monomorphism j by [L7] yields m∘u∘j=1I. Hence m is a split epimorphism as well as monic, so m∘(u∘j∘m)=(m∘u∘j)∘m=m=m∘1K and left-cancelling m gives u∘j∘m=1K; thus m is an isomorphism by [L7]. From fm=gm and the invertibility of m we get f=g. There is therefore exactly one morphism I→C for every target C, so I is an initial object of C.

Depends on

Used by

Dependency tree · two levels

15 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