22.2  Flats, Independence and Coordinates

An affine space has no origin, so it has no subspaces in the sense of Chapter 1: a subspace must contain 0, and there is no 0. What it has instead are its flats — the lines, planes and hyperplanes that sit inside it. This section defines them, settles when two of them meet and how big the smallest flat containing both is, puts coordinates on an affine space using n+1 points rather than n vectors, and shows that in An(F) the flats are exactly the solution sets of linear systems. The join formula has two cases, and the second one is where affine geometry parts company with linear algebra.

Throughout, A is an affine space over a field F with direction space V (Definition 22.1.1), and from the dimension formula onward dim⁡A=dim⁡V=n is finite, except where a statement says otherwise.

22.2.1. Flats

A subset of A deserves to be called flat when it is an affine space in its own right, using the same difference map. By Definition 22.1.2 there is only one thing to require.

A flat is a non-empty set of points closed under taking affine combinations.

Definition 22.2.1 (Flat)

A subset A⊆A is a flat, or an affine subspace of A, if it is non-empty and contains every affine combination of its own points: whenever k≥1, P1,…,Pk∈A and t1,…,tk∈F satisfy t1+⋯+tk=1, the point ∑i=1ktiPi lies in A.

The requirement that A be non-empty is a convention, and it is the useful one: a flat is going to have a direction space and a dimension, and the empty set has neither. Intersections of flats may of course be empty, and we will say so each time.

Proposition 22.2.1 (Flats Are the Cosets)

Let A⊆A be non-empty. Then A is a flat if and only if there are P∈A and a subspace U of V with A=P+U:={P+u:u∈U}. In that case:

  • (a) U={XY→:X,Y∈A} is determined by A alone; it is written A→ and called the direction space of A.
  • (b) A=Q+A→ for every Q∈A, and A, with the difference map of A restricted to it, is an affine space with direction space A→.

The dimension of A is dim⁡A:=dim⁡A→. A flat of dimension 0 is a single point, one of dimension 1 is a line, one of dimension 2 is a plane, and, when dim⁡A=n is finite, one of dimension n−1 is a hyperplane of A.

Idea. One direction is a computation with origin P. For the other, fix P∈A and let U be the set of displacements from P to points of A; the three subspace axioms come from three affine combinations, with weight lists (1), (λ,1−λ) and (1,1,−1).

Proof. (⇐) Let A=P+U with U a subspace, and let P+u1,…,P+uk∈A with ∑iti=1. Computing the affine combination with origin P (Definition 22.1.2), ∑iti(P+ui)=P+∑itiui∈P+U, since U is closed under linear combinations. And A∋P is non-empty.

(⇒) Let A be a flat, fix P∈A and put U={PX→:X∈A}. Then 0=PP→∈U. If u=PX→∈U and λ∈F, the point λX+(1−λ)P lies in A and equals P+λu when computed with origin P, so λu∈U. If also w=PY→∈U, the point X+Y−P lies in A (weights 1+1−1=1) and equals P+(u+w), so u+w∈U. By Theorem 1.2.1, U is a subspace, and A=P+U by construction.

  • (a) Let X,Y∈A. Then XY→=XP→+PY→∈U by Chasles, since U is closed under negation and addition; so {XY→:X,Y∈A}⊆U. Conversely each u∈U is PX→ for some X∈A, and P∈A. Hence the two sets are equal, and the right-hand side mentions only A.

  • (b) Let Q∈A. For X∈A we have QX→∈A→ by (a), so A⊆Q+A→; and for u∈A→, writing u=XY→ with X,Y∈A, the point Q+u is the affine combination Q+Y−X of points of A, hence lies in A. So A=Q+A→. Finally the restricted difference map takes values in A→ by (a), Chasles is inherited, and for fixed P∈A the map X↦PX→ is a bijection A→A→, being the restriction of the bijection of (AS2) to A=P+A→. So (AS1) and (AS2) hold and A is an affine space with direction space A→.

Over R, with A=V, a flat is exactly Chapter 18’s affine subspace of V (Definition 18.1.5 (b)), and the two dimensions agree: Chapter 18 also reads the subspace off the coset as the set of differences. Chapter 5’s affine hyperplane p+H (the paragraph before Proposition 5.6.4) is the case dim⁡A=n−1 in An(F). A one-point set {P}=P+{0} is a flat, and A=P+V is a flat: the two degenerate cases.

A non-example, by minimal change. A line is a flat; the union of two lines is not. Let X={(x,y)∈A2:xy=0}, the union of the two coordinate axes. It is non-empty, and it contains every affine combination of points taken from one axis, each axis being a flat. But Definition 22.2.1 asks for all of them: the points P=(1,0) and Q=(0,1) lie in X, the weights of 12P+12Q add up to 1, and 12P+12Q=(12,12) has xy=14≠0. So the closure clause fails for one pair of points, and X is not a coset of a subspace, although it is a union of two of them.

Proposition 22.2.2 (Intersections of Flats)

Let (Ai)i∈I be a non-empty family of flats of A and put A=⋂i∈IAi. If A≠∅, then A is a flat and A→=⋂i∈IAi→.

Proof. Suppose A≠∅ and fix P∈A. If P1,…,Pk∈A and ∑jtj=1, then the point ∑jtjPj lies in each Ai, because each Ai is a flat containing all the Pj; so it lies in A. Hence A is a flat. By Proposition 22.2.1 (b), Ai=P+Ai→ for each i and A=P+A→, so A→={PX→:X∈A}=⋂i∈I{PX→:X∈Ai}=⋂i∈IAi→, where the middle equality holds because X↦PX→ is injective (AS2).

