Linear Independence and Basis

⚡ Key Takeaways

Linear independence means no vector in a set can be written as a combination of the others; a basis is a linearly independent set that spans the whole space. Together they pin down a minimal, complete coordinate system: every vector has exactly one expression in terms of basis vectors. This underlies all of linear algebra — dimension, coordinates, rank, and matrix representations. Formalized in the late 19th–early 20th century (Grassmann, Peano, Steinitz).

💡 The Core Insight

Independence and spanning are opposing forces. Adding vectors helps you span more but threatens independence; removing vectors preserves independence but threatens spanning. A basis is the exact equilibrium — the unique sweet spot where you have just enough vectors to reach everything, with no redundancy. Because of this, basis coordinates are unique, turning abstract vectors into concrete tuples of numbers.

DefinitionLinear Combination and Span

Let $V$ be a vector space over a field $\mathbb{F}$ (typically $\mathbb{R}$ or $\mathbb{C}$ ). Given vectors $v_1,\dots,v_n \in V$ , a linear combination is any vector of the form

1

\quad c_1 v_1 + c_2 v_2 + \cdots + c_n v_n, \qquad c_i \in \mathbb{F}.

Derivation hint: this is the closure of $V$ under the two vector-space operations (addition and scalar multiplication) applied finitely to the given vectors. The span is the set of all such combinations:

2

\quad \operatorname{span}\{v_1,\dots,v_n\} = \left\{ \sum_{i=1}^{n} c_i v_i : c_i \in \mathbb{F} \right\}.

Derivation hint: collect every reachable vector; closure under $+$ and scalar $\cdot$ makes the span a subspace of $V$ .

DefinitionLinear Independence

The set $\{v_1,\dots,v_n\}$ is linearly independent if

3

\quad c_1 v_1 + c_2 v_2 + \cdots + c_n v_n = 0 \;\Longrightarrow\; c_1 = c_2 = \cdots = c_n = 0.

Derivation hint: the zero vector must have only the trivial representation; any nontrivial solution exhibits dependence. If a nontrivial solution exists, the set is linearly dependent, and at least one vector is a combination of the others:

4

\quad v_k = -\frac{1}{c_k}\sum_{i \neq k} c_i v_i \quad (\text{for any } c_k \neq 0).

Derivation hint: isolate a term whose coefficient is nonzero in the dependence relation $\sum c_i v_i = 0$ and divide.

DefinitionBasis and Dimension

A set $B = \{b_1,\dots,b_n\} \subseteq V$ is a basis of $V$ if it is linearly independent and $\operatorname{span}(B) = V$ . Every $v \in V$ then has a unique coordinate representation:

5

\quad v = \sum_{i=1}^{n} \alpha_i b_i, \qquad [v]_B = (\alpha_1,\dots,\alpha_n) \in \mathbb{F}^n.

Derivation hint: spanning gives existence of the $\alpha_i$ ; independence gives uniqueness (subtract two representations and apply [3]). The dimension $\dim V = n$ is the common cardinality of every basis of $V$ .

TheoremDimension is Well-Defined (Steinitz Exchange)

If $V$ has a finite spanning set, then every basis of $V$ has the same number of elements. More sharply, if $\{u_1,\dots,u_m\}$ is linearly independent and $\{w_1,\dots,w_n\}$ spans $V$ , then $m \le n$ .

ProofSteinitz Exchange Lemma

We show any independent set is no larger than any spanning set, by swapping vectors one at a time.

Step 1. Let $U = \{u_1,\dots,u_m\}$ be independent and $W = \{w_1,\dots,w_n\}$ span $V$ . Since $W$ spans, write

6

\quad u_1 = \sum_{j=1}^{n} a_j w_j.

Derivation hint: $u_1 \in V = \operatorname{span}(W)$ , so coefficients $a_j$ exist by definition of span.

Step 2. Not all $a_j$ are zero (else $u_1 = 0$ , contradicting independence). Reindex so $a_1 \neq 0$ ; then solve [6] for $w_1$ :

7

\quad w_1 = \frac{1}{a_1}\left(u_1 - \sum_{j=2}^{n} a_j w_j\right).

Derivation hint: divide [6] by $a_1\neq 0$ and isolate $w_1$ ; this shows $w_1 \in \operatorname{span}(u_1, w_2,\dots,w_n)$ .

Step 3. Replace $w_1$ by $u_1$ : the set $\{u_1, w_2,\dots,w_n\}$ still spans $V$ , because anything expressible using $w_1$ can be re-expressed via [7].

