22.8  Duality

Two facts about the projective plane sit side by side. Two distinct points lie on exactly one line; two distinct lines meet in exactly one point. Read either sentence aloud with “point” and “line” exchanged and you get the other. This is not a coincidence and it is not a philosophy: Chapter 5 already built the machine that produces it. A hyperplane of P(V) is the set of points killed by a linear functional, the functional is determined by the hyperplane up to a scalar, and so the hyperplanes of P(V) are themselves the points of a projective space, namely P(V∗). This section turns that observation into an inclusion-reversing dictionary between the projective subspaces of P(V) and those of P(V∗), gets the dimension bookkeeping right at both ends, and says exactly how much of the “duality principle” we are entitled to claim.

Throughout, F is an arbitrary field and V is a finite-dimensional vector space over F with dim⁡V=n+1≥1, so that P(V) has dimension n (Definition 22.6.1). No hypothesis on the characteristic is needed anywhere in this section, and no analysis is used. We keep the two extreme projective subspaces in play: P({0})=∅, of dimension −1, and P(V) itself, of dimension n. The correspondence below exchanges them, and it is precisely at those two ends that a duality argument is easiest to get wrong.

22.8.1. Projective subspaces remember their subspaces

Everything rests on being able to move between a projective subspace P(U) and the subspace U it came from. That is the content of a short lemma, proved in Section 6 and recalled here because almost every proof below uses it.

Lemma 22.8.1 (Passing Between U and P(U))

Let U,U1,U2 be subspaces of V.

  • (a) P(U1)⊆P(U2) if and only if U1⊆U2. In particular U↦P(U) is injective, so a projective subspace determines its subspace.
  • (b) P(U1∩U2)=P(U1)∩P(U2).
  • (c) P(U1)∨P(U2)=P(U1+U2), where ∨ is the join, the smallest projective subspace containing both (Proposition 22.6.5).

Proof. Part (a) is Lemma 22.6.4, and parts (b) and (c) are Proposition 22.6.5 (a) and (b), the latter being where ∨ was defined.

One consequence will be used repeatedly: if S⊆T are projective subspaces of the same finite dimension, then S=T. Indeed US⊆UT by (a) and dim⁡US=dim⁡UT, so US=UT by Theorem 1.6.8.

22.8.2. The points of the dual space are the hyperplanes

A hyperplane of P(V) is a projective subspace of dimension n−1, that is, P(H) for a hyperplane H of V in the sense of Definition 5.5.2. In P2 these are the lines; in P3, the planes.

Now the hook. A hyperplane of V is the kernel of a nonzero functional (Theorem 5.5.3), and the functional is determined by its kernel up to a scalar, which is the injectivity half of the next proposition. “A nonzero vector of V∗, up to a nonzero scalar” is exactly the description of a point of P(V∗). So the hyperplanes of P(V) are not merely a set: they are the points of a projective space of their own, of the same dimension.

The dual projective space is the space whose points are the hyperplanes of the original.

Definition 22.8.1 (Dual Projective Space)

Let V be a finite-dimensional vector space over F with dim⁡V=n+1≥1. The dual projective space of P(V) is the projective space P(V∗) of the dual space V∗ (Definition 5.1.2). A point of P(V∗) is a class [φ] with φ∈V∗ nonzero, and [φ]=[ψ] exactly when ψ=λφ for some λ∈F∖{0}.

Its dimension is dim⁡V∗−1=n, by Corollary 5.1.4: the dual projective space has the same dimension as the original. That is worth pausing on, because the correspondence we are about to build reverses dimensions inside a space of unchanged size.

Nonexample by minimal change. Take φ=0. It is a perfectly good element of V∗, but [0] is not a point of P(V∗) — the definition excludes the zero vector, as Definition 22.6.1 does. And indeed ker0=V, which is not a hyperplane: it has codimension 0, not 1 (Definition 5.5.2). The clause “nonzero” is exactly what keeps the following bijection honest.

Proposition 22.8.2 (Points of the Dual Are Hyperplanes)

Let dim⁡V=n+1≥1. The map [φ]⟼P(kerφ) is a well-defined bijection from P(V∗) onto the set of hyperplanes of P(V).

