Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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 submodule generated by a subset consists of the finite R-linear combinations of that subset

Statement

Let R be a ring, let M be a left R-module and let SM. Then the submodule generated by S (Generated submodule, cyclic and finitely generated modules, module basis and free module) is the set of finite R-linear combinations of elements of S:

SR  =  {i=1krisi  :  kN, r1,,rkR, s1,,skS},

where the term with k=0 is the empty sum 0M. In particular R=0. Commutativity of R is not used, and the elements s1,,sk are not required to be distinct.

Facts & Assumptions

Given: A ring R, a left R-module M and a subset SM. Write L for the set displayed in the Statement.

[L1]

The submodule generated by S is SR:={NM:SN}, the family being nonempty because MM; thus SR is the smallest submodule of M containing S (Generated submodule, cyclic and finitely generated modules, module basis and free module).

[L2]

For a left R-module M, a nonempty subset NM is a submodule if and only if ru+vN for all rR and u,vN (The one-step submodule criterion; intersections and sums of submodules are submodules).

[L3]

A left R-module is an abelian group (M,+,0M) with an action satisfying r(m+n)=rm+rn, (r+s)m=rm+sm, (rs)m=r(sm) and 1Rm=m (Unital left and right modules over a ring; unqualified module means left module).

[L4]

In a commutative ring, (S) consists of finite sums risi, and (a)=Ra (In a commutative ring, (S) consists of finite sums risi, and (a)=Ra).

Proof

technique · direct
1.1

Let L be the set of all sums i=1krisi with kN, r1,,rkR and s1,,skS, the value at k=0 being the empty sum 0M; in particular 0ML, so L is nonempty even when S is empty.

L1given
2.1

Every sS lies in L, being the one-term sum 1Rs, which equals s by the unitality axiom of a module; hence SL.

L3step 1.1given
2.2

L is a submodule of M: it is nonempty, and for rR and u=i=1krisi, v=j=1mtjuj in L the element ru+v is the sum i=1k(rri)si+j=1mtjuj, again a finite R-linear combination of elements of S with k+m terms, so ru+vL and the submodule criterion applies.

L2L3step 1.1algebra
2.3

Every submodule NM with SN contains L: each si lies in N, so repeated use of the submodule criterion [L2] puts every risi and every finite sum of those elements in N; the case k=0 gives 0MN.

L2step 1.1algebra
3.1

SR=L: by steps 2.1 and 2.2 the set L is one of the submodules over which the intersection defining SR runs, so SRL; and SR is itself a submodule containing S, so step 2.3 applied to it gives LSR.

L1step 2.1step 2.2step 2.3
4.1

Two consequences follow by reading the description at its extreme cases. Taking S= leaves only the empty sum, so R=0. Taking M to be the regular module over a commutative R, where the submodules are the ideals, the description becomes the finite-sum description of the ideal generated by S, so the two agree and this lemma extends that one from ideals to modules rather than competing with it.

L4step 3.1algebra

Remarks

  • Unitality is where the containment SSR comes from. Step 2.1 writes s=1Rs, which is available because Unital left and right modules over a ring; unqualified module means left module builds 1Rm=m into the definition of a module. Over a non-unital action the set of finite R-linear combinations need not contain S, and then it is not the generated submodule.

  • No finiteness is assumed of S. Each element of SR carries its own finite list of coefficients and elements; different elements may use different lists, and no bound on the length is claimed.

Depends on

Used by

Dependency tree · two levels

13 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