22.10  Conics and Lines in Space

Chapter 14 classified symmetric bilinear forms and never drew a picture. This section is the picture. A quadratic form on V has a zero set in P(V), that zero set is unchanged when the form is scaled, and Sylvester’s law becomes a list of shapes. Then a second theme, which looks unrelated and is not: a line in three-dimensional projective space is a plane in F4, a plane in F4 is a wedge of two vectors, and the wedges among all of Λ2F4 are picked out by one quadratic equation. The lines in space are themselves a quadric.

Throughout this section charF≠2, except in the Plücker material at the end, which needs no hypothesis on F and says so where it begins. The reason is Chapter 14’s: in characteristic 2 a quadratic form is not determined by a symmetric matrix, and every classification theorem we lean on fails.

22.10.1. Quadrics in projective space

A quadratic form q on V is not a function on P(V): its value at λx is λ2 times its value at x, so a point has no well-defined q-value. But whether the value is zero does not move, and that is all a zero set needs.

A projective quadric is where a quadratic form vanishes; scaling the vector cannot change whether it does.

Definition 22.10.1 (Projective Quadric, Conic, Smooth Quadric)

Let charF≠2, let V be a finite-dimensional vector space over F and let q be a nonzero quadratic form on V (Definition 14.3.2), with associated symmetric bilinear form β (Theorem 14.3.5). The projective quadric defined by q is Z(q):={[x]∈P(V):q(x)=0}. The rank of the quadric is rankβ, and the quadric is smooth (or nondegenerate) when β is nondegenerate, that is, when the rank is dim⁡V. A quadric in a projective plane is called a conic, the same word Section 5 used for the affine case (Definition 22.5.1).

The set is well defined: if x′=λx with λ≠0, then q(x′)=β(λx,λx)=λ2q(x), which is zero exactly when q(x) is. The word nonzero in the definition rules out q=0, whose zero set is all of P(V) and carries no information. And the rank is well defined because β is: over a field of characteristic ≠2 a quadratic form has exactly one symmetric bilinear form behind it (Theorem 14.3.5).

Fix a basis of V. Then q(x)=x⊤Ax for a unique symmetric matrix A, the matrix of β (Definition 14.1.2), and rankA is the rank of the quadric. Three examples in P2, written in homogeneous coordinates [x0:x1:x2].

  • q=x02+x12−x22, with A=diag(1,1,−1), rank 3, smooth. Over R its points are the projective version of the unit circle; [1:0:1] is one of them.
  • q=x0x1, with A=(01/201/200000), rank 2. Its zero set is the union of the two lines {x0=0} and {x1=0}.
  • q=x02, rank 1. Its zero set is the single line {x0=0}, because a field has no nonzero element whose square is 0. The form remembers something the set forgets, which is the first warning of the section.

Warning. A quadric is named by its form, not by its set. Over R the distinct forms x02+x12+x22 and 2x02+5x12+x22 have the same zero set in P2(R), namely the empty set, which records nothing at all about either of them. So “the quadric Z(q)” is always shorthand for “the quadric defined by q”, and the theorem below classifies forms up to projective equivalence, not sets.

A projective transformation [x]↦[Tx] (Definition 22.7.1) carries Z(q) to Z(q∘T−1), and Z(q)=Z(cq) for every c≠0. So the right relation on forms is: q and q′ are projectively equivalent when q′=c(q∘T) for some c∈F× and some T∈GL(V). In matrices: A′=cP⊤AP with P invertible, which is congruence (Definition 14.2.1) followed by a scaling.

Theorem 22.10.1 (Classification of Projective Quadrics)

Let charF≠2 and dim⁡V=n+1, and let q,q′ be nonzero quadratic forms on V with matrices A,A′ in some basis.

  • (a) If F is algebraically closed, then q and q′ are projectively equivalent if and only if rankA=rankA′. There are exactly n+1 classes, one for each rank r=1,…,n+1, with normal form x02+⋯+xr−12.
  • (b) If F=R, then q and q′ are projectively equivalent if and only if their inertias (n+,n−,n0) and (n+′,n−′,n0′) agree up to interchanging n+ with n−. A normal form is x02+⋯+xn+−12−xn+2−⋯−xr−12 with n+≥n−, r=n++n−.

Idea. Both parts reduce the extra freedom — the scalar c — to something already classified. Over an algebraically closed field c has a square root, so scaling is itself a congruence and adds nothing: the answer is Chapter 14’s. Over R a positive c is again a congruence, and the only new move is c=−1, which turns q into −q and swaps the two counts.

Proof.

  • (a) (⇐) It is enough to show that a symmetric A of rank r≥1 is congruent to Ir⊕O, since a congruence is the case c=1 and congruence is an equivalence relation (Proposition 14.2.2). By Theorem 14.4.2, A≃D=diag(d1,…,dn+1), and congruence preserves rank (Theorem 14.2.3), so exactly r of the di are nonzero; permuting the basis, a congruence by a permutation matrix, we may assume these are d1,…,dr. Since F is algebraically closed, choose si with si2=di for i≤r and put ti=1/si for i≤r, ti=1 otherwise; by Proposition 14.4.3 the congruence by diag(t1,…,tn+1) replaces di by ti2di, giving Ir⊕O. (For F=C this is Corollary 14.4.4.)

    (⇒) Suppose A′=cP⊤AP with c≠0. Choose s∈F with s2=c; then A′=(sP)⊤A(sP) with sP invertible, so A′≃A and Theorem 14.2.3 gives rankA′=rankA. The ranks of a nonzero form run over 1,…,n+1, and the normal form is the Ir⊕O produced above, whose quadratic form is x02+⋯+xr−12.

  • (b) (⇐) If the inertias agree, Corollary 14.5.2 (b) gives A′≃A, which is the case c=1. If they agree after interchanging n+ and n−, then A′ has the same inertia as −A, so A′≃−A=(−1)A, which is the case c=−1 composed with a congruence.

(⇒) Let A′=cP⊤AP. If c>0, put s=c and argue as in (a): A′≃A, so the inertias agree by Corollary 14.5.2 (b). If c<0, put s=−c; then A′=(sP)⊤(−A)(sP)≃−A. Diagonalizing A with n+ positive and n− negative entries diagonalizes −A with the two counts interchanged, so the inertia of −A, hence of A′, is (n−,n+,n0) by Theorem 14.5.1. This proves the theorem.