Since A itself is a flat containing every subset, the following is well defined.

Definition 22.2.2 (Join of Flats)

Let A,B be flats of A. Their join A∨B is the intersection of all flats of A containing A∪B.

The intersection contains A, so it is non-empty, and it is a flat by Proposition 22.2.2: A∨B is the smallest flat containing both. A single point P is a flat, and we write P∨Q, A∨P for joins in which a one-point flat {P} appears. This is the affine analogue of U+W, and Chapter 18’s affine hull is the same construction over R (Proposition 18.1.4).

Parallelism is what an affine space has and a vector space does not notice.

Definition 22.2.3 (Parallel Flats)

Two flats A,B of A are parallel, written A∥B, if A→=B→.

Proposition 22.2.3 (Parallelism)

Parallelism is an equivalence relation on the set of flats of A. Two parallel flats are either equal or disjoint, and each equivalence class consists of the flats P+U, P∈A, for one fixed subspace U.

Proof. Equality of direction spaces is an equivalence relation, so ∥ is one. Let A∥B with common direction U, and suppose X∈A∩B. Then A=X+U=B by Proposition 22.2.1 (b). So A and B are equal or disjoint. Finally, the flats with direction space U are exactly the sets P+U with P∈A, again by Proposition 22.2.1.

Parallel flats have the same dimension. Some authors also call a line parallel to a plane containing its direction; we do not, and we say “A→⊆B→” when we mean that.

22.2.2. When two flats meet, and how big their join is

Here is the central computation of the section. Two subspaces of a vector space always meet, in 0 at least. Two flats need not, and the dimension formula splits accordingly.

Theorem 22.2.4 (Intersection and Join of Two Flats)

Let A,B be flats of A, and choose P∈A and Q∈B. Parts (a) and (b) need no hypothesis on dim⁡A.

  • (a) A∨B=P+(A→+B→+span(PQ→)).
  • (b) A∩B≠∅ if and only if PQ→∈A→+B→; and then A∩B is a flat whose direction space is A→∩B→.
  • (c) Let dim⁡A=n be finite. If A∩B≠∅, then dim⁡(A∨B)=dim⁡A+dim⁡B−dim⁡(A∩B). If A∩B=∅, then dim⁡(A∨B)=dim⁡A+dim⁡B−dim⁡(A→∩B→)+1.
  • (d) Let dim⁡A=n be finite. If A∩B=∅, there is a hyperplane H of V with A⊆P+H and B⊆Q+H, and the two flats P+H, Q+H are parallel, distinct and disjoint.

Idea. Everything is read off from one subspace, W=A→+B→+span(PQ→). The three summands are forced: the join must contain the directions of A and of B, and it must contain a way of getting from A to B. Whether the third summand is already inside the first two is exactly whether A and B meet — and that one extra dimension, present precisely when they miss each other, is the whole difference between (c)’s two cases.

Proof. Put W=A→+B→+span(PQ→), a subspace of V, and C=P+W, a flat by Proposition 22.2.1.

  • (a) First, A∪B⊆C. Indeed A=P+A→⊆P+W. And each point of B is Q+b with b∈B→, which equals P+(PQ→+b) by Lemma 22.1.1 (b), and PQ→+b∈W. So C is one of the flats being intersected in Definition 22.2.2, whence A∨B⊆C.

    Conversely, A∨B is a flat containing P, so A∨B=P+U by Proposition 22.2.1 (b), where U is the direction space of A∨B. Since A⊆A∨B and P∈A, part (a) of that proposition gives A→⊆U. Since Q∈A∨B, also PQ→∈U. And for b∈B→ the point Q+b lies in B⊆A∨B, so PQ→+b=P(Q+b)→∈U, and therefore b∈U. Hence W⊆U, that is, C⊆A∨B. The two inclusions give (a).

  • (b) (⇐) Suppose PQ→=a+b with a∈A→, b∈B→. Put X=P+a, a point of A. Then QX→=QP→+PX→=−(a+b)+a=−b∈B→, so X∈Q+B→=B. Hence X∈A∩B.

    (⇒) If X∈A∩B, then PX→∈A→ and XQ→∈B→ by Proposition 22.2.1 (a), so PQ→=PX→+XQ→∈A→+B→. The last clause is Proposition 22.2.2 applied to the two flats A and B.

  • (c) Case 1: A∩B≠∅. By (b), PQ→∈A→+B→, so W=A→+B→. By (a) and Theorem 1.7.3, dim⁡(A∨B)=dim⁡(A→+B→)=dim⁡A→+dim⁡B→−dim⁡(A→∩B→), and dim⁡(A→∩B→)=dim⁡(A∩B) by (b), which is the first formula.

    Case 2: A∩B=∅. By (b), PQ→∉A→+B→; in particular PQ→≠0. Then span(PQ→)∩(A→+B→)={0}, since a non-zero λPQ→ lying in A→+B→ would give PQ→=λ−1(λPQ→)∈A→+B→, λ being non-zero and hence invertible. So Theorem 1.7.3 applied to the two subspaces A→+B→ and span(PQ→) gives dim⁡W=dim⁡(A→+B→)+1, and one more application, as in Case 1, gives the second formula.

  • (d) Put U=A→+B→ and r=dim⁡U. By (b), PQ→∉U, so appending PQ→ to a basis (u1,…,ur) of U leaves an independent list (Lemma 1.5.3). Extend it to a basis (u1,…,ur, PQ→, w1,…,wn−r−1) of V by Theorem 1.6.5, and let H=span(u1,…,ur,w1,…,wn−r−1). Then dim⁡H=n−1, so dim⁡(V/H)=1 by Theorem 4.4.5 and H is a hyperplane (Definition 5.5.2). Now A→⊆U⊆H gives A=P+A→⊆P+H, and likewise B⊆Q+H. The flats P+H and Q+H are parallel by Definition 22.2.3. They are distinct: if they were equal, then Q∈P+H would give PQ→∈H, contradicting the independence of the displayed basis. Being parallel and distinct, they are disjoint by Proposition 22.2.3. This proves the theorem.

