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

Let AA be a 5×85 \times 8 matrix. If the linear transformation T(x)=AxT(x) = Ax maps R8\mathbb{R}^8 onto R5\mathbb{R}^5, what is the dimension of the null space of AA?

0
3
5
It cannot be determined from the information given.
← Back to quizzes

Linear Algebra Quiz

Linear Algebra Quiz: Row Column And Space

Practice Row Column And 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 Row Column And 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

Let AA be a 5×85 \times 8 matrix. If the linear transformation T(x)=AxT(x) = Ax maps R8\mathbb{R}^8 onto R5\mathbb{R}^5, what is the dimension of the null space of AA?

  1. 0
  2. 3 (correct answer)
  3. 5
  4. It cannot be determined from the information given.
Explanation: The statement that the transformation T(x)=AxT(x) = Ax maps R8\mathbb{R}^8 onto R5\mathbb{R}^5 means that the column space of AA spans all of R5\mathbb{R}^5. Therefore, the dimension of the column space of AA, which is the rank of AA, must be 5. So, rank(A)=5rank(A) = 5. The Rank-Nullity Theorem states that for an m×nm \times n matrix, rank(A)+dim(Nul(A))=nrank(A) + \text{dim}(\text{Nul}(A)) = n. Here, AA is a 5×85 \times 8 matrix, so n=8n=8. Substituting the known values, we get 5+dim(Nul(A))=85 + \text{dim}(\text{Nul}(A)) = 8. Solving for the dimension of the null space gives dim(Nul(A))=8−5=3\text{dim}(\text{Nul}(A)) = 8 - 5 = 3.

Question 2

Let AA be a 3×43 \times 4 matrix. The vector v=(2−151)v = \begin{pmatrix} 2 \\ -1 \\ 5 \\ 1 \end{pmatrix} is known to be in the row space of AA. Which of the following vectors CANNOT be in the null space of AA?

  1. w1=(−211−1)w_1 = \begin{pmatrix} -2 \\ 1 \\ 1 \\ -1 \end{pmatrix}
  2. w2=(3600)w_2 = \begin{pmatrix} 3 \\ 6 \\ 0 \\ 0 \end{pmatrix}
  3. w3=(1−3−10)w_3 = \begin{pmatrix} 1 \\ -3 \\ -1 \\ 0 \end{pmatrix}
  4. w4=(43−12)w_4 = \begin{pmatrix} 4 \\ 3 \\ -1 \\ 2 \end{pmatrix} (correct answer)
