Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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.

Submodules of finite modules over a Noetherian ring are finite by induction

Statement

If R is a commutative Noetherian ring, M is a finitely generated R-module and N⊆M is a submodule, then N is finitely generated. This finite-list proof uses no choice axiom.

Facts & Assumptions

Given: a commutative Noetherian ring R, a finitely generated R-module M and a submodule N≤M.

[L1]

A ring is left Noetherian when its left regular module is Noetherian, and in the commutative case no side distinction occurs (Left and right Noetherian rings).

[L2]

A module is Noetherian when every submodule of it is finitely generated, a submodule being a subgroup closed under scalars (Noetherian modules: every submodule is finitely generated, Submodule of a module).

[L3]

For a module M, the submodule ⟨S⟩R generated by a set S is the smallest submodule containing S, and M is finitely generated when M=⟨m1,…,mn⟩R for finitely many elements; the free module R(X) on a set X has standard basis (ex)x∈X and every element has a unique expression ∑x∈Frxex, addition and scalar multiplication being coefficientwise (Generated submodule, cyclic and finitely generated modules, module basis and free module, The free module on a set and its standard basis, The direct sum of an indexed family of modules).

[L4]

For every set map u:X→M into a module M there is a unique homomorphism of R-modules R(X)→M sending ex↦u(x), namely ∑xrxex↦∑xrxu(x) (Universal property of the free module on a set).

[L5]

A function f:M→N is a module homomorphism when it is additive and f(rm)=rf(m); its kernel and image are then submodules of M and N respectively (Module homomorphism and isomorphism, kernel, image and cokernel, Kernels and images of module homomorphisms are submodules, and injectivity is equivalent to trivial kernel).

[L6]

The regular left module RR has action r⋅x=rx. A subset is its submodule exactly when it is an additive subgroup closed under multiplication by every r∈R, which is exactly the definition of a left ideal; in a commutative ring this is an ideal. The ideal (S) is the smallest ideal containing S (Left and right Noetherian rings, Unital left and right modules over a ring; unqualified module means left module, Submodule of a module, Left, right and two-sided ideals, The ideal generated by a subset and principal ideals).

Proof

technique · direct
1.1

We show first that for every n∈N and the set Xn:={1,…,n} every submodule P≤R(Xn) is finitely generated, by induction on n. For n=0 the module R(∅)=0 has {0}=⟨∅⟩R as its only submodule, so the claim holds. Let n≥1 and suppose the claim known for n−1. The coordinate map π:R(Xn)→R, π(∑i∈Friei):=rn, is well defined by uniqueness of the expressions in [L3] and is a module homomorphism, because the expressions of f+g and rf have coefficientwise entries. Hence π(P) is a submodule of the regular module RR, that is an ideal of R by [L6], and since R is Noetherian [L1] and [L2] provide a finite generating list π(P)=⟨a1,…,ar⟩R; choose p1,…,pr∈P with π(pj)=aj for each j, a selection from a finite list. Similarly ker⁡π={f:fn=0} is the image of R(Xn−1) under the coefficientwise inclusion, and P∩ker⁡π corresponds to a submodule Q≤R(Xn−1), which is finitely generated by the induction hypothesis, say Q=⟨q1,…,qs⟩R; let q1′,…,qs′ be the corresponding elements of P∩ker⁡π. Then P=⟨p1,…,pr,q1′,…,qs′⟩R: it contains the displayed elements, and for p∈P the element π(p)=∑jλjaj with λj∈R satisfies π(p−∑jλjpj)=0, so p−∑jλjpj=∑kμkqk′ for some μk∈R by [L3]. This completes the induction.

L1L2L3L6baseinductiondischarge-induction: case n=0
2.1

Let m1,…,mn∈M satisfy M=⟨m1,…,mn⟩R, as exists by finite generation of M [L3]. By [L4] the set map ei↦mi on the standard basis of R(Xn) extends to a homomorphism φ:R(Xn)→M. Its image is a submodule of M by [L5] containing each mi, hence containing ⟨m1,…,mn⟩R=M by [L3], so φ(φ−1(N))=N and φ is surjective. The preimage φ−1(N) is a submodule of R(Xn): it is nonempty because 0 maps to 0∈N, and it is closed under addition and under scalars because φ is additive and R-linear and N is a submodule. By step 1.1 it is finitely generated, say φ−1(N)=⟨u1,…,ut⟩R. Then N=⟨φ(u1),…,φ(ut)⟩R: each φ(ui) lies in N, and for y∈N surjectivity gives u∈R(Xn) with φ(u)=y, so u∈φ−1(N); writing u=∑iλiui with λi∈R by [L3] and applying φ expresses y=∑iλiφ(ui).

L3L4L5step 1.1
3.1

Combining steps 1.1 and 2.1, every submodule N of a finitely generated module M over a commutative Noetherian ring R is generated by the finite list φ(u1),…,φ(ut); equivalently, the module M is Noetherian in the sense of [L2]. The only selections used were from finite lists: the finite generating list of M, the finite lists of generators of π(P), the generators of the finitely many submodules met in the induction, and the finitely many lifts pj; the induction runs on N. Hence no choice principle is used.

L1L2step 1.1step 2.1∎

Depends on

Used by

Dependency tree · two levels

24 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