This is a post that I wrote last fall but never finished because it was getting out of control. I’m going to put it up because someone might find it useful as is.
—
—
Today I’m going to type up a lot of the basics of intersection theory from the beginning. We’ll be following Fulton’s “Introduction to Intersection Theory in Algebraic Geometry.” We begin by looking at some of the historical ways that people studied intersection theory. In the meantime we will try to learn something about divisors. And of course we’ll have a lot of pictures. So let’s get started – let’s learn some intersection theory!
One of the most basic questions in intersection theory is to describe the intersection of several hypersurfaces. Perhaps the simplest case would be the intersection of two curves of degrees
in
. Working over the complex numbers in projective space, if we are able to count the multiplicity correctly the correct answer is that the curves intersect in precisely
points. This result is usually referred to as Bezout’s theorem. As we will see, the hardest part of this theory (and of intersection theory in general) is determining the correct way to define multiplicity.
First some motivation for curves: Suppose that curves
intersect at a point
. We’d like to define the intersection multiplicity. If the curves intersect transversely then this intersection number should be 1. To understand what happens when the curves do not intersect transversely, consider the following sequence of curves,



As these pictures indicate, if we want intersection multiplicity to have any sort of continuity property, then we had better make sure that a the intersection multiplicity is three in all of these cases. Similarly the following picture shows the case of a tangent line on a conic having multiplicity two.

What if they don’t intersect transversely?
As a matter of computing the multiplicity, If two curves do not intersect transversely, we can look locally around
and write out the power series for
. These power series will agree for some number of terms, which we can define to be the multiplicity. Let’s do an example to see what is going on.
Example: Consider the intersection of the line
with the parabola
. In local coordinates the power series are
and
. Since these agree for two terms we say they intersect with multiplicity two.
Ok, perhaps you thought that was a stupid example. Here’s a better one:
Example: Consider the intersection of the line
with the cusp
. In local coordinates at the origin… How exactly should this work? So intuitively, if you plug in
into the equation you obtain
which should then intersect with multiplicity three by a power series argument. Is there a way to do this directly?
In both of these examples, we can also compute the intersection multiplicity simply by looking at the dimension of a local ring
![\dim_k (k[x,y]/(f,g))_P \dim_k (k[x,y]/(f,g))_P](http://l.wordpress.com/latex.php?latex=%5Cdim_k+%28k%5Bx%2Cy%5D%2F%28f%2Cg%29%29_P+&bg=161410&fg=999999&s=0)
where

are the local equations for the curves. In the second example above this computation yields
Ideally an intersection theory for varieties in higher dimension would provide us with a way of counting multiplicity, so that if hypersurfaces of degree

intersected to form

points then

– the natural generalization of Bezout’s theorem. At the end of this entry we will give a proper definition (and see why the above ideas aren’t quite good enough!)
The Class of a Curve (Dual Curves)
Let

be a curve in

. One number we can associate to

is its class. The class of a curve is defined to be the number of tangent lines to the curve passing through a general point. Equivalently, this is the degree of the dual curve

, which is constructed as follows: Recall that by duality, lines in

are in natural bijection with

given by the coorespondence
The dual curve of

is the curve consisting of all the points dual to the tangent lines of

. This can be realized quite explicitly in fact.
If

is a homogeneous polynomial defining

, then

is given by the set of all points of the form
where
denotes the partial derivative with respect to
etc.
Example: The dual of the curve defined by
is given by the set of all
which if we call our new coordinates on
we see this is the curve defined by
.
Below is an example of a more complicated curve and its dual (original on the left, duals on the right). The equations for the curves are listed in the plots. I used Mathematica to plot everything, and Macaulay 2, to find the equations (which is basically just finding relations among the partial derivatives)


As you can see in the above examples, singularities can arise in taking the dual curve, most notably at points of inflection on the original curve. It should now be apparent after a moment’s thought that the degree of the dual curve (that is the number of intersection points with a generic line) is the same as the class of the original curve, by duality. To get a grasp on this number we define the polar curve associated to
.
If
is any point in the plane, we define the polar curve
to be the curve defined by the equation

It is straightforward to check that a nonsingular point
of
is on
exactly when the tangent line to
at
passes through
. Also if
is not a point of inflection, then
and
intersect transversally. Thus if the degree of
is
and
is nonsingular, then

But wait… if
then this seems to imply that the degree of the dual curve is always greater than the degree of the original curve. Since we want (and indeed it’s true!) that the double dual is just the original curve, this should be cause for alarm. The answer lies in studies what happens at singular points. Unfortunately, if
has singular points they will always lie on this intersection as well. You can check that ordinary nodes will contribute 2 to this intersection, and ordinary cusps 3. Thus the correct formula (at least for curves containing
ordinary nodes and
ordinary cusps) is

Thus it happens that just the right amount of singularities arise on the dual curve so that when we take the dual again, we get our original curve back. Indeed, in the example of our cubic above we started with something of degree 3, and obtained something of degree 6 with some singularities. Thus the degree of the double dual should be of degree 30 minus some singularities. Using Mathematica you discover it has exactly nine singular points, all of them ordinary cusps, yielding the magic formula
