Английская Википедия:Hilbert's syzygy theorem

Содержание

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Шаблон:Short description 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, that 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, which 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 Шаблон:Math indeterminates over a field, one eventually finds a zero module of relations, after at most Шаблон:Math 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.

History

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.

Syzygies (relations)

Шаблон:Main Originally, Hilbert defined syzygies for ideals in polynomial rings, but the concept generalizes trivially to (left) modules over any ring.

Given a generating set <math>g_1, \ldots, g_k</math> of a module Шаблон:Math over a ring Шаблон:Math, a relation or first syzygy between the generators is a Шаблон:Math-tuple <math>(a_1, \ldots, a_k)</math> of elements of Шаблон:Math such that

<math>a_1g_1 + \cdots + a_kg_k =0.</math>

Let <math>L_0</math> be a free module with basis <math>(G_1, \ldots, G_k).</math> The Шаблон:Mvar-tuple <math>(a_1, \ldots, a_k)</math> may be identified with the element

<math>a_1G_1 + \cdots + a_kG_k,</math>

and the relations form the kernel <math>R_1</math> of the linear map <math>L_0 \to M</math> defined by <math>G_i \mapsto g_i.</math> In other words, one has an exact sequence

<math>0 \to R_1 \to L_0 \to M \to 0.</math>

This first syzygy module <math>R_1</math> depends on the choice of a generating set, but, if <math>S_1</math> is the module that is obtained with another generating set, there exist two free modules <math>F_1</math> and <math>F_2</math> such that

<math>R_1 \oplus F_1 \cong S_1 \oplus F_2</math>

where <math>\oplus</math> denote the direct sum of modules.

The second syzygy module is the module of the relations between generators of the first syzygy module. By continuing in this way, one may define the Шаблон:Mathth syzygy module for every positive integer Шаблон:Math.

If the Шаблон:Mathth syzygy module is free for some Шаблон:Math, then by taking a basis as a generating set, the next syzygy module (and every subsequent one) is the zero module. If one does not take a basis as a generating set, then all subsequent syzygy modules are free.

Let Шаблон:Math be the smallest integer, if any, such that the Шаблон:Mathth syzygy module of a module Шаблон:Math is free or projective. The above property of invariance, up to the sum direct with free modules, implies that Шаблон:Math does not depend on the choice of generating sets. The projective dimension of Шаблон:Math is this integer, if it exists, or Шаблон:Math if not. This is equivalent with the existence of an exact sequence

<math>0 \longrightarrow R_n \longrightarrow L_{n-1} \longrightarrow \cdots \longrightarrow L_0 \longrightarrow M \longrightarrow 0,</math>

where the modules <math>L_i</math> are free and <math>R_n</math> is projective. It can be shown that one may always choose the generating sets for <math>R_n</math> being free, that is for the above exact sequence to be a free resolution.

Statement

Hilbert's syzygy theorem states that, if Шаблон:Math is a finitely generated module over a polynomial ring <math>k[x_1,\ldots,x_n]</math> in Шаблон:Math indeterminates over a field Шаблон:Math, then the Шаблон:Mathth syzygy module of Шаблон:Math is always a free module.

In modern language, this implies that the projective dimension of Шаблон:Math is at most Шаблон:Math, and thus that there exists a free resolution

<math>0 \longrightarrow L_k \longrightarrow L_{k-1} \longrightarrow \cdots \longrightarrow L_0 \longrightarrow M \longrightarrow 0</math>

of length Шаблон:Math.

This upper bound on the projective dimension is sharp, that is, there are modules of projective dimension exactly Шаблон:Math. The standard example is the field Шаблон:Math, which may be considered as a <math>k[x_1,\ldots,x_n]</math>-module by setting <math>x_i c=0</math> for every Шаблон:Math and every Шаблон:Math. For this module, the Шаблон:Mathth syzygy module is free, but not the Шаблон:Mathth one (for a proof, see Шаблон:Slink, below).

The theorem is also true for modules that are not finitely generated. As the global dimension of a ring is the supremum of the projective dimensions of all modules, Hilbert's syzygy theorem may be restated as: the global dimension of <math>k[x_1,\ldots,x_n]</math> is Шаблон:Math.

Low dimension

In the case of zero indeterminates, Hilbert's syzygy theorem is simply the fact that every vector space has a basis.

In the case of a single indeterminate, Hilbert's syzygy theorem is an instance of the theorem asserting that over a principal ideal ring, every submodule of a free module is itself free.

Koszul complex

The Koszul complex, also called "complex of exterior algebra", allows, in some cases, an explicit description of all syzygy modules.

Let <math>g_1, \ldots, g_k</math> be a generating system of an ideal Шаблон:Math in a polynomial ring <math>R=k[x_1,\ldots,x_n]</math>, and let <math>L_1</math> be a free module of basis <math>G_1, \ldots, G_k.</math> The exterior algebra of <math>L_1</math> is the direct sum

