Student: Kyle Hoang Date: 04/15/22 Instructor: Larissa Williamson Course: MAS3114-Assignment: M29 (HW) Orthonormal

4/15/22, 1:16 PM M29(HW) Orthonormal Sets & Projections (6.2, 6.
3)-Kyle Hoang
Instructor: Larissa Williamson

Student: Kyle Hoang Course: MAS3114- Assignment: M29(HW) Orthonormal
Date: 04/15/22 1888,0329(15272,28798) - Computatnl Sets & Projections (6.2, 6.3)
Linear Alg
Determine whether the set of vectors is orthonormal. If the set A set u1 ,...,up is an orthonormal set if it is an orthogonal set
is onlyorthogonal, normalize the vectors to produce an of unit vectors.
orthonormal set.
First, determine if the set of vectors is an orthogonal set. A set
1 of vectors u1 ,...,up in ℝn is said to be an orthogonal set if
1
3 each pair of distinct vectors from the set isorthogonal, thatis,
4
if ui • uj = 0 whenever i ≠ j.
2
u1 = − and u2 = 0
3 The only pair of distinct vectors is u1 ,u2 . Find u1 • u2 .
1
1
− 4 1 1
3
u1 • u2 = +0+ − =0
12 12
Because u1 • u2 = 0, the set is an orthogonal set.
Now determine if the vectors in the set are unit vectors. A unit
vector has length 1.
Find u1 = u1 • u1 to determine if u1 is a unit vector.
2
u1 • u1 =
3
In a similarmanner, find u2 • u2 .
1
u2 • u2 =
2 2
Since the lengths are not equal to1, the vectors are not unit
vectors.
Thus, the set is not an orthonormal set.
Since the set is onlyorthogonal, normalize the vectors to

produce an orthonormal set.
1
To normalize a vector v, find v.
v
1 2
Find u1 . Recall that u1 = .
u1 3
1
3
1 1 2
u1 = −
u1 2 3
3 1
−
3
1
6
https://xlitemprod.pearsoncmg.com/api/v1/print/highered 1/2
4/15/22, 1:16 PM M29(HW) Orthonormal Sets & Projections (6.2, 6.3)-Kyle Hoang
6
1 2
u1 = −
u1 6
1
−
6
1
Find u2 .
u2
1
4
1 1
u2 = 0
u2 1
2 2 1
4
1
2
1
u2 = 0
u2
1
2
The normalized vectors are shown below.
1
1
6
2
2
− and 0
6
1
1
− 2
6

Linear Alg
Determine whether the set of vectors is orthonormal. If the set is onlyorthogonal, normalize the vectors to produce an
orthonormal set.
0 0
u1 = 0 , u2 = 0
− 11 11
A set u1 ,...,up is an orthonormal set if it is an orthogonal set of unit vectors.
First, determine if the set of vectors is an orthogonal set. A set of vectors u1 ,...,up in ℝn is said to be an orthogonal set if
each pair of distinct vectors from the set isorthogonal, thatis, if ui • uj = 0 whenever i ≠ j.
The only pair of distinct vectors is u1 ,u2 . Compute u1 • u2 .
u1 • u2 = − 121
The set is not an orthogonal set because u1 • u2 ≠ 0.
The given set cannot be an orthonormal set because the set of vectors is not orthogonal.
Therefore, u1 and u2 are not orthogonal.

Linear Alg
Determine if the set of vectors is orthonormal. If the set is onlyorthogonal, normalize the vectors to produce an orthonormal set.
0.8 − 0.6
u= , v =
− 0.6 − 0.8
A set of vectors u1 , . . . ,up is an orthonormal set if it is an orthogonal set of unit vectors. A set of vectors is an orthogonal set
if each pair of distinct vectors from the set isorthogonal, thatis, if ui • uj = 0 whenever i ≠ j.
The only pair of distinct vectors is {u,v}.

n
Now determine if the pair of vectors is orthogonal. Two vectors u and v in are orthogonal if u • v = 0.
Find the inner product of the pair of distinct vectors. Calculate u • v.
− 0.6
u•v= 0.8 − 0.6 Substitute the values for the product.
− 0.8
= (0.8)( − 0.6) + ( − 0.6)( − 0.8) Find the inner product.
=0 Simplify.
Thus, u • v = 0. This means the pair of vectors is orthogonal.
Now determine if the vectors are unit vectors. If a vector is a unitvector, then ui • ui = 1.
First, determine if u is a unit vector.
u • u = (0.8)(0.8) + ( − 0.6)( − 0.6)

