MA1513 Tutorial 2 T03

MA1513 Tutorial 2
Clifton NG Wei Zhi

cnwz@nus.edu.sg
22 August 2022
Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 1 / 48

Outline
1 Review
2 Tutorial Problems

Review
Outline
1 Review
2 Tutorial Problems

Review
Topics Covered Last Week
Chapter 1: Linear System and Matrix Algebra

1.6 Matrix Inverses II
1.7 Determinants of Matrices
1.8 Ranks of Matrices
Chapter 2: Vector Spaces
2.1 Vectors in n-space
2.2 Linear Combination and Linear Span

Review
Important!
Finding the inverse of invertible/non-singular A:
R R R R R R
1
If A −→ 2
−→ k
· · · −→ 1
I, then I −→ 2
−→ k
· · · −→ A−1 .
The inverse of an invertible/non-singular matrix can be found using
GJE.
Determining whether A is invertible/non-singular or not:
If the RREF of A is I, then A is invertible/non-singular.
If any REF of A has a zero row, then A is non-invertible/singular.
Matrix operations on invertible/non-singular matrices:
(A−1 )−1 = A
(AT )−1 = (A−1 )T
(cA)−1 = c1 A−1
(AB)−1 = B−1 A−1

Review
Important!
If A is invertible/non-singular, then
the linear system has exactly one solution given by x = A−1 b
the homogeneous linear system has only the trivial solution x = 0
If A is non-invertible/singular, then
the linear system has either no solution or infinitely many solutions
the homogeneous linear system has both the trivial solution and
non-trivial solutions

Review
Important!
The determinant of an n × n matrix can be computed inductively by
expanding it as the alternating sum of its (n − 1) × (n − 1)
submatrices.
Determinant and invertibility/singularity:
If det(A) 6= 0, then A is invertible/non-singular.
If det(A) = 0, then A is non-invertible/singular.
Determinants of triangular matrices:
If A is a triangular matrix, then det(A) = a11 a22 · · · ann .
Determinants of matrices with two identical rows or columns:
If A has two identical rows, then det(A) = 0.
If A has two identical columns, then det(A) = 0.

Review
Important!
Determinant and elementary row operations:
icR
A −−→ B: det(B) = c · det(A)
Ri ↔Rj
A −−−−→ B: det(B) = −det(A)
Ri +cRj
A −−−−→ B: det(B) = det(A)
Determinant and matrix operations:
det(cA) = c n · det(A)
det(AB) = det(A)det(B)
det(AT ) = det(A)
det(A−1 ) = det(A)
1
det(A + B) 6= det(A) + det(B)

Review
1.8 Ranks of Matrices
Important!
rank(A) = number of non-zero rows in REF
= number of leading entries in REF
= number of pivot columns in REF
rank of m × n matrix ≤ min{m, n} (matrix is full rank when equality
is attained)
n × n square matrix is full rank
⇔ rank(A) = n
⇔ RREF is I
⇔ A is invertible/non-singular
⇔ det(A) 6= 0

Review
n-vector:
u = (u1 , u2 , . . . , un )
Row vector:
u1 u2 · · · un
Column vector:  
u1
u2 
 
 .. 
.
un
n-space:
{(u1 , u2 , . . . , un ) | u1 , u2 , . . . , un ∈ R}

Review
Important!
Vector operations:
Vector addition: u + v
Vector subtraction: u − v
Scalar multiplication: cu
Negative of vector: −u

Review

Dot product of u = (u1 , u2 , . . . , un ) and v = (v1 , v2 , . . . , vn ):
u · v = u1 v1 + u2 v2 + · · · + un vn
Length of u: √
||u|| = u·u
Distance between u and v:
p
||u − v|| = (u − v) · (u − v)
Angle θ between u and v:

−1 u·v
θ = cos
||u|| ||v||
Orthogonal vectors u and v:
u·v=0
Review
Linear combination of u1 , u2 , . . . , uk :
c1 u1 + c2 u2 + · · · + ck uk
Here,
u1 , u2 , . . . , uk ∈ Rn
c1 , c2 , . . . , ck ∈ R
Linear span of u1 , u2 , . . . , uk :
span{u1 , u2 , . . . , uk } = {c1 u1 + c2 u2 + · · · + ck uk | c1 , c2 , . . . , ck ∈ R}

