Linear Algebra for Team-Based Inquiry Learning

2023 Edition

Steven Clontz Drew Lewis
University of South Alabama

August 24, 2023

Section 2.5: Identifying a Basis (EV5)

Activity 2.5.1 (~15 min)

Consider the set of vectors

\begin{equation*} S=\left\{ \left[\begin{array}{c} 3 \\ -2 \\ -1 \\ 0 \end{array} \right], \left[\begin{array}{c} 2 \\ 4 \\ 1 \\ 1 \end{array} \right], \left[\begin{array}{c} 0 \\ -16 \\ -5 \\ -3 \end{array} \right], \left[\begin{array}{c} 1 \\ 2 \\ 3 \\ 0 \end{array} \right], \left[\begin{array}{c} 3 \\ 3 \\ 0 \\ 1 \end{array} \right] \right\}\text{.} \end{equation*}

Part 1.

Express the vector \(\left[\begin{array}{c} 5 \\ 2 \\ 0 \\ 1 \end{array} \right]\) as a linear combination of the vectors in \(S\text{,}\) i.e. find scalars such that

\begin{equation*} \left[\begin{array}{c} 5 \\ 2 \\ 0 \\ 1 \end{array} \right] = \unknown \left[\begin{array}{c} 3 \\ -2 \\ -1 \\ 0 \end{array} \right] + \unknown \left[\begin{array}{c} 2 \\ 4 \\ 1 \\ 1 \end{array} \right] + \unknown \left[\begin{array}{c} 0 \\ -16 \\ -5 \\ -3 \end{array} \right] + \unknown \left[\begin{array}{c} 1 \\ 2 \\ 3 \\ 0 \end{array} \right] + \unknown \left[\begin{array}{c} 3 \\ 3 \\ 0 \\ 1 \end{array} \right]\text{.} \end{equation*}

Activity 2.5.1 (~15 min)

Consider the set of vectors

\begin{equation*} S=\left\{ \left[\begin{array}{c} 3 \\ -2 \\ -1 \\ 0 \end{array} \right], \left[\begin{array}{c} 2 \\ 4 \\ 1 \\ 1 \end{array} \right], \left[\begin{array}{c} 0 \\ -16 \\ -5 \\ -3 \end{array} \right], \left[\begin{array}{c} 1 \\ 2 \\ 3 \\ 0 \end{array} \right], \left[\begin{array}{c} 3 \\ 3 \\ 0 \\ 1 \end{array} \right] \right\}\text{.} \end{equation*}

Part 2.

Find a different way to express the vector \(\left[\begin{array}{c} 5 \\ 2 \\ 0 \\ 1 \end{array} \right]\) as a linear combination of the vectors in \(S\text{.}\)

Activity 2.5.1 (~15 min)

Consider the set of vectors

\begin{equation*} S=\left\{ \left[\begin{array}{c} 3 \\ -2 \\ -1 \\ 0 \end{array} \right], \left[\begin{array}{c} 2 \\ 4 \\ 1 \\ 1 \end{array} \right], \left[\begin{array}{c} 0 \\ -16 \\ -5 \\ -3 \end{array} \right], \left[\begin{array}{c} 1 \\ 2 \\ 3 \\ 0 \end{array} \right], \left[\begin{array}{c} 3 \\ 3 \\ 0 \\ 1 \end{array} \right] \right\}\text{.} \end{equation*}

Part 3.

Consider another vector \(\left[\begin{array}{c} 8 \\ 6 \\ 7 \\ 5 \end{array} \right]\text{.}\) Without computing the RREF of another matrix, how many ways can this vector be written as a linear combination of the vectors in \(S\text{?}\)

  1. Zero.

  2. One.

  3. Infintiely-many.

  4. Computing a new matrix RREF is necessary.

Activity 2.5.2

Let’s review some of the terminology we’ve been dealing with...

Part 1.

If every vector in a space can be constructed as one or more linear combination of vectors in a set \(S\text{,}\) we can say...

  1. the set \(S\) spans the space.

  2. the set \(S\) fails to span the space.

  3. the set \(S\) is linearly independent.

  4. the set \(S\) is linearly dependent.