For n=2 the list is short enough to write out, and worth memorizing.

Corollary 22.10.2 (The Conics of a Projective Plane)

Let charF≠2 and let q be a nonzero quadratic form on a 3-dimensional space.

  • (a) Over an algebraically closed F there are three classes, with zero sets: a line (rank 1), two distinct lines (rank 2), a smooth conic (rank 3).
  • (b) Over R there are five classes, listed by (n+,n−) with n+≥n−, with zero sets: (1,0): a line,(2,0): a single point,(1,1): two distinct lines,(3,0): empty,(2,1): a smooth conic, nonempty.

Proof. The classes are those of Theorem 22.10.1; only the zero sets need identifying, and each is read off a normal form.

x02=0 holds exactly when x0=0, a field having no nonzero square root of 0; the set is the line {x0=0}. Next, x02+x12 factors over an algebraically closed field as (x0+ix1)(x0−ix1) with i2=−1, and the two linear forms are not proportional since i≠−i (as charF≠2), so the set is two distinct lines; over R instead x02+x12=0 forces x0=x1=0, leaving the single point [0:0:1]. The form x02−x12=(x0−x1)(x0+x1) gives two distinct lines over every field of characteristic ≠2. Over R, x02+x12+x22=0 forces x=0, which is not a point of P2, so the set is empty. Finally x02+x12−x22 has rank 3, so its quadric is smooth, and it contains [1:0:1]. This proves the corollary.

Remark. Section 5 classified affine quadrics and produced a longer real list, because an affine classification must also record whether a center exists and whether the constant can be cleared. There is no conflict: the affine group is smaller than the projective one — an invertible affine substitution is exactly a projectivity fixing the hyperplane at infinity (Theorem 22.7.11) — so the affine classification is the finer of the two, and the list above is what Section 5 pointed forward to for the complex case.

Warning. Rank alone does not classify real conics; inertia does. The forms x02+x12+x22 and x02+x12−x22 both have rank 3, and one zero set is empty while the other has infinitely many points. One rank lower, x02+x12 and x02−x12 both have rank 2, and the zero sets are a point and a pair of lines. Over C each pair collapses: rank is a complete invariant there, so the two forms of each pair become projectively equivalent.

Example (Classifying a conic by hand)

Classify the conic x02+4x0x1+5x12+2x1x2+2x22=0 in P2(R), and say what happens over C.

Solution. Complete the square in x0 first, since x02 appears: x02+4x0x1=(x0+2x1)2−4x12, so the form equals (x0+2x1)2+x12+2x1x2+2x22. Completing the square in x1 in what is left, x12+2x1x2=(x1+x2)2−x22, and therefore q=(x0+2x1)2+(x1+x2)2+x22. The three linear forms x0+2x1, x1+x2, x2 are independent — the matrix with these rows is upper triangular with determinant 1 — so this is a diagonalization with inertia (3,0,0). By Corollary 22.10.2 (b) the conic is empty over R.

Over C the same three squares have rank 3, so by (a) the conic is smooth, and it is not empty: take x2=1 and x1=−1, so that the second square vanishes and the equation becomes (x0−2)2=−1, solved by x0=2+i. The point [2+i:−1:1] lies on it. The real conic was empty not because the form was degenerate but because it was definite, which is a statement no algebraically closed field can make.

Quick check. A conic in P2(R) consists of exactly one point. What is the rank of its form, and what is its inertia?

Solution. By the list in Corollary 22.10.2 (b) the only class with a one-point zero set is (n+,n−)=(2,0), of rank 2; up to sign the form is x02+x12 in suitable coordinates. Rank 1 gives a line and rank 3 gives either nothing or a curve, so no other class can produce one point.

22.10.2. Five points determine a conic

Six coefficients, five conditions, one answer. The existence half is a count; the uniqueness half is where the work is, and it is exactly where “in general position” earns its keep.

“In general position” is Definition 22.7.2 read with m=5 and n=2: every subset of at most three of the five points has independent representatives. In a projective plane that says exactly that the five points are pairwise distinct and that no three of them are collinear.

The lemma below is what forbids a conic from swallowing a line, and it is used twice more later.

Lemma 22.10.3 (A Conic Containing a Line Is Degenerate)

Let charF≠2, let dim⁡V=3 and let q≠0 be a quadratic form on V vanishing on every vector of a 2-dimensional subspace W. Then q=φχ for two nonzero linear functionals φ,χ on V with kerφ=W, and the rank of q is at most 2. In particular a smooth conic contains no line.

Proof. Let β be the symmetric form of q and choose a basis (w0,w1,v2) of V with W=span(w0,w1). Evaluating q at w0, at w1, and at w0+w1, all of which lie in W, gives β(w0,w0)=0,β(w1,w1)=0,2β(w0,w1)=0, the third because q(w0+w1)=β(w0,w0)+2β(w0,w1)+β(w1,w1). Since 2 is invertible, β(w0,w1)=0 too. Put c0=β(w0,v2), c1=β(w1,v2) and c=β(v2,v2). In the coordinates x=(x0,x1,x2) of this basis, q(x)=2c0x0x2+2c1x1x2+cx22=x2(2c0x0+2c1x1+cx2), a product φχ with φ(x)=x2, whose kernel is W, and χ the second factor, which is nonzero because q≠0. The Gram matrix of β in this basis (Definition 14.1.2) has rows (0,0,c0), (0,0,c1) and (c0,c1,c); the first two lie in a 1-dimensional subspace, so the three of them span at most a 2-dimensional one and the rank is at most 2.

If q is smooth its rank is 3, so no such W exists, and a line P(W) contained in Z(q) would supply one. This proves the lemma.

Theorem 22.10.4 (Five Points Determine a Conic)

Let charF≠2 and let P1,…,P5 be five points of P2 in general position (Definition 22.7.2), that is, pairwise distinct with no three collinear. Then there is a nonzero quadratic form q on F3 vanishing at all five, and it is unique up to a nonzero scalar. Consequently exactly one conic passes through the five points.

