Linear Independence: Definition & Tests

Definition

A set of vectors

\{\mathbf{v}_1, \mathbf{v}_2, \dots, \mathbf{v}_k\}

in a vector space

V

is linearly independent when the only linear combination producing the zero vector is the trivial one:

Linear Independence Equation

\{\mathbf{v}_1, \ldots, \mathbf{v}_k\} \text{ is independent} \iff \bigl(c_1\mathbf{v}_1 + \cdots + c_k\mathbf{v}_k = \mathbf{0} \Rightarrow c_1 = \cdots = c_k = 0\bigr)

Learn more about this formula: Linear Independence Equation →

Browse all linear algebra formulas →

If a nontrivial solution exists — any assignment of scalars, not all zero, that produces

\mathbf{0}

— the set is linearly dependent.

Dependence means at least one vector in the set can be expressed as a linear combination of the others. If

c_j \neq 0

in a nontrivial relation, then dividing by

c_j

isolates

\mathbf{v}_j

:

\mathbf{v}_j = -\frac{c_1}{c_j}\mathbf{v}_1 - \cdots - \frac{c_{j-1}}{c_j}\mathbf{v}_{j-1} - \frac{c_{j+1}}{c_j}\mathbf{v}_{j+1} - \cdots - \frac{c_k}{c_j}\mathbf{v}_k

A single nonzero vector is always independent — the equation

c\mathbf{v} = \mathbf{0}

with

\mathbf{v} \neq \mathbf{0}

forces

c = 0

. The zero vector, by contrast, is always dependent:

1 \cdot \mathbf{0} = \mathbf{0}

is a nontrivial relation. Any set containing the zero vector is therefore dependent.

Linear Independence Notation

Notation

Linear Independence Notation

A property defined by an arrow rather than a formula — what is written is not an equation to solve but an implication that must hold — plus a named witness for when it fails, and a determinant wearing a different letter because its entries are functions. All catalogued among the linear algebra symbols.

\mathbf{0}

and the bold-vector convention come from vector notation; set braces and the subscripted list from span notation;

A\mathbf{x} = \mathbf{0}

and the trivial solution from homogeneous system notation;

\det

from determinant notation.

c_1\mathbf{v}_1 + \cdots + c_k\mathbf{v}_k = \mathbf{0} \;\Rightarrow\; c_1 = \cdots = c_k = 0

if a combination vanishes, then every coefficient was zero

The arrow is the definition. What is written is not an equation to be solved but a conditional that must hold for all coefficients: whenever the combination collapses to

\mathbf{0}

, the only way it happened was trivially. Definition above states it in exactly this shape.

CasesNote which side is bold: the left

\mathbf{0}

is the zero vector, the right zeros are scalars — the same equation carries both, and the bold-zero convention is what keeps them apart.

Do not confuseReading it as a system to solve.

c_1\mathbf{v}_1 + \cdots = \mathbf{0}

always has the trivial solution, so finding it proves nothing; independence is the claim that no other solution exists, which is why the statement needs an implication rather than an equation.

c_1\mathbf{v}_1 + \cdots + c_k\mathbf{v}_k = \mathbf{0}

with some

c_i \neq 0

a dependence relation — an explicit witness to dependence

Dependence gets a named object rather than a mere negation: a dependence relation is one specific combination with at least one nonzero coefficient, and exhibiting it settles the question — Dependence Relations below works with them directly.

CasesAny single nonzero coefficient lets that vector be solved for in terms of the others, which is the sense in which one of them is redundant; a set can carry many different dependence relations, and the notation names an individual witness, not the whole failure.

Do not confuse"Dependent" as a claim about every vector. A dependent set need not have every vector redundant —

\{\mathbf{v}, \mathbf{v}, \mathbf{w}\}

is dependent while

\mathbf{w}

may be unrelated to the rest; the relation identifies which vectors participate.

W(f_1, \ldots, f_n)(x)

the Wronskian of the functions, evaluated at x

A determinant with its own letter because its entries are functions and their derivatives, so the value varies with

x

— hence the second argument list. The Wronskian Test for Functions below builds it; it is the independence test transplanted from vectors to function spaces.

CasesThe test is one-directional in a way the notation hides:

W \neq 0

