Linear Algebra Quiz: Column Space And Null Space
19 questions · exam conditions
0:00
Column Space And Null SpaceQuestion 1 of 19

The null space of a matrix AA is spanned by the single vector v=(1210)\vec{v} = \begin{pmatrix} 1 \\ -2 \\ 1 \\ 0 \end{pmatrix}. Which of the following statements about matrix AA must be true?

The matrix AA has 3 columns.
The columns of AA are linearly independent.
The dimension of the column space of AA is 3.
The equation Ax=bA\vec{x}=\vec{b} is consistent for every vector b\vec{b}.
← Back to quizzes

Linear Algebra Quiz

Linear Algebra Quiz: Column Space And Null Space

Practice Column Space And Null Space in Linear Algebra with focused quiz questions that help you check what you know, review explanations, and build confidence with test-style prompts.

What this quiz covers

This quiz focuses on Column Space And Null Space, giving you a quick way to practice the rules, question types, and explanations that matter most for Linear Algebra.

How to use this quiz

Try each quiz question before looking at the correct answer. Use the explanations to review missed ideas, then come back to similar questions until the pattern feels familiar.

All questions

Question 1

The null space of a matrix AA is spanned by the single vector v=(1210)\vec{v} = \begin{pmatrix} 1 \\ -2 \\ 1 \\ 0 \end{pmatrix}. Which of the following statements about matrix AA must be true?

  1. The matrix AA has 3 columns.
  2. The columns of AA are linearly independent.
  3. The dimension of the column space of AA is 3. (correct answer)
  4. The equation Ax=bA\vec{x}=\vec{b} is consistent for every vector b\vec{b}.
Explanation: The null space is spanned by a single non-zero vector, so its dimension, dim(Nul(A))\text{dim}(\text{Nul}(A)), is 1. The vectors in the null space are in R4\mathbb{R}^4, which means the matrix AA must have n=4n=4 columns for the product AxA\vec{x} to be defined. By the Rank-Nullity Theorem, rank(A)+dim(Nul(A))=n\text{rank}(A) + \text{dim}(\text{Nul}(A)) = n. Substituting the known values, we get rank(A)+1=4\text{rank}(A) + 1 = 4, which implies rank(A)=3\text{rank}(A) = 3. The rank of a matrix is the dimension of its column space. Therefore, the dimension of the column space of AA must be 3.

Question 2

Let A=(135025810121)A = \begin{pmatrix} 1 & 3 & 5 & 0 \\ -2 & -5 & -8 & 1 \\ 0 & 1 & 2 & 1 \end{pmatrix}. The reduced row echelon form of AA is (101001200001)\begin{pmatrix} 1 & 0 & -1 & 0 \\ 0 & 1 & 2 & 0 \\ 0 & 0 & 0 & 1 \end{pmatrix}. Which of the following sets is a basis for the column space of AA?

  1. {(100),(010),(001)}\left\{ \begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix}, \begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix}, \begin{pmatrix} 0 \\ 0 \\ 1 \end{pmatrix} \right\}
  2. {(120),(351),(011)}\left\{ \begin{pmatrix} 1 \\ -2 \\ 0 \end{pmatrix}, \begin{pmatrix} 3 \\ -5 \\ 1 \end{pmatrix}, \begin{pmatrix} 0 \\ 1 \\ 1 \end{pmatrix} \right\} (correct answer)
  3. {(121)}\left\{ \begin{pmatrix} -1 \\ 2 \\ 1 \end{pmatrix} \right\}
  4. {(120),(351),(582),(011)}\left\{ \begin{pmatrix} 1 \\ -2 \\ 0 \end{pmatrix}, \begin{pmatrix} 3 \\ -5 \\ 1 \end{pmatrix}, \begin{pmatrix} 5 \\ -8 \\ 2 \end{pmatrix}, \begin{pmatrix} 0 \\ 1 \\ 1 \end{pmatrix} \right\}