Idea. The symmetric 3×3 matrices form a 6-dimensional space and each point imposes one linear equation on it, so five points leave at least a line of solutions: that is existence, and it is only counting. For uniqueness suppose the solution space had dimension 2. Then a whole pencil of conics passes through the five points, and a pencil is big enough to be forced through a sixth point, chosen on the line P1P2. A conic through three points of a line contains the line, so by Lemma 22.10.3 it splits into two lines; one of them is P1P2, and the other must then carry P3,P4,P5 — three collinear points, which general position forbids.

Proof. Let S⊆M3(F) be the subspace of symmetric matrices. A symmetric 3×3 matrix is determined by its three diagonal entries and its three entries above the diagonal, each of which may be chosen freely, so dim⁡S=6. By Theorem 14.3.5 the map A↦qA, qA(x)=x⊤Ax, is a bijection from S onto the quadratic forms on F3, and it is linear.

Existence. Write Pi=[xi]. For each i the map A↦xi⊤Axi is a linear functional on S, because the expression is linear in the entries of A. The five functionals give a homogeneous linear system of 5 equations in the 6 coordinates of A, which by Corollary 3.2.5 (a) has a nontrivial solution A≠O. The corresponding qA is a nonzero quadratic form vanishing at every xi, hence at every Pi. (Vanishing does not depend on the representative, by the homogeneity noted after Definition 22.10.1.)

Uniqueness. Let N⊆S be the solution space of that system, and suppose dim⁡N≥2. Pick independent A1,A2∈N, and write q1,q2 for the corresponding forms, which are independent as forms since A↦qA is a bijection that is linear.

The line L=P1P2 contains at least three points: it is P(U) with dim⁡U=2, so it contains [u1], [u2] and [u1+u2] for a basis (u1,u2) of U, and these are three distinct points. Choose R=[y] on L with R≠P1 and R≠P2. The condition λy⊤A1y+μy⊤A2y=0 is one homogeneous linear equation in (λ,μ), so by Corollary 3.2.5 (a) it has a solution with (λ,μ)≠(0,0). Put A=λA1+μA2, which is nonzero because A1,A2 are independent, and let q=qA, a nonzero quadratic form.

Now q vanishes at the three distinct points P1,P2,R of L. Restrict q to U: in the basis (u1,u2) it reads g(s,t)=αs2+γst+δt2. A nonzero g vanishes at at most two points of P(U). Indeed, if α≠0 then g(s,0)=αs2≠0 whenever s≠0, so every zero has t≠0 and is therefore [m:1] for a scalar m with αm2+γm+δ=0 — a polynomial in m of degree at most 2, nonzero because its leading coefficient is α, so with at most two roots (Lemma 3.7.2); if α=0 then g=t(γs+δt), whose zeros are [1:0] together with the at most one point where γs+δt=0, and (γ,δ)≠(0,0) since g≠0. Three zeros therefore force g=0, that is, q vanishes on all of U.

By Lemma 22.10.3, q=φχ with kerφ=U. For i=3,4,5 we have q(xi)=0, and φ(xi)≠0, since φ(xi)=0 would put Pi on L=P1P2, making P1,P2,Pi collinear. Hence χ(xi)=0 for i=3,4,5, so P3,P4,P5 all lie on the line {χ=0} — three collinear points among the five, contradicting general position.

So dim⁡N=1: the form is unique up to a nonzero scalar, and Z(q) is the unique conic through the five points. This proves the theorem.

Example (A conic through five points)

Find the conic of P2(Q) through [1:0:0], [0:1:0], [0:0:1], [1:1:1] and [1:2:4], and decide whether it is smooth.

Solution. Write q=ax02+bx12+cx22+dx0x1+ex0x2+fx1x2. The first three points give a=b=c=0 at once. Then [1:1:1] gives d+e+f=0 and [1:2:4] gives 2d+4e+8f=0, that is d+2e+4f=0. Subtracting, e+3f=0, so e=−3f and d=−e−f=2f. Taking f=1, q=2x0x1−3x0x2+x1x2, and the solution space is indeed one-dimensional, as Theorem 22.10.4 promises. (No three of the five points are collinear: taking the ten triples in the order 123, 124, 125, 134, 135, 145, 234, 235, 245, 345, the determinants of the corresponding coordinate matrices are 1, 1, 4, −1, −2, 2, 1, 1, −3, 1, none of them zero.)

Its matrix is A=(01−3/2101/2−3/21/20),detA=−32≠0, so the conic is smooth. Over R its inertia is (2,1,0): the three eigenvalues are real (Corollary 12.5.2) and the inertia counts their signs (Theorem 14.5.3); their product is detA<0, so an odd number of them is negative, and trA=0 rules out all three, leaving exactly one.

22.10.3. Projecting a conic onto a line

Here is the payoff a reader can take home. A smooth conic looks like a curve, and the next theorem says that as a set it is a projective line, provided it has one point to start from. Over Q that converts one solution of a Diophantine equation into all of them; over Fq it says a smooth conic with a point has exactly q+1 of them.

Theorem 22.10.5 (Projection from a Point of a Conic)

Let charF≠2, let C=Z(q) be a smooth conic in P(V), dim⁡V=3, and suppose C contains a point P0=[p]. Let ℓ be any line of P(V) with P0∉ℓ. Then the map ψ:ℓ→C,ψ([x])=[−q(x)p+2β(p,x)x] is a well-defined bijection. In particular C is in bijection with P1.

Idea. Each point X of ℓ is joined to P0, and the line P0X meets C in P0 and in exactly one further point — “further” understood so that a tangent line counts P0 twice. Expanding q(λp+μx) and using q(p)=0 makes μ a factor, so the quadratic equation is linear once the known root is removed, and the displayed formula is that root written out. Every line through P0 other than ℓ itself meets ℓ once, which is where the inverse comes from.

Proof. Write ℓ=P(U) with dim⁡U=2; since P0∉ℓ, we have p∉U, so x∉span(p) for every 0≠x∈U.

The formula is well defined. Replacing x by cx with c≠0 multiplies −q(x)p+2β(p,x)x by c2, so the point is unchanged. The vector is nonzero: if both q(x)=0 and β(p,x)=0, then for all λ,μ, q(λp+μx)=λ2q(p)+2λμβ(p,x)+μ2q(x)=0, so q vanishes on the 2-dimensional subspace span(p,x), contradicting Lemma 22.10.3 since C is smooth. If instead β(p,x)≠0 the vector has a nonzero component along x modulo span(p); and if β(p,x)=0 with q(x)≠0, the vector is −q(x)p≠0.