at a single point proves independence, while

W \equiv 0

proves nothing in general — a genuinely one-way implication, unlike the determinant test for vectors in

\mathbb{R}^n

, which decides both ways.

Do not confuseAn ordinary determinant of numbers.

W

is a function of

x

, so asking whether "the Wronskian is zero" needs a point or an interval attached before it means anything.

All linear algebra symbols →↑ Vector Spaces

Geometric Interpretation in Rⁿ

In

\mathbb{R}^2

and

\mathbb{R}^3

, independence has clean geometric meaning.

Two vectors in

\mathbb{R}^2

are dependent if and only if they are parallel — one is a scalar multiple of the other. They point along the same line through the origin, so neither adds a direction that the other does not already cover. Two non-parallel vectors are independent and span all of

\mathbb{R}^2

.

Three vectors in

\mathbb{R}^3

are dependent if and only if they are coplanar — all three lie in a single plane through the origin. The third vector can be written as a combination of the first two, so it provides no new reach. Three non-coplanar vectors are independent and span all of

\mathbb{R}^3

.

In

\mathbb{R}^n

, at most

n

vectors can be independent. A set of

n + 1

or more vectors in

\mathbb{R}^n

is automatically dependent, regardless of what the vectors are. This is because

\mathbb{R}^n

has dimension

n

, and no independent set can exceed the dimension.

Independent, then very nearly dependent

The lower pair still spans the plane, but only barely: the arrows have swung close together and the region they reach is stretched thin. Independence is not a yes-or-no fact about a picture, it is a fact about whether any direction is genuinely new, and the near case shows how little room can be left. Push the arrows together until the span collapses on the span and independence explorer.

The algebraic tests in the next two sections are simply ways of detecting this same collapse without having to draw it.

Testing Independence: The Homogeneous System

For vectors in

\mathbb{R}^m

, independence can be tested by row reduction. Arrange

\mathbf{v}_1, \dots, \mathbf{v}_k

as columns of an

m \times k

matrix

A

. The independence equation

c_1\mathbf{v}_1 + \cdots + c_k\mathbf{v}_k = \mathbf{0}

is equivalent to the homogeneous system

A\mathbf{c} = \mathbf{0}

:

Linear Independence Matrix Test

\{\mathbf{v}_1, \ldots, \mathbf{v}_k\} \subset \mathbb{R}^m \text{ is independent} \iff A\mathbf{c} = \mathbf{0} \text{ has only the trivial solution}

Learn more about this formula: Linear Independence Matrix Test →

Browse all linear algebra formulas →

Row reduce

A

. The vectors are independent if and only if every column contains a pivot — that is, there are no free variables. If any column lacks a pivot, the corresponding variable is free, a nontrivial solution exists, and the set is dependent.

Worked Example: Independent Set

Test whether

\mathbf{v}_1 = (1, 2, -1)

,

\mathbf{v}_2 = (0, 1, 3)

,

\mathbf{v}_3 = (2, 0, 1)

are independent. Form the matrix and reduce:

A = \begin{pmatrix} 1 & 0 & 2 \\ 2 & 1 & 0 \\ -1 & 3 & 1 \end{pmatrix} \xrightarrow{R_2 - 2R_1,\; R_3 + R_1} \begin{pmatrix} 1 & 0 & 2 \\ 0 & 1 & -4 \\ 0 & 3 & 3 \end{pmatrix} \xrightarrow{R_3 - 3R_2} \begin{pmatrix} 1 & 0 & 2 \\ 0 & 1 & -4 \\ 0 & 0 & 15 \end{pmatrix}

Three pivots in three columns — no free variables. The set is independent.

Worked Example: Dependent Set

Test

\mathbf{v}_1 = (1, 0, 2)

,

\mathbf{v}_2 = (3, 1, 4)

,

\mathbf{v}_3 = (5, 2, 6)

,

\mathbf{v}_4 = (0, 1, -2)

in

\mathbb{R}^3

. The matrix is

3 \times 4

— four columns but only three rows, so at most three pivots. At least one column must be free. The set is dependent without any computation, simply because four vectors in

\mathbb{R}^3

cannot be independent.

A dependence relation found among the columns

