Enumerative Algebraic Geometry of Conics
Enumerative Algebraic Geometry of Conics
Enumerative Algebraic Geometry of Conics
ax 2 + bx y + cy 2 + d x + ey + f = 0, (1)
where not all of the coefficients are zero. Circles, ellipses, hyperbolas, and parabolas
are common examples of conics. In these examples the polynomial defining the conic
is irreducible and the conic is said to be nondegenerate. If the polynomial defining
the conic factors into a product of linear polynomials, then the conic is just the union
of two lines. Such a conic is said to be degenerate. When the two lines are the same,
or the polynomial defining the curve is a square of a linear polynomial, then the conic
should be thought of as a double line, a line with some additional algebraic structure.
These double lines play a key role in counting problems involving conics.
Figure 1. Parabolas, ellipses, and hyperbolas are conics. So are pairs of lines.
702
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
The set of lines through the origin in R6 is called the five-dimensional real pro-
jective space and is denoted RP5 . It serves as our moduli space for conics, a space
whose points are in one-to-one correspondence with the set of conics.
Why is RP5 five-dimensional? Well, each point of RP5 is part of an open set which
can be identified with R5 . Given a point in RP5 , one of its homogeneous coordinates
a, . . . , f is not zero. Let us suppose that f = 0. Then the set U f = {[a : b : c : d : e :
f ] : f = 0} can be identified with R5 via
a b c d e a b c d e
[a : b : c : d : e : f ] = : : : : :1 ∼ , , , , ∈ R5 .
f f f f f f f f f f
In this sense, RP5 is a five-dimensional space. More generally, the set of lines through
the origin in Rn+1 forms n-dimensional real projective space, RPn .
2.1. The basic counting strategy. We’ve described the moduli space RP5 for plane
conics. Using certain subsets of this moduli space, we can introduce the basic strategy
to count the conics passing through some fixed points and tangent to some fixed lines
or conics. For each point p we form the subset H p ⊂ RP5 of conics passing through
the point, for each line we form the subset H ⊂ RP5 of conics tangent to , and for
each given nondegenerate conic Q we form the subset HQ of conics tangent to Q. The
points in the intersection of all of these subsets correspond to conics that pass through
all of the points and are tangent to all of the lines and conics. This shift, from counting
conics to counting the number of points in an intersection of certain subsets of RP5 ,
may seem like a sleight of hand but it allows us to use the geometry of RP5 as well as
the geometry of the plane to solve our counting problems.
Let’s examine these subsets H p , H , and HQ in more detail. To be concrete, let’s fix
a point, say p (2, 3). If a conic defined by equation (1) passes through p, then it must
be true that 4a + 6b + 9c + 2d + 3e + f = 0. We see that this is a linear equation
in a, b, c, d, e, and f . The set of points in RP5 satisfying this condition forms a
four-dimensional plane, or a hyperplane in RP5 . Each point on this hyperplane H p
corresponds to a conic passing through p (2, 3). If we chose a different point q ∈ R2
we would get a different hyperplane Hq . Points on the intersection of H p and Hq will
correspond to conics passing through both p and q.
Similarly, if we look at all of the conics tangent to a particular line, for example the
line y = 0, we get a four-dimensional hypersurface H in RP5 . This can be seen by first
finding the intersection of a general conic, ax 2 + bx y + cy 2 + d x + ey + f = 0, and
the line y = 0. The points of intersection have the form (x, 0), where ax 2 + d x + f =
0. Usually we have two different points of intersection and the line y = 0 is a secant
line to the conic. But when the discriminant d 2 − 4a f is zero the two points coincide
and the line y = 0 is tangent to the conic. So the points in RP5 that satisfy the equation
d 2 − 4a f = 0 correspond to the conics that are tangent to the line y = 0. If we started
with a different line in R2 we would get a hypersurface H defined by a different
degree 2 equation.
Lastly, if we look at all of the conics tangent to a particular conic Q, for example
the parabola y = x 2 , we also get a four-dimensional hypersurface in RP5 . To find its
equation, we substitute y = x 2 into the general conic equation to get cx 4 + bx 3 +
(a + e)x 2 + d x + f = 0. The two conics will be tangent when this polynomial has
a multiple root, which again is when the discriminant is zero. The discriminant of a
degree four polynomial has degree six in the coefficients ([6, p. 42]), so HQ is a degree
six hypersurface in RP5 . If we started with a different nondegenerate conic Q, we
would get a hypersurface defined by a different degree 6 equation.
3.1. Five points. Let’s count the number of conics passing through five points in the
plane. First, each point p imposes a hyperplane condition H p on our conic. Thinking
of RP5 as the set of lines through the origin in R6 , each hyperplane H p corresponds
to a hyperplane (a five-dimensional subspace) of R6 . If these hyperplanes are linearly
independent then their intersection is a one-dimensional subspace of R6 . This line
through the origin in R6 corresponds to a single point in RP5 . In turn, this single point
represents a unique conic passing through all five points. We’ve shown that when the
five points impose independent hyperplane conditions there is a unique conic passing
through all five points.
It turns out that the points impose independent hyperplane conditions precisely
when no four of the points are collinear. This requires a little argument, as follows.
When four or five of the points are collinear, then there are lots of conics that pass
through all of the points (and hence the hyperplanes couldn’t impose independent con-
ditions): just consider conics consisting of pairs of lines, where one line passes through
the four collinear points and the other is any line that passes through the fifth point, as
in Figure 2. So we may restrict our attention to the case where no four of the points lie
on a line.
704
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
The question is not dependent on our choice of coordinates on the plane, so we
choose coordinates such that three of the points are p1 (0, 0), p2 (1, 0), and p3 (0, 1).
We’ll label the other two points p4 (s, t) and p5 (u, v), as in Figure 3.
p4 (s,t)
p3 (0,1) p5 (u,v)
p1 (0,0)
p2 (1,0)
The system of equations imposed by these five points has coefficient matrix
⎡ ⎤
0 0 0 0 0 1
⎢1 0 0 1 0 1⎥
⎢ ⎥
M =⎢0 0 1 0 1 1⎥ .
⎣ s 2 st t 2 s t 1⎦
u 2 uv v 2 u v 1
The five constraints fail to impose linearly independent conditions precisely when
this matrix fails to have full rank. The maximal rank of M is 5, so we can detect when
the matrix does not have full rank by checking that all of the 5 × 5-submatrices of M
have determinant zero.1 By deleting one column at a time, we get six polynomials that
are simultaneously zero precisely when M fails to have maximal rank. One of these
(when the last column is deleted) is always zero; the first and fourth are the same, and
the third and fifth are the same, so we end up with three conditions:
Some careful case-by-case analysis will show that if all three of these equations hold,
then either four of the given points are collinear or two of the points are coincident. For
example, if the first equation holds, either t = 0, v = 0, or s(v − 1) = u(t − 1). If t =
0, then the second equation says that either s = 0, in which case p4 (s, t) = p1 (0, 0);
s = 1, in which case p4 (s, t) = p2 (1, 0); v = 0, in which case p1 , p2 , p4 , and p5 are
collinear; or u = 0. If t = u = 0, then the third equation requires two points to be
coincident. Going back to the first equation, the case of v = 0 is essentially identical
to the case of t = 0. The last case is where s(v − 1) = u(t − 1), or t−1 s
= v−1
u
. This
says that p3 , p4 , and p5 are collinear. Looking again at equation two in this case, either
s = 0 or u = 0 will cause p1 to be on the same line with p3 , p4 , and p5 ; the last
possibility, that v(s − 1) = t (u − 1), causes p2 to be on this line instead; either way
we have four collinear points.
1 This is a useful characterization of rank: A matrix has rank < d if and only if the determinants of all its
This means that the matrix M fails to have maximal rank precisely when the poly-
nomials generating one of the primary ideals vanish. The first seven of these pairs of
equations just indicate that two of our five points are equal, while the last three pairs
indicate that four of our points are collinear.
The upshot of all this is that the five points impose linearly independent conditions
if and only if no four of the points are collinear.
Theorem 1. Given five points in the plane, no four of which lie on a line, there is
a unique conic passing through the five points. The conic is nondegenerate precisely
when no three of the points are collinear.
Proof. It just remains to prove the last statement. If three of the points are collinear but
no four are collinear, the unique conic passing through all of the points is a degenerate
conic, a pair of lines. This is easy to see: three of the points lie on a line L : G(x, y) =
0, and if : H (x, y) = 0 is the line through the other two points, then G H = 0 is the
equation of the unique conic L ∪ passing through the five points. If no three of the
points are collinear, then the pigeonhole principle tells us that there is no pair of lines
containing all five points. Therefore the unique conic passing through all five points
cannot be degenerate.
3.2. Four points and one line. Now we solve the next problem: How many conics
pass through four given points and are tangent to a given line? In answering this ques-
tion, we’ll see that it is necessary to develop a more expansive view of plane conics
and tangency.
Each of the four points gives a linear condition, and the reader can check that the
four conditions are independent if and only if the four points are not collinear. The
intersection of the four hyperplanes is a line in RP5 . Recall that the set of conics
tangent to a line in the plane formed a hypersurface H , whose defining equation had
706
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
degree 2. The intersection of the line with H can be found by plugging the parametric
equation for the line into the equation for H and solving. The resulting equation is
quadratic and so in general we get two solutions. Each solution gives a point in RP5
corresponding to a conic passing through the given four points and tangent to the line
. Therefore in general we expect there to be two such conics as in Figure 4.
Sometimes we need to be a little open-minded to recognize the resulting curves as
conics that satisfy our constraints. For example, consider the conics passing through
the points ( 12 , 2), (2, 12 ), (− 12 , −2), (−2, − 12 ) and tangent to the line y = 0 as in Fig-
ure 5.
Following the algebraic procedure described above, we get two solutions. One solu-
tion corresponds to the pair of crossed lines (y − 4x)(x − 4y) = 0. This pair of lines
certainly passes through the four given points, but in what sense is it tangent to the
given line? Algebraically, plugging the equation of the line into the equation of the
conic gives a quadratic equation with a double root, which is what we associate with
tangency. Geometrically, the given line intersects the crossed lines at their crossing
point. If the given line were moved slightly, it would intersect each line once in two
different points. This also reminds us of tangency. So we will consider this line to be
tangent to this conic, even though the given line and the crossed lines are not tangent
in the sense of derivatives and do not have the same direction at that point.
The other solution we find is the hyperbola x y − 1 = 0. Again, this hyperbola
passes through the four given points, but is it tangent to the given line? Algebraically,
if we plug y = 0 into x y = 1, we get no solutions at all! However, the line and hyper-
bola approach each other as x → ∞. We would like to consider these to be tangent
as well, and we can do this by adding some points to the plane “at infinity.” One way
to do this is to assume that the plane that we have been working in is part of a two-
dimensional projective space, similar to the five-dimensional projective space RP5 that
parameterizes all conics. The projective plane RP2 is the set of all lines through the
origin in R3 , and has coordinates [X : Y : Z], where [X : Y : Z] = [λX : λY : λZ] for
any nonzero λ. We have been looking at the subset where Z is not zero, so the point
[X : Y : Z] is the same as [ XZ : YZ : 1], and the variables we have been calling x and
y are secretly XZ and YZ . The new points we are adding at infinity are the points with
Z = 0.
How does this help us? If we translate our hyperbola x y − 1 = 0 into these new
coordinates, we get XZ YZ − 1 = 0, or X Y − Z 2 = 0. Now plugging in the (also trans-
a X 2 + bX Y + cY 2 + d X Z + eY Z + f Z 2 = 0,
3.3. Bézout’s Theorem. Using the complex projective plane allows us to discuss in-
tersections of curves consistently. For example, in the projective plane, two lines al-
ways intersect in one point—parallel lines meet at infinity, just like in a perspective
drawing. As another example, consider a circle and a line in the plane. Algebraically,
plugging the line equation into the circle equation gives a degree two polynomial. If
this polynomial has distinct real roots, then the circle and line will intersect in two
points. If the polynomial has a pair of complex conjugate roots, the circle and line
will look as though they miss each other as in Figure 6. But if we allow points in
the plane to have complex coefficients, then they will intersect at these two complex
points. So in general, the number of intersection points between the circle and the line
is two.
This consistent counting in complex projective space is described by Bézout’s the-
orem:
708
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
Figure 6. Two pictures of a line meeting a circle in two complex points.
We’ve developed our intuition about Bézout’s theorem in the projective plane P2 ,
but now we want to use it in P5 to answer our enumerative questions. First let’s revisit
the problem of counting the conics that pass through 5 points. We saw that these conics
are in bijection with the points in the intersection of five hypersurfaces H p of degree
1. Since these H p are hyperplanes, they intersect transversally when the hyperplanes
impose linearly independent conditions. We saw that this was true if no four of the
points are collinear. In this case, the five hyperplanes intersect in 15 = 1 point by
Bézout’s theorem.
Let us return to the question, “How many conics pass through four given points and
are tangent to a given line?” Now we are intersecting four degree one hyperplanes H p
and one degree two hypersurface H . If these intersect transversally, Bézout’s theorem
says that they will intersect in 14 · 2 = 2 points, so there will be two such conics. In
this case, it turns out that the intersection is transverse unless three of the points are
collinear or one of the points lies on the given line.
It is possible to generalize Bézout’s theorem to cases where the hypersurfaces do
not meet transversally. If the hypersurfaces X 1 , . . . , X n have degrees d1 , . . . , dn and
3.4. Three points and two lines. We can use Bézout’s theorem to count the number
of conics passing through three points and tangent to two lines. The answer we expect
is 13 · 22 = 4. In this case, the intersection will again be transverse unless the three
points are collinear or one of the points lies on one of the lines. So far we’ve managed
to fill in a few columns in Table 1.
Lines 0 1 2 3 4 5
Points p 5 4 3 2 1 0
Conic solutions 1 2 4 ? ? ?
4.1. Excess intersection and general position. It is tempting to guess that the un-
known entries in Table 1 continue as powers of 2. After all, if the five hypersurfaces
involved in each problem intersect transversally, then this result would follow from
Bézout’s theorem. However, it turns out that for the last three point and line prob-
lems the corresponding hypersurfaces cannot intersect transversally, no matter how
we choose the points and lines!
The reason that these hypersurfaces do not intersect transversally involves the
double line conics. The defining polynomial of a double line factors as a perfect
square. We refer to a conic whose defining polynomial is not a perfect square as a
reduced conic. The reduced conics include nondegenerate conics, like circles and
2 This double point is an example of what algebraic geometers call a scheme. Schemes occur naturally as
limiting objects whenever geometric objects change under deformation; for example, if a pair of crossed lines
pivot about their intersection point the limiting object is a double line.
710
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
parabolas, as well as degenerate conics consisting of a pair of distinct lines. The only
nonreduced conics are the double line conics.
To see how double lines are connected to the transverse intersection property, let’s
consider conics that pass through one point and are tangent to four lines. Recall that in
the projective plane, any two lines will intersect; in particular, any double line through
the given point will intersect each of the four given lines. These double lines will be
tangent to each of the given lines in the algebraic sense that the equation for the inter-
section has a double root. Thus we get infinitely many double line conics as solutions!
Because we don’t have a finite number of solutions, the five hypersurfaces in P5 must
not intersect transversally. Here we see that the geometry of conics in P2 sheds light
on the geometry of P5 . This phenomenon, in which we expect our intersection to con-
sist of finitely many points but in fact the intersection has higher dimension, is called
excess intersection.
However, there are also a finite number of reduced conics that pass through the
point and are tangent to the four given lines. We would like to ignore the double line
solutions and just count the number of reduced conics that pass through p given points
and are tangent to 5 − p given lines. In general there is a finite solution to this problem.
Moreover, in most cases the reduced conics solving the problem are all nondegenerate.
In each of the remaining enumerative questions we will ask for the number of
reduced conics satisfying the geometric constraints.
In the problems we’ve already solved, none of the solutions can be double lines
because of the constraints we put on the given points and lines—in each case, we did
not allow all of the points in the problem to be collinear. We placed these constraints
to ensure transverse intersection of the corresponding hypersurfaces, which then guar-
anteed that the number of conics was correctly calculated by the formula in Bézout’s
theorem. The constraints ensured that we do not get infinitely many solutions to our
problem, nor do we get solutions with multiplicity. When we have a finite number of
reduced solutions, each appearing with multiplicity one, then we say that the given
points and lines are in general position. In each enumerative problem, the conditions
that constitute general position (for example, that no three points lie on a line) will
be slightly different, but almost all configurations of points and lines will satisfy the
conditions.
4.2. Duality in P2 . The tool that we will use to remove the double lines from our
count is the duality of P2 . Duality allows us to exchange points and lines, and at the
same time it transforms conics into conics. The operation of duality respects inclusion
and tangency. This will allow us to replace the remaining three point-line problems
with the three problems we have already solved.
Consider the set of all lines in P2 . We use a linear equation L : AX + BY + C Z =
0 to describe such a line. Of course, the line doesn’t change if we multiply each of the
coefficients by a nonzero constant, so the line can be represented by a point [A : B : C]
in a projective plane. Thus the set of lines in P2 is called the dual projective plane.
The dual projective plane is just another copy of P2 , but to distinguish the two spaces
we will denote the dual projective plane by P̌2 and use the symbols A, B, and C for its
coordinates.
By definition, a line L in P2 corresponds to a point in P̌2 , which we call Ľ
(“L dual”). We can also define the dual of a point p in P2 as the collection of
lines that pass through p. If p = [X 0 : Y0 : Z 0 ] then this collection is {[A : B : C] :
X 0 A + Y0 B + Z 0 C = 0}. This is a linear equation in the variables A, B, and C, so we
see that the point p naturally corresponds to a line in P̌2 , which we call p̌. Geometri-
Figure 8. Four lines through one point (left) and their duals (right).
Let’s see what duality does to conics. If Q is a conic curve in P2 , then we define the
dual curve Q̌ in P̌2 to be the collection of all lines tangent to Q. Note that this means
that Q̌ will contain a point Ľ if and only if the corresponding line L in P2 was tangent
to Q.
As an example, consider the conic Q given by the equation X 2 − Y Z = 0. A general
line AX + BY + C Z = 0 meets the curve in two points. If A = 0, we can find these
two points by noting that (AX )2 − A2 Y Z = 0 on the curve and AX = −(BY + C Z)
on the line, so the points of intersection satisfy (BY + C Z)2 − A2 Y Z = 0. Rearrang-
ing gives a homogeneous quadratic equation in the variables Y and Z,
B 2 Y 2 + (2BC − A2 )Y Z + C 2 Z 2 = 0. (2)
As long as the discriminant of this equation is nonzero, its solution consists of two
distinct points [X : Y : Z] ∈ P2 and the line AX + BY + C Z = 0 is the secant line to
the curve Q joining the two points. When the discriminant A2 (A2 − 4BC) of equation
(2) is zero, the line is tangent to the curve. Since we assumed that A = 0, we see that
the line is tangent to the curve when A2 − 4BC = 0. A similar analysis gives the same
equation when B or C is nonzero. So in this example, the equation for the dual curve
Q̌ is A2 − 4BC = 0. Note that Q̌ is a conic in P̌2 .
What is the equation of the dual for a more general conic? If the conic has equa-
tion a X 2 + bX Y + cY 2 + d X Z + eY Z + f Z 2 = 0, then a general line AX + BY +
C Z = 0 with A = 0 meets the conic in two points where
This is a homogeneous quadratic equation in Y and Z. Just as above, the line is tangent
to the conic when the discriminant of this quadratic equation vanishes. Writing out the
discriminant and using that A = 0, we see that
712
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
The same equation would result if we assumed that B or C is nonzero. So this equation
characterizes the lines that are tangent to the conic Q; it is the equation for the dual Q̌.
As in the example, the equation for Q̌ is degree two, so it is again a conic in P̌2 . It can
be checked that when Q is nondegenerate, then Q̌ is also nondegenerate.
We leave it to the reader to check that: (1) the dual to a degenerate conic consisting
of a pair of crossed lines L 1 ∪ L 2 is the double line conic through the two points Ľ 1
and Ľ 2 ; (2) the dual to a double line conic is just P̌2 itself.
Viewing equation (3) in a slightly different way gives the equation for the hyper-
surface H of conics tangent to a line . Let AX + BY + C Z = 0 represent the line
. Fixing A, B, and C, equation (3) gives constraints on the coefficients of the conics
tangent to . This gives an explicit equation for H as a degree 2 hypersurface.
In order to use duality to help us count conics tangent to lines, we need to understand
how tangency transforms under duality. If a line L 1 is tangent to a nondegenerate conic
Q then by definition Ľ 1 is a point on Q̌. If p is a point on Q, is the line p̌ tangent to
the dual conic Q̌? To start, let L 1 be the tangent line to Q at p. Then Ľ 1 is a point lying
on the line p̌. The line p̌ meets the dual conic in two points, Ľ 1 and Ľ 2 , as depicted in
Figure 9. We aim to show that these two points coincide, so that p̌ is a tangent line to
Q̌. Since Ľ 2 ∈ Q̌, L 2 must be a line that is tangent to Q. But Ľ 2 ∈ p̌ so L 2 must also
pass through p. So L 2 is a line through p that is tangent to the conic Q. Since each
tangent line can meet the conic in at most one place, L 2 must be tangent to Q at p and
so L 2 = L 1 . It follows that Ľ 2 = Ľ 1 , so the line p̌ meets the dual conic in a unique
point; the line p̌ must be tangent to Q̌ at this point.
p
L1 L1 Q
L2
Q
p
4.3. The rest of the point-line problems. If we have five lines in the plane, then any
nondegenerate conic tangent to them will have a dual conic that passes through the five
dual points. There is only one such dual conic, so there can only be one conic tangent to
all five lines. Any nondegenerate conic tangent to four given lines and passing trough
a given point must have a dual conic that passes through the four dual points and
is tangent to the dual line. If the dual points and dual lines are in general position,
there are 2 such dual conics, so there are 2 conics tangent to four lines and passing
through a point in general position. Finally, the reader should check that there are 4
conics tangent to three lines and passing though a pair of points in general position.
We summarize the solutions to the point-line problems in Table 2.
5. STEINER’S PROBLEM
5.1. Blowing up the Veronese. Now that we have solved all of our point-line prob-
lems, we turn to Steiner’s problem, “How many conics are tangent to five given con-
ics?” We first try to intersect the five hypersurfaces HQ corresponding to the five given
Lines 0 1 2 3 4 5
Points p 5 4 3 2 1 0
Conic solutions 1 2 4 4 2 1
conics. Bézout’s formula would suggest that the intersection consists of 65 = 7776
points, which was the answer that Steiner gave. However, Bézout’s theorem does not
apply because the five hypersurfaces HQ cannot intersect transversally. Indeed, every
double line conic is tangent to each of the five given conics, so the intersection of the
five hypersurfaces HQ in P5 contains the set of double lines. Unfortunately, we cannot
use duality directly to filter out the double line conics from our answer. For this we
introduce another tool, the blowup. To start, let’s look more closely at the set of double
lines that is causing us so much difficulty.
The set of all points in P5 corresponding to double lines is called the Veronese
surface, V . Recall that a double line is a conic whose defining polynomial is the square
of the defining polynomial of a line:
This map is defined by polynomials, and its domain is all of P̌2 , so it is an example
of what algebraic geometers call a morphism. The image of this morphism, which is
the Veronese surface, is defined by the zeros of some homogeneous polynomials in
the six coordinates on P5 . Because the Veronese is two-dimensional, and it is in the
five-dimensional P5 , we expect that it can be described by three equations. This is true
locally, but if we want to describe the full Veronese we in fact need six equations. The
Veronese surface is an example of a variety which is not a complete intersection. A
little algebra finds us the six equations:
b2 − 4ac = 0 4b f − 2de = 0
d 2 − 4a f = 0 4cd − 2be = 0 (4)
e − 4c f = 0
2
4ae − 2bd = 0.
If we consider an open set where one of these six variables is nonzero, we can use
three of the above equations to solve for three variables and then derive the other
three equations. But this only works on this open set; if we were to choose a different
variable to be nonzero we would need three different equations to derive the others. So
to describe the whole Veronese we need all six equations.
Next we will look at a map which is not a morphism, and try to turn it into one.
Consider the map from P5 to P5 which sends a conic to its dual. Using equation (3) for
the dual conic we found in section 4.2, this map is defined as
714
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
δ : P5 → P5
[a : b : c : d : e : f ] → [e2 − 4c f : 4b f − 2de : d 2 − 4a f : (5)
4cd − 2be : 4ae − 2bd : b2 − 4ac].
The six polynomials that define δ in (5) are precisely the left sides of the six equa-
tions in (4), and therefore δ is undefined at a point if and only if that point is on the
Veronese—that is, if and only if the point corresponds to a double line. The map is not
a morphism on all of P5 ; however, it is defined by polynomials, so it is what algebraic
geometers call a rational map. A rational map can always be extended to a morphism
by expanding the domain space. In our case, we will take the Veronese surface out of
P5 and replace it with a four-dimensional variety. This is done by looking at the graph
of δ in P5 × P5 and closing it up.
Let’s try to write some equations for Bl V P5 . First of all, the graph is a set of points
([a : b : c : d : e : f ], [r : s : t : u : v : w]) in P5 × P5 which must satisfy
λr = e2 − 4c f λu = 4cd − 2be
λs = 4b f − 2de λv = 4ae − 2bd
λt = d 2 − 4a f λw = b2 − 4ac.
In addition, because the original six equations for the Veronese were not algebraically
independent, the blowup must satisfy eight more equations:
Since a = 0, this tells us that r , s, and u are forced to be zero, but that t, v, and w
are free. Thus the points in the blowup Bl V P5 that are mapped by the blowing down
morphism to this point are of the form
5.2. The Chow ring. In P5 we were able to count the number of points in the inter-
section of five hypersurfaces using Bézout’s theorem, but Bézout’s theorem doesn’t
hold on the blowup. This is because on the blowup, the “degree” of a hypersurface is
more complicated—it is not just one number! The extra information is encoded in the
Chow ring of the blowup. In general, for an algebraic variety, the Chow ring is a ring
that describes how its subvarieties intersect. Elements of the Chow ring are classes of
subvarieties that have the same intersection properties. Bézout’s theorem describes the
Chow ring of projective space.
In the case of P5 , Bézout’s theorem says that the degree of a hypersurface is enough
to determine its intersection properties. In particular, all hyperplanes will be in the
716
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
E
Bl v P 5
˜
Y
v
Y P5
same class. Let us call that class [H ]; it will be one element of the Chow ring of
P5 . The addition operation in the Chow ring roughly corresponds to the union of two
varieties, so [H ] + [H ] will be the class representing the union of two hyperplanes.
But the union of two hyperplanes is a special case of a degree two hypersurface, and
all degree two hypersurfaces have the same intersection properties, so any degree two
hypersurface is in the class 2[H ]. Similarly, any degree d hypersurface in P5 will be in
the class d[H ].
Multiplication in the Chow ring corresponds to intersection. If two varieties Y1 and
Y2 intersect transversally, then the Chow ring product [Y1 ] · [Y2 ] is defined to be the
class [Y1 ∩ Y2 ]. In P5 , the intersection of five general hyperplanes is just one point,
so [H ]5 is the class of one point. Intersecting five hypersurfaces of general degree
corresponds in the Chow ring to the multiplication
d1 [H ] · d2 [H ] · d3 [H ] · d4 [H ] · d5 [H ] = d1 · d2 · d3 · d4 · d5 [H ]5 ,
5.3. Counting conics. Now we use an intersection computation in the Chow ring
of the blowup to compute the answer to Steiner’s problem! By intersecting the strict
transforms in the blowup, we are throwing away all of the extra double line solutions
that caused us trouble before.
In the last section we showed that
[ H̃ p ] = [ H̃ ],
[ H̃ ] = 2[ H̃ ] − [E], (7)
and [ H̃Q ] = 6[ H̃ ] − 2[E].
Now that we have everything in terms of [ H̃ ] and [E], we could figure out how
to intersect combinations of those and finish our calculations. But an easier way is to
notice that we can instead write everything in terms of [ H̃ p ] and [ H̃ ]. We computed
the intersections of these in sections 3 and 4.3 when we answered questions like “How
many conics pass through 3 given points and are tangent to 2 given lines?” From these
earlier calculations, we learned that in the Chow ring of the blowup,
[ H̃ p ]5 = [ H̃ ]5 = 1,
[H˜ p ] [ H̃ ]2 = [ H̃ p ]2 [ H̃ p ]3 = 4.
3
(Note that on the right-hand side we are abusing notation: 1, 2, and 4 represent mul-
tiples of the Chow ring class of a point.) From (7) we see that
718
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
The answer to Steiner’s original problem, “How many conics are tangent to five given
conics?”, is
0 1 2 3 4 5
1 816 224 56 12 2
2 184 56 16 4
lines
3 36 12 4
4 6 2
5 1
5
n
[ H̃ p ]n [ H̃ ]5−n conics passing through n of our five points and tangent to the other
5 − n lines. Summing over all n, we get
for the total number of conics that satisfy any 5 of the 10 conditions imposed by the
points and lines.
Now we make each of the five lines into a conic, first by thinking of it as a double
line (with a double marked point) and then by deforming the double line into a hyper-
bola, as illustrated in Figure 12.
Figure 12. Left: Holding y constant gives cross sections of the surface x 2 y = y 2 + z 2 that deform to a double
line. Right: Superimposed snapshots of the deformation in the plane.
Let’s look for conics tangent to these five hyperbolas. For each conic that was tan-
gent to L i , there are two conics tangent to the hyperbola. And for each conic that
passed through the point Pi , there are two conics tangent to the hyperbola. In a sense,
this is the geometric meaning of equation (8), [ H̃Q ] = 2[ H̃ p ] + 2[ H̃ ]. The hyperbolas
are pictured in Figure 13.
Thus, deforming each line into a hyperbola doubles the number of conics. Since
there are five lines, the total number of conics when all five are deformed is
720
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
Figure 13. Deforming the line L i gives rise to twice as many tangent conics.
5.3 we showed that the intersection of the five hypersurfaces H̃Qi is in the class rep-
resenting 3264 points. We would like to prove that for most sets of five conics, this
intersection is in fact 3264 points of multiplicity one, each corresponding to a reduced
conic. As we did before, we will say that a set of five conics with this property is in
general position. The criteria for five conics to be in general position are quite compli-
cated (including such restrictions as “No three of the conics have a common tangent
line”); a list of such criteria can be found in [3]. However, without going into details
about what constitutes general position for the five conics, we can prove that almost
all sets of five conics are in general position.
One way to formalize the notion of “almost all sets of five conics” is to use the
Zariski topology. Just as small open balls play a key role in analysis, the Zariski
topology is a crucial tool in algebraic geometry. In the Zariski topology, a set is closed
if it is the set of common solutions to a collection of polynomial equations. If you
imagine a hypersurface, you see immediately that Zariski closed sets are very thin. A
Zariski open set is just the complement of a Zariski closed set, so saying that a property
holds on a nonempty Zariski open set means that it holds in almost all situations.3
Theorem 3. The set of all (Q 1 , Q 2 , Q 3 , Q 4 , Q 5 ) ∈ (P5 )5 such that the H̃Qi intersect
transversally in points corresponding to reduced conics is open in the Zariski topology.
Proof. We will prove that the complement is closed in the Zariski topology.
Suppose we have five conics Q 1 , . . . , Q 5 and let
ai x 2 + bi x y + ci y 2 + di x z + ei yz + f i z 2 = 0
be the defining equation for the conic Q i . Let P be a point in the intersection of
the H̃Qi ⊂ Bl V P5 . The blowup is a five-dimensional manifold embedded in the ten-
dimensional space P5 × P5 so at P the blowup has a five-dimensional tangent space
T P (Bl V P5 ) that is a subspace of T P (P5 × P5 ) (we can think of P as lying at the ori-
gin of this space). Each of the five hypersurfaces H̃Qi has a tangent space that is a
hyperplane in T P (Bl V P5 ). To describe these hyperplanes, let’s consider H̃Qi in a chart
near P. To be precise, we have P ∈ Bl V P5 ⊂ P5 × P5 and we can pick charts on both
3 Warning: though the Zariski topology is fundamental for algebraic geometry, it takes some getting used
to. For instance, since the nonempty open sets are so large, it is not Hausdorff. It is a good exercise for the
reader to check that the Zariski open sets form a topology.
and seeing whether it has full rank. The matrix will fail to have full rank precisely
when all its 5 by 5 minors vanish. Each of these minors is the determinant of a 5
by 5 submatrix, so they are polynomials in the entries of the ∇gi (P). Thus, these
are polynomial conditions involving the variables describing the Q i and the variables
describing P; that is, these are polynomial conditions on the product of (P5 )5 with our
chart in Bl V P5 . Since Bl V P5 is covered by charts, we obtain polynomials that cut out
the subset S ⊂ (P5 )5 × Bl V P5 consisting of tuples
Because this set is defined by the vanishing of polynomial equations, it is closed in the
Zariski topology.
Now we turn our attention to the points in the intersection that correspond to the
double line conics. The exceptional divisor E = π −1 (V ) ⊂ Bl V P5 is a closed set be-
cause it is the inverse image of the closed set V under the continuous map π. Indeed, if
the Veronese V is obtained as the set of common zeros of polynomials G i then the ex-
ceptional divisor E = π −1 (V ) is the set of common zeros of the polynomials G i ◦ π
on Bl V P5 . It follows that the product (P5 )5 × E is closed in (P5 )5 × Bl V P5 . As the
Zariski closed sets form a topology, the union S = S ∪ [(P5 )5 × E] is also closed.
Now one great fact about projective varieties is that if we have a projection from one
projective variety to another, then the image of a Zariski closed set is closed.4 So the
projection π1 : (P5 )5 × Bl V P5 → (P5 )5 that drops the last factor takes the closed set S
to a closed set. This says that the set of configurations (Q 1 , Q 2 , Q 3 , Q 4 , Q 5 ) ∈ (P5 )5
such that either the H̃Qi fail to intersect transversally or their intersection includes
points on the exceptional divisor is closed in the Zariski topology. Therefore its com-
plement, the set of configurations where the H̃Qi intersect transversally in points cor-
responding to reduced conics, is open in the Zariski topology.
This theorem is not quite enough to guarantee that for most configurations of five
plane conics the intersection of the H̃Qi is transverse and consists of isolated points
4 This is not true for affine spaces though. For example, the image of the parabola x y = 1 projected onto
the x-axis consists of the entire line except for the origin.
722
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
corresponding to reduced conics. We’ve shown that the set parameterizing such config-
urations is Zariski open, but we have not shown that it is nonempty. This is a common
difficulty in algebraic geometry: it is easy to show that a property holds on an open set
and hard to show that this open set is not empty! To do this, we just need to produce
one example of five conics so that the intersection of the H̃Qi is transverse and con-
sists of points corresponding to reduced conics. We can avoid checking the transverse
condition by just producing an instance of the problem where the solution consists of
precisely 3264 reduced conics; these will all be isolated and count with multiplicity
one since the intersection must be rationally equivalent to 3264 points. Fortunately,
we’ve already produced such an example in section 6.5 So the Zariski open set in The-
orem 3 is not empty and for most configurations of five conics there are 3264 reduced
conics tangent to all five. A precise characterization of the sets of five conics for which
we do not get 3264 reduced conics tangent to all five can be found in [3].
In principle we’d need to repeat this work for each of the other problems stemming
from combinations of five points, lines, and conics. This can be done by appealing to
arguments similar to those given here, or by relying on a general transversality result
due to Kleiman [15, p. 273]. The upshot is that for all our enumerative questions,
almost all configurations give rise to a finite number of reduced solutions and this
number is given in Table 3.
Suggestions for further reading. In recent years, enumerative geometry has been
heavily influenced by an influx of ideas from string theory. The major breakthrough
that caused mathematicians to sit up and take notice was a prediction in 1991, using
mirror symmetry, of the number of degree d rational curves on a degree 5 hypersurface
in P4 [4]. This physics computation was not mathematically rigorous, but at the time
these numbers were known to algebraic geometers only for very small d, so it was
amazing to have predictions for all of the numbers at once. The development of the
field of Gromov-Witten theory has put this computation on solid mathematical foot-
ing, as well as leading to many other interesting results. A recent book by Sheldon
Katz [17] provides an introduction to this aspect of enumerative geometry, and we
recommend it very highly.
Duality played a key role in our solutions to enumerative problems involving lines
and points. The theory of duality (and the discriminants that define the dual varieties)
is given extensive treatment in [14], where it is related to toric varieties and systems
of hypergeometric differential equations. Blowing up also played a key role in our
solution to Steiner’s problem. The blowup is commonly used to resolve singularities
in algebraic geometry. Indeed, Hironaka was awarded the Fields medal for showing
that every variety can be desingularized by a sequence of blowups. A brief account of
this theorem can be found in [24, Chap. 7] and an expository proof in [16].
5 Fulton and MacPherson [12] use a dimension count to give a different proof that there must be such an
example. They show that the collection of quintuples of conics for which we get solutions of multiplicity
higher than one is of lower dimension than the set of quintuples of conics itself. So in particular, there is some
configuration of five conics all of whose solutions have multiplicity one (all of the H̃ Q i intersect transversally).
724
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
(a) Show that if x̃ = Lx is a linear change of coordinates, then when the quadratic
Q is written in the new variables x̃, it corresponds to the matrix (L −1 )T M Q L −1 .
(b) Show that given any nondegenerate conic Q, there is a linear change of coordi-
nates transforming it to yz = x 2 .
(c) Show that Q is degenerate if and only if det(M Q ) = 0, and Q is a double line
if and only if rank(M Q ) = 1.
(d) Show that if Q is nonsingular, then its dual curve Q̌ corresponds to the matrix
M Q̌ = M Q−1 . In this sense the duality map is a generalization of the inverse op-
eration for matrices. This topic is explored in great detail (for multidimensional
matrices!) in [14].
Problem 4. (a) Show that the point in P5 corresponding to a conic Q lies on the
hypersurface HQ of all conics tangent to Q. [Hint: Consider the case Q :
x 2 − yz = 0.]
(b) Show that if P is a point on HQ then the entire line joining P and the point in
P5 corresponding to Q is on HQ too. This shows that HQ is a cone over Q.
Problem 5. (a) A circle is a conic passing through the two points [1 : i : 0] and
[1 : −i : 0]. Show that when we homogenize the curve defined by x 2 + y 2 = r 2
we get a circle in P2 .
(b) Show that the parameter space for circles in P2 is a 3-dimensional projective
space.
(c) One approach to count the circles tangent to three general circles is to compute
[ H̃Q ]3 [ H̃ p ]2 = 184 in Bl V (P5 ). Why is this incorrect? Find the correct count.
[Remark: In fact, something very precise can be said if the 3 given circles are mutually
tangent. If r1 , r2 , r3 , and r4 are the radii of the circles, then
This is a famous theorem, known to Descartes and extended and immortalized in Sir
Frederick Soddy’s poem, “The Kiss Precise” [25].]
Problem 7. Instead of using the moduli space of conics themselves, one can do enu-
merative calculations with the moduli space of stable maps. This is the point of view
taken in Gromov-Witten theory.
(a) Consider the projective line P1 with homogeneous coordinates [S : T ]. Find
a degree 2 morphism from P1 to P2 whose image is the curve yz = x 2 . (In
this case “degree” means the degree of the polynomial functions defining the
morphism.)
(b) By composing the (inverse of the) change of coordinates in part (b) of Problem
2 with the map in part (a), we see that every nondegenerate conic is the image
of P1 under some degree 2 map. Show that any degree 2 map from P1 to P2 is
either a one-to-one map onto a nondegenerate conic, or a two-to-one map onto
a line with two branch points.
(c) Show that composing a map from P1 to P2 with a linear change of coordinates
on P1 , [S : T ] → [aS + bT : cS + dT ], with ad − bc = 0, does not change
726
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115
the image. Two maps that differ by such an automorphism of P1 are considered
isomorphic.
(d) In general, the moduli space of stable genus 0 maps to P2 consists of (isomor-
phism classes of) maps from a tree of P1 ’s to P2 . In the degree 2 case, the
only possible trees have either one or two “branches.” Thus a stable degree 2
map is either a degree 2 map from P1 to P2 , such as the maps in part (b), or a
map from a pair of intersecting P1 ’s to P2 , where the map has degree 1 on each
“branch.” Explain why the moduli space of stable degree 2 genus 0 maps to P2
is essentially the same as the blowup Bl V P5 , the space of complete conics.
ACKNOWLEDGMENTS. We first learned about this topic from Frank Sottile, whose expository lectures
and writing guided our early investigations. Mike Roth provided help at a crucial time; his suggestions form
the basis for our proof of Theorem 3. Steve Kleiman gave us extensive comments on a first draft of the paper
and rescued us from several errors. Helene Speer’s gracious help improved our figures. This paper grew out of
Midshipman Andrew Bashelor’s Trident project [3], a full-year research project carried out at the U.S. Naval
Academy. We are grateful to the Trident Scholar Committee for their oversight and guidance. In particular
we gratefully acknowledge the Office of Naval Research for partial support of this work in funding document
N0001405WR20153.
REFERENCES
ANDREW BASHELOR received his B.Sc. from the United States Naval Academy in 2005 and an M.Sc. in
Operations Analysis from the Naval Postgraduate School in 2006. He is currently serving as an officer in the
U.S. Navy, stationed in Hawaii.
andrew.bashelor@mac.com
AMY KSIR grew up in Laramie, Wyoming. She received her B.A. from Rice University and her Ph.D. from
the University of Pennsylvania, and currently teaches at the U.S. Naval Academy. Her research interests are in
applications of algebraic geometry to string theory and coding theory; she also enjoys playing the accordion.
Department of Mathematics, U.S. Naval Academy, Annapolis, MD, 21402
ksir@usna.edu
WILL TRAVES received his B.Sc.H. from Queen’s University and his Ph.D. from the University of Toronto.
He teaches at the U.S. Naval Academy, where he helps coach the women’s rugby team.
Department of Mathematics, U.S. Naval Academy, Annapolis, MD, 21402
traves@usna.edu
728
c THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly 115