Finitely generated algebra

In mathematics, a finitely generated algebra (also called an algebra of finite type) is a commutative associative algebra over a field where there exists a finite set of elements of such that every element of can be expressed as a polynomial in , with coefficients in .

Equivalently, there exist elements such that the evaluation homomorphism at

is surjective; thus, by applying the first isomorphism theorem, .

Conversely, for any ideal is a -algebra of finite type, indeed any element of is a polynomial in the cosets with coefficients in . Therefore, we obtain the following characterisation of finitely generated -algebras[1]

is a finitely generated -algebra if and only if it is isomorphic as a -algebra to a quotient ring of the type by an ideal .

If it is necessary to emphasize the field K then the algebra is said to be finitely generated over K. Algebras that are not finitely generated are called infinitely generated.

  1. ^ Kemper, Gregor (2009). A Course in Commutative Algebra. Springer. p. 8. ISBN 978-3-642-03545-6.