Tutorials › Linear Algebra › Independence Tests for Vectors in R^2

Linear Independence · Tutorial 176 of 1000

Independence Tests for Vectors in R^2

Use coordinate equations and pivot patterns to decide whether a list of vectors in R² is independent and, when it is dependent, find an explicit relation.

Beginner 9 min read

What You'll Learn

  • Set up the homogeneous coefficient equations for vectors in R².
  • Use row reduction to test whether a pair is independent.
  • Relate dependence of a pair to scalar multiples and zero vectors.
  • Read free variables as sources of explicit dependence relations.
  • Explain why every list of more than two vectors in R² is dependent.

What the Coordinate Test Looks For

In \(\mathbb{R}^2\), each vector has two coordinates, but a list may contain one, two, or many vectors. To test the list, assign a coefficient to each vector and ask whether a nontrivial choice of coefficients can produce the zero vector. Writing the vectors as columns turns that question into a homogeneous system with two equations. Row reduction then reveals whether every coefficient must be zero or whether a free variable allows a nonzero solution.

All vectors here are columns with real coordinates. A list \(\mathbf{v}_1,\dots,\mathbf{v}_p\) is linearly independent when the equation \(c_1\mathbf{v}_1+\cdots+c_p\mathbf{v}_p=\mathbf{0}\) forces every coefficient \(c_j\) to be zero. It is linearly dependent when some choice of coefficients, not all zero, gives \(\mathbf{0}\). A list is ordered: if a vector occurs twice, both appearances have their own coefficient.

Write \(\mathbf{v}_j=(x_j,y_j)\), and form the matrix whose columns are the vectors. Its homogeneous system is

$$ \begin{bmatrix} x_1&x_2&\cdots&x_p\\ y_1&y_2&\cdots&y_p \end{bmatrix} \begin{bmatrix}c_1\\c_2\\\vdots\\c_p\end{bmatrix} = \begin{bmatrix}0\\0\end{bmatrix}. $$

Each row operation is reversible, so it preserves the solution set of this homogeneous system. In the reduced row echelon form (RREF), a variable corresponding to a column without a pivot is free: it can be assigned any real value, with the pivot variables then determined by the equations. Thus, a nonpivot column provides a way to test for a nonzero coefficient solution.

Coordinate test: For a list of columns in \(\mathbb{R}^2\), the list is independent if and only if every column has a pivot in the RREF of its matrix. If a column has no pivot, at least one coefficient is free, and assigning it a nonzero value produces a nontrivial solution of the homogeneous system.

For completeness, the test follows directly from the meaning of a free variable. If every column has a pivot, there are no free variables; in a homogeneous system every pivot variable must then be zero. If some column has no pivot, choose one free variable to be \(1\) and all other free variables to be \(0\). The pivot equations determine the remaining variables, and the chosen coefficient is nonzero. This test applies to one vector just as it does to a longer list.

Testing a Pair of Vectors

For a pair \(\mathbf{v}_1=(a,c)\) and \(\mathbf{v}_2=(b,d)\), the coefficient equation is precisely the two-equation system

$$ c_1\mathbf{v}_1+c_2\mathbf{v}_2=\mathbf{0} \quad\Longleftrightarrow\quad \begin{cases} ac_1+bc_2=0,\\ cc_1+dc_2=0. \end{cases} $$

There is a useful interpretation of its pivot pattern. If \(\mathbf{v}_1\ne\mathbf{0}\), column 1 has a pivot. Column 2 also has a pivot exactly when \(\mathbf{v}_2\) is not a scalar multiple of \(\mathbf{v}_1\). If the first vector is zero, the pair is dependent regardless of the second vector.

Theorem: A pair \(\mathbf{v}_1,\mathbf{v}_2\in\mathbb{R}^2\) is independent if and only if \(\mathbf{v}_1\ne\mathbf{0}\) and \(\mathbf{v}_2\) is not a scalar multiple of \(\mathbf{v}_1\).

Proof. First suppose the pair is independent. If \(\mathbf{v}_1=\mathbf{0}\), then \(1\mathbf{v}_1+0\mathbf{v}_2=\mathbf{0}\) is a nontrivial relation, contrary to independence. Thus \(\mathbf{v}_1\ne\mathbf{0}\). If \(\mathbf{v}_2=t\mathbf{v}_1\) for a real number \(t\), then \((-t)\mathbf{v}_1+1\mathbf{v}_2=\mathbf{0}\), also a nontrivial relation. So \(\mathbf{v}_2\) is not a scalar multiple of \(\mathbf{v}_1\).