Idea. Three checks. Well defined: proportional functionals have the same kernel. Surjective: a hyperplane P(H) has dim⁡H0=1 by the annihilator count, so it is cut out by some nonzero functional. Injective: two functionals with the same kernel H both lie in the one-dimensional space H0, so they are proportional. The counting does all the work.

Proof. Well defined. If φ≠0 then kerφ is a hyperplane of V by Theorem 5.5.3, so P(kerφ) is a projective subspace of dimension dim⁡kerφ−1=n−1, a hyperplane of P(V). If [ψ]=[φ], then ψ=λφ with λ≠0, and ψ(v)=0 if and only if φ(v)=0, so kerψ=kerφ.

Surjective. Let P(H) be a hyperplane of P(V), so dim⁡H=n. By Theorem 5.2.2, dim⁡H0=(n+1)−n=1, so there is a nonzero φ∈H0. Then H⊆kerφ by Definition 5.2.1, and both have dimension n — the second by Theorem 5.5.3 and Theorem 4.4.5 — so H=kerφ by Theorem 1.6.8.

Injective. Suppose kerφ=kerψ=H with φ,ψ≠0. Then φ,ψ∈H0, which has dimension 1 as above. Two nonzero vectors of a one-dimensional space are proportional, so ψ=λφ with λ≠0, that is, [ψ]=[φ].

In coordinates this is completely concrete. Take V=Fn+1 with coordinates x0,…,xn. By Theorem 5.1.1 every functional is φa(x)=a0x0+⋯+anxn for a unique a∈Fn+1, and this identification is a linear isomorphism Fn+1→(Fn+1)∗. So a point of the dual plane is a class [a0:⋯:an], and the hyperplane it names is {[x]∈Pn(F) : a0x0+⋯+anxn=0}. The equation is homogeneous, so it does not matter which representative x we substitute; and scaling a does not change the solution set. Both scalings are exactly the ones the projective spaces divide out.

Example (A line and its point)

In P2(Q), find the point of the dual plane naming the line through [1:1:0] and [0:1:1]. Then find the point where the lines x0−x1+x2=0 and x0+x2=0 meet.

Solution. The line. Its subspace is U=span((1,1,0),(0,1,1)), of dimension 2. By Theorem 5.2.2, dim⁡U0=3−2=1, so one nonzero functional does it. We need a0+a1=0 and a1+a2=0, whose solutions are the multiples of a=(1,−1,1). Check: 1−1+0=0 and 0−1+1=0. So the line is x0−x1+x2=0, named by the dual point [1:−1:1].

The meet. Dually, we need x with x0−x1+x2=0 and x0+x2=0. Subtracting, x1=0; then x0=−x2. The solution space is spanned by (−1,0,1), so the two lines meet in the single point [−1:0:1]. Check: −1−0+1=0 and −1+1=0.

The two computations are the same computation, run in V and in V∗. That is the whole of duality in one example.

Warning. There is no canonical duality between P(V) and itself. The rule “the point [a0:a1:a2] names the line a0x0+a1x1+a2x2=0” looks like a self-duality of P2(F), but it depends on the coordinates. In P2(Q) the rule assigns to [1:0:1] the line x0+x2=0. Change coordinates by y0=x0, y1=x1, y2=2x2. The same point is [1:0:2] in the new coordinates, and the same rule now assigns to it the line y0+2y2=0, that is, x0+4x2=0. These are different lines: the point [1:0:−1] lies on the first, since 1−1=0, and not on the second, since 1−4=−3≠0. What is canonical is the correspondence between P(V) and P(V∗), not one between P(V) and itself. Identifying the two requires a choice — a basis, or a nondegenerate form, which is how the pole and polar of a conic will be built in Section 10 of this chapter.

22.8.3. The duality correspondence

We now extend [φ]↦P(kerφ) from hyperplanes to all projective subspaces. The right tool is the annihilator, and we keep Chapter 5’s notation: for a subspace U⊆V, U0={φ∈V∗:φ(u)=0 for all u∈U} (Definition 5.2.1).

