22.6  Projective Space

The affine geometry of the first two sections has one flaw, and it is visible in the statement of Theorem 22.2.4: the formula for the dimension of a join has two cases, because two flats may fail to meet. This section builds a geometry in which that never happens. The construction is entirely linear — a projective space is the set of lines through the origin of a vector space — and the payoff is a dimension formula with no exceptional case at all. Everything here works over an arbitrary field F, and neither analysis nor topology enters.

22.6.1. Two lines that do not meet

In the affine plane A2(R), take L1={(y1,y2):y2−y1=0},L2={(y1,y2):y2−y1=1}. A point in both would satisfy 0=1, so L1∩L2=∅. Both are flats of dimension 1 with the same direction space span((1,1)), and their join is the whole plane. So Theorem 22.2.4 (c) is in its second case: dim⁡(L1∨L2)=1+1−1+1=2, with the extra +1 paid for by the failure to meet, and there is nothing to substitute for dim⁡(L1∩L2), because the empty set has no dimension.

The two lines do have something in common: a direction. They are going the same way, and the natural thing to say is that they meet “at infinity”. The whole of this section is the work of turning that phrase into mathematics without losing linearity. The repair, in one sentence: stop working with points of a vector space and start working with its lines through the origin.

22.6.2. The projective space of a vector space

Let V be a vector space over F. On V∖{0} define x∼yif and only ify=λx for some λ∈F, λ≠0. This is an equivalence relation (Definition 0.5.2): it is reflexive with λ=1; symmetric, because y=λx with λ≠0 gives x=λ−1y; and transitive, because y=λx and z=μy give z=(μλ)x with μλ≠0, a field having no zero divisors. Note that 0 had to be removed: it is equivalent only to itself, and keeping it would put a single extra point into every picture with no geometric job.

A point of projective space is a line through the origin, with the origin itself thrown away.

Definition 22.6.1 (Projective Space)

Let V be a finite-dimensional vector space over a field F with dim⁡V=n+1. The projective space of V is the quotient set (Definition 0.5.5) P(V)=(V∖{0})/∼, whose elements are called points. The point determined by x≠0 is written [x]. The dimension of P(V) is dim⁡P(V)=dim⁡V−1=n, so that P({0})=∅ has dimension −1. We write Pn(F)=P(Fn+1) for projective n-space over F. A projective space of dimension 1 is a projective line, and one of dimension 2 a projective plane.

Two clauses need comment. The shift by one in the dimension is not a decoration: it is what makes a projective line behave like a line and a projective plane like a plane, as Theorem 22.6.2 is about to confirm. And the convention dim⁡∅=−1 looks like a dodge, but it is forced by the same shift — the empty set is P({0}) and dim⁡{0}=0 — and it will do real work in Theorem 22.6.6.

Proposition 22.6.1 (Points Are Lines Through the Origin)

Let V be a finite-dimensional vector space over F. The map [x]↦span(x) is a bijection from P(V) onto the set of 1-dimensional subspaces of V.

Proof. Well defined. If [x]=[y] then y=λx with λ≠0, so span(y)=span(x) because each of x,y is a scalar multiple of the other. Also x≠0, so span(x) has dimension 1.

Injective. If span(x)=span(y) with x,y≠0, then y=λx for some λ∈F, and λ≠0 since y≠0. Hence [x]=[y].

Surjective. A 1-dimensional subspace has a basis (x) with x≠0, and then it is span(x), the image of [x]. This proves the proposition.

So a point of P2(F) is a line through the origin of F3, and a “line” of the projective plane will turn out to be a plane through the origin of F3. Every statement below can be read twice: once about P(V) and once about subspaces of V.

Definition 22.6.2 (Homogeneous Coordinates)

Let x=(x0,x1,…,xn)∈Fn+1 be nonzero. The homogeneous coordinates of the point [x]∈Pn(F) are written [x]=[x0:x1:⋯:xn], the colons recording that only the ratios are determined: for every λ≠0, [x0:x1:⋯:xn]=[λx0:λx1:⋯:λxn], and not all of x0,…,xn are zero.

Coordinates run from 0. In Fn+1 we index the entries and the standard basis from 0, writing x=(x0,x1,…,xn) and e0,…,en, and every projective section of this chapter does the same. Subscripts start at 1 everywhere else in the book; the exception pays for itself here, because it keeps the n of Pn(F) equal to the dimension while the coordinates number n+1.