Conversely, suppose \(\mathbf{v}_1\ne\mathbf{0}\) and \(\mathbf{v}_2\) is not a scalar multiple of \(\mathbf{v}_1\). Consider \(c_1\mathbf{v}_1+c_2\mathbf{v}_2=\mathbf{0}\). If \(c_2\ne0\), rearranging gives \(\mathbf{v}_2=-(c_1/c_2)\mathbf{v}_1\), contradicting the assumption. Therefore \(c_2=0\). The equation becomes \(c_1\mathbf{v}_1=\mathbf{0}\); since \(\mathbf{v}_1\ne\mathbf{0}\), this forces \(c_1=0\). The only relation is trivial, so the pair is independent. \(\square\)

Worked Example: Two Independent Vectors

Test \(\mathbf{v}_1=(1,2)\) and \(\mathbf{v}_2=(3,1)\) by row reduction. Place the vectors in the columns of \(\mathbf{A}\):

$$ \begin{bmatrix}1&3\\2&1\end{bmatrix} \xrightarrow{R_2\to R_2-2R_1} \begin{bmatrix}1&3\\0&-5\end{bmatrix} \xrightarrow{R_2\to-\frac15R_2} \begin{bmatrix}1&3\\0&1\end{bmatrix} \xrightarrow{R_1\to R_1-3R_2} \begin{bmatrix}1&0\\0&1\end{bmatrix}. $$

Both columns have pivots. The homogeneous system in RREF is \(c_1=0\), \(c_2=0\), so the pair is independent. As a direct check, substituting those coefficients gives \(0\mathbf{v}_1+0\mathbf{v}_2=\mathbf{0}\), and there are no other coefficient choices satisfying the reduced equations.

Worked Example: Two Dependent Vectors

Test \(\mathbf{u}_1=(2,-1)\) and \(\mathbf{u}_2=(-6,3)\). The coefficient equations are \(2c_1-6c_2=0\) and \(-c_1+3c_2=0\). Row reduction makes their shared information visible:

$$ \begin{bmatrix}2&-6\\-1&3\end{bmatrix} \xrightarrow{R_1\to\frac12R_1} \begin{bmatrix}1&-3\\-1&3\end{bmatrix} \xrightarrow{R_2\to R_2+R_1} \begin{bmatrix}1&-3\\0&0\end{bmatrix}. $$

Column 2 has no pivot, so set the free variable \(c_2=1\). The first equation gives \(c_1-3c_2=0\), hence \(c_1=3\). This produces the dependence relation \(3\mathbf{u}_1+\mathbf{u}_2=\mathbf{0}\).

Check: \(3(2,-1)+(-6,3)=(6,-3)+(-6,3)=(0,0)\). The relation is nontrivial, so the pair is dependent. In this case \(\mathbf{u}_2=-3\mathbf{u}_1\), in agreement with the pair criterion.

What Changes for Longer Lists

For a list of \(p\) vectors in \(\mathbb{R}^2\), the coefficient system still has just two rows, but it has \(p\) coefficient variables. Each pivot occupies a different row, so there can be at most two pivot columns. Consequently, a list with more than two vectors must have a nonpivot column and therefore a free variable. This is the two-dimensional instance of the general principle that a list with more vectors than coordinates is dependent.

Theorem: Any list of \(p>2\) vectors in \(\mathbb{R}^2\) is linearly dependent.

Proof. Put the vectors into the columns of a \(2\times p\) matrix and row-reduce it. There are only two rows, and each pivot must be in a different row, so there are at most two pivot columns. Since \(p>2\), at least one of the \(p\) columns has no pivot. The corresponding coefficient is free. Assign that coefficient the value \(1\), assign any other free coefficients the value \(0\), and solve for the pivot coefficients in the homogeneous RREF system. This gives a solution with a nonzero coefficient, hence a dependence relation. \(\square\)

Worked Example: Three Vectors in R²

Test \(\mathbf{w}_1=(1,2)\), \(\mathbf{w}_2=(2,1)\), and \(\mathbf{w}_3=(3,3)\), and find a dependence relation. Form the column matrix and reduce:

$$ \begin{bmatrix}1&2&3\\2&1&3\end{bmatrix} \xrightarrow{R_2\to R_2-2R_1} \begin{bmatrix}1&2&3\\0&-3&-3\end{bmatrix} \xrightarrow{R_2\to-\frac13R_2} \begin{bmatrix}1&2&3\\0&1&1\end{bmatrix} \xrightarrow{R_1\to R_1-2R_2} \begin{bmatrix}1&0&1\\0&1&1\end{bmatrix}. $$

