Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Four lemma in an abelian category

Statement

Consider a commutative diagram in an abelian category with exact rows

WXYZW0X0Y0Z0:®¯°±

Then:

  1. if α and γ are epic and δ is monic, then β is epic;
  2. if β and δ are monic and α is epic, then γ is monic.

Facts & Assumptions

Given: The commutative exact-row diagram in the statement.

[L1]

Monicity is equivalent to cancellation on members (Monicity by member cancellation).

[L2]

Epicity is equivalent to the member-lifting property (Epimorphy is detected by members).

[L3]

Exactness at a node is equivalent to the member-lifting condition (Exactness is detected by members).

[L4]

The common-refinement construction for member equivalence puts finitely many witness equalities on one epic domain, where hom-set subtraction is defined (Equivalence of members, Member equivalence is transitive, Abelian category).

Proof

technique · direct
1.1

Write the top row as WiXjYpZ and the bottom row as WiXjYpZ. Assume that α and γ are epic and that δ is monic. To prove that β is epic, let x be a member of X. Since γ is epic, [L2] gives a member y of Y with γyjx. Then δpy=pγypjx0. Because δ is monic, [L1] gives py0. Exactness of the top row at Y now gives a member x0 of X with jx0y by [L3].

L1L2L3assume-hypconstruct
1.2

Assume instead that β and δ are monic and that α is epic. To prove that γ is monic, let y and y be members of Y with γyγy. Then δpy=pγypγy=δpy, so [L1] gives pypy. By [L4], replace y and y by representatives on one common epic refinement of the witnesses for both equalities and define t:=yy. Then γt=pt=0 and y=y+t on that domain. Exactness of the top row at Y gives a member x of X with jxt by [L3].

L1L3L4assume-hypchooseconstructalgebra
2.1

From step 1.1 we get jβx0=γjx0γyjx. By [L4], replace βx0 and x by representatives on a common epic domain and define z:=xβx0. Then jz=0 and x=βx0+z on that domain. Exactness of the bottom row at X gives a member w of W with iwz by [L3], and epicity of α gives a member w of W with αww by [L2]. Therefore β(x0+iw)βx0+iαwβx0+iwβx0+zx. So every member of X lifts along β, and [L2] makes β epic.

L2L3L4step 1.1chooseconstructalgebra
2.2

From step 1.2 we get jβx=γjxγt0. Exactness of the bottom row at X therefore gives a member w of W with iwβx by [L3]. Because α is epic, [L2] gives a member w of W with αww. Then β(xiw)βxiαwβxiw0. Since β is monic, [L1] yields xiw. Therefore tjxjiw0, because the top row is a complex. So yy, and [L1] makes γ monic.

L1L2L3step 1.2algebra
3.1

Therefore the four lemma holds in both the epic and the monic form stated above.

step 1.2step 2.2

Depends on

Used by

Dependency tree · two levels

20 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