Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedverified 2026-09-26 (gpt-6-sol)
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.

Finite modules over Noetherian rings are Noetherian

Statement

Let R be a Noetherian commutative ring and let M be a finitely generated R-module. Then M is a Noetherian R-module.

Facts & Assumptions

Given: A Noetherian commutative ring R and a finitely generated R-module M.

[L1]

Noetherianity means that every ideal, and more generally every submodule in question, is finitely generated (Noetherian commutative rings and modules).

[L2]

The quotient module M/N is defined for every submodule N≤M (Quotient module M/N with scalar multiplication on additive cosets).

[L3]

Cyclic and finitely generated modules are those generated by one or finitely many elements (Generated submodule, cyclic and finitely generated modules, module basis and free module).

Proof

technique · direct
1.1L1L3construct

First suppose M is cyclic, say M=Rx. Let N≤M be a submodule and put I:={r∈R:rx∈N}. Then I is an ideal of R, so [L1] gives generators r1,…,rs for I. Every element of N has the form rx with r∈I, hence lies in the submodule generated by r1x,…,rsx. Thus every submodule of a cyclic module is finitely generated, so every cyclic module over R is Noetherian.

2.1step 1.1L1L2L3

If M=0, its only submodule is 0, generated by the empty set, so it is Noetherian. Otherwise let M=⟨x1,…,xn⟩R with n≥1, and argue by induction on n. The base case n=1 is step 1.1. For n>1, set M′:=⟨x1,…,xn−1⟩R. Then M/M′ is cyclic, generated by xn+M′, so step 1.1 makes M/M′ Noetherian. By the induction hypothesis, M′ is Noetherian.

3.1step 2.1L1L2choosealgebra

For the induction step n>1, let N≤M. Since M′ is Noetherian, the submodule N∩M′ is finitely generated. Since M/M′ is Noetherian, the image (N+M′)/M′≤M/M′ is finitely generated; choose lifts y1,…,yt∈N of its generators. Every element of N differs from an R-linear combination of the yi by an element of N∩M′, so N is generated by those yi together with generators of N∩M′. Thus every submodule of M is finitely generated.

4.1step 1.1step 2.1step 3.1L1∎

The zero case is in step 2.1, the one-generator case in step 1.1, and step 3.1 completes the induction for all remaining finite generating lists. Therefore M is Noetherian.

Depends on

Used by

Dependency tree · two levels

11 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