1 Definition and basic concepts
A finitely generated algebra is an algebra built from a finite set of elements over a specified base ring or field. The algebra consists of all expressions that can be formed from the chosen generators using the operations of addition, scalar multiplication from the base, and multiplication in the algebra. In commutative settings, this notion is especially important because many familiar objects can be described in this way.
The term is used most often for algebras over commutative rings or fields, where the generators and relations can be studied systematically. The existence of a finite generating set does not by itself determine the algebra completely; the relations among the generators are equally significant.
1.1 Algebra over a ring
An algebra over a ring is a ring equipped with a compatible action of the base ring. This means the elements of the base ring act as scalars, and multiplication in the algebra respects that action. When the base ring is a field, one usually speaks of an algebra over that field.
This framework allows one to view the algebra as a ring with additional structure. The base ring often controls the allowable coefficients in polynomial expressions, while the algebra itself contains the elements generated by those expressions.
1.2 Generating sets
A generating set for an algebra is a collection of elements from which every other element of the algebra can be obtained by algebraic operations. If the algebra is commutative, then every element can be expressed as a polynomial in the generators with coefficients in the base ring. If the algebra is noncommutative, words in the generators may also appear.
Generating sets are not unique. A given algebra may admit many different finite generating sets, some much smaller or more convenient than others. The choice of generators often reflects the intended application.
1.3 Finitely generated as an algebra
An algebra is finitely generated as an algebra if it has a generating set consisting of finitely many elements. This property is stronger than merely being built from a finite amount of data in an informal sense; it means that all elements arise from finitely many generators through algebraic combinations.
In the commutative case, finite generation implies that the algebra can be described using polynomial expressions in finitely many variables, subject to relations. This description is one of the main reasons the concept is so useful in algebra and geometry.
1.4 Comparison with finitely generated modules
Finitely generated algebras and finitely generated modules are related but distinct notions. A finitely generated module is generated by finitely many elements under scalar multiplication and addition only, while an algebra must also be closed under multiplication.
A module may be finitely generated even when its algebraic structure is trivial or absent, whereas an algebra may be finitely generated without being finitely generated as a module over its base ring. The two concepts coincide only in special situations, such as finite-dimensional algebras over a field.
2 Equivalent characterizations
Finitely generated algebras admit several equivalent descriptions, especially in the commutative setting. These characterizations make it possible to move between concrete generators, polynomial presentations, and abstract universal constructions.
2.1 Quotients of polynomial rings
A commutative algebra is finitely generated if and only if it is a quotient of a polynomial ring in finitely many variables by an ideal. Concretely, if an algebra is generated by elements x1, ..., xn, then there is a surjective map from the polynomial ring in these variables onto the algebra.
The kernel of this map records all polynomial relations among the generators. Thus the algebra is completely encoded by a polynomial ring and an ideal of relations.
2.2 Presentations by generators and relations
A presentation by generators and relations specifies an algebra by listing generators and then imposing relations among them. In a finitely generated algebra, this provides a compact way to describe the structure.
Such presentations are especially useful when the algebra is complicated but the relations have a recognizable form. Different presentations may describe isomorphic algebras, and simplifying a presentation is often a central task in algebraic computation.
2.3 Universal properties
Polynomial algebras satisfy a universal property: any assignment of the variables to elements of another algebra extends uniquely to a homomorphism. This property explains why polynomial rings serve as the basic free objects in commutative algebra.
A finitely generated algebra can often be regarded as a quotient of such a free object. The universal property then guarantees that maps out of the algebra are determined by the images of its generators, provided the relations are respected.
2.4 Finite type algebras
The phrase finite type algebra is commonly used as a near synonym for finitely generated algebra, especially in algebraic geometry. In this usage, an algebra of finite type over a base ring is one generated by finitely many elements as an algebra over that ring.
In some contexts, the term emphasizes the geometric role of the algebra, particularly when it appears as a coordinate ring or as part of a scheme-theoretic construction.
3 Examples
Many standard algebras are finitely generated, and these examples illustrate the range of the concept. Some are commutative and geometric, while others arise from linear algebra, group theory, or representation theory.
3.1 Polynomial algebras in finitely many variables
The polynomial ring k[x1, ..., xn] over a field k is the most basic example. It is generated by the variables x1, ..., xn, with no relations beyond those imposed by commutativity.
This algebra is free in the commutative category and serves as the building block for more complicated finitely generated commutative algebras.
3.2 Coordinate rings of affine varieties
If an affine variety is defined by polynomial equations, its coordinate ring is a quotient of a polynomial ring by the ideal of those equations. Such a ring is finitely generated by construction.
These coordinate rings encode the algebraic functions on the variety and provide the bridge between geometric objects and algebraic ones.
3.3 Matrix algebras
The algebra of n by n matrices over a field is finitely generated as an algebra. In fact, it can often be generated by a small number of matrices, depending on the field and the size of the matrices.
Matrix algebras are important examples of noncommutative finitely generated algebras. They illustrate that finite generation does not require commutativity.
3.4 Group algebras with finite generating sets
The group algebra k[G] of a group G over a field k may be finitely generated as an algebra when the group has a finite generating set. In that case, the algebra is generated by the group elements corresponding to those generators.
The structure of such an algebra depends heavily on the group relations, which become algebraic relations in the group algebra.
4 Structural properties
Finite generation places strong constraints on an algebra’s behavior, but many properties still depend on the base ring and on the nature of the relations. Important structural results in commutative algebra often begin with finitely generated algebras.
4.1 Noetherianity
Finitely generated algebras over Noetherian rings are often Noetherian themselves, under suitable hypotheses. This means every ideal is finitely generated, a property that greatly simplifies the study of substructures.
Noetherianity is central because it prevents infinite ascending chains of ideals and supports many foundational arguments in algebra and geometry.
4.1.1 Hilbert basis theorem
Hilbert basis theorem states that if a ring is Noetherian, then a polynomial ring in finitely many variables over that ring is also Noetherian. Since finitely generated commutative algebras are quotients of such polynomial rings, they inherit Noetherianity.
This theorem is one of the major reasons finitely generated algebras are manageable: it guarantees strong finiteness properties at the level of ideals.
4.2 Integral extensions
A finitely generated algebra may contain elements integral over a subring, and such integral dependence is important in understanding its size relative to the base. Integral extensions often appear when algebraic relations have monic polynomial form.
When a finitely generated algebra is also integral over the base ring, it can exhibit behavior closer to a finite module, though the two notions remain distinct. Integral extensions are especially significant in algebraic geometry and commutative algebra.
4.3 Dimension theory
The Krull dimension of a finitely generated commutative algebra is a key invariant. It measures, in a precise algebraic sense, the number of independent parameters needed to describe the algebra.
For coordinate rings of varieties, the dimension corresponds to the geometric dimension of the associated space. Finite generation ensures that this dimension behaves well and can often be analyzed using chains of prime ideals.
4.4 Nilpotent and reduced elements
Finitely generated algebras may contain nilpotent elements, especially when relations force powers of certain elements to vanish. The collection of nilpotent elements forms the nilradical, which is closely related to the ideal-theoretic structure of the algebra.
A reduced algebra has no nonzero nilpotent elements. In the commutative case, studying the reduced quotient often clarifies the underlying geometric object, since nilpotent elements do not contribute to the set of points in the usual geometric picture.
5 Morphisms and homomorphisms
Maps between finitely generated algebras are frequently controlled by the images of a finite set of generators. This makes morphisms easier to describe than in infinite settings.
5.1 Images of finitely generated algebras
The image of a finitely generated algebra under a homomorphism is again finitely generated. Indeed, the image is generated by the images of the original generators, so finiteness is preserved under homomorphic images.
This closure property is one of the basic reasons finitely generated algebras form a robust category for study.
5.2 Surjective algebra maps
A surjective homomorphism from a polynomial ring or another finitely generated algebra often identifies the target as a quotient by the kernel. The kernel is an ideal, or in the noncommutative setting, a two-sided ideal, encoding the relations that collapse under the map.
Surjective maps are therefore the standard mechanism by which finitely generated algebras are presented.
5.3 Subalgebras and generators
A subalgebra of a finitely generated algebra need not itself be finitely generated, although many important subalgebras are. Determining whether a subalgebra is finitely generated can be subtle and depends strongly on the ambient algebra and the nature of the subalgebra.
When a subalgebra is finitely generated, its generators may be chosen among polynomials or combinations of the original generators, but no general simple recipe exists in all cases.
6 Relations to algebraic geometry
Finitely generated commutative algebras are the algebraic counterparts of affine geometric objects. This correspondence is one of the main reasons the notion is so widely used.
6.1 Affine algebraic sets
An affine algebraic set is defined as the common zero locus of a collection of polynomials. The set of all polynomial functions on such a locus is organized by a finitely generated algebra.
Thus geometric questions about points, components, and intersections can be translated into algebraic questions about ideals and quotients.
6.2 Coordinate rings
The coordinate ring of an affine algebraic set records polynomial functions modulo those that vanish on the set. It is typically a finitely generated algebra over the base field.
This ring captures much of the geometry of the set, including its decomposition into irreducible pieces and its singular behavior.
6.3 Affine schemes
In scheme theory, finitely generated algebras give rise to affine schemes. The spectrum of such an algebra packages prime ideals into a topological space with a structure sheaf.
Affine schemes generalize affine varieties and extend the geometric meaning of finite generation beyond classical algebraic geometry.
6.4 Ideals and varieties
Ideals in a polynomial ring correspond to algebraic sets through the vanishing of polynomials, while varieties are the geometric loci obtained from those ideals. The finitely generated algebra obtained by quotienting by an ideal serves as the algebraic model of the variety.
This duality between ideals and varieties is one of the central themes of classical algebraic geometry.
7 Special classes of finitely generated algebras
Different branches of algebra study finitely generated algebras with additional structure. The precise meaning of finite generation depends on whether the algebra is commutative, associative, Lie, or graded.
7.1 Finitely generated commutative algebras
In commutative algebra, finitely generated algebras are often the primary objects of study. They arise as quotients of polynomial rings and are closely tied to ideal theory, dimension, and algebraic geometry.
Their commutative nature allows geometric interpretation and powerful structural theorems.
7.2 Finitely generated associative algebras
An associative algebra is finitely generated if a finite set of elements generates the algebra under addition, scalar multiplication, and associative multiplication. Noncommutative examples are common here, including matrix algebras and various operator algebras.
The study of such algebras often involves words in generators, relations among those words, and representation-theoretic methods.
7.3 Finitely generated Lie algebras
A Lie algebra is finitely generated if finitely many elements generate it under Lie brackets and linear combinations. This notion is central in the theory of symmetries and infinitesimal transformations.
Finite generation in Lie algebras can lead to rich structural consequences, though the behavior differs substantially from the commutative associative case.
7.4 Graded algebras
A graded algebra decomposes into components indexed by degree or another grading set. Finite generation in this setting often means that a finite set of homogeneous elements generates the entire graded algebra.
Graded finite generation is especially useful in invariant theory and geometry, where degree considerations help organize complicated computations.
8 Applications and uses
Finitely generated algebras appear throughout modern algebra and geometry. They provide a workable class of objects for both theoretical results and explicit computation.
8.1 Computation with polynomial ideals
Many computational methods in algebra manipulate finitely generated algebras through generators and relations. Algorithms for ideals, quotients, and normal forms rely on the finite presentation of the algebraic data.
This framework allows concrete calculations that would be impractical in more general infinite settings.
8.2 Elimination theory
Elimination theory studies the process of removing variables from systems of polynomial equations. Finitely generated algebras provide the natural setting for such procedures because quotient rings encode the equations and their consequences.
By working with generators and relations, one can derive equations for projections and intersections of algebraic sets.
8.3 Representation theory
In representation theory, finitely generated algebras often act on vector spaces or modules, and their representations can be studied through finite sets of operators. The algebraic relations among generators determine the corresponding module categories.
This approach is particularly important for matrix algebras, enveloping-type constructions, and algebras defined by quivers and relations.
8.4 Invariant theory
Invariant theory investigates functions unchanged by the action of a group or another symmetry structure. The ring of invariants is often a finitely generated algebra, and its generators describe the basic symmetric quantities.
Finite generation is a major organizing principle in the subject, making it possible to classify invariants and relate them to geometric quotients.