The two formulas in (c) are best read side by side. When the flats meet, the count is the subspace count of Theorem 1.7.3, with A∩B in the role of A→∩B→. When they miss, the correction term is taken among the directions, where the flats always do meet, and a +1 is paid for the displacement that carries one flat to the other.

Part (b) is what the two pictures below show. On the left the displacement PQ→ splits as a step inside A→ followed by a step inside B→, and the flats meet; on the right it does not split, so it contributes a direction of its own to the join.

Diagram. Labels: A, B, in vec A, in vec B, overrightarrow PQ, P, Q, X, A cap B ne emptyset, A cap B = emptyset
Example (Two lines in space, twice)

In A3 let A=(1,0,0)+span((1,1,0)),B=(0,0,1)+span((1,−1,0)),B′=(0,0,1)+span((1,1,0)). Decide in each case whether the lines meet, and compute dim⁡(A∨B) and dim⁡(A∨B′).

Solution. Here P=(1,0,0), Q=(0,0,1) and PQ→=(−1,0,1).

A and B. The directions (1,1,0) and (1,−1,0) are independent, and A→+B→ is the plane of vectors with third coordinate 0. Since PQ→=(−1,0,1) has third coordinate 1, it is not in A→+B→, so A∩B=∅ by Theorem 22.2.4 (b): the lines are skew, that is, disjoint and not parallel. (Directly: (1+s,s,0)=(t,−t,1) forces 0=1.) Also A→∩B→={0}, the two directions being independent. The second formula of (c) gives dim⁡(A∨B)=1+1−0+1=3, so A∨B=A3: two skew lines span the whole space.

A and B′. Now A→=B′→, so the lines are parallel, and they are distinct because PQ→=(−1,0,1)∉A→; hence they are disjoint (Proposition 22.2.3). Here A→∩B′→=A→ has dimension 1, so dim⁡(A∨B′)=1+1−1+1=2, and A∨B′ is the plane (1,0,0)+span((1,1,0),(−1,0,1)), by part (a).

Warning. There is no convention for dim⁡∅ that makes one formula do both cases. It is tempting to set dim⁡∅=−1 and keep writing dim⁡(A∨B)=dim⁡A+dim⁡B−dim⁡(A∩B). For the skew lines of Example (Two lines in space, twice) that gives 1+1−(−1)=3, which is right; for the parallel lines A and B′ it gives 3 as well, and the correct answer is 2. The two disjoint cases differ in dim⁡(A→∩B→), which the empty intersection cannot record. Use the second formula of Theorem 22.2.4 (c), and always check first whether the flats meet.

Quick check. In A4, let A and B be planes (flats of dimension 2) with A→∩B→={0}. Must they meet?

Solution. Yes. By Theorem 1.7.3, dim⁡(A→+B→)=2+2−0=4=dim⁡V, so A→+B→=V by Theorem 1.6.8. Hence PQ→∈A→+B→ for any P∈A, Q∈B, and Theorem 22.2.4 (b) gives A∩B≠∅. (The dimension formula agrees: the disjoint case would predict 2+2−0+1=5>4, which is impossible.) Their intersection is then a single point, since its direction space is A→∩B→={0}.

22.2.3. Affine frames and barycentric coordinates

To put coordinates on an n-dimensional vector space we choose n vectors. To put coordinates on an n-dimensional affine space we must also say where the origin is, so we choose n+1 points — and if we refuse to single out one of them, the coordinates come out symmetric in all n+1. That symmetry is what makes the centroid computation below one line.

Chapter 18 §02 defined a list (x0,…,xm) in a real vector space to be affinely independent when the only scalars with ∑iλi=0 and ∑iλixi=0 are all zero (Definition 18.2.1). By Definition 22.1.2 (b) the expression ∑iλiPi is a well-defined vector for points of an affine space whenever ∑iλi=0, so the same words apply here verbatim. The next lemma is Lemma 18.2.1 (a) in that setting; its proof uses nothing about R, so we give it again over an arbitrary field.

Lemma 22.2.5 (Affine Independence by Differences)

Let P0,P1,…,Pm∈A. The following are equivalent.

  • (a) The only λ0,…,λm∈F with ∑i=0mλi=0 and ∑i=0mλiPi=0 are λ0=⋯=λm=0.
  • (b) The list (P0P1→,…,P0Pm→) is linearly independent in V.

A list satisfying these is called affinely independent. Condition (a) does not mention P0 specially, so (b) holds with any Pj in place of P0 as soon as it holds for one.

Proof. By Definition 22.1.2 (b) computed with origin P0, and since P0P0→=0, ∑i=0mλiPi=∑i=0mλiP0Pi→=∑i=1mλiP0Pi→. Given λ1,…,λm, the condition ∑i=0mλi=0 holds for exactly one λ0, namely λ0=−∑i≥1λi; and (λ0,…,λm) is the zero list exactly when (λ1,…,λm) is. So the relations forbidden by (a) correspond, one for one, to the non-trivial linear relations among P0P1→,…,P0Pm→, and (a) holds if and only if there are none, which is (b).