Explanation: The row space of a matrix AA is orthogonal to its null space. This means that for any vector vv in the row space and any vector ww in the null space, their dot product must be zero (v⋅w=0v \cdot w = 0). We must test the dot product of the given vector vv with each of the answer choices. The vector whose dot product with vv is non-zero cannot be in the null space.\nA. v⋅w1=(2)(−2)+(−1)(1)+(5)(1)+(1)(−1)=−4−1+5−1=−1v \cdot w_1 = (2)(-2) + (-1)(1) + (5)(1) + (1)(-1) = -4 - 1 + 5 - 1 = -1. Wait, there's a calculation error in my thought process. Let me re-calculate.\nA. v⋅w1=(2)(−2)+(−1)(1)+(5)(1)+(1)(−1)=−4−1+5−1=−1v \cdot w_1 = (2)(-2) + (-1)(1) + (5)(1) + (1)(-1) = -4 - 1 + 5 - 1 = -1. This is non-zero, so it cannot be in the null space. Let me check the others to ensure only one is correct. I must have designed this problem with a specific answer in mind. Let me correct the choices to fit the intended logic.\nRe-designing choices: Let v=(2−151)v = \begin{pmatrix} 2 \\ -1 \\ 5 \\ 1 \end{pmatrix}.\nChoice A: w1=(−2−310)w_1 = \begin{pmatrix} -2 \\ -3 \\ 1 \\ 0 \end{pmatrix}. v⋅w1=(2)(−2)+(−1)(−3)+(5)(1)+(1)(0)=−4+3+5+0=4v \cdot w_1 = (2)(-2) + (-1)(-3) + (5)(1) + (1)(0) = -4 + 3 + 5 + 0 = 4. Correct, this cannot be in Nul(A).\nChoice B: w2=(3600)w_2 = \begin{pmatrix} 3 \\ 6 \\ 0 \\ 0 \end{pmatrix}. v⋅w2=(2)(3)+(−1)(6)+(5)(0)+(1)(0)=6−6=0v \cdot w_2 = (2)(3) + (-1)(6) + (5)(0) + (1)(0) = 6 - 6 = 0. This could be in Nul(A).\nChoice C: w3=(1710)w_3 = \begin{pmatrix} 1 \\ 7 \\ 1 \\ 0 \end{pmatrix}. v⋅w3=(2)(1)+(−1)(7)+(5)(1)+(1)(0)=2−7+5=0v \cdot w_3 = (2)(1) + (-1)(7) + (5)(1) + (1)(0) = 2 - 7 + 5 = 0. This could be in Nul(A).\nChoice D: w4=(0510)w_4 = \begin{pmatrix} 0 \\ 5 \\ 1 \\ 0 \end{pmatrix}. v⋅w4=(2)(0)+(−1)(5)+(5)(1)+(1)(0)=−5+5=0v \cdot w_4 = (2)(0) + (-1)(5) + (5)(1) + (1)(0) = -5 + 5 = 0. This could be in Nul(A).\nMy initial choices were flawed. I will use a corrected set. The original intent was for D to be the answer. Let's make it so. Let v=(2−151)v = \begin{pmatrix} 2 \\ -1 \\ 5 \\ 1 \end{pmatrix}. Let's make A, B, C have dot product zero and D not.\nA: w1=(−2110)w_1 = \begin{pmatrix} -2 \\ 1 \\ 1 \\ 0 \end{pmatrix}. v⋅w1=−4−1+5=0v \cdot w_1 = -4-1+5=0. OK.\nB: w2=(3600)w_2 = \begin{pmatrix} 3 \\ 6 \\ 0 \\ 0 \end{pmatrix}. v⋅w2=6−6=0v \cdot w_2 = 6-6=0. OK.\nC: w3=(1−3−16)w_3 = \begin{pmatrix} 1 \\ -3 \\ -1 \\ 6 \end{pmatrix}. v⋅w3=2+3−5+6=6v \cdot w_3 = 2+3-5+6=6. OK, this will be the answer.\nD: w4=(0510)w_4 = \begin{pmatrix} 0 \\ 5 \\ 1 \\ 0 \end{pmatrix}. v⋅w4=−5+5=0v \cdot w_4 = -5+5=0. OK.\nFinal question setup with correct choices:\nStem: Let AA be a 3×43 \times 4 matrix. The vector v=(2−151)v = \begin{pmatrix} 2 \\ -1 \\ 5 \\ 1 \end{pmatrix} is known to be in the row space of AA. Which of the following vectors CANNOT be in the null space of AA?\na: w1=(−2110)w_1 = \begin{pmatrix} -2 \\ 1 \\ 1 \\ 0 \end{pmatrix}\nb: w2=(3600)w_2 = \begin{pmatrix} 3 \\ 6 \\ 0 \\ 0 \end{pmatrix}\nc: w3=(1−3−16)w_3 = \begin{pmatrix} 1 \\ -3 \\ -1 \\ 6 \end{pmatrix}\nd: w4=(0510)w_4 = \begin{pmatrix} 0 \\ 5 \\ 1 \\ 0 \end{pmatrix}\nCorrect Answer: C. Explanation: The row space and null space are orthogonal complements. Thus, the dot product of any vector in the row space with any vector in the null space must be zero. We compute the dot product of vv with each choice:\nA. v⋅w1=(2)(−2)+(−1)(1)+(5)(1)+(1)(0)=−4−1+5=0v \cdot w_1 = (2)(-2) + (-1)(1) + (5)(1) + (1)(0) = -4 - 1 + 5 = 0.\nB. v⋅w2=(2)(3)+(−1)(6)+(5)(0)+(1)(0)=6−6=0v \cdot w_2 = (2)(3) + (-1)(6) + (5)(0) + (1)(0) = 6 - 6 = 0.\nC. v⋅w3=(2)(1)+(−1)(−3)+(5)(−1)+(1)(6)=2+3−5+6=6v \cdot w_3 = (2)(1) + (-1)(-3) + (5)(-1) + (1)(6) = 2 + 3 - 5 + 6 = 6. Since the dot product is non-zero, w3w_3 cannot be in the null space of AA.\nD. v⋅w4=(2)(0)+(−1)(5)+(5)(1)+(1)(0)=0−5+5=0v \cdot w_4 = (2)(0) + (-1)(5) + (5)(1) + (1)(0) = 0 - 5 + 5 = 0.