Explanation: A basis for the column space of a matrix AA is formed by the pivot columns of the original matrix AA. The reduced row echelon form (RREF) shows that the pivot positions are in columns 1, 2, and 4. Therefore, a basis for the column space of AA is the set of the first, second, and fourth columns of the original matrix AA.

Question 3

A 5×95 \times 9 matrix AA has a column space with dimension 4. What is the dimension of the null space of AA?

  1. 1
  2. 4
  3. 5 (correct answer)
  4. 6
Explanation: The Rank-Nullity Theorem states that for an m×nm \times n matrix AA, the sum of the dimension of the column space (rank) and the dimension of the null space (nullity) is equal to the number of columns, nn. Here, AA is a 5×95 \times 9 matrix, so n=9n=9. We are given that dim(Col(A))=rank(A)=4\text{dim}(\text{Col}(A)) = \text{rank}(A) = 4. Therefore, 4+dim(Nul(A))=94 + \text{dim}(\text{Nul}(A)) = 9. Solving for the dimension of the null space gives dim(Nul(A))=94=5\text{dim}(\text{Nul}(A)) = 9 - 4 = 5.

Question 4

Consider the matrix A=(103221631133)A = \begin{pmatrix} 1 & 0 & 3 & 2 \\ -2 & 1 & -6 & -3 \\ 1 & 1 & 3 & 3 \end{pmatrix}. Which of the following sets of vectors forms a basis for the null space of AA?

  1. {(3010),(2101)}\left\{ \begin{pmatrix} 3 \\ 0 \\ 1 \\ 0 \end{pmatrix}, \begin{pmatrix} 2 \\ 1 \\ 0 \\ 1 \end{pmatrix} \right\}
  2. {(121),(011)}\left\{ \begin{pmatrix} 1 \\ -2 \\ 1 \end{pmatrix}, \begin{pmatrix} 0 \\ 1 \\ 1 \end{pmatrix} \right\}
  3. {(3010),(2101)}\left\{ \begin{pmatrix} -3 \\ 0 \\ 1 \\ 0 \end{pmatrix}, \begin{pmatrix} -2 \\ -1 \\ 0 \\ 1 \end{pmatrix} \right\} (correct answer)
  4. {(5111)}\left\{ \begin{pmatrix} -5 \\ -1 \\ 1 \\ 1 \end{pmatrix} \right\}
Explanation: To find a basis for the null space, we solve Ax=0A\vec{x} = \vec{0} by row reducing the matrix AA. (103221631133)(103201010101)(103201010000)\begin{pmatrix} 1 & 0 & 3 & 2 \\ -2 & 1 & -6 & -3 \\ 1 & 1 & 3 & 3 \end{pmatrix} \sim \begin{pmatrix} 1 & 0 & 3 & 2 \\ 0 & 1 & 0 & 1 \\ 0 & 1 & 0 & 1 \end{pmatrix} \sim \begin{pmatrix} 1 & 0 & 3 & 2 \\ 0 & 1 & 0 & 1 \\ 0 & 0 & 0 & 0 \end{pmatrix} The system is x1+3x3+2x4=0x_1 + 3x_3 + 2x_4 = 0 and x2+x4=0x_2 + x_4 = 0. The variables x3x_3 and x4x_4 are free. Let x3=sx_3 = s and x4=tx_4 = t. Then x1=3s2tx_1 = -3s - 2t and x2=tx_2 = -t. The solution in parametric vector form is x=s(3010)+t(2101)\vec{x} = s \begin{pmatrix} -3 \\ 0 \\ 1 \\ 0 \end{pmatrix} + t \begin{pmatrix} -2 \\ -1 \\ 0 \\ 1 \end{pmatrix}. The two vectors in this form make up the basis for the null space.

Question 5