Examples.

  • P0(F)=P(F1) has exactly one point, [1], since every nonzero scalar is a nonzero multiple of 1. Its dimension is 0, as a single point should have.
  • P1(F) consists of the points [1:a] for a∈F, all distinct, together with the single point [0:1]. Indeed if x0≠0 then [x0:x1]=[1:x1/x0], and if x0=0 then x1≠0 and [0:x1]=[0:1].
  • P1(F2)={[1:0],[1:1],[0:1]} has three points. The three lines through the origin of F22 are span((1,0)), span((1,1)), span((0,1)), matching Proposition 22.6.1.
  • The degenerate case P({0})=∅. It is worth keeping, because intersections produce it.

Nonexample by minimal change. Over R, replace the relation by x≈y when y=λx with λ>0. This is still an equivalence relation, but the quotient is not P(V): every projective point [x] splits into the two classes of x and −x. The clause that fails is the one allowing every nonzero λ, and what is lost is precisely the identification of a line with itself traversed backwards.

Warning. A single homogeneous coordinate means nothing. The expression “x1=3” is not a statement about a point of Pn(F), since [1:3:0]=[2:6:0] and the second coordinate changed. Only two kinds of statement survive scaling: a ratio such as x1/x0 where x0≠0, and the vanishing or nonvanishing of a homogeneous expression, such as x1=0 or x0x2−x12=0. Whenever a formula below names a coordinate, check that it survives replacing x by λx.

22.6.3. The affine chart, and where the missing points live

Here is the theorem that makes the construction worth doing: projective space is an affine space plus a smaller projective space.

Theorem 22.6.2 (The Standard Affine Chart)

Let n≥1 and let U0={[x0:⋯:xn]∈Pn(F):x0≠0},H∞={[x0:⋯:xn]∈Pn(F):x0=0}. Then:

  • (a) both conditions are independent of the representative, and Pn(F)=U0⊔H∞, a disjoint union;
  • (b) the map ι:Fn→U0, ι(a1,…,an)=[1:a1:⋯:an], is a bijection, with inverse [x0:⋯:xn]↦(x1/x0,…,xn/x0);
  • (c) H∞=P(W) with W={x∈Fn+1:x0=0}, so H∞ has dimension n−1, and [0:x1:⋯:xn]↦[x1:⋯:xn] is a bijection H∞→Pn−1(F).

U0 is the standard affine chart and H∞ the hyperplane at infinity.

Idea. Scaling multiplies x0 by a nonzero number, so it cannot create or destroy a zero there: that single observation makes both halves well defined. On the half where x0≠0 we may normalize x0 to 1, and once x0=1 the remaining coordinates are no longer ambiguous, which is why the affine points come back one for one. On the other half x0 carries no information at all, so it may be deleted, and what is left is one dimension smaller.

Proof.

  • (a) If y=λx with λ≠0 then y0=λx0, and a product of two elements of a field is zero only if one of them is, so y0=0 exactly when x0=0. Hence both defining conditions depend only on the point. Every point satisfies exactly one of them, so the union is disjoint and exhausts Pn(F).

  • (b) Well defined: (1,a1,…,an)≠0, and its zeroth entry is 1≠0, so ι(a)∈U0.

    Injective: if [1:a]=[1:a′] then (1,a′)=λ(1,a) for some λ≠0; comparing zeroth entries gives λ=1, hence a′=a.

    Surjective: let [x]∈U0, so x0≠0 and x0−1 exists. Then x0−1x=(1,x1/x0,…,xn/x0), so [x]=ι(x1/x0,…,xn/x0). The displayed formula for the inverse is exactly this computation, and it is independent of the representative because replacing x by λx multiplies numerator and denominator of each ratio by λ.

  • (c) W is a subspace of Fn+1, being the kernel of the linear functional x↦x0, and dim⁡W=n by the Rank-Nullity Theorem (Theorem 2.3.1), the functional being nonzero and hence surjective onto F (Proposition 5.1.2). A nonzero x has x0=0 exactly when x∈W∖{0}, so H∞=P(W) and dim⁡H∞=n−1 by Definition 22.6.1. The stated map is well defined, because deleting the zeroth coordinate turns λx into λ times the deletion and cannot produce 0 from a nonzero x with x0=0; it is injective and surjective because inserting a zeroth coordinate 0 inverts it. This proves the theorem.