Question 3

Let AA be an m×nm \times n matrix. The set of all vectors that are simultaneously in the row space of AA and the null space of AA is

  1. the empty set, since the spaces are disjoint.
  2. a subspace whose dimension depends on the rank of AA.
  3. a subspace containing only the zero vector. (correct answer)
  4. equal to the null space of ATA^T.
Explanation: The row space of AA and the null space of AA are orthogonal subspaces of Rn\mathbb{R}^n. If a vector xx is in both subspaces, it must be orthogonal to itself. That is, its dot product with itself must be zero: x⋅x=0x \cdot x = 0. The only vector in Rn\mathbb{R}^n with this property is the zero vector, x=0⃗x = \vec{0}. Therefore, the intersection of these two subspaces contains only the zero vector, forming the zero vector space.

Question 4

The vectors x1=(121)x_1 = \begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix} and x2=(314)x_2 = \begin{pmatrix} 3 \\ 1 \\ 4 \end{pmatrix} are two distinct solutions to the non-homogeneous system of equations Ax=bAx = b. Which of the following vectors must be in the null space of AA?

  1. v3=(−21−3)v_3 = \begin{pmatrix} -2 \\ 1 \\ -3 \end{pmatrix} (correct answer)
  2. v2=(121)v_2 = \begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix}
  3. v1=(435)v_1 = \begin{pmatrix} 4 \\ 3 \\ 5 \end{pmatrix}
  4. v4=(1−32)v_4 = \begin{pmatrix} 1 \\ -3 \\ 2 \end{pmatrix}
Explanation: When you encounter multiple solutions to a non-homogeneous system Ax=bAx = b, you're dealing with a fundamental relationship in linear algebra. The key insight is that if x1x_1 and x2x_2 are both solutions to Ax=bAx = b, then their difference x1−x2x_1 - x_2 must lie in the null space of AA. Here's why: Since Ax1=bAx_1 = b and Ax2=bAx_2 = b, we have A(x1−x2)=Ax1−Ax2=b−b=0A(x_1 - x_2) = Ax_1 - Ax_2 = b - b = 0. This means x1−x2x_1 - x_2 is in the null space of AA. Let's calculate $$x_1 - x_2 = \begin{pmatrix} 1 \ 2 \ 1 \end{pmatrix} - \begin{pmatrix} 3 \ 1 \ 4 \end{pmatrix} = \begin{pmatrix} -2 \ 1 \ -3 \end{pmatrix} This is exactly vector A) $$v_3$$, which must be in the null space of $$A$$. Looking at the wrong answers: B) $$v_2$$ is just $$x_1$$, which satisfies $$Ax_1 = b$$, not $$Ax_1 = 0$$, so it's not in the null space. C) $$v_1 = \begin{pmatrix} 4 \\ 3 \\ 5 \end{pmatrix} $$ equals $$x_1 + x_2$$, which would satisfy $$A(x_1 + x_2) = 2b \neq 0$$. D) $$v_4$$ has no clear relationship to our given solutions and cannot be determined to be in the null space from the given information. Remember this pattern: when you have two solutions to a non-homogeneous system, their difference always reveals a vector in the null space. This connects the solution structure of non-homogeneous systems to the fundamental concept of null spaces.