The first two columns have pivots and the third is free. The coefficient equations are \(c_1+c_3=0\) and \(c_2+c_3=0\). Set \(c_3=1\); then \(c_1=-1\) and \(c_2=-1\). Thus \(-\mathbf{w}_1-\mathbf{w}_2+\mathbf{w}_3=\mathbf{0}\).

Check: \(-(1,2)-(2,1)+(3,3)=(-1-2+3,\,-2-1+3)=(0,0)\). Therefore the list is dependent, and the relation also confirms that \(\mathbf{w}_3=\mathbf{w}_1+\mathbf{w}_2\).

Reading the Main Cases

The number of vectors narrows down what the pivot test can show, but it does not replace the test when there are one or two vectors. For one vector, independence means exactly that the vector is nonzero: \(c\mathbf{v}_1=\mathbf{0}\) has only \(c=0\) when \(\mathbf{v}_1\ne\mathbf{0}\), while a zero vector gives a nontrivial relation. For two vectors, independence requires a pivot in each column. For more than two vectors, independence is impossible in \(\mathbb{R}^2\).

Number of vectorsWhat to checkConclusion
OneIs the vector nonzero?Independent exactly when it is nonzero
TwoDoes each column have a pivot?Independent exactly when both columns have pivots
More than twoThere are more columns than possible pivot rowsDependent

The pivot test also explains how to obtain a relation rather than only a yes-or-no answer. Choose values for the free coefficients, then use the pivot equations to determine the remaining coefficients. A nonzero choice of a free coefficient guarantees that the resulting coefficient vector is nonzero. Finally, substitute the coefficients into the original vector combination to verify the relation. This check is useful because it confirms both the arithmetic and the order of the vectors in the list.

Common Pitfall: Two Equations Need Not Give Two Pivots

A pair gives two coordinate equations, but that does not mean the equations are independent. For \((1,2)\) and \((2,4)\), one might incorrectly reason that two equations in two unknowns must force both coefficients to zero. The actual coefficient system is

$$ \begin{bmatrix}1&2\\2&4\end{bmatrix} \xrightarrow{R_2\to R_2-2R_1} \begin{bmatrix}1&2\\0&0\end{bmatrix}. $$

The second equation has become \(0=0\), not a new restriction. The correct reduced equation is \(c_1+2c_2=0\), so \(c_2\) is free. Taking \(c_2=1\) gives \(c_1=-2\), and the correction to the false conclusion is the explicit relation \(-2(1,2)+(2,4)=(0,0)\). Always count pivots after reduction; do not count the equations before checking whether some are redundant.

For a pair in \(\mathbb{R}^2\), the same issue can be phrased geometrically: if both vectors are nonzero but point along the same line through the origin, one is a scalar multiple of the other and the pair is dependent. In a longer list, even if no two vectors are scalar multiples, the whole list can still be dependent. The three vectors in the preceding example are pairwise nonproportional, yet their displayed relation shows dependence. The homogeneous coefficient system tests the whole list, not just its pairs.

Check Your Understanding

For each item, write the coefficient equation or matrix as needed, and use it to justify your conclusion.

  1. Test whether \((1,0)\) and \((2,3)\) are independent by row-reducing the matrix with these columns.
  2. Find a nontrivial dependence relation for \((1,3)\) and \((2,6)\), and check it by substitution.
  3. Explain why the one-vector list \((0,0)\) is dependent, while \((0,1)\) is independent.
  4. For the list \((1,1),(2,0),(0,2)\), find a free variable and use it to produce a dependence relation.
  5. Why must every list of four vectors in \(\mathbb{R}^2\) have a free coefficient in its homogeneous system?

Test yourself: Linear Algebra final exam practice

Ready to check what you know? Work a full-length practice final, then open the complete worked solutions.

Want all 1,114 practice problems?

This tutorial covers one topic. Calc Pass covers the full Calculus AB & BC curriculum (the core of Calculus I and II): full review, every practice question, and step-by-step solutions to each one.

QR code to download the Calc Pass app

Get the Calc Pass App

Scan to download and practice on the go, with instant scoring.

Calc Pass Volume 1: 1,114 Practice Questions book cover

Vol. 1: 1,114 Questions

The complete practice question bank, organized by AB & BC topic.

View on Amazon
Calc Pass Volume 2: Solutions Manual book cover

Vol. 2: Solutions Manual

Fully worked solutions to every question in Volume 1.

View on Amazon