Review

Standard form:


 a11 x1 + a12 x2 + · · · + a1n xn = b1
 a21 x1 + a22 x2 + · · · + a2n xn = b2

..


 .
am1 x1 + am2 x2 + · · · + amn xn = bm

Vector equation form:

       
a11 a12 a1n b1
 a21   a22   a2n   b2 
x1  .  + x2  .  + · · · + xn  .  =  . 
       
.
 .  .
 .   .   .. 
.
am1 am2 amn bm
x1 a1 + x2 a2 + · · · + xn an = b

Review
Important!
Every vector in Rn can be expressed as a linear combination of its
standard basis vectors e1 , e2 , . . . , en .
A vector may be expressed as a linear combination of a fixed set of
vectors in more than one way.
Geometric representation of linear spans (R2 and R3 ):
span{u}: line that is parallel to u and contains the origin
span{u, v}: plane that contains u, v and the origin

Tutorial Problems
Outline
1 Review
2 Tutorial Problems

Tutorial Problems
Problem 1
A manufacturer makes three types of chairs A, B, C. The company has

available 260 units of wood, 60 units of upholstery and 240 units of labor.
The manufacturer wants a production schedule that uses all of these
resources. The various products require the following amounts of
resources.
A B C
Wood 4 4 3
Upholstery 0 1 2
Labor 2 4 5

Tutorial Problems
Problem 1
(a) Find the inverse of the data matrix above and hence determine how
many pieces of each product should be manufactured.

Tutorial Problems
Problem 1
Solution
 
4 4 3 1 0 0
 0 1 2 0 1 0 
2 4 5 0 0 1

Tutorial Problems
Problem 1
Solution
1 0 0 32 4 − 52
   
4 4 3 1 0 0
 0 1 2 0 1 0  −G .J.E . 
−−−→ 0 1 0 −2 −7 4 
2 4 5 0 0 1 0 0 1 1 4 −2

Tutorial Problems
Problem 1
Solution
1 0 0 32 4 − 52
   
4 4 3 1 0 0
 0 1 2 0 1 0  − G .J.E . 
−−−→ 0 1 0 −2 −7 4 
2 4 5 0 0 1 0 0 1 1 4 −2
 3
4 − 25

2
The inverse of the data matrix is −2 −7 4 .
1 4 −2

Tutorial Problems
Problem 1
Let x1 , x2 , x3 denote the number of chairs of type A, B, C

manufactured respectively.

Tutorial Problems
Problem 1

manufactured respectively. Then
    
4 4 3 x1 260
0 1 2 x2  =  60  .
2 4 5 x3 240

Tutorial Problems
Problem 1

manufactured respectively. Then
    
4 4 3 x1 260
0 1 2 x2  =  60  .
2 4 5 x3 240
Hence    3
4 − 25
   
x1 2 260 30
x2  = −2 −7 4   60  = 20 ,
x3 1 4 −2 240 20
i.e. 30 chairs of type A, 20 chairs of type B and 20 chairs of type C
should be manufactured.

Tutorial Problems
Problem 1
(b) If the amount of wood is increased by 10 units, how will this change
the number of type C chairs produced?

Tutorial Problems
Problem 1
(b) If the amount of wood is increased by 10 units, how will this change
the number of type C chairs produced?
Solution
The number of type C chairs produced will increase by 10.

Tutorial Problems
Problem 2
(MATLAB) A horizontal elastic beam is supported at each end and is

subjected to forces f1 , f2 , f3 , f4 (in newton) at four points as shown in the
diagram, with amount of deflection y1 , y2 , y3 , y4 (in cm) respectively.

Tutorial Problems
Problem 2
   
f1 y1
f2  y2 
f3  and y = y3 .
Let f =    
f4 y4
By Hook’s law from physics, we know the forces and deflections are
related by the following matrix equation:
y = Df
where D is a 4 × 4 matrix known as a flexibility matrix. The inverse D−1
of this matrix is called the stiffness matrix.
Suppose the flexibility matrix is given by
 