The set of solutions to a homogeneous system Ax=0A\vec{x} = \vec{0} is given by the parametric vector form x=s(2100)+t(5031)\vec{x} = s \begin{pmatrix} -2 \\ 1 \\ 0 \\ 0 \end{pmatrix} + t \begin{pmatrix} 5 \\ 0 \\ -3 \\ 1 \end{pmatrix} for s,tRs, t \in \mathbb{R}. Which of the following matrices could be the reduced row echelon form of AA?

  1. (120500130000)\begin{pmatrix} 1 & -2 & 0 & 5 \\ 0 & 0 & 1 & -3 \\ 0 & 0 & 0 & 0 \end{pmatrix}
  2. (120500130000)\begin{pmatrix} 1 & 2 & 0 & -5 \\ 0 & 0 & 1 & 3 \\ 0 & 0 & 0 & 0 \end{pmatrix} (correct answer)
  3. (102501030000)\begin{pmatrix} 1 & 0 & 2 & -5 \\ 0 & 1 & 0 & 3 \\ 0 & 0 & 0 & 0 \end{pmatrix}
  4. (21005031)\begin{pmatrix} -2 & 1 & 0 & 0 \\ 5 & 0 & -3 & 1 \end{pmatrix}
Explanation: The solution shows that x2x_2 and x4x_4 are free variables, let x2=sx_2=s and x4=tx_4=t. The pivot variables are x1x_1 and x3x_3. From the solution vector, we can write the equations for the pivot variables in terms of the free variables: x1=2s+5tx_1 = -2s + 5t and x3=0s3tx_3 = 0s - 3t. Rearranging these to match the RREF system gives x1+2s5t=0    x1+2x25x4=0x_1 + 2s - 5t = 0 \implies x_1 + 2x_2 - 5x_4 = 0, and x3+3t=0    x3+3x4=0x_3 + 3t = 0 \implies x_3 + 3x_4 = 0. These two equations correspond to the first two rows of the RREF matrix. The first row must be (1205)\begin{pmatrix} 1 & 2 & 0 & -5 \end{pmatrix} and the second row must be (0013)\begin{pmatrix} 0 & 0 & 1 & 3 \end{pmatrix}.

Question 6

Let AA be a 4×34 \times 3 matrix with columns a1,a2,a3\vec{a}_1, \vec{a}_2, \vec{a}_3. Suppose the set {a1,a2}\{\vec{a}_1, \vec{a}_2\} is linearly independent and a3=2a1a2\vec{a}_3 = 2\vec{a}_1 - \vec{a}_2. What is the dimension of the null space of AA?

  1. 0
  2. 1 (correct answer)
  3. 2
  4. 3
Explanation: The column space of AA is spanned by its columns, {a1,a2,a3}\{\vec{a}_1, \vec{a}_2, \vec{a}_3\}. Since a3\vec{a}_3 is a linear combination of a1\vec{a}_1 and a2\vec{a}_2, it does not add to the dimension of the space spanned by {a1,a2}\{\vec{a}_1, \vec{a}_2\}. We are given that {a1,a2}\{\vec{a}_1, \vec{a}_2\} is a linearly independent set, so it forms a basis for the column space of AA. Thus, the dimension of the column space, rank(A)\text{rank}(A), is 2. The matrix AA is 4×34 \times 3, so it has n=3n=3 columns. By the Rank-Nullity Theorem, rank(A)+dim(Nul(A))=n\text{rank}(A) + \text{dim}(\text{Nul}(A)) = n, which gives 2+dim(Nul(A))=32 + \text{dim}(\text{Nul}(A)) = 3. Therefore, the dimension of the null space is 32=13 - 2 = 1.

Question 7

