Linear Dependence and Independence - Comprehensive Summary
Linear Dependence: A set of vectors is linearly dependent if at least one vector can be written as a linear combination of the others
Linear Independence: A set of vectors is linearly independent if no vector can be written as a linear combination of the others
Trivial Solution: All coefficients equal zero in the linear combination equation
• Linear dependence: Non-trivial solution exists
• Linear independence: Only trivial solution exists
• Zero vector makes any set dependent
• Parallel vectors are dependent
1. Set up homogeneous system
2. Solve for coefficients
3. Check for non-trivial solutions
4. Apply determinant test (when applicable)
• More vectors than dimension = dependent
• Different directions = likely independent
• Check for scalar multiples
• Use row reduction for large sets
Linear Independence: Vectors \(\{\vec{v_1}, \vec{v_2}\}\) are linearly independent if the only solution to \(c_1\vec{v_1} + c_2\vec{v_2} = \vec{0}\) is \(c_1 = c_2 = 0\)
- Set up the homogeneous equation: \(c_1\vec{v_1} + c_2\vec{v_2} = \vec{0}\)
- Solve for the coefficients \(c_1, c_2\)
- If only the trivial solution exists, vectors are independent
We need to solve: \(c_1\begin{pmatrix} 1 \\ 2 \end{pmatrix} + c_2\begin{pmatrix} 3 \\ 4 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}\)
\(\begin{cases} c_1 + 3c_2 = 0 \quad \text{(equation 1)} \\ 2c_1 + 4c_2 = 0 \quad \text{(equation 2)} \end{cases}\)
From equation 1: \(c_1 = -3c_2\)
Substitute into equation 2: \(2(-3c_2) + 4c_2 = 0\)
\(-6c_2 + 4c_2 = 0\)
\(-2c_2 = 0\)
Therefore: \(c_2 = 0\), which gives \(c_1 = -3(0) = 0\)
Since the only solution is \(c_1 = c_2 = 0\), the vectors are linearly independent.
The vectors \(\vec{v_1}\) and \(\vec{v_2}\) are linearly independent.
• Homogeneous system: Set linear combination equal to zero vector
• Trivial solution: Only zero coefficients indicate independence
• Unique solution: Non-zero coefficients would indicate dependence
Linear Dependence: Vectors \(\{\vec{u_1}, \vec{u_2}\}\) are linearly dependent if there exist scalars \(c_1, c_2\), not both zero, such that \(c_1\vec{u_1} + c_2\vec{u_2} = \vec{0}\)
We need to solve: \(c_1\begin{pmatrix} 2 \\ 4 \end{pmatrix} + c_2\begin{pmatrix} 1 \\ 2 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}\)
\(\begin{cases} 2c_1 + c_2 = 0 \quad \text{(equation 1)} \\ 4c_1 + 2c_2 = 0 \quad \text{(equation 2)} \end{cases}\)
From equation 1: \(c_2 = -2c_1\)
Substitute into equation 2: \(4c_1 + 2(-2c_1) = 0\)
\(4c_1 - 4c_1 = 0\)
\(0 = 0\)
This is always true, so there are infinitely many solutions.
One non-trivial solution: \(c_1 = 1, c_2 = -2\)
Verification: \(1\begin{pmatrix} 2 \\ 4 \end{pmatrix} + (-2)\begin{pmatrix} 1 \\ 2 \end{pmatrix} = \begin{pmatrix} 2 \\ 4 \end{pmatrix} + \begin{pmatrix} -2 \\ -4 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}\)
Since there exists a non-trivial solution, the vectors are linearly dependent.
The vectors \(\vec{u_1}\) and \(\vec{u_2}\) are linearly dependent because \(\vec{u_1} = 2\vec{u_2}\).
• Non-trivial solution: Existence indicates linear dependence
• Scalar relationship: One vector is a scalar multiple of another
• Verification: Always substitute back to confirm
Three Vector Independence: Vectors \(\{\vec{w_1}, \vec{w_2}, \vec{w_3}\}\) are linearly independent if the only solution to \(c_1\vec{w_1} + c_2\vec{w_2} + c_3\vec{w_3} = \vec{0}\) is \(c_1 = c_2 = c_3 = 0\)
We need to solve: \(c_1\begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix} + c_2\begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix} + c_3\begin{pmatrix} 0 \\ 0 \\ 1 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \\ 0 \end{pmatrix}\)
\(\begin{cases} c_1 + 0c_2 + 0c_3 = 0 \quad \text{(equation 1)} \\ 0c_1 + c_2 + 0c_3 = 0 \quad \text{(equation 2)} \\ 0c_1 + 0c_2 + c_3 = 0 \quad \text{(equation 3)} \end{cases}\)
From equation 1: \(c_1 = 0\)
From equation 2: \(c_2 = 0\)
From equation 3: \(c_3 = 0\)
The only solution is \(c_1 = c_2 = c_3 = 0\)
Since the only solution is the trivial solution, the vectors are linearly independent.
The vectors \(\vec{w_1}\), \(\vec{w_2}\), and \(\vec{w_3}\) are linearly independent. They form the standard basis for \(\mathbb{R}^3\).
• Standard basis: Unit vectors in different directions are independent
• Direct solution: Diagonal system has immediate solution
• Trivial solution: Only zero coefficients indicate independence
Four Vector Independence: Check if the only solution to \(c_1\vec{v_1} + c_2\vec{v_2} + c_3\vec{v_3} + c_4\vec{v_4} = \vec{0}\) is \(c_1 = c_2 = c_3 = c_4 = 0\)
We need to solve: \(c_1\begin{pmatrix} 1 \\ 2 \\ 1 \\ 0 \end{pmatrix} + c_2\begin{pmatrix} 2 \\ 1 \\ 0 \\ 1 \end{pmatrix} + c_3\begin{pmatrix} 3 \\ 3 \\ 1 \\ 1 \end{pmatrix} + c_4\begin{pmatrix} 0 \\ 1 \\ 1 \\ 1 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \\ 0 \\ 0 \end{pmatrix}\)
\(\begin{cases} c_1 + 2c_2 + 3c_3 + 0c_4 = 0 \quad \text{(equation 1)} \\ 2c_1 + c_2 + 3c_3 + c_4 = 0 \quad \text{(equation 2)} \\ c_1 + 0c_2 + c_3 + c_4 = 0 \quad \text{(equation 3)} \\ 0c_1 + c_2 + c_3 + c_4 = 0 \quad \text{(equation 4)} \end{cases}\)
From equation 3: \(c_1 = -c_3 - c_4\)
From equation 4: \(c_2 = -c_3 - c_4\)
So: \(c_1 = c_2\)
Substitute into equation 1: \((-c_3 - c_4) + 2(-c_3 - c_4) + 3c_3 = 0\)
\(-c_3 - c_4 - 2c_3 - 2c_4 + 3c_3 = 0\)
\(-3c_4 = 0\)
Therefore: \(c_4 = 0\)
This gives: \(c_1 = -c_3\) and \(c_2 = -c_3\)
Substitute into equation 2: \(2(-c_3) + (-c_3) + 3c_3 + 0 = 0\)
\(-2c_3 - c_3 + 3c_3 = 0\)
\(0 = 0\)
This is always true, so we can choose \(c_3\) freely.
Let \(c_3 = 1\), then: \(c_1 = -1\), \(c_2 = -1\), \(c_3 = 1\), \(c_4 = 0\)
\((-1)\begin{pmatrix} 1 \\ 2 \\ 1 \\ 0 \end{pmatrix} + (-1)\begin{pmatrix} 2 \\ 1 \\ 0 \\ 1 \end{pmatrix} + (1)\begin{pmatrix} 3 \\ 3 \\ 1 \\ 1 \end{pmatrix} + (0)\begin{pmatrix} 0 \\ 1 \\ 1 \\ 1 \end{pmatrix}\)
\(= \begin{pmatrix} -1 \\ -2 \\ -1 \\ 0 \end{pmatrix} + \begin{pmatrix} -2 \\ -1 \\ 0 \\ -1 \end{pmatrix} + \begin{pmatrix} 3 \\ 3 \\ 1 \\ 1 \end{pmatrix} + \begin{pmatrix} 0 \\ 0 \\ 0 \\ 0 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \\ 0 \\ 0 \end{pmatrix}\)
The vectors are linearly dependent because we found a non-trivial solution to the homogeneous equation.
• More vectors than dimension: 4 vectors in \(\mathbb{R}^4\) may still be dependent
• Free variables: Indicate infinite solutions and dependence
• Verification: Always substitute back to confirm
Parameterized Independence: Determine parameter values for which the only solution to \(c_1\vec{a_1} + c_2\vec{a_2} = \vec{0}\) is \(c_1 = c_2 = 0\)
We need to solve: \(c_1\begin{pmatrix} 1 \\ 2 \end{pmatrix} + c_2\begin{pmatrix} k \\ 3 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}\)
\(\begin{cases} c_1 + kc_2 = 0 \quad \text{(equation 1)} \\ 2c_1 + 3c_2 = 0 \quad \text{(equation 2)} \end{cases}\)
From equation 2: \(c_1 = -\frac{3}{2}c_2\)
Substitute into equation 1: \(-\frac{3}{2}c_2 + kc_2 = 0\)
\(c_2(-\frac{3}{2} + k) = 0\)
For independence, we need the only solution to be \(c_2 = 0\), which means \(c_1 = 0\).
This occurs when \(-\frac{3}{2} + k \neq 0\), i.e., when \(k \neq \frac{3}{2}\).
If \(k = \frac{3}{2}\), then any value of \(c_2\) works, giving infinitely many solutions.
The vectors are linearly independent when \(k \neq \frac{3}{2}\) and linearly dependent when \(k = \frac{3}{2}\).
The vectors \(\vec{a_1}\) and \(\vec{a_2}\) are linearly independent if and only if \(k \neq \frac{3}{2}\).
• Parameter conditions: Determine critical values where independence changes
• Division by zero: Be careful when dividing by expressions involving parameters
• Critical values: Values where the system behavior changes
Linear Independence: A set of vectors where no vector can be expressed as a linear combination of the others
Linear Dependence: A set of vectors where at least one vector can be expressed as a linear combination of the others
Trivial Solution: The solution where all coefficients are zero in a homogeneous linear combination
- Set up homogeneous system: \(c_1\vec{v_1} + ... + c_n\vec{v_n} = \vec{0}\)
- Solve for coefficients: Use substitution, elimination, or matrix methods
- Check for non-trivial solutions: If any coefficient can be non-zero, vectors are dependent
- Alternative tests: Use determinant or rank tests when applicable
• A single non-zero vector is always linearly independent
• Two vectors are dependent if and only if one is a scalar multiple of the other
• A set of vectors is dependent if any subset is dependent
• In \(\mathbb{R}^n\), at most \(n\) vectors can be linearly independent
• Linearly independent vectors form a basis for their span
Geometric Interpretation: Linearly independent vectors in \(\mathbb{R}^2\) span the entire plane, while dependent vectors span only a line through the origin.
- Independent: \(\vec{v_1} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}\) and \(\vec{v_2} = \begin{pmatrix} 0 \\ 1 \end{pmatrix}\) span \(\mathbb{R}^2\)
- Dependent: \(\vec{u_1} = \begin{pmatrix} 2 \\ 4 \end{pmatrix}\) and \(\vec{u_2} = \begin{pmatrix} 1 \\ 2 \end{pmatrix}\) span a line