MATH110 Homework 11 & 12

Taylor Tam

Outline
HW11
Section 3.4: System of Linear Equations - Computational Aspects
Notes
Problems: #1, 2(b)(d)(f), 3, 4(b), 5, 6, 7, 9, 10
Challenge Problems: #12, 14
Section 4.1: Determinants of Order 2
Notes
Problems: #1, 3(b), 4(c), 5-8, 9
Challenge Problems: #11
HW12
Section 4.2: Determinants of Order n
Notes
Problems: #1, 3, 7, 10, 11, 17, 22, 25, 26
Section 4.3: Properties of Determinants
Notes
Problems: #1, 7, 9, 10, 11, 12, 15, 26(g)
Challenge Problems: #13, 17, 22(c), 24
Section 4.4: Summary - Important Facts about Determinants
Notes
Problems: #1,5
Challenge Problems: #6

Section 3.4: System of Linear Equations - Computational Aspects

Notes
Equivalence: SLE are equivalent if they have the same solution set
Theorem 3.13: Suppose Ax = b is a system of m linear equations in n unknowns, and C is an
invertible matrix of Mmm . Then the system (CA)x = Cb is equivalent to Ax = b.
Corollary: Given the same SLE above, using finite number of elementary row operations on (A | b)
to derive (A0 | b0 ) gives an equivalent system.
Conditions of Row Reduced Echelon Form:
1. Any row containing a nonzero entry precedes any row in which all the entries are zero
2. First nonzero entry in each row is the only nonzero entry in its column
3. The first nonzero entry in each row is 1 and it occurs in a column to the right of the first
nonzero entry in the preceding row

1
 Theorem 3.14: Gaussian elimination transforms any matrix into its reduced row echelon form
General Solution: A general solution is typically derived from Gaussian Elimination of an
augmented matrix
Theorem 3.15: Given Ax = b SLE of r equations with n unknowns. Suppose that
rank(A) = rank(A | b) and that (A | b) is in reduced row echelon form. Then:
rank(A) = r
If the general solution obtained by the procedure above is in the form of the general solution:

s = s0 + t1 u1 + t2 u2 + + tnr unr ,

then u1 , . . . , unr is a basis for the solution set of the corresponding homogenous system and s0
is a solution ot the original system.
Theorem 3.16: Suppose A is Mmn or rankr, where r > 0, and B is the RREF of A. Then:
The number of nonzero rows in B is r.
For each i = 1, 2, . . . , r, there is a column of bj of B such that bji = ei .
The columns of A numbered j1 , j2 . . . , jr are linearly independent
For each k = 1, 2, . . . , n, if column k of B is d1 e1 + d2 e2 + + dr er , then column k of A is
d1 aj1 + dr ajr .
Corollary: The RREF of a matrix is unique

Problems
#1, 2(b)(d)(f), 3, 4(b), 5, 6, 7, 9, 10

Challenge Problems
#12, 14

Section 4.1: Determinants of Order 2

Notes
 
a b
Determinant of 2 2: Given A = , the determinant of A, denoted det(A) or | A |= ad bc.
c d
Theorem 4.1: Determinant is a linear function

Theorem 4.2: Determinant of A is nonzero if and only if A is invertible.

Problems
#1, 3(b), 4(c), 5-8, 9

Challenge Problems
#11

2
Section 4.2: Determinants of Order n
Notes
Determinant of an n n matrix: For matrices with n 2, det(A) is defined recursively as:
n
X
det(A) = (1)i+j Aij det(Aij )
j=1

where Aij is the determinant of the matrix with row i and column j deleted.
Cofactor: The cofactor for Aij is defined as: (1)i+j det(Aij )
Cofactor Expansion: Cofactor expansion (along the first row of A) is

det(A) = A11 c11 + A12 c12 + + A1n c1n

Note that determinants of a nonsquare matrix requires that cofactor expansion along the first row
(unless the matrix is square - in which expansion can happen along any row
Determinant of the identity matrix is 1
Theorem 4.3: The determinant of an n n matrix is a linear function of each row when the
remaining rows are held fixed. For 1 r n:

a1 a1 a1
.. .. ..
. . .

ar1 ar1 ar1

u + kv = det u + k det v
det
ar+1 ar+1 ar+1

. . .
.. .. ..
an an an

where k is a scalar and u,v, and each ai are row vectors in F n .

If there is a nonzero row in A, det(A) = 0.
Theorem 4.4: The determinant of a square matrix can be evaluated by cofactor expansion along
any row. Note that this proof requires a lemma to complete
Corollary: If A Mnn (F ) has two identical rows, then det(A) = 0.

Theorem 4.5: If A Mnn and B is derived from exchanging two rows of A, then
det(B) = det(A)
Theorem 4.6: If B is derived from A using row addition, then the determinant remains unchanged.
Corollary: If A Mnn (F ) has rank less than n, then det(A) = 0.

Problems
#1, 3, 7, 10, 11, 17, 22, 25, 26

3
Section 4.3: Properties of Determinants
Notes
Determinants of elementary matrices:
If E is a matrix from a row exchange of I, then det E = 1
If E is obtained by multipltying a row with a nonzero scalar k, then detE = k.
If E is an elementary matrix obtained by adding a multiple of some row of I to another row,
then det E = 1
Theorem 4.7: For A, B Mnn (F ), det AB = det A det B.
Corollary: A matrix is invertible if and only if det A 6= 0.
Theorem 4.8: For any A Mnn (F ), det At = det A
Theorem 4.9 (Cramers Rule): Suppose Ax = b is a SLE of m linear equations with n unkowns
where x is a unique solution (in the form (x1 , . . . , xn )t . If det A 6= 0, then this system has a unique
solution, and for each k(k = 1, 2, . . . , n),
det Mk
xk =
det A
where Mk is the n n matrix obtained from A by replacing column k of A by b.

Problems
#1, 7, 9, 10, 11, 12, 15, 26(g)

Challenge Problems
#13, 17, 22(c), 24

Section 4.4: Summary - Important Facts about Determinants

Notes: Properties of the Determinant
1. If B is a matrix obtained by interchanging any two rows or interchanging any two columns of an
n n matrix A, then det B = det A.
2. If B is a matrix obtained by multiplying each entry of some row or column of an n n matrix A by
scalar k, then det B = k det A.
3. Row or column additions do not change the determinant.
4. Determinant of an upper triangular matrix: The determinant of an upper triangular matrix is
the product of its diagonal entries.
5. If two rows or columns of a matrix are identical, then the determinant of the matrix is zero.
6. For any n n matrices A and B. det AB = det A det B.
7. An n n matrix A is invertible if and only if det A 6= 0. Furthermore, if A is invertible, then
det A1 = det1 A

4
 8. For any n n matrix A, the determinants of A and At are equal.
9. If A and B are similar matrices, then det A = det B.

Problems
#1,5

Challenge Problems
#6