= 1
Next determine if v is a unit vector.
v • v = ( − 0.6)( − 0.6) + ( − 0.8)( − 0.8)

= 1
Thus, u and v are unit vectors.
Thus, {u,v} is an orthonormal set.

Linear Alg
Determine whether the set of vectors is orthonormal. If the set is onlyorthogonal, normalize the vectors to produce an
orthonormal set.
1 17
0
290 290
1
17 1 −
u1 = , u2 = − , u3 = 2
580 580
1
17 1
− 2
580 580
A set u1 ,...,up is an orthonormal set if it is an orthogonal set of unit vectors.
First, determine if the set of vectors is an orthogonal set. A set of vectors u1 ,...,up in ℝn is said to be an orthogonal set if
each pair of distinct vectors from the set isorthogonal, thatis, if ui • uj = 0 whenever i ≠ j.
Compute u1 • u2 .
17 17 17
u1 • u2 = − − =0
290 580 580
Compute u1 • u3 .
17 17
u1 • u3 = 0 − + =0
1160 1160
Compute u2 • u3 .
1 1
u2 • u3 = 0 + − =0
1160 1160
The set is an orthogonal set because each of the products is equal to zero.
The given set can be an orthonormal set because the set of vectors is orthogonal.
Now, to see if this is an orthonormalset, determine if the vectors in the set are unit vectors.
Compute u1 • u1 .
1 289 289
u1 • u1 = + + =1
290 580 580
Compute u2 • u2 .
289 1 1
u2 • u2 = + + =1
290 580 580
Compute u3 • u3 .
1 1
u3 • u3 = 0 + + =1
2 2
Each of the vectors are unit vectors because each of theproducts, u1 • u1 , u2 • u2 and u3 • u3 , are equal to one.
Therefore, u1 , u2 , u3 is an orthonormal set because the given set of vectors is an orthogonal set of unit vectors.

Linear Alg
5. Determine whether each of the following statements are true orfalse, where all the vectors are in ℝn . Justify each answer.
Complete parts(a) through(e).
a. Not every linearly independent set in ℝn is an orthogonal set.
A. False. Forexample, in every linearly independent set of two vectors in ℝ2 , one vector is a
multiple of theother, so the vectors cannot be orthogonal.
B. 1 1
True. Forexample, the vectors and are linearly independent but not orthogonal.
−1 1
C. 0 1
True. Forexample, the vectors and are linearly independent but not orthogonal.
1 1
D. False. Every orthogonal set is linearly independent.
b. If y is a linear combination of nonzero vectors from an orthogonalset, then the weights in the linear combination can be
computed without row operations on a matrix.
A. True. For each y inW, the weights in the linear combination y = c1 u1 + • • • + cp up can be
y • uj
computed by cj = , where j = 1, . . ., p.
y•y
B. False. The weights in any linear combination can only be computed using row operations.
C. False. The weights in a linear combination can only be computed without row operations on a
matrix if one of the vectors is the zero vector.
D. True. For each y inW, the weights in the linear combination y = c1 u1 + • • • + cp up can be
y • uj
computed by cj = , where j = 1, . . ., p.
uj • uj
c. If the vectors in an orthogonal set of nonzero vectors arenormalized, then some of the new vectors may not be
orthogonal.
A. True. If the original vectors have differentlengths, then when they arenormalized, they will be
multiplied by different scalars and their inner product will no longer be 0.
B. False. The normalization process makes the vectorsorthonormal, but not necessarily
orthogonal.
C. True. Any time an orthogonal set of vectors is normalized then the new set is not orthogonal.
D. False. Normalization changes all nonzero vectors to have unitlength, but does not change their
relative angles.Therefore, orthogonal vectors will always remain orthogonal after they are
normalized.
d. A matrix with orthonormal columns is an orthogonal matrix.
A. False. A matrix with orthonormal columns is an orthogonal matrix if the matrix is also square.
B. True. All matrices with orthonormal rows and columns are orthogonal matrices.
C. False. A matrix with orthonormal columns is an orthogonal matrix if the matrix is not square.
D. True. All matrices with orthonormal columns are orthogonal matrices.
e. If L is a line through 0 and if y is the orthogonal projection of y ontoL, then y gives the distance from y to L.
A. True. The value of y gives the distance from y to L which is equivalent to y − y .
B. True. The value of y gives the distance from y to L and is the orthogonal projection.
C. False. The distance from y to L is given by y − y .
D. False. The distance from y to L is given by y − y .

