Contenido del curso
Linear Independence: Spotting Redundant Vectors
Knowing when a vector is redundant inside a set is the core of linear independence, a concept that lets you decide if every vector in a group truly adds a new direction or if one is just a copy in disguise. If you study linear algebra, vector spaces or the foundations of machine learning, this idea is the gateway to topics like dot product, orthogonality and projections.
What does it mean for a set of vectors to be linearly independent?
A set of vectors is linearly independent when none of them can be written as a linear combination of the others. Think of it as the ideal construction kit: every piece is essential and points in a fundamentally new direction. Remove any vector and the span shrinks immediately.
The clearest example lives in R2 with the standard basis vectors i hat and j hat. The vector i hat has coordinates (1,0) and j hat has coordinates (0,1). No matter what scalar you multiply i hat by, you will never move along the Y axis. The same logic applies to j hat on the X axis. Each one controls a dimension the other cannot touch, and that is why they are the most efficient building blocks of a 2D plane [00:42].
What is linear independence in simple terms? It means no vector in the set repeats a direction already covered by the others. Each one adds something unique to the space they generate.
How do you recognize linear dependence between vectors?
A set is linearly dependent when at least one vector can be built from a linear combination of the others. That vector is redundant: it lives inside the space the rest already generate, so it adds zero new direction.
Look at this case from the lesson [01:45]:
When you compute it, 2U gives (2,4), and adding V gives (5,5). If you graph it, you get the same parallelogram you saw when adding vectors with the parallelogram method. W lives inside the span of U and V, so the set {U, V, W} is linearly dependent.
How can you test if two vectors are linearly independent?
The quickest test with two vectors is to check whether one is a scalar multiple of the other. Take U = (2,1) and V = (-1,1). Ask yourself: is there a scalar c such that U = cV?
If you try c = 2, you get (-2,2), which is not U. No scalar will turn V into U, so the set {U, V} is linearly independent [03:30]. Neither vector can be rebuilt from the other.
How do I know if two vectors are linearly dependent? If one is a scalar multiple of the other, they are dependent. If no scalar works, they are independent.
What happens when you add a third vector to the set?
Adding more vectors changes the picture. Consider:
At first glance the trio looks independent, but a quick sum reveals the truth. U + V equals (2 + (-1), 1 + 1), which gives (1,2). That is exactly W. So W is a linear combination of U and V, and the set is linearly dependent [04:30].
This is the key insight: visual intuition can fool you, but arithmetic does not.
Why does linear independence matter in vector spaces?
Linear independence tells you whether your vectors are doing real work or wasting space. When every vector is independent, you have an efficient basis where each one contributes a unique dimension. When dependence appears, you have redundancy, and the span does not grow even if you keep adding vectors.
This distinction is the foundation for measuring alignment and angles between vectors, which leads directly into the dot product, orthogonality and projections.
What is a linear combination? It is the result of multiplying vectors by scalars and adding them together, like 2U + V. If one vector equals a linear combination of others, the set is dependent.
Practice exercise to test your understanding
Try this on your own with the following set:
Is this set linearly independent or dependent? Think about whether W can be written as a combination of U and V using scalars. Share your reasoning and your answer in the comments so we can compare approaches.
