Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13
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 injective and surjective Four Lemmas

Statement

Consider a commutative diagram of module homomorphisms with exact rows:

ABCDEA0B0C0D0E0uavbwcxdeu0v0w0x0

The following implications hold.

  1. If a is surjective and b,d are injective, then c is injective.
  2. If b,d are surjective and e is injective, then c is surjective.

Facts & Assumptions

Given: The diagram in the statement, with both rows exact.

Diagram: u ⁣:A→B, v ⁣:B→C, w ⁣:C→D, x ⁣:D→E, u′ ⁣:A′→B′, v′ ⁣:B′→C′, w′ ⁣:C′→D′, x′ ⁣:D′→E′, a ⁣:A→A′, b ⁣:B→B′, c ⁣:C→C′, d ⁣:D→D′, e ⁣:E→E′.

[C1]

b∘u=u′∘a (given).

[C2]

c∘v=v′∘b (given).

[C3]

d∘w=w′∘c (given).

[C4]

e∘x=x′∘d (given).

[F1]

Exactness identifies the kernel of each horizontal arrow with the image of the preceding horizontal arrow (Exact sequences and short exact sequences of modules).

[F2]

Injectivity and surjectivity have their elementwise meanings (Injection, surjection, bijection).

Proof

technique · direct
1.1

Assume a is surjective and b,d are injective, and let z∈C satisfy c(z)=0. Then [C3] gives d(w(z))=w′(c(z))=0, so injectivity of d gives w(z)=0.

assume-hypC3F2
1.2

Assume b,d are surjective and e is injective, and let z′∈C′. By surjectivity of d, choose q∈D with d(q)=w′(z′).

assume-hypF2choose
2.1

Exactness gives y∈B with v(y)=z. By [C2], v′(b(y))=c(v(y))=0, so exactness gives y′∈A′ with u′(y′)=b(y).

step 1.1C2F1choose
2.2

By [C4], e(x(q))=x′(d(q))=x′w′(z′)=0; injectivity of e gives x(q)=0. Exactness gives z∈C with w(z)=q.

step 1.2C4F1F2choose
3.1

Surjectivity of a gives y′=a(t) for some t∈A. Then [C1] gives b(y−u(t))=0; injectivity of b gives y=u(t), and exactness gives z=v(y)=v(u(t))=0. Thus c is injective.

step 2.1C1F1F2choose
3.2

Now w′(c(z)−z′)=d(w(z))−w′(z′)=0 by [C3], so exactness gives y′∈B′ with v′(y′)=c(z)−z′. Surjectivity of b gives y′=b(y); then [C2] yields c(z−v(y))=z′. Thus c is surjective.

step 1.2step 2.2C2C3F1F2choose
4.1

Steps 1.1, 2.1, and 3.1 prove the injective Four Lemma, while steps 1.2, 2.2, and 3.2 prove the surjective Four Lemma.

step 3.1step 3.2∎

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