Activity 2.5.2

Let’s review some of the terminology we’ve been dealing with...

Part 2.

If the zero vector \(\vec 0\) can be constructed as a unique linear combination of vectors in a set \(S\) (the combination multiplying every vector by the scalar value \(0\)), we can say...

  1. the set \(S\) spans the space.

  2. the set \(S\) fails to span the space.

  3. the set \(S\) is linearly independent.

  4. the set \(S\) is linearly dependent.

Activity 2.5.2

Let’s review some of the terminology we’ve been dealing with...

Part 3.

If every vector of a space can either be constructed as a unique linear combination of vectors in a set \(S\text{,}\) or not at all, we can say...

  1. the set \(S\) spans the space.

  2. the set \(S\) fails to span the space.

  3. the set \(S\) is linearly independent.

  4. the set \(S\) is linearly dependent.

Definition 2.5.1

A basis of a vector space is a set of vectors \(S\) for which

  1. Every vector of the space can be expressed as a linear combination of the vectors in \(S\text{.}\)

  2. For each vector \(\vec{v}\) in the space, there is only one way to write it as a linear combination of the vectors in \(S\text{.}\)

These two properties may be expressed more succintly as the statement "Every vector in \(V\) can be expressed uniquely as a linear combination of the vectors in \(S\)".

Observation 2.5.2

In terms of a vector equation, a set \(S=\left\{\vec{v}_1,\ldots,\vec{v}_n\right\}\) is a basis of a space if the vector equation

\begin{equation*} x_1 \vec{v_1}+\cdots+x_n\vec{v_n}=\vec{w} \end{equation*}
has a unique solution for every vector \(\vec{w}\) in the space.

Put another way, a basis may be thought of as a minimal set of “building blocks” that can be used to construct any other vector of the space.

Activity 2.5.3

Activity 2.5.4

Definition 2.5.3

The standard basis of \(\IR^n\) is the set \(\{\vec{e}_1, \ldots, \vec{e}_n\}\) where

\begin{align*} \vec{e}_1 &= \left[\begin{array}{c}1 \\ 0 \\ 0 \\ \vdots \\ 0 \\ 0 \end{array}\right] & \vec{e}_2 &= \left[\begin{array}{c}0 \\ 1 \\ 0 \\ \vdots \\ 0 \\ 0 \end{array}\right] & \cdots & & \vec{e}_n = \left[\begin{array}{c}0 \\ 0 \\ 0 \\ \vdots \\ 0 \\ 1 \end{array}\right]\text{.} \end{align*}

In particular, the standard basis for \(\mathbb R^3\) is \(\{\vec e_1,\vec e_2,\vec e_3\}=\{\hat\imath,\hat\jmath,\hat k\}\text{.}\)

Activity 2.5.5 (~15 min)

Take the RREF of an appropriate matrix to determine if each of the following sets is a basis for \(\IR^4\text{.}\)

Part 1.

\begin{equation*} \left\{ \left[\begin{array}{c}1\\0\\0\\0\end{array}\right], \left[\begin{array}{c}0\\1\\0\\0\end{array}\right], \left[\begin{array}{c}0\\0\\1\\0\end{array}\right], \left[\begin{array}{c}0\\0\\0\\1\end{array}\right] \right\} \end{equation*}
  1. A basis because it both spans and is linearly independent.

  2. Spans, but not a basis as it is linearly dependent.

  3. Linearly independent, but not a basis as it fails to span.

  4. Fails to span and linearly independent, so not a basis.

Activity 2.5.5 (~15 min)

Take the RREF of an appropriate matrix to determine if each of the following sets is a basis for \(\IR^4\text{.}\)

Part 2.

\begin{equation*} \left\{ \left[\begin{array}{c}2\\3\\0\\-1\end{array}\right], \left[\begin{array}{c}2\\0\\0\\3\end{array}\right], \left[\begin{array}{c}4\\3\\0\\2\end{array}\right], \left[\begin{array}{c}-3\\0\\1\\3\end{array}\right] \right\} \end{equation*}
  1. A basis because it both spans and is linearly independent.

  2. Spans, but not a basis as it is linearly dependent.

  3. Linearly independent, but not a basis as it fails to span.

  4. Fails to span and linearly independent, so not a basis.