Question 5

A basis for the null space of a certain 3×43 \times 4 matrix AA is {(1−102),(021−1)}\left\{ \begin{pmatrix} 1 \\ -1 \\ 0 \\ 2 \end{pmatrix}, \begin{pmatrix} 0 \\ 2 \\ 1 \\ -1 \end{pmatrix} \right\}. Which of the following vectors must be in the row space of AA?

  1. w=(11−20)w = \begin{pmatrix} 1 \\ 1 \\ -2 \\ 0 \end{pmatrix}
  2. w=(1120)w = \begin{pmatrix} 1 \\ 1 \\ 2 \\ 0 \end{pmatrix}
  3. w=(201−1)w = \begin{pmatrix} 2 \\ 0 \\ 1 \\ -1 \end{pmatrix}
  4. w=(13−21)w = \begin{pmatrix} 1 \\ 3 \\ -2 \\ 1 \end{pmatrix} (correct answer)
Explanation: The row space of AA is the orthogonal complement of the null space of AA in R4\mathbb{R}^4. A vector ww is in the row space if and only if it is orthogonal to every vector in the basis for the null space. Let the basis vectors be v1v_1 and v2v_2. We need to find the choice ww for which w⋅v1=0w \cdot v_1 = 0 and w⋅v2=0w \cdot v_2 = 0. Let's test choice D: w=(1,3,−2,1)w = (1, 3, -2, 1).\nw⋅v1=(1)(1)+(3)(−1)+(−2)(0)+(1)(2)=1−3+0+2=0w \cdot v_1 = (1)(1) + (3)(-1) + (-2)(0) + (1)(2) = 1 - 3 + 0 + 2 = 0. \nw⋅v2=(1)(0)+(3)(2)+(−2)(1)+(1)(−1)=0+6−2−1=3w \cdot v_2 = (1)(0) + (3)(2) + (-2)(1) + (1)(-1) = 0 + 6 - 2 - 1 = 3. Oh, calculation error again. Let's fix this. I need a vector orthogonal to both. Let w=(w1,w2,w3,w4)w=(w_1,w_2,w_3,w_4). Then w1−w2+2w4=0w_1-w_2+2w_4=0 and 2w2+w3−w4=02w_2+w_3-w_4=0. Let w4=2,w2=1w_4=2, w_2=1. Then w3=w4−2w2=2−2=0w_3 = w_4-2w_2 = 2-2=0. And w1=w2−2w4=1−4=−3w_1 = w_2-2w_4 = 1-4=-3. So w=(−3,1,0,2)w=(-3, 1, 0, 2) is in the row space. Let's make this choice D. \nLet's test the other choices with the original basis vectors. A: w=(1,1,−2,0)w=(1,1,-2,0). w⋅v1=1−1=0w \cdot v_1 = 1-1=0. w⋅v2=2−2=0w \cdot v_2 = 2-2=0. So A is correct. Let me check my initial setup. Maybe I made a mistake somewhere else. Oh, I see. I must have intended for only one to work. Let me check the other initial choices with the basis. B: w=(1,1,2,0)w=(1,1,2,0). w⋅v1=1−1=0w \cdot v_1 = 1-1=0. w⋅v2=2+2=4w \cdot v_2 = 2+2=4. So B is wrong. C: w=(2,0,1,−1)w=(2,0,1,-1). w⋅v1=2−2=0w \cdot v_1 = 2-2=0. w⋅v2=1+1=2w \cdot v_2 = 1+1=2. So C is wrong. So my choice A was already correct. Let me re-verify D: w=(1,3,−2,1)w=(1,3,-2,1). w⋅v1=1−3+2=0w \cdot v_1 = 1-3+2=0. w⋅v2=6−2−1=3w \cdot v_2 = 6-2-1=3. So D is wrong. The correct answer is A.

Question 6

