Basis and Dimension - Comprehensive Summary
Basis: A set of vectors that is linearly independent and spans the vector space
Dimension: The number of vectors in any basis for the vector space
Linear Independence: No vector in the set can be written as a linear combination of others
Spanning Set: Every vector in the space can be written as a linear combination of vectors in the set
• Basis = Linearly independent + Spanning
• All bases of a vector space have the same size
• Dimension is well-defined
• In R^n, any n linearly independent vectors form a basis
1. Check linear independence using determinant or row reduction
2. Verify spanning property by solving for coefficients
3. Use dimension theorem: dim(span) ≤ number of vectors
4. Apply Rank-Nullity theorem when relevant
• Count vectors in proposed basis
• Check against dimension of space
• Use row reduction for efficiency
• Verify both conditions (independence and spanning)
Basis: A set of vectors that is linearly independent and spans the vector space. For a set to be a basis for \(\mathbb{R}^3\), it must contain exactly 3 linearly independent vectors that span \(\mathbb{R}^3\).
- Verify linear independence: Show that the only solution to \(c_1\vec{e_1} + c_2\vec{e_2} + c_3\vec{e_3} = \vec{0}\) is \(c_1 = c_2 = c_3 = 0\)
- Verify spanning property: Show that any vector in \(\mathbb{R}^3\) can be written as a linear combination of the basis vectors
- Confirm the number of vectors equals the dimension of the space
We need to solve: \(c_1\begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix} + c_2\begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix} + c_3\begin{pmatrix} 0 \\ 0 \\ 1 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \\ 0 \end{pmatrix}\)
This gives us: \(\begin{pmatrix} c_1 \\ c_2 \\ c_3 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \\ 0 \end{pmatrix}\)
Therefore: \(c_1 = c_2 = c_3 = 0\). The vectors are linearly independent. ✓
Let \(\vec{v} = \begin{pmatrix} a \\ b \\ c \end{pmatrix}\) be any vector in \(\mathbb{R}^3\).
We can write: \(\vec{v} = a\begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix} + b\begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix} + c\begin{pmatrix} 0 \\ 0 \\ 1 \end{pmatrix} = a\vec{e_1} + b\vec{e_2} + c\vec{e_3}\)
Therefore, any vector in \(\mathbb{R}^3\) can be expressed as a linear combination of these vectors. ✓
The set contains exactly 3 vectors, which equals the dimension of \(\mathbb{R}^3\). ✓
Since the set is linearly independent, spans \(\mathbb{R}^3\), and contains the correct number of vectors, it forms a basis for \(\mathbb{R}^3\). ✓
The standard basis vectors \(\{\vec{e_1}, \vec{e_2}, \vec{e_3}\}\) form a basis for \(\mathbb{R}^3\) because they are linearly independent and span \(\mathbb{R}^3\).
• Linear independence test: Only trivial solution to homogeneous equation
• Spanning verification: Express arbitrary vector as linear combination
• Dimension matching: Number of vectors equals space dimension
Non-Standard Basis: A basis that is not the standard basis. To verify, we must check both linear independence and spanning properties.
Form a matrix with the vectors as columns: \(A = \begin{pmatrix} 1 & 0 & 1 \\ 2 & 1 & 0 \\ 0 & 1 & 1 \end{pmatrix}\)
\(\det(A) = 1\begin{vmatrix} 1 & 0 \\ 1 & 1 \end{vmatrix} - 0\begin{vmatrix} 2 & 0 \\ 0 & 1 \end{vmatrix} + 1\begin{vmatrix} 2 & 1 \\ 0 & 1 \end{vmatrix}\)
\(= 1(1 \cdot 1 - 0 \cdot 1) - 0 + 1(2 \cdot 1 - 1 \cdot 0)\)
\(= 1(1) + 1(2) = 1 + 2 = 3\)
Since \(\det(A) = 3 \neq 0\), the vectors are linearly independent. ✓
Since we have 3 linearly independent vectors in \(\mathbb{R}^3\) (which has dimension 3), they automatically span \(\mathbb{R}^3\). ✓
Since the vectors are linearly independent and span \(\mathbb{R}^3\), they form a basis for \(\mathbb{R}^3\). ✓
Yes, the vectors \(\{\vec{v_1}, \vec{v_2}, \vec{v_3}\}\) form a basis for \(\mathbb{R}^3\) because they are linearly independent and span the space.
• Determinant test: Non-zero determinant implies linear independence
• Dimension theorem: n independent vectors in R^n form a basis
• Efficiency shortcut: When dimension matches, independence implies spanning
Not a Basis: A set fails to be a basis if it violates either linear independence or spanning property (or both). We'll demonstrate linear dependence.
Notice that \(\vec{u_2} = \begin{pmatrix} 2 \\ 4 \\ 6 \end{pmatrix} = 2\begin{pmatrix} 1 \\ 2 \\ 3 \end{pmatrix} = 2\vec{u_1}\)
Since one vector is a scalar multiple of another, the vectors are linearly dependent. ✓
Form matrix: \(A = \begin{pmatrix} 1 & 2 & 1 \\ 2 & 4 & 0 \\ 3 & 6 & 1 \end{pmatrix}\)
\(\det(A) = 1\begin{vmatrix} 4 & 0 \\ 6 & 1 \end{vmatrix} - 2\begin{vmatrix} 2 & 0 \\ 3 & 1 \end{vmatrix} + 1\begin{vmatrix} 2 & 4 \\ 3 & 6 \end{vmatrix}\)
\(= 1(4 \cdot 1 - 0 \cdot 6) - 2(2 \cdot 1 - 0 \cdot 3) + 1(2 \cdot 6 - 4 \cdot 3)\)
\(= 1(4) - 2(2) + 1(12 - 12) = 4 - 4 + 0 = 0\)
Since \(\det(A) = 0\), the vectors are linearly dependent. ✓
We can write: \(2\vec{u_1} - \vec{u_2} + 0\vec{u_3} = \vec{0}\)
This is a non-trivial linear combination equal to zero, confirming linear dependence. ✓
Since the vectors are linearly dependent, they cannot form a basis for \(\mathbb{R}^3\). ✓
These vectors span at most a 2-dimensional subspace of \(\mathbb{R}^3\), not the entire space.
The vectors do not form a basis for \(\mathbb{R}^3\) because they are linearly dependent (specifically, \(\vec{u_2} = 2\vec{u_1}\)).
• Dependence detection: One vector is scalar multiple of another
• Determinant test: Zero determinant confirms dependence
• Explicit relation: Find non-trivial combination equal to zero
Spanning Set Reduction: To find a basis for the span of a set of vectors, we need to eliminate dependent vectors while preserving the span. The remaining vectors form a basis.
Let \(A = \begin{pmatrix} 1 & 2 & 1 \\ 2 & 4 & 2 \\ 1 & 0 & 1 \\ 0 & 1 & 0 \end{pmatrix}\)
\(\begin{pmatrix} 1 & 2 & 1 \\ 2 & 4 & 2 \\ 1 & 0 & 1 \\ 0 & 1 & 0 \end{pmatrix} \xrightarrow{\text{row ops}} \begin{pmatrix} 1 & 2 & 1 \\ 0 & 0 & 0 \\ 0 & -2 & 0 \\ 0 & 1 & 0 \end{pmatrix} \xrightarrow{\text{more ops}} \begin{pmatrix} 1 & 2 & 1 \\ 0 & 1 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}\)
The pivot columns in the row-reduced form are columns 1 and 2.
This corresponds to the first and fourth original vectors.
A basis for W is \(\left\{\begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix}, \begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix}\right\}\).
Wait, let me recalculate more carefully:
Looking at the original vectors: \(\vec{v_1} = \begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix}\), \(\vec{v_2} = \begin{pmatrix} 2 \\ 4 \\ 2 \end{pmatrix}\), \(\vec{v_3} = \begin{pmatrix} 1 \\ 0 \\ 1 \end{pmatrix}\), \(\vec{v_4} = \begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix}\)
Note: \(\vec{v_2} = 2\vec{v_1}\), so \(\vec{v_2}\) is dependent on \(\vec{v_1}\).
Now check if \(\vec{v_1}\) and \(\vec{v_3}\) are independent: \(\begin{pmatrix} 1 & 1 \\ 2 & 0 \\ 1 & 1 \end{pmatrix}\) has rank 2.
Check if \(\vec{v_4}\) is independent of \(\{\vec{v_1}, \vec{v_3}\}\): Form \(\begin{pmatrix} 1 & 1 & 0 \\ 2 & 0 & 1 \\ 1 & 1 & 0 \end{pmatrix}\). The third column is independent of the first two.
Actually, let's reconsider: \(\vec{v_4} = \begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix}\) is independent of \(\{\vec{v_1}, \vec{v_3}\}\).
Check if \(\{\vec{v_1}, \vec{v_3}, \vec{v_4}\}\) are linearly independent:
\(c_1\begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix} + c_2\begin{pmatrix} 1 \\ 0 \\ 1 \end{pmatrix} + c_3\begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \\ 0 \end{pmatrix}\)
This gives: \(c_1 + c_2 = 0\), \(2c_1 + c_3 = 0\), \(c_1 + c_2 = 0\)
From first and third: \(c_1 + c_2 = 0\)
From second: \(c_3 = -2c_1\)
Let \(c_2 = -c_1\), then all equations satisfied only when \(c_1 = c_2 = c_3 = 0\)
Actually, wait: if \(c_1 = 1\), \(c_2 = -1\), \(c_3 = -2\), then \(2(1) + (-2) = 0\), so this is not independent!
Let me be more systematic: \(\begin{pmatrix} 1 & 1 & 0 & | & 0 \\ 2 & 0 & 1 & | & 0 \\ 1 & 1 & 0 & | & 0 \end{pmatrix}\)
Row reducing: \(\begin{pmatrix} 1 & 1 & 0 & | & 0 \\ 0 & -2 & 1 & | & 0 \\ 0 & 0 & 0 & | & 0 \end{pmatrix}\)
This gives: \(c_1 + c_2 = 0\) and \(-2c_2 + c_3 = 0\), so \(c_1 = -c_2\) and \(c_3 = 2c_2\)
So \(\vec{v_4} = 2\vec{v_3} - 2\vec{v_1}\) (checking: \(2\begin{pmatrix} 1 \\ 0 \\ 1 \end{pmatrix} - 2\begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix} = \begin{pmatrix} 0 \\ -4 \\ 0 \end{pmatrix} \neq \vec{v_4}\))
Actually: \(\vec{v_4} = \frac{1}{2}\vec{v_1} - \frac{1}{2}\vec{v_3}\) (checking: \(\frac{1}{2}\begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix} - \frac{1}{2}\begin{pmatrix} 1 \\ 0 \\ 1 \end{pmatrix} = \begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix} = \vec{v_4}\))
So \(\vec{v_4}\) is dependent on \(\{\vec{v_1}, \vec{v_3}\}\).
A basis for W is \(\left\{\begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix}, \begin{pmatrix} 1 \\ 0 \\ 1 \end{pmatrix}\right\}\).
Since \(\vec{v_2} = 2\vec{v_1}\) and \(\vec{v_4} = \frac{1}{2}\vec{v_1} - \frac{1}{2}\vec{v_3}\), only \(\vec{v_1}\) and \(\vec{v_3}\) are needed.
A basis for W is \(\left\{\begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix}, \begin{pmatrix} 1 \\ 0 \\ 1 \end{pmatrix}\right\}\) and \(\text{dim}(W) = 2\).
• Row reduction method: Efficiently identify independent vectors
• Span preservation: Removing dependent vectors doesn't change the span
• Dimension counting: Number of basis vectors equals dimension
Polynomial Subspace: The space of quadratic polynomials that vanish at x = 1. We need to find polynomials of the form \(p(x) = ax^2 + bx + c\) where \(p(1) = a + b + c = 0\).
For \(p(x) = ax^2 + bx + c\) to satisfy \(p(1) = 0\):
\(p(1) = a(1)^2 + b(1) + c = a + b + c = 0\)
Therefore: \(c = -a - b\)
Any polynomial in the subspace can be written as:
\(p(x) = ax^2 + bx + (-a - b) = ax^2 + bx - a - b\)
\(= a(x^2 - 1) + b(x - 1)\)
From the expression \(p(x) = a(x^2 - 1) + b(x - 1)\), we see that any polynomial in the subspace is a linear combination of \((x^2 - 1)\) and \((x - 1)\).
So our candidate basis is \(\{x^2 - 1, x - 1\}\).
We need to show that the only solution to \(c_1(x^2 - 1) + c_2(x - 1) = 0\) is \(c_1 = c_2 = 0\).
\(c_1x^2 - c_1 + c_2x - c_2 = 0\)
\(c_1x^2 + c_2x + (-c_1 - c_2) = 0\)
For this to be the zero polynomial: \(c_1 = 0\), \(c_2 = 0\), and \(-c_1 - c_2 = 0\).
All conditions are satisfied only when \(c_1 = c_2 = 0\). ✓
By construction, any polynomial \(p(x)\) in the subspace with \(p(1) = 0\) can be written as \(p(x) = a(x^2 - 1) + b(x - 1)\), which is a linear combination of our basis vectors. ✓
The set \(\{x^2 - 1, x - 1\}\) is linearly independent and spans the subspace, so it forms a basis.
A basis for the subspace is \(\{x^2 - 1, x - 1\}\) and the dimension is 2.
• Constraint substitution: Use the condition to eliminate variables
• Factorization approach: Write polynomials in factored form when possible
• Polynomial independence: Coefficients of different powers must be zero
Basis: A set of vectors that is linearly independent and spans the vector space. It provides a coordinate system for the space.
Dimension: The number of vectors in any basis of a vector space. This is well-defined and unique for each space.
Finite-Dimensional: A vector space is finite-dimensional if it has a finite basis.
- For linear independence: Show that the only solution to the homogeneous equation is the trivial solution
- For spanning: Show that any vector in the space can be written as a linear combination of the proposed basis vectors
- For dimension: Count the number of vectors in a basis
- Verification: Ensure the number of vectors matches the expected dimension
• All bases of a vector space have the same number of elements
• In R^n, any n linearly independent vectors form a basis
• A basis is both a minimal spanning set and a maximal independent set
• Dimension of a subspace ≤ dimension of the parent space
• \(\text{dim}(\text{col}(A)) + \text{dim}(\text{null}(A)) = \text{number of columns of } A\)
Geometric Interpretation: Different bases create different "grid" systems for the same space. Any vector can be represented uniquely in terms of any basis.
- Standard basis: \(\left\{\begin{pmatrix} 1 \\ 0 \end{pmatrix}, \begin{pmatrix} 0 \\ 1 \end{pmatrix}\right\}\)
- Alternative basis: \(\left\{\begin{pmatrix} 2 \\ 1 \end{pmatrix}, \begin{pmatrix} 1 \\ 2 \end{pmatrix}\right\}\)
- Same space, different coordinate systems