The elimination has produced a free column, and with it a set of weights, not all zero, that combine the vectors to give zero. That is precisely the definition failing: independence asks that the only such combination be the trivial one. Feed in your own vectors and see whether a relation appears on the span membership tester.

A non-trivial solution is therefore not just evidence of dependence — it is the dependence relation itself, written out.

Testing Independence: The Determinant

When the number of vectors equals the dimension of the space, the independence question reduces to a single number. Arrange

n

vectors in

\mathbb{R}^n

as columns of an

n \times n

matrix

A

. The set is independent precisely when this matrix has nonzero determinant:

Linear Independence Determinant Test

\{\mathbf{v}_1, \ldots, \mathbf{v}_n\} \subset \mathbb{R}^n \text{ is independent} \iff \det[\mathbf{v}_1\ \cdots\ \mathbf{v}_n] \neq 0

Learn more about this formula: Linear Independence Determinant Test →

Browse all linear algebra formulas →

This follows from the invertibility equivalence:

A

is invertible if and only if its columns are independent, and

A

is invertible if and only if

\det(A) \neq 0

.

Worked Example

Test whether

(1, 3)

and

(2, 5)

are independent in

\mathbb{R}^2

:

\det\begin{pmatrix} 1 & 2 \\ 3 & 5 \end{pmatrix} = 5 - 6 = -1 \neq 0

The vectors are independent.

The determinant test applies only to the square case — exactly

n

vectors in

\mathbb{R}^n

. For fewer than

n

vectors, or for vectors in an abstract vector space, the row-reduction approach or the definition itself must be used.

Properties of Independent Sets

Several structural facts constrain how independence behaves under set operations.

Every subset of an independent set is independent. If no nontrivial combination of

\{\mathbf{v}_1, \dots, \mathbf{v}_k\}

gives

\mathbf{0}

, then no nontrivial combination of a subset can either — fewer vectors means fewer coefficients, all of which must still be zero.

Adding a vector

\mathbf{w}

to an independent set

\{\mathbf{v}_1, \dots, \mathbf{v}_k\}

preserves independence if and only if

\mathbf{w} \notin \text{Span}\{\mathbf{v}_1, \dots, \mathbf{v}_k\}

. If

\mathbf{w}

is already in the span, it can be written as a combination of the existing vectors, creating a dependence relation. If it is outside the span, no such relation exists.

In an

n

-dimensional space, any independent set has at most

n

elements. An independent set with exactly

n

elements is automatically a basis — the spanning condition comes for free once the count reaches the dimension. An independent set with fewer than

n

elements can always be extended to a basis by adding more vectors.

Removing a vector from a dependent set may or may not restore independence. It depends on which vector is removed and which vectors participate in the dependence relation.

Download

PNGRaster · 2×PDFPrint quality

Vector spaces · independence

What operations do to an independent set

Independence is fragile in one direction and robust in the other: removing vectors can never break it, adding them usually does. The two entries that read "may or may not" are the ones worth reading closely.

06operations

Unconditional1

i

Any subset§ 5

S

independent

\Rightarrow

every

T \subseteq S

independent

Removing vectors can never create a dependence.

Unconditional

Requires: any subset, including the empty one

Removing vectors can never create a dependence. A nontrivial combination among the survivors would have been a nontrivial combination in the original set, with zero coefficients on the removed vectors — so the original was never independent to begin with.

Conditional3

ii

Adding a vector outside the span§ 5

\mathbf{v} \notin \operatorname{span}(S) \Rightarrow S \cup \{\mathbf{v}\}

independent

A genuinely new direction extends the set safely.

Conditional

Holds when: $\mathbf{v}$ lies outside $\operatorname{span}(S)$

A genuinely new direction extends the set safely. This is the step that builds a basis one vector at a time — keep adding from outside the current span until the span is everything.

v

Reaching the dimension§ 5

|S| = n

and

S

independent

\Rightarrow S

is a basis

Spanning comes free at the maximum independent size — no separate check needed.

Conditional

Holds when: the space has dimension exactly $n$

Spanning comes free at the maximum independent size — no separate check needed. The converse shortcut also holds: $n$ vectors that span are automatically independent. Either property plus the right count gives the other.

vi

Removing from a dependent set§ 6dependence may or may not be repaired

