MATH 2J – WINTER 2010 3. (A + B) + C = A + (B + C) 1.

(AT)T = A
Matrix w/ no solns. = 4. (AB)C = A(BC) 2. (αA)T = αAT
inconsistent 5. A(B + C) = AB + AC 3. (A + B)T = AT + BT
at least 1 soln = consistent
6. (A + B)C = AC + BC) 4. (AB)T = BTAT
Elementary Row Op 7. (αβ)A = α(βA) Partitioned Matrix
- Interchange rows
8. α(AB) = (αA)B = A(αB) 1.
- Multiply row c≠0
- Sum of multiple 9. (α + β)A = αA + βA A [ B1 B2 ] = [ A B1 A B
Reduced Row Echelon Form 10. α(A + B) = αA + αB
A1 AB 1
- 1st nonzero in row is 1
- following row has more 0’s
- row w/ all zeros at bottom
11. An =
( 2n−1 2 n−1
2n−1 2 n−1 ) 2.

3.
[ ] [ ]
A2
B=
AB 2
- 1st entry ≠ 0 in row is only Symmetric Matrix
entry ≠ 0 in column B1
][ ]
AT = A
Overdetermined: eqs > ??
Singularity [A1 A2 = A 1 B1 + A
Underdetermined: eqs < ??
A = nonsingular/invertible
B2
Arithmetic Elementary Matrixes (En)
if exist A-1 such that A-1A =
1. αA = αaij Computing A-1 : (A|I) → row
AA-1 = I
2. A + B = B + A ops to both sides → (I|A-1)
Algebraic Rules: Transposes
 diagonal that was 3. Adding multiple of
x x x
UpperΔ (U) =
[ ]
0
0
x
x
0
x
x
x
x
transformed to a zero.
Determinants
Aij (cofactor)=
(−1)i+ j det (M ij )
row/column has no effect
Adjoint of a Matrix
adj A = (Aij, Aij …)T take
cofactor of each digit,

[ ]
then transpose
Thm: If row/column all zeros, 1
LowerΔ (L) = 0 x x det(A) = 0 A-1 = a dj A
0 0 x If identical det ⁡( A)
row/columns, det(A) = 0 Cramer’s Rule
A=L×U
det(AB) = det(A)det(B)
STEPS: A → U = E-1…U det ⁡( Ai )
E-1… = L 1 x1 =
For every row op done on
det(A-1) =
det ⁡( A) det ⁡( A)
each E, do reverse for STEPS: Ai obtained by
Types
same row and column in 1. Interchanging two rows/
replacing ith column of A by
new matrix “L”, but apply columns change sign b (solution)
only to digits under 2. Multiplying row/column by Eigenvalues/Eigenvectors
scalar α = α det (A) 1. λ is eigenvalue of A
2. (A – λI)x=0 has nontrivial
soln.
3. N(A – λI)x ≠ {0}
4. A – λI is singular
5. det(A – λI) = 0
Similar Matrices
B similar to A if exists
nonsingular matrix S such
that B = S-1AS
Matrix: idempotent if A2 = A
nilpotent if Ak = 0
Diagonalization
X-1AX = D