Let CC be a 4×54 \times 5 matrix with rank 3. If vectors u\mathbf{u} and v\mathbf{v} are both in the null space of CC, and w=2u3v\mathbf{w} = 2\mathbf{u} - 3\mathbf{v}, which of the following must be true about w\mathbf{w}?

  1. w\mathbf{w} is in the column space of CC if and only if u\mathbf{u} and v\mathbf{v} are linearly dependent
  2. w\mathbf{w} is in the null space of CC and has the same magnitude as 2u+3v2\mathbf{u} + 3\mathbf{v}
  3. w\mathbf{w} is in the null space of CC but may not span the entire null space with u\mathbf{u} and v\mathbf{v}
  4. w\mathbf{w} is orthogonal to every vector in the column space of CC and lies in a 2-dimensional subspace (correct answer)
Explanation: Since CC has rank 3 and is 4×54 \times 5, the null space has dimension 53=25 - 3 = 2. The null space is a subspace, so any linear combination of vectors in it (like w=2u3v\mathbf{w} = 2\mathbf{u} - 3\mathbf{v}) is also in the null space. Vectors in the null space are orthogonal to all row vectors of CC, which span the row space. For matrices, the row space and column space have the same dimension, and the null space is orthogonal to the row space. Choice A is wrong (null space and column space are generally disjoint), Choice B is wrong about magnitude, Choice C is correct about null space membership but wrong about spanning (this depends on linear independence), Choice D correctly identifies both properties.

Question 8

A 3×43 \times 4 matrix DD has the property that its null space contains the vector [1210]\begin{bmatrix} 1 \\ -2 \\ 1 \\ 0 \end{bmatrix}. If the column space of DD is 2-dimensional, what can be concluded about the system Dx=0D\mathbf{x} = \mathbf{0}?

  1. It has exactly one free variable, and all solutions are scalar multiples of the given vector
  2. It has exactly two free variables, and the solution space includes but is not limited to scalar multiples of the given vector (correct answer)
  3. It has exactly three free variables, since the rank of DD is 1 based on the column space dimension
  4. It has exactly two free variables, and every solution must have its first and third components equal
Explanation: Since DD is 3×43 \times 4 with a 2-dimensional column space, rank(DD) = 2. By the rank-nullity theorem, nullity(DD) = 42=24 - 2 = 2, meaning there are 2 free variables. The null space is 2-dimensional, so while the given vector is in the null space, it doesn't span the entire null space (which would require 2 linearly independent vectors). Choice A is wrong about the number of free variables, Choice C miscalculates the rank, Choice D makes an unjustified claim about component relationships, Choice B correctly identifies 2 free variables and that the solution space is larger than just scalar multiples of one vector.

Question 9

Matrix EE has columns c1,c2,c3,c4\mathbf{c}_1, \mathbf{c}_2, \mathbf{c}_3, \mathbf{c}_4 where c1+2c2c3=0\mathbf{c}_1 + 2\mathbf{c}_2 - \mathbf{c}_3 = \mathbf{0} and c4\mathbf{c}_4 is not in the span of {c1,c2,c3}\{\mathbf{c}_1, \mathbf{c}_2, \mathbf{c}_3\}. If EE is a 5×45 \times 4 matrix, what is the dimension of the null space of EE?

  1. 1, because there is exactly one linear dependence relation among the columns
  2. 2, because the rank is 2 and we apply the rank-nullity theorem
  3. 3, because three of the four columns are linearly dependent
  4. 1, because the rank is 3 and we apply the rank-nullity theorem (correct answer)
Explanation: The given relation c1+2c2c3=0\mathbf{c}_1 + 2\mathbf{c}_2 - \mathbf{c}_3 = \mathbf{0} shows that c3\mathbf{c}_3 is in the span of {c1,c2}\{\mathbf{c}_1, \mathbf{c}_2\}, so these three vectors span at most a 2-dimensional space. Since c4\mathbf{c}_4 is not in span{c1,c2,c3}=\{\mathbf{c}_1, \mathbf{c}_2, \mathbf{c}_3\} = span{c1,c2}\{\mathbf{c}_1, \mathbf{c}_2\}, we have that {c1,c2,c4}\{\mathbf{c}_1, \mathbf{c}_2, \mathbf{c}_4\} are linearly independent (assuming c1,c2\mathbf{c}_1, \mathbf{c}_2 are linearly independent). Thus rank(EE) = 3. By rank-nullity theorem: nullity = 43=14 - 3 = 1. Choice A gives the right answer but wrong reasoning, Choice B miscalculates the rank, Choice C confuses the concept, Choice D gives correct reasoning and answer.