For n=2 the statement reads: the projective plane is the affine plane together with a projective line. Writing it out, every point of P2(F) is exactly one of [1:a:b]  (a,b∈F),[0:1:m]  (m∈F),[0:0:1], the first family being the affine plane through ι, and the last two being the line at infinity H∞≅P1(F), which has |F|+1 points when F is finite. The label m is chosen deliberately: the next proposition shows [0:1:m] is the point where all affine lines of slope m meet.

Diagram. Labels: x_0 = 0, x_0 = 1, cvec 0, each line through cvec 0 is one point of nP^2(F):\\ those meeting the plane x_0=1 give the affine chart,\\ those lying inside the plane x_0 = 0 give the line at infinity
Proposition 22.6.3 (Completing an Affine Line)

Let a1,a2∈F be not both zero, let b∈F, and let L={(y1,y2)∈F2:a1y1+a2y2=b}, a flat of dimension 1 in A2 by Theorem 22.2.10, the single row (a1,a2) being nonzero, with direction space span((−a2,a1)). Let φ(x0,x1,x2)=a1x1+a2x2−bx0 and L¯=P(kerφ)⊆P2(F). Then:

  • (a) L¯ is a projective line;
  • (b) ι(L)=L¯∩U0, so L¯ contains a faithful copy of L;
  • (c) L¯∖U0 is the single point [0:−a2:a1];
  • (d) two such lines L,L′ have the same direction space if and only if L¯ and L′¯ meet H∞ in the same point.

Proof.

  • (a) φ is linear and nonzero, since φ(0,1,0)=a1 and φ(0,0,1)=a2 are not both zero. So φ is surjective onto F (Proposition 5.1.2) and dim⁡kerφ=3−1=2 by Theorem 2.3.1. Hence L¯=P(kerφ) has dimension 1.

  • (b) A point of U0 is ι(y1,y2)=[1:y1:y2] by Theorem 22.6.2 (b), and φ(1,y1,y2)=a1y1+a2y2−b. This vanishes exactly when (y1,y2)∈L. Since φ is homogeneous of degree 1, the vanishing does not depend on the representative.

  • (c) A point of L¯∖U0 has x0=0 and a1x1+a2x2=0 with (x1,x2)≠(0,0). The solution set of that single nontrivial equation in F2 is span((−a2,a1)), of dimension 1, so there is exactly one such projective point, namely [0:−a2:a1].

  • (d) By (c) the point in question is [0:−a2:a1], which by Proposition 22.6.1 determines and is determined by span((−a2,a1)), the direction space of L. This proves the proposition.

Now return to the hook. The lines L1:y2−y1=0 and L2:y2−y1=1 have (a1,a2)=(−1,1) and b=0 respectively b=1, so L¯1:x2−x1=0,L¯2:x2−x1−x0=0. Subtracting the two equations gives x0=0, and then x2=x1 with (x1,x2)≠(0,0). So L¯1∩L¯2={[0:1:1]}, exactly one point, and it lies on the line at infinity. By Proposition 22.6.3 (c) that point is [0:−a2:a1]=[0:−1:−1]=[0:1:1] for both lines, which is their common direction span((1,1)) read as a point. Two parallel lines meet at their shared direction, and nowhere else.

Quick check. In P2(R), which point of the line at infinity do all the vertical affine lines y1=c pass through, and which point do all lines of slope m pass through?

Solution. A vertical line y1=c has (a1,a2)=(1,0), so by Proposition 22.6.3 (c) its point at infinity is [0:−a2:a1]=[0:0:1]. A line y2=my1+k, that is my1−y2=−k, has (a1,a2)=(m,−1) and point at infinity [0:1:m]. So the points of H∞ are [0:1:m] for each slope m∈R, plus [0:0:1] for the vertical direction: one point per direction, and the vertical direction is no longer a special case.

22.6.4. Projective subspaces, and a dimension formula with one case

Definition 22.6.3 (Projective Subspace)

Let V be a finite-dimensional vector space over F. A projective subspace of P(V) is a subset of the form P(U)={[x]:x∈U∖{0}} for a subspace U of V. Its dimension is dim⁡U−1. A projective subspace of dimension 0 is a point, of dimension 1 a line, of dimension 2 a plane, and of dimension dim⁡P(V)−1 a hyperplane.

The dimension is only well defined if U can be recovered from P(U). It can, and the reason is worth isolating.

Lemma 22.6.4 (A Projective Subspace Remembers Its Subspace)

Let U and W be subspaces of V. Then P(U)⊆P(W) if and only if U⊆W; in particular P(U)=P(W) forces U=W.