For a projective subspace S=P(U) of P(V), define S0:=P(U0)⊆P(V∗). This is well defined because S determines U, by Lemma 22.8.1 (a).

Before the theorem, the dimension bookkeeping, because it is the step where such a correspondence is usually stated wrongly. Projective dimension is one less than linear dimension. So from dim⁡U+dim⁡U0=n+1 we get (dim⁡S+1)+(dim⁡S0+1)=n+1,that isdim⁡S0=n−1−dim⁡S. Test it at both ends. If S=∅, so U={0} and dim⁡S=−1, the formula gives dim⁡S0=n, and indeed {0}0=V∗, so S0=P(V∗). If S=P(V), with dim⁡S=n, the formula gives −1, and indeed V0={0}, so S0=∅. A point (dim⁡S=0) goes to a hyperplane (dim⁡S0=n−1), and a hyperplane goes to a point, agreeing with Proposition 22.8.2. The formula is symmetric in the sense that d↦n−1−d is its own inverse on {−1,0,…,n}.

Theorem 22.8.3 (The Duality Correspondence)

Let dim⁡V=n+1≥1, and let S,T be projective subspaces of P(V), the empty set and P(V) included. Then:

  • (a) dim⁡S0=n−1−dim⁡S;
  • (b) S⊆T if and only if T0⊆S0;
  • (c) (S∨T)0=S0∩T0 and (S∩T)0=S0∨T0;
  • (d) S↦S0 is a bijection from the set of projective subspaces of P(V) onto the set of projective subspaces of P(V∗).

Idea. Every part is a Chapter 5 statement on annihilators, translated through Lemma 22.8.1, with the dimension shifted by one at each end. The only part that needs thought is the reverse implication in (b) and the surjectivity in (d): both go up a level to V∗∗ and come back with Corollary 5.3.4, which is available because V is finite-dimensional.

Proof. Write S=P(U) and T=P(U′), which is legitimate and unambiguous by Lemma 22.8.1 (a).

  • (a) By Theorem 5.2.2, dim⁡U0=(n+1)−dim⁡U. Hence dim⁡S0=dim⁡U0−1=n−dim⁡U=n−(dim⁡S+1)=n−1−dim⁡S.

  • (b) (⇒) If S⊆T, then U⊆U′ by Lemma 22.8.1 (a), so (U′)0⊆U0 by Theorem 5.2.3 (a), so T0⊆S0 by the same lemma. (⇐) Suppose T0⊆S0, so (U′)0⊆U0. Applying Theorem 5.2.3 (a) inside V∗ gives U00⊆(U′)00. By Corollary 5.3.4, U00=evV(U) and (U′)00=evV(U′), so evV(U)⊆evV(U′). Since evV is injective (Theorem 5.3.2), U⊆U′, and S⊆T.

  • (c) By Lemma 22.8.1 (c), S∨T=P(U+U′), and (U+U′)0=U0∩(U′)0 by Theorem 5.2.3 (c). Applying P(⋅) and Lemma 22.8.1 (b), (S∨T)0=P(U0∩(U′)0)=P(U0)∩P((U′)0)=S0∩T0. For the second identity, S∩T=P(U∩U′) by Lemma 22.8.1 (b), and (U∩U′)0=U0+(U′)0 by Theorem 5.2.3 (d), which needs V finite-dimensional. Applying P(⋅) and part (c) of the same lemma gives (S∩T)0=S0∨T0.

  • (d) Injective. If S0=T0 then U0=(U′)0 by Lemma 22.8.1 (a), so U=U′ by Corollary 5.3.5, so S=T.

Surjective. Let R=P(W) be a projective subspace of P(V∗), where W is a subspace of V∗. Put U:=evV−1(W0)={v∈V:φ(v)=0 for every φ∈W}, a subspace of V: it is the intersection of the kernels kerφ over φ∈W, each a subspace by Theorem 2.2.1, and an intersection of subspaces is a subspace by Theorem 1.2.2. Since evV is surjective (Theorem 5.3.2), evV(U)=W0. By Corollary 5.3.4, (U0)0=U00=evV(U)=W0. Now U0 and W are subspaces of the finite-dimensional space V∗ with the same annihilator, so U0=W by Corollary 5.3.5 applied in V∗. Hence P(U)0=P(W)=R. This proves the theorem.

