You are on page 1of 1

Covered the properties of number of linearly independent spanning vectors in a subspace, of

properties of the number of vectors in a basis, of dimension of a subspace and its relation with
the basis, of the rank-nullity theorem, and of the various statements.
𝑛
- For vectors, 𝑣1, 𝑣2, 𝑣3, …, 𝑣𝑚, and vectors, 𝑤1, 𝑤2, 𝑤3, …, 𝑤𝑝 in a subspace, V, of 𝑅 ,
o If
▪ 𝑣1, 𝑣2, 𝑣3, …, 𝑣𝑚 are linearly independent;

▪ 𝑤1, 𝑤2, 𝑤3, …, 𝑤𝑝 span V


o Then 𝑝≥𝑚
- All bases of a subspace have the same number of basis vectors
- The dimension of a subspace is the number of vectors in a basis of the subspace
- For a subspace of dimension 𝑚,
o We can find at most 𝑚 linearly independent vectors in the subspace
o We need at least 𝑚 to span the subspace
o If 𝑚 vectors in the subspace are linearly independent, then they form a basis
of the subspace
o If 𝑚 vectors in the subspace span the subspace, then they form a basis of the
subspace
- Using rref to construct a basis of the image by picking the column vectors containing
the leading 1’s in rref
- For any matrix 𝐴, 𝑑𝑖𝑚(𝑖𝑚(𝐴)) = 𝑟𝑎𝑛𝑘(𝐴)
- The Rank-Nullity Theorem
o 𝑟𝑎𝑛𝑘(𝐴) + 𝑛𝑢𝑙𝑙𝑖𝑡𝑦(𝐴) = (𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑟𝑜𝑤𝑠 𝑜𝑓 𝐴)
𝑛
- The vectors 𝑣1, 𝑣2, 𝑣3, …, 𝑣𝑚 form a basis of 𝑅 if and only if the matrix with the vectors
𝑣1, 𝑣2, 𝑣3, …, 𝑣𝑚 as the columns is invertible
- The following statements are equivalent for 𝐴 that is 𝑛×𝑛
▪ 𝐴 is invertible
𝑛
▪ The linear system 𝐴𝑥 = 𝑏 has unique solutions for all 𝑏 in 𝑅

▪ 𝑟𝑟𝑒𝑓(𝐴) = 𝐼

▪ 𝑟𝑎𝑛𝑘(𝐴) = 𝑛
𝑛
▪ 𝑖𝑚(𝐴) = 𝑅

▪ 𝑘𝑒𝑟(𝐴) = {0}
𝑛
▪ The column vectors of 𝐴 form a basis of 𝑅
𝑛
▪ The column vectors of 𝐴 span 𝑅

▪ The column vectors of 𝐴 are linearly independent

You might also like