Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-08 (gpt-5.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 generation, ACC, and maximal-condition characterizations of Noetherian modules

Statement

For a left R-module M, consider:

  1. Every submodule is finitely generated: M is Noetherian (Noetherian modules: every submodule is finitely generated).
  2. Every ascending sequence N0⊆N1⊆⋯ of submodules eventually stabilizes (ACC).
  3. Every nonempty set of submodules has a maximal member under inclusion.

The implications 1⇒2 and 3⇒1 are choice-free. Assuming Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain), 2⇒3 also holds, so all three conditions are equivalent.

Facts & Assumptions

Given: A left R-module M and conditions 1–3 above. Dependent Choice is assumed only for 2⇒3.

[L1]

Finite generation means generation by a finite set; the generated submodule is the smallest submodule containing that set (Noetherian modules: every submodule is finitely generated, Generated submodule, cyclic and finitely generated modules, module basis and free module).

[L2]

A nonempty subset is a submodule if it is closed under ru+v for scalars r and its elements u,v (The one-step submodule criterion; intersections and sums of submodules are submodules).

[L3]

Under DC, every entire relation on a nonempty set admits a function from N following the relation from a prescribed starting point (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

Proof

technique · direct
1.1L1L2given

Assume condition 1 and let (Nn) be ascending. The union N:=⋃nNn contains zero. Any two of its elements lie in a common stage, so their combination ru+v lies there too. Thus N is a submodule by [L2]. By condition 1, N has a finite generating set S. A finite subset of this ascending union lies in one stage: start with stage zero for the empty set, and when adjoining one element take the larger of the previous stage and a stage containing that element. Hence S⊆Nk for some k, so N=⟨S⟩R⊆Nk⊆N. For n≥k, Nk⊆Nn⊆N=Nk. This proves condition 2 without countably many choices.

1.2L3given

Assume condition 2 and DC. Let F be a nonempty set of submodules. If it has no maximal member, the relation ARB defined by A⊊B is entire on F. Fix A0∈F. By [L3] there is a sequence (An) in F with An⊊An+1 for every n, contrary to condition 2. Thus F has a maximal member, proving condition 3.

1.3L1given

Assume condition 3 and fix a submodule N≤M. Its finitely generated submodules form a set G containing the zero submodule, generated by the empty set. Condition 3 gives a maximal L∈G. Fix a finite generating set S of L. If L≠N, an element x∈N∖L makes ⟨S∪{x}⟩R a finitely generated submodule of N strictly containing L, a contradiction. Hence L=N, proving condition 1 without DC.

2.1step 1.1step 1.2step 1.3∎

Steps 1.1, 1.2 and 1.3 prove the stated implications. Only step 1.2 uses DC.

Depends on

Used by

Dependency tree · two levels

14 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