Question 10

Let FF be a 3×53 \times 5 matrix such that the system Fx=[101]F\mathbf{x} = \begin{bmatrix} 1 \\ 0 \\ -1 \end{bmatrix} has infinitely many solutions. What is the maximum possible dimension of the column space of FF?

  1. 3, because FF maps from R5\mathbb{R}^5 to R3\mathbb{R}^3 and the given vector is in the column space (correct answer)
  2. 2, because having infinitely many solutions requires the null space to be non-trivial, limiting the rank
  3. 1, because the consistency condition severely restricts the possible column relationships in FF
  4. 2, because the given vector must be expressible as a linear combination of exactly two linearly independent columns
Explanation: If the system Fx=bF\mathbf{x} = \mathbf{b} has infinitely many solutions, then it has at least one solution (consistency) and the null space of FF is non-trivial (infinitely many solutions). However, this doesn't prevent FF from having full row rank. A 3×53 \times 5 matrix can have rank at most 3, and having infinitely many solutions just means nullity ≥ 1, so rank ≤ 4. Since the maximum rank is 3 anyway, the column space can indeed be 3-dimensional. The given vector being in the column space doesn't restrict the dimension. Choice B incorrectly assumes infinitely many solutions severely limits rank, Choices C and D underestimate the maximum possible rank.

Question 11

Matrix GG is formed by taking the first three columns of a 4×64 \times 6 matrix HH that has rank 4. If the null space of GG is 2-dimensional, what can be concluded about the relationship between the columns of HH?

  1. Columns 4, 5, and 6 of HH must each be linear combinations of the first three columns
  2. At least one of columns 4, 5, or 6 of HH must be linearly independent from the first three columns (correct answer)
  3. Columns 1, 2, and 3 of HH form a linearly independent set that spans R4\mathbb{R}^4
  4. The first three columns of HH have the same span as some subset of columns 4, 5, and 6
Explanation: Since GG is 4×34 \times 3 with a 2-dimensional null space, rank(GG) = 32=13 - 2 = 1. This means the first three columns of HH span only a 1-dimensional space. Since HH has rank 4, its columns span a 4-dimensional space. Therefore, columns 4, 5, and 6 must contribute additional dimensions beyond what the first three columns provide. At least one of the last three columns must be linearly independent from the first three. Choice A is wrong (would make rank of HH at most 1), Choice C is wrong (first three columns have rank 1, not 3), Choice D is incorrect about equal spans.

Question 12

Let KK be a 4×44 \times 4 matrix with the property that K2=KK^2 = K. If the null space of KK has dimension 2, what is the dimension of the intersection of the column space and null space of KK?

  1. 0, because the column space and null space of any matrix are disjoint subspaces
  2. 1, because the idempotent property creates exactly one vector common to both spaces
  3. 0, because idempotent matrices with 2-dimensional null spaces have complementary column and null spaces (correct answer)
  4. 2, because the null space is entirely contained within the column space for idempotent matrices
