Chapter 14 classified symmetric bilinear forms and
never drew a picture. This section is the picture. A
quadratic form on
has a zero set in , 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 , a plane in is a wedge of two
vectors, and the wedges among all of are picked
out by one quadratic equation. The lines in space are
themselves a quadric.
Throughout this section , except in the Plücker material at
the end, which needs no hypothesis on and says so where it
begins. The reason is Chapter 14’s: in characteristic
a quadratic form
is not determined by a symmetric matrix, and every
classification theorem we lean on fails.
Quadrics
in projective space
A quadratic form on is not a function on
: its value
at
is times
its value at , so a point has
no well-defined -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 , let be a finite-dimensional
vector space over
and let be a
nonzero quadratic form on (Definition 14.3.2), with
associated symmetric bilinear form (Theorem 14.3.5). The
projective quadric defined by is The rank of the quadric is
, and the
quadric is smooth (or
nondegenerate) when is nondegenerate,
that is, when the rank is . 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 with , then , which is zero exactly when is. The word
nonzero in the definition rules out
, whose zero
set is all of and carries no
information. And the rank is well defined because is: over a field of
characteristic a quadratic form has exactly one symmetric
bilinear form behind it (Theorem 14.3.5).
Fix a basis of . Then for a unique symmetric
matrix , the
matrix of (Definition 14.1.2), and
is the rank
of the quadric. Three examples in , written in
homogeneous coordinates .
- , with , rank , smooth. Over its points are the
projective version of the unit circle; is one of
them.
- ,
with ,
rank . Its zero
set is the union of the two lines and .
- , rank
. Its zero set is
the single line , because a field has no nonzero element
whose square is .
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 the distinct forms
and have the same zero set in , namely the
empty set, which records nothing at all about either of
them. So “the quadric ” is always shorthand
for “the quadric defined by ”, and the theorem below
classifies forms up to projective
equivalence, not sets.
A projective transformation (Definition 22.7.1)
carries to
,
and
for every .
So the right relation on forms is: and are
projectively equivalent when
for some and some . In
matrices: with invertible, which is
congruence (Definition 14.2.1) followed
by a scaling.
Theorem
22.10.1 (Classification of Projective
Quadrics)
Let and , and let be nonzero quadratic forms on with matrices in some
basis.
- (a) If is algebraically
closed, then and
are
projectively equivalent if and only if .
There are exactly classes, one for each
rank , with normal form .
- (b) If , then and are projectively
equivalent if and only if their inertias and agree up to interchanging
with . A normal
form is
with ,
.
Idea. Both parts reduce the extra
freedom — the scalar — to something already
classified. Over an algebraically closed field has a square root, so
scaling is itself a congruence and adds nothing: the
answer is Chapter 14’s. Over a positive is again a congruence,
and the only new move is , which turns into and swaps the two
counts.
Proof.
- (a) It is enough
to show that a symmetric of rank is congruent to
,
since a congruence is the case and congruence is
an equivalence relation (Proposition 14.2.2). By Theorem 14.4.2, , and congruence preserves rank (Theorem 14.2.3), so exactly
of the are nonzero;
permuting the basis, a congruence by a permutation
matrix, we may assume these are . Since
is algebraically
closed, choose
with
for and put
for
, otherwise; by Proposition 14.4.3 the
congruence by replaces by , giving . (For
this is Corollary 14.4.4.)
Suppose with . Choose with ; then with invertible, so and Theorem 14.2.3 gives .
The ranks of a nonzero form run over , and the
normal form is the produced above, whose quadratic form
is .
- (b) If the
inertias agree, Corollary 14.5.2 (b) gives
,
which is the case . If they agree after interchanging and , then has the same
inertia as , so
, which is the case composed with a
congruence.
Let . If , put and argue as in (a): , so the
inertias agree by Corollary 14.5.2 (b). If
, put ; then . Diagonalizing with positive and negative entries
diagonalizes
with the two counts interchanged, so the inertia of
, hence of , is by Theorem 14.5.1. This proves
the theorem.
For the
list is short enough to write out, and worth
memorizing.
Corollary
22.10.2 (The Conics of a Projective
Plane)
Let and let be a nonzero quadratic
form on a -dimensional space.
- (a) Over an
algebraically closed there are three
classes, with zero sets: a line (rank ), two distinct lines
(rank ), a smooth
conic (rank ).
- (b) Over there are five
classes, listed by with , with zero sets:
Proof. The classes are those of Theorem 22.10.1; only the
zero sets need identifying, and each is read off a
normal form.
holds
exactly when , a field having no nonzero square root of
; the set is the
line .
Next,
factors over an algebraically closed field as
with , and
the two linear forms are not proportional since (as ), so the set is two distinct lines; over
instead forces
,
leaving the single point . The form gives two distinct lines
over every field of characteristic . Over ,
forces , which is not a point of , so the set is
empty. Finally has rank , so its quadric is
smooth, and it contains . This proves the
corollary.
Warning. Rank alone does
not classify real conics; inertia does. The
forms and both have rank , and one zero set is
empty while the other has infinitely many points. One
rank lower, and both have rank , and the zero sets are
a point and a pair of lines. Over 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 in
, and say
what happens over .
Solution. Complete the square in
first, since
appears:
so the form equals . Completing the square in in what is left,
, and therefore The three linear forms , , are independent — the
matrix with these rows is upper triangular with
determinant — so
this is a diagonalization with inertia . By Corollary 22.10.2 (b) the
conic is empty over .
Over the
same three squares have rank , so by (a) the conic is
smooth, and it is not empty: take and , so that the
second square vanishes and the equation becomes , solved by
. The
point 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 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 , of
rank ; up to sign
the form is in suitable coordinates. Rank gives a line and rank
gives either
nothing or a curve, so no other class can produce one
point.
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 and
: 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 , let and let be a quadratic form on vanishing on every
vector of a -dimensional subspace
. Then for two
nonzero linear functionals on with , and the
rank of is at
most . In
particular a smooth conic contains no
line.
Proof. Let be the symmetric
form of and
choose a basis of with . Evaluating at , at , and at ,
all of which lie in , gives the third because . Since is invertible, too. Put , and . In the
coordinates of this basis, a product with ,
whose kernel is ,
and the second
factor, which is nonzero because . The Gram matrix
of in this
basis (Definition 14.1.2) has rows
, and ; the first
two lie in a -dimensional subspace,
so the three of them span at most a -dimensional one and the
rank is at most .
If is smooth
its rank is , so
no such exists,
and a line
contained in
would supply one. This proves the lemma.
Theorem
22.10.4 (Five Points Determine a Conic)
Let and let be five points of in general position
(Definition 22.7.2), that
is, pairwise distinct with no three collinear. Then
there is a nonzero quadratic form on 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 matrices form
a -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 . 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 . 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 , and the other
must then carry — three collinear points, which general
position forbids.
Proof. Let be the
subspace of symmetric matrices. A symmetric matrix is
determined by its three diagonal entries and its three
entries above the diagonal, each of which may be chosen
freely, so . By Theorem 14.3.5 the map , , is a bijection from
onto the
quadratic forms on , and it is
linear.
Existence. Write . For
each the map
is a linear
functional on ,
because the expression is linear in the entries of . The five functionals
give a homogeneous linear system of equations in the coordinates of , which by Corollary 3.2.5 (a)
has a nontrivial solution . The corresponding is a nonzero
quadratic form vanishing at every , hence at
every .
(Vanishing does not depend on the representative, by the
homogeneity noted after Definition 22.10.1.)
Uniqueness. Let be the
solution space of that system, and suppose . Pick
independent , and write for the corresponding forms, which are
independent as forms since is a
bijection that is linear.
The line contains at least three points: it is
with , so it
contains , and
for a basis of , and these are three
distinct points. Choose on with and . The condition
is one
homogeneous linear equation in , so by Corollary 3.2.5 (a)
it has a solution with .
Put , which is nonzero because are
independent, and let , a nonzero quadratic form.
Now vanishes
at the three distinct points of . Restrict to : in the basis
it reads . A nonzero vanishes at at most two
points of .
Indeed, if then whenever , so every zero
has and is
therefore for
a scalar with
— a polynomial in of degree at most , nonzero because its
leading coefficient is , so with at most
two roots (Lemma 3.7.2); if
then
, whose zeros are together with the
at most one point where ,
and since . Three zeros therefore force , that is, vanishes on all of
.
By Lemma 22.10.3, with
.
For we
have , and , since
would put on
, making
collinear. Hence for
, so all lie on
the line — three collinear points among the five,
contradicting general position.
So :
the form is unique up to a nonzero scalar, and is the unique conic
through the five points. This proves the theorem.
Example
(A conic through five points)
Find the conic of through , , , and , and decide
whether it is smooth.
Solution. Write . The first three
points give at once. Then gives and gives , that is
.
Subtracting, , so and . Taking , 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 , , , , , , , , , , the determinants of
the corresponding coordinate matrices are none of them zero.)
Its matrix is so the conic is smooth. Over its inertia is : the three
eigenvalues are real (Corollary 12.5.2)
and the inertia counts their signs (Theorem 14.5.3); their
product is , so an odd number of them is negative, and
rules out
all three, leaving exactly one.
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 that converts one
solution of a Diophantine equation into all of them;
over it says
a smooth conic with a point has exactly of them.
Theorem
22.10.5 (Projection from a Point of a
Conic)
Let , let be a smooth conic in
, , and suppose
contains a point
.
Let be any
line of with
.
Then the map is a well-defined bijection. In particular
is in bijection
with .
Idea. Each point of is joined to , and the line meets in and in exactly one
further point — “further” understood so that a tangent
line counts
twice. Expanding and using 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 other than itself meets once, which is where
the inverse comes from.
Proof. Write with ; since , we have
,
so for every .
The formula is well defined. Replacing by with multiplies by , so the point is
unchanged. The vector is nonzero: if both and , then for all , so
vanishes on the -dimensional subspace
,
contradicting Lemma 22.10.3 since is smooth. If instead
the vector has a nonzero component along
modulo
;
and if with , the vector is .
The value lies on . Put . Using and
bilinearity,
A fact used twice. If and
,
then ; otherwise would vanish on ,
a -dimensional
subspace since represent distinct points,
contradicting Lemma 22.10.3 again.
Surjectivity. Let . Suppose
first . The line is distinct
from , since
, so
by Corollary 22.6.7 it meets
in a single
point ,
and with (else ). Then and , so which is a nonzero multiple of by the fact just
proved. So . Now suppose . The set
is a line, being nondegenerate
so that is
a nonzero functional; it contains , because , hence , and meets in one point . There and by the nonvanishing argument above, so
.
Injectivity. Suppose , with
. For any the vector lies in ,
so lies
on the line joining to . If , then
both and lie
on the line joining to , and both lie
on ; these two
lines are distinct because , so by Corollary 22.6.7 they
meet in one point and . If , then
; since and is invertible, , and likewise for . So
and
both
lie on ,
again a single point.
Finally is
a projective line, hence in bijection with by any choice of
basis of . This
proves the theorem.
Example
(Pythagorean triples from one point)
Parametrize the rational points of the conic in
,
starting from .
Solution. Here , with , and is
invertible, so the conic is smooth. Also , so
. Take
,
which misses ,
and write its points as with .
With we get
and , so Taking to be integers, not both zero, the three
coordinates are integers, and a Pythagorean triple; the identity is exactly
the statement that lands in .
By Theorem 22.10.5 every
point of arises
from exactly one point of . So if are integers with
and
, then is a rational
point of , hence
for some rational and
integers :
every Pythagorean triple is proportional to one of this
shape. (If
then
forces .)
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 , that is at the point of , the formula returns
.
That is as it should be: the line joining to consists of the
points , and , which
vanishes only for . So that line meets at alone, and is the only value
can take
there. At the formula gives .
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 be
a smooth conic in , , with
symmetric bilinear form , and let . The
polar of with respect to is and is
the pole of that line. For , the polar is called the
tangent line to at .
Because is
nondegenerate, is
a nonzero functional (Proposition 14.1.2 (c)), so
its kernel is -dimensional and really is a
line; and replacing by 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
and
.
- (a) if and
only if .
- (b) if and only if
.
- (c) Let and let be a line through . Then if and
only if ; every other line through meets in exactly two
points.
Proof.
(a) Both
conditions say , since is
symmetric.
(b) says
, which is .
(c) Write with . A point of is , and since , Case 1: , that is, . Then , and :
otherwise would
vanish on ,
contradicting Lemma 22.10.3. So the
expression vanishes only when , giving the
single point .
Case 2: , so . Then the factorization above vanishes when
, giving
, and when , which has the solution
with ,
giving a point of
different from .
Every point of is one of these two, since the two cases
and exhaust the factorization
and each determines . This
proves the proposition.
Corollary
22.10.7 (The Dual Conic)
Let be a
smooth conic in with matrix in some basis, and
identify each line of with the point
of for which the
line is , as Proposition 22.8.2
allows. Then the set of tangent lines of is the smooth conic of
with
matrix .
Proof. The tangent at is the
zero set of the functional , whose coordinate vector
in the dual basis (Theorem 5.1.3) is . As runs over
, the
corresponding point of is with . Since is invertible, putting
gives and using . Conversely every
nonzero
with arises this way, from , which satisfies . The matrix
is
symmetric and invertible, so the set is a smooth conic.
This proves the corollary.
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 where it does.
Chapter 15 built the exterior powers and hinted that
the
minors of an matrix turn a -dimensional subspace
into a single point. Here it is. A line of is with ; a basis of
has a wedge , which is nonzero by Theorem 15.8.7; and by Theorem 15.8.5. So a line
in space becomes a point of . The only questions
are whether the point depends on the basis, whether
different lines give different points, and which points
of occur.
Index convention. In this part we
number the standard basis of as , matching the
homogeneous coordinates on , and we write for and .
Definition
22.10.3 (Plücker Coordinates of a Line)
Let
be a line of
and let be a basis of . The Plücker
coordinates of relative to that basis
are the six scalars that is, the minors of the matrix with
columns
and . By Theorem 15.9.5 they are
the coordinates of the wedge: The point is the
Plücker point of , written .
Proposition
22.10.8 (The Plücker Point Determines the
Line)
Let
be a line of
and let be a
basis of .
- (a) , and
does not depend on the choice of basis of
, so is well defined.
- (b) . Consequently is
injective on lines.
Proof.
(a) A basis is
independent, so Theorem 15.8.7 gives . Any other basis is , for a change-of-basis matrix with
columns and
, which is
invertible, so . Expanding, the terms
and
vanishing. A nonzero scalar multiple represents the same
point of .
(b) By Theorem 15.8.7, exactly when
is dependent, and since is
independent this happens exactly when . So , hence , is recovered from any
representative of ; and if their
representatives differ by a scalar, which does not
change the set in the display, so and . This proves
the proposition.
Which points of are Plücker points?
Exactly one equation decides it.
Theorem
22.10.9 (The Plücker Relation and the Klein
Quadric)
Let be any
field and let . Then for some
if and only if
(22.10.1)
Consequently is a bijection from the
set of lines of onto the set the Klein quadric.
Idea. is an
identity: substitute 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 has a matrix, and pairing
it against a second vector turns it into a bilinear form
—
which is alternating, because . Two facts about alternating matrices
then finish it: the determinant of a 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 to , leaving a kernel of
dimension , and
the two vectors are there.
Proof. Suppose
. Expanding the three products, Each of the six monomials appears in exactly
two of the three lines, and forming cancels both copies every time.
Monomial by monomial: carries
in the first
line and in the
third, contributing ; carries
in the first and
in the second,
contributing ; likewise
; gives ;
gives
; and
gives
. The
total is . This
direction used nothing about and did not need .
Suppose satisfies Eq. 22.10.1. Since with
basis (Corollary 15.8.6), there
is a unique scalar
with where, expanding in the basis,
is a combination of wedges of four
vectors. So is
bilinear, the wedge being linear in each slot, and
alternating: . Let be its matrix in the
basis ;
by Proposition 14.3.2 (b),
is an
alternating matrix. Each entry is read off ,
which is when
and otherwise: for
instance because only the term survives, and because by Lemma 15.8.1 (a). In full,
By Example (The Pfaffian in Sizes 2 and 4),
a
alternating matrix with entries above
the diagonal, read in the order , has determinant . Here
that reads by Eq. 22.10.1. So , and is
even by Corollary 14.9.3 (a), hence
.
Next, . Indeed if
then for every . Conversely
suppose and write
over the four -element subsets ,
with some ; let
be the index not in . Then , 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
, and
therefore . (The two one-sided radicals agree because
is alternating,
hence skew-symmetric by Theorem 14.3.3 (a).)
By Proposition 14.1.2 (b),
. Choose independent with
and extend to a
basis
of (Theorem 1.6.5). By
Theorem 15.8.5 the six
wedges of pairs from this basis form a basis of , so Wedging with kills the three
terms containing and leaves three distinct members of the basis of given by Theorem 15.8.5, hence
independent; so . Wedging what remains with , so . Hence with , and is a wedge.
The bijection. If is a line then satisfies Eq. 22.10.1 by , and the
relation is a homogeneous condition of degree , so it depends only on
the point of .
Injectivity is Proposition 22.10.8 (b).
For surjectivity, let . By
, , and
forces
independent by Theorem 15.8.7, so is -dimensional and is a line with
.
This proves the theorem.
Warning. Not every point of
is a
line. The element has and
all other coordinates , so the left-hand side
of Eq. 22.10.1 equals , and in every field.
It is therefore not a wedge, and . Six
numbers are two too many to describe a line freely; the
relation removes one dimension and the projective
scaling another.
When , the left-hand side of Eq. 22.10.1 is a
quadratic form on the -dimensional space , so is a projective
quadric in 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 over . 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 of through and , check the
relation, and recover from the
coordinates.
Solution. With and
, the six minors are so . The relation holds: To go back, build the matrix of the proof: whose rank is : row is times row and row is times row , while rows and are independent. Its
null space is cut out by and , that is,
by and
, and is
spanned by and — the two
points we started from, as Proposition 22.10.8 (b)
promises.
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 block
matrix for the affine group, an orthogonal matrix plus a
translation for motions, and 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 is built from the
same vector space.
Choose the representative. A point
of 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: in Desargues, 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 : , 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
into points
of a quadric in , 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 , which is a
subject of its own. Quadrics required 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 , coordinatization
by division rings — was pointed at once, in Section 9,
and proved nowhere.
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) State Definition 22.10.1 and
say why the zero set is well defined on .
- (b) Which invariant
classifies quadrics over an algebraically closed field,
and which over ?
- (c) List the five
projective equivalence classes of conics in 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 is never empty.
Solution.
(a) The zero set
of a nonzero quadratic form
, over a field of
characteristic . It is well defined because , so for 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 and over (part (b) of the same
theorem).
(c) By Corollary 22.10.2 (b):
a line; a point; two distinct lines;
the empty
set; a smooth
nonempty conic.
(d) , where the are the six minors of the
matrix
whose columns are two points spanning the line.
(e) False. has
rank , so its
conic is smooth, and the zero set in is
empty.
B. Practice
Exercise
(B1: Classify these conics)
Classify each of the following conics of over and over , giving the rank, the
real inertia, and the zero set. Justify your answer.
- (a) .
- (b) .
- (c) .
Solution.
(a) Put and , so and . Then The three forms , and are independent, the
matrix with those rows having determinant . So the rank is and the real inertia is
, which is
after a
sign change; by Corollary 22.10.2 the
zero set is a smooth nonempty conic over and a smooth conic
over . For
instance
lies on it, every term of having a factor or .
(b) , rank
, inertia . The zero set is
the line over either field.
(c) ,
rank , inertia
. Over the zero set is the
single point . Over the form factors as
,
so the zero set is two distinct lines.
Exercise
(B2: A conic through five points)
Find the conic of through , , , and , verify that no
three of the five points are collinear, and decide
whether the conic is smooth.
Solution. Write . The three standard
basis points give . Then gives and gives . Adding,
, so
and . Taking
, No three of the five are collinear: the
determinants of the matrices formed
by any three of the five coordinate vectors are, in the
order , , , , , , , , , , none of them zero.
The matrix is 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 .
Exercise
(B3: Plücker coordinates)
- (a) Compute the
Plücker coordinates of the line of through and , and check Eq. 22.10.1.
- (b) Determine
whether
with is the Plücker point of a line.
Justify your answer.
- (c) The six numbers
, in
the same order, satisfy Eq. 22.10.1. Find the
line they come from.
Solution.
(a) With and
, and .
(b) No. The
left-hand side of Eq. 22.10.1 is , so by Theorem 22.10.9 the
element is not a wedge and its point is
not on the Klein quadric.
(c) First, , as stated. Build as in the proof of Theorem 22.10.9: Its null space is given by and , so it is
spanned by and . The line is
the one through and ; as a check,
its minors are , , , , , , as
given.
C. Going deeper
Exercise
(C1: All rational points of a circle)
Work in with .
- (a) Prove that is smooth and that
lies
on it.
- (b) Using Theorem 22.10.5 with
,
compute the resulting parametrization of explicitly.
- (c) Deduce that
every solution of in integers with is a rational
multiple of for some integers , and exhibit the
triple obtained at .
Solution.
(a) The matrix is
,
invertible, so is
smooth; and , so . Also , since its -coordinate is .
(b) Here and
. A point of is , with
and . So Indeed .
(c) Let with integers and . Then is a point of
with rational
coordinates, so by Theorem 22.10.5 it equals
for
exactly one point of , which has rational,
hence after clearing denominators integer, coordinates
. Therefore
is a
rational multiple of . At this is
.
Exercise
(C2: The Klein quadric)
Let , write for ,
and let be
the symmetric bilinear form with , which exists and is unique by Theorem 14.3.5.
- (a) Prove that for every ,
and deduce .
- (b) Prove that two
lines of
meet if and
only if , the value being computed from any
representatives.
- (c) Compute the
matrix of
in the basis ordered . Deduce that has rank , so that the Klein
quadric is smooth, and that over its inertia is .
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
over -element
index sets, a term vanishes unless and are disjoint, so only
the pairs , , and their
reverses survive. A reversal does not change
for : passing each of the two factors of
across
the two factors of costs four
transpositions, and a permutation that is a product of
four transpositions has sign (Corollary 7.3.3), so
by Lemma 15.8.1 (b) the value
is unchanged. Sorting, , (one transposition), and (two). So .
For the second identity expand
in two ways. Wedging is symmetric on -vectors, by bilinearity
and the remark just made, so the cross terms combine:
. Since by Theorem 14.3.5, this
rearranges to .
(b) Write , with
bases and
.
By (a),
on the pair exactly when , which by Theorem 15.8.7 happens
exactly when
is dependent, that is, when . By
Theorem 1.7.3 this
says , which says . Rescaling a representative rescales
by a
nonzero factor, so vanishing does not depend on the
choice.
(c) In that order
the matrix is block diagonal with the three blocks since
is a sum of three products of complementary coordinates.
Each block has determinant , so the whole
matrix is invertible and : the quadric
is smooth. Over
each block has eigenvalues , one positive and
one negative, so the inertia is .