Professional Documents
Culture Documents
Full download Linear Algebra and Its Applications 5th Edition Lay Solutions Manual all chapter 2024 pdf
Full download Linear Algebra and Its Applications 5th Edition Lay Solutions Manual all chapter 2024 pdf
https://testbankfan.com/product/linear-algebra-and-its-
applications-5th-edition-lay-test-bank/
https://testbankfan.com/product/linear-algebra-and-its-
applications-4th-edition-lay-solutions-manual/
https://testbankfan.com/product/linear-algebra-and-its-
applications-4th-edition-lay-test-bank/
https://testbankfan.com/product/linear-algebra-with-
applications-5th-edition-bretscher-solutions-manual/
Linear Algebra with Applications 2nd Edition Bretscher
Solutions Manual
https://testbankfan.com/product/linear-algebra-with-
applications-2nd-edition-bretscher-solutions-manual/
https://testbankfan.com/product/linear-algebra-with-
applications-8th-edition-leon-solutions-manual/
https://testbankfan.com/product/linear-algebra-with-
applications-2nd-edition-holt-solutions-manual/
https://testbankfan.com/product/linear-algebra-with-
applications-9th-edition-leon-solutions-manual/
https://testbankfan.com/product/elementary-linear-algebra-with-
applications-9th-edition-kolman-solutions-manual/
6.1 SOLUTIONS
Notes: The first half of this section is computational and is easily learned. The second half concerns the
concepts of orthogonality and orthogonal complements, which are essential for later work. Theorem 3 is
an important general fact, but is needed only for Supplementary Exercise 13 at the end of the chapter and
in Section 7.4. The optional material on angles is not used later. Exercises 27–31 concern facts used later.
1 4 2 2 v u 8
1. Since u and v , u u (1) 2 5 , v u = 4(–1) + 6(2) = 8, and .
2 6 u u 5
3 6
2 2 2
2. Since w 1 and x 2 , w w 3 (1) (5) 35 , x w = 6(3) + (–2)(–1) + 3(–5) = 5,
5 3
xw 5 1
and .
w w 35 7
3 3/ 35
1
2 2 2
3. Since w 1 , w w 3 (1) (5) 35 , and w 1/ 35 .
ww
5 1/ 7
1 2 2 1 1/ 5
4. Since u , u u (1) 2 5 and u .
2 u u 2 / 5
1 4
5. Since u and v , u v = (–1)(4) + 2(6) = 8, v v 42 62 52, and
2 6
uv 2 4 8/13
v 6 12 /13 .
vv 13
6-1
Copyright © 2016 Pearson Education, Inc.
6-2 CHAPTER 6 • Orthogonality and Least Squares
6 3
2 2 2
6. Since x 2 and w 1 , x w = 6(3) + (–2)(–1) + 3(–5) = 5, x x 6 (2) 3 49, and
3 5
6 30 / 49
xw 5
x 2 10 / 49 .
xx 49
3 15 / 49
3
7. Since w 1 , || w || w w 32 ( 1) 2 ( 5) 2 35.
5
6
8. Since x 2 , || x || x x 6 2 ( 2) 2 32 49 7.
3
6 6 6 / 61
1 4 1 4 4 / 61
(6) 2 42 (3) 2 3 61
3
3 61
10 1 2 2 2
13. Since x and y , || x y || [10 (1)] [3 (5)] 125 and
3 5
dist (x, y) 125 5 5.
0 4
2 2 2 2
14. Since u 5 and z 1 , || u z || [0 (4)] [5 (1)] [2 8] 68 and
2 8
dist (u, z) 68 2 17.
15. Since a b = 8(–2) + (–5)( –3) = –1 0, a and b are not orthogonal.
17. Since u v = 3(–4) + 2(1) + (–5)( –2) + 0(6) = 0, u and v are orthogonal.
18. Since y z = (–3)(1) + 7(–8) + 4(15) + 0(–7) = 1 0, y and z are not orthogonal.
22. Since u u is the sum of the squares of the entries in u, u u0. The sum of squares of numbers is
zero if and only if all the numbers are themselves zero.
2 2 2 2
23. One computes that u v = 2(–7) + (–5)( –4) + (–1)6 = 0, || u || u u 2 (5) (1) 30,
|| v ||2 v v (7)2 (4)2 62 101, and || u v ||2 (u v) (u v)
(2 (7))2 (5 (4))2 (1 6)2 131.
2 2 2
24. One computes that || u v || (u v) (u v) u u 2u v v v || u || 2u v || v || and
|| u v ||2 (u v) (u v) u u 2u v v v || u ||2 2u v || v ||2 , so
|| u v ||2 || u v ||2 || u ||2 2u v || v ||2 || u ||2 2u v || v ||2 2|| u ||2 2|| v ||2 .
a x
25. When v , the set H of all vectors that are orthogonal to v is the subspace of vectors whose
b y
entries satisfy ax + by = 0. If a 0, then x = – (b/a)y with y a free variable, and H is a line through
b
the origin. A natural choice for a basis for H in this case is . If a = 0 and b 0, then by = 0.
a
Since b 0, y = 0 and x is a free variable. The subspace H is again a line through the origin. A
1 b
natural choice for a basis for H in this case is , but is still a basis for H since a = 0
0 a
and b 0. If a = 0 and b = 0, then H = 2 since the equation 0x + 0y = 0 places no restrictions on x
or y.
26. Theorem 2 in Chapter 4 may be used to show that W is a subspace of 3 , because W is the null
space of the 1 3 matrix u T . Geometrically, W is a plane through the origin.
27. If y is orthogonal to u and v, then y u = y v = 0, and hence by a property of the inner product,
y (u + v) = y u + y v = 0 + 0 = 0. Thus y is orthogonal to u + v.
28. An arbitrary w in Span{u, v} has the form w c1u c2 v . If y is orthogonal to u and v, then
u y = v y = 0. By Theorem 1(b) and 1(c),
w y ( c1u c2 v ) y c1 (u y ) c2 ( v y ) 0 0 0
29. A typical vector in W has the form w c1v1 cp v p . If x is orthogonal to each vj , then by
Theorems 1(b) and 1(c),
w x (c1v1 cp v p ) x c1 (v1 x) cp (v p x) 0
So x is orthogonal to each w in W.
30. a. If z is in W , u is in W, and c is any scalar, then (cz) u = c(zu) = c 0 = 0. Since u is any
element of W, c z is in W .
b. Let z1 and z 2 be in W . Then for any u in W, ( z1 z 2 ) u z1 u z 2 u 0 0 0. Thus
z1 z 2 is in W .
c. Since 0 is orthogonal to every vector, 0 is in W . Thus W is a subspace.
32. [M]
a. One computes that || a1 || || a 2 || || a 3 || || a 4 || 1 and that ai a j 0 for i j.
b. Answers will vary, but it should be that || Au || = || u || and || Av || = || v ||.
c. Answers will again vary, but the cosines should be equal.
d. A conjecture is that multiplying by A does not change the lengths of vectors or the angles
between vectors.
33. [M] Answers to the calculations will vary, but will demonstrate that the mapping
xv
v (for v 0) is a linear transformation. To confirm this, let x and y be in , and
n
x T ( x)
vv
let c be any scalar. Then
(x y ) v (x v) (y v) xv yv
T (x y ) v v v v T (x) T (y )
vv vv vv vv
and
(cx) v c(x v) xv
T (cx) v v c v cT ( x)
v v v v vv
5 1
4 1/ 3
1 1 0 5 0
34. [M] One finds that N 1 0 , R 0 1 1 0 4 / 3 .
0 1 0 0 0 1 1/ 3
0 3
The row-column rule for computing RN produces the 3 2 zero matrix, which shows that the rows of
R are orthogonal to the columns of N. This is expected by Theorem 3 since each row of R is in Row
A and each column of N is in Nul A.
6.2 SOLUTIONS
Notes: The nonsquare matrices in Theorems 6 and 7 are needed for the QR factorization in Section 6.4. It
is important to emphasize that the term orthogonal matrix applies only to certain square matrices. The
subsection on orthogonal projections not only sets the stage for the general case in Section 6.3, it also
provides what is needed for the orthogonal diagonalization exercises in Section 7.1, because none of the
eigenspaces there have dimension greater than 2. For this reason, the Gram-Schmidt process (Section 6.4)
is not really needed in Chapter 7. Exercises 13 and 14 are good preparation for Section 6.3.
1 3
1. Since 4 4 2 0, the set is not orthogonal.
3 7
1 0 1 5 0 5
2. Since 2 1 2 2 1 2 0, the set is orthogonal.
1 2 1 1 2 1
6 3
3. Since 3 1 30 0, the set is not orthogonal.
9 1
2 0 2 4 0 4
4. Since 5 0 5 2 0 2 0, the set is orthogonal.
3 0 3 6 0 6
3 1 3 3 1 3
2 3 2 8 3 8
5. Since 0, the set is orthogonal.
1 3 1 7 3 7
3 4 3 0 4 0
4 3
1 3
6. Since 32 0, the set is not orthogonal.
3 5
8 1
7. Since u1 u 2 12 12 0, {u1 , u 2 } is an orthogonal set. Since the vectors are non-zero, u1 and u 2
are linearly independent by Theorem 4. Two such vectors in 2 automatically form a basis for 2 .
So {u1 , u 2 } is an orthogonal basis for 2 . By Theorem 5,
x u1 x u2 1
x u1 u 2 3u1 u 2
u1 u1 u2 u2 2
8. Since u1 u 2 6 6 0, {u1 , u 2 } is an orthogonal set. Since the vectors are non-zero, u1 and u 2
are linearly independent by Theorem 4. Two such vectors in 2 automatically form a basis for 2 .
So {u1 , u 2 } is an orthogonal basis for 2 . By Theorem 5,
x u1 x u2 3 3
x u1 u 2 u1 u 2
u1 u1 u2 u2 2 4
10. Since u1 u 2 u1 u 3 u 2 u 3 0, {u1 , u 2 , u 3 } is an orthogonal set. Since the vectors are non-zero,
u1 , u 2 , and u 3 are linearly independent by Theorem 4. Three such vectors in automatically
3
1 4
11. Let y and u . The orthogonal projection of y onto the line through u and the origin is
7 2
y u 1 2
the orthogonal projection of y onto u, and this vector is yˆ u u .
u u 2 1
1 1
12. Let y and u . The orthogonal projection of y onto the line through u and the origin is
1 3
y u 2 2 / 5
the orthogonal projection of y onto u, and this vector is yˆ u u .
u u 5 6 / 5
y u 13 4 / 5
13. The orthogonal projection of y onto u is yˆ u u . The component of y
u u 65 7 / 5
orthogonal to u is y yˆ . Thus y yˆ y yˆ .
y u 2 14 / 5
14. The orthogonal projection of y onto u is yˆ u u . The component of y orthogonal
uu 5 2 / 5
to u is y yˆ . Thus y yˆ y yˆ .
15. The distance from y to the line through u and the origin is ||y – ŷ ||. One computes that
y u 3 3 8 3/ 5
y yˆ y u , so || y yˆ is the desired distance.
uu 1 10 6 4 / 5
16. The distance from y to the line through u and the origin is ||y – ŷ ||. One computes that
y u 3 1 6
y yˆ y u 3 , so || y yˆ is the desired distance.
uu 9 2 3
1/ 3 1/ 2
0 . Since u v = 0, {u, v} is an orthogonal set. However, || u ||2 u u 1/3
17. Let u 1/ 3 , v
1/ 3 1/ 2
2
and || v || v v 1/ 2, so {u, v} is not an orthonormal set. The vectors u and v may be normalized to
form the orthonormal set
3 / 3 2 / 2
u v
, 3 / 3 , 0
|| u || || v ||
3 / 3 2 / 2
0 0
18. Let u 1 , v 1 . Since u v = –1 0, {u, v} is not an orthogonal set.
0 0
.6 .8 2
19. Let u , v . Since u v = 0, {u, v} is an orthogonal set. Also, || u || u u 1 and
.8 .6
|| v ||2 v v 1, so {u, v} is an orthonormal set.
2 / 3 1/ 3
2
20. Let u 1/ 3 , v 2 / 3 . Since u v = 0, {u, v} is an orthogonal set. However, || u || u u 1
2 / 3 0
2
and || v || v v 5/9, so {u, v} is not an orthonormal set. The vectors u and v may be normalized
2 / 3 1/ 5
u v
to form the orthonormal set , 1/ 3 , 2 / 5 .
|| u || || v ||
2 / 3 0
1/ 10 3/ 10 0
21. Let u 3/ 20 , v 1/ 20 , and w 1/ 2 . Since u v = u w = v w = 0, {u, v, w} is an
1/ 2
3/ 20 1/ 20
2 2 2
orthogonal set. Also, || u || u u 1, || v || v v 1, and || w || w w 1, so {u, v, w} is an
orthonormal set.
1/ 18 1/ 2 2 / 3
22. Let u 4 / 18 , v 0 , and w 1/ 3 . Since u v = u w = v w = 0, {u, v, w} is an
1/ 2 2 / 3
1/ 18
2 2 2
orthogonal set. Also, || u || u u 1, || v || v v 1, and || w || w w 1, so {u, v, w} is an
orthonormal set.
23. a. True. For example, the vectors u and y in Example 3 are linearly independent but not orthogonal.
b. True. The formulas for the weights are given in Theorem 5.
c. False. See the paragraph following Example 5.
d. False. The matrix must also be square. See the paragraph before Example 7.
e. False. See Example 4. The distance is ||y – ŷ ||.
24. a. True. But every orthogonal set of nonzero vectors is linearly independent. See Theorem 4.
b. False. To be orthonormal, the vectors is S must be unit vectors as well as being orthogonal to each
other.
c. True. See Theorem 7(a).
d. True. See the paragraph before Example 3.
e. True. See the paragraph before Example 7.
because U T U I . If y = x in part (b), (Ux) (Ux) = x x, which implies part (a). Part (c) of the
Theorem follows immediately fom part (b).
26. A set of n nonzero orthogonal vectors must be linearly independent by Theorem 4, so if such a set
spans W it is a basis for W. Thus W is an n-dimensional subspace of n , and W n .
27. If U has orthonormal columns, then U T U I by Theorem 6. If U is also a square matrix, then the
equation U T U I implies that U is invertible by the Invertible Matrix Theorem.
29. Since U and V are orthogonal, each is invertible. By Theorem 6 in Section 2.2, UV is invertible and
(UV )1 V 1U 1 V TU T (UV )T , where the final equality holds by Theorem 3 in Section 2.1. Thus
UV is an orthogonal matrix.
30. If U is an orthogonal matrix, its columns are orthonormal. Interchanging the columns does not
change their orthonormality, so the new matrix – say, V – still has orthonormal columns. By
Theorem 6, V T V I . Since V is square, V T V 1 by the Invertible Matrix Theorem.
y u
31. Suppose that yˆ u . Replacing u by cu with c 0 gives
u u
y (cu) c(y u) c 2 ( y u) y u
(cu) 2 (c)u 2 u u yˆ
(cu) (cu) c (u u) c (u u) u u
So ŷ does not depend on the choice of a nonzero u in the line L used in the formula.
x u
33. Let L = Span{u}, where u is nonzero, and let T (x) u . For any vectors x and y in n and any
u u
scalars c and d, the properties of the inner product (Theorem 1) show that
(cx dy ) u
T (cx dy ) u
u u
cx u dy u
u
u u
cx u dy u
u u
uu u u
cT (x) dT (y )
Thus T is a linear transformation. Another approach is to view T as the composition of the following
three linear mappings: xa = x v, a b = a / v v, and b bv.
34. Let L = Span{u}, where u is nonzero, and let T ( x ) refl L y 2projL y y . By Exercise 33, the
mapping y projL y is linear. Thus for any vectors y and z in n and any scalars c and d,
T ( c y d z ) 2 projL ( c y d z ) ( c y d z )
2( c projL y d projL z ) c y d z
2 c projL y c y 2 d projL z d z
c (2 projL y y ) d (2 projL z z )
cT (y ) dT (z )
Thus T is a linear transformation.
T
35. [M] One can compute that A A 100I4 . Since the off-diagonal entries in AT A are zero, the columns
of A are orthogonal.
36. [M]
T
a. One computes that U U I4 , while
82 0 20 8 6 20 24 0
0 42 24 0 20 6 20 32
20 24 58 20 0 32 0 6
1 8 0 20 82 24 20 6 0
UU T
100 6 20 0 24 18 0 8 20
20 6 32 20 0 58 0 24
24 20 0 6 8 0 18 20
0 32 6 0 20 24 20 42
The matrices U T U and UU T are of different sizes and look nothing like each other.
T T
b. Answers will vary. The vector p UU y is in Col U because p U (U y) . Since the columns of
U are simply scaled versions of the columns of A, Col U = Col A. Thus each p is in Col A.
c. One computes that U T z 0 .
d. From (c), z is orthogonal to each column of A. By Exercise 29 in Section 6.1, z must be
orthogonal to every vector in Col A; that is, z is in (Col A) .
6.3 SOLUTIONS
Notes: Example 1 seems to help students understand Theorem 8. Theorem 8 is needed for the Gram-
Schmidt process (but only for a subspace that itself has an orthogonal basis). Theorems 8 and 9 are
needed for the discussions of least squares in Sections 6.5 and 6.6. Theorem 10 is used with the QR
factorization to provide a good numerical method for solving least squares problems, in Section 6.5.
Exercises 19 and 20 lead naturally into consideration of the Gram-Schmidt process.
10
6
x u4 72
1. The vector in Span{u 4 } is u 4 u 4 2u 4 . Since
u4 u4 36 2
2
10 10 0
8 6 2
x u4 x u4
x c1u1 c2 u 2 c3u 3 u 4 , the vector x u 4 is in
u4 u4 u4 u4 2 2 4
0 2 2
Span{u1 , u 2 , u 3 }.
2
4
v u1 14 v u1
2. The vector in Span{u1} is u1 u1 2u1 . Since x u1 c2 u 2 c3u 3 c4 u 4 ,
u1 u1 7 2 u1 u1
2
4 2 2
5 4 1
v u1
the vector v u1 is in Span{u 2 , u 3 , u 4 }.
u1 u1 3 2 5
3 2 1
11. Note that v 1 and v 2 are orthogonal. The Best Approximation Theorem says that ŷ , which is the
orthogonal projection of y onto W Span{ v1 , v 2 }, is the closest point to y in W. This vector is
3
1
y v1 y v2 1 3
yˆ v1 v 2 v1 v 2 .
v1 v1 v2 v2 2 2 1
1
12. Note that v 1 and v 2 are orthogonal. The Best Approximation Theorem says that ŷ , which is the
orthogonal projection of y onto W Span{ v1 , v 2 }, is the closest point to y in W. This vector is
1
5
y v1 y v2
yˆ v1 v 2 3v1 1v 2 .
v1 v1 v2 v2 3
9
13. Note that v 1 and v 2 are orthogonal. By the Best Approximation Theorem, the closest point in
1
3
z v1 z v2 2 7
Span{v1 , v 2 } to z is zˆ v1 v 2 v1 v 2 .
v1 v1 v2 v2 3 3 2
3
14. Note that v 1 and v 2 are orthogonal. By the Best Approximation Theorem, the closest point in
1
0
z v1 z v2 1
Span{v1 , v 2 } to z is zˆ v1 v 2 v1 0 v 2 .
v1 v1 v2 v2 2 1/ 2
3/ 2
15. The distance from the point y in to a subspace W is defined as the distance from y to the closest
3
point in W. Since the closest point in W to y is yˆ projW y , the desired distance is || y – ŷ ||. One
3 2
computes that yˆ 9 y yˆ 0 , and || y yˆ 40 10.
1 6
16. The distance from the point y in to a subspace W is defined as the distance from y to the closest
4
point in W. Since the closest point in W to y is yˆ projW y , the desired distance is || y – ŷ ||. One
computes that yˆ y yˆ , and || y – ŷ || = 8.
8/9 2 / 9 2 / 9
1 0
T
17. a. U U , UU 2 / 9
T
5/9 4 / 9 .
0 1
2 / 9 4/9 5 / 9
T
b. Since U U I2 , the columns of U form an orthonormal basis for W, and by Theorem 10
8/9 2 / 9 2 / 9 4 2
projW y UU y 2 / 9
T
5/9 4 / 9 8 4 .
2 / 9 4/9 5/ 9 1 5
1 / 10 3 / 10
18. a. U TU 1 1, UU T
3 / 10 9 / 10
b. Since U T U 1, {u1} forms an orthonormal basis for W, and by Theorem 10
1/10 3/10 7 2
projW y UU T y .
3/10 9 /10 9 6
19. By the Orthogonal Decomposition Theorem, u 3 is the sum of a vector in W Span{u1 , u 2 } and a
vector v orthogonal to W. This exercise asks for the vector v:
0 0 0
1 1
v u3 projW u3 u3 u1 u 2 0 2 / 5 2 / 5 . Any multiple of the vector v will
3 15
1 4 / 5 1/ 5
also be in W .
20. By the Orthogonal Decomposition Theorem, u 4 is the sum of a vector in W Span{u1 , u 2 } and a
vector v orthogonal to W. This exercise asks for the vector v:
0 0 0
1 1
v u 4 projW u 4 u 4 u1 u 2 1 1/ 5 4 / 5 . Any multiple of the vector v will
6 30
0 2 / 5 2 / 5
also be in W .
21. a. True. See the calculations for z 2 in Example 1 or the box after Example 6 in Section 6.1.
b. True. See the Orthogonal Decomposition Theorem.
c. False. See the last paragraph in the proof of Theorem 8, or see the second paragraph after the
statement of Theorem 9.
d. True. See the box before the Best Approximation Theorem.
e. True. Theorem 10 applies to the column space W of U because the columns of U are linearly
independent and hence form a basis for W.
e. False. This statement is only true if x is in the column space of U. If n > p, then the column space
of U will not be all of n , so the statement cannot be true for all x in n .
23. By the Orthogonal Decomposition Theorem, each x in n can be written uniquely as x = p + u, with
p in Row A and u in (Row A) . By Theorem 3 in Section 6.1, (Row A) Nul A, so u is in Nul A.
Next, suppose Ax = b is consistent. Let x be a solution and write x = p + u as above. Then
Ap = A(x – u) = Ax – Au = b – 0 = b, so the equation Ax = b has at least one solution p in Row A.
Finally, suppose that p and p1 are both in Row A and both satisfy Ax = b. Then p p1 is in
Nul A (Row A) , since A(p p1 ) Ap A p1 b b 0 . The equations p p1 (p p 1 ) and
p = p + 0 both then decompose p as the sum of a vector in Row A and a vector in (Row A) . By the
uniqueness of the orthogonal decomposition (Theorem 8), p p1 , and p is unique.
24. a. By hypothesis, the vectors w 1 , , w p are pairwise orthogonal, and the vectors v 1 , , vq are
pairwise orthogonal. Since w i is in W for any i and v j is in W for any j, wi v j 0 for any i
and j. Thus {w1 ,, w p , v1 ,, vq } forms an orthogonal set.
c. The set {w1 ,, w p , v1 ,, vq } is linearly independent by (a) and spans n by (b), and is thus a
basis for n . Hence dimW dimW p q dim n .
T
25. [M] Since U U I4 , U has orthonormal columns by Theorem 6 in Section 6.2. The closest point to
y in Col U is the orthogonal projection ŷ of y onto Col U. From Theorem 10, yˆ UU y
26.[M] The distance from b to Col U is || b – b̂ ||, where bˆ UU b. One computes that
bˆ UU b b bˆ b bˆ . which is 2.1166 to four decimal places.
6.4 SOLUTIONS
Notes: The QR factorization encapsulates the essential outcome of the Gram-Schmidt process, just as the
LU factorization describes the result of a row reduction process. For practical use of linear algebra, the
factorizations are more important than the algorithms that produce them. In fact, the Gram-Schmidt
process is not the appropriate way to compute the QR factorization. For that reason, one should consider
deemphasizing the hand calculation of the Gram-Schmidt process, even though it provides easy exam
questions.
The Gram-Schmidt process is used in Sections 6.7 and 6.8, in connection with various sets of
orthogonal polynomials. The process is mentioned in Sections 7.1 and 7.4, but the one-dimensional
projection constructed in Section 6.2 will suffice. The QR factorization is used in an optional subsection
of Section 6.5, and it is needed in Supplementary Exercise 7 of Chapter 7 to produce the Cholesky
factorization of a positive definite matrix.
1
x 2 v1
1. Set v1 x1 and compute that v 2 x 2 v1 x 2 3v1 5 . Thus an orthogonal basis for W
v1 v1
3
3 1
is 0 , 5 .
1 3
5
x2 v1 1
2. Set v1 x1 and compute that v 2 x 2 v1 x 2 v1 4 . Thus an orthogonal basis for W
v1 v1 2
8
0 5
is 4 , 4 .
2 8
3
x 2 v1 1
3. Set v1 x1 and compute that v 2 x 2 v1 x 2 v1 3/ 2 . Thus an orthogonal basis for
v1 v1 2
3/ 2
2 3
5 , 3 / 2
W is .
1 3 / 2
3
x 2 v1
4. Set v1 x1 and compute that v 2 x 2 v1 x 2 (2) v1 6 . Thus an orthogonal basis for
v1 v1
3
3 3
W is 4 , 6 .
5 3
5
1
x v
5. Set v1 x1 and compute that v 2 x 2 2 1 v1 x 2 2 v1 . Thus an orthogonal basis for W
v1 v1 4
1
1 5
4 1
,
is .
0 4
1 1
4
6
x v
6. Set v1 x1 and compute that v 2 x 2 2 1 v1 x 2 (3) v1 . Thus an orthogonal basis for
v1 v1 3
0
3 4
1 6
W is , .
2 3
1 0
9. Call the columns of the matrix x1 , x 2 , and x3 and perform the Gram-Schmidt process on these
vectors:
v1 x1
1
3
x v
v 2 x 2 2 1 v1 x 2 ( 2) v1
v1 v1 3
1
3
1
x v x v 3 1
v 3 x3 3 1 v1 3 2 v 2 x3 v1 v 2
v1 v1 v2 v2 2 2 1
3
3 1 3
1 3 1
, ,
Thus an orthogonal basis for W is .
1 3 1
3 1 3
10. Call the columns of the matrix x1 , x 2 , and x3 and perform the Gram-Schmidt process on these
vectors:
v1 x1
3
1
x v
v 2 x 2 2 1 v1 x 2 ( 3) v1
v1 v1 1
1
1
1
x v x v 1 5
v 3 x3 3 1 v1 3 2 v 2 x3 v1 v 2
v1 v1 v2 v2 2 2 3
1
1 3 1
3 1 1
, ,
Thus an orthogonal basis for W is .
1 1 3
1 1 1
11. Call the columns of the matrix x1 , x 2 , and x3 and perform the Gram-Schmidt process on these
vectors:
v1 x1
3
0
x v
v 2 x 2 2 1 v1 x 2 ( 1) v1 3
v1 v1
3
3
2
0
x v x v 1
v 3 x3 3 1 v1 3 2 v 2 x3 4 v1 v 2 2
v1 v1 v2 v2 3
2
2
1 3 2
1 0 0
Thus an orthogonal basis for W is 1 , 3 , 2 .
1 3 2
1 3 2
12. Call the columns of the matrix x1 , x 2 , and x3 and perform the Gram-Schmidt process on these
vectors:
v1 x1
1
1
x 2 v1
v 2 x2 v1 x 2 4 v1 2
v1 v1
1
1
3
3
x v x v 7 3
v3 x3 3 1 v1 3 2 v 2 x3 v1 v 2 0
v1 v1 v2 v2 2 2
3
3
1 1 3
1 1 3
Thus an orthogonal basis for W is 0 , 2 , 0 .
1 1 3
1 1 3
5 9
5/6 1/ 6 3/ 6 1/ 6 1 7 6 12
13. Since A and Q are given, R QT A .
1/ 6 5/ 6 1/ 6 3/ 6 3 5 0 6
1 5
2 3
2 / 7 5/7 2/7 4 / 7 5 7 7 7
14. Since A and Q are given, R QT A .
5/7 2/7 4 / 7 2 / 7 2 2 0 7
4 6
15. The columns of Q will be normalized versions of the vectors v1 , v 2 , and v 3 found in Exercise 11.
1/ 5 1/ 2 1/ 2
1/ 5 0 0 5 5 4 5
T
Thus Q 1/ 5 1/ 2 1/ 2 , R Q A 0 6 2 .
0 0 4
1/ 5 1/ 2 1/ 2
1/ 5 1/ 2 1/ 2
16. The columns of Q will be normalized versions of the vectors v1 , v 2 , and v 3 found in Exercise 12.
1/ 2 1 / (2 2) 1 / 2
1 / 2 1 / (2 2) 1 / 2 2 8 7
T
Thus Q 0 1/ 2 0 , R Q A 0 2 2 3 2 .
0 0 6
1/ 2 1 / (2 2) 1 / 2
1/ 2 1 / (2 2) 1 / 2
17. a. False. Scaling was used in Example 2, but the scale factor was nonzero.
b. True. See (1) in the statement of Theorem 11.
c. True. See the solution of Example 4.
18. a. False. The three orthogonal vectors must be nonzero to be a basis for a three-dimensional
subspace. (This was the case in Step 3 of the solution of Example 2.)
b. True. If x is not in a subspace W, then x cannot equal proj W x , because proj W x is in W. This idea
was used for v k 1 in the proof of Theorem 11.
c. True. See Theorem 12.
"Oh, you are wrong. The matter is nearly arranged. We shall see, my dear
Count—we shall see—"
"When?"
"Yes, probably. Monseigneur the Dauphin will be asked to take his place
after the fourth minuet. And you, Marc—do you know what part in the affair
is to fall to you?"
"Alas, yes—I can conjecture it. I had not feared that it would come so
soon. The husband—Claude—will be my task."
"I am, indeed, sorry for it. Once before, you remember, he fell to me.
Mon Dieu! He took it manfully enough then; but this is worse. Unhappily, he
is fond of his wife."
"Never, Monsieur of the Interior. In heaven there may be such. But then,
in heaven, I am told, there are no kings."
"Yes, and there will soon be thrushes in the bosquet of the Queen!"
The other smiled and shifted his position. "It is more apropos than you
think. Observe—there is de Coigny returned."
"We shall not be seconds after all, then. Let us go and speak with Jules."
Thus the evening wore on in customary fashion, and, as the hour for
supper approached, a little quiver of expectation fell upon the hearts of
certain people in the great room, who, so far as an outsider could have
determined, were in no way connected with each other. D'Argenson had
been missing during the early part of the evening, but made his appearance
at eleven o'clock. De Berryer and Maurepas, during the ensuing quarter of an
hour, each approached and casually addressed him. De Gêvres did not go
near him, but received a nod from across the room that seemed to be
satisfactory to both. The King himself, during a promenade, paused for an
instant on his way to whisper something that his partner herself could not
hear, into the ear of Marc Antoine. The answer was simply, "Yes, Sire," but
the King moved on with new gayety after hearing it.
The Marquis gave a slight, cynical smile. "On the contrary, dear Claude,
I have now lost my last excuse for worry, care, or melancholy. What more
could the gods devise for me?"
"Ah! I know!" returned the other, very gently, as he laid one hand upon
Henri's shoulder. "You must think—only—that she is happier now."
Henri quivered suddenly and shook the hand away. "Stop, Claude. I—I
—no, not even from you," he ejaculated, harshly.
"Forgive me."
"Good-evening, gentlemen."
Henri faced quickly about as Claude bowed to the man who had
approached them. It was d'Argenson.
"You look very serious, Monsieur le Comte. What is the matter? Do the
powers of Europe threaten the last treaty, or is one of the King's lapdogs
dead?" inquired Claude, with his most catching smile, and anxious to give
Henri a moment to change his thought.
He stopped. Maurepas had told him that this man would behave well. It
was not so. Claude had turned deathly white. Both hands had flown to his
head, and he reeled where he stood. Henri sprang forward and caught him
about the body.
"No. I will have nothing." For a moment the three stood motionless and
silent. Then Claude opened his eyes and looked upon the King's minister.
"The letter—invites me—to travel?"
D'Argenson bowed.
Claude slowly drew a handkerchief from his pocket and wiped his lips
with it. "May God damn to hell the King of France! All the armies in his
kingdom shall not drive me from it till I've got back my wife!"
After he had spoken these words d'Argenson was not sure that Claude
had heard them. The young man stood for a minute or two staring at him
stupidly, with a look of heavy indifference. Then his body began to
straighten, he breathed sharply two or three times, and d'Argenson's muscles
stiffened as he prepared to avoid an attack. Claude's hand opened and shut
convulsively, but he made no move forward. After a long time, when the
tension had grown almost past bearing to his cousin and the minister, de
Mailly, with a dignity that Louis himself could not have equalled, said,
measuredly: "Well, messieurs, I go home to await my wife. If her choice is
free, if she is not forced, she will return to me. This is inevitable. Henri, let
us go."
"Monsieur, if Mme. de Mailly does remain, all the bolts, all the bars and
walls of the Bastille will not be enough to save Louis of France from death
at my hands. Tell him so."
In the mean time Deborah had not reached the supper-room. De Gêvres
was her escort from the Hall of Mirrors, supposedly to the Salle du Grand
Couvert; but, when they stood upon the threshold of the first corridor, he
bent over her, saying, in a low voice: "Madame, the public room will be
crowded and disagreeable. In the Salle des Pendules there is to be a little
supper, to which I am instructed to invite you. Will you do me the honor to
accompany me?"
"It must be a small party, or are we the first?" asked Deborah, as they
entered the room and paused before a closed door.
De Gêvres did not answer. Instead, he knocked twice upon the panel.
The Duke pulled open the door, and Deborah passed before him. The
door closed again, softly, behind her. She was alone with the King.
Louis, who stood at the end of the room, his back to the fire, smiled at
her. "Oh, there are no terms of etiquette to-night. We are only very good
friends, you and I, my dear little Countess. Do you see? Now let us sit down
together at this little table, where Mouthier has prepared a most delicate
repast; and as we eat and quaff together some of the golden wine of
Champagne, we will talk. Will you not thus honor me, madame?"
Deborah, who had grown very white during the King's speech, looked
anxiously about her.
"We are utterly alone. None can hear us," observed his Majesty again,
with the idea of being reassuring. He did his companion unguessed injustice.
She had been thrown into a sudden panic of fear.
"Pardon, your Majesty, I—I do not desire to eat. I am not hungry. When
M. de Gêvres conducted me here, I did not understand what he meant. If you
will grant me permission, I will go."
This speech pleased the King incredibly. Here at last was a woman who
would not fall at his feet, whom it were worth his while to win. Her fear was
certainly genuine. She was actually moving towards the door. He did not stir
from his place, wishing not to alarm her further.
"My dear Mme. de Mailly, how cruel to leave me quite alone! As your
sovereign, I might command. As a man, however, I only entreat. Try, for me,
one of these rissoles, which I myself assisted in making. Ah! That is better."
Deborah, something reassured by the quiet tone and the apparent liberty
which was hers, looked doubtfully over to the little table whose glass and
gold shone brightly under the great chandelier. The King was holding a chair
for her. Flight now, were there really nothing intended by this gallantry,
might be a little awkward to explain next day. After a moment's thought,
Deborah went slowly over and sat down at the table. Louis, with a sigh of
comfort and relief, placed himself beside her; and, taking her plate, filled it
with portions from a number of dishes. The girl looked down at them with a
troubled expression. She was thinking of Choisy.
"Lady of the palace of the Queen," repeated Deborah, slowly, her large
eyes fixed upon the King's face.
"Yes, I have said it. Your appointment is here," he replied, tapping the
breast of his coat. "Now tell me what else there is in the world that you wish
for. Ah—there is something, I know. Estates—money—servants—what will
you have, my little one?"
Deborah shivered with cold. She realized the situation now, and the
nerves beneath her flesh were quivering. Pulling herself together with a
strong mental effort, she sat up, rigid and stiff, before her untouched food.
Her mind was quite clear, her path well defined.
"What is it that you want? I read desire in your eyes," repeated the King,
thinking to win his suit more easily than he had at first believed.
"No, no. There is nothing. I—thank your Majesty for your kindness.
There is nothing that I want. Indeed, indeed, there is nothing."
He was put out, and yet there was a little twinkle in her eyes that became
her wonderfully, and seemed, too, to give him hope. After an instant he felt
that anger was unnecessary, and thus recovered his ardent dignity as best he
could. "I beg of you—be serious. Since you will name for me nothing that
you wish, I will at least tell you in what you are lacking. When you hear
these things—desire will be born. Madame—read this."
From his coat Louis took a broad paper, folded and royally sealed.
Deborah, her face troubled and her hands shaking slightly, rose to receive it,
and, after a moment of hesitation, at a most impatient nod from the King,
broke the seals, and found the inside of the document covered with the neat,
legible writing of Maurepas. She glanced quickly over its lines:
"The right to confer titles of honor being one of the most sublime
attributes of supreme power, the Kings, our predecessors, have left us divers
monuments of the use they have made of it in favor of persons whose virtues
and merits they desired to extol and make illustrious. Considering that our
very dear and well-beloved cousin, Deborah Travis, wife of the Comte de
Mailly, issues from one of the greatest families of a nation closely allied to
us, whom we delight to honor; that she is attached as lady of the palace to
the Queen, our very dear companion; that she is united by marriage to one of
the most ancient and illustrious families in our realm, whose ancestors have,
for several centuries, rendered important services to our crown; and that she
joins to all these advantages those virtues and qualities of heart and mind
which have gained for her a just and universal consideration, we take the
highest satisfaction in proclaiming her succession to the title and estate of
that esteemed and honored lady, her cousin, Marie Anne de Mailly, and we
hereby invest her with the Duchy of Châteauroux, together with all its
appurtenances and dependencies, situated in Berry,"*
* This form is taken from the letters-patent used in the case of Marie
Anne de Mailly.
Deborah, having finished the perusal of this document, let it float from
her fingers to the floor, while she stood perfectly still, staring at the face of
the man seated before her. Her expression, first of amazement, then of
horror, was changing now to something puzzled and undecided, which the
King beheld with relief.
"Madame," he observed, "you should thank me. I make you first lady of
the Court. I give you title, wealth, power. I place a Queen below you in my
own esteem. I give you ministers to command, no one to obey. I make your
antechamber a room more frequented than my own cabinet. I leave it for
you, if you wish it, to rule France. And what is it that I ask in return?
Nothing! Nothing that your own generosity will not grant without the asking.
Think of what you are, and of what you will become. Have you, then, no
word in which to thank me?"
He also had risen now, and was looking at her, as she stood, with a
mixture of curiosity, admiration, and impatience.
Deborah was still—so still that she might have been taken for a man-
made thing. And by the expression of her face Louis knew that he must not
speak more now. She was fighting her battle; his forces must win or lose as
they stood, augmented no further. Before her had risen the picture of two
lives, the one that was opening to her and the one that she had thought to
live. As she thought, the real life, for a little, grew dim, distant, unimportant.
The other, with its scarce imaginable power, glory, position, became clearer
and still more clear till she could see into its inmost depths. Adulation,
pleasure, riches, ease, universal sway, a court at her feet, a King to bar
malice from her door, an existence of beauty, culture, laughter, light,
founded on—what? ending—how? Yes, these questions came, inevitably. To
answer the first, she looked slowly over the man before her, as he stood in all
the beauty of his young manhood and majesty. Nevertheless, through that
beauty his true nature was readable, showing plainly through his eyes, in the
expression of his heavy lower lip, in his too weak chin—that sullen, morose,
pettish, carnal, warped nature, best fitted for the peasant's hut, destined by
Fate, lover of grim comedy, for the greatest palace of earth. This man, who
had no place in her soul-life, must build her pedestal, must place her thereon.
And the end of all—when end should come—ah! Now Deborah saw again
the bed of Marie Anne de Châteauroux, with the Duchess upon it, as she had
lain there for the last time. And Marie Anne de Mailly had been Claude's
cousin—Claude's—
Then she turned upon him with that which for the moment she had let lie
dormant in her heart, now all awake and quivering with life—her love for
Claude. It was, perhaps, God, who was helping as she asked.
"I am saying that I refuse to listen any more to your insults. I am saying
that I am ashamed—utterly ashamed—that you should so have thought of
me that you dare offer them. I am not Duchess of Châteauroux!" She placed
her foot on the fallen paper, and stammered over the French words as she
spoke, for she was thinking in English now. "God save me from it! I am no
lady of the palace of the Queen—I am not of Versailles, nor of France. I owe
allegiance to no French King. I come from a country that is true and sweet
and pure, where they hate and despise your French ways, your unholy
customs, your laws, your manners, your dishonoring of honest things, your
treatment of women. I am honest. I hate myself for having lived among you
for months as I have done. I am going away, I will leave here, this place, to-
night. If my—my husband will not take me—I shall go back alone, by the
way I came, to my country, where the men, if they are awkward, are upright,
if the women have not etiquette, they are pure.—Let me go!—Let me go!"
"'I AM NOT THE DUCHESS OF CHATEAUROUX'"
Louis, in a sudden access of fury, had sprung forward and seized her by
the wrists. Deborah's temper was fully roused at last; her blood poured hotly
through her veins. Her life had become a little thing in comparison to the
laws for which she was speaking, the sense of right which seemed to hold no
part in this French order of things. Bracing herself as she might in her high-
heeled slippers, she suddenly threw all her weight forward against the man,
taking him off his guard, and so forcing him back that he was obliged to
loosen his hold of her in order to regain equilibrium. The instant that she was
free Deborah turned and fled to the door. She flung herself bodily against it.
It was locked from the outside.
Deborah looked into the uplifted face of the King. Certainly it was
marvellously handsome—beautiful enough to have turned the heads of many
women. Perhaps, after all, there was excuse for those poor creatures, the
three sisters, who had yielded to him. Perhaps, after all, pity was their only
just measure. But she—Deborah Travis—had known handsome faces before.
Indeed, she had come near to life-long unhappiness through that which she
had known best. Suddenly, as in a picture, she beheld there, beside the King,
the head of Charles Fairfield. Yes, Louis was the finer-featured of the two.
Nevertheless, all temptation was gone.
"Monsieur le Roi," she said, clearly, and with a kind of cynicism even
through her nervousness, "you are too late. I have been courted before, and
I've plighted my troth and given my heart into some one's keeping. You are
too late."
"Leaves to-night!" A dark flush spread over Deborah's face. "Leaves to-
night! Mon Dieu! When—where—how? Oh, I will go now! You shall let me
go to him, do you hear? At once! Why, I shall be left here alone! I—I—shall
be like Mme. de Coigny. Your Majesty—" suddenly she grew calm, and her
voice gently sweet—"Your Majesty, let me go."
"Open it, then, or—there is another!" she pointed across the room to the
door in the opposite wall which led into the royal suite.
The King moved about quickly, placing himself in front of it. The act
was sufficient. It showed Deborah that she had neither pity nor mercy to
hope for, nothing but her own determination on which to depend. And, as the
knowledge of helplessness became more certain, so did her will become
stronger, her brain more alert. She looked about the room. Was there a
weapon of defence or of attack anywhere within reach? On the supper-table
were knives and forks of gold—dull, useless things. On one side of the room
was a great clock; on the mantel stood another. There were also stiff chairs,
tabourets, an escritoire, and the table—these were all. What to do? She must
get home, get to Claude, as rapidly as possible. Would he be there? Would he
have trusted and waited for her? If not—what? She would not think of that
now. She must first escape through that unlocked door guarded by the King.
How to do it? Strategy, perhaps.
Deborah gave a slight, pretty smile. "I have only decided that I should
like to finish Mouthier's comfits. We have not even touched the cream," she
said, coquettishly.
"Louis," she said, suddenly, looking at him with a significant smile and
eyes half closed, "pick up for me the paper that I dropped upon the floor. I—
have not finished reading it."
The King was enchanted. She was surrendering at last. If she chose to
make it easier for her vanity by treating him like a servant—why, he was
willing. He rose at once and went back to the spot where Maurepas'
document had fallen and been spurned by Deborah's heel. He stooped to pick
it up. There was a crisp rustle of stiff, silk petticoats. He looked up just in
time to behold his prize fling open the north door and hurry through it into
the room beyond. This was the King's bedroom, and in it, at this hour, were
only Bachelier, Levet, and two under-footmen. These four, in open-mouthed
amazement, beheld the flying figure of a lady burst in from the Salle des
Pendules, run across the royal room, and escape into the council-chamber,
just as the King, purple with anger, shouted from the doorway: "Beasts!
Fools! Idiots! Could you not hold her?"
"No, imbecile! Should the King's valet be seen chasing a woman through
the corridors of Versailles at midnight? Ah! It is abominable!"
"Henri, two hundred thousand is too much for the estate. The château is
impossible—you are giving me money. I'll not have it—"
"Ah! She has not come—she does not come—she does not come! I shall
go mad. I shall shoot myself if she does not return! Mon Dieu!—Mon Dieu!"
"Claude, be calm. There is time. She could not yet have got away. Be
calm. She will come, of course."
Henri spoke soothingly, but, as the minutes passed, and still Deborah
delayed, his heart sank. What to do with his cousin? Claude would, in a little
time, be actually unbalanced, he feared.
Claude made a quick dash for the table, on which, amid a pile of varied
articles, were his duelling pistols. He picked one of them up. Henri sprang
from his place and seized his cousin round the shoulders.
"Idiot!—Put it down!—Stop!"
Claude was struggling to free himself from the grasp. The strength of a
madman seemed to be in his arms. Henri felt his hold weakening. He was
being repulsed.
"Mordi! you shall not!" growled Claude, furiously. "I tell you she is not
coming! I will kill myself! Let me—let me go!"
The weapon clattered to the floor. Claude held out both arms, and
Deborah, dazed, weary, utterly happy, went into them and was clasped close
to his heart.
"Claude—we must go away," she whispered, her lips close to his ear.
"Where—where—Claude?"
"I have no longer a country, my wife. But I know that which is there for
us over the sea—that wherein I found you first."
Deborah gave a little sob of relief; and, as her lips met those of her
husband, Henri de Mailly, who had kept him for her, sharply turned away.
EPILOGUE
THE END
*** END OF THE PROJECT GUTENBERG EBOOK THE HOUSE
OF DE MAILLY ***
Updated editions will replace the previous one—the old editions will
be renamed.