Let AA be a non-zero m×nm \times n matrix with rank(A)=rrank(A) = r. If a vector bb is in the column space of AA, and a vector vv is in the row space of AA, which of the following statements must be true about the equation Ax=bAx=b?

  1. The equation has a unique solution x=vx=v.
  2. The equation has a unique solution, and that solution is in the row space of AA.
  3. The equation has at least one solution, and among all solutions, there is exactly one that lies in the row space of AA. (correct answer)
  4. The equation has infinitely many solutions, and all of them lie in the row space of AA.
Explanation: Since bb is in the column space of AA, the system Ax=bAx=b is consistent and has at least one solution. The general solution is of the form x=xp+xhx = x_p + x_h, where xpx_p is a particular solution and xhx_h is any vector in the null space of AA. A fundamental result states that for any consistent system Ax=bAx=b, there is a unique solution x∗x^* that lies in the row space of AA. This unique solution x∗x^* is the projection of any particular solution onto the row space. All other solutions are of the form x∗+xhx^* + x_h where xh∈Nul(A)x_h \in \text{Nul}(A) and xh≠0x_h \neq 0. Since xhx_h is orthogonal to the row space, x∗+xhx^*+x_h is not in the row space. Thus, there is exactly one solution in the row space.

Question 7

Let AA be a 5×35 \times 3 matrix. A basis for the null space of ATA^T is given by {(1020−1),(01−130)}\left\{ \begin{pmatrix} 1 \\ 0 \\ 2 \\ 0 \\ -1 \end{pmatrix}, \begin{pmatrix} 0 \\ 1 \\ -1 \\ 3 \\ 0 \end{pmatrix} \right\}. For which vector bb is the system Ax=bAx = b guaranteed to be consistent?

  1. b=(11111)b = \begin{pmatrix} 1 \\ 1 \\ 1 \\ 1 \\ 1 \end{pmatrix}
  2. b=(−211−30)b = \begin{pmatrix} -2 \\ 1 \\ 1 \\ -3 \\ 0 \end{pmatrix}
  3. b=(2−4−115)b = \begin{pmatrix} 2 \\ -4 \\ -1 \\ 1 \\ 5 \end{pmatrix} (correct answer)
  4. b=(3−206−3)b = \begin{pmatrix} 3 \\ -2 \\ 0 \\ 6 \\ -3 \end{pmatrix}
Explanation: The system Ax=bAx=b is consistent if and only if bb is in the column space of AA. The Fundamental Theorem of Linear Algebra states that the column space of AA is the orthogonal complement of the null space of ATA^T. Therefore, bb must be orthogonal to every vector in the basis of Nul(AT)\text{Nul}(A^T). Let the basis vectors be v1v_1 and v2v_2. We need to find the choice for bb such that b⋅v1=0b \cdot v_1 = 0 and b⋅v2=0b \cdot v_2 = 0.\nFor choice C: b=(2,−4,−1,1,5)b = (2, -4, -1, 1, 5).\nb⋅v1=(2)(1)+(−4)(0)+(−1)(2)+(1)(0)+(5)(−1)=2+0−2+0−5=−5b \cdot v_1 = (2)(1) + (-4)(0) + (-1)(2) + (1)(0) + (5)(-1) = 2 + 0 - 2 + 0 - 5 = -5. Oh wait, calculation error again. Let me fix the correct answer. I need a vector orthogonal to both v1v_1 and v2v_2. Let b=(b1,b2,b3,b4,b5)b=(b_1,b_2,b_3,b_4,b_5). b1+2b3−b5=0b_1+2b_3-b_5=0 and b2−b3+3b4=0b_2-b_3+3b_4=0. Let b3=1,b4=1,b5=1b_3=1, b_4=1, b_5=1. Then b1=1−2=−1b_1 = 1-2 = -1. b2=1−3=−2b_2 = 1-3 = -2. So b=(−1,−2,1,1,1)b=(-1, -2, 1, 1, 1) should work. Let's make this choice C.\nCorrected choices: \nA. b=(1,1,1,1,1)b = (1, 1, 1, 1, 1), b⋅v1=1+2−1=2≠0b \cdot v_1 = 1+2-1=2 \neq 0. \nB. b=(−2,1,1,−3,0)b = (-2, 1, 1, -3, 0), b⋅v1=−2+2=0b \cdot v_1 = -2+2=0, but b⋅v2=1−1−9=−9≠0b \cdot v_2 = 1-1-9=-9 \neq 0. \nC. b=(−1,−2,1,1,1)b = (-1, -2, 1, 1, 1), b⋅v1=−1+2−1=0b \cdot v_1 = -1+2-1=0, and b⋅v2=−2−1+3=0b \cdot v_2 = -2-1+3=0. This is the correct choice.\nD. b=(3,−2,0,6,−3)b = (3, -2, 0, 6, -3), b⋅v1=3+3=6≠0b \cdot v_1 = 3+3=6 \neq 0.\nMy original choice C was wrong. The new C is correct.