Removing a vector that appears in the only relation repairs the set; removing one that does not…

Depends which

Holds when: the removed vector participates in every dependence relation
Fails when: other relations survive without it
Common error: assuming any removal restores independence

Removing a vector that appears in the only relation repairs the set; removing one that does not leaves the relation intact. Which vectors are candidates is read off the dependence relation itself, not guessed.

Both outcomesS = {(1,0), (2,0), (0,1)} — dependent, one relation
remove (2,0) → independent
remove (0,1) → still dependent: (2,0) = 2(1,0)

Fails or undefined2

iii

Adding a vector inside the span§ 5

\mathbf{v} \in \operatorname{span}(S) \Rightarrow S \cup \{\mathbf{v}\}

dependent

The new vector is already expressible, and writing it as a combination and moving everything to…

Fails

Fails when: $\mathbf{v}$ is any combination of $S$

The new vector is already expressible, and writing it as a combination and moving everything to one side gives a nontrivial relation immediately. Note this includes $\mathbf{v} = \mathbf{0}$ , which lies in every span — which is why no independent set can contain the zero vector.

iv

Exceeding the dimension§ 5

|S| > n

in an

n

-dimensional space

\Rightarrow

dependent

No counting or computation required — the conclusion follows from the size alone.

Fails

Fails when: more vectors than dimensions

No counting or computation required — the conclusion follows from the size alone. This is the fastest of all the independence tests, and the reason a homogeneous system with more unknowns than equations always has a nontrivial solution.

Unconditional

Conditional

Fails or undefined

Any subset§ 5Unconditional

S

independent

\Rightarrow

every

T \subseteq S

independent

Requires: any subset, including the empty one

Removing vectors can never create a dependence. A nontrivial combination among the survivors would have been a nontrivial combination in the original set, with zero coefficients on the removed vectors — so the original was never independent to begin with.

Read the full section

Adding a vector outside the span§ 5Conditional

\mathbf{v} \notin \operatorname{span}(S) \Rightarrow S \cup \{\mathbf{v}\}

independent

Holds when: $\mathbf{v}$ lies outside $\operatorname{span}(S)$

A genuinely new direction extends the set safely. This is the step that builds a basis one vector at a time — keep adding from outside the current span until the span is everything.

Read the full section

Adding a vector inside the span§ 5Fails

\mathbf{v} \in \operatorname{span}(S) \Rightarrow S \cup \{\mathbf{v}\}

dependent

Fails when: $\mathbf{v}$ is any combination of $S$

The new vector is already expressible, and writing it as a combination and moving everything to one side gives a nontrivial relation immediately. Note this includes

\mathbf{v} = \mathbf{0}

, which lies in every span — which is why no independent set can contain the zero vector.

Read the full section

Exceeding the dimension§ 5Fails

|S| > n

in an

n

-dimensional space

\Rightarrow

dependent

Fails when: more vectors than dimensions

No counting or computation required — the conclusion follows from the size alone. This is the fastest of all the independence tests, and the reason a homogeneous system with more unknowns than equations always has a nontrivial solution.

Read the full section

Reaching the dimension§ 5Conditional

|S| = n

and

S

independent

\Rightarrow S

is a basis

Holds when: the space has dimension exactly $n$

Spanning comes free at the maximum independent size — no separate check needed. The converse shortcut also holds:

n

vectors that span are automatically independent. Either property plus the right count gives the other.

Read the full section

Removing from a dependent set§ 6Depends which

dependence may or may not be repaired

Holds when: the removed vector participates in every dependence relation
Fails when: other relations survive without it
Common error: assuming any removal restores independence

Removing a vector that appears in the only relation repairs the set; removing one that does not leaves the relation intact. Which vectors are candidates is read off the dependence relation itself, not guessed.

Both outcomesS = {(1,0), (2,0), (0,1)} — dependent, one relation
remove (2,0) → independent
remove (0,1) → still dependent: (2,0) = 2(1,0)

Read the full section

The asymmetry has a single source. Independence is a statement that no nontrivial combination gives

\mathbf{0}

, so a smaller set has fewer combinations to worry about and cannot acquire a relation it did not have. Adding a vector adds combinations, and only one of them needs to vanish for the property to be lost.