Step 4. Repeat: express $u_2$ in the new spanning set; its coefficient on some remaining $w_j$ must be nonzero (otherwise $u_2$ would depend on $u_1$ alone, contradicting independence of $U$ ). Swap that $w_j$ for $u_2$ . Iterating, each $u_i$ replaces a distinct $w_j$ .

Step 5. If $m > n$ we would run out of $w$ 's to replace before exhausting the $u$ 's, forcing some $u_i$ to lie in $\operatorname{span}(u_1,\dots,u_{i-1})$ — contradicting independence. Hence $m \le n$ . $\blacksquare$

Corollary. Two bases $B_1, B_2$ are each independent and spanning, so $|B_1| \le |B_2|$ and $|B_2| \le |B_1|$ , giving $|B_1| = |B_2|$ .

∎

mathematician · Giuseppe Peano | 1858–1932

Peano gave, in his 1888 Calcolo geometrico secondo l'Ausdehnungslehre di H. Grassmann, the first fully axiomatic definition of a vector space over $\mathbb{R}$ — including linear independence and dimension in essentially modern form, decades ahead of his contemporaries. He recast Hermann Grassmann's dense Ausdehnungslehre (1844) into clean axioms: closure, associativity, distributivity, and the existence of a basis. Peano's clarity was largely ignored for forty years until the abstract approach was revived by Banach, Weyl, and the development of functional analysis in the 1920s–30s.

🧠 Intuition

Think of a basis as a complete, non-redundant set of directions in which you are allowed to walk.

Independence = no wasted directions. If one arrow points where you can already get by combining others, it's redundant — remove it.
Spanning = you can reach everywhere. If some point in space is unreachable, you're missing a direction — add one.
Basis = exactly the right arrows. Not one too many, not one too few.

A useful mental test for dependence in $\mathbb{R}^n$ : vectors are dependent iff they all "fit inside" a lower-dimensional flat through the origin. Two vectors are dependent iff collinear; three are dependent iff coplanar. The dimension counts how many independent directions you genuinely have — and coordinates are just the recipe (how much of each basis direction) to build any given vector.

Figure

Two independent vectors span the plane; a third must be dependent

ExampleTesting Independence in

\mathbb{R}^3

Given: $v_1=(1,2,1)$ , $v_2=(2,1,0)$ , $v_3=(1,-1,-1)$ . Are they independent? Do they form a basis of $\mathbb{R}^3$ ?

Step 1. Set up $c_1 v_1 + c_2 v_2 + c_3 v_3 = 0$ , i.e. the matrix equation $A\mathbf{c}=0$ with columns $v_i$ :

8

\quad A = \begin{pmatrix} 1 & 2 & 1 \\ 2 & 1 & -1 \\ 1 & 0 & -1 \end{pmatrix}.

Derivation hint: stack each vector as a column; the system $A\mathbf c=0$ encodes the dependence relation [3].

Step 2. Compute the determinant (independence $\Leftrightarrow \det A \neq 0$ for $n$ vectors in $\mathbb{R}^n$ ):

9

\quad \det A = 1(1\cdot(-1) - (-1)\cdot 0) - 2(2\cdot(-1)-(-1)\cdot 1) + 1(2\cdot 0 - 1\cdot 1).

Derivation hint: cofactor expansion along the first row of [8].

Step 3. Evaluate: $\det A = 1(-1) - 2(-2-(-1)) + 1(-1) = -1 - 2(-1) -1 = -1+2-1 = 0.$

Conclusion: $\det A = 0$ , so the vectors are linearly dependent. Indeed one checks $v_3 = v_2 - v_1$ ... verify: $v_2 - v_1 = (1,-1,-1) = v_3$ . ✓

\boxed{\text{Dependent; NOT a basis. } v_3 = v_2 - v_1.}

ExampleCoordinates Relative to a Basis

Given: Basis $B=\{b_1,b_2\}$ of $\mathbb{R}^2$ with $b_1=(1,1)$ , $b_2=(1,-1)$ . Find $[v]_B$ for $v=(4,2)$ .

Step 1. Solve $v = \alpha_1 b_1 + \alpha_2 b_2$ :

10

\quad \begin{cases} \alpha_1 + \alpha_2 = 4 \\ \alpha_1 - \alpha_2 = 2. \end{cases}

Derivation hint: match components of $\alpha_1(1,1)+\alpha_2(1,-1)=(4,2)$ .

Step 2. Add the equations: $2\alpha_1 = 6 \Rightarrow \alpha_1 = 3$ . Subtract: $2\alpha_2 = 2 \Rightarrow \alpha_2 = 1$ .

Step 3. Verify: $3(1,1) + 1(1,-1) = (3+1, 3-1) = (4,2)$ . ✓

