7.1  Signed Area and Volume

In Chapter 0 a single number, ad−bc, decided whether a 2×2 matrix is invertible (Theorem 0.9.8). For an n×n matrix, Chapter 3 answered the same question by row reduction, which is a procedure, not a number. Is there one number for every square matrix that does the job of ad−bc? This section does not define it yet. Instead it asks what such a number should mean, finds the answer in area and volume, and extracts a short list of rules. From the rules alone, ad−bc comes out, with no other choice possible.

7.1.1. Area as a function of two vectors

Take two vectors u,v∈R2 and the parallelogram they span, P(u,v)={su+tv:0≤s≤1, 0≤t≤1}. Its corners are 0, u, v and u+v. We want to understand its area as a function of the two vectors, without drawing a coordinate grid and counting squares. Four features are visible without any formula.

Scaling a side scales the area. Replacing v by 2v stacks two copies of P(u,v) on top of each other, so the area doubles. Replacing v by 3v triples it, and replacing v by 12v halves it.

Shearing does not change the area. Replace v by v+cu. The top edge slides along its own line, parallel to the base u. The base stays the same, and so does the height, so the area stays the same. The picture shows c=1: the triangle cut off on the left of P(u,v) reappears, moved by u, on the right of P(u,v+u).

Diagram. Labels: mathbf u, mathbf v, mathbf v+mathbf u, T, T + mathbf u

The solid outline is P(u,v) and the dashed one completes P(u,v+u). Both consist of the unshaded middle triangle plus a shaded triangle, and the two shaded triangles T and T+u are translates of each other.

Equal sides give area zero. P(u,u) is a segment, which has no area. More generally, if v is a multiple of u, the parallelogram is flat.

The unit square has area one. P(e1,e2) is the unit square. This fixes the unit of measurement.

7.1.2. Why the area needs a sign

The first feature is not quite right as stated. Replacing v by −v moves the parallelogram to the other side of the line of u (the point reflection x↦u−x carries P(u,v) onto P(u,−v)) and does not change its area, so ordinary area satisfies area(u,cv)=|c|area(u,v), with an absolute value. That absolute value spoils a second, very useful property.

Fix the base u and let the second vector vary. The area is base times height, and heights along a fixed direction add up: if v reaches height 1 above the line of u and w reaches height 1.5, then v+w reaches height 2.5. So we expect area(u,v+w)=area(u,v)+area(u,w). The picture shows it: P(u,w), moved up by v, sits exactly on top of P(u,v), and the two together have the same base and total height as P(u,v+w) (dashed).

Diagram. Labels: mathbf u, mathbf v, mathbf w, 1, 1.5, P(mathbf u,mathbf v), mathbf v + P(mathbf u,mathbf w)

Now take w=−v. Then v+w=0 and the left side is area(u,0)=0, while the right side is 2area(u,v), which is positive. Additivity fails, because −v points below the line of u and its height should count as negative. The repair is to give area a sign.

Signed area is ordinary area, counted positive when the second vector lies on the counterclockwise side of the first, and negative when it lies on the clockwise side.

So P(e1,e2) has signed area +1, because e2 is a quarter turn counterclockwise from e1, and P(e2,e1) has signed area −1. With the sign in place, scaling holds with c instead of |c|, and heights add with their signs, so additivity holds for all v,w.

Write D(u,v) for the signed area. The pictures suggest that D:R2×R2→R obeys the following rules, for all u,v,w∈R2 and all c∈R:

  • (R1) (Scaling) D(cu,v)=cD(u,v) and D(u,cv)=cD(u,v).
  • (R2) (Shear) D(u+cv,v)=D(u,v) and D(u,v+cu)=D(u,v).
  • (R3) (Equal sides) D(u,u)=0.
  • (R4) (Normalization) D(e1,e2)=1.
  • (R5) (Additivity) D(u+w,v)=D(u,v)+D(w,v) and D(u,v+w)=D(u,v)+D(u,w).

These are rules read off from pictures, not yet a definition. The question is what they force.

7.1.3. The rules force ad−bc

A 2×2 matrix A=(abcd) has columns u=(a,c) and v=(b,d), and P(u,v) is the image of the unit square under x↦Ax. We now show that the first four rules leave no freedom at all. The method is the column version of elimination: use shears to clear entries until the parallelogram becomes a rectangle.

Example (ad−bc from the Rules)

Let D:R2×R2→R be any function satisfying (R1)–(R4). Show that D((a,c),(b,d))=ad−bc for all a,b,c,d∈R.

