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 endpoints of a short exact sequence encode injectivity and surjectivity

Statement

For a module homomorphism f:A→B, the sequence 0→A→fB is exact at A if and only if f is injective. The sequence A→fB→0 is exact at B if and only if f is surjective. Consequently 0→A→iB→pC→0 is short exact if and only if i is injective, p is surjective, and im⁡i=ker⁡p.

Facts & Assumptions

Given: Module homomorphisms f:A→B, i:A→B, and p:B→C.

[F1]

Exactness at a term means equality of the incoming image and outgoing kernel (Exact sequences and short exact sequences of modules).

[F2]

Injective means equal images have equal inputs, and surjective means every target element has a preimage (Injection, surjection, bijection).

[L1]

Proof

technique · direct
1.1

The zero map 0→A has image {0}, so by [F1] the sequence 0→A→fB is exact at A exactly when ker⁡f={0}, which is equivalent to injectivity by [L1].

F1L1
1.2

The zero map B→0 has kernel B, so by [F1] the sequence A→fB→0 is exact at B exactly when im⁡f=B, which is equivalent to surjectivity by [F2].

F1F2
2.1

A four-term sequence 0→A→iB→pC→0 is exact at A,B,C exactly when the endpoint conditions of steps 1.1 and 1.2 hold and im⁡i=ker⁡p holds at B.

step 1.1step 1.2F1
3.1

This proves both endpoint equivalences and both directions of the short-exact characterization.

step 1.1step 1.2step 2.1∎

Depends on

Used by

Dependency tree · two levels

10 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