An important type of problem in linear algebra involves writing one vector \(\mathbf{x}\) as the sum of scalar multiples of other vectors \(\mathbf{v}_{1}, \mathbf{v}_{2}, \ldots\text{,}\) and \(\mathbf{v}_{n}\text{.}\) That is, for scalars \(c_{1}\text{,}\)\(c_{2}, \ldots, c_{n}\)
The vector \(\mathbf{x}\) is called a linear combination of the vectors \(\mathbf{v}_{1}, \mathbf{v}_{2}, \ldots, \mathbf{v}_{n}\) with weight \(c_1,c_2,\ldots,c_n\text{.}\)
Linear Independent Set.
A set of vectors \(\{\mathbf{v}_1,\mathbf{v}_2,\ldots,\mathbf{v}_n\}\) is called linear independent if the linear combination
Find a maximum linear independent subset \(W\) of \(S\text{.}\) That is, \(W\) is linear independent, but for any \(W\subsetneq U\)(proper included), \(U\) is linear dependent.
Activity4.2.3.
Write the fifth vector \(v_5\) as a linear combination of the other four vectors \(v_1, v_2,v_3\) and \(v_4\text{.}\)
Activity4.2.4.
Find a maximal linear independent subset of the set