Solution. Write u=(a,c) and v=(b,d). Two consequences of (R1) come first. Taking the scalar 0 in (R1) gives D(u,0)=D(u,0v)=0⋅D(u,v)=0, and likewise D(0,v)=0. Using (R1) twice and then (R4), (∗)D((p,0),(0,q))=D(pe1,qe2)=pqD(e1,e2)=pqfor all p,q∈R.

Case 1: a≠0. By the second shear rule with scalar −b/a, D(u,v)=D(u,v−bau)=D(u,(0,d′)),where d′=d−bca. If d′=0, this is D(u,0)=0=ad′. If d′≠0, the first shear rule with scalar −c/d′ clears the second entry of u: D(u,(0,d′))=D(u−cd′(0,d′),(0,d′))=D((a,0),(0,d′))=ad′ by (∗). In both sub-cases D(u,v)=ad′=ad−bc.

Case 2: a=0 and b≠0. By the first shear rule with scalar 1, D(u,v)=D(u+v,v), and u+v=(b,c+d) has first entry b≠0. Case 1, applied to the columns (b,c+d) and (b,d), gives D(u,v)=bd−b(c+d)=−bc=ad−bc, since a=0.

Case 3: a=b=0. If c=0, then u=0 and D(u,v)=0. If c≠0, the second shear rule with scalar −d/c gives D(u,v)=D(u,v−dcu)=D(u,0)=0. In both sub-cases D(u,v)=0=ad−bc.

The three cases cover all a,b,c,d, so D((a,c),(b,d))=ad−bc, as claimed.

So at most one function obeys (R1)–(R4). Conversely, (a,c),(b,d)↦ad−bc obeys all five rules; for instance, for the second shear rule, replacing (b,d) by (b+ta,d+tc) gives a(d+tc)−(b+ta)c=ad−bc. The other checks are just as short. Hence exactly one function satisfies (R1)–(R4), and it satisfies (R5) as well.

Two things in this computation are worth noticing. First, (R3) was never used. It follows from the others: D(u,u)=D(u,u−u)=D(u,0)=0, by a shear and then scaling by 0. Second, the argument used only addition, subtraction, multiplication and division by non-zero numbers. So over any field F, exactly one function F2×F2→F satisfies (R1)–(R4), namely ad−bc. The picture needs R; the algebra does not.

There is also a shorter route, if we allow additivity. Expanding u=ae1+ce2 and v=be1+de2 with (R5) and (R1) gives four terms: D(u,v)=abD(e1,e1)+adD(e1,e2)+cbD(e2,e1)+cdD(e2,e2). The first and last vanish by (R3), D(e1,e2)=1 by (R4), and D(e2,e1)=−1 (see the Quick check below). This expansion is the route that generalizes to n vectors later in the chapter, while the elimination route of Example (ad−bc from the Rules) becomes the practical way to compute.

Quick check. Using only (R1) and (R2), show that D(u,v)=−D(v,u) for all u,v. Deduce D(e2,e1).

Solution. Apply shears and one scaling: D(u,v)=(R2)D(u+v,v)=(R2)D(u+v,v−(u+v))=D(u+v,−u)=(R2)D((u+v)+(−u),−u)=D(v,−u)=(R1)−D(v,u). With u=e1, v=e2 and (R4), D(e2,e1)=−D(e1,e2)=−1. This agrees with ad−bc=0⋅0−1⋅1 for the columns (0,1),(1,0).

Now compare with Chapter 0. By Theorem 0.9.8, A is invertible if and only if ad−bc≠0. In the language of this section: A is invertible exactly when the parallelogram spanned by its columns is not flat, that is, when the columns do not lie on a common line through the origin. The number that decides invertibility and the signed area of the image of the unit square are the same number. Drag the images of e1 and e2 below and watch the signed area pass through 0 exactly when the two columns line up.

Diagram. Labels: x, y, A mathbf e_1 = (2,1), A mathbf e_2 = (1,3)

The unit square (dashed) and its image under A=(2113), a parallelogram of signed area 2⋅3−1⋅1=5. The second column lies counterclockwise from the first, so the sign is positive.

7.1.4. Volume in three dimensions

The same story plays out one dimension up. Three vectors u,v,w∈R3 span a parallelepiped P(u,v,w)={ru+sv+tw:0≤r,s,t≤1}, a slanted box whose faces are parallelograms.

Diagram. Labels: mathbf u, mathbf v, mathbf w