0.0040 0.0030 0.0010 0.0005
0.0030 0.0050 0.0030 0.0010
D= 0.0010

0.0030 0.0050 0.0030
0.0005 0.0010 0.0030 0.0040
Tutorial Problems
Problem 2
(a) If forces of 10, 20, 30 and 10 newton are applied at the four points
correspondingly, find the respective deflections at these points.

Tutorial Problems
Problem 2
Solution
>> format rat
>> D = [0.0040 0.0030 0.0010 0.0005; 0.0030 0.0050
0.0030 0.0010; 0.0010 0.0030 0.0050 0.0030; 0.0005
0.0010 0.0030 0.0040];
>> f = [10; 20; 30; 10];
>> D*f

Tutorial Problems
Problem 2
Solution
>> format rat
>> D = [0.0040 0.0030 0.0010 0.0005; 0.0030 0.0050
0.0030 0.0010; 0.0010 0.0030 0.0050 0.0030; 0.0005
0.0010 0.0030 0.0040];
>> f = [10; 20; 30; 10];
>> D*f
ans =
27/200
23/100
1/4
31/200
Tutorial Problems
Problem 2
(b) Suppose measurements at the four points show deflections of 0.08,

0.12, 0.16 and 0.12 cm. Determine the forces at the four points.

Tutorial Problems
Problem 2

Solution
>> y = [0.08; 0.12; 0.16; 0.12];
>> inv(D)*y

Tutorial Problems
Problem 2

Solution
>> y = [0.08; 0.12; 0.16; 0.12];
>> inv(D)*y
ans =
12
3/2
43/2
12

Tutorial Problems
Problem 2
(c) Determine the forces that produce a deflection of 0.1 cm at the first
point on the beam, with zero deflections at the other three points.
How is the answer related to the columns of D−1 ?

Tutorial Problems
Problem 2
Solution
>> z = [0.1; 0; 0; 0];
>> inv(D)*z

Tutorial Problems
Problem 2
Solution
>> z = [0.1; 0; 0; 0];
>> inv(D)*z
ans =
160/3
-130/3
70/3
-40/3

Tutorial Problems
Problem 2
>> inv(D)

Tutorial Problems
Problem 2
>> inv(D)
ans =
1600/3 -1300/3 700/3 -400/3
-1300/3 4175/6 -2825/6 700/3
700/3 -2825/6 4175/6 -1300/3
-400/3 700/3 -1300/3 1600/3

Tutorial Problems
Problem 2
>> inv(D)
ans =
1600/3 -1300/3 700/3 -400/3
-1300/3 4175/6 -2825/6 700/3
700/3 -2825/6 4175/6 -1300/3
-400/3 700/3 -1300/3 1600/3
The forces are 0.1 times the entries in the first column of D−1 .

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4
(a) Find the determinant of each of the above matrices.

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4

Solution
4 1 2 1 2 4
det(A) = (−1) −3 + (−4) = 0.
2 −9 −4 −9 −4 2

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4

Solution
4 1 2 1 2 4
det(A) = (−1) −3 + (−4) = 0.
2 −9 −4 −9 −4 2
2 −1
det(B) = 2 − 0 + 0 = 6.
−1 2

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4

Solution
4 1 2 1 2 4
det(A) = (−1) −3 + (−4) = 0.
2 −9 −4 −9 −4 2
2 −1
det(B) = 2 − 0 + 0 = 6.
−1 2
2 0 0 1 2 0
det(C) = 1 2 3 0 −0+0−1 1 2 3 = 24.
2 3 4 1 2 3
Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4
(b) (MATLAB) Use MATLAB command det to check your answers in

(a).

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4
(b) (MATLAB) Use MATLAB command det to check your answers in

(a).
Solution
>> A = [-1 3 -4; 2 4 1; -4 2 -9];
>> det(A)
>> B = [2 0 1; 0 2 -1; 0 -1 2];
>> det(B)
>> C = [1 0 0 1; 1 2 0 0; 1 2 3 0; 1 2 3 4];
>> det(C)
Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4
(c) Which matrices above are non-singular?

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4

