Back to Definition and Examples

Exercise 13

Avg difficulty 3.0
  • Show that this

    S={(110),(−120)}S=\text{$\{\hskip 1.00006pt\begin{pmatrix}1\\ 1\\ 0\end{pmatrix},\begin{pmatrix}-1\\ 2\\ 0\end{pmatrix}\hskip 1.00006pt\}$}

    is a linearly independent subset of R3\mathbb{R}^{3}.

  • Show that

    (320)\begin{pmatrix}3\\ 2\\ 0\end{pmatrix}

    is in the span of SS by finding c1c_{1} and c2c_{2} giving a linear relationship.

    c1(110)+c2(−120)=(320)c_{1}\begin{pmatrix}1\\ 1\\ 0\end{pmatrix}+c_{2}\begin{pmatrix}-1\\ 2\\ 0\end{pmatrix}=\begin{pmatrix}3\\ 2\\ 0\end{pmatrix}

    Show that the pair c1,c2c_{1},c_{2} is unique.

  • Assume that SS is a subset of a vector space and that v⃗\vec{v} is in [S][S], so that v⃗\vec{v} is a linear combination of vectors from SS. Prove that if SS is linearly independent then a linear combination of vectors from SS adding to v⃗\vec{v} is unique (that is, unique up to reordering and adding or taking away terms of the form 0⋅s⃗0\cdot\vec{s}). Thus SS as a spanning set is minimal in this strong sense: each vector in [S][S] is a combination of elements of SS a minimum number of times — only once.

  • Prove that it can happen when SS is not linearly independent that distinct linear combinations sum to the same vector.

Hefferon, Linear Algebra, Vector Spaces, Definition and Examples, Exercise 13

AI Tutor

Adapted from Linear Algebra © 2016 Jim Hefferon. Licensed under CC BY-SA 3.0 US. Source: Linear Algebra. Imported at revision df2262e.