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.

An abelian category is balanced

Statement

If f:A→B in an abelian category is both monic and epic, then f is an isomorphism.

Facts & Assumptions

Given: An abelian category and a morphism f:A→B that is both monic and epic.

[L1]

The kernel of a monomorphism is zero, and the cokernel of an epimorphism is zero (The kernel of a monomorphism is zero and the cokernel of an epimorphism is zero).

[L2]

The cokernel of 0→A is A, and the kernel of B→0 is B (The cokernel of the zero map out of the zero object is the target, and dually for kernels).

[L3]

Every morphism has a canonical factorization A→coim⁡(f)→im⁡(f)→B (The canonical morphism from the coimage to the image exists and is unique).

[L4]

In an abelian category the canonical map coim⁡(f)→im⁡(f) is an isomorphism (Abelian category).

Proof

technique · direct
1.1L1L2L3

Because f is monic and epic, [L1] identifies ker⁡(f) and coker⁡(f) with zero objects. Hence [L2] gives isomorphisms qf:A⟶∼coim⁡(f) and if:im⁡(f)⟶∼B for the coimage projection and image inclusion of f.

2.1L3L4step 1.1∎

By [L4], the middle map f‾:coim⁡(f)→im⁡(f) is an isomorphism. Since f=iff‾qf, step 1.1 shows that f is a composite of three isomorphisms, so f itself is an isomorphism.

Depends on

Used by

Dependency tree · two levels

11 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