Linear Algebra Quiz: Subspaces And Tests
20 questions · exam conditions
0:00
Subspaces And TestsQuestion 1 of 20

Let AA be a fixed m×nm \times n matrix and b\mathbf{b} be a fixed non-zero vector in Rm\mathbb{R}^m. Consider the sets S1={xRnAx=0}S_1 = \{\mathbf{x} \in \mathbb{R}^n \mid A\mathbf{x} = \mathbf{0}\} and S2={xRnAx=b}S_2 = \{\mathbf{x} \in \mathbb{R}^n \mid A\mathbf{x} = \mathbf{b}\}. Which statement is correct?

S1S_1 is a subspace of Rn\mathbb{R}^n, but S2S_2 is not a subspace because the zero vector is not in S2S_2.
S2S_2 is a subspace of Rn\mathbb{R}^n, but S1S_1 is not a subspace because it may only contain the zero vector.
Both S1S_1 and S2S_2 are subspaces of Rn\mathbb{R}^n because they are solution sets to systems of linear equations.
Neither S1S_1 nor S2S_2 is a subspace of Rn\mathbb{R}^n unless the matrix AA is invertible.
← Back to quizzes

Linear Algebra Quiz

Linear Algebra Quiz: Subspaces And Tests

Practice Subspaces And Tests 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 Subspaces And Tests, 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 fixed m×nm \times n matrix and b\mathbf{b} be a fixed non-zero vector in Rm\mathbb{R}^m. Consider the sets S1={xRnAx=0}S_1 = \{\mathbf{x} \in \mathbb{R}^n \mid A\mathbf{x} = \mathbf{0}\} and S2={xRnAx=b}S_2 = \{\mathbf{x} \in \mathbb{R}^n \mid A\mathbf{x} = \mathbf{b}\}. Which statement is correct?

  1. S1S_1 is a subspace of Rn\mathbb{R}^n, but S2S_2 is not a subspace because the zero vector is not in S2S_2. (correct answer)
  2. S2S_2 is a subspace of Rn\mathbb{R}^n, but S1S_1 is not a subspace because it may only contain the zero vector.
  3. Both S1S_1 and S2S_2 are subspaces of Rn\mathbb{R}^n because they are solution sets to systems of linear equations.
  4. Neither S1S_1 nor S2S_2 is a subspace of Rn\mathbb{R}^n unless the matrix AA is invertible.
Explanation: S1S_1 is the null space of matrix AA, which is always a subspace of Rn\mathbb{R}^n. S2S_2 is the solution set to a non-homogeneous linear system because b0\mathbf{b} \neq \mathbf{0}. For x=0\mathbf{x} = \mathbf{0}, we have A0=0A\mathbf{0} = \mathbf{0}. Since b0\mathbf{b} \neq \mathbf{0}, A0bA\mathbf{0} \neq \mathbf{b}, which means the zero vector 0\mathbf{0} is not in S2S_2. Therefore, S2S_2 cannot be a subspace.

Question 2

Let p=(1,2,0)\mathbf{p}=(1,2,0), u=(1,0,1)\mathbf{u}=(1,0,1), and v=(0,1,1)\mathbf{v}=(0,1,-1) be vectors in R3\mathbb{R}^3. Let W={p+su+tvs,tR}W = \{\mathbf{p} + s\mathbf{u} + t\mathbf{v} \mid s, t \in \mathbb{R}\}. Why is WW not a subspace of R3\mathbb{R}^3?

  1. WW does not contain the zero vector.
  2. The vectors u\mathbf{u} and v\mathbf{v} are linearly dependent.
  3. WW is not closed under scalar multiplication. (correct answer)
  4. The set WW is a line, and a line is never a subspace.