The value lies on C. Put z=−q(x)p+2β(p,x)x. Using q(p)=0 and bilinearity, q(z)=q(x)2q(p)−2⋅2q(x)β(p,x)β(p,x)+4β(p,x)2q(x)=0−4q(x)β(p,x)2+4β(p,x)2q(x)=0.

A fact used twice. If [y]∈C and [y]≠P0, then β(p,y)≠0; otherwise q would vanish on span(p,y), a 2-dimensional subspace since p,y represent distinct points, contradicting Lemma 22.10.3 again.

Surjectivity. Let [y]∈C. Suppose first [y]≠P0. The line P0[y] is distinct from ℓ, since P0∉ℓ, so by Corollary 22.6.7 it meets ℓ in a single point [x], and x=λp+μy with μ≠0 (else [x]=P0∈ℓ). Then q(x)=2λμβ(p,y) and β(p,x)=μβ(p,y), so −q(x)p+2β(p,x)x=−2λμβ(p,y)p+2μβ(p,y)(λp+μy)=2μ2β(p,y)y, which is a nonzero multiple of y by the fact just proved. So ψ([x])=[y]. Now suppose [y]=P0. The set T={[z]:β(p,z)=0} is a line, β being nondegenerate so that β(p,⋅) is a nonzero functional; it contains P0, because β(p,p)=q(p)=0, hence T≠ℓ, and T meets ℓ in one point [x]. There β(p,x)=0 and q(x)≠0 by the nonvanishing argument above, so ψ([x])=[−q(x)p]=P0.

Injectivity. Suppose ψ([x′])=ψ([x″])=[y], with [x′],[x″]∈ℓ. For any x the vector −q(x)p+2β(p,x)x lies in span(p,x), so [y] lies on the line joining P0 to [x]. If [y]≠P0, then both [x′] and [x″] lie on the line joining P0 to [y], and both lie on ℓ; these two lines are distinct because P0∉ℓ, so by Corollary 22.6.7 they meet in one point and [x′]=[x″]. If [y]=P0, then 2β(p,x′)x′∈span(p); since x′∉span(p) and 2 is invertible, β(p,x′)=0, and likewise for x″. So [x′] and [x″] both lie on T∩ℓ, again a single point.

Finally ℓ is a projective line, hence in bijection with P1 by any choice of basis of U. This proves the theorem.

Example (Pythagorean triples from one point)

Parametrize the rational points of the conic x02+x12=x22 in P2(Q), starting from P0=[−1:0:1].

Solution. Here q(x)=x02+x12−x22, with β(x,y)=x0y0+x1y1−x2y2, and A=diag(1,1,−1) is invertible, so the conic is smooth. Also q(−1,0,1)=1−1=0, so P0∈C. Take ℓ={x0=0}, which misses P0, and write its points as [0:u:v] with (u,v)≠(0,0).

With x=(0,u,v) we get q(x)=u2−v2 and β(p,x)=−v, so ψ([0:u:v])=[−(u2−v2)(−1,0,1)+2(−v)(0,u,v)]=[u2−v2 : −2uv : −u2−v2]=[v2−u2 : 2uv : u2+v2]. Taking u,v to be integers, not both zero, the three coordinates are integers, and (v2−u2)2+(2uv)2=u4+2u2v2+v4=(u2+v2)2, a Pythagorean triple; the identity is exactly the statement that ψ lands in C.

By Theorem 22.10.5 every point of C arises from exactly one point [0:u:v] of ℓ. So if (a,b,c) are integers with a2+b2=c2 and c≠0, then [a:b:c] is a rational point of C, hence (a,b,c)=λ(v2−u2, 2uv, u2+v2) for some rational λ≠0 and integers u,v: every Pythagorean triple is proportional to one of this shape. (If c=0 then a2+b2=0 forces a=b=0.) Deciding which proportionality factors give primitive triples is arithmetic about parities and common factors, not linear algebra, and we do not do it here.

Two checks. At [u:v]=[1:0], that is at the point [0:1:0] of ℓ, the formula returns [−1:0:1]=P0. That is as it should be: the line joining P0 to [0:1:0] consists of the points [−λ:μ:λ], and q(−λ,μ,λ)=λ2+μ2−λ2=μ2, which vanishes only for μ=0. So that line meets C at P0 alone, and P0 is the only value ψ can take there. At [u:v]=[1:2] the formula gives [3:4:5].

22.10.4. Pole, polar, and the dual conic

A smooth conic carries an invertible symmetric matrix, and an invertible symmetric matrix is a perfect pairing. Every point therefore names a line, and the dictionary this sets up is where tangency comes from.

Definition 22.10.2 (Polar Line, Tangent Line)

Let C=Z(q) be a smooth conic in P(V), dim⁡V=3, with symmetric bilinear form β, and let P=[x]. The polar of P with respect to C is Pβ:={[y]∈P(V):β(x,y)=0}, and P is the pole of that line. For P∈C, the polar Pβ is called the tangent line to C at P.

Because β is nondegenerate, β(x,⋅) is a nonzero functional (Proposition 14.1.2 (c)), so its kernel is 2-dimensional and Pβ really is a line; and replacing x by cx scales the functional, leaving the line alone. The next proposition says the word “tangent” is deserved.

Proposition 22.10.6 (Reciprocity and Tangency)

With the notation of Definition 22.10.2, let P=[x] and Q=[y].

  • (a) Q∈Pβ if and only if P∈Qβ.
  • (b) P∈C if and only if P∈Pβ.
  • (c) Let P∈C and let L be a line through P. Then L∩C={P} if and only if L=Pβ; every other line through P meets C in exactly two points.

Proof.

  • (a) Both conditions say β(x,y)=0, since β is symmetric.

  • (b) P∈Pβ says β(x,x)=0, which is q(x)=0.

  • (c) Write L=P(span(x,y)) with y∉span(x). A point of L is [λx+μy], and since q(x)=0, q(λx+μy)=μ(2λβ(x,y)+μq(y)). Case 1: L=Pβ, that is, β(x,y)=0. Then q(λx+μy)=μ2q(y), and q(y)≠0: otherwise q would vanish on span(x,y), contradicting Lemma 22.10.3. So the expression vanishes only when μ=0, giving the single point P.