Activity 2.5.5 (~15 min)

Take the RREF of an appropriate matrix to determine if each of the following sets is a basis for \(\IR^4\text{.}\)

Part 3.

\begin{equation*} \left\{ \left[\begin{array}{c}2\\3\\0\\-1\end{array}\right], \left[\begin{array}{c}2\\0\\0\\3\end{array}\right], \left[\begin{array}{c}3\\13\\7\\16\end{array}\right], \left[\begin{array}{c}-1\\10\\7\\14\end{array}\right], \left[\begin{array}{c}4\\3\\0\\2\end{array}\right] \right\} \end{equation*}
  1. A basis because it both spans and is linearly independent.

  2. Spans, but not a basis as it is linearly dependent.

  3. Linearly independent, but not a basis as it fails to span.

  4. Fails to span and linearly independent, so not a basis.

Activity 2.5.5 (~15 min)

Take the RREF of an appropriate matrix to determine if each of the following sets is a basis for \(\IR^4\text{.}\)

Part 4.

\begin{equation*} \left\{ \left[\begin{array}{c}2\\3\\0\\-1\end{array}\right], \left[\begin{array}{c}4\\3\\0\\2\end{array}\right], \left[\begin{array}{c}-3\\0\\1\\3\end{array}\right], \left[\begin{array}{c}3\\6\\1\\5\end{array}\right] \right\} \end{equation*}
  1. A basis because it both spans and is linearly independent.

  2. Spans, but not a basis as it is linearly dependent.

  3. Linearly independent, but not a basis as it fails to span.

  4. Fails to span and linearly independent, so not a basis.

Activity 2.5.5 (~15 min)

Take the RREF of an appropriate matrix to determine if each of the following sets is a basis for \(\IR^4\text{.}\)

Part 5.

\begin{equation*} \left\{ \left[\begin{array}{c}5\\3\\0\\-1\end{array}\right], \left[\begin{array}{c}-2\\1\\0\\3\end{array}\right], \left[\begin{array}{c}4\\5\\1\\3\end{array}\right] \right\} \end{equation*}
  1. A basis because it both spans and is linearly independent.

  2. Spans, but not a basis as it is linearly dependent.

  3. Linearly independent, but not a basis as it fails to span.

  4. Fails to span and linearly independent, so not a basis.

Activity 2.5.6 (~10 min)

If \(\{\vec v_1,\vec v_2,\vec v_3,\vec v_4\}\) is a basis for \(\IR^4\text{,}\) that means \(\RREF[\vec v_1\,\vec v_2\,\vec v_3\,\vec v_4]\) has a pivot in every row (because it spans), and has a pivot in every column (because it’s linearly independent).

What is \(\RREF[\vec v_1\,\vec v_2\,\vec v_3\,\vec v_4]\text{?}\)

\begin{equation*} \RREF[\vec v_1\,\vec v_2\,\vec v_3\,\vec v_4] = \left[\begin{array}{cccc} \unknown & \unknown & \unknown & \unknown \\ \unknown & \unknown & \unknown & \unknown \\ \unknown & \unknown & \unknown & \unknown \\ \unknown & \unknown & \unknown & \unknown \\ \end{array}\right] \end{equation*}

Fact 2.5.4

The set \(\{\vec v_1,\dots,\vec v_m\}\) is a basis for \(\IR^n\) if and only if \(m=n\) and \(\RREF[\vec v_1\,\dots\,\vec v_n]= \left[\begin{array}{cccc} 1&0&\dots&0\\ 0&1&\dots&0\\ \vdots&\vdots&\ddots&\vdots\\ 0&0&\dots&1 \end{array}\right] \text{.}\)

That is, a basis for \(\IR^n\) must have exactly \(n\) vectors and its square matrix must row-reduce to the so-called identity matrix containing all zeros except for a downward diagonal of ones. (We will learn where the identity matrix gets its name in a later module.)