Explanation: The set WW describes a plane in R3\mathbb{R}^3. To check if it is a subspace, we must check the three axioms. First, note that for s=1,t=2s=-1, t=-2, we have p+su+tv=(1,2,0)(1,0,1)2(0,1,1)=(0,0,1)0\mathbf{p} + s\mathbf{u} + t\mathbf{v} = (1,2,0) - (1,0,1) - 2(0,1,-1) = (0,0,1) \neq \mathbf{0}. It can be shown 0W\mathbf{0} \notin W. However, a more fundamental failure is closure. Let w1=p+s1u+t1vW\mathbf{w}_1 = \mathbf{p} + s_1\mathbf{u} + t_1\mathbf{v} \in W. Consider the scalar multiple 2w1=2p+2s1u+2t1v2\mathbf{w}_1 = 2\mathbf{p} + 2s_1\mathbf{u} + 2t_1\mathbf{v}. This vector is not in the form p+su+tv\mathbf{p} + s\mathbf{u} + t\mathbf{v} because of the 2p2\mathbf{p} term. Thus, WW is not closed under scalar multiplication. It is also not closed under addition.

Question 3

Let VV be the vector space of all 2×22 \times 2 real matrices, and define W={AV:AT=A and tr(A)=0}W = \{A \in V : A^T = -A \text{ and } \text{tr}(A) = 0\}. What can be concluded about the relationship between these two conditions?

  1. The conditions are incompatible except for the zero matrix, since skew-symmetric matrices cannot have zero trace
  2. Both conditions are necessary and independent, giving WW dimension 0 with only the zero matrix
  3. The trace condition is redundant because skew-symmetric matrices automatically have trace zero, so WW has dimension 3
  4. The trace condition is redundant because skew-symmetric matrices automatically have trace zero, so WW has dimension 1 (correct answer)
Explanation: When analyzing subspaces defined by multiple conditions, you need to determine whether those conditions are independent or if one implies the other. This question tests your understanding of skew-symmetric matrices and their fundamental properties. A 2×22 \times 2 skew-symmetric matrix has the form AT=AA^T = -A, which means A=(0aa0)A = \begin{pmatrix} 0 & a \\ -a & 0 \end{pmatrix} for some real number aa. Notice that the diagonal entries must be zero (since aii=aiia_{ii} = -a_{ii} implies aii=0a_{ii} = 0), and off-diagonal entries are negatives of each other. The trace of this matrix is tr(A)=0+0=0\text{tr}(A) = 0 + 0 = 0. This isn't coincidental—every skew-symmetric matrix automatically has zero trace because its diagonal entries must all be zero. Therefore, the condition tr(A)=0\text{tr}(A) = 0 is redundant when combined with AT=AA^T = -A. Since WW is effectively just the space of 2×22 \times 2 skew-symmetric matrices, and these have the form (0aa0)\begin{pmatrix} 0 & a \\ -a & 0 \end{pmatrix}, the space is one-dimensional (parameterized by the single variable aa). Choice A is wrong because skew-symmetric matrices do have zero trace—they're perfectly compatible conditions. Choice B incorrectly claims both conditions are independent and that WW has dimension 0. Choice C correctly identifies that the trace condition is redundant but incorrectly states the dimension as 3 (confusing this with 3×33 \times 3 skew-symmetric matrices). Remember: for any n×nn \times n skew-symmetric matrix, the trace is automatically zero due to the zero diagonal entries.

Question 4

Let W1=span{(1,2,0,1),(2,1,1,0)}W_1 = \text{span}\{(1, 2, 0, 1), (2, 1, 1, 0)\} and W2={(x,y,z,w)R4:xy+z=0}W_2 = \{(x, y, z, w) \in \mathbb{R}^4 : x - y + z = 0\}. To determine whether W1W2W_1 \subseteq W_2, what is the most efficient approach?

  1. Compute the intersection W1W2W_1 \cap W_2 and verify it equals W1W_1 by comparing dimensions
  2. Find a basis for W1W_1, then verify each basis element satisfies the constraint equation for W2W_2
  3. Check whether both spanning vectors of W1W_1 satisfy the constraint defining W2W_2, since this is necessary and sufficient (correct answer)
  4. Parameterize all vectors in W1W_1 and substitute into the constraint equation to verify it holds for all parameter values