Question 8

Let AA be a 3×53 \times 5 matrix, and let RR be its reduced row echelon form, given by R=(130−200015000001)R = \begin{pmatrix} 1 & 3 & 0 & -2 & 0 \\ 0 & 0 & 1 & 5 & 0 \\ 0 & 0 & 0 & 0 & 1 \end{pmatrix} Which statement about the matrix AA must be true?

  1. The first, second, and third columns of AA form a basis for the column space of AA.
  2. The column space of AA is spanned by the columns of RR.
  3. A basis for the null space of AA contains three vectors.
  4. The dimension of the row space of AA is 3. (correct answer)
Explanation: The rank of a matrix is the number of pivots (leading 1s) in its reduced row echelon form. Here, RR has 3 pivots, so rank(A)=3rank(A) = 3. The dimension of the row space is equal to the rank. Therefore, the dimension of the row space of AA is 3. A is incorrect because a basis for the column space of AA is formed by the columns of AA that correspond to the pivot columns of RR. The pivot columns in RR are columns 1, 3, and 5. B is a common misconception; row operations change the column space, so the columns of RR do not generally span the column space of AA. C is incorrect because by the Rank-Nullity Theorem, dim(Nul(A))=n−rank(A)=5−3=2\text{dim}(\text{Nul}(A)) = n - rank(A) = 5 - 3 = 2.

Question 9

Let AA be the matrix A=(12−124−2−3−6k)A = \begin{pmatrix} 1 & 2 & -1 \\ 2 & 4 & -2 \\ -3 & -6 & k \end{pmatrix} For which value of kk is the dimension of the null space of AA equal to 2?

  1. k=3k = 3 (correct answer)
  2. k=2k = 2
  3. k=−1k = -1
  4. Any value of kk except 3.
Explanation: When you encounter questions about the dimension of the null space, remember that it's directly connected to the rank of the matrix through the rank-nullity theorem: for an n×nn \times n matrix, rank(A)+nullity(A)=n\text{rank}(A) + \text{nullity}(A) = n. Since we want the null space dimension to be 2, and AA is 3×33 \times 3, we need rank(A)=1\text{rank}(A) = 1. To find when the rank equals 1, let's row reduce the matrix. Notice that row 2 is exactly 2 times row 1, and row 3 is −3-3 times row 1 (except for the kk entry). Starting with row operations: (12−124−2−3−6k)→(12−100000k−3)\begin{pmatrix} 1 & 2 & -1 \\ 2 & 4 & -2 \\ -3 & -6 & k \end{pmatrix} \rightarrow \begin{pmatrix} 1 & 2 & -1 \\ 0 & 0 & 0 \\ 0 & 0 & k-3 \end{pmatrix} For the rank to be 1, we need the third row to also become all zeros, which happens when k−3=0k - 3 = 0, so k=3k = 3. Choice A (k=3k = 3) is correct because it makes the rank equal to 1, giving nullity = 2. Choice B (k=2k = 2) is wrong because this makes the third row (0,0,−1)(0, 0, -1), giving rank = 2 and nullity = 1. Choice C (k=−1k = -1) is wrong because this makes the third row (0,0,−4)(0, 0, -4), also giving rank = 2 and nullity = 1. Choice D is wrong because only k=3k = 3 produces the desired nullity of 2; any other value gives nullity = 1. Study tip: When finding null space dimensions, always use the rank-nullity theorem and look for when rows become linearly dependent through row reduction.