Case 2: L≠Pβ, so β(x,y)≠0. Then the factorization above vanishes when μ=0, giving P, and when 2λβ(x,y)+μq(y)=0, which has the solution (λ,μ)=(−q(y),2β(x,y)) with μ≠0, giving a point of C different from P. Every point of L∩C is one of these two, since the two cases μ=0 and 2λβ(x,y)+μq(y)=0 exhaust the factorization and each determines [λ:μ]. This proves the proposition.

Corollary 22.10.7 (The Dual Conic)

Let C be a smooth conic in P(V) with matrix A in some basis, and identify each line of P(V) with the point [φ] of P(V∗) for which the line is P(kerφ), as Proposition 22.8.2 allows. Then the set of tangent lines of C is the smooth conic of P(V∗) with matrix A−1.

Proof. The tangent at [x]∈C is the zero set of the functional y↦β(x,y)=x⊤Ay, whose coordinate vector in the dual basis (Theorem 5.1.3) is Ax. As [x] runs over C, the corresponding point of P(V∗) is [Ax] with x⊤Ax=0. Since A is invertible, putting z=Ax gives x=A−1z and 0=x⊤Ax=z⊤(A−1)⊤AA−1z=z⊤A−1z, using (A−1)⊤=(A⊤)−1=A−1. Conversely every nonzero z with z⊤A−1z=0 arises this way, from x=A−1z, which satisfies x⊤Ax=z⊤A−1z=0. The matrix A−1 is symmetric and invertible, so the set is a smooth conic. This proves the corollary.

22.10.5. Lines in space: Plücker coordinates

The definition, the proposition, the theorem, and the warning that follow work over any field; no characteristic hypothesis is needed, and none is used. Only the paragraph closing the subsection returns to quadrics, and it re-imposes charF≠2 where it does.

Chapter 15 built the exterior powers and hinted that the k×k minors of an n×k matrix turn a k-dimensional subspace into a single point. Here it is. A line of P3=P(F4) is P(W) with dim⁡W=2; a basis (u,w) of W has a wedge u∧w∈Λ2F4, which is nonzero by Theorem 15.8.7; and dim⁡Λ2F4=(42)=6 by Theorem 15.8.5. So a line in space becomes a point of P5. The only questions are whether the point depends on the basis, whether different lines give different points, and which points of P5 occur.

Index convention. In this part we number the standard basis of F4 as e0,e1,e2,e3, matching the homogeneous coordinates [x0:x1:x2:x3] on P3, and we write eij=ei∧ej for i<j and e0123=e0∧e1∧e2∧e3.

Definition 22.10.3 (Plücker Coordinates of a Line)

Let L=P(W) be a line of P3 and let (u,w) be a basis of W. The Plücker coordinates of L relative to that basis are the six scalars pij:=uiwj−ujwi,0≤i<j≤3, that is, the 2×2 minors of the 4×2 matrix with columns u and w. By Theorem 15.9.5 they are the coordinates of the wedge: u∧w=∑i<jpijeij. The point [u∧w]∈P(Λ2F4)=P5 is the Plücker point of L, written [L].

Proposition 22.10.8 (The Plücker Point Determines the Line)

Let L=P(W) be a line of P3 and let (u,w) be a basis of W.

  • (a) u∧w≠0, and [u∧w] does not depend on the choice of basis (u,w) of W, so [L] is well defined.
  • (b) W={v∈F4:v∧u∧w=0}. Consequently L↦[L] is injective on lines.

Proof.

  • (a) A basis is independent, so Theorem 15.8.7 gives u∧w≠0. Any other basis is u′=au+cw, w′=bu+dw for a change-of-basis matrix with columns (a,c) and (b,d), which is invertible, so ad−bc≠0. Expanding, u′∧w′=adu∧w+cbw∧u=(ad−bc)u∧w, the terms u∧u and w∧w vanishing. A nonzero scalar multiple represents the same point of P5.

  • (b) By Theorem 15.8.7, v∧u∧w=0 exactly when (v,u,w) is dependent, and since (u,w) is independent this happens exactly when v∈span(u,w)=W. So W, hence L, is recovered from any representative of [L]; and if [L]=[L′] their representatives differ by a scalar, which does not change the set in the display, so W=W′ and L=L′. This proves the proposition.

Which points of P5 are Plücker points? Exactly one equation decides it.

Theorem 22.10.9 (The Plücker Relation and the Klein Quadric)

Let F be any field and let 0≠ω=∑i<jpijeij∈Λ2F4. Then ω=u∧w for some u,w∈F4 if and only if

p01p23−p02p13+p03p12=0.
(22.10.1)

Consequently L↦[L] is a bijection from the set of lines of P3 onto the set K:={[ω]∈P5:p01p23−p02p13+p03p12=0}, the Klein quadric.

Idea. (⇒) is an identity: substitute pij=uiwj−ujwi and watch twelve terms cancel in six pairs. (⇐) needs a way to produce the two vectors, and the right one is to look for them in a kernel. The map v↦v∧ω has a matrix, and pairing it against a second vector turns it into a bilinear form B(v,v′)e0123=v∧v′∧ω — which is alternating, because v∧v=0. Two facts about alternating matrices then finish it: the determinant of a 4×4 one is the square of its Pfaffian, which here is the left-hand side of Eq. 22.10.1, and the rank of an alternating matrix is even. A vanishing Pfaffian therefore drops the rank from 4 to 2, leaving a kernel of dimension 2, and the two vectors are there.

Proof. (⇒) Suppose pij=uiwj−ujwi. Expanding the three products, p01p23=u0u2w1w3−u0u3w1w2−u1u2w0w3+u1u3w0w2,p02p13=u0u1w2w3−u0u3w1w2−u1u2w0w3+u2u3w0w1,p03p12=u0u1w2w3−u0u2w1w3−u1u3w0w2+u2u3w0w1. Each of the six monomials appears in exactly two of the three lines, and forming p01p23−p02p13+p03p12 cancels both copies every time. Monomial by monomial: u0u2w1w3 carries +1 in the first line and −1 in the third, contributing (+1)−0+(−1)=0; u0u3w1w2 carries −1 in the first and −1 in the second, contributing (−1)−(−1)+0=0; u1u2w0w3 likewise (−1)−(−1)+0=0; u1u3w0w2 gives (+1)−0+(−1)=0; u0u1w2w3 gives 0−1+1=0; and u2u3w0w1 gives 0−1+1=0. The total is 0. This direction used nothing about F and did not need u∧w≠0.

