Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

Every surjective endomorphism of a Noetherian module is injective

Statement

Every surjective endomorphism of a Noetherian module is injective, hence an automorphism. See Finite generation, ACC, and maximal-condition characterizations of Noetherian modules.

Facts & Assumptions

Given: The hypotheses and objects in the Statement.

[L1]

For a left R-module M, the following are equivalent: every submodule is finitely generated; every ascending chain of submodules stabilizes; and every nonempty family of submodules has a maximal member. The implication from ACC to the maximal condition uses dependent choice; the other displayed implications are choice-free. (Finite generation, ACC, and maximal-condition characterizations of Noetherian modules).

[L2]

For a left R-module M, define End⁡R(M):=Hom⁡R(M,M). Addition is pointwise and multiplication is composition, (fg)(m):=f(g(m)). The ring laws and the identity endomorphism are established in prop-endomorphisms-form-a-ring. (The endomorphism ring End⁡R(M) under addition and composition).

Proof

technique · direct
1.1L1L2givenalgebra

For a surjective endomorphism f, the ascending chain ker⁡f⊆ker⁡f2⊆⋯ stabilizes.

2.1step 1.1givenalgebra

Choose n with ker⁡fn=ker⁡fn+1. For x∈ker⁡f, surjectivity of fn gives y with fn(y)=x. Then fn+1(y)=0, so y∈ker⁡fn+1=ker⁡fn and x=fn(y)=0.

3.1step 2.1givenalgebra∎

The zero module is admitted: its only endomorphism is the identity, which is injective, so the conclusion holds there and the argument of step 2.1 is not vacuous by accident. This proves the stated claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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