Explanation: When you encounter subset questions involving a span and a constraint-defined subspace, you need to understand that every vector in the span can be written as a linear combination of the spanning vectors. This means if all spanning vectors satisfy the constraint, then every vector in the span will too. Option C is correct because it leverages this fundamental property. Since W1=span{(1,2,0,1),(2,1,1,0)}W_1 = \text{span}\{(1, 2, 0, 1), (2, 1, 1, 0)\}, every vector in W1W_1 has the form a(1,2,0,1)+b(2,1,1,0)a(1, 2, 0, 1) + b(2, 1, 1, 0) for scalars a,ba, b. If both spanning vectors satisfy xy+z=0x - y + z = 0, then any linear combination will too. Let's verify: for (1,2,0,1)(1, 2, 0, 1): 12+0=101 - 2 + 0 = -1 \neq 0. This vector doesn't satisfy the constraint, so W1⊈W2W_1 \not\subseteq W_2. Option A is inefficient because computing intersections and comparing dimensions requires more work than simply checking the spanning vectors. Option B contains a subtle error: finding "a basis" suggests you might need to reduce the spanning set, but you can check the given spanning vectors directly without basis reduction. Option D is unnecessarily complicated—parameterizing all vectors means writing a(1,2,0,1)+b(2,1,1,0)=(a+2b,2a+b,b,a)a(1, 2, 0, 1) + b(2, 1, 1, 0) = (a + 2b, 2a + b, b, a) and substituting into the constraint, which is algebraically more involved than checking the two spanning vectors individually. Strategy tip: For span-subset questions, always check if the spanning vectors satisfy the constraint first—it's the most direct path to your answer.

Question 5