What operations do to an independent set·/linear-algebra/vector-spaces/linear-independenceLearn Math Class

Dependence Relations

When a set is dependent, the nontrivial solution

c_1\mathbf{v}_1 + \cdots + c_k\mathbf{v}_k = \mathbf{0}

is called a dependence relation. It identifies which vectors participate in the redundancy: those with nonzero coefficients.

A common misconception is that dependence means every vector in the set is a combination of the others. This is false. Consider

\{(1, 0), (0, 1), (2, 3)\}

in

\mathbb{R}^2

. The set is dependent because

(2, 3) = 2(1, 0) + 3(0, 1)

, but neither

(1, 0)

nor

(0, 1)

is a combination of the other two alone — removing either of the first two would make the remaining pair independent.

The dependence relation

2(1, 0) + 3(0, 1) + (-1)(2, 3) = (0, 0)

has all three coefficients nonzero, so all three vectors participate. But the vector that can be "removed" without shrinking the span is

(2, 3)

, because it is the one that lies in the span of the other two — not because it has the largest coefficient.

When the null space of the column matrix has dimension greater than

1

, there are multiple linearly independent dependence relations, and different vectors can be expressed in terms of different subsets. The pivot/free column structure from row reduction clarifies which vectors are redundant.

The Wronskian Test for Functions

In function spaces, the column-matrix test does not apply directly because the vectors are functions, not finite tuples. The Wronskian provides an alternative.

Given

n

functions

f_1, \dots, f_n

, each differentiable at least

n - 1

times, the Wronskian is the determinant of the matrix whose rows are successive derivatives:

Wronskian Test

W(f_1, \ldots, f_n)(x) = \det\begin{pmatrix} f_1(x) & \cdots & f_n(x) \\ f_1'(x) & \cdots & f_n'(x) \\ \vdots & \ddots & \vdots \\ f_1^{(n-1)}(x) & \cdots & f_n^{(n-1)}(x) \end{pmatrix}

Learn more about this formula: Wronskian Test →

Browse all linear algebra formulas →

If

W(f_1, \dots, f_n)(x_0) \neq 0

at any single point

x_0

, the functions are linearly independent.

The converse requires caution. A Wronskian that vanishes identically does not always imply dependence unless the functions are known to be solutions of a single linear ordinary differential equation with continuous coefficients. Without that structural guarantee, counterexamples exist where the Wronskian is zero everywhere yet the functions are independent.

Independence in Abstract Vector Spaces

The definition of independence — the only combination giving

\mathbf{0}

is the trivial one — applies in any vector space, not just

\mathbb{R}^n

.

In the polynomial space

\mathcal{P}_n

, the set

\{1, x, x^2, \dots, x^n\}

is independent. The equation

c_0 + c_1 x + c_2 x^2 + \cdots + c_n x^n = 0

for all

x

forces every coefficient to be zero, because a nonzero polynomial of degree at most

n

can have at most

n

roots, but this equation must hold for every real number. Since there are

n + 1

vectors and

\dim(\mathcal{P}_n) = n + 1

, this independent set is a basis.

In the matrix space

\mathbb{R}^{2 \times 2}

, the four matrices

E_{11} = \begin{pmatrix} 1 & 0 \\ 0 & 0 \end{pmatrix}, \quad E_{12} = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix}, \quad E_{21} = \begin{pmatrix} 0 & 0 \\ 1 & 0 \end{pmatrix}, \quad E_{22} = \begin{pmatrix} 0 & 0 \\ 0 & 1 \end{pmatrix}

are independent. The equation

c_1 E_{11} + c_2 E_{12} + c_3 E_{21} + c_4 E_{22} = O

gives

\begin{pmatrix} c_1 & c_2 \\ c_3 & c_4 \end{pmatrix} = \begin{pmatrix} 0 & 0 \\ 0 & 0 \end{pmatrix}

, which forces all four scalars to zero.

In abstract spaces where vectors are not columns of numbers, the row-reduction shortcut is unavailable. Verification returns to the definition: write down the combination equal to

\mathbf{0}

and show that all coefficients must vanish.