Explanation: When you encounter idempotent matrices (where K2=KK^2 = K), think about how this special property creates a fundamental relationship between the column space and null space that differs from general matrices. For any idempotent matrix, every vector v\mathbf{v} in R4\mathbb{R}^4 can be uniquely decomposed as v=Kv+(IK)v\mathbf{v} = K\mathbf{v} + (I-K)\mathbf{v}, where KvK\mathbf{v} lies in the column space and (IK)v(I-K)\mathbf{v} lies in the null space. This decomposition proves that R4=Col(K)Null(K)\mathbb{R}^4 = \text{Col}(K) \oplus \text{Null}(K) — the column space and null space are complementary subspaces that intersect only at the zero vector. Since dim(Null(K))=2\dim(\text{Null}(K)) = 2 and these spaces are complementary in R4\mathbb{R}^4, we have dim(Col(K))=42=2\dim(\text{Col}(K)) = 4 - 2 = 2. Because they're complementary, dim(Col(K)Null(K))=0\dim(\text{Col}(K) \cap \text{Null}(K)) = 0. Option A is wrong because while it reaches the correct conclusion, the reasoning is false — general matrices can have overlapping column and null spaces. Option B incorrectly assumes the idempotent property forces exactly one shared vector beyond zero. Option D makes the major error of claiming the null space is contained in the column space, which would contradict their complementary relationship. Study tip: Remember that idempotent matrices act like "projections" — they split the space into two complementary pieces (column space and null space) that only meet at zero. This complementary relationship is the key insight for solving these problems.

Question 13

Consider a 5×45 \times 4 matrix JJ where every vector in R4\mathbb{R}^4 can be written uniquely as v+w\mathbf{v} + \mathbf{w} where v\mathbf{v} \in null(JJ) and JwJ\mathbf{w} \in column(JJ). What must be true about the rank of JJ?

  1. The rank must be 4, because this decomposition property requires JJ to have full column rank (correct answer)
  2. The rank must be 2, because the decomposition requires the null space and its complement to have equal dimensions
  3. The rank could be any value from 1 to 4, depending on the specific entries of JJ
  4. The rank must be 3, because the constraint forces a specific balance between null space and column space dimensions
Explanation: The given condition describes the fundamental theorem of linear algebra: every vector in the domain can be uniquely decomposed into components from the null space and row space. For this decomposition to be unique for every vector in R4\mathbb{R}^4, we need null(JJ) and row(JJ) to be complementary subspaces that together span R4\mathbb{R}^4. This happens if and only if JJ has full column rank, i.e., rank(JJ) = 4. If rank < 4, then null(JJ) has dimension > 0 and row(JJ) has dimension < 4, so they can't span all of R4\mathbb{R}^4. Choice B incorrectly assumes equal dimensions are required, Choices C and D don't recognize the full rank requirement.

Question 14

Let AA be a 4×64 \times 6 matrix. Which of the following statements correctly describes the column space, Col(A)\text{Col}(A), and the null space, Nul(A)\text{Nul}(A)?

  1. Col(A)\text{Col}(A) is a subspace of R4\mathbb{R}^4 and Nul(A)\text{Nul}(A) is a subspace of R6\mathbb{R}^6. (correct answer)
  2. Col(A)\text{Col}(A) is a subspace of R6\mathbb{R}^6 and Nul(A)\text{Nul}(A) is a subspace of R4\mathbb{R}^4.
  3. Both Col(A)\text{Col}(A) and Nul(A)\text{Nul}(A) are subspaces of R4\mathbb{R}^4.
  4. Both Col(A)\text{Col}(A) and Nul(A)\text{Nul}(A) are subspaces of R6\mathbb{R}^6.
Explanation: For an m×nm \times n matrix AA, the column space is the span of the column vectors. Since AA is 4×64 \times 6, its columns are vectors in R4\mathbb{R}^4. Thus, Col(A)\text{Col}(A) is a subspace of R4\mathbb{R}^4. The null space is the set of all vectors x\vec{x} such that Ax=0A\vec{x} = \vec{0}. For the matrix-vector product AxA\vec{x} to be defined, x\vec{x} must have as many entries as AA has columns. Since AA has 6 columns, x\vec{x} must be in R6\mathbb{R}^6. Thus, Nul(A)\text{Nul}(A) is a subspace of R6\mathbb{R}^6.

Question 15

