Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge 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.

Subalgebra generated by a subset, algebras of finite type, and module-finite algebras

Definition

Let R be a commutative ring and let A be a commutative R-algebra with structure map ηA ⁣:RA (Algebras over a commutative ring, central structure maps, and algebra homomorphisms).

The subalgebra generated by finitely many elements. Let nN and a1,,anA. Iterating the universal property of a polynomial ring (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism) along the recursion R[x1,,xk+1]=R[x1,,xk][xk+1] of Polynomial rings in finitely many commuting indeterminates by iteration gives a unique unital ring homomorphism

ev ⁣:R[x1,,xn]A

that agrees with ηA on constants and sends xi to ai for each i; at each step of the recursion the one-variable universal property supplies existence and uniqueness of the extension, and at n=0 the map is ηA itself. Its image is written R[a1,,an] and is called the R-subalgebra of A generated by a1,,an. It is a subring of A containing ηA(R), and it is the smallest such subring containing a1,,an, since any subring with those properties is closed under the sums and products that make up a polynomial expression. At n=0 it is ηA(R), the image of R in A.

Finite type. A is of finite type over R, equivalently a finitely generated R-algebra, when A=R[a1,,an] for some nN and some a1,,anA. Equivalently, A is isomorphic as an R-algebra to a quotient R[x1,,xn]/a for some nN and some ideal a: the map ev above is then surjective, and First isomorphism theorem for rings: R/kerfimf identifies A with R[x1,,xn]/kerev; conversely the composite of the canonical projection with the inclusion of the indeterminates exhibits any such quotient as generated by the residues of x1,,xn.

Module-finite. A is module-finite over R, equivalently a finite R-algebra, when A is finitely generated as an R-module (Generated submodule, cyclic and finitely generated modules, module basis and free module) for the action ra=ηA(r)a.

Module-finite implies finite type. If b1,,bn generate A as an R-module then R[b1,,bn], being a subring of A that contains ηA(R) and every bi, contains every R-linear combination iηA(ri)bi and hence all of A; so A=R[b1,,bn]. The converse fails, and the companion examples page carries a witness.

Remarks

  • Three conditions, three rings. "Finitely generated" is ambiguous on its own: an ideal may be finitely generated as an ideal, a module as a module, and an algebra as an algebra, and the three are different requirements. This page writes "of finite type" for the algebra condition and "module-finite" for the module condition, and always names the ring over which the condition is taken. Sources differ in vocabulary: Totaro and Milne write "finite algebra" for what is called module-finite here, and Altman–Kleiman write "module finite" and "algebra finite".

  • The generators need not be algebraically independent. Nothing above asks ev to be injective. When it is, A is a polynomial ring and the ideal a is zero; that is a special case, not the definition.

  • The empty list is allowed and is not the same as A=R. At n=0 the subalgebra generated is ηA(R), which is a quotient of R rather than a copy of it unless ηA is injective.

Depends on

Used by

Dependency tree · two levels

19 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