Quick check. Let S be a line in P3(F). What is dim⁡S0, and what kind of object is S0? What if S is a point?

Solution. Here n=3 and dim⁡S=1, so dim⁡S0=3−1−1=1 by Theorem 22.8.3 (a): S0 is again a line, this time in the dual space P((F4)∗). Lines in P3 are self-dual in dimension, which is one reason they are the interesting objects there. If instead S is a point, dim⁡S=0 and dim⁡S0=3−1−0=2: a plane in the dual space. Concretely, it is the set of all planes of P3 through that point.

Remark. The last sentence of the solution is the general reading of the correspondence. Since S⊆P if and only if P0⊆S0, the hyperplanes containing S are exactly the points of S0: a projective subspace is named, on the dual side, by the family of hyperplanes that contain it. For a point, that family is a hyperplane’s worth of hyperplanes.

Diagram. Labels: P, in nP (V), L mapsto L^0, P^0, in nP (V^*), each line L through P is one point L^0 of the dual plane,\\ and those points fill the line P^0

22.8.4. Dualizing twice

Applying the correspondence twice lands in P(V∗∗), not back in P(V). Chapter 5 already told us what to do: the evaluation map is a canonical isomorphism V→V∗∗, and it induces a projectivity.

Theorem 22.8.4 (Dualizing Twice Returns the Original)

Let dim⁡V=n+1≥1. The evaluation map evV:V→V∗∗ is an isomorphism (Theorem 5.3.2), so it induces a projectivity [evV]:P(V)→P(V∗∗) (Definition 22.7.1). For every projective subspace S of P(V), S00=[evV](S), so that under the identification P(V)=P(V∗∗) given by [evV] we have S00=S. Moreover the inverse of the bijection of Theorem 22.8.3 (d) is R↦[evV]−1(R0).

Proof. Write S=P(U). By the definition of the correspondence applied twice, S00=P((U0)0)=P(evV(U)), using Corollary 5.3.4. By Proposition 22.7.2, P(evV(U))=[evV](P(U))=[evV](S).

For the last statement, let R be a projective subspace of P(V∗) and put S:=[evV]−1(R0), a projective subspace of P(V) by Proposition 22.7.2 applied to [evV]−1. Then [evV](S)=R0, so by the first part (S0)0=S00=R0. Both S0 and R are projective subspaces of P(V∗), and Theorem 22.8.3 (d) applied to the space V∗ says that the correspondence there is injective, so S0=R.

Duality is also compatible with the maps of Section 07, which is what makes it more than a coordinate trick.

Proposition 22.8.5 (Duality and Projectivities)

Let T:V→W be an isomorphism of (n+1)-dimensional spaces, with dual map T′:W∗→V∗ (Definition 5.4.1), which is an isomorphism by Theorem 5.4.1 (d). Then for every projective subspace S of P(V), ([T](S))0=[(T′)−1](S0).

Proof. Write S=P(U), so [T](S)=P(T(U)) by Proposition 22.7.2. For ψ∈W∗, ψ∈T(U)0⟺ψ(Tu)=0 for all u∈U⟺(T′ψ)(u)=0 for all u∈U, the second step by Definition 5.4.1, and the right-hand condition says T′ψ∈U0. Hence T(U)0=(T′)−1(U0). Applying P(⋅) and Proposition 22.7.2 to the isomorphism (T′)−1 gives the claim.

22.8.5. The duality principle

We can now state precisely what “every theorem has a dual” amounts to in this book.

Theorem 22.8.6 (The Duality Principle)

Let dim⁡V=n+1≥1, and let S↦S0 be the correspondence of Theorem 22.8.3, from the projective subspaces of the n-dimensional space P(V) onto those of the n-dimensional space P(V∗). Let R,S,T be projective subspaces of P(V) and let d be an integer. Then:

  • (a) S⊆T if and only if T0⊆S0; and S=T if and only if S0=T0;
  • (b) dim⁡S=d if and only if dim⁡S0=n−1−d;
  • (c) R=S∨T if and only if R0=S0∩T0;
  • (d) R=S∩T if and only if R0=S0∨T0;
  • (e) as S runs over all projective subspaces of P(V), the subspace S0 runs exactly once over all projective subspaces of P(V∗).