Its volume is the area of the base P(u,v) (shaded) times the height of w above the plane of the base. Each feature from the plane has a counterpart:

  • scaling one edge scales the volume;
  • replacing w by w+au+bv slides the top face within its own plane, so the base and height, hence the volume, are unchanged, and similarly for shears of u or v;
  • if two edges are equal, the box is flat and the volume is 0;
  • the unit cube P(e1,e2,e3) has volume 1;
  • with a sign attached, heights add, so the signed volume is additive in each edge.

The sign in three dimensions records whether (u,v,w) is arranged like (e1,e2,e3), the right-hand rule. We make this precise as orientation later in the chapter. For now the point is that the rules are the same rules, now for a function D(u,v,w) of three vectors. The Quick check above also carries over word for word: shearing and scaling two of the arguments while the third stays fixed shows that swapping two arguments changes the sign.

7.1.5. What we will prove

Here is the goal for the next three sections. Let F be a field and n≥1.

There is exactly one function D of n vectors in Fn that is linear in each argument separately, is 0 whenever two arguments are equal, and takes the value 1 at (e1,…,en).

Its value on the columns of a matrix A will be the determinant detA. The plan follows the shorter route for n=2. Expanding every argument in the standard basis gives nn terms. The rule for equal arguments kills every term with a repeated basis vector, which leaves one term for each rearrangement (eσ(1),…,eσ(n)) of the standard basis. Each surviving value is ±1, reached from D(e1,…,en)=1 by swaps, with one sign change per swap. That creates two tasks:

  1. Name and study functions of several vectors with these rules. This is the next section, on multilinear alternating forms.
  2. Make sure the sign of a rearrangement is well defined, even though it can be reached by different sequences of swaps. This is the section on permutations and sign.

The existence and uniqueness theorem itself comes after both.

Warning. Sarrus’s rule is a 3×3 coincidence. For a 3×3 matrix, the “diagonals” shortcut (add the three products along the down-right diagonals of the array with its first two columns copied to the right, subtract the three along the up-right diagonals) gives the correct six terms, because there are exactly 3!=6 rearrangements. The same picture for 4×4 gives 4+4=8 products, while the expansion above has 4!=24 terms. It fails already for the matrix with columns e2,e1,e3,e4: every one of the eight wrapped diagonals passes through a zero entry, so the shortcut returns 0, but the swap rule gives D(e2,e1,e3,e4)=−D(e1,e2,e3,e4)=−1. Never use Sarrus’s rule beyond 3×3, and never use it as a proof tool.

7.1.6. Exercises

A. Check your understanding

Exercise (A1)
  • (a) State the four rules (R1)–(R4) for signed area.
  • (b) True or false: ordinary (unsigned) area satisfies area(u,v+w)=area(u,v)+area(u,w) for all u,v,w∈R2. Justify your answer.
  • (c) Find the signed area of P((1,3),(2,4)). Is (1234) invertible?
  • (d) Explain why any D satisfying (R1) and (R2) has D(u,5u)=0.
  • (e) How many terms does the full expansion for 4×4 matrices have, and how many products does the 4×4 analogue of Sarrus’s rule use?

Solution.

  • (a) For all u,v∈R2 and c∈R: D(cu,v)=cD(u,v)=D(u,cv); D(u+cv,v)=D(u,v)=D(u,v+cu); D(u,u)=0; D(e1,e2)=1.

  • (b) False. Take u=e1, v=e2, w=−e2. The left side is the area of P(e1,0), which is 0; the right side is 1+1=2.

  • (c) With a=1, b=2, c=3, d=4, the signed area is ad−bc=4−6=−2. Since −2≠0, the matrix is invertible by Theorem 0.9.8.

  • (d) By the second shear rule with scalar −5, D(u,5u)=D(u,5u−5u)=D(u,0), and D(u,0)=D(u,0⋅u)=0⋅D(u,u)=0 by (R1).

  • (e) The expansion has 4!=24 terms, one for each rearrangement of e1,…,e4. The Sarrus-type diagram has only 8 products, so it must miss 16 of them.

B. Practice

Exercise (B1: Signed Areas from the Rules)

Using only (R1)–(R4), in the manner of Example (ad−bc from the Rules), compute the following. Then check each answer against ad−bc.

  • (a) D((2,1),(4,5)).
  • (b) D((1,2),(3,6)).
  • (c) D((0,3),(2,0)).