Proof. (⇐) Immediate from the definition.

(⇒) Suppose P(U)⊆P(W) and let x∈U. If x=0 then x∈W. Otherwise [x]∈P(U)⊆P(W), so [x]=[w] for some w∈W∖{0}, that is x=λw with λ≠0; hence x∈W, W being a subspace. So U⊆W.

For the last claim, apply the equivalence in both directions and use that ⊆ is antisymmetric. This proves the lemma.

Proposition 22.6.5 (Meet and Join)

Let S=P(U) and T=P(W) be projective subspaces of P(V). Then:

  • (a) S∩T=P(U∩W), so an intersection of projective subspaces is a projective subspace;
  • (b) among all projective subspaces containing S∪T there is a smallest one, namely P(U+W).

We write S∨T=P(U+W) and call it the join of S and T.

Proof.

  • (a) Let x≠0. By Lemma 22.6.4 applied to span(x), we have [x]∈P(U) exactly when x∈U. Hence [x]∈S∩T exactly when x∈U and x∈W, that is x∈(U∩W)∖{0}, which says [x]∈P(U∩W).

  • (b) U⊆U+W and W⊆U+W, so P(U+W) contains S∪T by Lemma 22.6.4. Conversely, if P(Y)⊇S∪T for a subspace Y, then the same lemma gives U⊆Y and W⊆Y, hence U+W⊆Y because U+W is the smallest subspace containing both (Theorem 1.7.1), and so P(U+W)⊆P(Y). This proves the proposition.

Theorem 22.6.6 (Projective Dimension Formula)

Let S and T be projective subspaces of a finite-dimensional projective space. Then

dim⁡(S∨T)+dim⁡(S∩T)=dim⁡S+dim⁡T.
(22.6.1)

There is no exceptional case: the identity holds for all S and T, including when S∩T=∅, where dim⁡(S∩T)=−1.

Idea. There is nothing to invent. Write S and T as P(U) and P(W), apply Chapter 1’s dimension formula to U and W, and subtract 1 four times. The only thing that needs watching is the bookkeeping of those four −1’s, and the reason the formula has no second case is that two of them cancel against the other two even when U∩W={0} — which is precisely the situation the affine version could not handle.

Proof. By Definition 22.6.3 write S=P(U) and T=P(W); the subspaces U and W are uniquely determined by Lemma 22.6.4. By Proposition 22.6.5, S∨T=P(U+W) and S∩T=P(U∩W). Hence, using Definition 22.6.3 four times and Theorem 1.7.3 once, dim⁡(S∨T)+dim⁡(S∩T)=(dim⁡(U+W)−1)+(dim⁡(U∩W)−1)=(dim⁡U+dim⁡W)−2=(dim⁡U−1)+(dim⁡W−1)=dim⁡S+dim⁡T. The middle step is Theorem 1.7.3, which holds for all subspaces U,W with no hypothesis beyond finite dimension. In particular when U∩W={0} the second term on the first line is 0−1=−1, and the computation is unaffected. This proves the theorem.