Solution
Since det(A) = 0, A is singular.

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4

Solution
Since det(B) = 6 6= 0, B is non-singular.

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4

Solution
Since det(B) = 6 6= 0, B is non-singular.
Since det(C) = 24 6= 0, C is non-singular.

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4
(d) Without any further computation, can you tell whether AB and CCT
are singular?

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4
are singular?
Solution
Since det(AB) = det(A) × det(B) = 0 × 6 = 0, AB is singular.

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4
are singular?
Solution
Since det(AB) = det(A) × det(B) = 0 × 6 = 0, AB is singular.
Since det(CCT ) = det(C) × det(CT ) = 24 × 24 6= 0, CCT is
non-singular.

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4
(e) Without performing Gaussian Elimination, can you tell whether the
homogeneous systems ABx = 0 and CCT x = 0 have non-trivial
solutions? Why?

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4
solutions? Why?
Solution
Since AB is singular, ABx = 0 has non-trivial solutions.

Tutorial Problems
Problem 3
 
    1 0 0 1
−1 3 −4 2 0 1 1 2 0 0
A =  2 4 1  , B = 0 2 −1 , C = 
1
.
2 3 0
−4 2 −9 0 −1 2
1 2 3 4
solutions? Why?
Solution
Since AB is singular, ABx = 0 has non-trivial solutions.
Since CCT is non-singular, CCT x = 0 does not have non-trivial
solutions.
Tutorial Problems
Problem 4
 
1 2 0  
0 2 1 4 1 2  
1 1
4 1 4 5 8
 2 2 3 2

−1
A= 3 6 , B = 2 , C = −1 4 3 0 .

2 1 −2 2 0
1 0  2 0 2 1
6 3 6 4 4
3 1 −1
(a) Determine the rank of each of the above matrices by finding their row
echelon forms.

Tutorial Problems
Problem 4
Solution    
1 2 0 1 2 0
0 1 1 0 1 1
  G .E .  
−1
A= 3 6  −−−→ 0 0 1


2 1 0  0 0 0
3 1 −1 0 0 0

Tutorial Problems
Problem 4
Solution    
1 2 0 1 2 0
0 1 1 0 1 1
  G .E .  
−1
A= 3 6  −−−→ 0 0 1


2 1 0  0 0 0
3 1 −1 0 0 0
So rank(A) = 3.

Tutorial Problems
Problem 4
   
2 1 4 1 2 2 1 4 1 2
4 2 2 3 2
−G .E . 0
 0 −6 1 −2
B= −−→  
2 1 −2 2 0 0 0 0 0 0
6 3 6 4 4 0 0 0 0 0

Tutorial Problems
Problem 4
   
2 1 4 1 2 2 1 4 1 2
4 2 2 3 2
−G .E . 0
 0 −6 1 −2
B= −−→  
2 1 −2 2 0 0 0 0 0 0
6 3 6 4 4 0 0 0 0 0
So rank(B) = 2.

Tutorial Problems
Problem 4
   
1 4 5 8 1 4 5 8
G .E .
C = −1 4 3 0 −−−→ 0 8 8 8 
2 0 2 1 0 0 0 −7

Tutorial Problems
Problem 4
   
1 4 5 8 1 4 5 8
G .E .
C = −1 4 3 0 −−−→ 0 8 8 8 
2 0 2 1 0 0 0 −7
So rank(C) = 3.

Tutorial Problems
Problem 4
 
1 2 0  
0 2 1 4 1 2  
1 1 4 1 4 5 8
  2 2 3 2
−1
A= 3 6  , C = −1 4 3 0 .
 , B = 2

2 1 −2 2 0
1 0 2 0 2 1
6 3 6 4 4
3 1 −1
(b) (MATLAB) Use the MATLAB command rank to check your

answers in (a).

Tutorial Problems
Problem 4
 
1 2 0  
0 2 1 4 1 2  
1 1 4 1 4 5 8
  2 2 3 2