Proof.

  • (a) The first claim is Theorem 22.8.3 (b), and the second follows by applying it in both directions, or from injectivity in Theorem 22.8.3 (d).

  • (b) By Theorem 22.8.3 (a), dim⁡S0=n−1−dim⁡S. So dim⁡S=d gives dim⁡S0=n−1−d; conversely dim⁡S0=n−1−d gives n−1−dim⁡S=n−1−d, hence dim⁡S=d.

  • (c) (⇒) is Theorem 22.8.3 (c). (⇐) If R0=S0∩T0=(S∨T)0, then R=S∨T by the equality clause of (a).

  • (d) The same argument with the second identity of Theorem 22.8.3 (c).

  • (e) This is Theorem 22.8.3 (d).

How the principle is used, and what we have not proved. Every clause of Theorem 22.8.6 is an “if and only if”, and by (e) the correspondence is a bijection between the two supplies of subspaces. So a proved statement about P(V) whose hypotheses and conclusion are built only from the relations ⊆ and =, the operations ∨ and ∩, and the dimensions of the subspaces involved, can be translated clause by clause: reverse every inclusion, exchange ∨ with ∩, and replace every dimension d by n−1−d. The translated statement then holds in P(V∗); and since every (n+1)-dimensional space W satisfies W≅(W∗)∗ (Theorem 5.3.2), a statement true in P(V∗) for every V is true in P(W) for every W, because projectivities preserve all of this structure (Proposition 22.7.2).

This is a recipe, carried out below on the statements this chapter makes, and each carrying out is a proof. It is not a theorem here. To make “for every statement built only from …” itself a theorem, one has to define a formal language of incidence statements and induct on the way a statement is built, and this book has set up no such language. So we claim the principle only as a working method, and we prove each dual statement we use.

Corollary 22.8.7 (Two Points, Two Lines)

Let dim⁡V=3, so that P(V) is a projective plane.

  • (a) Two distinct points of P(V) lie on exactly one line.
  • (b) Two distinct lines of P(V) meet in exactly one point.

Idea. Prove (a) by hand: two distinct points have independent representatives, so their span is a plane in V and a line in P(V). Then get (b) from (a) by the dictionary, in P(V∗), which is a projective plane of its own. Section 06 already proved both statements directly from the dimension formula (Proposition 22.6.8, Corollary 22.6.7). The point of doing (b) again this way is that duality delivers it with no geometry at all: every step is a clause of Theorem 22.8.6 with n=2.

Proof.

  • (a) Let P=[v]≠Q=[w]. The list (v,w) is independent: otherwise w would be a scalar multiple of v, giving P=Q. So span(v,w) has dimension 2, and by Lemma 22.8.1 (c), P∨Q=P(span(v,w)), a projective subspace of dimension 1, that is, a line containing both points. If L is any line containing P and Q, then P∨Q⊆L because the join is the smallest such subspace, and both have dimension 1, so L=P∨Q by the consequence noted after Lemma 22.8.1.

  • (b) Here n=2. Let L1≠L2 be lines of P(V). By Theorem 22.8.6 (b), dim⁡Li0=2−1−1=0, so L10 and L20 are points of P(V∗), and they are distinct by the equality clause of Theorem 22.8.6 (a). The space P(V∗) is a projective plane, since dim⁡V∗=3 by Corollary 5.1.4, so part (a), applied in P(V∗), says that L10∨L20 is a line, of dimension 1.

By Theorem 22.8.6 (d), (L1∩L2)0=L10∨L20. Hence dim⁡(L1∩L2)0=1, and Theorem 22.8.6 (b) read backwards gives dim⁡(L1∩L2)=2−1−1=0. A projective subspace of dimension 0 is a single point. This proves that L1 and L2 meet in exactly one point.