Linear Alg
6. Assume all vectors are in ℝn . Mark each statement True or False. Justify each answer.
a. Not every orthogonal set in ℝn is linearly independent.
A. False. Every orthogonal set of nonzero vectors is linearly independent and zero vectors cannot
exist in orthogonal sets.
B. False. Orthogonal sets must be linearly independent in order to be orthogonal.
C. True. Every orthogonal set of nonzero vectors is linearlyindependent, but not every orthogonal
set is linearly independent.
D. True. Orthogonal sets with fewer than n vectors in ℝn are not linearly independent.
b. If a set S = u1 , . . . , up has the property that ui • uj = 0 whenever i ≠ j, then S is an orthonormal set.
A. True. To beorthonormal, the vectors in S must be orthogonal to each other.

B. False. To beorthonormal, the vectors in S must be unit vectors as well as being orthogonal to
each other.
C. False. To beorthonormal, S must be linearly independent of the subspace spanned by S.
D. True. Because ui • uj = 0, S is linearly independent and thus an orthonormal set.
c. If the columns of an m × n matrix A areorthonormal, then the linear mapping x↦Ax preserves lengths.
A. True. Ax ≠ x .
B. False. Ax ≠ x .
C. True. Ax = x .
D. False. Only nonzero orthonormal matrices preserve lengths.
d. The orthogonal projection of y onto v is the same as the orthogonal projection of y onto cv whenever c ≠ 0.
A. False. If c is any nonzero scalar and if v is replaced by cv in the definition of the orthogonal
projection of y onto v, then the orthogonal projection of y onto cv is c2 times the orthogonal
projection of y onto v.
B. False. If c is any nonzero scalar and if v is replaced by cv in the definition of the orthogonal
projection of y onto v, then the orthogonal projection of y onto cv is c times the orthogonal
C. False. If c is any nonzero scalar and if v is replaced by cv in the definition of the orthogonal
projection of y onto v, then the orthogonal projection of y onto cv is c times the orthogonal
D. True. If c is any nonzero scalar and if v is replaced by cv in the definition of the orthogonal
projection of y onto v, then the orthogonal projection of y onto cv is exactly the same as the
orthogonal projection of y onto v.
e. An orthogonal matrix is invertible.
A. False. Only nonzero orthogonal matrices are invertible.

B. True. An orthogonal matrix is a square invertible matrix U such that U − 1 = UT .
C.
−1
True. An orthogonal matrix is a square invertible matrix U such that U = U.
D. False. Only orthogonal matrices with orthonormal rows are invertible.

Linear Alg
7. Let U be a square matrix with orthonormal columns. Explain why U is invertible.
Which of the following is true of the columns ofU? Select all that apply.
A. They are the same as the rows of U.

B. They are linearly independent.
C. The inner product of each pair of column vectors is 0.
D. Each column vector has unit length.
Why is it true that the columns of U are linearlyindependent?
A. Orthonormal sets are linearly independent sets.

B. U has linearly independentcolumns, by assumption.
C. U is a square matrix.
D. A matrix is invertible if and only if its columns are linearly independent.
Why does this show that a square matrix U with orthonormal columns isinvertible?
A. All matrices whose columns are orthogonal are invertible.

B. All matrices whose columns are orthonormal are invertible.
C. A square matrix is invertible if and only if its columns are linearly independent.
D. A square matrix is invertible if and only if its columns are linearly dependent.

Linear Alg
8. Let U be an n × n orthogonal matrix. Show that the rows of U form an orthonormal basis of ℝn.
T
The rows of U are the columns of U .
T −1
Given U is an orthogonalmatrix, what is the relationship between U and U ?
A. UT = U − 1
B. U − 1 UT = I
C. UT U − 1 = I
D. UT = − U − 1
T
Why is ittrue, then, that U must also be an orthogonalmatrix?
A. The columns of UT must form an orthonormal basis for ℝn.
B. Since UT is the inverse ofU, U is the inverse of UT .
C. Since U is an orthogonalmatrix, U = UT .
D. UT is assumed to also be an orthogonal matrix.
T
What can be deduced from the fact that U is an orthogonalmatrix?
A. The rows of UT are orthogonal to the columns of UT .
B. The columns of UT form an orthonormal set.
C. The rows of UT are the same as the columns of UT .
D. The columns of UT form an orthogonal set in which at least one column vector does not have
unit length.
T
What else can be deduced about the columns of U ?
A. The columns of UT form a linearly dependent set.
B. At least one of the columns of UT is zero.
C. At least one of the columns of UT is in the span of the other columns.
D. The columns of UT form a linearly independent set.
T
Why can you now conclude that the columns of U are an orthonormal basis for ℝn, thereby proving that the rows of U are
n
an orthonormal basis for ℝ ?
A. The columns of UT form a linearly independent orthonormal set and are in ℝn.
B. UT is defined to have columns which form an orthonormal basis for ℝn.
C. The columns of UT form a linearly dependent orthonormal set and span ℝn.
D. The columns of UT form a linearly independent orthonormal set and span ℝn.

