Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedSession-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.

Module finiteness is transitive along a tower of algebras

Statement

Let φ ⁣:AB be a homomorphism of commutative rings, so that B is an A-algebra (Algebras over a commutative ring, central structure maps, and algebra homomorphisms) and every B-module becomes an A-module through az:=φ(a)z. Suppose B is generated as an A-module by b1,,bm with mN, and let M be a B-module generated as a B-module by u1,,un with nN. Then the mn products biuj generate M as an A-module.

In particular, if ψ ⁣:BC is a homomorphism of commutative rings making C module-finite over B, and B is module-finite over A, then C is module-finite over A (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras): the products ψ(bi)cj of a finite A-generating list of B with a finite B-generating list of C generate C over A.

Facts & Assumptions

Given: Commutative rings A and B, a ring homomorphism φ ⁣:AB, a finite A-module generating list b1,,bm of B, a B-module M and a finite B-module generating list u1,,un of M.

[L1]

An R-algebra is a unital ring A with a unital ring homomorphism ηA ⁣:RA of central image, and the induced scalar action ra:=ηA(r)a makes A an R-module (Algebras over a commutative ring, central structure maps, and algebra homomorphisms).

[L2]

A is module-finite over R when it is finitely generated as an R-module (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras).

[L3]

A left R-module is an abelian group 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]

For a ring R, a left R-module M and SM, the submodule SR is the set of finite sums i=1krisi with kN, riR and siS, the term with k=0 being 0M (The submodule generated by a subset consists of the finite R-linear combinations of that subset).

Proof

technique · direct
1.1

The A-action on M is az=φ(a)z, computed in the B-module M; it satisfies the module axioms because φ is a ring homomorphism and M is a B-module. Each product biuj is an element of M.

L1L3given
2.1

Let zM. Since u1,,un generate M over B, the finite-sum description gives β1,,βnB with z=j=1nβjuj. Since b1,,bm generate B over A, the same description gives, for each j, elements α1j,,αmjA with βj=i=1mφ(αij)bi.

L4step 1.1
3.1

Substituting and using the B-module axioms, z=j=1n(i=1mφ(αij)bi)uj=i=1mj=1nφ(αij)(biuj)=i,jαij(biuj), an A-linear combination of the mn products. As z was arbitrary, those products generate M as an A-module. Taking M=C with its B-module structure gives the transitivity statement.

L2L3L4step 2.1algebra

Remarks

  • Both degenerate cases collapse rather than fail. If m=0 then B is generated over A by the empty list, so B=0 and 1B=0B; every B-module then satisfies z=1Bz=0, so M=0 and the empty set of products generates it. If n=0 then M=0 directly. The count mn is 0 in both cases, which is the correct answer.

  • The products need not be distinct or independent. The list biuj may repeat entries and may be far from minimal; only the finiteness of the count is used.

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