Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28
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.

The canonical morphism from the coimage to the image exists and is unique

Statement

Let f:A→B be a morphism in a category with kernels and cokernels. Write qf:A→coim⁡(f) for the coimage projection and if:im⁡(f)→B for the image inclusion. Then there exists a unique morphism

f‾:coim⁡(f)→im⁡(f)

such that

if∘f‾∘qf=f.

Facts & Assumptions

Given: A morphism f:A→B, its coimage projection qf, and its image inclusion if.

[L1]

The morphism f factors uniquely through its coimage (A morphism factors uniquely through its coimage).

[L2]

The morphism f factors uniquely through its image (A morphism factors uniquely through its image).

Proof

technique · direct
1.1L1L2L3

By [L1], there is a unique morphism f~:coim⁡(f)→B with f~qf=f. Let cf:B→Cf be a cokernel of f. Then cff~qf=cff=0, and [L3] makes qf epic, so cff~=0. Because if:im⁡(f)→B is a kernel of cf, there is a unique map f‾:coim⁡(f)→im⁡(f) with iff‾=f~.

2.1L1L2L3step 1.1∎

Composing the identity of step 1.1 with qf gives iff‾qf=f~qf=f, so f‾ has the required property. If another map u:coim⁡(f)→im⁡(f) also satisfies ifuqf=f, then ifu=f~ by the epicity of qf from [L3], and the uniqueness of the kernel factorization in step 1.1 gives u=f‾.

Depends on

Used by

Dependency tree · two levels

6 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