(⇐) Suppose ω≠0 satisfies Eq. 22.10.1. Since dim⁡Λ4F4=1 with basis e0123 (Corollary 15.8.6), there is a unique scalar B(v,v′) with v∧v′∧ω=B(v,v′)e0123, where, expanding ω in the basis, v∧v′∧ω=∑i<jpijv∧v′∧ei∧ej is a combination of wedges of four vectors. So B is bilinear, the wedge being linear in each slot, and alternating: B(v,v)e0123=v∧v∧ω=0. Let G be its matrix in the basis (e0,e1,e2,e3); by Proposition 14.3.2 (b), G is an alternating matrix. Each entry is read off ea∧eb∧ei∧ej, which is ±e0123 when {a,b,i,j}={0,1,2,3} and 0 otherwise: for instance B(e0,e1)=p23 because only the term e0∧e1∧e2∧e3=e0123 survives, and B(e0,e2)=−p13 because e0∧e2∧e1∧e3=−e0123 by Lemma 15.8.1 (a). In full, G=(0p23−p13p12−p230p03−p02p13−p030p01−p12p02−p010). By Example (The Pfaffian in Sizes 2 and 4), a 4×4 alternating matrix with entries a,b,c,d,e,f above the diagonal, read in the order a12,a13,a14,a23,a24,a34, has determinant (af−be+cd)2. Here that reads detG=(p23p01−(−p13)(−p02)+p12p03)2=0 by Eq. 22.10.1. So rankG≤3, and rankG is even by Corollary 14.9.3 (a), hence rankG≤2.

Next, rad(B)={v:v∧ω=0}. Indeed if v∧ω=0 then B(v,v′)=0 for every v′. Conversely suppose η=v∧ω≠0 and write η=∑ScSeS over the four 3-element subsets S⊆{0,1,2,3}, with some cS≠0; let k be the index not in S. Then ek∧η=±cSe0123≠0, every other term having a repeated factor. Exchanging the first two arguments of a wedge of four vectors changes its sign (Lemma 15.8.1 (a)), so v∧ek∧ω=−ek∧v∧ω=−ek∧η≠0, and therefore B(v,ek)≠0. (The two one-sided radicals agree because B is alternating, hence skew-symmetric by Theorem 14.3.3 (a).)

By Proposition 14.1.2 (b), dim⁡rad(B)=4−rankG≥2. Choose independent u,w with u∧ω=w∧ω=0 and extend to a basis (u,w,x,y) of F4 (Theorem 1.6.5). By Theorem 15.8.5 the six wedges of pairs from this basis form a basis of Λ2F4, so ω=c1u∧w+c2u∧x+c3u∧y+c4w∧x+c5w∧y+c6x∧y. Wedging with u kills the three terms containing u and leaves 0=u∧ω=c4u∧w∧x+c5u∧w∧y+c6u∧x∧y, three distinct members of the basis of Λ3F4 given by Theorem 15.8.5, hence independent; so c4=c5=c6=0. Wedging what remains with w, 0=w∧ω=−c2u∧w∧x−c3u∧w∧y, so c2=c3=0. Hence ω=c1u∧w with c1≠0, and ω=(c1u)∧w is a wedge.

The bijection. If L is a line then [L]=[u∧w] satisfies Eq. 22.10.1 by (⇒), and the relation is a homogeneous condition of degree 2, so it depends only on the point of P5. Injectivity is Proposition 22.10.8 (b). For surjectivity, let [ω]∈K. By (⇐), ω=u∧w, and ω≠0 forces (u,w) independent by Theorem 15.8.7, so W=span(u,w) is 2-dimensional and L=P(W) is a line with [L]=[ω]. This proves the theorem.

Remark. Chapter 15 reaches the same equation by a different route, in Exercise (C1: The Plücker relation): there ω∧ω=2(p01p23−p02p13+p03p12)e0123, so in characteristic ≠2 a decomposable ω, for which ω∧ω=0, forces the bracket to vanish. That route is credited here, not used. The proof above stands on results proved in the text, and it needs no assumption on the characteristic, which the ω∧ω route does; Exercise (C2: The Klein quadric) develops the ω∧ω identity for its own sake.

Warning. Not every point of P5 is a line. The element ω=e01+e23 has p01=p23=1 and all other coordinates 0, so the left-hand side of Eq. 22.10.1 equals 1, and 1≠0 in every field. It is therefore not a wedge, and [ω]∉K. Six numbers are two too many to describe a line freely; the relation removes one dimension and the projective scaling another.

When charF≠2, the left-hand side of Eq. 22.10.1 is a quadratic form on the 6-dimensional space Λ2F4, so K is a projective quadric in P5 in the exact sense of Definition 22.10.1. That is the sentence the section was built to reach: the set of all lines in three-dimensional space is itself a quadric, and everything proved about quadrics in the first half applies to it. Which quadric it is, Exercise (C2: The Klein quadric) works out: it computes the Gram matrix and finds the quadric smooth, with inertia (3,3,0) over R. That computation is left to the exercise, and nothing here rests on it.

Example (A line, its Plücker point, and back)

Find the Plücker coordinates of the line L of P3(Q) through [1:0:1:0] and [0:1:0:2], check the relation, and recover L from the coordinates.

Solution. With u=(1,0,1,0) and w=(0,1,0,2), the six minors are p01=1,p02=0,p03=2,p12=−1,p13=0,p23=2, so u∧w=e01+2e03−e12+2e23. The relation holds: p01p23−p02p13+p03p12=1⋅2−0⋅0+2⋅(−1)=0. To go back, build the matrix G of the proof: G=(020−1−20200−20110−10), whose rank is 2: row 3 is −1 times row 1 and row 4 is −12 times row 2, while rows 1 and 2 are independent. Its null space is cut out by 2v1−v3=0 and v0−v2=0, that is, by v2=v0 and v3=2v1, and is spanned by (1,0,1,0) and (0,1,0,2) — the two points we started from, as Proposition 22.10.8 (b) promises.