Linear Alg
Write v as the sum of twovectors, one in Span u1 and one in Span u2 ,u3 ,u4 . Assume that u1 ,...,u4 is an orthogonal
basis for ℝ4 .
2 6 6 6 2
6 −2 6 −6 10
u1 = , u2 = , u3 = , u4 = , v =
6 6 −6 −2 −4
6 −6 −2 6 4
Let W be a subspace of ℝn . Then each y in ℝn can be written uniquely in the form y = y + z where y is in W and z is in W . In
⊥
y • u1 y • up
fact, if u1 ,...,up is any orthogonal basis ofW, then y = u1 + ⋯ + u and z = y − y .
u1 • u1 up • up p
v • u1
Since Span u1 is an orthogonal basis for ℝ4 , there exists v and z such that v = u and z = v − v . To find v , start by
u1 • u1 1
computing v • u1 .
v • u1 = 64
Now compute u1 • u1 .
u1 • u1 = 112
v • u1 4
Thus, = .
u1 • u1 7
4
Now, find u .
7 1
8
7
24
4 7
u1 =
7 24
7
24
7
Now, use z = v − v to find z.
8 6
7 7
2 24 46
10 7 7
z= − =
−4 24 52
−
4 7 7
24 4
7 7
Thus, v can be written uniquely using v = v + z as follows.
8 6
7 7
24 46
7 7
v= +
24 52
−
7 7
24 4
7 7
Since this expression of v isunique, it can be concluded that z must exist in Span u2 ,u3 ,u4 .

Linear Alg
Verify that u1 ,u2 is an orthogonalset, and then find the orthogonal projection of y onto Span u1 ,u2 .
2 7 −3
y= 9 , u1 = 3 , u2 = 7
3 0 0
To verify that u1 ,u2 is an orthogonalset, find u1 • u2 .
u1 v1
u2 v2 T
If u and v are vectors in ℝn , with u = and v = , then u • v = u v, or u • v = u1 v1 + u2 v2 + ⋯ + un vn .
⋯ ⋯
un vn
Substitute the components of u1 and u2 into the expression for u1 • u2 .
u1 • u2 = (7)( − 3) + (3)(7) + (0)(0)
Simplify u1 • u2 .
u1 • u2 = (7)( − 3) + (3)(7) + (0)(0)

u1 • u2 = 0
Since u1 • u2 = 0, the set u1 ,u2 is orthogonal.
To find the orthogonal projection of y onto Span u1 ,u2 , recall the following. Let W be a subspace of ℝn . Then each y in ℝn
can be written uniquely in the form y = y + z where y is in W and z is in W . If u1 , ..., up is any orthogonal basis ofW, then
y • u1 y • up
y= u1 + ⋯ + u
and z = y − y . The vector y is called the orthogonal projection of y onto W. Note that W is Span u1 , ..., up .
y • u1 y • u2
To find the orthogonal projection of y onto Span u1 ,u2 , use the formula y = u1 + u .
u1 • u1 u2 • u2 2
Use this formula to find y . Begin by finding the four inner products.
y • u1 y • u2
y= u1 + u
u1 • u1 u2 • u2 2
41 57
y= u + u
58 1 58 2
Substitute for u1 and u2 and simplify the resulting expression.
7 −3
41 57
y= 3 + 7
58 58
0 0
2
y= 9
0
2
Therefore, the orthogonal projection of y onto Span u1 ,u2 is 9 .
0