<math>\Lambda(L_1)=\bigoplus_{t=0}^k L_t,</math>

where <math>L_t</math> is the free module, which has, as a basis, the exterior products

<math>G_{i_1} \wedge \cdots \wedge G_{i_t},</math>

such that <math>i_1< i_2<\cdots <i_t.</math> In particular, one has <math>L_0=R</math> (because of the definition of the empty product), the two definitions of <math>L_1</math> coincide, and <math>L_t=0</math> for Шаблон:Math. For every positive Шаблон:Math, one may define a linear map <math>L_t\to L_{t-1}</math> by

<math>G_{i_1} \wedge \cdots \wedge G_{i_t} \mapsto \sum_{j=1}^t (-1)^{j+1}g_{i_j}G_{i_1}\wedge \cdots\wedge \widehat{G}_{i_j} \wedge \cdots\wedge G_{i_t}, </math>

where the hat means that the factor is omitted. A straightforward computation shows that the composition of two consecutive such maps is zero, and thus that one has a complex

<math>0\to L_t \to L_{t-1} \to \cdots \to L_1 \to L_0 \to R/I.</math>

This is the Koszul complex. In general the Koszul complex is not an exact sequence, but it is an exact sequence if one works with a polynomial ring <math>R=k[x_1,\ldots,x_n]</math> and an ideal generated by a regular sequence of homogeneous polynomials.

In particular, the sequence <math>x_1,\ldots,x_n</math> is regular, and the Koszul complex is thus a projective resolution of <math></math><math>k=R/\langle x_1, \ldots, x_n\rangle.</math> In this case, the Шаблон:Mathth syzygy module is free of dimension one (generated by the product of all <math>G_i</math>); the Шаблон:Mathth syzygy module is thus the quotient of a free module of dimension Шаблон:Math by the submodule generated by <math>(x_1, -x_2, \ldots, \pm x_n).</math> This quotient may not be a projective module, as otherwise, there would exist polynomials <math>p_i</math> such that <math>p_1x_1 + \cdots +p_nx_n=1,</math> which is impossible (substituting 0 for the <math>x_i</math> in the latter equality provides Шаблон:Math). This proves that the projective dimension of <math>k=R/\langle x_1, \ldots, x_n\rangle</math> is exactly Шаблон:Math.

The same proof applies for proving that the projective dimension of <math>k[x_1, \ldots, x_n]/\langle g_1, \ldots, g_t\rangle</math> is exactly Шаблон:Math if the <math>g_i</math> form a regular sequence of homogeneous polynomials.

Computation

At Hilbert's time, there was no method available for computing syzygies. It was only known that an algorithm may be deduced from any upper bound of the degree of the generators of the module of syzygies. In fact, the coefficients of the syzygies are unknown polynomials. If the degree of these polynomials is bounded, the number of their monomials is also bounded. Expressing that one has a syzygy provides a system of linear equations whose unknowns are the coefficients of these monomials. Therefore, any algorithm for linear systems implies an algorithm for syzygies, as soon as a bound of the degrees is known.

The first bound for syzygies (as well as for the ideal membership problem) was given in 1926 by Grete Hermann: Let Шаблон:Math a submodule of a free module Шаблон:Math of dimension Шаблон:Math over <math>k[x_1, \ldots, x_n];</math> if the coefficients over a basis of Шаблон:Math of a generating system of Шаблон:Math have a total degree at most Шаблон:Math, then there is a constant Шаблон:Math such that the degrees occurring in a generating system of the first syzygy module is at most <math>(td)^{2^{cn}}.</math> The same bound applies for testing the membership to Шаблон:Math of an element of Шаблон:Math.

On the other hand, there are examples where a double exponential degree necessarily occurs. However such examples are extremely rare, and this sets the question of an algorithm that is efficient when the output is not too large. At the present time, the best algorithms for computing syzygies are Gröbner basis algorithms. They allow the computation of the first syzygy module, and also, with almost no extra cost, all syzygies modules.

Syzygies and regularity

One might wonder which ring-theoretic property of <math>A=k[x_1,\ldots,x_n]</math> causes the Hilbert syzygy theorem to hold. It turns out that this is regularity, which is an algebraic formulation of the fact that affine Шаблон:Math-space is a variety without singularities. In fact the following generalization holds: Let <math>A</math> be a Noetherian ring. Then <math>A</math> has finite global dimension if and only if <math>A</math> is regular and the Krull dimension of <math>A</math> is finite; in that case the global dimension of <math>A</math> is equal to the Krull dimension. This result may be proven using Serre's theorem on regular local rings.

See also

• Quillen–Suslin theorem
• Hilbert series and Hilbert polynomial

References

• David Eisenbud, Commutative algebra. With a view toward algebraic geometry. Graduate Texts in Mathematics, 150. Springer-Verlag, New York, 1995. xvi+785 pp. Шаблон:ISBN; Шаблон:ISBN Шаблон:MathSciNet
• Шаблон:Springer