The same bookkeeping shows that the dimension formula of Theorem 22.6.6 is self-dual: replacing each of dim⁡(S∨T), dim⁡(S∩T), dim⁡S, dim⁡T by n−1 minus itself and exchanging ∨ with ∩ turns dim⁡(S∨T)+dim⁡(S∩T)=dim⁡S+dim⁡T into (n−1−dim⁡(S∩T))+(n−1−dim⁡(S∨T))=(n−1−dim⁡S)+(n−1−dim⁡T), which is the same equation after canceling 2(n−1). A self-dual theorem is one whose dual gives nothing new, and that is a useful thing to be able to detect.

Warning. The dual of “point” is not “line”; it is “hyperplane”, and which dimension that is depends on n. In the projective plane, n=2, and 2−1−0=1: points dualize to lines, which is why Corollary 22.8.7 looks like a swap of the two words. In P3, n=3, so points dualize to planes (3−1−0=2) and lines dualize to lines (3−1−1=1). The correct dual of “two distinct points lie on a unique line” in P3 is “two distinct planes meet in a unique line”, and that is true. The careless dual, “two distinct lines meet in a point”, is false in P3: the lines P(span(e0,e1)) and P(span(e2,e3)) have span(e0,e1)∩span(e2,e3)={0}, so they do not meet at all. Always compute n−1−d; never translate by the words alone.

Pole and polar — the correspondence a conic sets up between the points and the lines of a plane — is the one piece of duality that needs a quadratic form rather than only the annihilator. It is treated in Section 10 of this chapter, where conics are, and nothing in this section depends on it.

22.8.6. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define the dual projective space of P(V), and say what its dimension is.
  • (b) Let S be a plane in P4(F). Compute dim⁡S0.
  • (c) True or false, with a reason: the duality correspondence of Theorem 22.8.3 is a bijection from the points of P(V) to the points of P(V).
  • (d) In P2, what is the dual of the statement “three distinct points are collinear”?
  • (e) What are ∅0 and P(V)0?

Solution.

  • (a) It is P(V∗), the projective space of the dual space (Definition 22.8.1). If dim⁡P(V)=n, then dim⁡P(V∗)=n as well, by Corollary 5.1.4.

  • (b) A plane has dimension 2 and n=4, so dim⁡S0=4−1−2=1: a line in the dual space.

  • (c) False, twice over. It is a bijection between all projective subspaces of P(V) and all projective subspaces of P(V∗), and it sends points of P(V) to hyperplanes of P(V∗), not to points; and its target is P(V∗), not P(V) (see the warning after Example (A line and its point)).

  • (d) With n=2, points dualize to lines and a line dualizes to a point. “Three distinct points lie on one line” becomes “three distinct lines pass through one point”, that is, the three lines are concurrent.

  • (e) ∅0=P({0}0)=P(V∗), of dimension n=n−1−(−1); and P(V)0=P(V0)=P({0})=∅, of dimension −1=n−1−n.

B. Practice

Exercise (B1: Lines and dual points)

Work in P2(Q).

  • (a) Find the dual point of the line through [1:2:1] and [0:1:3].
  • (b) Find the point where the lines x0+x1−x2=0 and 2x0−x1=0 meet.

Solution.

  • (a) We need a=(a0,a1,a2) with a0+2a1+a2=0 and a1+3a2=0. From the second, a1=−3a2; substituting, a0=−2a1−a2=6a2−a2=5a2. Taking a2=1 gives a=(5,−3,1), so the line is 5x0−3x1+x2=0 and the dual point is [5:−3:1]. Check: 5−6+1=0 and 0−3+3=0. By Theorem 5.2.2 the solution space is one-dimensional, so this is the only answer up to scaling.

  • (b) Solve x0+x1−x2=0 and 2x0−x1=0. The second gives x1=2x0, and then x2=x0+x1=3x0. Taking x0=1, the meet is [1:2:3]. Check: 1+2−3=0 and 2−2=0. The solution space is one-dimensional, consistent with Corollary 22.8.7 (b).

Exercise (B2: Dimension bookkeeping)