Linear Alg
Let W be the subspace spanned by u1 and u2 . Write y as the sum of a vector in W and a vector orthogonal to W.
−2 1 3
y= 6 , u1 = 1 , u2 = −2
3 1 −1
Let W be a subspace of ℝn . Then each y in ℝn can be written uniquely in the form y = y + z where y is in W and z is in W . If
u1 , . . . , up is any orthogonal basis ofW, then
y • u1 y • up
y= u1 + • • • + u
and z = y − y . The vector y is called the orthogonal projection of y onto W.
y • u1 y • u2
To find y , use the formula y = u1 + u .
u1 • u1 u2 • u2 2
Use this formula to find y . Begin by finding the four inner products.
y • u1 y • u2
y= u1 + u
u1 • u1 u2 • u2 2
7 − 21
y= u1 + u2
3 14
Substitute for u1 and u2 and simplify the resulting expression.
1 3
7 − 21
y= 1 + −2
3 14
1 −1
13
−
6
16
y=
3
23
6
13
−
6
16
Therefore, y = . To find z, calculate z = y − y .
3
23
6
Compute z = y − y .
z=y−y
13 1
−
6 6
−2
16 2
z= 6 − =
3 3
3
23 5
−
6 6
13 1
−
6 6
16 2
Note that y = is in W and z = is in W .
3 3
23 5
−
6 6
13 1
−
6 6
16 2
Since y = y + z, y = + .
3 3
23 5
−
6 6

Linear Alg
Let W be a subspace spanned by the u's, and write y as the sum of a vector in W and a vector orthogonal to W.
4 1 −1 −1
3 1 6 0
y= , u1 = , u2 = , u3 =
3 0 4 1
−1 1 −5 1
To use the Orthogonal DecompositionTheorem, {u1 , u2 , u3 } must form an orthogonal basis of W.
Since it is given that {u1 , u2 , u3 } spansW, it is only necessary to show that {u1 , u2 , u3 } is a linearly independent and
orthogonal set.
Recall that if S = {u1 , u2 , ..., up } is an orthogonal set of nonzero vectors in ℝn , then S is linearly independent and is a basis for
the subspace spanned by S.
For {u1 , u2 , u3 } to be an orthogonalset, the inner products of each pair of elements must equal 0.
Compute the appropriate inner products. Start with u1 • u2 .
u1 • u2 = 1 • ( − 1) + 1 • 6 + 0 • 4 + 1 • ( − 5) = 0
Now, find u1 • u3 .
u1 • u3 = 1 • ( − 1) + 1 • 0 + 0 • 1 + 1 • 1 = 0
Finally, find u2 • u3 .
u2 • u3 = − 1 • ( − 1) + 6 • 0 + 4 • 1 − 5 • 1 = 0
Since u1 • u2 = u1 • u3 = u2 • u3 = 0, all inner products are 0 and the set {u1 , u2 , u3 } is orthogonal.Thus, {u1 , u2 , u3 } is an
orthogonal basis of W.
Now, apply the Orthogonal DecompositionTheorem, shown below.
Let W be a subspace of ℝn . Then each y in ℝn can be written uniquely in the form y = y + z where y is in W and z is in W . In
⊥
y • u1 y • up
fact, if u1 ,...,up is any orthogonal basis ofW, then y = u1 + ⋯ + u and z = y − y .
y • u1 y • u2 y • u3 y • u1
So, there exists y and z such that y = u1 + u2 + u3 and z = y − y . To find y , start by computing .
u1 • u1 u2 • u2 u3 • u3 u1 • u1
Find y • u1 .
y • u1 = 6
Now, find u1 • u1 .
u1 • u1 = 3
y • u1
Thus, = 2.
u1 • u1
y • u2 y • u3
Now, compute and similarly.
u2 • u2 u3 • u3
y • u2 31 y • u3 2
= and =−
u2 • u2 78 u3 • u3 3
1 −1 −1
1 31 6 2 0
So, y = (2) + + − .
0 78 4 3 1
1 −5 1
Multiply and add to find y .
59
26
57
13
y=
12
13
17
−
26
Now, use z = y − y to find z.
59 45
26 26
4 57 18
−
3 13 13
z= − =
3 12 27
−1 13 13
17 9
− −
26 26
⊥
Thus, y can be written uniquely using y = y + z asfollows, where y is in W and z is in W .
59 45
26 26
57 18
−
13 13
y= +
12 27
13 13
17 9
− −
26 26

Student: Kyle Hoang Date: 04/15/22 Instructor: Larissa Williamson Course: MAS3114-Assignment: M29 (HW) Orthonormal

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Student: Kyle Hoang Date: 04/15/22 Instructor: Larissa Williamson Course: MAS3114-Assignment: M29 (HW) Orthonormal

