In mathematics, Hilbert's syzygy theorem is one of the three fundamental theorems about polynomial rings over fields, first proved by David Hilbert in 1890, which were introduced for solving important open questions in invariant theory, and are at the basis of modern algebraic geometry. The two other theorems are Hilbert's basis theorem that asserts that all ideals of polynomial rings over a field are finitely generated, and Hilbert's Nullstellensatz, which establishes a bijective correspondence between affine algebraic varieties and prime ideals of polynomial rings.
Hilbert's syzygy theorem concerns the relations, or syzygies in Hilbert's terminology, between the generators of an ideal, or, more generally, a module. As the relations form a module, one may consider the relations between the relations; the theorem asserts that, if one continues in this way, starting with a module over a polynomial ring in n indeterminates over a field, one eventually finds a zero module of relations, after at most n steps.
Hilbert's syzygy theorem is now considered to be an early result of homological algebra. It is the starting point of the use of homological methods in commutative algebra and algebraic geometry.
The syzygy theorem first appeared in Hilbert's seminal paper "Über die Theorie der algebraischen Formen" (1890). The paper is split into five parts: part I proves Hilbert's basis theorem over a field, while part II proves it over the integers. Part III contains the syzygy theorem (Theorem III), which is used in part IV to discuss the Hilbert polynomial. The last part, part V, proves finite generation of certain rings of invariants. Incidentally part III also contains a special case of the Hilbert–Burch theorem.
syzygy (mathematics)
Originally, Hilbert defined syzygies for ideals in polynomial rings, but the concept generalizes trivially to (left) modules over any ring.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Explores polynomial optimization, emphasizing SOS and nonnegative polynomials, including the representation of polynomials as quadratic functions of monomials.
In linear algebra, a linear relation, or simply relation, between elements of a vector space or a module is a linear equation that has these elements as a solution. More precisely, if are elements of a (left) module M over a ring R (the case of a vector space over a field is a special case), a relation between is a sequence of elements of R such that The relations between form a module. One is generally interested in the case where is a generating set of a finitely generated module M, in which case the module of the relations is often called a syzygy module of M.
In mathematics, and more specifically in homological algebra, a resolution (or left resolution; dually a coresolution or right resolution) is an exact sequence of modules (or, more generally, of s of an ), which is used to define invariants characterizing the structure of a specific module or object of this category. When, as usually, arrows are oriented to the right, the sequence is supposed to be infinite to the left for (left) resolutions, and to the right for right resolutions.
In ring theory and homological algebra, the global dimension (or global homological dimension; sometimes just called homological dimension) of a ring A denoted gl dim A, is a non-negative integer or infinity which is a homological invariant of the ring. It is defined to be the supremum of the set of projective dimensions of all A-modules. Global dimension is an important technical notion in the dimension theory of Noetherian rings.
Let A be a nonnegatively graded connected algebra over a noncommutative separable k-algebra K, and let M be a bounded below graded right A-module. If we denote by T the -coalgebra , we know that there exists an -comodule structure on over T. The structure ...
We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exis ...
In [8] we introduced the notion of multi-Koszul algebra: it is an extension of the definition of generalized Koszul algebra given by R. Berger in [1] for homogeneous algebras (see also [7]) that can be applied to any nonnegatively graded connected algebra ...