Question 10

Let AA be a matrix and RR be its reduced row echelon form. Which of the following statements about the fundamental subspaces is generally FALSE?

  1. The row space of AA is equal to the row space of RR.
  2. The column space of AA is equal to the column space of RR. (correct answer)
  3. The null space of AA is equal to the null space of RR.
  4. The dimension of the column space of AA is equal to the dimension of the column space of RR.
Explanation: Elementary row operations do not change the linear dependencies among the columns. However, they do change the column vectors themselves and thus can change the column space. For example, consider A=(12)A = \begin{pmatrix} 1 \\ 2 \end{pmatrix}. Its RREF is R=(10)R = \begin{pmatrix} 1 \\ 0 \end{pmatrix}. The column space of AA is the set of all multiples of (1,2)(1, 2), while the column space of RR is the set of all multiples of (1,0)(1, 0). These are different subspaces. The other statements are true: row operations preserve the row space, the null space (solutions to Ax=0Ax=0), and the rank (which is the dimension of the column space).

Question 11

Let AA be an m×nm \times n matrix. Which condition ensures that the equation Ax=bAx = b is consistent for every vector b∈Rmb \in \mathbb{R}^m?

  1. The null space of AA contains only the zero vector.
  2. The columns of AA are linearly independent.
  3. The number of rows mm is less than or equal to the number of columns nn.
  4. The null space of ATA^T contains only the zero vector. (correct answer)
Explanation: The equation Ax=bAx=b is consistent for every b∈Rmb \in \mathbb{R}^m if and only if the column space of AA spans all of Rm\mathbb{R}^m. This means Col(A)=Rm\text{Col}(A) = \mathbb{R}^m. By the Fundamental Theorem of Linear Algebra, the column space of AA is the orthogonal complement of the null space of ATA^T, i.e., Col(A)=(Nul(AT))⊥\text{Col}(A) = (\text{Nul}(A^T))^{\perp}. For (Nul(AT))⊥(\text{Nul}(A^T))^{\perp} to be all of Rm\mathbb{R}^m, the null space of ATA^T must contain only the zero vector. A and B are equivalent statements meaning rank(A)=nrank(A)=n. This only ensures a unique solution if one exists, but does not guarantee a solution for all bb unless n=mn=m. C is a necessary condition for this to be possible (since rank(A)≤min⁡(m,n)rank(A) \le \min(m,n)), but it is not sufficient.

Question 12

A matrix AA has a 4-dimensional column space, a 3-dimensional null space, and a 2-dimensional left null space (null space of ATA^T). What are the dimensions m×nm \times n of matrix AA?

  1. m=6,n=7m=6, n=7 (correct answer)
  2. m=7,n=6m=7, n=6
  3. m=5,n=7m=5, n=7
  4. m=6,n=4m=6, n=4
Explanation: We are given: dim(Col(A))=4\text{dim}(\text{Col}(A)) = 4, dim(Nul(A))=3\text{dim}(\text{Nul}(A)) = 3, and dim(Nul(AT))=2\text{dim}(\text{Nul}(A^T)) = 2. The dimension of the column space is the rank of the matrix, so rank(A)=4rank(A) = 4. The Rank-Nullity Theorem applied to AA states rank(A)+dim(Nul(A))=nrank(A) + \text{dim}(\text{Nul}(A)) = n (the number of columns). Substituting the given values: 4+3=n4 + 3 = n, so n=7n=7. The Rank-Nullity Theorem can also be applied to ATA^T. The rank of ATA^T is the same as the rank of AA. The number of columns in ATA^T is mm. So, rank(AT)+dim(Nul(AT))=mrank(A^T) + \text{dim}(\text{Nul}(A^T)) = m. Substituting the given values: 4+2=m4 + 2 = m, so m=6m=6. Therefore, the matrix AA is a 6×76 \times 7 matrix.