Null Space and Column Space - Comprehensive Summary
Null Space (Kernel): \(\text{null}(A) = \{x \in \mathbb{R}^n \mid Ax = 0\}\), all vectors that map to zero vector
Column Space (Range): \(\text{col}(A) = \{Ax \mid x \in \mathbb{R}^n\}\), all possible outputs of matrix multiplication
Rank: Dimension of column space
Nullity: Dimension of null space
• \(\text{rank}(A) + \text{nullity}(A) = n\) (number of columns)
• Null space is always a subspace of domain
• Column space is always a subspace of codomain
• Both spaces are subspaces of their respective vector spaces
1. Find null space: Solve homogeneous system \(Ax = 0\)
2. Find column space: Use pivot columns of original matrix
3. Determine dimensions: Count free variables and pivot columns
4. Verify: Use rank-nullity theorem
• Always row reduce for null space computation
• Use original columns for column space basis
• Check rank-nullity theorem as verification
• Pivot columns correspond to basic variables
Null Space: The null space of matrix A, denoted \(\text{null}(A)\), is the set of all vectors \(\vec{x}\) such that \(A\vec{x} = \vec{0}\). It's also called the kernel of A.
- Set up the homogeneous system \(A\vec{x} = \vec{0}\)
- Row reduce the augmented matrix \([A | \vec{0}]\)
- Identify pivot and free variables
- Express basic variables in terms of free variables
- Write the general solution as a linear combination of vectors
We need to solve: \(\begin{pmatrix} 1 & 2 & 3 \\ 2 & 4 & 6 \\ 1 & 2 & 5 \end{pmatrix}\begin{pmatrix} x_1 \\ x_2 \\ x_3 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \\ 0 \end{pmatrix}\)
\(\begin{pmatrix} 1 & 2 & 3 & | & 0 \\ 2 & 4 & 6 & | & 0 \\ 1 & 2 & 5 & | & 0 \end{pmatrix}\)
\(R_2 \leftarrow R_2 - 2R_1\): \(\begin{pmatrix} 1 & 2 & 3 & | & 0 \\ 0 & 0 & 0 & | & 0 \\ 1 & 2 & 5 & | & 0 \end{pmatrix}\)
\(R_3 \leftarrow R_3 - R_1\): \(\begin{pmatrix} 1 & 2 & 3 & | & 0 \\ 0 & 0 & 0 & | & 0 \\ 0 & 0 & 2 & | & 0 \end{pmatrix}\)
\(R_3 \leftarrow \frac{1}{2}R_3\): \(\begin{pmatrix} 1 & 2 & 3 & | & 0 \\ 0 & 0 & 0 & | & 0 \\ 0 & 0 & 1 & | & 0 \end{pmatrix}\)
\(R_1 \leftarrow R_1 - 3R_3\): \(\begin{pmatrix} 1 & 2 & 0 & | & 0 \\ 0 & 0 & 0 & | & 0 \\ 0 & 0 & 1 & | & 0 \end{pmatrix}\)
From the reduced matrix: \(x_1 + 2x_2 = 0\) and \(x_3 = 0\)
Pivot variables: \(x_1, x_3\)
Free variable: \(x_2\)
From \(x_1 + 2x_2 = 0\): \(x_1 = -2x_2\)
From \(x_3 = 0\): \(x_3 = 0\)
Let \(x_2 = t\) where \(t\) is any real number.
Then: \(\begin{pmatrix} x_1 \\ x_2 \\ x_3 \end{pmatrix} = \begin{pmatrix} -2t \\ t \\ 0 \end{pmatrix} = t\begin{pmatrix} -2 \\ 1 \\ 0 \end{pmatrix}\)
\(\text{null}(A) = \left\{t\begin{pmatrix} -2 \\ 1 \\ 0 \end{pmatrix} \mid t \in \mathbb{R}\right\} = \text{span}\left\{\begin{pmatrix} -2 \\ 1 \\ 0 \end{pmatrix}\right\}\)
The null space of A is \(\text{span}\left\{\begin{pmatrix} -2 \\ 1 \\ 0 \end{pmatrix}\right\}\).
• Row reduction: Preserves solution space of homogeneous system
• Free variable identification: Non-pivot columns correspond to free variables
• Parametric form: Express solution in terms of free variables
Column Space: The column space of matrix A, denoted \(\text{col}(A)\), is the span of the column vectors of A. It's also called the range of A.
From Exercise 1: \(A \sim \begin{pmatrix} 1 & 2 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix}\)
In the row-reduced form, the pivot columns are columns 1 and 3 (columns with leading 1s).
The pivot columns in the original matrix A are:
Column 1: \(\begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix}\)
Column 3: \(\begin{pmatrix} 3 \\ 6 \\ 5 \end{pmatrix}\)
These columns form a basis for the column space: \(\left\{\begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix}, \begin{pmatrix} 3 \\ 6 \\ 5 \end{pmatrix}\right\}\)
Check that these two vectors are linearly independent:
\(c_1\begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix} + c_2\begin{pmatrix} 3 \\ 6 \\ 5 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \\ 0 \end{pmatrix}\)
This gives us: \(c_1 + 3c_2 = 0\), \(2c_1 + 6c_2 = 0\), \(c_1 + 5c_2 = 0\)
From first equation: \(c_1 = -3c_2\)
Substituting into third: \(-3c_2 + 5c_2 = 0\), so \(2c_2 = 0\), thus \(c_2 = 0\)
Therefore \(c_1 = 0\), confirming linear independence. ✓
A basis for the column space of A is \(\left\{\begin{pmatrix} 1 \\ 2 \\ 1 \end{pmatrix}, \begin{pmatrix} 3 \\ 6 \\ 5 \end{pmatrix}\right\}\).
• Pivot column method: Use original columns corresponding to pivot positions
• Linear independence: Pivot columns are always linearly independent
• Span preservation: Pivot columns span the same space as all columns
Rank: The dimension of the column space of A (equivalently, the row space of A).
Nullity: The dimension of the null space of A.
Rank-Nullity Theorem: For any \(m \times n\) matrix A: \(\text{rank}(A) + \text{nullity}(A) = n\).
From Exercise 2, the column space has dimension 2 (since the basis has 2 vectors).
Therefore: \(\text{rank}(A) = 2\)
From Exercise 1, the null space has dimension 1 (since the basis has 1 vector).
Therefore: \(\text{nullity}(A) = 1\)
Matrix A is \(3 \times 3\), so \(n = 3\).
\(\text{rank}(A) + \text{nullity}(A) = 2 + 1 = 3 = n\). ✓
From row-reduced form in Exercise 1: \(\begin{pmatrix} 1 & 2 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix}\)
Number of pivot positions = 2, so \(\text{rank}(A) = 2\). ✓
Number of free variables = 3 - 2 = 1, so \(\text{nullity}(A) = 1\). ✓
The rank of A is 2, the nullity of A is 1, and the Rank-Nullity Theorem is verified: \(2 + 1 = 3\).
• Dimension counting: Count vectors in basis to find dimension
• Rank-Nullity theorem: Fundamental relationship between dimensions
• Verification: Use theorem to check calculations
Invertibility Criterion: A square matrix A is invertible if and only if the equation \(A\vec{x} = \vec{0}\) has only the trivial solution \(\vec{x} = \vec{0}\).
Assume A is invertible. We need to show that \(\text{null}(A) = \{\vec{0}\}\).
Suppose \(\vec{x} \in \text{null}(A)\), so \(A\vec{x} = \vec{0}\).
Multiply both sides by \(A^{-1}\): \(A^{-1}A\vec{x} = A^{-1}\vec{0}\).
This gives us: \(I\vec{x} = \vec{0}\), so \(\vec{x} = \vec{0}\).
Therefore, the only vector in \(\text{null}(A)\) is \(\vec{0}\), so \(\text{null}(A) = \{\vec{0}\}\). ✓
Assume \(\text{null}(A) = \{\vec{0}\}\). We need to show that A is invertible.
Since \(\text{null}(A) = \{\vec{0}\}\), the homogeneous system \(A\vec{x} = \vec{0}\) has only the trivial solution.
This means the columns of A are linearly independent.
Since A is \(n \times n\) and its columns are linearly independent, A has full rank (rank = n).
For an \(n \times n\) matrix, full rank implies invertibility. ✓
We've shown both directions: A is invertible ⟺ \(\text{null}(A) = \{\vec{0}\}\).
This is equivalent to saying: A is invertible ⟺ the columns of A form a basis for \(\mathbb{R}^n\).
An \(n \times n\) matrix A is invertible if and only if its null space contains only the zero vector.
• Contrapositive reasoning: Use both directions of equivalence
• Linear independence: Trivial null space ⟹ independent columns
• Full rank criterion: Independent columns in square matrix ⟹ invertibility
Consistency Condition: The system \(A\vec{x} = \vec{b}\) has a solution if and only if \(\vec{b} \in \text{col}(A)\). This is because the column space consists of all possible outputs of the matrix transformation.
\(A = \begin{pmatrix} 1 & 2 \\ 2 & 4 \\ 3 & 6 \end{pmatrix}\)
Notice that column 2 is twice column 1: \(\begin{pmatrix} 2 \\ 4 \\ 6 \end{pmatrix} = 2\begin{pmatrix} 1 \\ 2 \\ 3 \end{pmatrix}\).
So \(\text{col}(A) = \text{span}\left\{\begin{pmatrix} 1 \\ 2 \\ 3 \end{pmatrix}\right\}\).
\(\vec{b_1} = \begin{pmatrix} 3 \\ 6 \\ 9 \end{pmatrix} = 3\begin{pmatrix} 1 \\ 2 \\ 3 \end{pmatrix}\).
Since \(\vec{b_1}\) is a scalar multiple of the column space generator, \(\vec{b_1} \in \text{col}(A)\).
Therefore, \(A\vec{x} = \vec{b_1}\) has a solution. ✓
We need \(\begin{pmatrix} 1 & 2 \\ 2 & 4 \\ 3 & 6 \end{pmatrix}\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} 3 \\ 6 \\ 9 \end{pmatrix}\).
This gives us: \(x_1 + 2x_2 = 3\), \(2x_1 + 4x_2 = 6\), \(3x_1 + 6x_2 = 9\).
The second and third equations are multiples of the first, so we have one equation with two unknowns.
Let \(x_2 = 0\), then \(x_1 = 3\).
So one solution is \(\vec{x} = \begin{pmatrix} 3 \\ 0 \end{pmatrix}\).
\(\vec{b_2} = \begin{pmatrix} 1 \\ 2 \\ 3 \end{pmatrix} = 1\begin{pmatrix} 1 \\ 2 \\ 3 \end{pmatrix}\).
Since \(\vec{b_2}\) equals the column space generator, \(\vec{b_2} \in \text{col}(A)\).
Therefore, \(A\vec{x} = \vec{b_2}\) has a solution. ✓
We need \(\begin{pmatrix} 1 & 2 \\ 2 & 4 \\ 3 & 6 \end{pmatrix}\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} 1 \\ 2 \\ 3 \end{pmatrix}\).
This gives us: \(x_1 + 2x_2 = 1\), \(2x_1 + 4x_2 = 2\), \(3x_1 + 6x_2 = 3\).
Again, the second and third equations are multiples of the first.
Let \(x_2 = 0\), then \(x_1 = 1\).
So one solution is \(\vec{x} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}\).
Both systems have solutions: For \(\vec{b_1}\), \(\vec{x} = \begin{pmatrix} 3 \\ 0 \end{pmatrix}\) is a solution; for \(\vec{b_2}\), \(\vec{x} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}\) is a solution.
• Consistency test: System has solution ⟺ \(\vec{b} \in \text{col}(A)\)
• Dependent columns: Reduces dimension of column space
• Free variables: Allow for multiple solutions
Null Space: The set of all vectors that are mapped to the zero vector by the matrix transformation. It represents the "kernel" of the transformation.
Column Space: The set of all possible outputs of the matrix transformation. It represents the "range" of the transformation.
Row Space: The span of the row vectors of A, which has the same dimension as the column space.
- For null space: Row reduce [A | 0] and express solution in parametric form
- For column space: Row reduce A and select original columns corresponding to pivot positions
- For rank: Count number of pivots in row-reduced form
- For nullity: Count number of free variables or use rank-nullity theorem
• \(\text{rank}(A) = \text{rank}(A^T)\) (row rank equals column rank)
• \(\text{null}(A) \perp \text{row}(A)\) (null space is orthogonal to row space)
• \(A\) is surjective ⟺ \(\text{col}(A)\) equals codomain
• \(A\) is injective ⟺ \(\text{null}(A) = \{\vec{0}\}\)
• \(A\) is bijective ⟺ \(A\) is square and invertible
Geometric Interpretation: The null space represents all vectors in the domain that are "collapsed" to zero in the codomain, while the column space represents all possible outputs of the transformation.
- Domain: \(\mathbb{R}^3\) (3D space)
- Null space: Line through origin in \(\mathbb{R}^3\)
- Codomain: \(\mathbb{R}^2\) (2D space)
- Column space: Line through origin in \(\mathbb{R}^2\)