−1
A= 3 6  , C = −1 4 3 0 .
 , B = 2

2 1 −2 2 0
1 0 2 0 2 1
6 3 6 4 4
3 1 −1
(b) (MATLAB) Use the MATLAB command rank to check your

answers in (a).
Solution
>> A = [1 2 0; 0 1 1; -1 3 6; 2 1 0; 3 1 -1];
>> rank(A)
>> B = [2 1 4 1 2; 4 2 2 3 2; 2 1 -2 2 0; 6 3 6 4 4];
>> rank(B)
>> C = [1 4 5 8; -1 4 3 0; 2 0 2 1];
>> rank(C)
Tutorial Problems
Problem 4
 
1 2 0  
0 2 1 4 1 2  
1 1 4 1 4 5 8
  2 2 3 2

−1
A= 3 6 , B = 2 , C = −1 4 3 0 .

2 1 −2 2 0
1 0  2 0 2 1
6 3 6 4 4
3 1 −1
(c) Which of these matrices are full rank?

Tutorial Problems
Problem 4
 
1 2 0  
0 2 1 4 1 2  
1 1 4 1 4 5 8
  2 2 3 2

−1
A= 3 6 , B = 2 , C = −1 4 3 0 .

2 1 −2 2 0
1 0  2 0 2 1
6 3 6 4 4
3 1 −1

Solution
Since A is a 5 × 3 matrix and rank(A) = 3, A is full rank.

Tutorial Problems
Problem 4
 
1 2 0  
0 2 1 4 1 2  
1 1 4 1 4 5 8
  2 2 3 2

−1
A= 3 6 , B = 2 , C = −1 4 3 0 .

2 1 −2 2 0
1 0  2 0 2 1
6 3 6 4 4
3 1 −1

Solution
Since B is a 4 × 5 matrix and rank(B) = 2 < 4, B is not full rank.

Tutorial Problems
Problem 4
 
1 2 0  
0 2 1 4 1 2  
1 1 4 1 4 5 8
  2 2 3 2

−1
A= 3 6 , B = 2 , C = −1 4 3 0 .

2 1 −2 2 0
1 0  2 0 2 1
6 3 6 4 4
3 1 −1

Solution
Since B is a 4 × 5 matrix and rank(B) = 2 < 4, B is not full rank.
Since C is a 3 × 4 matrix and rank(C) = 3, C is full rank.

Tutorial Problems
Problem 4
(d) Is it possible to add a row to C so that the rank of the resulting 4 × 4

matrix is greater than rank(C)? Why?

Tutorial Problems
Problem 4

Solution
   
1 4 5 8 1 4 5 8
G .E .
C = −1 4 3 0 −−−→ 0 8 8 8 
2 0 2 1 0 0 0 −7

Tutorial Problems
Problem 4

Solution
   
1 4 5 8 1 4 5 8
G .E .
C = −1 4 3 0 −−−→ 0 8 8 8 
2 0 2 1 0 0 0 −7
Yes. Observe that in row echelon form of C, column 3 is non-pivot.

If
we add a row with leading entry in column 3 (e.g. 0 0 1 0 ),
the resulting 4 × 4 matrix will have row echelon form with 4 non-zero
rows.

Tutorial Problems
Problem 4

Solution
   
1 4 5 8 1 4 5 8
G .E .
C = −1 4 3 0 −−−→ 0 8 8 8 
2 0 2 1 0 0 0 −7
Yes. Observe that in row echelon form of C, column 3 is non-pivot.

If
we add a row with leading entry in column 3 (e.g. 0 0 1 0 ),
the resulting 4 × 4 matrix will have row echelon form with 4 non-zero
rows.
Remark. To get row echelon
form of the resulting 4 × 4 matrix,
interchange 0 0 1 0 and the third row of row echelon form of C.

Tutorial Problems
Problem 4
(e) Explain why it is not possible to add a row to A so that the rank of
the resulting matrix is greater than rank(A).

