LINEAR ALGEBRA • VECTOR SPACES & SUBSPACES

Linear Independence

Discover when vectors carry truly unique information that no combination of others can replicate.

Historical Context & Motivation

Imagine you are giving someone directions. You could say "go 3 blocks east" and "go 5 blocks north." Those two instructions are genuinely different — neither one can replace the other. But what if you added a third instruction, "go 3 blocks east and 5 blocks north at the same time"? That third instruction doesn't tell you anything new; it's just a combination of the first two. In mathematics, the idea of figuring out which pieces of information are truly new and which are just repeats is called linear independence. This concept grew out of centuries of mathematical thinking about equations, geometry, and space.

1750s
Systems of Equations
Mathematicians like Leonhard Euler and Gabriel Cramer studied systems of linear equations. They noticed that some equations in a system were "redundant" — they didn't add new constraints to the solution.
1840s
Grassmann's Vector Algebra
Hermann Grassmann published work on "extensions" — what we now call vectors. He explored how to combine basic building blocks to describe higher-dimensional spaces.
1888
Peano's Axioms for Vector Spaces
Giuseppe Peano gave the first formal definition of a vector space. This created a precise setting in which linear independence could be rigorously defined.
1900s–1930s
Modern Linear Algebra Takes Shape
Mathematicians unified vectors, matrices, and systems of equations into the subject we now call linear algebra. Linear independence became a cornerstone concept, essential for defining dimension, basis, and rank.

The central question that linear independence answers is simple but powerful: given a collection of vectors, does every single one contribute something genuinely new, or could some of them be built from the others? Understanding this lets us find the smallest, most efficient set of building blocks for any space.

Core Principles & Definitions

Before we dive in, let's make sure we're on the same page about a few key ideas. A vector is an object that has both a size (magnitude) and a direction. You can think of it as an arrow pointing somewhere. A linear combination of vectors means you multiply each vector by some number (called a scalar) and then add the results together. For example, if you have vectors v and w, then 3v + 2w is a linear combination of them.

1

Linear Combination

Multiply each vector by a scalar and add the results. For example, 2u − 3v + w is a linear combination of u, v, and w.
2

Linearly Independent

A set of vectors is linearly independent if the only way to combine them and get the zero vector is when every scalar equals zero. No vector in the set is "redundant."
3

Linearly Dependent

A set of vectors is linearly dependent if you can find scalars (not all zero) that combine the vectors to make the zero vector. At least one vector is a "repeat" of the others.
4

The Zero Vector Test

Set up the equation c₁v₁ + c₂v₂ + … = 0. If the only solution is c₁ = c₂ = … = 0, the set is independent.
KEY TAKEAWAY
Think of a set of vectors like a team of workers building a house. If every worker has a unique skill — one does plumbing, one does electrical, one does carpentry — the team is linearly independent. But if one "worker" just copies what two others already do combined, that worker is redundant, and the team is linearly dependent. Linear independence means every member of the set contributes something genuinely new.

Visual Explanation

The best way to understand linear independence is to see it. In two dimensions (a flat plane), two vectors are linearly independent when they point in truly different directions — they are not parallel. If they are parallel, one is just a scaled version of the other, so it's redundant. In three dimensions, three vectors are independent when they don't all lie in the same flat plane.

