Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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.

Every morphism factors as an epimorphism followed by a monomorphism, uniquely up to unique isomorphism

Statement

Every morphism f:A→B in an abelian category admits a factorization

A⟶efIf⟶mfB

with ef epic and mf monic. If also f=m′e′ with e′ epic and m′ monic, then there is a unique isomorphism u:If→I′ such that

m′=mfu−1,u∘ef=e′.

Facts & Assumptions

Given: An abelian category and a morphism f:A→B.

[L1]
[L2]

The coimage projection is epic and the image inclusion is monic (The coimage projection is epic and the image inclusion is monic).

[L3]

In an abelian category the canonical coimage-to-image map is an isomorphism (Abelian category).

[L4]

Abelian categories are balanced (An abelian category is balanced).

Proof

technique · direct
1.1L1L2L3

Let qf:A→coim⁡(f) and if:im⁡(f)→B be the defining maps. By [L1], f factors as f=iff‾qf, and [L2] makes qf epic and if monic. Since f‾ is an isomorphism by [L3], the composite ef:=f‾qf:A→im⁡(f) is epic, so f=ifef is an epic-monic factorization.

2.1L2L5step 1.1

Suppose also f=m′e′ with e′ epic and m′ monic. Then coker⁡(m′)f=0, so coker⁡(m′)ifef=0, and the epicity of ef gives coker⁡(m′)if=0. Since m′ is a kernel of its cokernel by [L5], if factors uniquely through m′ as if=m′u. Reversing the roles of if and m′ gives m′=ifv for a unique v.

3.1L4step 2.1∎

From step 2.1 one gets m′=m′uv and if=ifvu, so monicity gives uv=1 and vu=1. Thus u is an isomorphism. Finally, m′uef=ifef=f=m′e′, and monicity of m′ gives uef=e′. Any other comparison map with the same property equals u by the uniqueness in step 2.1.

Depends on

Used by

Dependency tree · two levels

13 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