Tutorial Problems
Problem 4
(e) Explain why it is not possible to add a row to A so that the rank of
the resulting matrix is greater than rank(A).
Solution
Since A is a 5 × 3 matrix and rank(A) = 3, no matter what row we
add to A, the rank of the resulting matrix will still be 3. Therefore, it
is not possible for the rank of the resulting matrix to be greater than
3.

Tutorial Problems
Problem 5
Find the distance and angle between each pair of vectors among u, v and
w in (a) and (b). Which of the pairs are orthogonal to each other?
(a) u = (1, 2, 3), v = (0, −3, 2) and w = (2, −1, 0).

Tutorial Problems
Problem 5
(a) u = (1, 2, 3), v = (0, −3, 2) and w = (2, −1, 0).
Solution
√
Distance between u and v: ||u − v|| = 27.
u·v
Angle between u and v: cos θ = ||u||×||v|| = 0, so θ = 90o .
∴ u and v are orthogonal.

Tutorial Problems
Problem 5
(a) u = (1, 2, 3), v = (0, −3, 2) and w = (2, −1, 0).
Solution
√
u·v
√
Distance between u and w: ||u − w|| = 19.
u·w
Angle between u and w: cos θ = ||u||×||w|| = 0, so θ = 90o .
∴ u and w are orthogonal.

Tutorial Problems
Problem 5
(a) u = (1, 2, 3), v = (0, −3, 2) and w = (2, −1, 0).
Solution
√
u·v
√
u·w
Angle between u and w: cos θ = ||u||×||w|| = 0, so θ = 90o .
∴ u and w are orthogonal.
√
Distance between v and w: ||v − w|| = 12.
v·w
Angle between v and w: cos θ = ||v||×||w|| = √133√5 = 0.3721, so
θ = 68.15o .
∴ v and w are not orthogonal.
Tutorial Problems
Problem 5
(b) u = (1, −1, 1, −1), v = (2, 1, 1, 2) and w = (0, 1, −1, 0).

Tutorial Problems
Problem 5
(b) u = (1, −1, 1, −1), v = (2, 1, 1, 2) and w = (0, 1, −1, 0).
Solution
√
u·v

Tutorial Problems
Problem 5
(b) u = (1, −1, 1, −1), v = (2, 1, 1, 2) and w = (0, 1, −1, 0).
Solution
√
u·v
√
u·w
Angle between u and w: cos θ = ||u||×||w|| = √−2√ = −0.7071, so
4 2
o
θ = 135 .
∴ u and w are not orthogonal.

Tutorial Problems
Problem 5
(b) u = (1, −1, 1, −1), v = (2, 1, 1, 2) and w = (0, 1, −1, 0).
Solution
√
u·v
√
u·w
Angle between u and w: cos θ = ||u||×||w|| = √−2√ = −0.7071, so
4 2
o
θ = 135 .
∴ u and w are not orthogonal.
√
Distance between v and w: ||v − w|| = 12.
v·w
Angle between v and w: cos θ = ||v||×||w|| = 0, so θ = 90o .
∴ v and w are orthogonal.
Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and
v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
(a) Are v and w linear combinations of u1 , u2 , u3 ? Justify your answer.

Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and
v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
Solution
 
2 3 −1 2 1
 1 −1 0 3 1 
 
 0 5 2 −7 1 
3 2 1 3 1

Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and
v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
Solution
   
2 3 −1 2 1 1 0 0 2 0
 1 −1 0 3 1  G .J.E .  0 1 0 −1 0 
  −
−−−→  
 0 5 2 −7 1   0 0 1 −1 0 
3 2 1 3 1 0 0 0 0 1

Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and
v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
Solution
   
2 3 −1 2 1 1 0 0 2 0
 1 −1 0 3 1  G .J.E .  0 1 0 −1 0 
  −
−−−→  
 0 5 2 −7 1   0 0 1 −1 0 
3 2 1 3 1 0 0 0 0 1
Since the left augmented column is not a pivot column, the first linear
system has a solution. Thus, v is a linear combination of u1 , u2 , u3 .

Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and
v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
Solution
   