22.10.6. Summary and transfer

The chapter began by removing the origin and ended by adding points at infinity, and both moves paid for themselves in theorems that have no exceptional cases. Four habits are worth carrying away.

A geometry is a group acting on a set, and the invariants name the subject. Affine maps preserve parallelism and ratios along a line; Euclidean motions preserve distance; projectivities preserve only incidence and the cross-ratio. Each time, the theorems of the geometry are exactly the statements its group cannot disturb, and the group was a matrix group in disguise: an (n+1)×(n+1) block matrix for the affine group, an orthogonal matrix plus a translation for motions, and GL(V) modulo scalars for projectivities.

Adding points removes cases. The affine formula for the dimension of a join needed two cases; its projective counterpart needs none. Two lines in a projective plane always meet. A quadratic form in three variables has one classification list, not a longer one split by whether a center exists. The extra points cost nothing, since P(V) is built from the same vector space.

Choose the representative. A point of P(V) is a line of vectors, and nearly every projective proof in this chapter began by picking one vector per point so that the hypothesis became an equation: a′=a+o in Desargues, u+to in Pappus, the normalized second intersection point in the conic parametrization. The choice is where the content is, and it is worth stating out loud each time which scalings are still free afterwards.

Homogeneous means algebraic. A condition that survives scaling is a condition on P(V): q(x)=0, the Plücker relation, membership of a subspace. That is why each of the objects in this chapter turned out to be the solution set of homogeneous polynomial equations — and the last of them, the Klein quadric, made the lines of P3 into points of a quadric in P5, so that a question about lines becomes a question about a symmetric matrix. Chapter 14’s classification of forms and Chapter 15’s exterior powers were the two tools that made it possible, and neither was built with geometry in mind.

What the chapter did not do is also worth recording. It developed no analysis of its own: no limits and no continuity arguments. The only topological words used inside a proof, in Section 3, are quoted from Chapters 16 and 18’s theorems, and nothing is said about the topology of P2(R), which is a subject of its own. Quadrics required charF≠2 everywhere, as Chapter 14 warned they would; Desargues, Pappus, and the Plücker correspondence did not. And the axiomatic side of projective geometry — planes not of the form P(V), coordinatization by division rings — was pointed at once, in Section 9, and proved nowhere.

22.10.7. Exercises

A. Check your understanding

Exercise (A1)
  • (a) State Definition 22.10.1 and say why the zero set is well defined on P(V).
  • (b) Which invariant classifies quadrics over an algebraically closed field, and which over R?
  • (c) List the five projective equivalence classes of conics in P2(R) with their zero sets.
  • (d) State the Plücker relation, and say what the six coordinates are the minors of.
  • (e) True or false, with a reason: a smooth conic over R is never empty.

Solution.

  • (a) The zero set Z(q)={[x]:q(x)=0} of a nonzero quadratic form q, over a field of characteristic ≠2. It is well defined because q(λx)=λ2q(x), so for λ≠0 one value is zero exactly when the other is.

  • (b) Rank alone over an algebraically closed field (Theorem 22.10.1 (a)); rank together with inertia up to interchanging n+ and n− over R (part (b) of the same theorem).

  • (c) By Corollary 22.10.2 (b): (1,0) a line; (2,0) a point; (1,1) two distinct lines; (3,0) the empty set; (2,1) a smooth nonempty conic.

  • (d) p01p23−p02p13+p03p12=0, where the pij are the six 2×2 minors of the 4×2 matrix whose columns are two points spanning the line.

  • (e) False. x02+x12+x22 has rank 3, so its conic is smooth, and the zero set in P2(R) is empty.

B. Practice

Exercise (B1: Classify these conics)

Classify each of the following conics of P2 over R and over C, giving the rank, the real inertia, and the zero set. Justify your answer.

  • (a) 2x0x1+2x0x2+2x1x2=0.
  • (b) x02+2x0x1+x12=0.
  • (c) x02+2x0x1+x12+x22=0.

Solution.

  • (a) Put y0=x0+x1 and y1=x0−x1, so 2x0x1=12(y02−y12) and 2x0x2+2x1x2=2y0x2. Then q=12(y02+4y0x2)−12y12=12(y0+2x2)2−2x22−12y12. The three forms y0+2x2=x0+x1+2x2, y1=x0−x1 and x2 are independent, the matrix with those rows having determinant −2. So the rank is 3 and the real inertia is (1,2,0), which is (2,1,0) after a sign change; by Corollary 22.10.2 the zero set is a smooth nonempty conic over R and a smooth conic over C. For instance [1:0:0] lies on it, every term of q having a factor x1 or x2.

  • (b) q=(x0+x1)2, rank 1, inertia (1,0,2). The zero set is the line {x0+x1=0} over either field.

  • (c) q=(x0+x1)2+x22, rank 2, inertia (2,0,1). Over R the zero set is the single point [1:−1:0]. Over C the form factors as (x0+x1+ix2)(x0+x1−ix2), so the zero set is two distinct lines.

Exercise (B2: A conic through five points)

Find the conic of P2(Q) through [1:0:0], [0:1:0], [0:0:1], [1:1:1] and [1:−1:2], verify that no three of the five points are collinear, and decide whether the conic is smooth.

Solution. Write q=ax02+bx12+cx22+dx0x1+ex0x2+fx1x2. The three standard basis points give a=b=c=0. Then [1:1:1] gives d+e+f=0 and [1:−1:2] gives −d+2e−2f=0. Adding, 3e−f=0, so f=3e and d=−e−f=−4e. Taking e=1, q=−4x0x1+x0x2+3x1x2. No three of the five are collinear: the determinants of the 3×3 matrices formed by any three of the five coordinate vectors are, in the order 123, 124, 125, 134, 135, 145, 234, 235, 245, 345, 1, 1, 2, −1, 1, 3, 1, 1, −1, −2, none of them zero.

The matrix is A=(0−21/2−203/21/23/20),detA=−3≠0, so the conic is smooth, and by the argument of Example (A conic through five points) (product of eigenvalues negative, trace zero) its real inertia is (2,1,0).

