In
mathematics, a finitely generated algebra (also called an algebra of finite type) is a
commutative
In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Most familiar as the name o ...
associative algebra ''A'' over a
field ''K'' where there exists a finite set of elements ''a''
1,...,''a''
''n'' of ''A'' such that every element of ''A'' can be expressed as a
polynomial
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An ex ...
in ''a''
1,...,''a''
''n'', with
coefficient
In mathematics, a coefficient is a multiplicative factor in some term of a polynomial, a series, or an expression; it is usually a number, but may be any expression (including variables such as , and ). When the coefficients are themselves ...
s in ''K''.
Equivalently, there exist elements
s.t. the evaluation homomorphism at
:
is
surjective; thus, by applying the
first isomorphism theorem,
.
Conversely
In logic and mathematics, the converse of a categorical or implicational statement is the result of reversing its two constituent statements. For the implication ''P'' → ''Q'', the converse is ''Q'' → ''P''. For the categorical proposit ...
,
for any
ideal