2 3 −1 2 1 1 0 0 2 0
 1 −1 0 3 1  G .J.E .  0 1 0 −1 0 
  −
−−−→  
 0 5 2 −7 1   0 0 1 −1 0 
3 2 1 3 1 0 0 0 0 1
Since the left augmented column is not a pivot column, the first linear
system has a solution. Thus, v is a linear combination of u1 , u2 , u3 .
Since the right augmented column is a pivot column, the second
linear system has no solution. Thus, w is not a linear combination of
u1 , u2 , u3 .
Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and

v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
(b) Do v and w belong to span{u1 , u2 , u3 }? Justify your answer.

Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and

v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
Solution
v belongs to span{u1 , u2 , u3 } because v is a linear combination of u1 ,
u2 , u3 .

Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and

v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
Solution
v belongs to span{u1 , u2 , u3 } because v is a linear combination of u1 ,
u2 , u3 .
w does not belong to span{u1 , u2 , u3 } because w is not a linear
combination of u1 , u2 , u3 .

Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and

v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
(c) Is span{u1 , u2 , u3 } = span{u1 , u2 , u3 , v}? Is span{u1 , u2 , u3 } = R4 ?
Justify your answers.

Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and

v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
Solution
span{u1 , u2 , u3 } = span{u1 , u2 , u3 , v} because v is a redundant
vector in span{u1 , u2 , u3 , v}.

Tutorial Problems
Problem 6
Let u1 = (2, 1, 0, 3), u2 = (3, −1, 5, 2) and u3 = (−1, 0, 2, 1), and

v = (2, 3, −7, 3) and w = (1, 1, 1, 1).
Solution
span{u1 , u2 , u3 } = span{u1 , u2 , u3 , v} because v is a redundant
vector in span{u1 , u2 , u3 , v}.
6 R4 because w ∈ R4 but w 6∈ span{u1 , u2 , u3 }.
span{u1 , u2 , u3 } =

Tutorial Problems
Problem 7
(a) How are span{(1, 0, 0)}, span{(−1, 0, 0)} and
span{(1, 0, 0), (−1, 0, 0)} related? Describe what geometrical objects
do they represent in the xyz-space.

Tutorial Problems
Problem 7
Solution
span{(1, 0, 0)} represents the entire x-axis in the xyz-space because
(1, 0, 0) is a vector along the positive x-axis in the xyz-space.

Tutorial Problems
Problem 7
Solution
span{(−1, 0, 0)} also represents the entire x-axis in the xyz-space
because (−1, 0, 0) is a vector along the negative x-axis in the
xyz-space.

Tutorial Problems
Problem 7
Solution
xyz-space.
span{(1, 0, 0), (−1, 0, 0)} again represents the entire x-axis in the
xyz-space because (1, 0, 0) and (−1, 0, 0) are both vectors along the
x-axis in the xyz-space.

Tutorial Problems
Problem 7
Solution
xyz-space.
span{(1, 0, 0), (−1, 0, 0)} again represents the entire x-axis in the
xyz-space because (1, 0, 0) and (−1, 0, 0) are both vectors along the
x-axis in the xyz-space.
Therefore, span{(1, 0, 0)}, span{(−1, 0, 0)} and
span{(1, 0, 0), (−1, 0, 0)} are the same.
Tutorial Problems
Problem 7
(b) Recall that the span of two non-parallel vectors in R3 represents a
plane in the xyz-space that contains the origin.
(i) Find the linear equation of the plane P that represents
span{(2, −1, 0), (−1, 1, 1)}.

Tutorial Problems
Problem 7
span{(2, −1, 0), (−1, 1, 1)}.
Solution
Since the plane P contains the origin, the linear equation of the plane
P has the form ax + by + cz = 0 for some real numbers a, b, c to be
determined.

Tutorial Problems
Problem 7
span{(2, −1, 0), (−1, 1, 1)}.
Solution
Since the plane P contains the origin, the linear equation of the plane
P has the form ax + by + cz = 0 for some real numbers a, b, c to be
determined.
Since the plane P represents span{(2, −1, 0), (−1, 1, 1)}, the plane P
contains the two vectors (2, −1, 0) and (−1, 1, 1). So the coordinates
of these two vectors satisfy the equation ax + by + cz = 0. We shall
substitute these coordinates for x, y , z to solve for a, b, c:

2a − b = 0
−a + b + c = 0

Tutorial Problems
Problem 7

2 −1 0 0 G .J.E . 1 0 1 0
−−−−→
−1 1 1 0 0 1 2 0

Tutorial Problems
Problem 7

2 −1 0 0 G .J.E . 1 0 1 0
−−−−→
−1 1 1 0 0 1 2 0
The general solution of this system is given by

 a = −t
b = −2t
c = t


Tutorial Problems
Problem 7

2 −1 0 0 G .J.E . 1 0 1 0
−−−−→
−1 1 1 0 0 1 2 0
The general solution of this system is given by

 a = −t
b = −2t
c = t

Hence the equation of the plane P is −tx − 2ty + tz = 0, which can be

simplified as x + 2y − z = 0.

Tutorial Problems
Problem 7

(ii) Show that the vector (−2, −4, 2) is orthogonal to both (2, −1, 0) and
(−1, 1, 1). Use this to explain why vector (−2, −4, 2) is perpendicular
to the plane P in (i).

Tutorial Problems
Problem 7

Solution
We compute the dot products: (−2, −4, 2) · (2, −1, 0) = 0 and
(−2, −4, 2) · (−1, 1, 1) = 0. Hence (−2, −4, 2) is orthogonal to both
(2, −1, 0) and (−1, 1, 1).

Tutorial Problems
Problem 7

Solution
We compute the dot products: (−2, −4, 2) · (2, −1, 0) = 0 and
(−2, −4, 2) · (−1, 1, 1) = 0. Hence (−2, −4, 2) is orthogonal to both
(2, −1, 0) and (−1, 1, 1).
Since (−2, −4, 2) is perpendicular to both (2, −1, 0) and (−1, 1, 1), it
must also be perpendicular to the plane P in (i), which is given by
span{(2, −1, 0), (−1, 1, 1)}.

MA1513 Tutorial 2 T03

Uploaded by

Document Information

Original Description:

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

MA1513 Tutorial 2 T03

Uploaded by

Copyright:

Available Formats

MA1513 Tutorial 2

Clifton NG Wei Zhi

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 1 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 2 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 3 / 48

Topics Covered Last Week

Chapter 1: Linear System and Matrix Algebra

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 4 / 48

1.6 Matrix Inverses II

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 5 / 48

1.6 Matrix Inverses II

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 6 / 48

1.7 Determinants of Matrices

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 7 / 48

1.7 Determinants of Matrices

det(A + B) 6= det(A) + det(B)

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 8 / 48

1.8 Ranks of Matrices

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 9 / 48

2.1 Vectors in n-space

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 10 / 48

2.1 Vectors in n-space

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 11 / 48

2.1 Vectors in n-space

Angle θ between u and v:

2.2 Linear Combination and Linear Span

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 13 / 48

2.2 Linear Combination and Linear Span

Vector equation form:

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 14 / 48

2.2 Linear Combination and Linear Span

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 15 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 16 / 48

A manufacturer makes three types of chairs A, B, C. The company has

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 17 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 18 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 18 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 18 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 18 / 48

Let x1 , x2 , x3 denote the number of chairs of type A, B, C

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 19 / 48

Let x1 , x2 , x3 denote the number of chairs of type A, B, C

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 19 / 48

Let x1 , x2 , x3 denote the number of chairs of type A, B, C

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 19 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 20 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 20 / 48

(MATLAB) A horizontal elastic beam is supported at each end and is

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 21 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 23 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 23 / 48

(b) Suppose measurements at the four points show deflections of 0.08,

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 24 / 48

(b) Suppose measurements at the four points show deflections of 0.08,

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 24 / 48

(b) Suppose measurements at the four points show deflections of 0.08,

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 24 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 25 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 25 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 25 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 26 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 26 / 48

Clifton NG Wei Zhi MA1513 Tutorial 2 22 August 2022 26 / 48