Consider the set T={fC(R):f(x)+4f(x)+4f(x)=0}T = \{f \in C^\infty(\mathbb{R}) : f''(x) + 4f'(x) + 4f(x) = 0\} where C(R)C^\infty(\mathbb{R}) denotes the vector space of infinitely differentiable functions on R\mathbb{R}. Which property of TT requires the most sophisticated verification to confirm it is a subspace?

  1. Verifying that the zero function satisfies the differential equation, since this involves confirming that derivatives of zero are zero
  2. Confirming closure under addition requires showing that if two functions satisfy the differential equation, their sum does too
  3. Establishing closure under scalar multiplication, since scaling affects the derivatives in the differential equation
  4. Proving that TT is non-empty, since the existence of non-trivial solutions to the differential equation is not immediately obvious (correct answer)
Explanation: While options A, B, and C involve routine verification using linearity of differentiation, option D requires solving the differential equation f'' + 4f' + 4f = 0 to prove solutions exist. The characteristic equation is r² + 4r + 4 = 0, which factors as (r + 2)² = 0, giving a repeated root r = -2. This yields the general solution f(x) = (c₁ + c₂x)e^(-2x) for constants c₁, c₂. Verifying this solution exists requires knowledge of differential equations theory, whereas the other properties follow directly from the linearity of the differential operator L[f] = f'' + 4f' + 4f.

Question 6

Let S={AM2×2(R):A(12)=3(12)}S = \{A \in M_{2 \times 2}(\mathbb{R}) : A \begin{pmatrix} 1 \\ 2 \end{pmatrix} = 3 \begin{pmatrix} 1 \\ 2 \end{pmatrix}\}. A student argues that SS is not a subspace because "eigenvalue conditions are not linear constraints." What is wrong with this reasoning?

  1. The reasoning is correct; eigenvalue conditions involve products Av=λvAv = \lambda v which are not linear in the matrix entries
  2. The condition A(12)=3(12)A \begin{pmatrix} 1 \\ 2 \end{pmatrix} = 3 \begin{pmatrix} 1 \\ 2 \end{pmatrix} is actually a system of linear equations in the entries of AA (correct answer)
  3. Eigenvalue conditions can be nonlinear, but this particular condition happens to define a subspace by coincidence
  4. The student's reasoning fails because eigenvalues are always real numbers, making the constraints automatically linear
Explanation: The condition A[[1],[2]] = 3[[1],[2]] translates to [[a,b],[c,d]][[1],[2]] = [[3],[6]], which gives the system: a + 2b = 3 and c + 2d = 6. These are linear equations in the entries a, b, c, d of matrix A. While eigenvalue problems in general can involve nonlinear relationships (like det(A - λI) = 0), this specific condition with a fixed eigenvalue and eigenvector gives linear constraints on the matrix entries. Therefore S is indeed a subspace, and the student's reasoning is incorrect because they failed to recognize that fixing λ and v makes the constraint Av = λv linear in A.

Question 7

Consider the sets A={(x,y,z)R3:2x+yz=0}A = \{(x, y, z) \in \mathbb{R}^3 : 2x + y - z = 0\} and B={(x,y,z)R3:x+y=1,z=0}B = \{(x, y, z) \in \mathbb{R}^3 : x + y = 1, z = 0\}. A student claims that ABA \cap B must be a subspace since "the intersection of any two subspaces is always a subspace." What error does this reasoning contain?

  1. The intersection of subspaces is not always a subspace; this is only true under special conditions
  2. Set BB is not a subspace, so the general theorem about intersections of subspaces does not apply (correct answer)
  3. Set AA is not a subspace, so we cannot use properties of subspace intersections
  4. The reasoning is correct, but AB=A \cap B = \emptyset, so the intersection is not a subspace
Explanation: The general theorem states that the intersection of subspaces is always a subspace, but this requires both sets to actually be subspaces. Set A = {(x,y,z) : 2x + y - z = 0} is indeed a subspace (it's the null space of the linear functional 2x + y - z). However, set B = {(x,y,z) : x + y = 1, z = 0} is not a subspace because it doesn't contain the zero vector (since 0 + 0 ≠ 1). Therefore, the theorem about intersections of subspaces cannot be applied here. The student's error is assuming that B is a subspace when it is not.

Question 8

Define U={(a,b,c,d)R4:a+b+c+d=1}U = \{(a, b, c, d) \in \mathbb{R}^4 : a + b + c + d = 1\} and V={(a,b,c,d)R4:a+b+c+d=0}V = \{(a, b, c, d) \in \mathbb{R}^4 : a + b + c + d = 0\}. A student claims that UVU \cup V forms a subspace of R4\mathbb{R}^4. What is the most direct way to show this claim is false?

  1. Show that UVU \cup V fails closure under addition by finding vectors u1,u2Uu_1, u_2 \in U such that u1+u2UVu_1 + u_2 \notin U \cup V (correct answer)
  2. Show that UVU \cup V fails closure under scalar multiplication by finding uUu \in U and scalar cc such that cuUVcu \notin U \cup V
  3. Show that UU is not a subspace because it does not contain the zero vector
  4. Show that both UU and VV are themselves not subspaces, so their union cannot be a subspace either
Explanation: The most direct approach is to show closure fails under addition. Take u₁ = (1,0,0,0) ∈ U and u₂ = (0,1,0,0) ∈ U. Then u₁ + u₂ = (1,1,0,0), and 1+1+0+0 = 2. Since 2 ≠ 1, we have (1,1,0,0) ∉ U, and since 2 ≠ 0, we have (1,1,0,0) ∉ V. Therefore u₁ + u₂ ∉ U ∪ V, showing U ∪ V fails closure under addition. Note that V is actually a subspace (the zero vector is in V), but U is not since it doesn't contain the zero vector.

Question 9

Which of the following subsets of R3\mathbb{R}^3 is a subspace of R3\mathbb{R}^3?

  1. W1={(x,y,z)R3x+yz=4}W_1 = \{(x, y, z) \in \mathbb{R}^3 \mid x + y - z = 4\}
  2. W2={(x,y,z)R3x0,y0,z0}W_2 = \{(x, y, z) \in \mathbb{R}^3 \mid x \ge 0, y \ge 0, z \ge 0\}
  3. W3={(x,y,z)R32xy=0 and 3y+z=0}W_3 = \{(x, y, z) \in \mathbb{R}^3 \mid 2x - y = 0 \text{ and } 3y + z = 0\} (correct answer)
  4. W4={(x,y,z)R3x,y, and z are rational numbers}W_4 = \{(x, y, z) \in \mathbb{R}^3 \mid x, y, \text{ and } z \text{ are rational numbers}\}
Explanation: W3W_3 is a subspace. It represents the intersection of two planes through the origin, which is a line through the origin. It contains the zero vector (0,0,0)(0,0,0). It is closed under addition and scalar multiplication because the defining equations are linear and homogeneous. W1W_1 is not a subspace because it does not contain the zero vector. W2W_2 is not a subspace because it is not closed under multiplication by negative scalars. W4W_4 is not a subspace because it is not closed under multiplication by irrational scalars.

Question 10

Let WW be the subset of R2\mathbb{R}^2 defined by W={(x,y)xy=0}W = \{(x, y) \mid xy = 0\}. Which statement correctly explains why WW is not a subspace of R2\mathbb{R}^2?

  1. WW does not contain the zero vector 0=(0,0)\mathbf{0}=(0,0).
  2. WW is not closed under scalar multiplication.
  3. WW is not closed under vector addition. (correct answer)
  4. The condition xy=0xy=0 is nonlinear, and subspaces must be defined by linear equations.
Explanation: To be a subspace, a set must be closed under vector addition. Let u=(1,0)\mathbf{u} = (1, 0) and v=(0,1)\mathbf{v} = (0, 1). Since 10=01 \cdot 0 = 0, uW\mathbf{u} \in W. Since 01=00 \cdot 1 = 0, vW\mathbf{v} \in W. However, their sum is u+v=(1,1)\mathbf{u} + \mathbf{v} = (1, 1). For this vector, x=1x=1 and y=1y=1, so xy=10xy = 1 \neq 0. Therefore, u+vW\mathbf{u} + \mathbf{v} \notin W, and WW is not closed under addition.

Question 11

Let P3P_3 be the vector space of polynomials of degree at most 3. Let SS be the subset of P3P_3 defined by S={p(x)P3p(0)=2p(1)}S = \{ p(x) \in P_3 \mid p(0) = 2p(1) \}. Which statement about SS is correct?

  1. SS is not a subspace because the zero polynomial is not in SS.
  2. SS is not a subspace because it is not closed under scalar multiplication.
  3. SS is not a subspace because it is not closed under addition.
  4. SS is a subspace of P3P_3. (correct answer)
Explanation: SS is a subspace. We check the three conditions. (1) Zero vector: The zero polynomial is z(x)=0z(x)=0. z(0)=0z(0)=0 and 2z(1)=2(0)=02z(1)=2(0)=0, so z(0)=2z(1)z(0)=2z(1) and z(x)Sz(x) \in S. (2) Closure under addition: Let p,qSp, q \in S. Then p(0)=2p(1)p(0)=2p(1) and q(0)=2q(1)q(0)=2q(1). For the sum p+qp+q, we have (p+q)(0)=p(0)+q(0)=2p(1)+2q(1)=2(p(1)+q(1))=2(p+q)(1)(p+q)(0) = p(0)+q(0) = 2p(1)+2q(1) = 2(p(1)+q(1)) = 2(p+q)(1). Thus, p+qSp+q \in S. (3) Closure under scalar multiplication: Let pSp \in S and cc be a scalar. Then (cp)(0)=cp(0)=c(2p(1))=2(cp(1))=2(cp)(1)(cp)(0)=c \cdot p(0) = c \cdot (2p(1)) = 2(c \cdot p(1)) = 2(cp)(1). Thus, cpScp \in S. Since all conditions hold, SS is a subspace.

Question 12

Let V=C(R)V = C(\mathbb{R}) be the vector space of all continuous functions from R\mathbb{R} to R\mathbb{R}. Which of the following subsets of VV is a subspace?

  1. The set of all functions ff such that f(x)0f(x) \ge 0 for all xx.
  2. The set of all functions ff such that f(7)=f(1)f(7) = f(1). (correct answer)
  3. The set of all polynomial functions of degree exactly 4.
  4. The set of all functions ff such that 01f(x)dx=3\int_0^1 f(x) dx = 3.
Explanation: Let S={fVf(7)=f(1)}S = \{ f \in V \mid f(7) = f(1) \}. (1) The zero function satisfies 0=00=0. (2) If f,gSf,g \in S, then f(7)=f(1)f(7)=f(1) and g(7)=g(1)g(7)=g(1). Then (f+g)(7)=f(7)+g(7)=f(1)+g(1)=(f+g)(1)(f+g)(7) = f(7)+g(7) = f(1)+g(1) = (f+g)(1), so f+gSf+g \in S. (3) If fSf \in S, then (cf)(7)=cf(7)=cf(1)=(cf)(1)(cf)(7) = c f(7) = c f(1) = (cf)(1), so cfScf \in S. Thus, SS is a subspace. Choice A fails closure under multiplication by negative scalars. Choice C does not contain the zero polynomial and fails closure. Choice D does not contain the zero function.

Question 13

Let WW be the set of all vectors in R4\mathbb{R}^4 whose components sum to zero. Which statement is true?

  1. WW is a subspace of R4\mathbb{R}^4. (correct answer)
  2. WW is not a subspace because it is not closed under scalar multiplication.
  3. WW is not a subspace because it is not closed under vector addition.
  4. WW is not a subspace because it does not contain the zero vector.
Explanation: W={(x1,x2,x3,x4)R4x1+x2+x3+x4=0}W = \{(x_1, x_2, x_3, x_4) \in \mathbb{R}^4 \mid x_1+x_2+x_3+x_4=0\}. This is a subspace. We check the axioms. (1) Zero vector: The components of 0=(0,0,0,0)\mathbf{0}=(0,0,0,0) sum to 0, so 0W\mathbf{0} \in W. (2) Addition: Let u,vW\mathbf{u}, \mathbf{v} \in W. Then ui=0\sum u_i = 0 and vi=0\sum v_i = 0. For the sum u+v\mathbf{u}+\mathbf{v}, the sum of components is (ui+vi)=ui+vi=0+0=0\sum (u_i+v_i) = \sum u_i + \sum v_i = 0+0=0. So u+vW\mathbf{u}+\mathbf{v} \in W. (3) Scalar multiplication: Let uW\mathbf{u} \in W and cc be a scalar. The sum of components for cuc\mathbf{u} is (cui)=c(ui)=c(0)=0\sum (cu_i) = c (\sum u_i) = c(0)=0. So cuWc\mathbf{u} \in W. All three conditions hold.

Question 14

Let VV be the vector space of 2×32 \times 3 matrices. Which of the following subsets of VV is NOT a subspace?

  1. The set of matrices where the first row is all zeros.
  2. The set of matrices AA such that A(111)=(00)A \begin{pmatrix} 1 \\ 1 \\ 1 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}.
  3. The set of matrices where the sum of all entries is 0.
  4. The set of matrices with at least one zero entry. (correct answer)
Explanation: The set of matrices with at least one zero entry is not a subspace because it is not closed under addition. For example, let A=(111110)A = \begin{pmatrix} 1 & 1 & 1 \\ 1 & 1 & 0 \end{pmatrix} and B=(110111)B = \begin{pmatrix} 1 & 1 & 0 \\ 1 & 1 & 1 \end{pmatrix}. Both AA and BB have a zero entry. Their sum is A+B=(221221)A+B = \begin{pmatrix} 2 & 2 & 1 \\ 2 & 2 & 1 \end{pmatrix}, which has no zero entries. Therefore, the set is not closed under addition. The other three options describe valid subspaces.

Question 15

Consider the set S={(x,y)R2x2y2=0}S = \{(x,y) \in \mathbb{R}^2 \mid x^2 - y^2 = 0\}. Which of the following claims about SS is true?

  1. SS is a subspace of R2\mathbb{R}^2.
  2. SS contains the zero vector and is closed under scalar multiplication, but is not closed under addition. (correct answer)
  3. SS is closed under addition and scalar multiplication, but does not contain the zero vector.
  4. SS contains the zero vector and is closed under addition, but is not closed under scalar multiplication.
Explanation: The condition x2y2=0x^2 - y^2 = 0 is equivalent to (xy)(x+y)=0(x-y)(x+y)=0, which means y=xy=x or y=xy=-x. So SS is the union of two lines through the origin. (1) Zero vector: (0,0)(0,0) is in SS since 0202=00^2-0^2=0. (2) Scalar multiplication: If (x,y)S(x,y) \in S, then x2y2=0x^2-y^2=0. For any scalar cc, (cx)2(cy)2=c2(x2y2)=c2(0)=0(cx)^2 - (cy)^2 = c^2(x^2-y^2) = c^2(0)=0. So (cx,cy)S(cx,cy) \in S. SS is closed under scalar multiplication. (3) Addition: Let u=(1,1)S\mathbf{u}=(1,1) \in S and v=(1,1)S\mathbf{v}=(1,-1) \in S. Their sum is u+v=(2,0)\mathbf{u}+\mathbf{v}=(2,0). For this vector, 2202=402^2-0^2 = 4 \neq 0, so u+vS\mathbf{u}+\mathbf{v} \notin S. Thus, SS is not closed under addition.

Question 16

Let UU and WW be subspaces of a vector space VV. Which of the following sets is guaranteed to be a subspace of VV?

  1. The union UWU \cup W.
  2. The intersection UWU \cap W. (correct answer)
  3. The set difference UW={vUvW}U \setminus W = \{\mathbf{v} \in U \mid \mathbf{v} \notin W\}.
  4. The set of vectors not in UU, denoted VUV \setminus U.
Explanation: The intersection of two subspaces is always a subspace. If u,vUW\mathbf{u}, \mathbf{v} \in U \cap W, then u,v\mathbf{u}, \mathbf{v} are in both UU and WW. Since UU and WW are subspaces, u+v\mathbf{u}+\mathbf{v} and cuc\mathbf{u} are in both UU and WW, and thus in their intersection. Also, 0\mathbf{0} is in both UU and WW. The union UWU \cup W is not generally a subspace. The set differences UWU \setminus W and VUV \setminus U are not subspaces as they do not contain the zero vector.

Question 17

Let M2×2M_{2\times2} be the vector space of 2×22 \times 2 matrices. Let SS be the subset of M2×2M_{2\times2} consisting of all singular matrices. Why is SS not a subspace of M2×2M_{2\times2}?

  1. SS does not contain the zero matrix.
  2. SS is not closed under scalar multiplication.
  3. SS is not closed under matrix multiplication.
  4. SS is not closed under matrix addition. (correct answer)
Explanation: A matrix is singular if its determinant is zero. Let A=(1000)A = \begin{pmatrix} 1 & 0 \\ 0 & 0 \end{pmatrix} and B=(0001)B = \begin{pmatrix} 0 & 0 \\ 0 & 1 \end{pmatrix}. We have det(A)=0\det(A) = 0 and det(B)=0\det(B) = 0, so both AA and BB are in SS. Their sum is A+B=(1001)=IA+B = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} = I. The determinant of the identity matrix II is 11, so A+BA+B is not singular. Therefore, A+BSA+B \notin S, which shows SS is not closed under matrix addition.