Let AA be a 3×43 \times 4 matrix. Which of the following combinations for the dimensions of the column space and null space of AA is impossible?

  1. dim(Col(A))=3\text{dim}(\text{Col}(A)) = 3 and dim(Nul(A))=1\text{dim}(\text{Nul}(A)) = 1.
  2. dim(Col(A))=2\text{dim}(\text{Col}(A)) = 2 and dim(Nul(A))=2\text{dim}(\text{Nul}(A)) = 2.
  3. dim(Col(A))=1\text{dim}(\text{Col}(A)) = 1 and dim(Nul(A))=3\text{dim}(\text{Nul}(A)) = 3.
  4. dim(Col(A))=4\text{dim}(\text{Col}(A)) = 4 and dim(Nul(A))=0\text{dim}(\text{Nul}(A)) = 0. (correct answer)
Explanation: For an m×nm \times n matrix, the dimension of the column space (rank) cannot exceed the number of rows or columns. For a 3×43 \times 4 matrix, the rank must be less than or equal to min(3,4)=3\min(3, 4) = 3. Therefore, it is impossible for the dimension of the column space to be 4. Additionally, the Rank-Nullity Theorem states that rank(A)+nullity(A)=n\text{rank}(A) + \text{nullity}(A) = n. For choices A, B, and C, the sum is 3+1=43+1=4, 2+2=42+2=4, and 1+3=41+3=4, which is consistent with n=4n=4. For choice D, the sum is 4+0=44+0=4, but the rank of 4 is impossible.

Question 16

A linear transformation T:R5R3T: \mathbb{R}^5 \to \mathbb{R}^3 is defined by T(x)=AxT(\vec{x}) = A\vec{x}. If TT is surjective (onto), what is the dimension of the kernel of TT?

  1. 0
  2. 2 (correct answer)
  3. 3
  4. 5
Explanation: The linear transformation TT maps from R5\mathbb{R}^5 to R3\mathbb{R}^3, so its standard matrix AA is 3×53 \times 5. The kernel of TT is the null space of AA, and the range of TT is the column space of AA. If TT is surjective, its range is the entire codomain, R3\mathbb{R}^3. This means the dimension of the range (and thus the dimension of the column space, or rank of AA) is 3. By the Rank-Nullity Theorem, rank(A)+dim(Nul(A))=n\text{rank}(A) + \text{dim}(\text{Nul}(A)) = n. Here, rank(A)=3\text{rank}(A) = 3 and n=5n=5. So, 3+dim(Nul(A))=53 + \text{dim}(\text{Nul}(A)) = 5. The dimension of the null space (kernel) is 53=25 - 3 = 2.

Question 17

For what value of hh is the vector b=(15h)\vec{b} = \begin{pmatrix} 1 \\ 5 \\ h \end{pmatrix} in the column space of the matrix A=(112202123)A = \begin{pmatrix} 1 & -1 & 2 \\ 2 & 0 & 2 \\ -1 & 2 & -3 \end{pmatrix}?

  1. h=2.5h = -2.5
  2. h=0.5h = 0.5 (correct answer)
  3. h=1.5h = 1.5
  4. h=5.0h = 5.0
Explanation: The vector b\vec{b} is in the column space of AA if the system Ax=bA\vec{x} = \vec{b} is consistent. We analyze the augmented matrix [Ab][A|\vec{b}] via row reduction: (11212025123h)R22R1,R3+R1(11210223011h+1)\begin{pmatrix} 1 & -1 & 2 & 1 \\ 2 & 0 & 2 & 5 \\ -1 & 2 & -3 & h \end{pmatrix} \xrightarrow{R_2-2R_1, R_3+R_1} \begin{pmatrix} 1 & -1 & 2 & 1 \\ 0 & 2 & -2 & 3 \\ 0 & 1 & -1 & h+1 \end{pmatrix} Now, we perform the operation R312R2R_3 - \frac{1}{2}R_2: (11210223000(h+1)12(3))\begin{pmatrix} 1 & -1 & 2 & 1 \\ 0 & 2 & -2 & 3 \\ 0 & 0 & 0 & (h+1) - \frac{1}{2}(3) \end{pmatrix} For the system to be consistent, the last entry in the last row must be zero. So, (h+1)1.5=0(h+1) - 1.5 = 0, which simplifies to h0.5=0h - 0.5 = 0. Therefore, h=0.5h=0.5.

