LINEAR ALGEBRA — CHAPTER 1 (§1.1–§1.
6)
Nair & Singh • Test 1 — Vector Spaces (§1.1) and Subspaces (§1.2)
ANSWER KEY (Instructor Copy — Do Not Distribute)
PART I — ANSWER KEY (Multiple Choice)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
B B C B B B B B B B A A A A B B B A B B
MCQ Explanations
1. According to Definition 1.1, a vector space over a field F requires two operations. Which pair
correctly names them?
Correct: B — Definition 1.1 specifies (a) addition and (b) scalar multiplication.
2. In a vector space V over F, the axiom '1·x = x for all x ∈ V' is known as:
Correct: B — Axiom (8): 1x = x — the scalar identity.
3. Theorem 1.2 states that in any vector space:
Correct: C — Theorem 1.2 proves uniqueness of 0 and of each –x.
4. Let V = ℝ>₀ = {x ∈ ℝ : x > 0} with x ⊕ y := xy and α ⊙ x := xᵅ. The zero vector is:
Correct: B — x ⊕ 1 = x·1 = x, so 1 plays the role of the zero vector.
5. The set F^(m×n) of all m×n matrices over F with component-wise addition and scalar multiplication
is:
Correct: B — Example 1.3(2): F^{m×n} is a vector space for any m, n.
6. The space P_n(F) consists of all polynomials of degree:
Correct: B — Definition from Example 1.3(3): Pₙ(F) = polynomials of degree ≤ n.
7. According to Theorem 1.6, which of the following holds in every vector space V over F?
Correct: B — Theorem 1.6(1): 0·x = 0 (scalar zero times any vector is the zero vector).
8. The product space V₁ × V₂ of two vector spaces uses which zero vector?
Correct: B — Example 1.5: the zero of the product space is (0₁, 0₂).
9. A nonempty subset U of a vector space V is a subspace if and only if (Theorem 1.8):
Correct: B — Theorem 1.8: U is a subspace iff it is nonempty and closed under + and scalar mult.
10. Which of the following subsets of ℝ² is a subspace?
Correct: B — U = {(a,b): a = 2b} passes through the origin and is closed under + and scalar mult.
11. The intersection of any collection of subspaces of V is (Theorem 1.10):
Correct: A — Theorem 1.10: any intersection of subspaces is itself a subspace.
12. Let U = {polynomials with zero constant term} ⊆ P(ℝ). U is a subspace because:
Correct: A — Zero constant term is preserved under addition and scalar multiplication; 0 ∈ U.
13. Consider V₁, V₂ subspaces of V. The set V₁ + V₂ := {v₁ + v₂ : v₁ ∈ V₁, v₂ ∈ V₂} is (Theorem
1.12):
Correct: A — Theorem 1.12: the sum of subspaces is a subspace.
14. If U is a subspace of V, then by Theorem 1.8 it follows that:
Correct: A — From the proof: since U is nonempty, let u ∈ U; then 0 = 0·u ∈ U.
15. The set {x ∈ ℝ³ : x₁ + x₂ + x₃ = 0} together with standard operations is:
Correct: B — The constraint x₁+x₂+x₃=0 is homogeneous; it defines a 2-dim subspace.
16. According to the subspace test, which pair of conditions is sufficient for U ≠ ∅ to be a subspace?
Correct: B — Theorem 1.8: nonempty + closed under + and scalar mult.
17. The set C([a, b], ℝ) of continuous real-valued functions on [a, b] is:
Correct: B — Example 1.9(6)/(1.4): C([a,b],ℝ) is a subspace of F([a,b], ℝ).
18. For a real vector space V, the set U = {αv : α ∈ ℝ} for a fixed nonzero v ∈ V is:
Correct: A — span{v} is always a subspace — it contains 0 (α=0) and is closed under + and
scalar mult.
19. Which theorem guarantees that the trivial subspace {0} and V itself are subspaces of V?
Correct: B — Theorem 1.8: {0} is nonempty and closed under + and scalar mult; V similarly.
20. In ℝ², the set U ∪ W where U = {(a,0)} and W = {(0,b)} (both x- and y-axes) is:
Correct: B — The union of two subspaces is generally not a subspace; closure under addition
fails.
PART II — ANSWER KEY (Constructed Response)
CRQ 1 — Verifying Vector Space Axioms (§1.1)
(a) Zero vector: seek (z₁, z₂) such that (a₁,a₂) ⊕ (z₁,z₂) = (a₁,a₂).
a₁+z₁+1 = a₁ ⟹ z₁ = –1; a₂+z₂ = a₂ ⟹ z₂ = 0.
Zero vector = (–1, 0).
(b) Additive inverse of (a₁,a₂): need (a₁,a₂) ⊕ (x₁,x₂) = (–1,0).
a₁+x₁+1 = –1 ⟹ x₁ = –a₁–2; a₂+x₂ = 0 ⟹ x₂ = –a₂.
Additive inverse = (–a₁–2, –a₂).
(c) LHS: (αβ) ⊙ (a₁,a₂) = (αβ·a₁ + αβ – 1, αβ·a₂).
RHS: first β ⊙ (a₁,a₂) = (βa₁+β–1, βa₂); then α ⊙ that =
(α(βa₁+β–1)+α–1, α·βa₂) = (αβa₁+αβ–α+α–1, αβa₂) = (αβa₁+αβ–1, αβa₂). ✓
(d) All 8 axioms can be verified; V is a vector space over ℝ.
CRQ 2 — Subspace Criterion (§1.2)
(a) U is a subspace. It contains (0,0,0) ✓. If a+2b–c=0 and a'+2b'–c'=0, sum satisfies it ✓.
Scalar mult: k(a+2b–c)=0 ✓.
(b) W is a subspace. a²+b²=0 over ℝ iff a=b=0, so W = {(0,0,c): c ∈ℝ}. This is the z-axis —
a subspace ✓.
(c) X is NOT a subspace: (0,0,0) ∉ X since 0+0+0 = 0 ≠ 1.
(d) Y is a subspace. Y = {(0,0,c): c∈ℝ} (z-axis). Contains 0, closed under + and scalar mult
✓.
CRQ 3 — Intersection and Sum of Subspaces (§1.2)
(a) U: a=b, c=d ⟹ vectors (a,a,c,c). Basis: {(1,1,0,0),(0,0,1,1)}, dim(U)=2.
(b) W: a+b+c+d=0 ⟹ 3 free variables. Basis: {(1,–1,0,0),(1,0,–1,0),(1,0,0,–1)}, dim(W)=3.
(c) U∩W: a=b, c=d, and 2a+2c=0 ⟹ a+c=0 ⟹ c=–a. Vectors: (a,a,–a,–a)=a(1,1,–1,–1).
Basis:{(1,1,–1,–1)}, dim(U∩W)=1.
(d) dim(U+W) = 2+3–1 = 4 = dim(ℝ⁴). So U+W = ℝ⁴ ✓.
CRQ 4 — Function Spaces as Subspaces (§1.1–§1.2)
(a) 0 ∈ C(ℝ,ℝ) ✓. Sum and scalar-multiple of continuous functions is continuous ✓.
Subspace by Thm 1.8.
(b) 0 is even (0(–x)=0=0(x)) ✓. If f,g ∈ E: (f+g)(–x)=f(–x)+g(–x)=f(x)+g(x)=(f+g)(x) ✓. (αf)(–
x)=α·f(–x)=αf(x) ✓.
(c) Similarly 0 is odd; sum/scalar-multiple preserve the odd condition ✓.
(d) For any f, write f=(f+f_R)/2+(f–f_R)/2 where f_R(x)=f(–x). First part is even, second odd.
If f ∈ E∩O: f(–x)=f(x) and f(–x)=–f(x) ⟹ f(x)=–f(x) ⟹ f=0. So E∩O={0}. Hence V=E ⊕O.
CRQ 5 — Proving a Set is Not a Vector Space (§1.1–§1.2)
(a) We need (z₁,z₂) with aᵢzᵢ = aᵢ for all a. This requires zᵢ = 1, so candidate is (1,1). But
then 0⊙(1,1) = (0,0) ≠ (1,1), violating the axiom 0·x = 0_V.
(b) (2,3) ⊕ (x₁,x₂) = (1,1) ⟹ 2x₁=1, 3x₂=1 ⟹ inverse is (1/2, 1/3).
(c) α⊙(x⊕y) = α⊙(x₁y₁,x₂y₂) = (αx₁y₁,αx₂y₂).
(α⊙x)⊕(α⊙y) = (αx₁,αx₂)⊕(αy₁,αy₂) = (α²x₁y₁,α²x₂y₂).
These are equal only when α²=α, i.e. α=0 or 1. Axiom fails in general.
(d) (α+β)⊙x = ((α+β)x₁,(α+β)x₂). (α⊙x)⊕(β⊙x) = (αx₁·βx₁,αx₂·βx₂) = (αβx₁²,αβx₂²). Not
equal in general. Not a vector space.