Suppose you are given three vectors in $\mathbb{R}^3$ and asked: does the third carry any information that the first two do not already capture? Or could any vector in the plane spanned by the first two be built from the first two alone? These are not questions about geometry in isolation — they are questions about *redundancy*. When you write down a system of equations, solve a differential equation, compress data, or decompose a signal, you are always asking, implicitly, whether the pieces you have chosen are independent of one another. The concept of linear independence is the precise tool that answers this question.

Linear independence is deceptively simple to state, but it has profound consequences at every level of mathematics. It governs when a system of equations has a unique solution, when a set of functions forms a usable basis for a function space, and when the columns of a matrix give you genuinely new directions. Understanding it carefully — not just its definition but its failures, its geometry, and its relationship to spanning — is the foundation of everything in linear algebra.

[example: Three Vectors in the Plane] Consider the vectors \begin{align*} v_1 &= (1, 0, 0), \quad v_2 = (0, 1, 0), \quad v_3 = (2, -1, 0) \end{align*} in $\mathbb{R}^3$. The third vector satisfies $v_3 = 2v_1 - v_2$. This means that if you are told the values of $v_1$ and $v_2$, the vector $v_3$ gives you no new direction — it lies entirely in the span of the first two. Any linear combination $av_1 + bv_2 + cv_3$ can be rewritten as \begin{align*} av_1 + bv_2 + c(2v_1 - v_2) &= (a + 2c)v_1 + (b - c)v_2, \end{align*} so the span of all three is exactly the same as the span of the first two. The three vectors together are *redundant*. This redundancy is captured precisely by the relation $2v_1 - v_2 - v_3 = 0$: a nontrivial combination of the vectors that yields the zero vector. [/example]

This example reveals the key idea. Whenever one vector can be expressed as a linear combination of the others, you can write down a relation $c_1 v_1 + c_2 v_2 + \cdots + c_k v_k = 0$ where not all the scalars $c_i$ are zero. Such a relation is called a *linear dependence relation*. Linear independence is exactly the absence of any such relation.

## Definition

Before we give the formal definition, it is worth pausing to ask what we want to avoid. In the example above, the failure of independence manifested as a nontrivial combination equaling zero. If we could only produce such a combination when every coefficient is zero, there would be no redundancy among the vectors. This motivates the following definition.

[definition: Linear Independence] Let $V$ be a vector space over a field $F$, and let $v_1, v_2, \ldots, v_k \in V$. The list $(v_1, \ldots, v_k)$ is **linearly independent** if the only solution to \begin{align*} c_1 v_1 + c_2 v_2 + \cdots + c_k v_k &= 0 \end{align*} with $c_1, \ldots, c_k \in F$ is $c_1 = c_2 = \cdots = c_k = 0$. The list is **linearly dependent** if there exist scalars $c_1, \ldots, c_k \in F$, not all zero, satisfying this equation. [/definition]

The definition applies to finite lists, but it extends naturally to infinite sets: an infinite set $S \subset V$ is linearly independent if every *finite* subset of $S$ is linearly independent.

[remark: Lists versus Sets] We write "list" rather than "set" to emphasize that order and repetition matter. A set $\{v, v\}$ collapses to $\{v\}$, but the list $(v, v)$ contains $v$ twice, and the relation $1 \cdot v + (-1) \cdot v = 0$ immediately shows it is dependent. Any list containing a repeated vector is linearly dependent. [/remark]

The zero vector behaves in an extreme way. If any $v_i = 0$, then the list is immediately linearly dependent: setting $c_i = 1$ and all other coefficients to zero gives $0 \cdot v_1 + \cdots + 1 \cdot 0 + \cdots + 0 \cdot v_k = 0$, a nontrivial relation. A linearly independent list can never contain the zero vector.

[example: Independence in $\mathbb{R}^n$] The standard basis vectors $e_1 = (1, 0, \ldots, 0)$, $e_2 = (0, 1, 0, \ldots, 0)$, ..., $e_n = (0, \ldots, 0, 1)$ are linearly independent in $\mathbb{R}^n$. To see this, suppose $c_1 e_1 + c_2 e_2 + \cdots + c_n e_n = 0$. The $i$-th component of the left side is $c_i$, so comparing components forces $c_i = 0$ for all $i$. This argument works because the vectors have a very sparse structure: each one has a nonzero entry in exactly one coordinate. Now consider the polynomial functions $1, x, x^2, \ldots, x^n$ as vectors in the real vector space $C^\infty(\mathbb{R}; \mathbb{R})$ of smooth functions. If $c_0 \cdot 1 + c_1 x + c_2 x^2 + \cdots + c_n x^n = 0$ as functions — meaning the polynomial is identically zero on $\mathbb{R}$ — then all coefficients must be zero. (A nonzero polynomial of degree $n$ has at most $n$ roots, so a polynomial vanishing everywhere must be the zero polynomial.) Therefore $1, x, x^2, \ldots, x^n$ are linearly independent in $C^\infty(\mathbb{R}; \mathbb{R})$. [/example]

The definition says nothing about geometry explicitly, but geometry is present. In $\mathbb{R}^2$, two vectors are linearly dependent if and only if they are parallel — they point in the same direction (or opposite directions). In $\mathbb{R}^3$, three vectors are linearly dependent if and only if they all lie in a common plane through the origin. This geometric picture is a useful heuristic, but the algebraic definition is what works in all vector spaces, including infinite-dimensional ones.

[illustration:independent-vs-dependent-vectors]

## The Geometry of Dependence

Why does linear dependence capture exactly the notion of redundancy? The answer lies in the relationship between dependence and spanning. If a list is linearly dependent, you can always remove a vector from it without losing any span.

To see this, suppose $c_1 v_1 + \cdots + c_k v_k = 0$ with some $c_j \neq 0$. Then

\begin{align*} v_j &= -\frac{c_1}{c_j} v_1 - \cdots - \frac{c_{j-1}}{c_j} v_{j-1} - \frac{c_{j+1}}{c_j} v_{j+1} - \cdots - \frac{c_k}{c_j} v_k. \end{align*}

So $v_j$ is a linear combination of the remaining vectors. Any vector in the span of $\{v_1, \ldots, v_k\}$ can therefore be expressed using $\{v_1, \ldots, \hat{v}_j, \ldots, v_k\}$ instead, where the hat denotes omission. The span does not shrink when we remove $v_j$.

This argument gives us the following useful characterization, which we state as a theorem.

[quotetheorem:3260]