Over R with A=V this is Lemma 18.2.1 (a), and Chapter 18’s warning applies unchanged: affine independence is not linear independence. The list (0,e1,e2) in R2 is linearly dependent and affinely independent, which is why the count below is n+1 and not n.

Definition 22.2.4 (Affine Frame)

Let dim⁡A=n. An affine frame of A is a list (P0,P1,…,Pn) of n+1 affinely independent points of A.

By Lemma 22.2.5 the list (P0P1→,…,P0Pn→) is then independent with n=dim⁡V entries, hence a basis of V (Theorem 1.6.4); conversely, if it is a basis, the frame condition holds. So an affine frame is “a point together with a basis”, written symmetrically. In An(F) the standard frame is (0,e1,…,en).

Theorem 22.2.6 (Barycentric Coordinates)

Let dim⁡A=n and let (P0,…,Pn) be an affine frame of A. For every X∈A there are unique scalars t0,…,tn∈F with t0+t1+⋯+tn=1andX=∑i=0ntiPi. They are called the barycentric coordinates of X with respect to the frame.

Idea. Existence is the basis expansion of P0X→, with t0 invented to make the weights add up to 1. Uniqueness is affine independence: the difference of two weight lists is an affine dependence.

Proof. Existence. The list (P0P1→,…,P0Pn→) is a basis of V, so there are unique t1,…,tn∈F with P0X→=∑i=1ntiP0Pi→ (Theorem 1.5.1). Put t0=1−(t1+⋯+tn), so that ∑i=0nti=1. Computing the affine combination with origin P0, ∑i=0ntiPi=P0+∑i=0ntiP0Pi→=P0+P0X→=X.

Uniqueness. Suppose ∑itiPi=X=∑iti′Pi with both weight lists summing to 1, and put λi=ti−ti′. Then ∑iλi=0, so ∑iλiPi is the vector ∑iλiP0Pi→ of Definition 22.1.2 (b), and computing both combinations with origin P0 gives ∑iλiP0Pi→=P0X→−P0X→=0. By Lemma 22.2.5 (a), every λi=0. This proves the theorem.

Barycentric coordinates come as a list, not as separate numbers: they are pinned down only by the requirement that they add up to 1, so no one of them means anything on its own. Their virtue is that the frame’s points are treated alike: Pj has coordinates (0,…,1,…,0) with the 1 in slot j, for every j.

Example (Reading a triangle)

In A2 take the frame P0=(0,0), P1=(4,0), P2=(0,3).

  • (a) Check that it is a frame, and find the barycentric coordinates (Theorem 22.2.6) of X=(1,1).
  • (b) Find the point with barycentric coordinates (12,14,14).
  • (c) Describe the line P1∨P2 in barycentric coordinates.

Solution.

  • (a) P0P1→=(4,0) and P0P2→=(0,3) are independent, so by Lemma 22.2.5 the list is affinely independent, and three points in a plane make a frame. For X=(1,1): from (1,1)=t1(4,0)+t2(0,3) we get t1=14 and t2=13, so t0=1−14−13=512. The coordinates are (512,14,13). Check: 512(0,0)+14(4,0)+13(0,3)=(1,1), and 512+312+412=1.

  • (b) 12(0,0)+14(4,0)+14(0,3)=(1,34).

  • (c) The join of the two distinct points P1,P2 is P1+span(P1P2→) by Theorem 22.2.4 (a), a line. Its points are the affine combinations (1−t)P1+tP2, whose barycentric coordinates are (0,1−t,t); conversely a point with t0=0 is such a combination. So P1∨P2={t0=0}. The point X of (a) has t0=512≠0 and so is not on it.

The next result is the advertisement for the whole apparatus: a classical theorem of plane geometry, proved in one line of arithmetic with weights.

Proposition 22.2.7 (The Medians Meet at the Centroid)

Let F be a field in which 2≠0 and 3≠0, let A be an affine space over F, and let (P1,P2,P3) be an affinely independent list in A. Put M1=12P2+12P3,M2=12P1+12P3,M3=12P1+12P2, the midpoints of the sides, and let mi=Pi∨Mi be the medians. Then m1,m2,m3 are lines meeting in exactly one point, the centroid G=13P1+13P2+13P3, and PiG→=2GMi→ for each i.

Diagram. Labels: P_1, P_2, P_3, M_1, M_2, M_3, G

Idea. Work in the plane π=(P1∨P2)∨P3, where (P1,P2,P3) is an affine frame, and give every point its barycentric coordinates. A median is then the set of coordinate triples of one shape, and the three shapes have exactly one triple in common.

Proof. The three points are affinely independent, so (P1P2→,P1P3→) is independent by Lemma 22.2.5 and, by Theorem 22.2.4 (a) applied twice, π:=(P1∨P2)∨P3=P1+span(P1P2→,P1P3→) is a plane in which (P1,P2,P3) is an affine frame. All the points named lie in π, being affine combinations of P1,P2,P3, so we may use the barycentric coordinates of Theorem 22.2.6 throughout; the weights 12 and 13 exist because 2 and 3 are non-zero, hence invertible, in F.

