Subspaces - Comprehensive Summary
Subspace: A subset W of a vector space V that is itself a vector space under the same operations as V
Closure Properties: W must be closed under vector addition and scalar multiplication
Zero Vector: Every subspace must contain the zero vector of the parent space
• Contains zero vector: \(\vec{0} \in W\)
• Closed under addition: \(\vec{u}, \vec{v} \in W \Rightarrow \vec{u} + \vec{v} \in W\)
• Closed under scalar mult.: \(\vec{u} \in W, c \in \mathbb{R} \Rightarrow c\vec{u} \in W\)
• Subset condition: \(W \subseteq V\)
1. Verify zero vector inclusion
2. Check closure under addition
3. Check closure under scalar multiplication
4. Confirm subset relationship
• Always check zero vector first
• Use generic vectors for closure proofs
• Counterexamples disprove subspace property
• Spans and null spaces are always subspaces
Subspace: A subset \(W\) of a vector space \(V\) is a subspace if it satisfies three conditions: (1) \(\vec{0} \in W\), (2) \(\vec{u}, \vec{v} \in W \Rightarrow \vec{u} + \vec{v} \in W\), and (3) \(\vec{u} \in W, c \in \mathbb{R} \Rightarrow c\vec{u} \in W\).
- Check that the zero vector belongs to W
- Verify closure under vector addition
- Verify closure under scalar multiplication
- Confirm W is a subset of the parent vector space
Check if \(\begin{pmatrix} 0 \\ 0 \end{pmatrix} \in W\): Does \(0 = 2(0)\)? Yes, \(0 = 0\). ✓
Let \(\vec{u} = \begin{pmatrix} x_1 \\ y_1 \end{pmatrix}\) and \(\vec{v} = \begin{pmatrix} x_2 \\ y_2 \end{pmatrix}\) be vectors in W.
By definition of W: \(y_1 = 2x_1\) and \(y_2 = 2x_2\).
Consider \(\vec{u} + \vec{v} = \begin{pmatrix} x_1 + x_2 \\ y_1 + y_2 \end{pmatrix} = \begin{pmatrix} x_1 + x_2 \\ 2x_1 + 2x_2 \end{pmatrix} = \begin{pmatrix} x_1 + x_2 \\ 2(x_1 + x_2) \end{pmatrix}\).
Since the second component equals 2 times the first component, \(\vec{u} + \vec{v} \in W\). ✓
Let \(\vec{u} = \begin{pmatrix} x \\ y \end{pmatrix} \in W\) and \(c \in \mathbb{R}\).
By definition of W: \(y = 2x\).
Consider \(c\vec{u} = c\begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} cx \\ cy \end{pmatrix} = \begin{pmatrix} cx \\ c(2x) \end{pmatrix} = \begin{pmatrix} cx \\ 2(cx) \end{pmatrix}\).
Since the second component equals 2 times the first component, \(c\vec{u} \in W\). ✓
Every vector in W is clearly a vector in \(\mathbb{R}^2\), so \(W \subseteq \mathbb{R}^2\). ✓
W is a subspace of \(\mathbb{R}^2\) because it contains the zero vector and is closed under both vector addition and scalar multiplication.
• Zero vector test: Essential first step in subspace verification
• Closure verification: Must use generic vectors to prove for all cases
• Definition adherence: Use the defining property of the set throughout
Plane Through Origin: A plane defined by a linear equation where the constant term is zero. Such planes always pass through the origin and form subspaces of \(\mathbb{R}^3\).
Check if \(\begin{pmatrix} 0 \\ 0 \\ 0 \end{pmatrix} \in W\): Does \(0 + 0 + 0 = 0\)? Yes. ✓
Let \(\vec{u} = \begin{pmatrix} x_1 \\ y_1 \\ z_1 \end{pmatrix}\) and \(\vec{v} = \begin{pmatrix} x_2 \\ y_2 \\ z_2 \end{pmatrix}\) be vectors in W.
By definition of W: \(x_1 + y_1 + z_1 = 0\) and \(x_2 + y_2 + z_2 = 0\).
Consider \(\vec{u} + \vec{v} = \begin{pmatrix} x_1 + x_2 \\ y_1 + y_2 \\ z_1 + z_2 \end{pmatrix}\).
Check if \((x_1 + x_2) + (y_1 + y_2) + (z_1 + z_2) = 0\):
\((x_1 + y_1 + z_1) + (x_2 + y_2 + z_2) = 0 + 0 = 0\). ✓
Let \(\vec{u} = \begin{pmatrix} x \\ y \\ z \end{pmatrix} \in W\) and \(c \in \mathbb{R}\).
By definition of W: \(x + y + z = 0\).
Consider \(c\vec{u} = \begin{pmatrix} cx \\ cy \\ cz \end{pmatrix}\).
Check if \(cx + cy + cz = 0\):
\(c(x + y + z) = c(0) = 0\). ✓
Every vector in W is clearly a vector in \(\mathbb{R}^3\), so \(W \subseteq \mathbb{R}^3\). ✓
W is a subspace of \(\mathbb{R}^3\) because it contains the zero vector and is closed under both vector addition and scalar multiplication.
• Linearity preservation: Linear equations maintain their form under addition and scalar multiplication
• Generic vector approach: Use symbolic notation to prove for all vectors
• Property inheritance: The defining property transfers to linear combinations
Not a Subspace: A subset fails to be a subspace if it violates any of the three subspace conditions: zero vector inclusion, closure under addition, or closure under scalar multiplication.
Check if \(\begin{pmatrix} 0 \\ 0 \end{pmatrix} \in W\): Does \(0 = 0 + 1\)? No, \(0 \neq 1\).
Since the zero vector is not in W, W cannot be a subspace. ✓
Even though we've already proven it's not a subspace, let's verify another property fails.
Take \(\vec{u} = \begin{pmatrix} 0 \\ 1 \end{pmatrix} \in W\) (since \(1 = 0 + 1\)).
Consider \(2\vec{u} = \begin{pmatrix} 0 \\ 2 \end{pmatrix}\).
Is \(\begin{pmatrix} 0 \\ 2 \end{pmatrix} \in W\)? Does \(2 = 0 + 1\)? No, \(2 \neq 1\).
So scalar multiplication is not closed. ✓
Any line or plane that does not pass through the origin cannot be a subspace, because it won't contain the zero vector.
Take \(\vec{u} = \begin{pmatrix} 0 \\ 1 \end{pmatrix}\) and \(\vec{v} = \begin{pmatrix} 1 \\ 2 \end{pmatrix}\), both in W.
\(\vec{u} + \vec{v} = \begin{pmatrix} 1 \\ 3 \end{pmatrix}\).
Is \(\begin{pmatrix} 1 \\ 3 \end{pmatrix} \in W\)? Does \(3 = 1 + 1\)? No, \(3 \neq 2\).
So addition is not closed. ✓
W is not a subspace of \(\mathbb{R}^2\) because it does not contain the zero vector \(\begin{pmatrix} 0 \\ 0 \end{pmatrix}\).
• Zero vector necessity: Failure of this condition alone proves non-subspace
• Counterexample approach: Find specific examples showing property failure
• Geometric insight: Lines/planes not through origin fail subspace test
Null Space: The set of all vectors that are mapped to the zero vector by a matrix transformation. The null space is always a subspace of the domain.
Check if \(A\vec{0} = \vec{0}\): For any matrix A, \(A\vec{0} = \vec{0}\) by the properties of matrix multiplication. ✓
Let \(\vec{u}, \vec{v} \in \text{null}(A)\), so \(A\vec{u} = \vec{0}\) and \(A\vec{v} = \vec{0}\).
Consider \(A(\vec{u} + \vec{v}) = A\vec{u} + A\vec{v} = \vec{0} + \vec{0} = \vec{0}\).
Therefore, \(\vec{u} + \vec{v} \in \text{null}(A)\). ✓
Let \(\vec{u} \in \text{null}(A)\) and \(c \in \mathbb{R}\), so \(A\vec{u} = \vec{0}\).
Consider \(A(c\vec{u}) = c(A\vec{u}) = c\vec{0} = \vec{0}\).
Therefore, \(c\vec{u} \in \text{null}(A)\). ✓
Every vector in \(\text{null}(A)\) is clearly a vector in \(\mathbb{R}^3\), so \(\text{null}(A) \subseteq \mathbb{R}^3\). ✓
To solve \(A\vec{x} = \vec{0}\): \(\begin{pmatrix} 1 & 2 & 3 \\ 2 & 4 & 6 \end{pmatrix}\begin{pmatrix} x_1 \\ x_2 \\ x_3 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}\)
This gives us: \(x_1 + 2x_2 + 3x_3 = 0\) and \(2x_1 + 4x_2 + 6x_3 = 0\).
The second equation is redundant (2 times the first), so: \(x_1 = -2x_2 - 3x_3\).
So \(\text{null}(A) = \left\{ \begin{pmatrix} -2x_2 - 3x_3 \\ x_2 \\ x_3 \end{pmatrix} \mid x_2, x_3 \in \mathbb{R} \right\}\).
\(\text{null}(A)\) is a subspace of \(\mathbb{R}^3\) because it contains the zero vector and is closed under both vector addition and scalar multiplication.
• Matrix linearity: \(A(\vec{u} + \vec{v}) = A\vec{u} + A\vec{v}\) and \(A(c\vec{u}) = c(A\vec{u})\)
• Null space property: Null spaces are always subspaces
• Algebraic manipulation: Use matrix properties to prove closure
Intersection of Subspaces: The intersection of two subspaces is the set of all vectors that belong to both subspaces. This intersection is always a subspace.
\(W_1 \cap W_2 = \left\{ \begin{pmatrix} x \\ y \\ z \end{pmatrix} \in \mathbb{R}^3 \mid x + y = 0 \text{ and } y + z = 0 \right\}\).
Check if \(\begin{pmatrix} 0 \\ 0 \\ 0 \end{pmatrix} \in W_1 \cap W_2\):
Does \(0 + 0 = 0\)? Yes. Does \(0 + 0 = 0\)? Yes. ✓
Let \(\vec{u} = \begin{pmatrix} x_1 \\ y_1 \\ z_1 \end{pmatrix}\) and \(\vec{v} = \begin{pmatrix} x_2 \\ y_2 \\ z_2 \end{pmatrix}\) be in \(W_1 \cap W_2\).
This means: \(x_1 + y_1 = 0\), \(y_1 + z_1 = 0\), \(x_2 + y_2 = 0\), and \(y_2 + z_2 = 0\).
Consider \(\vec{u} + \vec{v} = \begin{pmatrix} x_1 + x_2 \\ y_1 + y_2 \\ z_1 + z_2 \end{pmatrix}\).
Check first condition: \((x_1 + x_2) + (y_1 + y_2) = (x_1 + y_1) + (x_2 + y_2) = 0 + 0 = 0\). ✓
Check second condition: \((y_1 + y_2) + (z_1 + z_2) = (y_1 + z_1) + (y_2 + z_2) = 0 + 0 = 0\). ✓
Let \(\vec{u} = \begin{pmatrix} x \\ y \\ z \end{pmatrix} \in W_1 \cap W_2\) and \(c \in \mathbb{R}\).
This means: \(x + y = 0\) and \(y + z = 0\).
Consider \(c\vec{u} = \begin{pmatrix} cx \\ cy \\ cz \end{pmatrix}\).
Check first condition: \(cx + cy = c(x + y) = c(0) = 0\). ✓
Check second condition: \(cy + cz = c(y + z) = c(0) = 0\). ✓
Every vector in \(W_1 \cap W_2\) is clearly a vector in \(\mathbb{R}^3\), so \(W_1 \cap W_2 \subseteq \mathbb{R}^3\). ✓
\(W_1 \cap W_2\) is a subspace of \(\mathbb{R}^3\) because it contains the zero vector and is closed under both vector addition and scalar multiplication.
• Intersection property: Intersection of subspaces is always a subspace
• Multiple conditions: Verify all defining conditions for intersection
• Component-wise approach: Handle each constraint separately
Subspace: A subset of a vector space that is itself a vector space under the same operations. It must satisfy three conditions: contain the zero vector, be closed under addition, and be closed under scalar multiplication.
Span: The set of all linear combinations of a given set of vectors. Spans are always subspaces.
Column Space: The span of the columns of a matrix. This is always a subspace.
- Zero vector test: Always verify the zero vector belongs to the set
- Addition closure: Take two arbitrary vectors from the set and show their sum is also in the set
- Scalar multiplication closure: Take an arbitrary vector and scalar, show the product is in the set
- Subset confirmation: Ensure the set is contained in the parent vector space
• Every vector space is a subspace of itself
• The zero vector alone forms a subspace (trivial subspace)
• The intersection of subspaces is always a subspace
• Spans of vector sets are always subspaces
• Null spaces and column spaces of matrices are always subspaces
Geometric Interpretation: Subspaces in \(\mathbb{R}^3\) can have dimensions 0, 1, 2, or 3, corresponding to: origin point, line through origin, plane through origin, and all of \(\mathbb{R}^3\).
- 0D: \(\{\vec{0}\}\) (origin point)
- 1D: Line through origin
- 2D: Plane through origin
- 3D: All of \(\mathbb{R}^3\)