Question 18

Let W={p(x)P4(R):p(1)=0,p(1)=0, and p(0)=0}W = \{p(x) \in P_4(\mathbb{R}) : p(-1) = 0, p(1) = 0, \text{ and } p'(0) = 0\} where P4(R)P_4(\mathbb{R}) is the space of polynomials of degree at most 4. What is the dimension of WW?

  1. dim(W)=1\dim(W) = 1, since the three constraints eliminate 4 degrees of freedom from the 5-dimensional space
  2. dim(W)=3\dim(W) = 3, since the constraints are independent and reduce the dimension from 5 to 2
  3. dim(W)=2\dim(W) = 2, since we have 3 linear constraints on a 5-dimensional space (correct answer)
  4. dim(W)=4\dim(W) = 4, since polynomial evaluation constraints don't affect the underlying polynomial degree
Explanation: When you encounter a subspace defined by constraints, you need to count how many independent linear conditions restrict the space and subtract from the original dimension. The space P4(R)P_4(\mathbb{R}) has dimension 5, with basis {1,x,x2,x3,x4}\{1, x, x^2, x^3, x^4\}. Any polynomial can be written as p(x)=a0+a1x+a2x2+a3x3+a4x4p(x) = a_0 + a_1x + a_2x^2 + a_3x^3 + a_4x^4. The three constraints translate to:
  • p(1)=0p(-1) = 0: a0a1+a2a3+a4=0a_0 - a_1 + a_2 - a_3 + a_4 = 0
  • p(1)=0p(1) = 0: a0+a1+a2+a3+a4=0a_0 + a_1 + a_2 + a_3 + a_4 = 0
  • p(0)=0p'(0) = 0: Since p(x)=a1+2a2x+3a3x2+4a4x3p'(x) = a_1 + 2a_2x + 3a_3x^2 + 4a_4x^3, we get a1=0a_1 = 0
These give us a system of three linear equations in five unknowns. The key insight is that these constraints are linearly independent—none can be derived from the others. Therefore, they reduce the dimension by exactly 3, giving us dim(W)=53=2\dim(W) = 5 - 3 = 2. Option A incorrectly states the constraints eliminate 4 degrees of freedom and claims the result is dimension 1. Option B has the calculation backwards, saying 3 independent constraints somehow leave dimension 3. Option D ignores that evaluation constraints absolutely do restrict the space—they're linear conditions on the coefficients. Study tip: For constraint problems, write out what each condition means for the coefficients, verify the constraints are independent, then subtract the number of independent constraints from the original dimension. The dimension always equals (original dimension) - (number of independent linear constraints).

Question 19

Define H={(x,y,z)R3:x2+y21,z=0}H = \{(x, y, z) \in \mathbb{R}^3 : x^2 + y^2 \leq 1, z = 0\} and K={(x,y,z)R3:z=0}K = \{(x, y, z) \in \mathbb{R}^3 : z = 0\}. Which statement correctly analyzes these sets as potential subspaces?

  1. Both HH and KK are subspaces, since they are both subsets of the xyxy-plane with z=0z = 0
  2. HH is not a subspace because it fails closure under scalar multiplication, while KK is a subspace (correct answer)
  3. HH is not a subspace because it fails closure under addition, while KK fails closure under scalar multiplication
  4. Neither HH nor KK is a subspace because both involve quadratic constraints on the coordinates
Explanation: Set K = {(x,y,z) ∈ ℝ³ : z = 0} is the xy-plane, which is clearly a subspace (it's the null space of the linear functional z). Set H is the closed unit disk in the xy-plane. While H contains the zero vector (0,0,0) and is closed under addition of vectors within the unit disk, it fails closure under scalar multiplication. For example, (1,0,0) ∈ H since 1² + 0² = 1 ≤ 1, but 2·(1,0,0) = (2,0,0) ∉ H since 2² + 0² = 4 > 1. Therefore H is not a subspace due to failure of closure under scalar multiplication.

Question 20

Let W={(x,y,z,w)R4:x+2yz=0 and 2x+4y2z+w=0}W = \{(x, y, z, w) \in \mathbb{R}^4 : x + 2y - z = 0 \text{ and } 2x + 4y - 2z + w = 0\}. Which of the following statements about WW is correct?

  1. WW is a subspace of R4\mathbb{R}^4 with dimension 2, and the second constraint is redundant with the first (correct answer)
  2. WW is a subspace of R4\mathbb{R}^4 with dimension 3, and both constraints provide independent information
  3. WW is not a subspace because the system of constraints is inconsistent for some values
  4. WW is a subspace of R4\mathbb{R}^4 with dimension 1, since both constraints must be satisfied simultaneously
Explanation: First, we check if W is a subspace by verifying it contains the zero vector, is closed under addition, and closed under scalar multiplication. The zero vector (0,0,0,0) satisfies both equations. For closure under addition and scalar multiplication, since both constraints are homogeneous linear equations, W is indeed a subspace. Next, we analyze the constraints: from the first equation x + 2y - z = 0, we get z = x + 2y. Substituting into the second equation: 2x + 4y - 2(x + 2y) + w = 0, which simplifies to 2x + 4y - 2x - 4y + w = 0, so w = 0. Thus W = {(x, y, x + 2y, 0) : x, y ∈ ℝ}, which has dimension 2 with basis vectors (1, 0, 1, 0) and (0, 1, 2, 0). The second constraint forces w = 0 but is otherwise redundant.