Jan 24
- Introduce nullspace and columns space
- Draw picture of domain, range, kernel, codomain
Let S = {a1, …, an} ⊆ ℝm be a set of vectors. Let A be the m × n matrix formed by writing the elements of S as columns. Let T : ℝn → ℝm be the linear transformation defined by T(x) = Ax.
- S is linearly independent
- Ax = 0 has only the trivial solution
- For any b, Ax = b has either no solution or exactly one solution.
- null(A) = {0}
- T is one-to-one
- ker(T) = {0}
Let S = {a1, …, an} ⊆ ℝm be a set of vectors. Let A be the m × n matrix formed by writing the elements of S as columns. Let T : ℝn → ℝm be the linear transformation defined by T(x) = Ax.
- S is spanning
- Ax = b has a solution for any b
- col(A) = ℝm
- T is onto
- range(T) = ℝm
Let S = {a1, …, an} ⊆ ℝn be a set of vectors. Let A be the n × n matrix formed by writing the elements of S as columns. Let T : ℝn → ℝn be the linear transformation defined by T(x) = Ax.
- S is a basis
- S is linearly independent
- S is spanning
- Ax = b always has a unique solution
- col(A) = ℝn
- null(A) = ℝn
- T is invertible
- A is invertible
3.2 Matrix Algebra
Matrix multiplication is weird
- AB ≠ BA
- Explain what AB = 0 means in terms of columnspace and nullspace
Tranpose of a matrix
- Teach how to tranpose
- (A + B)t = At + Bt
- (sA)t
- (AC)t = CtAt
Diagonal matrices and upper triangular matrices is a thing
- Give definition
- The product of digaonl is diagonal. Discuss the effects of multiplying a matrice by a diagonal matrix
- The product of upper triangulars is upper triangular
Powers of matrices is a thing
- Powers of diagonal is easy
- Wouldn’t it be great if A = UDU − 1
3.3 Inverses
- Explain what an inverse is.
- Derive inverse formula.