\boxed{[v]_B = (3,\,1).}

Note these coordinates differ from the standard-basis coordinates $(4,2)$ — the same vector has different coordinate tuples in different bases.

⚠️ Common mistake

"More vectors = more spanning power, always good." No. Beyond $\dim V$ vectors, you cannot increase the span (it's already $V$ ), and you must lose independence. In $\mathbb{R}^n$ , any set of $n+1$ vectors is automatically dependent — regardless of how cleverly chosen.

"A basis is unique." False — there are infinitely many bases of any nontrivial space. What is unique is the number of basis vectors (the dimension) and the coordinates of a vector with respect to a fixed basis.

"Independence depends on the order or labeling." Independence is a property of the set, invariant under reordering. Coordinates, however, depend on an ordered basis.

"Zero can be in a basis." Never. Any set containing the zero vector is dependent, since $1\cdot 0 + 0\cdot(\text{rest}) = 0$ is a nontrivial relation.

CounterexamplePairwise independence ≠ joint independence

In $\mathbb{R}^2$ take $v_1=(1,0)$ , $v_2=(0,1)$ , $v_3=(1,1)$ . Any two of these are linearly independent (no two are collinear). Yet the full set is dependent:

11

\quad v_1 + v_2 - v_3 = (1,0)+(0,1)-(1,1) = (0,0).

Derivation hint: a single nontrivial relation among all three suffices for dependence, even when every pair looks fine.

Lesson: Independence is a global property of the whole set, not reducible to checking pairs.

connection

Linear independence and basis sit at the hub of linear algebra:

Rank-Nullity Theorem — the rank of a matrix is the dimension of its column space (a basis count of the image); nullity is the basis count of the kernel.
Span and Subspaces — bases are minimal spanning sets; every subspace has its own dimension $\le \dim V$ .
<a class="wiki-link" href="/wiki/ndli-iit-kgp-ma10002-mathematics-ii-linear-transformations">Linear Transformations</a> — a linear map is completely determined by its action on a basis, which is exactly why matrices represent maps.
<a class="wiki-link" href="/wiki/gram-schmidt-process">Gram-Schmidt Process</a> — converts any basis into an orthonormal one, marrying independence with inner-product geometry.
Change of Basis — invertible matrices relate coordinates in one basis to another; the columns are the new basis vectors expressed in the old.
Eigenvectors and Eigenvalues — a basis of eigenvectors diagonalizes an operator, the cleanest possible representation.

🔬 Where this appears

⏳ History

- 1844 — Hermann Grassmann publishes Die lineale Ausdehnungslehre, introducing

n

-dimensional spaces, linear independence, and dimension — but in notoriously obscure prose.

- 1862 — Grassmann releases a revised, clearer edition; still largely unread by mainstream mathematicians.

- 1888 — Giuseppe Peano gives the first axiomatic vector-space definition over

\mathbb{R}

, with explicit treatment of bases and dimension.

- 1888 — Peano also states what is essentially the dimension invariance result for finite systems.

- 1898 — Ernst Steinitz (and later in his 1910 field-theory work) formalizes the exchange lemma that guarantees all bases have equal cardinality.

- 1918 — Hermann Weyl, in Raum, Zeit, Materie, popularizes the abstract vector-space viewpoint within physics and relativity.

- 1922–1932 — Stefan Banach and others build functional analysis on infinite-dimensional vector spaces, motivating Hamel and Schauder bases.

- 1934 — Hamel basis existence for arbitrary vector spaces is established as a consequence of the Axiom of Choice (Zorn's Lemma).

- 1940s–50s — Bourbaki canonizes the modern definitions, making "linearly independent" and "basis" standard undergraduate vocabulary.

open-problem

Infinite-dimensional bases are slippery. In an infinite-dimensional space, a Hamel basis (allowing only finite linear combinations) always exists — but only via the Axiom of Choice, and it is essentially never explicitly constructible. A Hamel basis of $\mathbb{R}$ over $\mathbb{Q}$ , for instance, is non-measurable and cannot be exhibited. Analysts therefore prefer a Schauder basis, which permits infinite convergent sums (e.g. the Fourier basis of $L^2$ ). Crucially, these are different notions: a Hamel basis of an infinite-dimensional Banach space is always uncountable, while a Schauder basis can be countable. Whether every separable Banach space has a Schauder basis was a famous open question — Per Enflo answered it negatively in 1973, constructing a separable Banach space with no Schauder basis, a result that won him a live goose from Stanisław Mazur who had posed the problem in 1936. The interplay between algebraic (Hamel) and topological (Schauder) bases remains a rich subtlety distinguishing pure linear algebra from functional analysis.

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also