Study guide
8.1 Vector Spaces, Subspaces, Span, and Linear Independence
GRE Subject Test: Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Single-Variable Differential Calculus
1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves
2 Chapter 2: Single-Variable Integral Calculus
2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria
3 Chapter 3: Sequences, Infinite Series & Power Series
3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds
4 Chapter 4: Multivariable Differential Calculus
4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers
5 Chapter 5: Multivariable Integration & Vector Calculus
5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem
6 Chapter 6: Ordinary Differential Equations
6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters
7 Chapter 7: Elementary Algebra & Number Theory
7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient
8 Chapter 8: Linear Algebra: Vector Spaces & Transformations
8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis
9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
10 Chapter 10: Abstract Algebra: Groups, Rings & Fields
10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
11 Chapter 11: Introductory Real Analysis
11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence
12 Chapter 12: Complex Analysis
12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem
13 Chapter 13: Topology, Geometry & Numerical Analysis
13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature
14 Chapter 14: Probability, Statistics & Discrete Mathematics
14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions
8.1 Vector Spaces, Subspaces, Span, and Linear Independence
Key Takeaways Explain This Topic AI
A vector space over a field F (R or C) satisfies ten axioms; to verify a subset W is a subspace, it suffices to confirm that W is nonempty (contains the zero vector) and is closed under both vector addition and scalar multiplication.
The span of a set S, span(S), is the unique minimal subspace containing S; a set of vectors is linearly independent if and only if the only linear combination yielding the zero vector is the trivial combination with all zero coefficients.
For differentiable functions on an open interval, a non-vanishing Wronskian determinant at even a single point guarantees linear independence; however, an identically zero Wronskian does not imply linear dependence for general non-ODE functions.
The intersection of any collection of subspaces is always a subspace, but the union U ∪ W is a subspace if and only if one subspace is entirely contained within the other.
Subspace sums satisfy the Grassmann dimension theorem dim(U + W) = dim U + dim W - dim(U ∩ W), forming an internal direct sum U ⊕ W if and only if U ∩ W = {0}, which guarantees unique decomposition for every vector.
Last updated: September 2026
8.1 Vector Spaces, Subspaces, Span, and Linear Independence
Linear algebra on the GRE Subject Test in Mathematics transitions from computational matrix manipulation to the abstract structural properties of vector spaces. Mastery of vector space axioms, subspace verification, linear spans, independence criteria, and subspace arithmetic (sums, intersections, and direct sums) is indispensable for rapid and accurate problem-solving.
Axiomatic Foundations of Vector Spaces
A vector space over a field F \mathbb{F} F (typically R \mathbb{R} R or C \mathbb{C} C ) is a set V V V equipped with vector addition + : V × V → V +: V \times V \to V + : V × V → V and scalar multiplication ⋅ : F × V → V \cdot: \mathbb{F} \times V \to V ⋅ : F × V → V satisfying ten fundamental axioms:
Additive Closure : u + v ∈ V u + v \in V u + v ∈ V for all u , v ∈ V u, v \in V u , v ∈ V .
Additive Commutativity : u + v = v + u u + v = v + u u + v = v + u for all u , v ∈ V u, v \in V u , v ∈ V .
Additive Associativity : ( u + v ) + w = u + ( v + w ) (u + v) + w = u + (v + w) ( u + v ) + w = u + ( v + w ) for all u , v , w ∈ V u, v, w \in V u , v , w ∈ V .
Additive Identity : There exists 0 V ∈ V 0_V \in V 0 V ∈ V such that v + 0 V = v v + 0_V = v v + 0 V = v for all v ∈ V v \in V v ∈ V .
Additive Inverses : For each v ∈ V v \in V v ∈ V , there exists − v ∈ V -v \in V − v ∈ V such that v + ( − v ) = 0 V v + (-v) = 0_V v + ( − v ) = 0 V .
Multiplicative Closure : c v ∈ V c v \in V c v ∈ V for all c ∈ F c \in \mathbb{F} c ∈ F and v ∈ V v \in V v ∈ V .
Scalar Distributivity over Vector Addition : c ( u + v ) = c u + c v c(u + v) = cu + cv c ( u + v ) = c u + c v for all c ∈ F c \in \mathbb{F} c ∈ F and u , v ∈ V u, v \in V u , v ∈ V .
Scalar Distributivity over Field Addition : ( a + b ) v = a v + b v (a + b)v = av + bv ( a + b ) v = a v + b v for all a , b ∈ F a, b \in \mathbb{F} a , b ∈ F and v ∈ V v \in V v ∈ V .
Scalar Compatibility : a ( b v ) = ( a b ) v a(bv) = (ab)v a ( b v ) = ( ab ) v for all a , b ∈ F a, b \in \mathbb{F} a , b ∈ F and v ∈ V v \in V v ∈ V .
Scalar Identity : 1 F ⋅ v = v 1_\mathbb{F} \cdot v = v 1 F ⋅ v = v for all v ∈ V v \in V v ∈ V .
Direct algebraic deductions include: the uniqueness of 0 V 0_V 0 V and − v -v − v ; 0 F ⋅ v = 0 V 0_\mathbb{F} \cdot v = 0_V 0 F ⋅ v = 0 V ; c ⋅ 0 V = 0 V c \cdot 0_V = 0_V c ⋅ 0 V = 0 V ; ( − 1 ) v = − v (-1)v = -v ( − 1 ) v = − v ; and c v = 0 V ⟹ c = 0 c v = 0_V \implies c = 0 c v = 0 V ⟹ c = 0 or v = 0 V v = 0_V v = 0 V .
The Subspace Test and Standard Function Spaces
A subset W ⊆ V W \subseteq V W ⊆ V is a subspace of V V V (written W ≤ V W \le V W ≤ V ) if W W W is itself a vector space under the operations inherited from V V V .
The Two-Step Subspace Criteria
To prove W ⊆ V W \subseteq V W ⊆ V is a subspace, verify:
Nonemptiness / Zero Vector : 0 V ∈ W 0_V \in W 0 V ∈ W (or W ≠ ∅ W \neq \emptyset W = ∅ ).
Closure under Linear Combinations : For all u , v ∈ W u, v \in W u , v ∈ W and c ∈ F c \in \mathbb{F} c ∈ F , c u + v ∈ W c u + v \in W c u + v ∈ W . (Equivalently, u + v ∈ W u + v \in W u + v ∈ W and c u ∈ W c u \in W c u ∈ W ).
Canonical Vector Spaces on the GRE
Euclidean / Coordinate Spaces : R n \mathbb{R}^n R n and C n \mathbb{C}^n C n .
Polynomial Spaces : P n ( F ) = { a 0 + a 1 x + ⋯ + a n x n ∣ a i ∈ F } P_n(\mathbb{F}) = \{a_0 + a_1 x + \dots + a_n x^n \mid a_i \in \mathbb{F}\} P n ( F ) = { a 0 + a 1 x + ⋯ + a n x n ∣ a i ∈ F } , having dimension n + 1 n+1 n + 1 ; and the infinite-dimensional space of all polynomials P ( F ) = F [ x ] P(\mathbb{F}) = \mathbb{F}[x] P ( F ) = F [ x ] .
Matrix Spaces : M m × n ( F ) M_{m \times n}(\mathbb{F}) M m × n ( F ) with dimension m n mn mn . Subspaces include symmetric matrices ( A T = A A^T = A A T = A ), skew-symmetric matrices ( A T = − A A^T = -A A T = − A ), and trace-zero matrices ( tr ( A ) = 0 \operatorname{tr}(A) = 0 tr ( A ) = 0 ).
Function Spaces : C [ a , b ] C[a, b] C [ a , b ] (continuous functions on [ a , b ] [a, b] [ a , b ] ), C k ( I ) C^k(I) C k ( I ) ( k k k -times continuously differentiable functions), and C ∞ ( I ) C^\infty(I) C ∞ ( I ) (smooth functions).
- Span, Linear Independence, and the Wronskian
- Linear Combinations and Span
For any subset S ⊆ V S \subseteq V S ⊆ V , the span of S S S , denoted span ( S ) \operatorname{span}(S) span ( S ) , is the set of all finite linear combinations: span ( S ) = { ∑ i = 1 k c i v i | k ∈ N , c i ∈ F , v i ∈ S } . \operatorname{span}(S) = \left\{ \sum_{i=1}^k c_i v_i \;\middle|\; k \in \mathbb{N}, \, c_i \in \mathbb{F}, \, v_i \in S \right\}. span ( S ) = { i = 1 ∑ k c i v i k ∈ N , c i ∈ F , v i ∈ S } .
By definition, span ( ∅ ) = { 0 V } \operatorname{span}(\emptyset) = \{0_V\} span ( ∅ ) = { 0 V } . Crucially, span ( S ) \operatorname{span}(S) span ( S ) is the unique smallest subspace of V V V containing S S S .
Linear Independence
A finite set { v 1 , … , v k } ⊂ V \{v_1, \dots, v_k\} \subset V { v 1 , … , v k } ⊂ V is linearly independent if: c 1 v 1 + c 2 v 2 + ⋯ + c k v k = 0 V ⟹ c 1 = c 2 = ⋯ = c k = 0. c_1 v_1 + c_2 v_2 + \dots + c_k v_k = 0_V \implies c_1 = c_2 = \dots = c_k = 0. c 1 v 1 + c 2 v 2 + ⋯ + c k v k = 0 V ⟹ c 1 = c 2 = ⋯ = c k = 0.
If non-trivial scalars exist producing 0 V 0_V 0 V , the set is linearly dependent .
Linear Dependence Lemma : A set { v 1 , … , v k } \{v_1, \dots, v_k\} { v 1 , … , v k } ( k ≥ 2 k \ge 2 k ≥ 2 ) is linearly dependent if and only if some v j v_j v j is a linear combination of its predecessors { v 1 , … , v j − 1 } \{v_1, \dots, v_{j-1}\} { v 1 , … , v j − 1 } .
The Wronskian Test for Functions
For functions f 1 , … , f k ∈ C k − 1 ( I ) f_1, \dots, f_k \in C^{k-1}(I) f 1 , … , f k ∈ C k − 1 ( I ) , the Wronskian is: W ( f 1 , … , f k ) ( x ) = det ( f 1 ( x ) f 2 ( x ) … f k ( x ) f 1 ′ ( x ) f 2 ′ ( x ) … f k ′ ( x ) ⋮ ⋮ ⋱ ⋮ f 1 ( k − 1 ) ( x ) f 2 ( k − 1 ) ( x ) … f k ( k − 1 ) ( x ) ) . W(f_1, \dots, f_k)(x) = \det \begin{pmatrix} f_1(x) & f_2(x) & \dots & f_k(x) \\ f_1'(x) & f_2'(x) & \dots & f_k'(x) \\ \vdots & \vdots & \ddots & \vdots \\ f_1^{(k-1)}(x) & f_2^{(k-1)}(x) & \dots & f_k^{(k-1)}(x) \end{pmatrix}. W ( f 1 , … , f k ) ( x ) = det f 1 ( x ) f 1 ′ ( x ) ⋮ f 1 ( k − 1 ) ( x ) f 2 ( x ) f 2 ′ ( x ) ⋮ f 2 ( k − 1 ) ( x ) … … ⋱ … f k ( x ) f k ′ ( x ) ⋮ f k ( k − 1 ) ( x ) .
Independence Criterion : If there exists at least one x 0 ∈ I x_0 \in I x 0 ∈ I such that W ( f 1 , … , f k ) ( x 0 ) ≠ 0 W(f_1, \dots, f_k)(x_0) \neq 0 W ( f 1 , … , f k ) ( x 0 ) = 0 , then { f 1 , … , f k } \{f_1, \dots, f_k\} { f 1 , … , f k } is linearly independent on I I I .
GRE Caution : The converse fails in general! Two functions can be linearly independent even if their Wronskian is identically zero everywhere on I I I (for example, x 2 x^2 x 2 and x ∣ x ∣ x|x| x ∣ x ∣ on ( − 1 , 1 ) (-1, 1) ( − 1 , 1 ) ). The converse holds only if the functions are solutions to an ordinary linear homogeneous differential equation with continuous coefficients.
- Intersections, Sums, and Direct Sums
- Subspace Operations
Let U , W ≤ V U, W \le V U , W ≤ V :
Intersection : U ∩ W U \cap W U ∩ W is always a subspace of V V V .
Union : U ∪ W U \cup W U ∪ W is a subspace of V V V if and only if U ⊆ W U \subseteq W U ⊆ W or W ⊆ U W \subseteq U W ⊆ U .
Sum : U + W = { u + w ∣ u ∈ U , w ∈ W } = span ( U ∪ W ) U + W = \{u + w \mid u \in U, w \in W\} = \operatorname{span}(U \cup W) U + W = { u + w ∣ u ∈ U , w ∈ W } = span ( U ∪ W ) , which is always a subspace.
The Grassmann Dimension Formula
For finite-dimensional subspaces U , W ≤ V U, W \le V U , W ≤ V : dim ( U + W ) = dim U + dim W − dim ( U ∩ W ) . \dim(U + W) = \dim U + \dim W - \dim(U \cap W). dim ( U + W ) = dim U + dim W − dim ( U ∩ W ) .
Since dim ( U + W ) ≤ dim V \dim(U + W) \le \dim V dim ( U + W ) ≤ dim V , this provides a sharp lower bound on the intersection dimension: dim ( U ∩ W ) ≥ dim U + dim W − dim V . \dim(U \cap W) \ge \dim U + \dim W - \dim V. dim ( U ∩ W ) ≥ dim U + dim W − dim V .
Internal Direct Sums
The sum V = U + W V = U + W V = U + W is an internal direct sum , denoted V = U ⊕ W V = U \oplus W V = U ⊕ W , if every vector v ∈ V v \in V v ∈ V can be written uniquely as v = u + w v = u + w v = u + w with u ∈ U , w ∈ W u \in U, w \in W u ∈ U , w ∈ W .
Equivalence : V = U ⊕ W ⟺ V = U + W and U ∩ W = { 0 V } V = U \oplus W \iff V = U + W \text{ and } U \cap W = \{0_V\} V = U ⊕ W ⟺ V = U + W and U ∩ W = { 0 V } .
Dimension Criterion : If dim V < ∞ \dim V < \infty dim V < ∞ , then V = U ⊕ W ⟺ U ∩ W = { 0 V } V = U \oplus W \iff U \cap W = \{0_V\} V = U ⊕ W ⟺ U ∩ W = { 0 V } and dim U + dim W = dim V \dim U + \dim W = \dim V dim U + dim W = dim V .
Subspace Operations Comparison
Operation Always a Subspace? Dimension Formula / Bound
Intersection U ∩ W U \cap W U ∩ W Yes max ( 0 , dim U + dim W − dim V ) ≤ dim ( U ∩ W ) ≤ min ( dim U , dim W ) \max(0, \dim U + \dim W - \dim V) \le \dim(U \cap W) \le \min(\dim U, \dim W) max ( 0 , dim U + dim W − dim V ) ≤ dim ( U ∩ W ) ≤ min ( dim U , dim W )
Union U ∪ W U \cup W U ∪ W No (only if U ⊆ W U \subseteq W U ⊆ W or W ⊆ U W \subseteq U W ⊆ U ) Not applicable (rarely a subspace)
Sum U + W U + W U + W Yes dim ( U + W ) = dim U + dim W − dim ( U ∩ W ) \dim(U + W) = \dim U + \dim W - \dim(U \cap W) dim ( U + W ) = dim U + dim W − dim ( U ∩ W )
Direct Sum U ⊕ W U \oplus W U ⊕ W Yes ( U ∩ W = { 0 } U \cap W = \{0\} U ∩ W = { 0 } ) dim ( U ⊕ W ) = dim U + dim W \dim(U \oplus W) = \dim U + \dim W dim ( U ⊕ W ) = dim U + dim W
- Step-by-Step Worked Problems
- Problem 1: Subspace Verification and Dimension
Let W = { p ( x ) ∈ P 3 ( R ) ∣ p ( 1 ) = 0 and p ′ ( 0 ) = 0 } W = \{p(x) \in P_3(\mathbb{R}) \mid p(1) = 0 \text{ and } p'(0) = 0\} W = { p ( x ) ∈ P 3 ( R ) ∣ p ( 1 ) = 0 and p ′ ( 0 ) = 0 } . Prove that W W W is a subspace of P 3 ( R ) P_3(\mathbb{R}) P 3 ( R ) and compute dim W \dim W dim W .
Solution :
Check zero polynomial: 0 ( 1 ) = 0 0(1) = 0 0 ( 1 ) = 0 and 0 ′ ( 0 ) = 0 0'(0) = 0 0 ′ ( 0 ) = 0 , so 0 ∈ W 0 \in W 0 ∈ W .
Check linear combinations: Let p , q ∈ W p, q \in W p , q ∈ W and c ∈ R c \in \mathbb{R} c ∈ R . Then ( c p + q ) ( 1 ) = c p ( 1 ) + q ( 1 ) = c ( 0 ) + 0 = 0 (cp + q)(1) = c p(1) + q(1) = c(0) + 0 = 0 ( c p + q ) ( 1 ) = c p ( 1 ) + q ( 1 ) = c ( 0 ) + 0 = 0 . Likewise, ( c p + q ) ′ ( 0 ) = c p ′ ( 0 ) + q ′ ( 0 ) = c ( 0 ) + 0 = 0 (cp + q)'(0) = c p'(0) + q'(0) = c(0) + 0 = 0 ( c p + q ) ′ ( 0 ) = c p ′ ( 0 ) + q ′ ( 0 ) = c ( 0 ) + 0 = 0 . Hence c p + q ∈ W cp + q \in W c p + q ∈ W , confirming W ≤ P 3 ( R ) W \le P_3(\mathbb{R}) W ≤ P 3 ( R ) .
Representation: Let p ( x ) = a x 3 + b x 2 + c x + d p(x) = ax^3 + bx^2 + cx + d p ( x ) = a x 3 + b x 2 + c x + d .
p ′ ( 0 ) = c = 0 ⟹ c = 0 p'(0) = c = 0 \implies c = 0 p ′ ( 0 ) = c = 0 ⟹ c = 0 .
p ( 1 ) = a + b + d = 0 ⟹ d = − a − b p(1) = a + b + d = 0 \implies d = -a - b p ( 1 ) = a + b + d = 0 ⟹ d = − a − b .
Thus p ( x ) = a x 3 + b x 2 − ( a + b ) = a ( x 3 − 1 ) + b ( x 2 − 1 ) p(x) = ax^3 + bx^2 - (a + b) = a(x^3 - 1) + b(x^2 - 1) p ( x ) = a x 3 + b x 2 − ( a + b ) = a ( x 3 − 1 ) + b ( x 2 − 1 ) .
The set { x 3 − 1 , x 2 − 1 } \{x^3 - 1, x^2 - 1\} { x 3 − 1 , x 2 − 1 } spans W W W and is linearly independent. Thus dim W = 2 \dim W = 2 dim W = 2 .
Problem 2: Bounding Intersection Dimension
Let U U U and W W W be subspaces of R 7 \mathbb{R}^7 R 7 with dim U = 4 \dim U = 4 dim U = 4 and dim W = 5 \dim W = 5 dim W = 5 . Find all possible values of dim ( U ∩ W ) \dim(U \cap W) dim ( U ∩ W ) .
Solution :
Apply Grassmann's formula: dim ( U ∩ W ) = dim U + dim W − dim ( U + W ) = 4 + 5 − dim ( U + W ) = 9 − dim ( U + W ) \dim(U \cap W) = \dim U + \dim W - \dim(U + W) = 4 + 5 - \dim(U + W) = 9 - \dim(U + W) dim ( U ∩ W ) = dim U + dim W − dim ( U + W ) = 4 + 5 − dim ( U + W ) = 9 − dim ( U + W ) .
Since U + W ≤ R 7 U + W \le \mathbb{R}^7 U + W ≤ R 7 , we have dim ( U + W ) ≤ 7 \dim(U + W) \le 7 dim ( U + W ) ≤ 7 . Thus dim ( U ∩ W ) ≥ 9 − 7 = 2 \dim(U \cap W) \ge 9 - 7 = 2 dim ( U ∩ W ) ≥ 9 − 7 = 2 .
Since U ∩ W ≤ U U \cap W \le U U ∩ W ≤ U , we have dim ( U ∩ W ) ≤ min ( dim U , dim W ) = min ( 4 , 5 ) = 4 \dim(U \cap W) \le \min(\dim U, \dim W) = \min(4, 5) = 4 dim ( U ∩ W ) ≤ min ( dim U , dim W ) = min ( 4 , 5 ) = 4 .
Both bounds and all intermediate integers can be realized by selecting standard coordinate subspaces. Thus dim ( U ∩ W ) ∈ { 2 , 3 , 4 } \dim(U \cap W) \in \{2, 3, 4\} dim ( U ∩ W ) ∈ { 2 , 3 , 4 } .
GRE Exam Traps & Pitfalls
Trap 1: Assuming the Union of Subspaces is a Subspace The union U ∪ W U \cup W U ∪ W is almost never a subspace. For example, the x x x -axis and y y y -axis in R 2 \mathbb{R}^2 R 2 are subspaces, but their union does not contain ( 1 , 0 ) + ( 0 , 1 ) = ( 1 , 1 ) (1, 0) + (0, 1) = (1, 1) ( 1 , 0 ) + ( 0 , 1 ) = ( 1 , 1 ) . Remember: U ∪ W ≤ V ⟺ U ⊆ W U \cup W \le V \iff U \subseteq W U ∪ W ≤ V ⟺ U ⊆ W or W ⊆ U W \subseteq U W ⊆ U .
Trap 2: Wronskian Converse Fallacy If W ( f 1 , … , f k ) ( x 0 ) ≠ 0 W(f_1, \dots, f_k)(x_0) \neq 0 W ( f 1 , … , f k ) ( x 0 ) = 0 for some x 0 x_0 x 0 , independence is guaranteed. But if W ( x ) ≡ 0 W(x) \equiv 0 W ( x ) ≡ 0 everywhere, functions need not be dependent unless they solve an n n n -th order linear homogeneous ODE.
Trap 3: Direct Sum Confusions Having dim U + dim W = dim V \dim U + \dim W = \dim V dim U + dim W = dim V is insufficient for V = U ⊕ W V = U \oplus W V = U ⊕ W ; the intersection U ∩ W U \cap W U ∩ W must be strictly { 0 } \{0\} { 0 } .