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:
The following implications hold.
- If is surjective and are injective, then is injective.
- If are surjective and is injective, then is surjective.
Facts & Assumptions
Given: The diagram in the statement, with both rows exact.
Diagram: , , , , , , , , , , , , .
(given).
(given).
(given).
(given).
Exactness identifies the kernel of each horizontal arrow with the image of the preceding horizontal arrow (Exact sequences and short exact sequences of modules).
Injectivity and surjectivity have their elementwise meanings (Injection, surjection, bijection).
Proof
Assume is surjective and are injective, and let satisfy . Then [C3] gives , so injectivity of gives .
Assume are surjective and is injective, and let . By surjectivity of , choose with .
Exactness gives with . By [C2], , so exactness gives with .
By [C4], ; injectivity of gives . Exactness gives with .
Surjectivity of gives for some . Then [C1] gives ; injectivity of gives , and exactness gives . Thus is injective.
Now by [C3], so exactness gives with . Surjectivity of gives ; then [C2] yields . Thus is surjective.
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.
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
- A. Kleshchev, Lectures on Abstract Algebra for Graduate Students, sections 3.6, 3.14, and 3.15 (standard reference, not scraped)
- The Stacks Project, Algebra (standard reference, not scraped)
- P. Hekmati, Homological Algebra, section 3.1 (standard reference, not scraped)