Compare the two formulas side by side. For flats A,B of an affine space, Theorem 22.2.4 (c) gives dim⁡(A∨B)={dim⁡A+dim⁡B−dim⁡(A∩B),A∩B≠∅,dim⁡A+dim⁡B−dim⁡(A→∩B→)+1,A∩B=∅, where A→,B→ are the direction spaces. Two cases, and in the second the intersection has dropped out of the formula entirely, replaced by an intersection of direction spaces and an apologetic +1. Eq. 22.6.1 has one case and needs no directions. That is the whole reason for building projective space, and everything the rest of this chapter does with it rests on this one line.

Corollary 22.6.7 (Two Lines in a Projective Plane Meet)

Let P be a projective plane, that is P=P(V) with dim⁡V=3. Then any two distinct lines of P meet in exactly one point.

Proof. Let S=P(U) and T=P(W) be distinct lines, so dim⁡U=dim⁡W=2 and U≠W by Lemma 22.6.4. Then U+W contains U properly: otherwise W⊆U, and two subspaces of the same dimension with one inside the other are equal (Theorem 1.6.8 applied inside U), contradicting U≠W. So dim⁡(U+W)≥3, and dim⁡(U+W)≤dim⁡V=3, whence dim⁡(U+W)=3 and dim⁡(S∨T)=2.

By Theorem 22.6.6, dim⁡(S∩T)=dim⁡S+dim⁡T−dim⁡(S∨T)=1+1−2=0, and a projective subspace of dimension 0 is P(Y) with dim⁡Y=1, which by Proposition 22.6.1 is a single point. This proves the corollary.

Proposition 22.6.8 (Two Points Determine a Line)

Let P(V) be a projective space of dimension at least 1. Any two distinct points of P(V) lie on exactly one line.

Proof. Let [x]≠[y]. Then x and y are linearly independent: a dependence relation with x,y≠0 would give y=λx with λ≠0, hence [x]=[y]. So U=span(x,y) has dimension 2 and P(U) is a line containing both points.

If P(Y) is any line containing both, then x,y∈Y by Lemma 22.6.4, so U⊆Y; and dim⁡Y=2=dim⁡U, so U=Y by Theorem 1.6.8. This proves the proposition.

The two statements just proved are each other’s mirror images: “two distinct points lie on a unique line” and “two distinct lines meet in a unique point”. Section 8 will show that this mirroring is not a coincidence.

Remark. The set P2(R) is also a famous topological object, the real projective plane, and readers who have met it will be expecting words like “compact” and “nonorientable”. This chapter does not use them. Nothing here is topological; every argument has been a statement about subspaces of a vector space, valid over any field, including finite ones where topology has nothing to say.

22.6.5. Counting points

Over a finite field the whole space can be counted, and the count is a useful check on the constructions above.

Proposition 22.6.9 (The Number of Points of a Finite Projective Space)

Let F be a finite field with q elements and let n≥0. Then |Pn(F)|=1+q+q2+⋯+qn=qn+1−1q−1. More generally a projective subspace of dimension d has (qd+1−1)/(q−1) points.

Idea. Count the nonzero vectors and divide by the size of one equivalence class. Every class has the same size, q−1, because scaling a fixed nonzero vector by distinct scalars gives distinct vectors. The alternative count, chart by chart, gives the geometric sum directly, and the two agreeing is a check on Theorem 22.6.2.

Proof. A vector of Fn+1 is a list of n+1 entries, each chosen from F independently, so there are qn+1 of them and qn+1−1 nonzero ones.

Fix x≠0. Its equivalence class is {λx:λ∈F,λ≠0}, and the map λ↦λx is injective there: if λx=μx then (λ−μ)x=0, and x≠0 forces λ=μ. So every class has exactly q−1 elements.

The classes partition Fn+1∖{0} (Theorem 0.5.2), so the number of classes is (qn+1−1)/(q−1). That this equals 1+q+⋯+qn follows from (q−1)(1+q+⋯+qn)=(q+q2+⋯+qn+1)−(1+q+⋯+qn)=qn+1−1, the middle terms canceling in pairs. For a projective subspace P(U) of dimension d, the space U has dimension d+1, hence qd+1 elements, since a choice of basis puts it in bijection with Fd+1 (Corollary 2.5.5); the same argument applies. This proves the proposition.

The geometric sum is Theorem 22.6.2 in disguise: the chart contributes qn points and the hyperplane at infinity contributes |Pn−1(F)|, so |Pn|=qn+|Pn−1|, and unwinding that recursion from |P0|=1 gives 1+q+⋯+qn.

Example (The Fano plane)

Describe P2(F2) completely: its points, its lines, how many points lie on each line, and how many lines pass through each point. Verify Corollary 22.6.7 and Proposition 22.6.8 by direct count.

Solution. By Proposition 22.6.9 there are 1+2+4=7 points. Since F2×={1}, each point has a unique nonzero representative, so the points are simply the seven nonzero vectors of F23. Number the point [x0:x1:x2] by 4x0+2x1+x2: 1=[0:0:1],2=[0:1:0],3=[0:1:1],4=[1:0:0],5=[1:0:1],6=[1:1:0],7=[1:1:1]. A line is P(U) with dim⁡U=2, and by Proposition 22.6.9 it has (22−1)/(2−1)=3 points. Since U={0,u,w,u+w} for any two distinct nonzero u,w∈U, the lines are exactly the triples {u,w,u+w} of nonzero vectors. There are seven: {1,2,3}:x0=0,{1,4,5}:x1=0,{2,4,6}:x2=0,{1,6,7}:x0+x1=0,{2,5,7}:x0+x2=0,{3,4,7}:x1+x2=0,{3,5,6}:x0+x1+x2=0. Each is the kernel of one of the seven nonzero linear functionals on F23, and different functionals have different kernels here because a functional is determined up to a nonzero scalar by its kernel — if kerφ=kerψ=U with dim⁡U=2, then φ and ψ both vanish on U and so lie in the annihilator U0 (Definition 5.2.1), which has dimension 3−2=1 by Theorem 5.2.2 — and the only nonzero scalar here is 1. So there are exactly seven lines.

Incidences. Each of the seven labels appears in exactly three of the seven displayed triples, so every point lies on exactly 3 lines. The total is consistent: counting incident pairs (point, line through it) by lines gives 7⋅3=21, and counting them by points gives 7⋅3=21 as well.

The two theorems. There are (72)=21 pairs of points, and each of the 7 lines contains (32)=3 pairs, for 21 pairs in total; since no pair can be covered twice without two lines sharing two points — which Proposition 22.6.8 forbids — each pair is covered exactly once. Dually there are (72)=21 pairs of lines, and each of the 7 points lies on 3 lines and so accounts for (32)=3 of those pairs, again 21 in total; no pair of lines is accounted for twice, since two points on both lines would again contradict Proposition 22.6.8. So every pair of lines meets in exactly one point, as Corollary 22.6.7 says.

Diagram. Labels: 4 = [1:0:0], 5 = [1:0:1], 6 = [1:1:0], 1 = [0:0:1], 2 = [0:1:0], 3 = [0:1:1], 7 = [1:1:1], the Fano plane nP^2(nF_2): 7 points, 7 lines\\ (three sides, three medians, one circle), 3 points on each line

In the picture the “midpoint” of two marked points really is their sum: 4+5=[0:0:1]=1, and likewise all round. The circle is the line x0=0, which under Theorem 22.6.2 is the line at infinity, so the picture also shows P2(F2) as the four affine points 4,5,6,7 of F22 together with the three directions 1,2,3.

Warning. A drawing of a finite projective plane is a mnemonic, not a picture. The seven points of the Fano plane are not points of the Euclidean plane, and the “circle” is a line, not a curve. The only content of the drawing is the incidence data: which triples of the seven labels form a line. Any picture with the same seven triples is the same object, and no metric statement about the drawing means anything.

22.6.6. Exercises

A. Check your understanding

Exercise (A1)
  • (a) State Definition 22.6.1, and say why 0 is removed before taking the quotient.
  • (b) What is dim⁡P(V) when dim⁡V=5? What is the dimension of a hyperplane of that projective space, and of what subspace of V is it the image?
  • (c) Decide whether [2:4:6]=[1:2:3] in P2(Q), and whether [0:1]=[0:2] in P1(F3). Justify your answers.
  • (d) True or false: the condition x1+x2=1 defines a subset of P2(R). Justify your answer.
  • (e) How many points does P3(F5) have?

Solution.

  • (a) P(V)=(V∖{0})/∼ with x∼y when y=λx for some nonzero λ, and dim⁡P(V)=dim⁡V−1. The vector 0 is removed because its class is {0} alone, so it would contribute one point whose span span(0)={0} is the zero subspace and not a line, and Proposition 22.6.1 would fail.

  • (b) dim⁡P(V)=4. A hyperplane has dimension 3 and is P(U) for a subspace U of V with dim⁡U=4.

  • (c) Yes: (2,4,6)=2(1,2,3) and 2≠0 in Q. Yes again: (0,2)=2(0,1) and 2≠0 in F3.

  • (d) False. The expression is not homogeneous: (1,1,0) satisfies it but (2,2,0), which represents the same point, does not. Only the vanishing of a homogeneous expression is a condition on points.

  • (e) (54−1)/(5−1)=624/4=156, by Proposition 22.6.9.

B. Practice

Exercise (B1: Meeting at infinity)

In P2(R), complete each pair of affine lines and find their intersection point, saying in each case whether it lies in the chart U0 or at infinity.

  • (a) y2=2y1+1 and y2=2y1−3.
  • (b) y2=2y1+1 and y1+y2=4.
  • (c) y1=5 and y1=−2.

Solution.

  • (a) Writing them as 2y1−y2=−1 and 2y1−y2=3, Proposition 22.6.3 gives L¯1:2x1−x2+x0=0 and L¯2:2x1−x2−3x0=0. Subtracting, 4x0=0, so x0=0 and x2=2x1: the point [0:1:2], at infinity. This agrees with part (c) of that proposition, since (a1,a2)=(2,−1) gives [0:1:2].

  • (b) Here L¯1:2x1−x2+x0=0 and L¯2:x1+x2−4x0=0. Adding, 3x1−3x0=0, so x1=x0; then x2=4x0−x1=3x0. Taking x0=1 gives [1:1:3], which lies in U0 and corresponds to the affine point (1,3). Check: 3=2⋅1+1 and 1+3=4.

  • (c) L¯1:x1−5x0=0 and L¯2:x1+2x0=0. Subtracting, 7x0=0, so x0=0 and then x1=0, forcing x2≠0: the point [0:0:1], at infinity, the vertical direction.

Exercise (B2: Joins and meets)

In P4(F), let S be a plane and T a plane.

  • (a) What are the possible values of dim⁡(S∩T)? Justify each.
  • (b) Show that two planes in P4(F) always meet.
  • (c) Give an example in P5(F) of two planes that do not meet.

Solution. Throughout, S=P(U) and T=P(W) with dim⁡U=dim⁡W=3 inside a space of dimension 5 (for P4).

  • (a) By Theorem 22.6.6, dim⁡(S∩T)=4−dim⁡(S∨T). Now S∨T contains S, so dim⁡(S∨T)≥2, and it is contained in P4, so dim⁡(S∨T)≤4. Hence dim⁡(S∩T)∈{0,1,2}, and all three occur: 2 when S=T; 1 when U∩W has dimension 2, for instance U=span(e1,e2,e3), W=span(e1,e2,e4); and 0 for U=span(e1,e2,e3), W=span(e3,e4,e5).

  • (b) The computation in (a) shows dim⁡(S∩T)≥4−4=0>−1, so S∩T≠∅.

  • (c) In P5(F)=P(F6) take U=span(e1,e2,e3) and W=span(e4,e5,e6). Then U∩W={0}, so S∩T=P({0})=∅, and indeed Theorem 22.6.6 gives dim⁡(S∨T)+(−1)=2+2, that is dim⁡(S∨T)=5, the whole space.

Exercise (B3: A projective plane over three elements)

Let F=F3.

  • (a) How many points does P2(F3) have, and how many lines?
  • (b) How many points lie on each line, and how many lines pass through each point?
  • (c) List the four points of the line x0=0.

Solution.

  • (a) By Proposition 22.6.9, |P2(F3)|=1+3+9=13. A line is P(U) with dim⁡U=2, equivalently the kernel of a nonzero functional on F33, and two nonzero functionals have the same kernel exactly when they are proportional (Corollary 5.6.6 applied to the 1×3 matrices, or directly: a kernel of dimension 2 determines the functional up to scale). So the lines correspond to the points of P((F33)∗), of which there are again 13.

  • (b) Each line has (32−1)/(3−1)=4 points. For the lines through a fixed point [x]: they are the P(U) with span(x)⊆U and dim⁡U=2, and every such U is span(x,y) for one of the 33−3=24 vectors y∉span(x), while two choices y,y′ give the same U exactly when y′∈U∖span(x), a set of 32−3=6 vectors. So each point lies on 24/6=4 lines. (Consistently, the incident pairs number 13⋅4=52 counted by lines and 13⋅4=52 counted by points.)

  • (c) The points with x0=0 are [0:x1:x2] with (x1,x2)≠(0,0), that is the points of P1(F3): [0:1:0], [0:1:1], [0:1:2] and [0:0:1]. Four points, as (b) requires.

C. Going deeper

Exercise (C1: Other charts)

Work in Pn(F) and fix j∈{0,1,…,n}. Let Uj={[x]:xj≠0}.

  • (a) Prove that Uj is well defined and in bijection with Fn.
  • (b) Prove that U0∪U1∪⋯∪Un=Pn(F).
  • (c) For n=1 and F=R, describe the point of U1 that is missing from U0, and the point of U0 missing from U1. Conclude that the “point at infinity” is not a property of a point, but of a chart.

Solution.

  • (a) Both parts repeat Theorem 22.6.2 with the index 0 replaced by j. Scaling multiplies xj by a nonzero scalar, so the condition xj≠0 is independent of the representative. The bijection is (a1,…,an)↦[a1:⋯:aj:1:aj+1:⋯:an], with the 1 in position j; it is injective because comparing the j-th entries of two proportional representatives forces the scalar to be 1, and surjective because [x]=[xj−1x] when xj≠0.

  • (b) A point is [x] with x≠0, so some coordinate xj is nonzero, and then [x]∈Uj.

  • (c) P1(R)={[1:a]:a∈R}∪{[0:1]}. The chart U0 omits exactly [0:1], and the chart U1={[b:1]:b∈R}∪{[1:0]} omits exactly [1:0]. Both omitted points are perfectly ordinary points of P1(R); each is at infinity for one chart and in the affine part of the other. So “at infinity” describes a relation between a point and a chosen chart, not the point itself.

Exercise (C2: Counting subspaces)

Let F be a finite field with q elements.

  • (a) Prove that the number of lines in P2(F) equals the number of points, namely q2+q+1. Hint: a line is the kernel of a nonzero functional.
  • (b) Deduce that every point of P2(F) lies on exactly q+1 lines.
  • (c) How many points does a hyperplane of Pn(F) have, and how many points of Pn(F) lie outside it?

Solution.

  • (a) A line of P2(F) is P(U) with dim⁡U=2, and by Lemma 5.6.1 such a U is the kernel of a nonzero functional φ on F3, since dim⁡U0=3−2=1 (Theorem 5.2.2) and U is the common kernel of its annihilator. Two nonzero functionals have the same kernel exactly when they are proportional: if kerφ=kerψ=U, then φ and ψ both lie in the 1-dimensional space U0, so one is a scalar multiple of the other, and the scalar is nonzero. So lines correspond to points of P((F3)∗), and (F3)∗ has dimension 3 (Corollary 5.1.4); by Proposition 22.6.9 there are q2+q+1 of them.

  • (b) Count incident pairs (point, line through it) in two ways. Each line has q+1 points by Proposition 22.6.9, so the count is (q2+q+1)(q+1). By symmetry among the q2+q+1 points — or simply dividing — each point lies on (q2+q+1)(q+1)/(q2+q+1)=q+1 lines, provided every point lies on the same number. That last point needs an argument. The lines through a fixed [x] are the P(U) with span(x)⊆U and dim⁡U=2, and every such U is span(x,y) for some y∉span(x), of which there are q3−q. Two choices y,y′ give the same U exactly when y′∈U∖span(x), a set of q2−q vectors. So the number of such U is (q3−q)/(q2−q)=q+1, independently of [x].

  • (c) A hyperplane is P(U) with dim⁡U=n, so it has (qn−1)/(q−1)=1+q+⋯+qn−1 points. Subtracting from 1+q+⋯+qn leaves qn points outside, in agreement with Theorem 22.6.2, whose chart U0 is exactly the complement of a hyperplane and is in bijection with Fn.

Exercise (C3: Where the affine formula goes wrong)

Let A and B be flats of A3(F).

  • (a) Give two lines in A3(F) that do not meet and are not parallel, and compute dim⁡(A∨B) from Theorem 22.2.4.
  • (b) Complete both lines to projective lines in P3(F) by the recipe of Theorem 22.6.2, that is by adding the points with x0=0 to the projective subspace each spans, and verify Eq. 22.6.1 for the completed pair.
  • (c) Explain in one sentence why the projective formula could not have an exceptional case, given Proposition 22.6.5.

Solution.

  • (a) Take A={(t,0,0):t∈F} and B={(0,s,1):s∈F}. A common point would need third coordinate 0 and 1, so A∩B=∅. Their direction spaces are span(e1) and span(e2), which are different, so they are not parallel and A→∩B→={0}. The second case of Theorem 22.2.4 (c) gives dim⁡(A∨B)=1+1−0+1=3, the whole of A3(F).

  • (b) Under ι of Theorem 22.6.2, A becomes {[1:t:0:0]}, whose points together with [0:1:0:0] form P(U) with U=span((1,0,0,0),(0,1,0,0)); and B becomes {[1:0:s:1]}, giving P(W) with W=span((1,0,0,1),(0,0,1,0)). Now U∩W={0}: a vector of U has third and fourth entries 0, while a vector a(1,0,0,1)+b(0,0,1,0) of W has third entry b and fourth entry a, so both a and b vanish. Hence S∩T=∅ of dimension −1, and U+W has dimension 2+2−0=4, so dim⁡(S∨T)=3. Then 3+(−1)=1+1, as Eq. 22.6.1 requires. The two projective lines still do not meet, which is correct: Corollary 22.6.7 is about a projective plane, and these lines do not lie in one.

  • (c) Because by Proposition 22.6.5 both the meet and the join of projective subspaces are again projective subspaces, coming from U∩W and U+W, and the vector-space formula Theorem 1.7.3 holds for those with no hypothesis whatever, the empty intersection being simply the case U∩W={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.