Each mi is a line, and G lies on it. Take i=1. In coordinates P1=(1,0,0) and M1=(0,12,12), so P1≠M1 by the uniqueness in Theorem 22.2.6, and m1=P1∨M1=P1+span(P1M1→) by Theorem 22.2.4 (a), a flat of dimension 1 because P1M1→≠0. Its points are the affine combinations (1−s)P1+sM1, s∈F, with coordinates (1−s, s2, s2). At s=23 this is (13,13,13), the coordinate triple of G. So G∈m1, and by the same computation with the indices permuted, G∈m2 and G∈m3.

No other common point. A point of m1∩m2 has coordinates (1−s,s2,s2) and (s′2,1−s′,s′2) for some s,s′∈F. Uniqueness in Theorem 22.2.6 makes the two triples equal entry by entry. The third entries give s=s′, and then the first two give 1−s=s2, that is, 32s=1 and s=23. So m1∩m2={G}, and a fortiori m1∩m2∩m3={G}.

The ratio. With origin P1 we have P1M1→=12P1P2→+12P1P3→ and P1G→=13P1P2→+13P1P3→, so P1G→=23P1M1→ and GM1→=P1M1→−P1G→=13P1M1→. Hence P1G→=2GM1→, and likewise for i=2,3. This proves the proposition.

Remark. The hypotheses on the field are not decoration. Over F2 there are no midpoints, because 12 does not exist; over F3 there are midpoints but no centroid, because 13 does not exist — and indeed in A2(F3) the three medians of an affinely independent triple are parallel and pairwise disjoint, as Exercise C3 below computes.

22.2.4. An affine map is fixed by a frame

Barycentric coordinates make the next theorem immediate, and it is the affine counterpart of “a linear map is determined by its values on a basis”.

Theorem 22.2.8 (An Affine Map Is Determined by a Frame)

Let A have dimension n with affine frame (P0,…,Pn), let B be an affine space over the same field with direction space W, and let Q0,…,Qn∈B be any points. Then there is exactly one affine map f:A→B with f(Pi)=Qi for i=0,…,n. Moreover f carries the barycentric coordinates of Theorem 22.2.6 across: f(∑i=0ntiPi)=∑i=0ntiQi(∑iti=1).

Proof. Existence. The list (P0P1→,…,P0Pn→) is a basis of V, so by Theorem 2.1.6 there is a linear T:V→W with T(P0Pi→)=Q0Qi→ for i=1,…,n. Define f(X)=Q0+T(P0X→); it is affine with f→=T by Theorem 22.1.5 (c). Then f(P0)=Q0+T(0)=Q0, and f(Pi)=Q0+Q0Qi→=Qi.

Uniqueness. Let g be affine with g(Pi)=Qi for all i. By Theorem 22.1.5 (b), g→(P0Pi→)=g(P0)g(Pi)→=Q0Qi→=T(P0Pi→)(i=1,…,n), so g→ and T agree on a basis and are equal (Theorem 2.1.5). Hence g(X)=g(P0)+g→(P0X→)=Q0+T(P0X→)=f(X) for every X.

The displayed identity is Definition 22.1.3 applied to ∑itiPi, using f(Pi)=Qi.

So n+1 points in the right position determine an affine map of an n-dimensional space, and prescribe it freely. Fewer points never do, and not because our proof is weak.

Proposition 22.2.9 (Points inside a proper flat do not determine an affine map)

Let dim⁡A=n≥1 and let S⊆A be contained in a flat A with dim⁡A<n — for instance, any set of at most n points. Then there are two distinct affine maps A→A that agree at every point of S.

Proof. Let P∈A and let (u1,…,ud) be a basis of A→, where d=dim⁡A<n. Extend it to a basis (u1,…,ud,w1,…,wn−d) of V (Theorem 1.6.5); since d<n, the vector w1 exists. Let T:V→V be the linear map fixing each uj and each wk with k≥2, and sending w1 to 0 (Theorem 2.1.6), and put g(X)=P+T(PX→), an affine map by Theorem 22.1.5 (c).

For X∈A we have PX→∈A→=span(u1,…,ud), on which T is the identity, so g(X)=P+PX→=X. Hence g agrees with idA on A, and so on S. But g≠idA, since g(P+w1)=P+T(w1)=P≠P+w1 by Lemma 22.1.1 (c).

Finally, a non-empty set of at most n points does lie in such a flat. Put D=P0+span(P0P1→,…,P0Pm→). This is the smallest flat containing P0,…,Pm: it is a flat by Proposition 22.2.1 and contains every Pi; and any flat containing all the Pi contains P0, hence equals P0+U with each P0Pi→∈U, so it contains D by Theorem 1.3.1. Thus dim⁡D≤m, and m+1≤n gives dim⁡D≤n−1<n. (An empty S lies in the flat {P} for any P.)

Example (Two points are not enough in the plane) is an instance of this proposition, with n=2 and S={(0,0),(1,0)}; it exhibits its own pair of maps rather than the pair the proof constructs. The moral is the count: n+1, never n. It is the same count that will govern projective transformations later in this chapter, where the answer turns out to be n+2.

22.2.5. A flat is a solution set

Chapter 3 produced flats as solution sets; Chapter 5 proved that every subspace of Fn is a null space. Putting the two together identifies the flats of An(F) completely.

Theorem 22.2.10 (Flats Are Exactly the Solution Sets)

Let A⊆An(F) be non-empty and 0≤k≤n. The following are equivalent.

  • (a) A is a flat of dimension k.
  • (b) A={x∈Fn:Mx=c} for some M∈M(n−k)×n(F) with linearly independent rows and some c∈Fn−k.

