Alphabeta Math
CorollaryStatement: AI-generatedProof: AI-generatedprecheck passaudited 2026-09-01
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.

In a cartesian closed category, any initial object is strict

Statement

Let C be a cartesian closed category and let 0 be an initial object. Then 0 is strict: every morphism f:A0 is an isomorphism.

Facts & Assumptions

Given: A cartesian closed category C, an initial object 0, an object A, and a morphism f:A0.

[L1]

In a cartesian closed category, the functor A× is a left adjoint for every A (Cartesian closed category).

[L2]

Left adjoints preserve colimits, hence preserve initial objects (Left adjoints preserve every colimit that exists).

[L3]

An initial object has exactly one endomorphism and exactly one map into any target (Initial object, terminal object, and zero object).

Proof

technique · direct
1.1

By [L1] and [L2], the functor A× preserves the initial object, so A×0 is initial. Hence there is an isomorphism e:A×00.

givenL1L2
2.1

The pair (1A,f) induces a morphism 1A,f:AA×0. Let g:=π1e1:0A, where π1:A×0A is the first projection. Then gf=π1e1e1A,f=π11A,f=1A.

step 1.1givenalgebra
3.1

The composite fg:00 is the unique endomorphism of the initial object, so by [L3] it equals 10. Thus g is a two-sided inverse to f, and f is an isomorphism.

step 2.1L3
4.1

Therefore the initial object is strict.

step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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