Question 18

Let A=(120324183623)A = \begin{pmatrix} 1 & -2 & 0 & 3 \\ 2 & -4 & 1 & 8 \\ -3 & 6 & 2 & 3 \end{pmatrix}. What is the dimension of the null space of AA, denoted dim(Nul(A))\text{dim}(\text{Nul}(A))?

  1. 1 (correct answer)
  2. 2
  3. 3
  4. 4
Explanation: To find the dimension of the null space, we determine the number of free variables in the solution to Ax=0A\vec{x} = \vec{0}. We row reduce the matrix AA: (120324183623)(1203001200212)(120300120008)\begin{pmatrix} 1 & -2 & 0 & 3 \\ 2 & -4 & 1 & 8 \\ -3 & 6 & 2 & 3 \end{pmatrix} \sim \begin{pmatrix} 1 & -2 & 0 & 3 \\ 0 & 0 & 1 & 2 \\ 0 & 0 & 2 & 12 \end{pmatrix} \sim \begin{pmatrix} 1 & -2 & 0 & 3 \\ 0 & 0 & 1 & 2 \\ 0 & 0 & 0 & 8 \end{pmatrix} This matrix has three pivot columns (columns 1, 3, and 4). The number of columns is 4. The dimension of the null space is the number of non-pivot columns, which is 43=14 - 3 = 1. The second column corresponds to the free variable.

Question 19

Let A=(102011124)A = \begin{pmatrix} 1 & 0 & -2 \\ 0 & 1 & 1 \\ -1 & 2 & 4 \end{pmatrix} and v=(214)\vec{v} = \begin{pmatrix} 2 \\ -1 \\ 4 \end{pmatrix}. Which statement accurately describes the vector v\vec{v}?

  1. The vector v\vec{v} is in the null space of AA.
  2. The vector v\vec{v} is in the column space of AA.
  3. The vector v\vec{v} is in both the null space and the column space of AA.
  4. The vector v\vec{v} is in neither the null space nor the column space of AA. (correct answer)
Explanation: To check if v\vec{v} is in the null space, we compute AvA\vec{v}. Av=(1(2)+0(1)2(4)0(2)+1(1)+1(4)1(2)+2(1)+4(4))=(6312)A\vec{v} = \begin{pmatrix} 1(2) + 0(-1) - 2(4) \\ 0(2) + 1(-1) + 1(4) \\ -1(2) + 2(-1) + 4(4) \end{pmatrix} = \begin{pmatrix} -6 \\ 3 \\ 12 \end{pmatrix}. Since Av0A\vec{v} \neq \vec{0}, v\vec{v} is not in the null space. To check if v\vec{v} is in the column space, we check if Ax=vA\vec{x} = \vec{v} is consistent by row reducing the augmented matrix [Av][A|\vec{v}]: (102201111244)(102201110226)(102201110008)\begin{pmatrix} 1 & 0 & -2 & 2 \\ 0 & 1 & 1 & -1 \\ -1 & 2 & 4 & 4 \end{pmatrix} \sim \begin{pmatrix} 1 & 0 & -2 & 2 \\ 0 & 1 & 1 & -1 \\ 0 & 2 & 2 & 6 \end{pmatrix} \sim \begin{pmatrix} 1 & 0 & -2 & 2 \\ 0 & 1 & 1 & -1 \\ 0 & 0 & 0 & 8 \end{pmatrix} The last row corresponds to the equation 0=80 = 8, which is a contradiction. The system is inconsistent, so v\vec{v} is not in the column space.