Chapter 2 theorems Flashcards
Theorem 1
Let A,B, and C be matrices of the same size, and let r and s be scalars.
a) A+B = B+A
b) (A+B)+C = A + (B+C)
c) A + 0 = A
d) r(A+B) = rA + rB
e) (r+s)A = rA + sA
f) r(sA) = (rs)A
Theorem 2
Let A be an mxn matrix and let B and C have sizes for which the indicated sums and products are defined:
a) A(BC)=(AB)C
b) A(B+C) = AB + AC
c) (B+C)A = BA + CA
d) r(AB) = (rA)B = A(rB)
ImA = A = AIn
Theorem 3
Let A and B denote matrices whose sizes are appropriate for the following sums and products.
a) (A^T)^T
b) (A+B)^T = A^T + B^T
c) For any scalar r, (rA)^T = rA^T
d) (AB)^T = B^TA^T
Theorem 4
Let A is a 2x2 matrix = [{a,b},{c,d}]. if ad-bc != 0, then A is invertible and
A^-1 = 1/(ad-bc)*[{d,-b},{-c,a}]
Theorem 5
If A is an invertible nxn matrix, then for each b in Rn, the equation Ax=b has the unique solution x = A^-1b
Theorem 6
If A is an invertible matrix, then A^-1 is invertible and (A^-1)^-1 = A
b) if A and B are nxn invertible matrices, then so is AB, and the inverse of AB is the product of the inverses of A and B in the reverse order. That is, (AB)^-1 = B^-1A^-1
c) If A is an invertible matrix, then so is A^T, and the inverse of A^T is the transpose of (A^T)^-1 = (A^-1)^T
Theorem 7
An nxn matrix A is invertible if and only if A is row equivalent to In, and in this case, any sequence of elementary row operations that reduces A to In also transforms In into A^-1
Theorem 8
Let A be a square nxn matrix. Then the following statements are equivalent:
a) A us an invertible matrix
b) A is row equivalent to the nxn identity matrix.
c) A has n pivot positions
d) The equation Ax = 0 has only the trivial solution
e) The columns of A form a linearly independent set
f) The linear transformation x-> Ax is one-to-one
g) The equation Ax = has at least one solution for each b in Rn
h) The columns of A span Rn
i) The linear transfomration x->Ax maps Rn onto RN
j) There is an nxn matrix C such that CA = I
There is an nxn matrix D such that AD = I
l) A^T is an invertible matrix
Theorem 9
S(T(x))= x for all x in Rn
T(S(x)) = x for all x in Rn
Let T: Rn -> Rn be a linear transformation and let A be the standard matrix for T. Then T is invertible if and only if A is an invertible matrix. In that case, the linear transformation S given by S(x)=A^-1x is the unique function satisfying equation(1) and (2)
Theorem 11
The null space of an mxn matrix A is a subspace of Rn. Equivalently, the set of all solutions of a system Ax = 0 of m homogenous linear equations in n unknowns is a subspace of Rn
Theorem 12
The pivot columns of a matrix A form a basis for the column space of A
Theorem 13
if matrix A has n columns
dim Col A + dim Nul A = n
rank A + dim Nul A = n
Theorem 14
Let H be a p-dimensional subspace of Rn. Any linearly independent set of exactly p elements in H is automatically a basis for H. Also, any set of p elements of H that spans H is automatically a basis for H.
Theorem 8 pt 2
m) The columns of A form a basis of Rn
n) Col A = Rn
o) dim Col A = n
p) rank A = n
q) Null A = {0}
r) dim NUl A = 0
Theorem 1(ch 3)
The determinant of an nxn matrix A can be computer by a cofactor across any row or down any column. The expansion across the ith row using the cofactors is
det A = ai1Ci1 + ai2Ci2 + …+a1nC1n