Compute the arithmetic genus of the union of the three coordinate axes Z(x_1 x_2, x_1 x_3, x_2 x_3) subseteq P^3.
Howard Nelson
Answered question
2022-11-03
Compute the arithmetic genus of the union of the three coordinate axes Compute the arithmetic genus of the union of the three coordinate axes The arithmetic genus of is , where is the Hilbert polynomial of X. Let I guess that , since the coordinate is free. I showed that if X is a hypersurface of degree d in , then . I don't think that this can be applied to this problem but it's a general result that I know. I showed also that if X is a complete intersection of two surfaces of degree a and b in , then . Is there any solution of this problem that does not involve computing the Hilbert polynomial of X? However, if computing the Hilbert polynomial is simplier, that's ok for me.
Answer & Explanation
Taniyah Lin
Beginner2022-11-04Added 14 answers
Step 1 There is a nice general method for calculating the arithmetic genus of a reducible curve like this where a bunch of curves are being glued transversely. It uses the (equivalent) description of the arithmetic genus of a curve X over a field as the dimension of the cohomology group . So suppose and are curves over a field. Let X denote the curve we get by glueing a point transversely to a point . Call the image of the glueing points . Then we have an exact sequence of sheaves on X of the form
where is the skyscraper sheaf supported at p. (The first map is pullback of functions; the second is zero away from p, and on open sets containing p.) Step 2 Now take cohomology of this sequence: you get
where the final zero comes from the fact that is supported at a single point. Now, I leave it to you to check that the first three nonzero terms give a short exact sequence. That implies that
In other words, arithmetic genus is additive when we glue curves transversely at a point! Notice that we didn't require anything to be smooth or irreducible, so you can apply this in your situation in two steps by glueing two of the axes together, then glueing on the third. Exercise: Modify the above argument to show that if Y is a curve obtained by transverse glueing of two points on the same connected curve X, then
Use this to figure out what happens when you glue any number of curves transversely at any number of points!
Kenna Stanton
Beginner2022-11-05Added 3 answers
Step 1 Here is an elementary, easy, self-contained proof which, as a friend reminded me, results from a discussion we had a few months ago. I could kick myself for forgetting about it yesterday ... Consider two subschemes .
From the exact sequence
we get the relation between Hilbert polynomials
Applying this to
we get, remembering that is just a reducible plane conic so that , that is a line so that , and that is a reduced point with Hilbert polynomial the constant 1:
Hence and thus . Step 2 WARNING One might wonder why (fortunately!) the above calculation doesn't work when is a line in the same plane as , going through the singularity P of . The answer is that in this case the intersection is no longer a simple point but the double point at P embedded in . In that case the analogous calculation yields for the Hilbert polynomial , as already mentioned in my other answer. One must very carefully note that the formula is correct only if one interprets union and intersection in the scheme-theoretic sense: never ever forget about nilpotents!