Exercise (B3: Plücker coordinates)
  • (a) Compute the Plücker coordinates of the line of P3(Q) through [1:1:0:0] and [0:0:1:1], and check Eq. 22.10.1.
  • (b) Determine whether [ω] with (p01,p02,p03,p12,p13,p23)=(1,0,0,0,0,1) is the Plücker point of a line. Justify your answer.
  • (c) The six numbers (1,1,0,0,−1,−1), in the same order, satisfy Eq. 22.10.1. Find the line they come from.

Solution.

  • (a) With u=(1,1,0,0) and w=(0,0,1,1), p01=0,p02=1,p03=1,p12=1,p13=1,p23=0, and 0⋅0−1⋅1+1⋅1=0.

  • (b) No. The left-hand side of Eq. 22.10.1 is 1⋅1−0+0=1≠0, so by Theorem 22.10.9 the element e01+e23 is not a wedge and its point is not on the Klein quadric.

  • (c) First, 1⋅(−1)−1⋅(−1)+0⋅0=0, as stated. Build G as in the proof of Theorem 22.10.9: G=(0−110100−1−100101−10). Its null space is given by −v1+v2=0 and v0−v3=0, so it is spanned by (1,0,0,1) and (0,1,1,0). The line is the one through [1:0:0:1] and [0:1:1:0]; as a check, its minors are p01=1, p02=1, p03=0, p12=0, p13=−1, p23=−1, as given.

C. Going deeper

Exercise (C1: All rational points of a circle)

Work in P2(Q) with C=Z(x02+x12−x22).

  • (a) Prove that C is smooth and that P0=[0:1:1] lies on it.
  • (b) Using Theorem 22.10.5 with ℓ={x1=0}, compute the resulting parametrization of C explicitly.
  • (c) Deduce that every solution of a2+b2=c2 in integers with c≠0 is a rational multiple of (2uv, u2−v2, u2+v2) for some integers u,v, and exhibit the triple obtained at [u:v]=[2:1].

Solution.

  • (a) The matrix is diag(1,1,−1), invertible, so C is smooth; and 0+1−1=0, so P0∈C. Also P0∉ℓ, since its x1-coordinate is 1≠0.

  • (b) Here p=(0,1,1) and β(x,y)=x0y0+x1y1−x2y2. A point of ℓ is [u:0:v], with q(x)=u2−v2 and β(p,x)=−v. So ψ([u:0:v])=[−(u2−v2)(0,1,1)−2v(u,0,v)]=[−2uv : v2−u2 : −u2−v2]=[2uv : u2−v2 : u2+v2]. Indeed (2uv)2+(u2−v2)2=(u2+v2)2.

  • (c) Let a2+b2=c2 with a,b,c integers and c≠0. Then [a:b:c] is a point of C with rational coordinates, so by Theorem 22.10.5 it equals ψ([u:0:v]) for exactly one point of ℓ, which has rational, hence after clearing denominators integer, coordinates u,v. Therefore (a,b,c) is a rational multiple of (2uv,u2−v2,u2+v2). At [u:v]=[2:1] this is (4,3,5).

Exercise (C2: The Klein quadric)

Let charF≠2, write Q(ω)=p01p23−p02p13+p03p12 for ω∈Λ2F4, and let βQ be the symmetric bilinear form with βQ(ω,ω)=Q(ω), which exists and is unique by Theorem 14.3.5.

  • (a) Prove that ω∧ω=2Q(ω)e0123 for every ω∈Λ2F4, and deduce ω∧ω′=2βQ(ω,ω′)e0123.
  • (b) Prove that two lines L,L′ of P3 meet if and only if βQ([L],[L′])=0, the value being computed from any representatives.
  • (c) Compute the matrix of βQ in the basis ordered (e01,e23,e02,e13,e03,e12). Deduce that Q has rank 6, so that the Klein quadric is smooth, and that over R its inertia is (3,3,0).

Hint: for (a), expand and note that only complementary pairs of index sets survive; the same computation appears in Exercise (C1: The Plücker relation) (a).

Solution.

  • (a) Expanding ω∧ω=∑S,TpSpTeS∧eT over 2-element index sets, a term vanishes unless S and T are disjoint, so only the pairs {01},{23}, {02},{13}, {03},{12} and their reverses survive. A reversal does not change eS∧eT for |S|=|T|=2: passing each of the two factors of eT across the two factors of eS costs four transpositions, and a permutation that is a product of four transpositions has sign +1 (Corollary 7.3.3), so by Lemma 15.8.1 (b) the value is unchanged. Sorting, e01∧e23=e0123, e02∧e13=−e0123 (one transposition), and e03∧e12=e0123 (two). So ω∧ω=2(p01p23−p02p13+p03p12)e0123.

    For the second identity expand (ω+ω′)∧(ω+ω′) in two ways. Wedging is symmetric on 2-vectors, by bilinearity and the remark just made, so the cross terms combine: 2Q(ω+ω′)e0123=2Q(ω)e0123+2ω∧ω′+2Q(ω′)e0123. Since βQ(ω,ω′)=12(Q(ω+ω′)−Q(ω)−Q(ω′)) by Theorem 14.3.5, this rearranges to ω∧ω′=2βQ(ω,ω′)e0123.

  • (b) Write L=P(W), L′=P(W′) with bases (u,w) and (u′,w′). By (a), βQ=0 on the pair exactly when u∧w∧u′∧w′=0, which by Theorem 15.8.7 happens exactly when (u,w,u′,w′) is dependent, that is, when dim⁡(W+W′)≤3. By Theorem 1.7.3 this says dim⁡(W∩W′)≥2+2−3=1, which says L∩L′≠∅. Rescaling a representative rescales βQ by a nonzero factor, so vanishing does not depend on the choice.

  • (c) In that order the matrix is block diagonal with the three 2×2 blocks (01/21/20),(0−1/2−1/20),(01/21/20), since Q is a sum of three products of complementary coordinates. Each block has determinant −1/4≠0, so the whole matrix is invertible and rankQ=6: the quadric is smooth. Over R each block has eigenvalues ±1/2, one positive and one negative, so the inertia is (3,3,0).

Found a typo or a mistake? Report it, or read this page’s source

The text of this book is licensed under CC BY-NC-SA 4.0.