24.5. Linear Independence

A set of vectors {v₁, v₂,…, vₖ}⊆V is said to be linearly independent if a₁v₁ + a₂v₂ + ⋯ + aₖvₖ = 0 ⇒ a₁ = a₂ = ⋯ = aₖ = 0.

Linear independence is a property of a set of vectors. A set of vectors is considered linearly independent if the only way to express the zero vector as a linear combination of these vectors is to have all the coefficients (or scalars) equal to zero. This means that no vector in the set can be written as a linear combination of the others. If we can find scalars a₁, a₂, ..., aₖ, not all of them zero, such that their linear combination equals zero, the vectors are linearly dependent.

Imagine you have a group of people where each person has their own unique skill. If no one can replicate the skills of others, then this group has a linear independence of skills. Conversely, if one person can do exactly what another can do, then their skills are dependent, akin to how dependent vectors can be represented as combinations of others.

If there exist scalars not all zero satisfying the above equation, then the vectors are linearly dependent.

Linear dependence occurs when at least one vector in the set can be expressed as a combination of others. This situation arises when there exist scalars that are not all zero (some can be positive, some negative) for the linear combination of vectors resulting in the zero vector. Therefore, if you can find such scalars for a set of vectors, it indicates that at least one vector is redundant because it doesn't add any new 'direction' or value to the set.

Think of a library where a few books cover the same topic, but with different authors. If the information in one book can be summarized by the other books, then that book is akin to being linearly dependent; it doesn't provide new knowledge. The importance of avoiding redundancy is pivotal in ensuring diversity of information, just as it is in maintaining a robust set of linearly independent vectors in mathematics.

Example: Vectors (1,2),(2,4)∈R² are linearly dependent, since 2(1,2)−(2,4)=(0,0).

In this example, we can see how the two vectors (1, 2) and (2, 4) are linearly dependent. When we take twice the first vector (which gives us (2, 4)) and subtract the second vector (also (2, 4)), we end up with the zero vector (0, 0). This indicates that the second vector can be expressed as a linear combination of the first, confirming their dependence. Therefore, since one vector is a scaled version of another, they do not add any new direction in the vector space they represent.

Imagine you have two paintings, one a larger version of the other; they depict exactly the same scene. The larger painting doesn't add anything new to your collection because it merely magnifies what is already represented in the smaller painting. Just like how these paintings are dependent on each other for their depiction, the vectors are dependent in their representation of space.

--