Vector space	Independent set	Why independent	Note
𝒫ₙ (polynomials of degree ≤ n)	{1, x, x², …, xⁿ}	c₀ + c₁x + ⋯ + cₙxⁿ = 0 must hold for every real x; a nonzero polynomial of degree ≤ n has at most n roots, so every coefficient must vanish	n + 1 vectors, exactly dim(𝒫ₙ) — standard basis
ℝ²ˣ² (2×2 real matrices)	{E₁₁, E₁₂, E₂₁, E₂₂}	c₁E₁₁ + c₂E₁₂ + c₃E₂₁ + c₄E₂₂ = O reads entry-by-entry as c₁ = c₂ = c₃ = c₄ = 0	4 vectors, exactly dim(ℝ²ˣ²) — standard basis

Summary: Tests and Shortcuts for Independence

Determining independence rarely requires the full computation. Several no-computation shortcuts settle the question immediately for common configurations — a set containing

\mathbf{0}

, a single nonzero vector, or more than

n

vectors in

\mathbb{R}^n

. When inspection alone is not enough, three distinct tests cover the remaining cases: row reduction for general vectors in

\mathbb{R}^m

, the determinant for the square case, and the Wronskian for functions; abstract spaces fall back on the definition itself. The table below collects the full toolkit, grouped from inspection-only shortcuts down to computational tests, and notes which method applies to which context.

Context	Method	What to check	Conclusion
Set contains 0	inspection (no computation)	is the zero vector in the set?	dependent — 1·0 = 0 is a nontrivial relation
Single nonzero vector	inspection (no computation)	is v ≠ 0?	independent — cv = 0 forces c = 0
More than n vectors in ℝⁿ	inspection (no computation)	count exceeds dimension?	dependent — no independent set in ℝⁿ exceeds n
k vectors in ℝᵐ (general)	row-reduce the m × k matrix A = [v₁ ⋯ vₖ]	does every column contain a pivot?	independent iff yes (no free variables in Ac = 0)
n vectors in ℝⁿ (square case)	determinant of the n × n matrix A	is det A ≠ 0?	independent iff yes (equivalent to A invertible)
n differentiable functions	Wronskian determinant W(x)	is W(x₀) ≠ 0 at some single point x₀?	if yes, independent; if W ≡ 0, no conclusion in general (only when the functions solve a common linear ODE)
Vectors in an abstract space	apply the definition directly	does c₁v₁ + ⋯ + cₖvₖ = 0 force every cᵢ = 0?	independent iff yes; use the algebraic structure of the space (polynomial coefficients, matrix entries, etc.) to reduce to scalar equations

Linear Independence FAQ

Why is independence stated as an implication rather than an equation?

+

Because the equation alone proves nothing. Setting every coefficient to zero always satisfies

c_1\mathbf{v}_1 + \cdots + c_k\mathbf{v}_k = \mathbf{0}

, whatever the vectors are, so finding that solution is no evidence. Independence is the stronger claim that no other solution exists, and only an implication can say that.Read more →

Does a dependent set mean every vector in it is redundant?

+

No. Dependence is a property of the set, and it only requires that some non-trivial relation exists. In

\{\mathbf{v}, \mathbf{v}, \mathbf{w}\}

the repetition creates dependence while

\mathbf{w}

may be entirely unrelated to the others. A dependence relation identifies which vectors take part, and the rest are untouched by it.Read more →

Is the Wronskian a number or a function?

+

A function of

x

, which is easy to miss because it is written as a determinant. Asking whether the Wronskian is zero therefore has no meaning until you attach a point or an interval. That differs from the determinant test for vectors in

\mathbb{R}^n

, where the entries are constants and the answer is a single number.Read more →

Linear Independence

When No Vector Is Redundant

Definition

Linear Independence Notation

Linear Independence Notation

Geometric Interpretation in Rⁿ

Testing Independence: The Homogeneous System

Worked Example: Independent Set

Worked Example: Dependent Set

Testing Independence: The Determinant

Worked Example

Properties of Independent Sets

What operations do to an independent set

Dependence Relations

The Wronskian Test for Functions

Independence in Abstract Vector Spaces

Summary: Tests and Shortcuts for Independence

Linear Independence FAQ

Why is independence stated as an implication rather than an equation?

Does a dependent set mean every vector in it is redundant?

Is the Wronskian a number or a function?