04.08.2013 Views

Betti numbers of modules over Noetherian rings with ... - IPM

Betti numbers of modules over Noetherian rings with ... - IPM

Betti numbers of modules over Noetherian rings with ... - IPM

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Chapter 1: Preliminaries 7<br />

This approach can be applied to all Cohen-Macaulay quotient <strong>rings</strong> S = R/I, where I<br />

is an ideal generated by homogeneous polynomials. The first step is to find a maximal<br />

regular sequence f1, · · · , fm <strong>of</strong> S composed <strong>of</strong> homogeneous polynomials <strong>of</strong> degree 1;<br />

here, by virtue <strong>of</strong> the Cohen-Macaulay property, m = dim S. This will produce a<br />

0-dimensional ring ¯ S = S/(f1, · · · , fm) whose Hilbert series is the polynomial Q ¯ S. By<br />

(1.2) and (1.3) we get that<br />

HS(t) = Q ¯ S(t)<br />

.<br />

(1 − t) m<br />

Example 1.2.1. Let f be a homogenous polynomial <strong>of</strong> R = K[x1, · · · , xn] <strong>of</strong> degree<br />

d > 0 and I = (f). The graded free resolution <strong>of</strong> R/I is<br />

0 −→ R(−d) 1↦→f<br />

−−→ R −→ R/I −→ 0,<br />

which yields β0 0, β1 d = 1, whereas the remaining βi j are zero. Hence (1.2) implies<br />

that,<br />

so the Hilbert series <strong>of</strong> R/I is<br />

HR/I(t) = HR(t)(1 − t d )<br />

= (1 − td )<br />

(1 − t) n<br />

= (1 + t + t2 + · · · + td−1 )<br />

(1 − t) n−1 ,<br />

1 + t + t 2 + · · · + t d−1<br />

(1 − t) n−1<br />

For more complicated ideals I, the computation requires the use <strong>of</strong> Gröbner bases;<br />

see [45, 58] for a fruitful resource <strong>of</strong> techniques.<br />

In [29, Chapter 6] some techniques for computing the multiplicity is provided.<br />

Thanks to Francisco, we include them in this section.<br />

.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!