Uploaded by

Copyright:

Available Formats

4/15/22, 1:16 PM M29(HW) Orthonormal Sets & Projections (6.2, 6.

Instructor: Larissa Williamson

Because u1 • u2 = ​0, the set is an orthogonal set.

Find u1 = u1 • u1 to determine if u1 is a unit vector.

Thus, the set is not an orthonormal set.

Since the set is only​orthogonal, normalize the vectors to

The normalized vectors are shown below.

Instructor: Larissa Williamson

A set u1 ,...,up is an orthonormal set if it is an orthogonal set of unit vectors.

The only pair of distinct vectors is u1 ,u2 . Compute u1 • u2 .

The set is not an orthogonal set because u1 • u2 ≠ 0.

Therefore, u1 and u2 are not orthogonal.

Instructor: Larissa Williamson

The only pair of distinct vectors is {u,v}.

Find the inner product of the pair of distinct vectors. Calculate u • v.

Thus, u • v = 0. This means the pair of vectors is orthogonal.

First, determine if u is a unit vector.

u • u = (0.8)(0.8) + ( − 0.6)( − 0.6)

Next determine if v is a unit vector.

v • v = ( − 0.6)( − 0.6) + ( − 0.8)( − 0.8)

Thus, u and v are unit vectors.

Thus, {u,v} is an orthonormal set.

Instructor: Larissa Williamson

A set u1 ,...,up is an orthonormal set if it is an orthogonal set of unit vectors.

Instructor: Larissa Williamson

a. Not every linearly independent set in ℝn is an orthogonal set.

D. False. Every orthogonal set is linearly independent.

d. A matrix with orthonormal columns is an orthogonal matrix.

A. True. The value of y gives the distance from y to L which is equivalent to y − y .

C. False. The distance from y to L is given by y − y .

D. False. The distance from y to L is given by y − y .

Instructor: Larissa Williamson

a. Not every orthogonal set in ℝn is linearly independent.

A. True. To be​orthonormal, the vectors in S must be orthogonal to each other.

e. An orthogonal matrix is invertible.

A. False. Only nonzero orthogonal matrices are invertible.

Instructor: Larissa Williamson

7. Let U be a square matrix with orthonormal columns. Explain why U is invertible.

A. They are the same as the rows of U.

Why is it true that the columns of U are linearly​independent?

A. Orthonormal sets are linearly independent sets.

A. All matrices whose columns are orthogonal are invertible.

Instructor: Larissa Williamson

A. The columns of UT must form an orthonormal basis for ℝn.

B. Since UT is the inverse of​U, U is the inverse of UT .

D. UT is assumed to also be an orthogonal matrix.

A. The rows of UT are orthogonal to the columns of UT .

B. The columns of UT form an orthonormal set.

C. The rows of UT are the same as the columns of UT .

A. The columns of UT form a linearly dependent set.

B. At least one of the columns of UT is zero.

C. At least one of the columns of UT is in the span of the other columns.

D. The columns of UT form a linearly independent set.

B. UT is defined to have columns which form an orthonormal basis for ℝn.

Instructor: Larissa Williamson

Now, use z = v − v to find z.

Thus, v can be written uniquely using v = v + z as follows.

Instructor: Larissa Williamson

To verify that u1 ,u2 is an orthogonal​set, find u1 • u2 .

Substitute the components of u1 and u2 into the expression for u1 • u2 .

u1 • u2 = (7)( − 3) + (3)(7) + (0)(0)

u1 • u2 = (7)( − 3) + (3)(7) + (0)(0)

Since u1 • u2 = ​0, the set u1 ,u2 is orthogonal.

Because u1 • u2 = 0, the set is an orthogonal set.

Since the set is onlyorthogonal, normalize the vectors to

A. True. To beorthonormal, the vectors in S must be orthogonal to each other.

Why is it true that the columns of U are linearlyindependent?

B. Since UT is the inverse ofU, U is the inverse of UT .

To verify that u1 ,u2 is an orthogonalset, find u1 • u2 .

Since u1 • u2 = 0, the set u1 ,u2 is orthogonal.

To use the Orthogonal DecompositionTheorem, {u1 , u2 , u3 } must form an orthogonal basis of W.

Now, apply the Orthogonal DecompositionTheorem, shown below.