Final answer:
This detailed answer evaluates each statement regarding vectors, bases, subspaces, and the dimensions of vector spaces in turn, concluding with clear reasons or counterexamples for statements that are false.
Step-by-step explanation:
Let's evaluate the truth of each statement provided:
- The zero vector cannot be part of a basis because a basis must consist of linearly independent vectors, and including the zero vector would immediately create linear dependence.
- Every linearly independent set of vectors is indeed a basis for some subspace, specifically the subspace spanned by those vectors.
- If a vector space V contains a linearly dependent subset of size p, this does not provide information about the dimension, so we cannot determine dimV from this information alone.
- If a vector space V contains a linearly independent subset of size p, then dimV is at least p because a basis must have at least as many vectors as a linearly independent set.
- The dimensions of the row space and column space of a matrix are always equal and are known as the rank of the matrix; this holds true regardless of the matrix being square.
- A plane in R³ is indeed a 2-dimensional subspace because it can be described by two linearly independent vectors.
- If Span(S)=V, then some subset of S must serve as a basis for V, since the basis is the minimal set of vectors that spans V.
- The nonzero rows of A do not necessarily form a basis for Row(A) as they need to be linearly independent; however, the row-reduced echelon form of A will have nonzero rows that do form a basis.
- If B is obtained from A by elementary row operations, then rank(B)=rank(A) because these operations do not change the linear independence of the rows.
- If H is a subspace of R³, there is not always a 3x3 matrix A such that H=Col(A), because H could be one-dimensional, for example, and not span all of R³.