Let n=5, so P(V)=P5(F). For each of the following S, give dim⁡S0, and say which of the two is larger.

  • (a) S a point.
  • (b) S a line.
  • (c) S of dimension 2.
  • (d) S a hyperplane.
  • (e) S=∅.

Then determine whether there is any S with dim⁡S0=dim⁡S. Justify your answer.

Solution. By Theorem 22.8.3 (a), dim⁡S0=5−1−dim⁡S=4−dim⁡S.

  • (a) dim⁡S=0, dim⁡S0=4; the dual is larger. (b) 1 and 3; the dual is larger. (c) 2 and 2; equal. (d) 4 and 0; the original is larger. (e) −1 and 5; the dual is larger.

For the last part, dim⁡S0=dim⁡S means 4−dim⁡S=dim⁡S, that is, dim⁡S=2. So the self-dual dimension in P5 is 2, and part (c) is an instance. In general dim⁡S0=dim⁡S forces 2dim⁡S=n−1, which has a solution exactly when n is odd.

Exercise (B3: Dualize a statement)

For each statement about P3(F), write the dual statement, using Theorem 22.8.6 with n=3, and say whether both are true.

  • (a) A point and a line not through it lie in exactly one plane.
  • (b) Three planes with no common line meet in at most one point.

Solution. With n=3, the dimension rule is d↦2−d: points (0) and planes (2) exchange, lines (1) stay lines, ∅ (−1) and the whole space (3) exchange. Joins become meets.

  • (a) Dual: a plane and a line not contained in it meet in exactly one point. Both are true. For the original: if P⊈L then P∩L=∅, so by Theorem 22.6.6 dim⁡(P∨L)=0+1−(−1)=2, a plane, and it is unique because any plane containing both contains P∨L and has the same dimension. Dualizing each clause by Theorem 22.8.6 gives the dual statement, which is therefore also true; directly, if the plane Π does not contain L, then Π∨L has dimension 3, so dim⁡(Π∩L)=2+1−3=0.

  • (b) Dualize clause by clause, as the warning after Corollary 22.8.7 insists. The hypothesis “the three planes contain no common line” reads: there is no L with dim⁡L=1 and L⊆Π1∩Π2∩Π3. Writing Pi=Πi0, which are points by Theorem 22.8.6 (b), and using (a) and (d) of that theorem, the hypothesis becomes: there is no L′ with dim⁡L′=1 and P1∨P2∨P3⊆L′, that is, the three points are not collinear. The conclusion “Π1∩Π2∩Π3 has dimension at most 0” becomes “P1∨P2∨P3 has dimension at least 2”. So the dual statement is: three points not on a common line span a projective subspace of dimension at least 2, that is, they span a plane. Both are true: three noncollinear points [v1],[v2],[v3] have independent representatives, since a dependence would put all three in a subspace of dimension at most 2 and hence on a common line, so their join has dimension 2 by Lemma 22.8.1 (c). The original then follows by dualizing back.

C. Going deeper

Exercise (C1: Counting in a finite projective plane)

Let q be a prime power and F=Fq.

  • (a) Show that a projective space of dimension d over Fq has (qd+1−1)/(q−1) points.
  • (b) Deduce that P2(Fq) has as many lines as points, and that every point lies on exactly q+1 lines.

Solution.

  • (a) Such a space is P(U) with dim⁡U=d+1. The set U∖{0} has qd+1−1 elements, and two nonzero vectors give the same point exactly when they differ by a scalar in Fq∖{0}, a set of size q−1. So each point has exactly q−1 representatives, and the number of points is (qd+1−1)/(q−1).

  • (b) By Proposition 22.8.2 the lines of P2(Fq) are in bijection with the points of P((Fq3)∗), which by Corollary 5.1.4 is again a projective plane over Fq. So by (a) with d=2 both counts are N:=q2+q+1.

For the last claim, fix a point P. The lines of P2(Fq) containing P are, by the remark after Theorem 22.8.3, exactly the points of P0, and dim⁡P0=2−1−0=1 by Theorem 22.8.3 (a). So by (a) with d=1 there are q+1 of them. As a check, count the incident pairs (P,L) with P∈L in two ways: each line is a projective space of dimension 1 and so carries q+1 points, giving N(q+1) pairs, and the other count gives N(q+1) as well.