Solution.

  • (a) By the second shear rule with scalar −2, D((2,1),(4,5))=D((2,1),(4,5)−2(2,1))=D((2,1),(0,3)). By the first shear rule with scalar −13, this equals D((2,1)−13(0,3),(0,3))=D((2,0),(0,3)). By (R1) twice and (R4), D(2e1,3e2)=6D(e1,e2)=6. Check: 2⋅5−4⋅1=6.

  • (b) By the second shear rule with scalar −3, D((1,2),(3,6))=D((1,2),(0,0)), and D(u,0)=D(u,0⋅u)=0 by (R1). So the value is 0. Check: 1⋅6−3⋅2=0. The columns lie on one line, and the parallelogram is flat.

  • (c) By (R1) twice, D(3e2,2e1)=6D(e2,e1). By the Quick check (which uses only (R1) and (R2)), D(e2,e1)=−D(e1,e2)=−1 by (R4). So the value is −6. Check: with columns (0,3) and (2,0), a=0, b=2, c=3, d=0, and ad−bc=−6. The sign is negative because (2,0) lies clockwise from (0,3).

Exercise (B2: Equal Sides Force the Swap Rule)

Let D:R2×R2→R satisfy (R1), (R3) and (R5), but not necessarily (R2).

  • (a) Prove that D(u,v)=−D(v,u) for all u,v∈R2.
  • (b) Suppose moreover that (R4) holds. Deduce that D((a,c),(b,d))=ad−bc.

Hint: expand D(u+v,u+v).

Solution.

  • (a) Let u,v∈R2. By (R3), D(u+v,u+v)=0. Expanding with (R5) in the first argument and then in the second, 0=D(u,u)+D(u,v)+D(v,u)+D(v,v)=D(u,v)+D(v,u), where the second equality uses (R3) twice. Hence D(u,v)=−D(v,u).

  • (b) Write (a,c)=ae1+ce2 and (b,d)=be1+de2. By (R5) and (R1) in each argument, D((a,c),(b,d))=abD(e1,e1)+adD(e1,e2)+cbD(e2,e1)+cdD(e2,e2). By (R3) the first and last terms are 0. By (R4), D(e1,e2)=1, and by (a), D(e2,e1)=−1. Hence D((a,c),(b,d))=ad−bc.

C. Going deeper

Exercise (C1: Area of a Triangle)

Let p,q,r∈R2.

  • (a) Explain why the triangle with vertices p,q,r has area 12|D(q−p,r−p)|, where D(u,v) is the signed area.
  • (b) Find the area of the triangle with vertices (1,2), (4,3), (2,6).
  • (c) Hence decide whether the points (0,1), (2,4), (6,10) lie on a line. Justify your answer.

Solution.

  • (a) Translating by −p does not change areas, so the triangle has the same area as the triangle with vertices 0, u=q−p, v=r−p. That triangle is half of the parallelogram P(u,v): the diagonal from u to v cuts P(u,v) into the triangle with vertices 0,u,v and the triangle with vertices u+v,v,u, and the point reflection x↦u+v−x maps the first onto the second, so they have equal area. The area of P(u,v) is |D(u,v)|, since the signed area differs from the area only by its sign. Hence the triangle has area 12|D(q−p,r−p)|.

  • (b) Here q−p=(3,1) and r−p=(1,4), so D=3⋅4−1⋅1=11 and the area is 112.

  • (c) With p=(0,1), q−p=(2,3) and r−p=(6,9), so D=2⋅9−6⋅3=0 and the “triangle” has area 0. Indeed (6,9)=3(2,3), so r−p is a multiple of q−p, and all three points lie on the line through (0,1) with direction (2,3). Yes, they are collinear.

Exercise (C2: The 1×1 Case)

For n=1, the rules ask for a function f:F→F of one vector in F1=F.

  • (a) Explain why the rule “zero whenever two arguments are equal” imposes no condition when n=1.
  • (b) Prove that the only function f:F→F that is linear with f(1)=1 is f(a)=a. Hence the determinant of a 1×1 matrix (a) must be a.

Solution.

  • (a) The rule speaks about two different positions i≠j holding equal vectors. With one argument there is no pair of positions, so the condition is vacuously true (Example (A vacuously true implication)).

  • (b) Let f be linear with f(1)=1, and let a∈F. Since a=a⋅1, homogeneity gives f(a)=f(a⋅1)=af(1)=a. Conversely, a↦a is linear and sends 1 to 1. Hence f(a)=a is the only such function.

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.