In that case no system with fewer than n−k equations has solution set A, and for k<n the flat A is an intersection of exactly n−k affine hyperplanes.

Idea. A flat is a coset p+U by Proposition 22.2.1, Chapter 5 turns U into a null space, and Chapter 3’s “particular plus homogeneous” turns the coset into the solution set of the inhomogeneous system with the same matrix and right-hand side Mp.

Proof.

  • (a) ⇒ (b). By Proposition 22.2.1, A=p+U with U=A→ and dim⁡U=k. By Theorem 5.6.2 (a) there is M∈M(n−k)×n(F) with nul(M)=U whose rows a1⊤,…,an−k⊤ are the ones corresponding to a basis (φa1,…,φan−k) of U0 under the isomorphism a↦φa of Theorem 5.1.1; an injective linear map preserves independence (Theorem 2.2.5), so those rows are linearly independent. Put c=Mp. Then p solves Mx=c, so by Theorem 3.1.3 the solution set is p+nul(M)=p+U=A.

  • (b) ⇒ (a). The set A is non-empty, so it has an element p, and Theorem 3.1.3 gives A=p+nul(M), a coset, hence a flat by Proposition 22.2.1 with A→=nul(M). The rows of M are independent, so rankM=dim⁡row(M)=n−k by Theorem 3.5.5, and Theorem 3.5.7 gives dim⁡A=nullity(M)=n−(n−k)=k.

Minimality. Suppose B∈Mm×n(F) and d∈Fm satisfy {x:Bx=d}=A. Fix p∈A. For any x, Bx=d holds if and only if B(x−p)=0, so x∈A if and only if x−p∈nul(B); that is, A=p+nul(B). Comparing with A=p+A→ and using Proposition 22.2.1 (a), nul(B)=A→=U. By Theorem 5.6.2 (b), m≥n−k.

Hyperplanes. Let k<n and write a1⊤,…,an−k⊤ for the rows of a matrix M as in (b). Each φai vanishes on U=nul(M), hence lies in U0 (Definition 5.2.1), and the φai are independent because the rows are and a↦φa is an isomorphism (Theorem 5.1.1); as dim⁡U0=n−k by Theorem 5.2.2, they are a basis of U0 (Theorem 1.6.4). So M is a matrix as in Theorem 5.6.2 (a), and Proposition 5.6.4 applied to U and p writes A=p+U as the intersection of the n−k affine hyperplanes {x:ai⊤x=ai⊤p}.

For k=n the system is empty and A=Fn; for k=0 it has n independent equations and A is a single point. In between, the count is the familiar one: dimension counts parameters, codimension counts independent equations, and now it holds for flats as it did for subspaces.

Example (Equations for a plane in four-space)

In Example (Equations for a plane in R4) the subspace U=span((1,1,0,1),(0,1,1,1)) of R4 was found to be {x:x1−x2+x3=0, x4−x2=0}. Find equations for the flat A=p+U with p=(1,0,0,0), and give two of its points.

Solution. Take M=(1−1100−101), whose null space is U, and c=Mp=(1,0). By Theorem 22.2.10, A={x∈R4:x1−x2+x3=1,  x4−x2=0}, a flat of dimension 4−2=2. Two points: p=(1,0,0,0), with 1−0+0=1 and 0−0=0; and p+(1,1,0,1)=(2,1,0,1), with 2−1+0=1 and 1−1=0. By the minimality clause, no single equation cuts out A, since n−k=2.

That closes the affine part of the chapter’s foundations. Flats are cosets, they meet or they do not, their joins obey a two-case formula, they carry symmetric coordinates, and in An(F) they are the solution sets of linear systems. The one irritant is the second case of the join formula, and the reason two coplanar lines can fail to meet: in the affine plane, parallel lines have nowhere to intersect. The projective sections later in this chapter remove that exception by adding the missing points.

22.2.6. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define a flat and its direction space, and say why the direction space does not depend on the point used to compute it.
  • (b) State both cases of the dimension formula for dim⁡(A∨B), and say which one applies to two distinct parallel planes in A3.
  • (c) True or false, with a reason: the intersection of two flats is a flat.
  • (d) What are the barycentric coordinates of P2 with respect to the frame (P0,P1,P2,P3) of a three-dimensional affine space?

Solution.

  • (a) A flat is a non-empty subset closed under affine combinations (Definition 22.2.1); equivalently a coset P+U with U a subspace of V (Proposition 22.2.1). Its direction space is A→={XY→:X,Y∈A}, a description that mentions only A, so no choice of point enters.

  • (b) If A∩B≠∅, dim⁡(A∨B)=dim⁡A+dim⁡B−dim⁡(A∩B); if A∩B=∅, dim⁡(A∨B)=dim⁡A+dim⁡B−dim⁡(A→∩B→)+1. Two distinct parallel planes in A3 are disjoint (Proposition 22.2.3), so the second applies: 2+2−2+1=3, and their join is A3.

  • (c) False as stated, because the intersection may be empty, and the empty set is not a flat (Definition 22.2.1). It is true that a non-empty intersection of flats is a flat (Proposition 22.2.2). Two parallel lines in A2 give the counterexample.

  • (d) (0,0,1,0): the combination 0⋅P0+0⋅P1+1⋅P2+0⋅P3 has weights summing to 1 and equals P2, and the coordinates are unique by Theorem 22.2.6.

B. Practice

Exercise (B1: Two flats in four-space)