On the left, vectors v₁ and v₂ point in genuinely different directions — they are linearly independent. On the right, w₂ is just 1.5 times w₁ (they're parallel), so they are linearly dependent.

Notice the key visual cue: independent vectors "fan out" and cover different parts of the plane. Dependent vectors lie along the same line. In three dimensions, three dependent vectors would all sit in a single flat sheet (a plane), while three independent vectors would spread out into full 3D space.

Mathematical Framework

Now let's put the visual intuition into precise mathematical language. The formal test for linear independence comes down to one equation and one question.

DEFINITION OF LINEAR INDEPENDENCE
c₁v₁ + c₂v₂ + … + cₙvₙ = 0
The vectors v₁, v₂, …, vₙ are linearly independent if the only solution to this equation is c₁ = c₂ = … = cₙ = 0 (the trivial solution). Here, c₁, c₂, …, cₙ are scalars (just regular numbers).

If you can find values of c₁, c₂, …, cₙ where at least one of them is not zero, then the vectors are linearly dependent. That non-zero scalar tells you exactly how one vector can be written as a combination of the others.

MATRIX METHOD
A·c = 0 where A = [v₁ | v₂ | … | vₙ]
Place each vector as a column in a matrix A. Then the independence question becomes: does the system A·c = 0 have only the trivial solution c = 0? You can answer this by row reducing the matrix.
DETERMINANT TEST (SQUARE MATRICES)
det(A) ≠ 0 ⟹ vectors are linearly independent
When you have exactly as many vectors as their dimension (for example, 2 vectors in 2D, or 3 vectors in 3D), you can compute the determinant of the matrix. If it's not zero, the vectors are independent. If det(A) = 0, they are dependent.
💡 Quick Shortcut
For just two vectors in 2D, say v₁ = (a, b) and v₂ = (c, d), they are linearly independent if and only if ad − bc ≠ 0. This is the 2×2 determinant!

Common Cases & Key Patterns

There are several important patterns that help you quickly decide whether a set of vectors is independent or dependent, without always doing a full calculation. Let's organize them visually.

This flowchart shows the logical steps for checking linear independence. Start at the top and follow the branches. The two automatic "DEPENDENT" results (zero vector present, or more vectors than dimensions) are useful shortcuts that save you time.

Key Patterns to Remember

  • Zero vector rule: Any set containing the zero vector is automatically dependent because 1 × 0 + 0 × (anything) = 0.
  • Too many vectors: If you have more vectors than the number of entries in each vector (e.g., 4 vectors in 3D), they must be dependent.
  • Single nonzero vector: One vector by itself (as long as it's not the zero vector) is always independent.
  • Two vectors: Two vectors are dependent if and only if one is a scalar multiple of the other (they're parallel).

Worked Example

Let's work through a complete example. We want to determine whether the vectors v₁ = (1, 2, 3), v₂ = (4, 5, 6), and v₃ = (2, 1, 0) are linearly independent.

Are v₁ = (1,2,3), v₂ = (4,5,6), v₃ = (2,1,0) independent?
1
Step 1 — Set Up the EquationWrite the linear independence equation: c₁(1, 2, 3) + c₂(4, 5, 6) + c₃(2, 1, 0) = (0, 0, 0). This gives us three equations, one for each component.
c₁ + 4c₂ + 2c₃ = 0, 2c₁ + 5c₂ + c₃ = 0, 3c₁ + 6c₂ + 0c₃ = 0
2
Step 2 — Form the Augmented MatrixPlace each vector as a column in a matrix A. Since the right-hand side is all zeros, we can just row reduce the coefficient matrix: A = [[1, 4, 2], [2, 5, 1], [3, 6, 0]].
A = [[1, 4, 2], [2, 5, 1], [3, 6, 0]]
3
Step 3 — Row Reduce (R₂ ← R₂ − 2R₁, R₃ ← R₃ − 3R₁)Subtract 2 times Row 1 from Row 2: [2−2, 5−8, 1−4] = [0, −3, −3]. Subtract 3 times Row 1 from Row 3: [3−3, 6−12, 0−6] = [0, −6, −6].
[[1, 4, 2], [0, −3, −3], [0, −6, −6]]
4
Step 4 — Continue Reducing (R₃ ← R₃ − 2R₂)Subtract 2 times Row 2 from Row 3: [0−0, −6−(−6), −6−(−6)] = [0, 0, 0]. Row 3 becomes all zeros!
[[1, 4, 2], [0, −3, −3], [0, 0, 0]]
5
Step 5 — Interpret the ResultThere are only 2 pivots (leading entries) but 3 unknowns. That means there is a free variable, which means non-trivial solutions exist. Therefore, the vectors are linearly dependent. In fact, from Row 2 we get c₂ = −c₃, and from Row 1 we get c₁ = −4c₂ − 2c₃ = 4c₃ − 2c₃ = 2c₃. Choosing c₃ = 1 gives c₁ = 2, c₂ = −1, c₃ = 1. Check: 2(1,2,3) − 1(4,5,6) + 1(2,1,0) = (2−4+2, 4−5+1, 6−6+0) = (0,0,0). ✓
The vectors are linearly dependent. The relation is 2v₁ − v₂ + v₃ = 0.
Determinant Shortcut
Since we had 3 vectors in 3D, we could also compute det(A) = 1(5×0 − 6×1) − 4(2×0 − 3×1) + 2(2×6 − 5×3) = 1(−6) − 4(−3) + 2(−3) = −6 + 12 − 6 = 0. Since det(A) = 0, the vectors are dependent — matching our row reduction answer!

Independent vs. Dependent — Side by Side

It's easy to mix up independent and dependent. The table below puts the key differences side by side so you can see them clearly.

Comparing linearly independent and linearly dependent sets
FeatureLinearly IndependentLinearly Dependent
DefinitionOnly the trivial solution (all c's = 0) satisfies c₁v₁ + … + cₙvₙ = 0A non-trivial solution exists (at least one c ≠ 0)
Geometric meaning (2D)Vectors point in different directions (not parallel)Vectors are parallel (one is a multiple of the other)
Geometric meaning (3D)Vectors span full 3D space (not all in one plane)All vectors lie in the same plane (or line)
Matrix row reductionEvery column has a pivot; no free variablesAt least one column has no pivot; free variables exist
Determinant (square case)det(A) ≠ 0det(A) = 0
RedundancyNo vector can be written as a combination of the othersAt least one vector is a combination of the others
KEY TAKEAWAY
Linear independence is the mathematical version of asking: "Is every ingredient in this recipe actually necessary?" If you removed one vector and the remaining set could still reach all the same combinations, that removed vector was redundant. A set where every vector is essential — where removing any one of them shrinks the space you can reach — is linearly independent.

Connection to Basis & Dimension

Linear independence doesn't exist in isolation — it connects directly to two of the most important ideas in linear algebra: basis and dimension. A basis is a set of vectors that is both linearly independent and spans (reaches) the entire space. The dimension of a space is the number of vectors in any basis for that space.

How linear independence connects to larger concepts
ConceptWhat It MeansConnection to Independence
SpanThe set of all vectors you can make using linear combinations of your setDependent vectors don't increase the span — removing the redundant one doesn't shrink it
BasisA linearly independent set that spans the entire space — the smallest spanning setA basis must be independent (no redundancy) and a spanning set (reaches everything)
DimensionThe number of vectors in any basis for the spaceYou can never have more independent vectors than the dimension of the space
Rank of a MatrixThe number of pivots after row reduction; equals the number of independent columnsIf rank < number of columns, some columns (vectors) are dependent

As you continue in linear algebra, you'll see linear independence everywhere. It determines whether a system of equations has a unique solution, whether a matrix is invertible, and how to find the most efficient coordinate system for any problem. It also appears in advanced topics like eigenvalues, orthogonality, and even in applications like data compression and machine learning, where finding independent features in data is critical.

Practice Problems

PROBLEM 1CONCEPTUAL
A set of vectors contains the zero vector 0 = (0, 0, 0). Without doing any calculations, is this set linearly independent or dependent? Explain your reasoning.
PROBLEM 2BASIC CALCULATION
Determine whether the vectors v₁ = (1, 3) and v₂ = (2, 6) are linearly independent or dependent. Use the 2×2 determinant test.
PROBLEM 3INTERMEDIATE
Are the vectors v₁ = (1, 0, 2), v₂ = (0, 1, −1), and v₃ = (3, 1, 5) linearly independent? Use row reduction or the determinant.
PROBLEM 4APPLIED
A robotics team programs a robot arm to move in 3D space. The arm can move along three direction vectors: d₁ = (1, 0, 0), d₂ = (0, 1, 0), and d₃ = (0, 0, 1). Are these direction vectors linearly independent, and what does this mean for the robot's ability to reach any point?
PROBLEM 5CRITICAL THINKING
Suppose you have 4 vectors in ℝ³ (3-dimensional space). Is it possible for all 4 to be linearly independent? Explain why or why not, and connect your answer to the concept of dimension.

Summary

Linear independence is the idea that every vector in a set carries unique information that cannot be recreated by combining the others. To test it, you set up the equation c₁v₁ + c₂v₂ + … + cₙvₙ = 0 and check whether the trivial solution (all scalars equal zero) is the only solution. Practical methods include row reduction (look for a pivot in every column) and the determinant test (det ≠ 0 means independent). Quick shortcuts include knowing that any set containing the zero vector is automatically dependent, and more vectors than dimensions always means dependence.

Linear independence is the foundation for defining a basis — the most efficient set of building blocks for a vector space — and for understanding dimension, which counts how many independent directions a space has. Mastering this concept unlocks the ability to analyze systems of equations, matrix properties, and the geometry of higher-dimensional spaces.

Varsity Tutors • Linear Algebra • Linear Independence