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 indeterminates over a field, one eventually finds a zero module of relations, after at most 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).[1] 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.
See main article: syzygy (mathematics). Originally, Hilbert defined syzygies for ideals in polynomial rings, but the concept generalizes trivially to (left) modules over any ring.
g1,\ldots,gk
(a1,\ldots,ak)
a1g1+ … +akgk=0.
L0
(G1,\ldots,Gk).
(a1,\ldots,ak)
a1G1+ … +akGk,
R1
L0\toM
Gi\mapstogi.
0\toR1\toL0\toM\to0.
This first syzygy module
R1
S1
F1
F2
R1 ⊕ F1\congS1 ⊕ F2
⊕
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 th syzygy module for every positive integer .
If the th syzygy module is free for some, 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 be the smallest integer, if any, such that the th syzygy module of a module is free or projective. The above property of invariance, up to the sum direct with free modules, implies that does not depend on the choice of generating sets. The projective dimension of is this integer, if it exists, or if not. This is equivalent with the existence of an exact sequence
0\longrightarrowRn\longrightarrowLn-1\longrightarrow … \longrightarrowL0\longrightarrowM\longrightarrow0,
Li
Rn
Rn
k[x1,\ldots,xn]
0\longrightarrowLk\longrightarrowLk-1\longrightarrow … \longrightarrowL0\longrightarrowM\longrightarrow0
This upper bound on the projective dimension is sharp, that is, there are modules of projective dimension exactly . The standard example is the field, which may be considered as a
k[x1,\ldots,xn]
xic=0
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
k[x1,\ldots,xn]
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.
The Koszul complex, also called "complex of exterior algebra", allows, in some cases, an explicit description of all syzygy modules.
Let
g1,\ldots,gk
R=k[x1,\ldots,xn]
L1
G1,\ldots,Gk.
L1
Λ(L1)=oplus
k | |
t=0 |
Lt,
Lt
G | |
i1 |
\wedge … \wedge
G | |
it |
,
i1<i2< … <it.
L0=R
L1
Lt=0
Lt\toLt-1
G | |
i1 |
\wedge … \wedge
G | |
it |
\mapsto
t | |
\sum | |
j=1 |
(-1)j+1
g | |
ij |
G | |
i1 |
\wedge … \wedge
\widehat{G} | |
ij |
\wedge … \wedge
G | |
it |
,
0\toLt\toLt-1\to … \toL1\toL0\toR/I.
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
R=k[x1,\ldots,xn]
In particular, the sequence
x1,\ldots,xn
k=R/\langlex1,\ldots,xn\rangle.
Gi
(x1,-x2,\ldots,\pmxn).
pi
p1x1+ … +pnxn=1,
xi
k=R/\langlex1,\ldots,xn\rangle
The same proof applies for proving that the projective dimension of
k[x1,\ldots,xn]/\langleg1,\ldots,gt\rangle
gi
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:[3] Let a submodule of a free module of dimension over
k[x1,\ldots,xn];
2cn | |
(td) |
.
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.
One might wonder which ring-theoretic property of
A=k[x1,\ldots,xn]
A
A
A
A
A