In A4 let A=(1,0,0,0)+span((1,1,0,0),(0,0,1,1)), and let B=(0,1,0,0)+span((1,0,1,0)),B′=(2,1,0,0)+span((1,0,1,0)). For each of B and B′, decide whether it meets A, and compute dim⁡(A∨⋅). Justify your answers with Theorem 22.2.4.

Solution. Write P=(1,0,0,0), A→=span((1,1,0,0),(0,0,1,1)) and B→=B′→=span((1,0,1,0)). The three spanning vectors are independent (the first two have disjoint supports, and a(1,1,0,0)+b(0,0,1,1)=(1,0,1,0) would need a=1 and a=0), so dim⁡(A→+B→)=3 and A→∩B→={0}.

B. Here Q=(0,1,0,0) and PQ→=(−1,1,0,0). If PQ→=a(1,1,0,0)+b(0,0,1,1)+c(1,0,1,0), the second coordinate gives a=1 and the first gives a+c=−1, so c=−2; the third then gives b+c=0, so b=2, and the fourth gives b=0, a contradiction. So PQ→∉A→+B→ and A∩B=∅ by part (b) of the theorem. Part (c) gives dim⁡(A∨B)=2+1−0+1=4, so A∨B=A4.

B′. Here Q′=(2,1,0,0) and PQ′→=(1,1,0,0)∈A→⊆A→+B′→, so A∩B′≠∅. Following the proof of part (b), the meeting point is P+(1,1,0,0)=(2,1,0,0)=Q′, and indeed Q′∈A∩B′. By part (b) the direction space of A∩B′ is A→∩B′→={0}, so the intersection is the single point {Q′}, of dimension 0, and dim⁡(A∨B′)=2+1−0=3.

Exercise (B2: Barycentric arithmetic)

In A2 take the frame P0=(1,1), P1=(3,1), P2=(1,4).

  • (a) Verify that it is a frame.
  • (b) Find the barycentric coordinates (Theorem 22.2.6) of X=(2,2).
  • (c) Find the centroid of (P0,P1,P2) in ordinary coordinates, and check its barycentric coordinates.

Solution.

  • (a) P0P1→=(2,0) and P0P2→=(0,3) are independent, so the list is affinely independent by Lemma 22.2.5, and it has 3=2+1 entries.

  • (b) P0X→=(1,1)=t1(2,0)+t2(0,3) gives t1=12, t2=13, so t0=1−12−13=16. The coordinates are (16,12,13). Check: 16(1,1)+12(3,1)+13(1,4)=(16+32+13, 16+12+43)=(2,2).

  • (c) G=13((1,1)+(3,1)+(1,4))=(53,2). Its barycentric coordinates are (13,13,13) by definition, and by uniqueness these are the only ones. Check against (b)’s method: P0G→=(23,1)=13(2,0)+13(0,3), so t1=t2=13 and t0=13.

Exercise (B3: From parameters to equations and back)
  • (a) Find a system of equations whose solution set is the line A=(1,2,3)+span((1,1,1)) in A3, using as few equations as possible.
  • (b) The set B={x∈R3:x1+x2+x3=6} is a flat. Find its dimension, a point of it, and its direction space.
  • (c) Decide whether A⊆B, and compute dim⁡(A∨B).

Solution.

  • (a) Here k=1 and n=3, so Theorem 22.2.10 calls for 3−1=2 equations, and no fewer will do. A functional a⊤x vanishes on span((1,1,1)) exactly when a1+a2+a3=0; two independent such rows are (1,−1,0) and (0,1,−1). With p=(1,2,3) the right-hand sides are 1−2=−1 and 2−3=−1, so A={x:x1−x2=−1, x2−x3=−1}. Check: p satisfies both, and so does p+(1,1,1)=(2,3,4).

  • (b) One equation with a non-zero row, so dim⁡B=3−1=2 by Theorem 22.2.10, a plane. The point (6,0,0) lies in it, and B→=nul(111)={x:x1+x2+x3=0}.

  • (c) p=(1,2,3) has 1+2+3=6, so p∈B; but (1,1,1)∉B→, since 1+1+1=3≠0. So A⊈B, while A∩B≠∅ (it contains p). Since A→∩B→={0}, the intersection is the single point {p} and dim⁡(A∨B)=1+2−0=3: the line and the plane together span A3.

C. Going deeper

Exercise (C1: Affine maps and flats)

Let f:A→B be affine and let A⊆A be a flat.

  • (a) Prove that f(A) is a flat of B whose direction space is f→(A→), and deduce dim⁡f(A)≤dim⁡A.
  • (b) Prove that if B⊆B is a flat with f−1(B)≠∅, then f−1(B) is a flat with direction space (f→)−1(B→).
  • (c) Hence prove that an injective affine map sends flats to flats of the same dimension, and lines to lines.

