Exact sequences.
Graded modules and their Hilbert series.
Exact sequences of graded modules give an alternating sum formula for Hilbert series.
Let lambda be a weighting on the variables, a natural number for each x_i.
With this, we can generalize the notions of
Then the easy theorem:
homog_lambda(I) + ideal(y) = init_lambda(I) + ideal(y).
Stupid blogger.com is stealing my angle brackets again.
Note that on the LHS the familiar lambda is (1,1,1,1,...,1),
whereas on the RHS the familiar lambda is (N^n, N^{n-1}, ..., N) where N is very large. (That picks out the lex-first term of any fixed polynomial, once N is big enough.)
Monday, April 20, 2009
Thursday, April 16, 2009
Answers to HW #9
1. Let Delta_1, Delta_2 be simplicial complexes on {1..n}.
Show that Delta_1 intersect Delta_2, Delta_1 union Delta_2 are both simplicial complexes too.
A simplicial complex is a collection (A) of subsets of {1..n}, (B) closed under shrinkage. (A) is obvious for both union and intersection, so we turn to (B).
Let F be a subset of {1..n}, and G a subset of F.
If F is in the intersection, then F is in Delta_1 and Delta_2, so G is too, hence G is in the intersection.
If F is in the union, then F is in one of Delta_1 or Delta_2, so G is in that one too, hence G is in the union.
2. Show H_{Delta_1 union Delta_2} = H_{Delta_1} + H_{Delta_2} - H_{the intersection}.
We computed H_Delta = \sum_{F in Delta} (t/(1-t))^|F|.
On the left hand side we sum over each F in the union, once.
On the right we sum over each F in the union either 1+0-0, 0+1-0, or 1+1-1 times, depending on whether it is in Delta_1, Delta_2, or both.
3. Take the two simplicial complexes from the last homework. Compute their Hilbert series (meaning, that of the associated Stanley-Reisner ideals) using the formula we have for general monomial ideals. Confirm that it matches the answer we get from the formula specifically for SR ideals.
The first one is I generated by {e, af, bd}. The usual monomial formula is 1/(1-t)^6 (1 -t-t^2-t^2 + t^3+t^3+t^4 - t^5). The fact that the LCMs are all products says that this is a complete intersection, i.e. the numerator factors, so we could also say 1/(1-t)^6 (1-t)(1-t^2)(1-t^2). Then that simplifies to 1/(1-t)^3 (1+t)^2.
Meanwhile, the formula specifically for S-R ideals gives us
1 + 5(t/(1-t)) + 8(t/(1-t))^2 + 4(t/(1-t))^3, for the 1 empty face, 5 vertices, 8 edges, and 4 triangles.
Multiply both sides by (1-t)^3, and the first calculation gives (1+t)^2, whereas the second gives (1-t)^3 + 5t(1-t)^2 + 8t^2(1-t) + 4t^3, and these are indeed the same.
The second ideal is generated by abc, so the general monomial formula is 1/(1-t)^4 (1-t^3) = 1/(1-t)^3 (1+t+t^2). The S-R formula is 1 + 4(t/(1-t)) + 6(t/(1-t))^2 + 3(t/(1-t))^3. Multiplying again by (1-t)^3, we get 1+t+t^2 vs. (1-t)^3 + 4t(1-t)^2 + 6t^2(1-t) + 3t^3, which again match.
4. Let I be a homogeneous ideal. But let's homogenize it again, anyway! Relate H_I and H_{homog(I)}.
Pick a homogeneous Gr\"obner basis. Then homogenizing it does exactly nothing to the basis; it only puts it into a ring with one more variable.
We can compute the Hilbert series from the leading terms of the Gr\"obner basis, as 1/(1-t)^{# variables} * something depending on those terms.
So the only difference between the two calculations is the number of variables.
Hence H_{homog(I)} = 1/(1-t) H_I.
Show that Delta_1 intersect Delta_2, Delta_1 union Delta_2 are both simplicial complexes too.
A simplicial complex is a collection (A) of subsets of {1..n}, (B) closed under shrinkage. (A) is obvious for both union and intersection, so we turn to (B).
Let F be a subset of {1..n}, and G a subset of F.
If F is in the intersection, then F is in Delta_1 and Delta_2, so G is too, hence G is in the intersection.
If F is in the union, then F is in one of Delta_1 or Delta_2, so G is in that one too, hence G is in the union.
2. Show H_{Delta_1 union Delta_2} = H_{Delta_1} + H_{Delta_2} - H_{the intersection}.
We computed H_Delta = \sum_{F in Delta} (t/(1-t))^|F|.
On the left hand side we sum over each F in the union, once.
On the right we sum over each F in the union either 1+0-0, 0+1-0, or 1+1-1 times, depending on whether it is in Delta_1, Delta_2, or both.
3. Take the two simplicial complexes from the last homework. Compute their Hilbert series (meaning, that of the associated Stanley-Reisner ideals) using the formula we have for general monomial ideals. Confirm that it matches the answer we get from the formula specifically for SR ideals.
The first one is I generated by {e, af, bd}. The usual monomial formula is 1/(1-t)^6 (1 -t-t^2-t^2 + t^3+t^3+t^4 - t^5). The fact that the LCMs are all products says that this is a complete intersection, i.e. the numerator factors, so we could also say 1/(1-t)^6 (1-t)(1-t^2)(1-t^2). Then that simplifies to 1/(1-t)^3 (1+t)^2.
Meanwhile, the formula specifically for S-R ideals gives us
1 + 5(t/(1-t)) + 8(t/(1-t))^2 + 4(t/(1-t))^3, for the 1 empty face, 5 vertices, 8 edges, and 4 triangles.
Multiply both sides by (1-t)^3, and the first calculation gives (1+t)^2, whereas the second gives (1-t)^3 + 5t(1-t)^2 + 8t^2(1-t) + 4t^3, and these are indeed the same.
The second ideal is generated by abc, so the general monomial formula is 1/(1-t)^4 (1-t^3) = 1/(1-t)^3 (1+t+t^2). The S-R formula is 1 + 4(t/(1-t)) + 6(t/(1-t))^2 + 3(t/(1-t))^3. Multiplying again by (1-t)^3, we get 1+t+t^2 vs. (1-t)^3 + 4t(1-t)^2 + 6t^2(1-t) + 3t^3, which again match.
4. Let I be a homogeneous ideal. But let's homogenize it again, anyway! Relate H_I and H_{homog(I)}.
Pick a homogeneous Gr\"obner basis. Then homogenizing it does exactly nothing to the basis; it only puts it into a ring with one more variable.
We can compute the Hilbert series from the leading terms of the Gr\"obner basis, as 1/(1-t)^{# variables} * something depending on those terms.
So the only difference between the two calculations is the number of variables.
Hence H_{homog(I)} = 1/(1-t) H_I.
Wednesday, April 15, 2009
HW #10, Due Wed. 4/22
1. A ring is called a division ring if R is a (not necessarily commutative) ring with unit (and 0 not equal to 1) such that for each r in R, there is an r' such that rr' = r'r = 1. The Quaternions is the set H = { a + bi + cj + dk : a,b,c,d are real numbers}. Define a multiplication by setting i^2 = j^2 = k^2 = -1, ij = k, jk = i, and ik = -j. Show that H is a division ring. [Hint: Try proving that the complex numbers is a field using the complex conjugate, and try changing the proof for the Quaternions H].
2. Recall that given a nonzero ring R, one always has at least two ideals; the zero ideal, and the whole ring. If these are the only two ideals, R is called simple.
Show that the ring of nxn matrices over a field F is simple.
For the rest of the problems, R is a commutative ring with unit.
3. Define the nilradical of R, denoted N(R) as the set of all nilpotent elements of R.
(a) Show that N(R) is an ideal.
(b) Given an ideal I of R, compute N(R/I). So, N(R/I) corresponds to an ideal of R containing I. What is this ideal?
4. Let F_p be the field of p elements, Z/pZ. Note that in this field, p = 0. Let R = F_p[x], where x is a variable. Show that the function phi : R --> R that sends an element f of R to f^p is a ring homomorphism. What is its kernel?
[It may help if you know that (f+g)^p = \sum_{i=0}^p (p choose i) f^i * g^(p-i), where (p choose i) is the binomial coefficient p!/(i!(p-i)!).]
5. Let I be an ideal of R, and consider the R-module R/I. Show that the first syzygy of R/I can be chosen to be I. Note: This amounts to proving that the kernel of the R-module homomorphism R --> R/I is I.
6. Let R = F[x,y,z] where F is any field, and let I be the ideal generated by the monomials x^2,xy,xz,y^2,yz,z^2. Find the first syzygies (there are 8) among these generators (i.e. the relations), and find the second syzygies (there are 3) among these generators (which, by definition, are the relations among the relations).
Have fun!
2. Recall that given a nonzero ring R, one always has at least two ideals; the zero ideal, and the whole ring. If these are the only two ideals, R is called simple.
Show that the ring of nxn matrices over a field F is simple.
For the rest of the problems, R is a commutative ring with unit.
3. Define the nilradical of R, denoted N(R) as the set of all nilpotent elements of R.
(a) Show that N(R) is an ideal.
(b) Given an ideal I of R, compute N(R/I). So, N(R/I) corresponds to an ideal of R containing I. What is this ideal?
4. Let F_p be the field of p elements, Z/pZ. Note that in this field, p = 0. Let R = F_p[x], where x is a variable. Show that the function phi : R --> R that sends an element f of R to f^p is a ring homomorphism. What is its kernel?
[It may help if you know that (f+g)^p = \sum_{i=0}^p (p choose i) f^i * g^(p-i), where (p choose i) is the binomial coefficient p!/(i!(p-i)!).]
5. Let I be an ideal of R, and consider the R-module R/I. Show that the first syzygy of R/I can be chosen to be I. Note: This amounts to proving that the kernel of the R-module homomorphism R --> R/I is I.
6. Let R = F[x,y,z] where F is any field, and let I be the ideal generated by the monomials x^2,xy,xz,y^2,yz,z^2. Find the first syzygies (there are 8) among these generators (i.e. the relations), and find the second syzygies (there are 3) among these generators (which, by definition, are the relations among the relations).
Have fun!
Saturday, April 11, 2009
Answers to HW #8
1. Let I be a radical ideal in R, and homog(I) its homogenization in R[y].
Show that homog(I) is radical.
Let f^2 be in homog(I). Let f_0 be the lowest-degree part of f, so f_0^2 is the lowest-degree part of f^2. Since f^2 is in homog(I) a homogeneous ideal, each degree component of it, e.g. f_0^2, is in homog(I).
Then there are two cases: f_0 is in homog(I) or not. If it is, replace f with f-f_0 and start over. That must terminate since the number of terms goes down. Eventually we get to the other case, that f_0 is not in homog(I). Replace f with f_0 and start over.
Okay, now f^2 is in homog(I), but f isn't, and f is homogeneous. Hence homog(dehomog(f)) = f / y^k, where k is the largest power of y that divides f. Let g = f / y^k; it is homogeneous and not a multiple of y. Hence homog(dehomog(g)) = g.
Okay, now (g y^k)^2 is in homog(I). Dehomogenizing, we learn dehomog(g)^2 is in I. Hence dehomog(g) is in I, since I is radical. Hence homog(dehomog(g)) = g is in homog(I). Therefore f = g y^k is in homog(I).
2. Let I be a radical homogeneous ideal in R[y].
Show that dehomog(I) is radical.
Let f^2 be in dehomog(I). Then f^2 = dehomog(g) for some homogeneous g in I. So homog(f^2) = g / y^k for the largest y^k dividing g.
Hence y^k homog(f^2) is in I. If k is odd, multiply by y again, staying in I.
Hence y^{k or k+1} homog(f)^2 is in I.
Since I is radical, y^{ceiling(k/2)} homog(f) is in I.
Dehomogenizing, we learn f is in I.
3. Let I be an ideal in R such that homog(I) is radical. Show that I is radical.
I = dehomog(homog(I)). Now apply #2.
4. Give an example of I in R[y], homogeneous but not radical, such that dehomog(I) is radical.
The simplest is I generated by y^2.
Geometrically, the idea is this. PV(I) lives in projective space. Being nonradical means it has some fuzz on it somewhere (that the generators of the radical would shave off). Dehomogenizing means intersecting PV(I) with affine space, throwing away the stuff at infinity. So we need to arrange for all the fuzz to be at infinity. The ideal y^2 cuts out exactly the hyperplane at infinity, but with fuzz.
5. Let I be generated by xy, x+y-1. Find a term order such that init(homog(I)) is radical.
Conclude that I is radical.
homog(I) is generated by xy, x+y-z (here the new variable is z).
With the right lex order, the initial terms are xy and -z.
Since those have gcd=1, this is a Gr\"obner basis whose initial terms are squarefree.
Hence I is radical.
6. Draw the simplicial complex associated to the ideal generated by {e, af, bd} in C[a,b,c,d,e,f].
It's a solid square cut into four triangles with a,b,f,d at the corners and c in the middle.
7. Draw the solid abc triangle, and put a vertex d in the middle, with new edges connected to a,b,c. (The red, but not blue, lines in this picture.) What's the corresponding Stanley-Reisner ideal, and its Hilbert series?
This wasn't at all well specified, for which I apologize. If you didn't manage to read my mind, but made clear what complex you were working with, that's good enough.
What I'd intended to indicate was a union of three solid triangles, abd & bcd & cad. So the only faces missing are abcd and abc itself. In particular the S-R ideal should be generated by abc.
Then the Hilbert series is 1/(1-t)^4 * (1-t^3).
Show that homog(I) is radical.
Let f^2 be in homog(I). Let f_0 be the lowest-degree part of f, so f_0^2 is the lowest-degree part of f^2. Since f^2 is in homog(I) a homogeneous ideal, each degree component of it, e.g. f_0^2, is in homog(I).
Then there are two cases: f_0 is in homog(I) or not. If it is, replace f with f-f_0 and start over. That must terminate since the number of terms goes down. Eventually we get to the other case, that f_0 is not in homog(I). Replace f with f_0 and start over.
Okay, now f^2 is in homog(I), but f isn't, and f is homogeneous. Hence homog(dehomog(f)) = f / y^k, where k is the largest power of y that divides f. Let g = f / y^k; it is homogeneous and not a multiple of y. Hence homog(dehomog(g)) = g.
Okay, now (g y^k)^2 is in homog(I). Dehomogenizing, we learn dehomog(g)^2 is in I. Hence dehomog(g) is in I, since I is radical. Hence homog(dehomog(g)) = g is in homog(I). Therefore f = g y^k is in homog(I).
2. Let I be a radical homogeneous ideal in R[y].
Show that dehomog(I) is radical.
Let f^2 be in dehomog(I). Then f^2 = dehomog(g) for some homogeneous g in I. So homog(f^2) = g / y^k for the largest y^k dividing g.
Hence y^k homog(f^2) is in I. If k is odd, multiply by y again, staying in I.
Hence y^{k or k+1} homog(f)^2 is in I.
Since I is radical, y^{ceiling(k/2)} homog(f) is in I.
Dehomogenizing, we learn f is in I.
3. Let I be an ideal in R such that homog(I) is radical. Show that I is radical.
I = dehomog(homog(I)). Now apply #2.
4. Give an example of I in R[y], homogeneous but not radical, such that dehomog(I) is radical.
The simplest is I generated by y^2.
Geometrically, the idea is this. PV(I) lives in projective space. Being nonradical means it has some fuzz on it somewhere (that the generators of the radical would shave off). Dehomogenizing means intersecting PV(I) with affine space, throwing away the stuff at infinity. So we need to arrange for all the fuzz to be at infinity. The ideal y^2 cuts out exactly the hyperplane at infinity, but with fuzz.
5. Let I be generated by xy, x+y-1. Find a term order such that init(homog(I)) is radical.
Conclude that I is radical.
homog(I) is generated by xy, x+y-z (here the new variable is z).
With the right lex order, the initial terms are xy and -z.
Since those have gcd=1, this is a Gr\"obner basis whose initial terms are squarefree.
Hence I is radical.
6. Draw the simplicial complex associated to the ideal generated by {e, af, bd} in C[a,b,c,d,e,f].
It's a solid square cut into four triangles with a,b,f,d at the corners and c in the middle.
7. Draw the solid abc triangle, and put a vertex d in the middle, with new edges connected to a,b,c. (The red, but not blue, lines in this picture.) What's the corresponding Stanley-Reisner ideal, and its Hilbert series?
This wasn't at all well specified, for which I apologize. If you didn't manage to read my mind, but made clear what complex you were working with, that's good enough.
What I'd intended to indicate was a union of three solid triangles, abd & bcd & cad. So the only faces missing are abcd and abc itself. In particular the S-R ideal should be generated by abc.
Then the Hilbert series is 1/(1-t)^4 * (1-t^3).
Wednesday, April 08, 2009
HW #9, due Wednesday 4/15
1. Let Delta_1, Delta_2 be simplicial complexes on {1..n}.
Show that Delta_1 intersect Delta_2, Delta_1 union Delta_2 are both simplicial complexes too.
2. Show H_{Delta_1 union Delta_2} = H_{Delta_1} + H_{Delta_2} - H_{the intersection}.
3. Take the two simplicial complexes from the last homework. Compute their Hilbert series (meaning, that of the associated Stanley-Reisner ideals) using the formula we have for general monomial ideals. Confirm that it matches the answer we get from the formula specifically for SR ideals.
4. Let I be a homogeneous ideal. But let's homogenize it again, anyway! Relate H_I and H_{homog(I)}.
...more to come
Show that Delta_1 intersect Delta_2, Delta_1 union Delta_2 are both simplicial complexes too.
2. Show H_{Delta_1 union Delta_2} = H_{Delta_1} + H_{Delta_2} - H_{the intersection}.
3. Take the two simplicial complexes from the last homework. Compute their Hilbert series (meaning, that of the associated Stanley-Reisner ideals) using the formula we have for general monomial ideals. Confirm that it matches the answer we get from the formula specifically for SR ideals.
4. Let I be a homogeneous ideal. But let's homogenize it again, anyway! Relate H_I and H_{homog(I)}.
...more to come
Tuesday, April 07, 2009
Hints
If p is a homogeneous polynomial in C[x_1,...,x_n,y], then homog(dehomog(p)) = p / y^k, where k is taken largest possible. (Namely, it's taken to be the smallest power occurring among the terms of p.)
If J is a homogeneous ideal in C[x_1,..,x_n,y], then the map dehomog: J -> dehomog(J) is onto.
If I is an ideal in C[x_1,..,x_n], then the map homog: I -> homog(I) is not onto; its image is the homogeneous polynomials in homog(I) that are not multiples of y.
Feel free to use these without proving them (though they're easy).
If J is a homogeneous ideal in C[x_1,..,x_n,y], then the map dehomog: J -> dehomog(J) is onto.
If I is an ideal in C[x_1,..,x_n], then the map homog: I -> homog(I) is not onto; its image is the homogeneous polynomials in homog(I) that are not multiples of y.
Feel free to use these without proving them (though they're easy).
Monday, April 06, 2009
Monday 4/6
The Hilbert series of SR(Delta) is sum_{faces F} (t/(1-t))^|F|.
Hence the Hilbert polynomial, in degree d, is sum_F (d-1 choose |F|-1).
Hence the Hilbert dimension is the # of elements of the largest face.
Something I really should have proved:
Thm.
If g_1,..,g_m is a Gr\"obner basis of I using a graded term order,
then homog(g_1),...,homog(g_m) is a Gr\"obner basis of homog(I)
using a graded term order in which y is cheap.
Pf. homog(g_i) has the same leading term as g_i (since it's of highest degree in g_i, so doesn't get any powers of y on it).
If we follow the reduction of S(homog(g_i), homog(g_j)),
at each step its dehomogenization matches that of the reduction S(g_i,g_j),
so we don't get stuck and we do reduce it to 0.
Corollary. If yf is in homog(I), then f is in homog(I).
Proof. If f isn't in homog(I), then after reducing for a while using one of the Gr\"obner bases supplied above it gets stuck.
Hence yf is also stuck, because the leading terms in {homog(g_i)} don't involve y. So yf isn't in homog(I).
Thm. If I is prime, then homog(I) is also prime.
Pf. Start with a,b s.t. ab in homog(I). Reduce to the case that a = homog(a_2), b = homog(b_2), using the Corollary. Then use a = homog(dehomog(a)) etc.
Hence the Hilbert polynomial, in degree d, is sum_F (d-1 choose |F|-1).
Hence the Hilbert dimension is the # of elements of the largest face.
Something I really should have proved:
Thm.
If g_1,..,g_m is a Gr\"obner basis of I using a graded term order,
then homog(g_1),...,homog(g_m) is a Gr\"obner basis of homog(I)
using a graded term order in which y is cheap.
Pf. homog(g_i) has the same leading term as g_i (since it's of highest degree in g_i, so doesn't get any powers of y on it).
If we follow the reduction of S(homog(g_i), homog(g_j)),
at each step its dehomogenization matches that of the reduction S(g_i,g_j),
so we don't get stuck and we do reduce it to 0.
Corollary. If yf is in homog(I), then f is in homog(I).
Proof. If f isn't in homog(I), then after reducing for a while using one of the Gr\"obner bases supplied above it gets stuck.
Hence yf is also stuck, because the leading terms in {homog(g_i)} don't involve y. So yf isn't in homog(I).
Thm. If I is prime, then homog(I) is also prime.
Pf. Start with a,b s.t. ab in homog(I). Reduce to the case that a = homog(a_2), b = homog(b_2), using the Corollary. Then use a = homog(dehomog(a)) etc.
Wednesday, April 01, 2009
HW #8, due Wednesday 4/8
You may use the following result (very similar to one proved in class):
Let J be a homogeneous ideal. If for every homogeneous f one
has f^2 in J => f in J, then J is radical.
1. Let I be a radical ideal in R, and homog(I) its homogenization in R[y].
Show that homog(I) is radical.
2. Let I be a radical homogeneous ideal in R[y].
Show that dehomog(I) is radical.
3. Let I be an ideal in R such that homog(I) is radical. Show that I is radical.
4. Give an example of I in R[y], homogeneous but not radical, such that dehomog(I) is radical.
5. Let I be generated by xy, x+y-1. Find a term order such that init(homog(I)) is radical.
Conclude that I is radical.
6. Draw the simplicial complex associated to the ideal generated by {e, af, bd} in C[a,b,c,d,e,f].
(Grr. Blogger is eating my less-than and more-than symbols with which to generate ideals.)
7. Draw the solid abc triangle, and put a vertex d in the middle, with new edges connected to a,b,c. (The red, but not blue, lines in this picture.) What's the corresponding Stanley-Reisner ideal, and its Hilbert series?
Let J be a homogeneous ideal. If for every homogeneous f one
has f^2 in J => f in J, then J is radical.
1. Let I be a radical ideal in R, and homog(I) its homogenization in R[y].
Show that homog(I) is radical.
2. Let I be a radical homogeneous ideal in R[y].
Show that dehomog(I) is radical.
3. Let I be an ideal in R such that homog(I) is radical. Show that I is radical.
4. Give an example of I in R[y], homogeneous but not radical, such that dehomog(I) is radical.
5. Let I be generated by xy, x+y-1. Find a term order such that init(homog(I)) is radical.
Conclude that I is radical.
6. Draw the simplicial complex associated to the ideal generated by {e, af, bd} in C[a,b,c,d,e,f].
(Grr. Blogger is eating my less-than and more-than symbols with which to generate ideals.)
7. Draw the solid abc triangle, and put a vertex d in the middle, with new edges connected to a,b,c. (The red, but not blue, lines in this picture.) What's the corresponding Stanley-Reisner ideal, and its Hilbert series?
Monday 3/30
The homogenization and dehomogenization of polynomials and ideals.
Geometrically, homogenization corresponds to taking the closure in projective space, whereas dehomogenization corresponds to intersecting a projective set with affine space.
We did x^2 = y^2 + 1 as an example, then dehomogenized using x,
which turned a hyperbola into a circle.
Geometrically, homogenization corresponds to taking the closure in projective space, whereas dehomogenization corresponds to intersecting a projective set with affine space.
We did x^2 = y^2 + 1 as an example, then dehomogenized using x,
which turned a hyperbola into a circle.
Tuesday, March 31, 2009
Wednesday, March 25, 2009
The midterm
I handed out the midterm. If you didn't get one email me.
It's due in Anna's basement office Friday 2:30-3:30. If you can't come then email her.
Once you start it, you have three hours (consecutive!), during which you can't talk to other people about it nor touch a computer, nor use textbooks.
You may use stuff from the course webpage you've printed out, and anything else you've written.
Other details are on the front page. They shouldn't be too surprising.
It's due in Anna's basement office Friday 2:30-3:30. If you can't come then email her.
Once you start it, you have three hours (consecutive!), during which you can't talk to other people about it nor touch a computer, nor use textbooks.
You may use stuff from the course webpage you've printed out, and anything else you've written.
Other details are on the front page. They shouldn't be too surprising.
Monday 3/23
Went back to proving that Hilb dim = homogeneous Krull dim.
Projective geometry.
Points, lines, and conics in the projective plane.
The embedding of affine space in projective space.
The three types of conics all look the same in the projective plane;
it's just a question of how they intersect the line at infinity.
The homogenization of a polynomial using a new variable.
Projective geometry.
Points, lines, and conics in the projective plane.
The embedding of affine space in projective space.
The three types of conics all look the same in the projective plane;
it's just a question of how they intersect the line at infinity.
The homogenization of a polynomial using a new variable.
Friday, March 13, 2009
Answers to HW #7
1. Let I be a homogeneous ideal in a polynomial ring R, and r a homogeneous element of degree k.
Let J = I + < r >.
Show that
a) For each n, h_J(n) is at least h_I(n) - h_I(n-k).
b) If they are equal for all n, then r is not a zero divisor.
a) Consider the map (R/I)_{n-k} -> (R/I)_n given by multiplication by r.
We figured out in class that the quotient by the image is (R/J)_n.
So dim (R/I)_n = dim (R/J)_n + dim r*(R/I)_{n-k}.
The dimension of r*(R/I)_{n-k} is at most the dimension of (R/I)_{n-k}, so we get the inequality claimed.
b) If they're equal, then dim r*(R/I)_{n-k} = dim (R/I)_{n-k}, so the multiply-by-r map has no kernel. Which means r is not a zero divisor.
2. A list {r_1, r_2, ..., r_m} is called a regular sequence if each r_j is not a zero divisor in R/< r_1, ..., r_{j-1} >.
If {b,c} is a regular sequence, show that {c,b} is a regular sequence.
Oops: I had meant b,c to be homogeneous. (It's true even if they're not, but don't bother with that.)
We showed in class that if r is not a zero divisor in R/I, and is homogeneous of degree k, then H_{I+< r >}(t) = H_I(t) * (1-t^k).
So if {b,c} is a regular sequence, with degrees k,k', then H_{< b,c >}(t) = H_0(t) (1 - t^k) (1 - t^k').
Certainly c is not a zero divisor in R. So H_{< c >}(t) = H_0(t) (1 - t^k').
By the previous question, H_{< c,b >}(t) is coefficientwise at least H_0(t) (1 - t^k') (1 - t^k), with equality iff b is not a zero divisor in R/< c >.
But since < b,c > = < c,b >, we know this is an equality -- so b is not a zero divisor.
3. Let p(n) be a polynomial of degree d, and k a number. Show that q(n) = p(n) - p(n-k) is a polynomial of degree d-1.
First we check it for p(n) = n^d. Then q(n) = n^d - (n^d - d n^{d-1} k + ...), canceling the first term in the binomial series but not the next term, k d n^{d-1}.
Now say p(n) = a n^d + terms of degree at most d-1.
Then q(n) = (a k d n^{d-1} + terms of degree at most d-2) + (terms of degree at most d-2), which is indeed of degree d-1.
4. For p(n) a polynomial, let Delta p be the polynomial with values (Delta p)(n) = p(n) - p(n-1).
Notice that if p only takes integer values (when fed integers), then Delta p does so too.
a) Show that Delta {n choose k} = {n n-1 choose k-1}.
(n choose k) - (n-1 choose k) counts all k-element subsets of {1..n} minus all k-element subsets of {1..n-1}. What's left over is k-element subsets of {1..n} that include n. By ripping out the element n, those subsets correspond 1:1 with (k-1)-element subsets of {1..n-1}. The number of those is {n-1 choose k-1}.
b) Show that every polynomial p(n) is a linear combination of the polynomials {n choose k}, where k goes from 0 to degree p.
If p is constant it's clear, which will be the base of our induction.
Let d = degree(p).
Then p(n) = c n^d + a polynomial of degree < d.
Note that d! {n choose d} = n^d + a polynomial of degree < d.
So p(n) - c d! {n choose d} = a polynomial of degree < d.
By induction on d, the RHS is a linear combination as desired. Now add c d! {n choose d} to both sides.
c) Give an example of a polynomial with noninteger coefficients that nonetheless always produces integers.
{n choose 2} = n(n-1)/2.
d) Show that every integer-valued polynomial p(n) is a linear combination with integer coefficients of the polynomials {n choose k}, where k goes from 0 to degree p.
(In particular, this applies to Hilbert polynomials.)
Write p(n) = sum_{k=0}^{degree p} c_k {n choose k} using part (b).
Then (Delta^i p)(n) = sum_{k=0}^{degree p} c_k {n-i choose k-i}.
Obviously, all the terms with k < i vanish for any n.
If n = i, then the terms with k > i vanish too.
So (Delta^i p)(i) = c_i.
Notice that when q is integer-valued, so is Delta q, so Delta^i p only takes on integer values. Hence each c_i is an integer.
5. Let I in C[x_1...x_5] be generated by {x_i x_j - x_k x_l}, for all i,j,k,l such that i+j=k+l.
a) Show this is a Gr\"obner basis with respect to lex order.
First notice that we can leave out the generators with i > j since they're the same as the ones with i and j switched. Then we can leave out those with i=k or j=k, since the generator is then 0.
Consider the subset of the form x_i x_j - x_{floor{(i+j)/2}} x_{ceiling{(i+j)/2}}, where floor(x) is the greatest integer below x, ceiling(x) the least above.
Call this second term RHS(i,j) for now. Then any other relation x_i x_j - x_k x_l can be written as
x_i x_j - RHS(i,j) - (x_k x_l - RHS(k,l))
so this subset already generates the ideal. In particular, if it's a Gr\"obner basis, then adding the other generators won't break that.
At this point all of our generators have i at most j. But the i=j generators and the i=j-1 generators are x_i x_i - x_i x_i and x_i x_j - x_i x_j, i.e. zero. So we were already leaving those out.
When we compute the S-polynomial of two of these generators (ignoring the pairs with relatively prime initial terms, since we can), we get a cubic. So let's see what the reduction algorithm does to an arbitrary cubic monomial x_a x_b x_c, with a at most b at most c. (Note that a,b,c may include repeats.)
If c-a > 1, then the reduction algorithm trades x_a x_c either for x_d^2 or x_d x_{d+1}, depending on c-a being even or odd. In particular it gives us another cubic monomial x_a' x_b' x_c', where a+b+c = a'+b'+c'. It only gets stuck when a=b=c, or a=b=c-1, or a+1=b=c. We can even predict which case we'll get to, depending on the value of a+b+c mod 3 (0 if a=b=c, 1 if a=b=c-1, 2 if a+1=b=c).
Now let's see what happens to an S-polynomial x_a x_b x_c - x_d x_e x_f under reduction. Observe that a+b+c=d+e+f. We've just figured out that the reduction algorithm will replace either term with the same cubic monomial, and then they'll cancel. So the S-polynomials reduce to zero, making this a Gr\"obner basis.
b) Find the reduced Gr\"obner basis.
It's the subset we said above -- x_i x_j - RHS(i,j), where i < j-1.
The leading coefficients are all 1.
Since each generator is homogeneous quadratic, the only way this set would fail to be a reduced Gr\"obner basis is if some term of some generator was a constant multiple of the leading term of another generator. But the left terms have i < j-1, and the RHS terms have i'=j' or i'=j'-1.
c) Decompose V(the initial ideal).
Two variables can be nonzero at the same time only if they're adjacent, like x_3 and x_4, otherwise their product is the leading term of one of the generators.
So the components are the 12-plane, the 23-plane, the 34-plane, and the 45-plane. (And so on, if we had more variables.)
d) Compute the Hilbert polynomial.
The easiest thing is to compute directly the number of standard monomials of degree n. We've already figured out that a monomial is standard if it uses one variable, or two adjacent variables.
The number of monomials x_i^k x_{i+1}^{n-k}, for k not 0 or n, is n-1.
So the total is 5 (for the monomials x_i^n, i from 1 to 5) plus 4(n-1) (just counted, where i goes from 1 to 4), or 4n+1.
Let J = I + < r >.
Show that
a) For each n, h_J(n) is at least h_I(n) - h_I(n-k).
b) If they are equal for all n, then r is not a zero divisor.
a) Consider the map (R/I)_{n-k} -> (R/I)_n given by multiplication by r.
We figured out in class that the quotient by the image is (R/J)_n.
So dim (R/I)_n = dim (R/J)_n + dim r*(R/I)_{n-k}.
The dimension of r*(R/I)_{n-k} is at most the dimension of (R/I)_{n-k}, so we get the inequality claimed.
b) If they're equal, then dim r*(R/I)_{n-k} = dim (R/I)_{n-k}, so the multiply-by-r map has no kernel. Which means r is not a zero divisor.
2. A list {r_1, r_2, ..., r_m} is called a regular sequence if each r_j is not a zero divisor in R/< r_1, ..., r_{j-1} >.
If {b,c} is a regular sequence, show that {c,b} is a regular sequence.
Oops: I had meant b,c to be homogeneous. (It's true even if they're not, but don't bother with that.)
We showed in class that if r is not a zero divisor in R/I, and is homogeneous of degree k, then H_{I+< r >}(t) = H_I(t) * (1-t^k).
So if {b,c} is a regular sequence, with degrees k,k', then H_{< b,c >}(t) = H_0(t) (1 - t^k) (1 - t^k').
Certainly c is not a zero divisor in R. So H_{< c >}(t) = H_0(t) (1 - t^k').
By the previous question, H_{< c,b >}(t) is coefficientwise at least H_0(t) (1 - t^k') (1 - t^k), with equality iff b is not a zero divisor in R/< c >.
But since < b,c > = < c,b >, we know this is an equality -- so b is not a zero divisor.
3. Let p(n) be a polynomial of degree d, and k a number. Show that q(n) = p(n) - p(n-k) is a polynomial of degree d-1.
First we check it for p(n) = n^d. Then q(n) = n^d - (n^d - d n^{d-1} k + ...), canceling the first term in the binomial series but not the next term, k d n^{d-1}.
Now say p(n) = a n^d + terms of degree at most d-1.
Then q(n) = (a k d n^{d-1} + terms of degree at most d-2) + (terms of degree at most d-2), which is indeed of degree d-1.
4. For p(n) a polynomial, let Delta p be the polynomial with values (Delta p)(n) = p(n) - p(n-1).
Notice that if p only takes integer values (when fed integers), then Delta p does so too.
a) Show that Delta {n choose k} = {
(n choose k) - (n-1 choose k) counts all k-element subsets of {1..n} minus all k-element subsets of {1..n-1}. What's left over is k-element subsets of {1..n} that include n. By ripping out the element n, those subsets correspond 1:1 with (k-1)-element subsets of {1..n-1}. The number of those is {n-1 choose k-1}.
b) Show that every polynomial p(n) is a linear combination of the polynomials {n choose k}, where k goes from 0 to degree p.
If p is constant it's clear, which will be the base of our induction.
Let d = degree(p).
Then p(n) = c n^d + a polynomial of degree < d.
Note that d! {n choose d} = n^d + a polynomial of degree < d.
So p(n) - c d! {n choose d} = a polynomial of degree < d.
By induction on d, the RHS is a linear combination as desired. Now add c d! {n choose d} to both sides.
c) Give an example of a polynomial with noninteger coefficients that nonetheless always produces integers.
{n choose 2} = n(n-1)/2.
d) Show that every integer-valued polynomial p(n) is a linear combination with integer coefficients of the polynomials {n choose k}, where k goes from 0 to degree p.
(In particular, this applies to Hilbert polynomials.)
Write p(n) = sum_{k=0}^{degree p} c_k {n choose k} using part (b).
Then (Delta^i p)(n) = sum_{k=0}^{degree p} c_k {n-i choose k-i}.
Obviously, all the terms with k < i vanish for any n.
If n = i, then the terms with k > i vanish too.
So (Delta^i p)(i) = c_i.
Notice that when q is integer-valued, so is Delta q, so Delta^i p only takes on integer values. Hence each c_i is an integer.
5. Let I in C[x_1...x_5] be generated by {x_i x_j - x_k x_l}, for all i,j,k,l such that i+j=k+l.
a) Show this is a Gr\"obner basis with respect to lex order.
First notice that we can leave out the generators with i > j since they're the same as the ones with i and j switched. Then we can leave out those with i=k or j=k, since the generator is then 0.
Consider the subset of the form x_i x_j - x_{floor{(i+j)/2}} x_{ceiling{(i+j)/2}}, where floor(x) is the greatest integer below x, ceiling(x) the least above.
Call this second term RHS(i,j) for now. Then any other relation x_i x_j - x_k x_l can be written as
x_i x_j - RHS(i,j) - (x_k x_l - RHS(k,l))
so this subset already generates the ideal. In particular, if it's a Gr\"obner basis, then adding the other generators won't break that.
At this point all of our generators have i at most j. But the i=j generators and the i=j-1 generators are x_i x_i - x_i x_i and x_i x_j - x_i x_j, i.e. zero. So we were already leaving those out.
When we compute the S-polynomial of two of these generators (ignoring the pairs with relatively prime initial terms, since we can), we get a cubic. So let's see what the reduction algorithm does to an arbitrary cubic monomial x_a x_b x_c, with a at most b at most c. (Note that a,b,c may include repeats.)
If c-a > 1, then the reduction algorithm trades x_a x_c either for x_d^2 or x_d x_{d+1}, depending on c-a being even or odd. In particular it gives us another cubic monomial x_a' x_b' x_c', where a+b+c = a'+b'+c'. It only gets stuck when a=b=c, or a=b=c-1, or a+1=b=c. We can even predict which case we'll get to, depending on the value of a+b+c mod 3 (0 if a=b=c, 1 if a=b=c-1, 2 if a+1=b=c).
Now let's see what happens to an S-polynomial x_a x_b x_c - x_d x_e x_f under reduction. Observe that a+b+c=d+e+f. We've just figured out that the reduction algorithm will replace either term with the same cubic monomial, and then they'll cancel. So the S-polynomials reduce to zero, making this a Gr\"obner basis.
b) Find the reduced Gr\"obner basis.
It's the subset we said above -- x_i x_j - RHS(i,j), where i < j-1.
The leading coefficients are all 1.
Since each generator is homogeneous quadratic, the only way this set would fail to be a reduced Gr\"obner basis is if some term of some generator was a constant multiple of the leading term of another generator. But the left terms have i < j-1, and the RHS terms have i'=j' or i'=j'-1.
c) Decompose V(the initial ideal).
Two variables can be nonzero at the same time only if they're adjacent, like x_3 and x_4, otherwise their product is the leading term of one of the generators.
So the components are the 12-plane, the 23-plane, the 34-plane, and the 45-plane. (And so on, if we had more variables.)
d) Compute the Hilbert polynomial.
The easiest thing is to compute directly the number of standard monomials of degree n. We've already figured out that a monomial is standard if it uses one variable, or two adjacent variables.
The number of monomials x_i^k x_{i+1}^{n-k}, for k not 0 or n, is n-1.
So the total is 5 (for the monomials x_i^n, i from 1 to 5) plus 4(n-1) (just counted, where i goes from 1 to 4), or 4n+1.
Wednesday 3/11
Def: the Hilbert dimension of a homogeneous ideal is 1 + degree of the Hilbert polynomial, or 0 if the Hilbert polynomial is 0.
Theorem. HilbDim(I) = HilbDim(Rad(I)).
Proof. If I is not radical, we can add some homogeneous x whose square is in I.
Then do nullity plus rank on the map (R/I)_n -> (R/I)_{n+k} that multiplies by x.
Theorem. Let I be homogeneous.
1) If I is a prime ideal, and J (homogeneous) properly contains I, then HilbDim(J) < HilbDim(I).
2a) If I is not prime, then there exists J (homogeneous) properly containing it, with HilbDim(J) = HilbDim(I).
2b) That J can be taken to be prime.
Proof.
1) Even adding one element lowers the HilbDim by 1, by a calculation last week.
2a) If I is not radical, use the previous theorem.
Otherwise let a,b not in I, ab in I, and check that the map R/I -> R/I+< a > \oplus R/I+< b > is 1:1. Do nullity plus rank on that.
2b) Repeat 2a and use ACC.
We didn't get to
Theorem. HilbDim(I) = homogeneous KrullDim(I) (which is at most KrullDim(I)).
Proof. In a chain of homogeneous prime ideals, the HilbDim must drop at each step by (1) of the last theorem. That gives "HilbDim is at most homogeneous KrullDim".
Conversely, we can alternate the following two steps: increase I to a prime ideal without changing the HilbDim (using (2b)), and then increase it using one new homogeneous generator, lowering the HilbDim by 1, by the calculation last week. We get stuck only when we get to whole ring. This constructs a long sequence of prime ideals, giving "HilbDim is at least homogeneous KrullDim".
Theorem. HilbDim(I) = HilbDim(Rad(I)).
Proof. If I is not radical, we can add some homogeneous x whose square is in I.
Then do nullity plus rank on the map (R/I)_n -> (R/I)_{n+k} that multiplies by x.
Theorem. Let I be homogeneous.
1) If I is a prime ideal, and J (homogeneous) properly contains I, then HilbDim(J) < HilbDim(I).
2a) If I is not prime, then there exists J (homogeneous) properly containing it, with HilbDim(J) = HilbDim(I).
2b) That J can be taken to be prime.
Proof.
1) Even adding one element lowers the HilbDim by 1, by a calculation last week.
2a) If I is not radical, use the previous theorem.
Otherwise let a,b not in I, ab in I, and check that the map R/I -> R/I+< a > \oplus R/I+< b > is 1:1. Do nullity plus rank on that.
2b) Repeat 2a and use ACC.
We didn't get to
Theorem. HilbDim(I) = homogeneous KrullDim(I) (which is at most KrullDim(I)).
Proof. In a chain of homogeneous prime ideals, the HilbDim must drop at each step by (1) of the last theorem. That gives "HilbDim is at most homogeneous KrullDim".
Conversely, we can alternate the following two steps: increase I to a prime ideal without changing the HilbDim (using (2b)), and then increase it using one new homogeneous generator, lowering the HilbDim by 1, by the calculation last week. We get stuck only when we get to whole ring. This constructs a long sequence of prime ideals, giving "HilbDim is at least homogeneous KrullDim".
Monday, March 09, 2009
Monday 3/9
Domains, prime ideals, Krull dimension.
Next time: Krull dimension = degree(Hilbert polynomial)+1 for homogeneous ideals.
Next time: Krull dimension = degree(Hilbert polynomial)+1 for homogeneous ideals.
Thursday, March 05, 2009
HW #7, due Wednesday 3/11 (corrected)
1. Let I be a homogeneous ideal in a polynomial ring R, and r a homogeneous element of degree k.
Let J = I + < r >.
Show that
a) For each n, h_J(n) is at least h_I(n) - h_I(n-k).
b) If they are equal for all n, then r is not a zero divisor.
2. A list {r_1, r_2, ..., r_m} is called a regular sequence if each r_j is not a zero divisor in R/< r_1, ..., r_{j-1} >.
If {b,c} is a regular sequence, show that {c,b} is a regular sequence.
Oops: I had meant b,c to be homogeneous. (It's true even if they're not, but don't bother with that.)
3. Let p(n) be a polynomial of degree d, and k a number. Show that q(n) = p(n) - p(n-k) is a polynomial of degree d-1.
4. For p(n) a polynomial, let Delta p be the polynomial with values (Delta p)(n) = p(n) - p(n-1).
Notice that if p only takes integer values (when fed integers), then Delta p does so too.
a) Show that Delta {n choose k} = {n n-1 choose k-1}.
b) Show that every polynomial p(n) is a linear combination of the polynomials {n choose k}, where k goes from 0 to degree p.
c) Give an example of a polynomial with noninteger coefficients that nonetheless always produces integers.
d) Show that every integer-valued polynomial p(n) is a linear combination with integer coefficients of the polynomials {n choose k}, where k goes from 0 to degree p.
(In particular, this applies to Hilbert polynomials.)
5. Let I in C[x_1...x_5] be generated by {x_i x_j - x_k x_l}, for all i,j,k,l such that i+j=k+l.
a) Show this is a Gr\"obner basis with respect to lex order.
b) Find the reduced Gr\"obner basis.
c) Decompose V(the initial ideal).
d) Compute the Hilbert polynomial.
Let J = I + < r >.
Show that
a) For each n, h_J(n) is at least h_I(n) - h_I(n-k).
b) If they are equal for all n, then r is not a zero divisor.
2. A list {r_1, r_2, ..., r_m} is called a regular sequence if each r_j is not a zero divisor in R/< r_1, ..., r_{j-1} >.
If {b,c} is a regular sequence, show that {c,b} is a regular sequence.
Oops: I had meant b,c to be homogeneous. (It's true even if they're not, but don't bother with that.)
3. Let p(n) be a polynomial of degree d, and k a number. Show that q(n) = p(n) - p(n-k) is a polynomial of degree d-1.
4. For p(n) a polynomial, let Delta p be the polynomial with values (Delta p)(n) = p(n) - p(n-1).
Notice that if p only takes integer values (when fed integers), then Delta p does so too.
a) Show that Delta {n choose k} = {
b) Show that every polynomial p(n) is a linear combination of the polynomials {n choose k}, where k goes from 0 to degree p.
c) Give an example of a polynomial with noninteger coefficients that nonetheless always produces integers.
d) Show that every integer-valued polynomial p(n) is a linear combination with integer coefficients of the polynomials {n choose k}, where k goes from 0 to degree p.
(In particular, this applies to Hilbert polynomials.)
5. Let I in C[x_1...x_5] be generated by {x_i x_j - x_k x_l}, for all i,j,k,l such that i+j=k+l.
a) Show this is a Gr\"obner basis with respect to lex order.
b) Find the reduced Gr\"obner basis.
c) Decompose V(the initial ideal).
d) Compute the Hilbert polynomial.
Wednesday, March 04, 2009
Answers to HW #6 (tiny correction to #1)
1. Let I be a radical ideal, and {g_1..g_m} a reduced Gr\"obner basis for it.
Show that each g_i is squarefree, i.e. is not divisible by f^2 for any polynomial f of degree > 0.
If g_i = f^2 h, then h g_i = f^2 h^2 is in I too, so fh is in I (by the assumption I = Rad(I)). Hence some init(g_j) divides init(fh). By the assumption deg f > 0, j is not i. Since init(g_j) divides init(fh), it divides init(g f^2 h) = init(g_i). But then our list is not a reduced Gr\"obner basis, contradiction.
2. Let I be an ideal such that for all f, if f^2 is in I, then f is in I. Show that I is radical.
If I is not radical, then there exists g not in I, and a number N, such that g^N is in I. Let k be the least number such that g^k is in I. (So k > 1, and is at most N.) Let f = g^{k-1}. Then f^2 = g^{2(k-1)} = g^k g^{k-2}, which only makes sense because k is at least 2. In particular, f is not in I, but f^2 is in I.
3. Let I be a monomial ideal generated by squarefree monomials. Show that I is radical.
Hint: show that if p is in I, then init(p) and p-init(p) are in I. Use this to show that it is enough to test the condition in question #2 when f is a monomial.
4. Let I be an ideal with a Gr\"obner basis {f_1,...,f_n}, such that each init(f_i) is a squarefree monomial. Show that I is radical.
#3 is actually the special case of #4 where each f_i = init(f_i). So we'll just do #4.
By #2 it's enough to check that f^2 in I => f in I.
So say f is a polynomial such that f^2 is in I. If f=0 we're done; otherwise we can talk about init(f).
Since f^2 is in I and we have a Gr\"obner basis, some init(f_i) | init(f^2) = init(f)^2.
Since init(f_i) is squarefree, it already divides init(f).
So we can replace f by f - m f_i where m = init(f)/init(f_i), canceling the leading term of f. This new guy has (f - mf_i)^2 = f^2 + f_i(-2m + f_i), so again in I, so we can run the reduction algorithm again. Since it only gets stuck when f=0, we see that f reduces to 0, which means f is in I.
5. Let I and J be two radical ideals.
a) Show that I intersect J is radical.
b) Give an example where I+J (which concatenates their generators) is not radical.
a) If f^N is in I intersect J, then f^N is in I and f^N is in J, hence f is in I and J, hence f is in I intersect J.
b) My favorite example is I = < y >, J = < y-x^2 >. (We can see that J is radical by taking a term order for which y is the leading term and applying #4.)
6. Let I = < ac,bc,bd,ae,de > inside C[a,b,c,d,e]. Decompose V(I) as a union of subspaces. Make it minimal, so no subspace in your list contains another.
If a=0, we have bc,bd,de=0 left.
If b=0, we have de=0 left, so either d=0 or e=0. So far {a=b=d=0} union {a=b=e=0}.
If not b=0, we have c=d=0. This adds {a=c=d=0}.
If not a=0, we have c=e=0, leaving bd=0, so either b=0 or d=0: {c=e=b=0} union {c=e=d=0}.
In the end, the solutions are the union of five 2-planes in 5-space.
Show that each g_i is squarefree, i.e. is not divisible by f^2 for any polynomial f of degree > 0.
If g_i = f^2 h, then h g_i = f^2 h^2 is in I too, so fh is in I (by the assumption I = Rad(I)). Hence some init(g_j) divides init(fh). By the assumption deg f > 0, j is not i. Since init(g_j) divides init(fh), it divides init(
2. Let I be an ideal such that for all f, if f^2 is in I, then f is in I. Show that I is radical.
If I is not radical, then there exists g not in I, and a number N, such that g^N is in I. Let k be the least number such that g^k is in I. (So k > 1, and is at most N.) Let f = g^{k-1}. Then f^2 = g^{2(k-1)} = g^k g^{k-2}, which only makes sense because k is at least 2. In particular, f is not in I, but f^2 is in I.
3. Let I be a monomial ideal generated by squarefree monomials. Show that I is radical.
Hint: show that if p is in I, then init(p) and p-init(p) are in I. Use this to show that it is enough to test the condition in question #2 when f is a monomial.
4. Let I be an ideal with a Gr\"obner basis {f_1,...,f_n}, such that each init(f_i) is a squarefree monomial. Show that I is radical.
#3 is actually the special case of #4 where each f_i = init(f_i). So we'll just do #4.
By #2 it's enough to check that f^2 in I => f in I.
So say f is a polynomial such that f^2 is in I. If f=0 we're done; otherwise we can talk about init(f).
Since f^2 is in I and we have a Gr\"obner basis, some init(f_i) | init(f^2) = init(f)^2.
Since init(f_i) is squarefree, it already divides init(f).
So we can replace f by f - m f_i where m = init(f)/init(f_i), canceling the leading term of f. This new guy has (f - mf_i)^2 = f^2 + f_i(-2m + f_i), so again in I, so we can run the reduction algorithm again. Since it only gets stuck when f=0, we see that f reduces to 0, which means f is in I.
5. Let I and J be two radical ideals.
a) Show that I intersect J is radical.
b) Give an example where I+J (which concatenates their generators) is not radical.
a) If f^N is in I intersect J, then f^N is in I and f^N is in J, hence f is in I and J, hence f is in I intersect J.
b) My favorite example is I = < y >, J = < y-x^2 >. (We can see that J is radical by taking a term order for which y is the leading term and applying #4.)
6. Let I = < ac,bc,bd,ae,de > inside C[a,b,c,d,e]. Decompose V(I) as a union of subspaces. Make it minimal, so no subspace in your list contains another.
If a=0, we have bc,bd,de=0 left.
If b=0, we have de=0 left, so either d=0 or e=0. So far {a=b=d=0} union {a=b=e=0}.
If not b=0, we have c=d=0. This adds {a=c=d=0}.
If not a=0, we have c=e=0, leaving bd=0, so either b=0 or d=0: {c=e=b=0} union {c=e=d=0}.
In the end, the solutions are the union of five 2-planes in 5-space.
Wednesday 3/4
Thm. The Hilbert function of R/I is eventually a polynomial, the "Hilbert polynomial".
Def. Zero divisor in a ring.
Thm: If R/I contains a nonzero divisor r of degree k, then one can write down the Hilbert series and polynomial of R/(I +) in terms of that of R/I.
Ex. If r,s are of degree A and B in C[x_1..x_n], then r is automatically a nonzero divisor, but s might be a zero divisor in R/< r >. If it's not, then the Hilbert series is 1/(1-t)^n * (1-t^A) * (1-t^B).
(Remember a HW problem that asked for a Hilbert series that looked like that?)
Def. Zero divisor in a ring.
Thm: If R/I contains a nonzero divisor r of degree k, then one can write down the Hilbert series and polynomial of R/(I +
Ex. If r,s are of degree A and B in C[x_1..x_n], then r is automatically a nonzero divisor, but s might be a zero divisor in R/< r >. If it's not, then the Hilbert series is 1/(1-t)^n * (1-t^A) * (1-t^B).
(Remember a HW problem that asked for a Hilbert series that looked like that?)
Monday 3/2
We proved the strong Nullstellensatz: I_V(I) = I.
I talked about my favorite Gr\"obner bases, which led to pipe dreams. The paper is here if you're feeling really ambitious.
I talked about my favorite Gr\"obner bases, which led to pipe dreams. The paper is here if you're feeling really ambitious.
Tuesday, March 03, 2009
Answers to HW #5
Let I = < f_1, ..., f_k > where the f_i are each homogeneous polynomials.
1. Show that I has a Grobner basis consisting of homogeneous polynomials.
When the reduction algorithm is asked to reduce a homogeneous polynomial, using other homogeneous polynomials, the result is homogeneous.
The S-polynomial of two homogeneous polynomials is homogeneous (of degree = degree(that lcm)).
Hence Buchberger's algorithm creates not just a Gr\"obner basis, but one consisting of homogeneous polynomials.
2. Assume hereafter that the {f_i} are a reduced Grobner basis.
Recall that the Hilbert function h_I(n) is the dimension of R_n / I_n.
Call a monomial standard if it isn't divisible by any of the leading monomials of the {f_i}.
Show that h_I(n) is the number of standard monomials of degree n.
Let {x^e} denote the set of standard monomials of degree n (e is really a vector, here).
Then the claim is that their images {x^e + I_n} form a basis of R_n / I_n.
Proof: given an element r of R_n (not necessarily in I), when we run the reduction algorithm on r we get stuck at a new element r+i in the same coset r+I. But this r+i is a C-linear combination of the {x^e} (or we wouldn't be stuck). So r+I is a combination of {x^e + I}, i.e. the {x^e + I_n} span R_n / I_n.
Now look at a linear combination \sum_e c_e x^e. For this to give the zero element of R_n / I_n, it needs to be in I_n, i.e. to be in I. But the reduction algorithm will be stuck on this, unless it's already the zero polynomial, i.e. all the c_e were zero. So the {x^e + I_n} are linearly independent.
3. Show that h_I = h_{init I}, so H_I = H_{init I} (the Hilbert series).
I and init I have the same standard monomials (since they were defined using only the initial terms in the Gr\"obner basis), so by #2 their Hilbert functions are the same, and the Hilbert
series are derived from those.
4. The polynomial b^2 - ac has two possible leading terms (depending on term order), so I = < b^2 - ac > has two possible init I. Compute each of their Hilbert series (and show they are equal, as problem 3 predicts).
Either way we get (1 - t^2) / (1-t)^3; the 2 is 0+2+0 when b^2 is the leading term, and 1+0+1 when ac is.
5. Let I = < the entries of M^2, where M is a 2x2 matrix >. Compute the Hilbert series H_I.
We computed a Gr\"obner basis for I in class,
bc + d^2, ac + cd, ab + bd, a^2 - d^2, ad^2 + d^3
whose initial terms are {bc, ac, ab, a^2, ad^2}.
Then our formula for the Hilbert series of that monomial ideal is 1/(1-t)^4 times
1 - (4t^2 + t^3) + (5t^3 + 4t^4 + t^5) - (t^3 + 3t^4 + 5t^5 + t^6) + (t^4 + t^5 + 3t^6) - t^6
where I've grouped the 2^5 terms according to the sizes of the subsets of the generators,
= 1 - 4t^2 + 3t^3 + 2t^4 - 3t^5 + t^6.
6. Let J be the larger ideal containing I and also the generator Trace(M). Compute the Hilbert series H_J.
This has a much simpler reduced Gr\"obner basis: a+d, bc+d^2.
The initial terms are {a,bc}, and the numerator of the Hilbert series is 1 - t - t^2 + t^3.
Note that this factors as (1-t)(1-t^2), which is secretly a statement about the independence of these generators.
1. Show that I has a Grobner basis consisting of homogeneous polynomials.
When the reduction algorithm is asked to reduce a homogeneous polynomial, using other homogeneous polynomials, the result is homogeneous.
The S-polynomial of two homogeneous polynomials is homogeneous (of degree = degree(that lcm)).
Hence Buchberger's algorithm creates not just a Gr\"obner basis, but one consisting of homogeneous polynomials.
2. Assume hereafter that the {f_i} are a reduced Grobner basis.
Recall that the Hilbert function h_I(n) is the dimension of R_n / I_n.
Call a monomial standard if it isn't divisible by any of the leading monomials of the {f_i}.
Show that h_I(n) is the number of standard monomials of degree n.
Let {x^e} denote the set of standard monomials of degree n (e is really a vector, here).
Then the claim is that their images {x^e + I_n} form a basis of R_n / I_n.
Proof: given an element r of R_n (not necessarily in I), when we run the reduction algorithm on r we get stuck at a new element r+i in the same coset r+I. But this r+i is a C-linear combination of the {x^e} (or we wouldn't be stuck). So r+I is a combination of {x^e + I}, i.e. the {x^e + I_n} span R_n / I_n.
Now look at a linear combination \sum_e c_e x^e. For this to give the zero element of R_n / I_n, it needs to be in I_n, i.e. to be in I. But the reduction algorithm will be stuck on this, unless it's already the zero polynomial, i.e. all the c_e were zero. So the {x^e + I_n} are linearly independent.
3. Show that h_I = h_{init I}, so H_I = H_{init I} (the Hilbert series).
I and init I have the same standard monomials (since they were defined using only the initial terms in the Gr\"obner basis), so by #2 their Hilbert functions are the same, and the Hilbert
series are derived from those.
4. The polynomial b^2 - ac has two possible leading terms (depending on term order), so I = < b^2 - ac > has two possible init I. Compute each of their Hilbert series (and show they are equal, as problem 3 predicts).
Either way we get (1 - t^2) / (1-t)^3; the 2 is 0+2+0 when b^2 is the leading term, and 1+0+1 when ac is.
5. Let I = < the entries of M^2, where M is a 2x2 matrix >. Compute the Hilbert series H_I.
We computed a Gr\"obner basis for I in class,
bc + d^2, ac + cd, ab + bd, a^2 - d^2, ad^2 + d^3
whose initial terms are {bc, ac, ab, a^2, ad^2}.
Then our formula for the Hilbert series of that monomial ideal is 1/(1-t)^4 times
1 - (4t^2 + t^3) + (5t^3 + 4t^4 + t^5) - (t^3 + 3t^4 + 5t^5 + t^6) + (t^4 + t^5 + 3t^6) - t^6
where I've grouped the 2^5 terms according to the sizes of the subsets of the generators,
= 1 - 4t^2 + 3t^3 + 2t^4 - 3t^5 + t^6.
6. Let J be the larger ideal containing I and also the generator Trace(M). Compute the Hilbert series H_J.
This has a much simpler reduced Gr\"obner basis: a+d, bc+d^2.
The initial terms are {a,bc}, and the numerator of the Hilbert series is 1 - t - t^2 + t^3.
Note that this factors as (1-t)(1-t^2), which is secretly a statement about the independence of these generators.
Subscribe to:
Posts (Atom)