Exercise (C2: A form makes a self-duality)

Let β be a nondegenerate symmetric bilinear form on V, with dim⁡V=n+1.

  • (a) Show that Rβ:V→V∗, v↦β(⋅,v), is an isomorphism, and deduce that it induces a projectivity [Rβ]:P(V)→P(V∗).
  • (b) Hence define, for a projective subspace S of P(V), a projective subspace S⊥ of P(V) with dim⁡S⊥=n−1−dim⁡S, and show that the assignment S↦S⊥ is an inclusion-reversing bijection of the set of projective subspaces of P(V) with itself.
  • (c) Give an example over R with n=2 in which S⊆S⊥ for some point S, and explain why this cannot happen if β is positive definite.

Solution.

  • (a) By Proposition 14.1.2, β is nondegenerate exactly when Rβ is an isomorphism V→V∗. A projectivity is induced by any isomorphism (Definition 22.7.1), so [Rβ] is one.

  • (b) Define S⊥:=[Rβ]−1(S0). This is a projective subspace of P(V) by Proposition 22.7.2, of the same dimension as S0, namely n−1−dim⁡S by Theorem 22.8.3 (a). Since [Rβ]−1 is a bijection preserving inclusion (Proposition 22.7.2) and S↦S0 is an inclusion-reversing bijection onto the projective subspaces of P(V∗) (Theorem 22.8.3 (b), (d)), the composite is an inclusion-reversing bijection of the projective subspaces of P(V) with themselves.

  • (c) Take V=R3 and β(x,y)=x0y0+x1y1−x2y2, which is nondegenerate since its matrix diag(1,1,−1) is invertible. Let v=(1,0,1), so β(v,v)=1+0−1=0, and let S={[v]}. Then Rβ(v)=β(⋅,v) kills v, so [v]∈S⊥, that is, S⊆S⊥. If β were positive definite, then β(v,v)>0 for every v≠0, so no nonzero vector is annihilated by its own functional, and S⊆S⊥ is impossible for a point S. The nonzero vectors with β(v,v)=0 are the isotropic ones of Definition 14.7.1, taken for the quadratic form q(v)=β(v,v); they are exactly the points lying on their own duals.

Exercise (C3: What the correspondence does to a chain)

Let dim⁡V=n+1 and let ∅=S−1⊊S0⊊S1⊊⋯⊊Sn=P(V) be projective subspaces with dim⁡Sd=d for each d.

  • (a) Prove that Sn0⊊Sn−10⊊⋯⊊S−10 is again such a chain, and identify dim⁡Sd0.
  • (b) Deduce that S↦S0 carries the chains of this shape in P(V) bijectively to those in P(V∗), and that it reverses their order.

Solution.

  • (a) By Theorem 22.8.6 (a), Sd⊆Sd+1 gives Sd+10⊆Sd0, and the inclusion is strict: if Sd+10=Sd0 then Sd+1=Sd by the equality clause, contradicting strictness. By Theorem 22.8.6 (b), dim⁡Sd0=n−1−d. As d runs from −1 to n, the value n−1−d runs from n down to −1, taking each value once. So writing Te:=Sn−1−e0 gives dim⁡Te=e and T−1⊊T0⊊⋯⊊Tn, a chain of the same shape in P(V∗).

  • (b) The assignment is injective because S↦S0 is (Theorem 22.8.6 (e)), applied term by term. It is surjective: given a chain T−1⊊T0⊊⋯⊊Tn with dim⁡Te=e in P(V∗), set Sd:=[evV]−1(Tn−1−d0), which by Theorem 22.8.4 is the unique projective subspace of P(V) with Sd0=Tn−1−d. By Theorem 22.8.6 (b), dim⁡Sd=n−1−(n−1−d)=d; and if d<d′ then n−1−d>n−1−d′, so Tn−1−d⊋Tn−1−d′, whence Sd⊊Sd′ by Theorem 22.8.6 (a). So (Sd) is a chain of the required shape whose image is the given one, and the order has been reversed.

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.