Solution.

  • (a) f(A) is non-empty. Let P∈A, so A=P+A→ (Proposition 22.2.1). For u∈A→, Theorem 22.1.5 (c) gives f(P+u)=f(P)+f→(u). Hence f(A)=f(P)+f→(A→), and f→(A→) is a subspace of W, being the image of the linear map f→ restricted to the subspace A→ (Theorem 2.2.2 applied to that restriction). So f(A) is a flat by Proposition 22.2.1, with the stated direction space, and dim⁡f(A)=dim⁡f→(A→)≤dim⁡A→=dim⁡A, because the images of a basis of A→ span f→(A→) (Theorem 2.2.4) and a spanning list is at least as long as the dimension (Theorem 1.6.3 (b)).

  • (b) Let P∈f−1(B), so f(P)∈B. For u∈V, f(P+u)=f(P)+f→(u) lies in B=f(P)+B→ exactly when f→(u)∈B→. So f−1(B)=P+(f→)−1(B→), and (f→)−1(B→) is a subspace: it contains 0 and is closed under linear combinations by linearity of f→ and the subspace test (Theorem 1.2.1). By Proposition 22.2.1, f−1(B) is a flat with that direction space.

  • (c) If f is injective, then f→ is injective: f→(u)=0 gives f(P+u)=f(P), hence P+u=P and u=0. An injective linear map carries a basis of A→ to a linearly independent list (Theorem 2.2.5) that spans f→(A→), hence to a basis of it; so dim⁡f(A)=dim⁡f→(A→)=dim⁡A→=dim⁡A by (a). A line has dimension 1, so its image is a flat of dimension 1, a line.

Exercise (C2: The midpoint quadrilateral)

Let F be a field with 2≠0, let A be an affine space over F, and let P1,P2,P3,P4∈A be any four points. Put M12=12P1+12P2, and define M23,M34,M41 likewise.

  • (a) Prove that M12M23→=M41M34→=12P1P3→.
  • (b) Deduce that if M12,M23,M34,M41 are distinct, then M12∨M23 and M41∨M34 are parallel lines, and likewise for the other pair of opposite sides: the four midpoints form a parallelogram.
  • (c) What does the statement say when P1,P2,P3,P4 are not coplanar, for instance in A3?

Solution.

  • (a) Fix any origin O and write pi=OPi→. By Definition 22.1.2, OM12→=12(p1+p2) and similarly for the others. Hence, by Proposition 22.1.3, M12M23→=12(p2+p3)−12(p1+p2)=12(p3−p1)=12P1P3→, and M41M34→=12(p3+p4)−12(p4+p1)=12(p3−p1). The answer does not depend on O, as it must not.

  • (b) If M12≠M23, the join M12∨M23 is the line M12+span(M12M23→) by Theorem 22.2.4 (a). By (a) the two lines M12∨M23 and M41∨M34 have the same direction space span(12P1P3→), so they are parallel (Definition 22.2.3). Running (a) with the indices shifted by one gives M23M34→=M12M41→=12P2P4→, so the other two sides are parallel too.

  • (c) Nothing in (a) used coplanarity, so the conclusion holds for a skew quadrilateral in A3 as well: the four midpoints of a skew quadrilateral are coplanar and form a parallelogram. Four non-coplanar points are affinely independent: otherwise (P1P2→,P1P3→,P1P4→) would be dependent (Lemma 22.2.5) and span a subspace of dimension at most 2, putting all four points in a flat of dimension at most 2. The four midpoints are then distinct, since the difference of two of them is ∑iλiPi with ∑iλi=0 and the λi not all zero — for M12 and M23 the weights are 12 at P1 and −12 at P3 — hence is a non-zero vector; so (b) applies. The two parallel lines M12∨M23 and M41∨M34 are also distinct: were they equal, their common direction space would contain M12M41→, which is 12P2P4→ by (b), so 12P2P4→=μ⋅12P1P3→ for some μ∈F (Proposition 22.2.1 (a)) — a relation ∑iλiPi=0 with weights summing to 0 and −12≠0 at P2, again against affine independence. Their join is therefore a plane, of dimension 1+1−1+1=2 by Theorem 22.2.4 (c), and it contains all four midpoints.

Exercise (C3: Medians over the field with three elements)

Work in A2(F3) with the affinely independent list P1=(0,0), P2=(1,0), P3=(0,1). (Nothing is lost by this choice: by Theorem 22.2.8 any other affinely independent triple is carried to this one by an affine bijection, which preserves midpoints, being an affine combination, and carries lines to lines by Exercise (C1: Affine maps and flats).)

  • (a) Compute the three midpoints Mi and the three medians mi=Pi∨Mi.
  • (b) Prove that the three medians are pairwise parallel and pairwise disjoint, so that Proposition 22.2.7 fails over F3.
  • (c) Explain which step of the proof of Proposition 22.2.7 breaks, and why the hypothesis 3≠0 cannot be dropped.

Solution.

  • (a) In F3 we have 2−1=2, since 2⋅2=4=1. So M1=2P2+2P3=2(1,0)+2(0,1)=(2,2),M2=2P1+2P3=(0,2),M3=2P1+2P2=(2,0). Then P1M1→=(2,2), P2M2→=(0,2)−(1,0)=(2,2) and P3M3→=(2,0)−(0,1)=(2,2). So m1=(0,0)+span((2,2)),m2=(1,0)+span((2,2)),m3=(0,1)+span((2,2)).

  • (b) All three have the same direction space span((2,2))=span((1,1)), so they are parallel (Definition 22.2.3). They are distinct: P1P2→=(1,0)∉span((1,1)), and likewise for the other two pairs, so no two of them share a point by Proposition 22.2.1 (b). Distinct parallel flats are disjoint (Proposition 22.2.3). Hence the three medians have no common point, and the conclusion of Proposition 22.2.7 is false here.

  • (c) The proof solved 32s=1 for s, which needs 3 to be invertible. Over F3 the point 13(P1+P2+P3) does not exist, because 3=0 has no inverse; the weights (13,13,13) cannot be written down at all. Concretely, the equation 1−s=s2 becomes 1−s=2s, that is, 1=3s=0, which has no solution: the parametrizations of m1 and m2 never agree. So the hypothesis 3≠0 is not an artifact of the proof; it is needed for the statement.

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.