1.2.12 Linear Independence Definition

Linear Independence Definition is the characterization of a set of vectors as linearly independent when the only linear combination of those vectors that produces the zero vector is the trivial one, in which every coefficient equals zero, meaning that no vector in the set can be expressed as a linear combination of the others. It supplies one of the two conditions, together with spanning, that a set of vectors must satisfy to form a basis, and it underlies the notion of dimension, the uniqueness of coordinate representations, and the classification of tensors by rank.

The Formal Criterion

A finite collection of vectors from a vector space is linearly independent if the equation formed by setting a linear combination of those vectors equal to the zero vector forces every coefficient in that combination to be zero. Equivalently, a set is linearly dependent, the negation of independence, if there exists some nontrivial linear combination — one with at least one nonzero coefficient — of the vectors that equals the zero vector.

The expression above states the defining criterion of linear independence: the only way for a linear combination of the given vectors to vanish is for every coefficient to vanish.

Equivalent Characterization

An equivalent way of stating linear independence is that no vector in the collection can be written as a linear combination of the remaining vectors in that collection. If some vector could be expressed this way, moving all terms to one side would produce a nontrivial linear combination equaling zero, violating independence; conversely, if a nontrivial vanishing combination exists, its nonzero coefficient can be used to solve for one vector in terms of the others. This equivalence gives an intuitive reading of linear independence: each vector in an independent set contributes a direction that cannot be reconstructed from the others.

Consequences of Linear Independence

Linear independence has several immediate consequences that recur throughout tensor algebra. A linearly independent set cannot contain the zero vector, since the zero vector alone forms a nontrivial dependent combination with any nonzero coefficient. Any subset of a linearly independent set is itself linearly independent, while any superset formed by adding a vector already expressible in terms of the original set becomes dependent. Most importantly, when a linearly independent set also spans the vector space, every vector in the space has a unique representation as a linear combination of the set, which is precisely the property that makes a basis useful for assigning coordinates.

Linear Independence and Dimension

The maximum number of linearly independent vectors that can be found within a given vector space is an invariant of the space itself, independent of which particular vectors are chosen, and this number is precisely the dimension of the vector space. Every basis of a finite-dimensional vector space consists of exactly this many vectors, since a basis must be both linearly independent, and therefore no larger than the maximum independent set, and spanning, and therefore no smaller than what is needed to generate the whole space.

Role in Tensor Algebra

Linear independence underlies the well-posedness of coordinates and, through them, of tensor components. Because a basis is linearly independent, the coordinates of any vector relative to that basis are uniquely determined, and this same uniqueness extends to the components of tensors of any rank once bases are fixed for every vector and dual space involved. Linear independence also plays a role in identifying decomposable tensors and in determining the rank of a tensor when it is expressed as a sum of elementary tensors, since the number of linearly independent terms required in such a decomposition is directly tied to how the tensor's rank is defined and computed.