Sheet 1
Sheet 1
Chapter 1
Matrices and Gaussian Elimination
x + 2y = 2
3 by 2 system x − y = 2
y = 1.
What happens if all right-hand sides are zero? Is there any nonzero choice of right-
hand sides that allows the three lines to intersect at the same point?
u + v + w = 2
u + 2v + 3w = 1
v + 2w = 0
Show that the three columns on the left lie in the same plane by expressing the third
column as a combination of the first two. What are all the solutions (u, v, w) if b is
the zero vector (0, 0, 0)?
1
1.2 The Geometry of Linear Equations
11. These equations are certain to have the solution x = y = 0. For which values of a is
there a whole line of solutions?
ax + 2y = 0
2x + ay = 0
2
1.3 An Example of Gaussian Elimination
ax + by = f
cx + dy = g.
The first pivot is a (assumed nonzero). Elimination produces what formula for the
second pivot? What is y? The second pivot is missing when ad = bc.
5. Choose a right-hand side which gives no solution and another right-hand side which
gives infinitely many solutions. What are two of those solutions?
3x + 2y = 10
6x + 4y = .
7. For which numbers a does elimination break down (a) permanently, and (b) tem-
porarily?
ax + 3y = −3
4x + 6y = 6.
Solve for x and y after fixing the second breakdown by a row exchange.
.
Problems 10–19 study elimination on 3 by 3 systems (and possible failure).
10. Reduce this system to upper triangular form by two row operations:
2x + 3y + z = 8
4x + 7y + 5z = 20
− 2y + 2z = 0.
Circle the pivots. Solve by back-substitution for z, y, x.
13. Which number b leads later to a row exchange? Which b leads to a missing pivot?
In that singular case find a nonzero solution x, y, z.
x + by = 0
x − 2y − z = 0
y + z = 0.
3
1.3 An Example of Gaussian Elimination
2u − v = 0
−u + 2v − w = 0
− v + 2w − z = 0
− w + 2z = 5.
You may carry the right-hand side as a fifth column (and omit writing u, v, w, z until
the solution at the end).
4
1.4 Matrix Notation and Matrix Multiplication
11. The first row of AB is a linear combination of all the rows of B. What are the coeffi-
cients in this combination, and what is the first row of AB, if
" # 1 1
2 1 4
A= and B = 0 1?
0 −1 1
1 0
15. Suppose A commutes with every 2 by 2 matrix (AB = BA), and in particular
" # " # " #
a b 1 0 0 1
A= commutes with B1 = and B2 = .
c d 0 0 0 0
" #
cos θ − sin θ
A(θ ) = .
sin θ cos θ
Verify that A(θ1 )A(θ2 ) = A(θ1 + θ2 ) from the identities for cos(θ1 + θ2 ) and sin(θ1 +
θ2 ). What is A(θ ) times A(−θ )?
5
1.4 Matrix Notation and Matrix Multiplication
31. This 4 by 4 matrix needs which elimination matrices E21 and E32 and E43 ?
2 −1 0 0
−1 2 −1 0
A= .
0 −1 2 −1
0 0 −1 2
46. Block multiplication separates matrices into blocks (submatrices). If their shapes
make block multiplication possible, then it is allowed. Replace these x’s by numbers
and confirm that block multiplication succeeds.
" # x x x x x x
h i C h i
A B = AC + BD and x x x x x x .
D
x x x x x x
6
1.5 Triangular Factors and Row Exchanges
5. Factor A into LU, and write down the upper triangular system Ux = c which appears
after elimination, for
2 3 3 u 2
Ax = 0 5 7 v = 2 .
6 9 8 w 5
17. The less familiar form A = LPU exchanges rows only at the end:
1 1 1 1 1 1 1 0 0 1 1 1
A = 1 1 3 → L−1 A = 0 0 2 = PU = 0 0 1 0 3 6 .
2 5 8 0 3 6 0 1 0 0 0 2
What is L is this case? Comparing with PA = LU in Box 1J, the multipliers now stay
in place (`21 is 1 and `31 is 2 when A = LPU).
24. What three elimination matrices E21 , E31 , E32 put A into upper triangular form
−1 −1 −1
E32 E31 E21 A = U? Multiply by E32 , E31 and E21 to factor A into LU where L =
−1 −1 −1
E21 E31 E32 . Find L and U:
1 0 1
A = 2 2 2 .
3 4 5
7
1.6 Inverses and Transposes
15. (a) How many entries can be chosen independently in a symmetric matrix of order
n?
(b) How many entries can be chosen independently in a skew-symmetric matrix
(K T = −K) of order n? The diagonal of K is zero!
24. Show that [ 13 26 ] has no inverse by trying to solve for the column (x, y):
" #" # " # " #" # " #
1 2 x t 1 0 1 2 x 1
= must include = .
3 6 y z 0 1 3 6 y 0
Problems 35–39 are about the Gauss-Jordan method for calculating A−1
38. Invert these matrices A by the Gauss-Jordan method starting with [A I]:
1 0 0 1 1 1
A = 2 1 3 and A = 1 2 2 .
0 0 1 1 2 3
8