Linear Independence
Before Independence is a question about the solutions of Ax = 0, so it uses the matrix equation and solution sets. Builds on: The Matrix Equation Ax = b · Solution Sets of Linear Systems and Free Variables
Next Independence appears in almost every later lesson: invertibility, subspaces, bases, dimension, eigenvectors, and orthogonal sets. Leads to: The Invertible Matrix Theorem · Vector Spaces and Subspaces · Null Space, Column Space, and Basis · Dimension, Rank, and Coordinate Systems · Diagonalization · Inner Products, Length, and Orthogonality · Orthogonal Projections and the Gram-Schmidt Process
Before You Start: Prerequisite Check
Can you do these? (Click to reveal self-test)
Test yourself on these prerequisite skills:
Null space: What is the null space of a matrix $A$?
Check
The null space $\text{Nul}(A)$ is the solution set of the homogeneous equation $A\mathbf{x} = \mathbf{0}$. It always contains $\mathbf{0}$ and is a subspace of $\mathbb{R}^n$.
Free variables: When does $A\mathbf{x} = \mathbf{0}$ have a nontrivial solution?
Check
When the row reduction of $A$ produces at least one free variable (a column without a pivot). Any nonzero value for a free parameter gives a nontrivial solution.
Column combination: If $A = [\mathbf{v}_1 \; \mathbf{v}_2]$, what does $A\mathbf{x} = \mathbf{0}$ ask?
Check
It asks: for which scalars $x_1, x_2$ does $x_1\mathbf{v}_1 + x_2\mathbf{v}_2 = \mathbf{0}$? This is exactly the linear dependence equation for the set $\{\mathbf{v}_1, \mathbf{v}_2\}$.
If you struggled: Review Solution Sets and Free Variables and The Matrix Equation Ax = b.
Try This First
Try to find scalars $c_1$ and $c_2$, not both zero, satisfying:
\[ c_1\begin{pmatrix}1\\0\end{pmatrix} + c_2\begin{pmatrix}0\\1\end{pmatrix} = \begin{pmatrix}0\\0\end{pmatrix} \]
If you cannot find such scalars, explain why.
Then try the same with: \[ c_1\begin{pmatrix}1\\2\end{pmatrix} + c_2\begin{pmatrix}2\\4\end{pmatrix} = \begin{pmatrix}0\\0\end{pmatrix} \]
Show Solution
First pair: The equation gives $c_1 = 0$ and $c_2 = 0$. There is no nontrivial solution. The vectors $\begin{pmatrix}1\\0\end{pmatrix}$ and $\begin{pmatrix}0\\1\end{pmatrix}$ point in genuinely different directions. This set is linearly independent.
Second pair: Take $c_1 = 2$ and $c_2 = -1$: \[ 2\begin{pmatrix}1\\2\end{pmatrix} + (-1)\begin{pmatrix}2\\4\end{pmatrix} = \begin{pmatrix}2\\4\end{pmatrix} - \begin{pmatrix}2\\4\end{pmatrix} = \begin{pmatrix}0\\0\end{pmatrix} \]
A nontrivial solution exists. The second vector is $2$ times the first. This set is linearly dependent.
The pattern: Linear dependence means some nontrivial combination equals zero. Linear independence means the only way to combine them into zero is to use all-zero scalars.
The Geometric Picture
Two vectors are linearly dependent when one lies in the span of the other, which in $\mathbb{R}^2$ means they point in the same or opposite direction. Three vectors in $\mathbb{R}^3$ are dependent when one lies in the plane spanned by the other two.
Dependence is about redundancy: a dependent vector adds no new direction to the span. An independent set has no redundancy: each vector contributes a genuinely new direction.
This is why linear independence matters throughout linear algebra: a basis, the most efficient spanning set for a space, is always linearly independent.
Prerequisite Map
Quick Reference
| Property | Value |
|---|---|
| Course | MATH 231 |
| Difficulty | Intermediate |
| Time | ~30 minutes |
| Source | Lay, Linear Algebra and Its Applications, Section 1.7 |
Independence Test at a Glance
| Step | Action |
|---|---|
| 1 | Form $A = [\mathbf{v}_1 \; \mathbf{v}_2 \; \cdots \; \mathbf{v}_p]$ |
| 2 | Row-reduce $[A \mid \mathbf{0}]$ |
| 3 | Count free columns |
| Independent: | No free columns (pivot in every variable column) |
| Dependent: | At least one free column |
Key Concepts
Definition
A set of vectors $\{\mathbf{v}_1, \mathbf{v}_2, \ldots, \mathbf{v}_p\}$ in $\mathbb{R}^n$ is linearly independent if the vector equation
\[ x_1\mathbf{v}_1 + x_2\mathbf{v}_2 + \cdots + x_p\mathbf{v}_p = \mathbf{0} \]
has only the trivial solution $x_1 = x_2 = \cdots = x_p = 0$.
The set is linearly dependent if there exist scalars $c_1, \ldots, c_p$, not all zero, satisfying the equation. Such a collection $(c_1, \ldots, c_p)$ is called a linear dependence relation among the vectors.
Source: Lay, Linear Algebra and Its Applications, Section 1.7: Linear Independence.
The Matrix Test
To test $\{\mathbf{v}_1, \ldots, \mathbf{v}_p\}$ for independence, form the matrix $A = [\mathbf{v}_1 \; \cdots \; \mathbf{v}_p]$ and row-reduce $[A \mid \mathbf{0}]$:
- Independent: every column of $A$ is a pivot column (no free variables, only trivial solution).
- Dependent: at least one free column exists (nontrivial solutions exist).
Note: the augmented column $\mathbf{0}$ never becomes a pivot column in the homogeneous system, so you only need to reduce $A$ itself and count pivot columns.
Worked Example
Is $\left\{\begin{pmatrix}1\\2\\3\end{pmatrix}, \begin{pmatrix}2\\1\\0\end{pmatrix}, \begin{pmatrix}4\\5\\6\end{pmatrix}\right\}$ linearly independent?
Form $A$ and row-reduce: \[ \left[\begin{array}{rrr} 1 & 2 & 4 \\ 2 & 1 & 5 \\ 3 & 0 & 6 \end{array}\right] \]
$R_2 \to R_2 - 2R_1$, $R_3 \to R_3 - 3R_1$: \[ \left[\begin{array}{rrr} 1 & 2 & 4 \\ 0 & -3 & -3 \\ 0 & -6 & -6 \end{array}\right] \]
$R_3 \to R_3 - 2R_2$: \[ \left[\begin{array}{rrr} 1 & 2 & 4 \\ 0 & -3 & -3 \\ 0 & 0 & 0 \end{array}\right] \]
Column 3 is free: the set is linearly dependent.
Finding the dependence relation: Let $x_3 = t$. Then $x_2 = -t$ and $x_1 = -2t$. With $t = 1$:
\[ -2\begin{pmatrix}1\\2\\3\end{pmatrix} - 1\begin{pmatrix}2\\1\\0\end{pmatrix} + 1\begin{pmatrix}4\\5\\6\end{pmatrix} = \begin{pmatrix}-2-2+4\\-4-1+5\\-6+0+6\end{pmatrix} = \begin{pmatrix}0\\0\\0\end{pmatrix} \]
The third vector is a linear combination of the first two: $\begin{pmatrix}4\\5\\6\end{pmatrix} = 2\begin{pmatrix}1\\2\\3\end{pmatrix} + \begin{pmatrix}2\\1\\0\end{pmatrix}$.
Special Cases
| Situation | Conclusion | Why |
|---|---|---|
| Set contains $\mathbf{0}$ | Dependent | Any scalar $c \neq 0$ gives $c \cdot \mathbf{0} = \mathbf{0}$ |
| One nonzero vector $\{\mathbf{v}\}$ | Independent | $c\mathbf{v} = \mathbf{0}$ implies $c = 0$ |
| Two vectors, neither a multiple of the other | Independent | No $c$ makes $\mathbf{v}_1 = c\mathbf{v}_2$ |
| Two vectors, one a multiple of the other | Dependent | That multiple is the relation |
| $p > n$ vectors in $\mathbb{R}^n$ | Always dependent | $A$ is $n \times p$ with $p > n$, so fewer than $p$ pivots are possible |
The last case is particularly useful: you cannot have more than $n$ linearly independent vectors in $\mathbb{R}^n$.
Common Pitfalls
| Mistake | Why It Is Wrong | Correct Approach |
|---|---|---|
| Checking only pairs of vectors for dependence | Pairwise independence does not imply set independence; a vector could be a combination of two others without being a multiple of either | Check the full set by row-reducing the matrix of all vectors |
| Concluding vectors are independent because they are not parallel | In $\mathbb{R}^n$ with $n \geq 3$, a vector could lie in the span of two others even if it is not parallel to either | Use the matrix test; geometric inspection alone is insufficient |
| Thinking “more vectors means more likely independent” | More vectors in a fixed space $\mathbb{R}^n$ actually increases the chance of dependence; once you have more than $n$ vectors, dependence is guaranteed | Count pivot columns, not just the number of vectors |
| Forgetting that a set containing $\mathbf{0}$ is always dependent | $c\mathbf{0} = \mathbf{0}$ for any nonzero $c$, which is a nontrivial dependence relation | Check for zero vectors before row-reducing |
Pairwise Independence Does Not Imply Full Independence
Consider in $\mathbb{R}^2$: \[ \mathbf{v}_1 = \begin{pmatrix}1\\0\end{pmatrix}, \quad \mathbf{v}_2 = \begin{pmatrix}0\\1\end{pmatrix}, \quad \mathbf{v}_3 = \begin{pmatrix}1\\1\end{pmatrix} \]
Each pair is independent: no vector in any pair is a multiple of the other.
Yet the full set is dependent: $\mathbf{v}_3 = \mathbf{v}_1 + \mathbf{v}_2$, so $\mathbf{v}_1 + \mathbf{v}_2 - \mathbf{v}_3 = \mathbf{0}$.
In $\mathbb{R}^2$, any three vectors must be dependent (more vectors than dimension of the space).
Practice Problems
For each pair below, determine by inspection (without row reduction) whether the pair is linearly independent or dependent. Justify each answer.
(a) $\left\{\begin{pmatrix}3\\-6\end{pmatrix}, \begin{pmatrix}-1\\2\end{pmatrix}\right\}$
(b) $\left\{\begin{pmatrix}1\\2\\3\end{pmatrix}, \begin{pmatrix}0\\1\\-1\end{pmatrix}\right\}$
Determine whether $\left\{\begin{pmatrix}1\\0\\2\end{pmatrix}, \begin{pmatrix}-1\\1\\0\end{pmatrix}, \begin{pmatrix}3\\1\\4\end{pmatrix}\right\}$ is linearly independent or dependent by row-reducing the matrix formed by these vectors as columns.
(a) Determine whether $\left\{\begin{pmatrix}1\\-2\\0\end{pmatrix}, \begin{pmatrix}2\\1\\3\end{pmatrix}, \begin{pmatrix}4\\-3\\3\end{pmatrix}\right\}$ is linearly independent.
(b) If the set is dependent, find a specific linear dependence relation: nonzero scalars $c_1, c_2, c_3$ with $c_1\mathbf{v}_1 + c_2\mathbf{v}_2 + c_3\mathbf{v}_3 = \mathbf{0}$.
Four vectors in $\mathbb{R}^3$ must be linearly dependent. Explain why this is always true, without computing a specific example.
Then construct a set of four vectors in $\mathbb{R}^3$ and verify dependence by row reduction.
Let $A = \begin{pmatrix}1&0&2\\-1&1&1\\0&2&3\end{pmatrix}$.
(a) Are the columns of $A$ linearly independent? Row-reduce to decide.
(b) What does the answer to (a) tell you about $\text{Nul}(A)$?
(c) If $A\mathbf{x} = \mathbf{b}$ is consistent, how many solutions does it have? Explain.
(d) A classmate claims: “If I change one entry of $A$, the columns might become dependent.” For which entry positions would a small change most plausibly destroy independence? Where would it change nothing?
Common Misconceptions
linearly independent vectors must be perpendicular. Perpendicularity (zero dot product) is a much stronger condition than independence. Two vectors at a $45^\circ$ angle are linearly independent; two vectors at $90^\circ$ are both independent AND orthogonal. Independence requires only that neither vector is a scalar multiple of the other, which is possible at virtually any angle except $0^\circ$ or $180^\circ$.
checking all pairs of vectors in a set is sufficient to confirm independence. A set of vectors can be pairwise independent (no single vector is a multiple of any other) yet still be linearly dependent as a set. This happens when one vector is a linear combination of two or more others. For three or more vectors, always test the full set with the matrix method.
adding more vectors to an independent set keeps it independent. Increasing the number of vectors increases the chance of dependence. Once the set has more vectors than the dimension of the space, dependence is guaranteed. Each additional vector either adds a new direction (and keeps the set independent) or falls in the span of the existing vectors (and creates dependence). The matrix test must be rerun each time the set changes.
Mastery Checklist
Novice (Level 1-2):
Competent (Level 3-4):
Proficient (Level 5):
Mental Model
The Redudancy Detector
A linearly dependent vector is redundant: it is already reachable from the others. An independent set has no redundancy; each vector is needed to cover a new direction.
Think of it as a recipe for covering space. If you have vectors pointing north, east, and up, you can reach any point in $\mathbb{R}^3$ by combining them. If you add a fourth vector pointing northeast, you can still reach everything, but the northeast vector is redundant, because northeast is already covered by north and east together. The set of four is dependent because the northeast direction is in the span of the first two.
The matrix test is the precise way to detect this redundancy: row operations reveal exactly which vectors add new pivot positions (new directions) and which do not.
Connections
Looking ahead in MATH 231:
- The Invertible Matrix Theorem: a square matrix is invertible exactly when its columns are linearly independent
- Null Space, Column Space, and Basis: a basis is a linearly independent spanning set; independence is half of what makes a basis
- Dimension, Rank, and Coordinates: the number of independent columns equals the rank
Real-world connections:
- In data science, independent features carry distinct information. Dependent features (collinear predictors in regression) cause numerical instability and redundancy in the model.
- In computer graphics, a coordinate system for 3D space requires three linearly independent basis vectors. A dependent set cannot span the full space.
Source: Lay, Linear Algebra and Its Applications, Section 1.7: Linear Independence.
| Previous | Up | Next |
|---|---|---|
| Solution Sets and Free Variables | MATH231 Skills Index | Linear Transformations |
Last updated: 2026-06-16
Watch and Read
- Lynch, MATH 231 lecture playlists (YouTube)Recorded MATH 231 lectures at EWU. Use them to see each topic worked through in a full class session.