Today we think about plane curves. But first a bit on projective space. Recall that the Grassmannian is the parameter space of -planes in -dimensional space, and so . We noted at the time that . So that means that we also get a projective space . So for , we have a dual projective space, denoted consisting of all the hyperplanes in .

In coordinates for , take a point . This gives the line in , whose coordinates are given by the . Now this lets us define the dual of a curve by saying that . Now, we’re going to show that this is in fact an algebraic curve, that if was irreducible, so will be. It is also true that , but that we leave as an exercise. In fact, it’s true that . But we will make the assumption that has no components which are lines, so if we assume irreducibility, that just means that in the first place.

Let be the equation of and let be an arbitrary line. On the open set in where , we can use this to eliminate the variable from , and get with the homogeneous polynomials of degree in the . Zeros of this polynomial are the intersections of with the line . Let be the discriminant of . It will be homogeneous of degree in the variables . Now, the discriminant is nonzero, and so we have . This isn’t quite the dual curve yet, but it’s getting close.

So now we’re going to kill linear factors of . The only reason we might not have turns out to be that there are extra lines. So let’s look at what sorts of lines we might get before we actually check this. Look at point in . We can assume, for simplicity, that and so is nonzero at these points, which are of the form . Let be a line through , it will have the form . Now , so we have . Thus, divides , and so does all of .

The other type of linear factor that can arise is from singularities. Assume is a singular point, and we can assume and so is 1, because we already handled all points with . Now we let be a line through and see that has a multiple zero at , so the discriminant must vanish. So the line is another irreducible component. Now there’s only finitely many lines of either type.

So now look at minus all of these lines. We claim that is the closure of this set. Now, this set is the same as the set of all tangent lines to smooth points of . That its closure is follows from the fact that a line through a point is a tangent line if and only if there is a sequence of points converging to the point whose tangent lines converge to the line. So, , which is thus algebraic.

To check irreducibility, we notice that for the set of smooth points of , we have an injective map. In fact, this map has image , and has closure . Thus, as the original curve is irreducible, the image of an open subset is, and so is its closure, so is irreducible.

Now, the problem with examples is that you get high degree polynomials most of the time. However, we can work out , the cuspidal cubic, explicitly. We jump right to the polynomial which we take the discriminant of, and it gives us . It has discriminant . The part we want, just happens to be another cuspidal cubic. Now, if you try a general elliptic curve, you’ll get a higher degree dual curve, so you don’t normally get a curve like what you started with back.

Now, the dual curve does strongly reflect the geometry of the original curve. For instance, we define a multiple tangent to be a line which is tangent to at more than one point. These will correspond to singularities of the dual curve, which are ordinary -fold points if is the number of points of tangency. By this we mean that the point on the dual curve will have distinct tangent directions and around that point the equation of the dual curve can be written to have smallest term of degree . Now, as the dual is algebraic, it has finitely many singularities, so only finitely many lines can be multiple tangents to .

So the point is, that the dual curve is useful for working out the geometry of your curve, and that you can explicitly compute what it is, so long as you have powerful enough computational tools (generally you’ll get bored or make a mistake trying to do these computations by hand…or at least I do).

An aside: I believe that this procedure can be generalized as follows: let be a variety. Then there is a dual variety sitting in which consists of the -planes tangent to , though I’ve never seen mention of this anywhere, and it’s not obvious how to get the equations for it on the Grassmannian. Has anyone encountered this?

Thanks, I’m going to take a look at that. I’d just never run into anything other than duals of plane curves before, and was curious. I assume that there’s something like Plücker formulas in this case, and it can be used to count things? Though possibly less effectively, because surfaces can have infinitely many singular points.

Could you be a little more specific in your question maybe? If you take the Nash blow-up of a smooth plane curve, you arrive at something isomorphic to the curve you started with. But in general (i.e. almost always), the dual curve of a smooth plane curve is not isomorphic to the original one – it will be singular for example.

Joe Harris’ book on algebraic geometry has a brief description of Nash Blowups I think – it might be a place to start.

From Harris, it looks to me like the Nash blowup is just the graph of the rational map into the Grassmannian (in general). For plane curves, you get a map , the closure of the image of which is the dual curve. The graph is then the Nash blowup. So it seems to me that if you take the Nash blowup and then project to the Grassmannian (in the case of hypersurfaces, the projective space), you’ll get the dual variety (curve).

Ok, thanks. I was asking because I read an article in which the author relates the singularities of a curve and those of its dual and finds numerical relations like the Plucker formulas. Using that I was trying to say something about the Nash blowup, being as you know, a kind of combination of the curve and its dual.