Question

Complete the proof Let V be a nontrivial vector space which has a spanning set {xi}...

  1. Complete the proof

Let V be a nontrivial vector space which has a spanning set {xi} ki=1. Then there is a subset of {xi} ki=1 which is a basis for V.

Proof. We will divide the set {xi} ki=1 into two sets, which we will call good and bad. If x1 ≠ 0, then we label x1 as good and if it is zero, we label it as bad. For each i ≥ 2, if xi ∉ span{x1, . . . , xi−1}, then we label xi as good, and otherwise we label it as bad. Let B be the set of all the good elements. We claim that B is a basis for V.

B is nonempty because not all the xi are zero and the first nonzero xi will be good. We must first verify that B is a linearly independent set. Let B = {b1, b2, . . . , bj} and assume we have scalars c1, c2, . . . , cj such that c1b1+c2b2+· · ·+cjbj = 0. Then c1b1+c2b2+· · ·+cj−1bj−1 = −cjbj, and by the construction of the set B, bj is not a linear combination of the previous elements, which therefore implies that cj must be zero. But we can repeat this argument. We now know that c1b1+c2b2 +· · ·+ cj−1bj−1 = 0, so that c1b1+c2b2 +· · ·+cj−2bj−2 = −cj−1bj−1 and again this implies that cj−1 = 0. Repeating this will prove that all the coefficients must be zero. Therefore, B is a linearly independent set.

Now show that the span of the elements of B is all of V.

  1. Extend to the case when S is an arbitrary subset of V (i.e., do not assume that S is finite).

The linear span of a finite set of vectors in a vector space V is a subspace of V.

Proof. Let S = {x1, x2, . . . , xn} ⊂ V be a given set of vectors, and let W = span(S). Let u and v be vectors in W, and write u = c1x1 + c2x2 + · · · + cnxn and v = d1x1 + d2x2 + · · · + dnxn. Then u + v = Σ ni=1(ci + di)xi , which is a linear combination of the vectors xi , so u + v is an element W, thus proving that W is closed under addition. If a is a scalar, then au = ac1x1 + ac2x2 + · · · + acnxn is again a linear combination of {x1, x2, . . . , xn}. Since W is closed under addition and scalar multiplication, it is a subspace of V.

Extend to the case when S is an arbitrary subset of V (i.e., do not assume that S is finite)

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Definition. Let S ⊂ V be a subset of a vector space. The span of S,...
Definition. Let S ⊂ V be a subset of a vector space. The span of S, span(S), is the set of all finite linear combinations of vectors in S. In set notation, span(S) = {v ∈ V : there exist v1, . . . , vk ∈ S and a1, . . . , ak ∈ F such that v = a1v1 + . . . + akvk} . Note that this generalizes the notion of the span of a...
4. Prove the Following: a. Prove that if V is a vector space with subspace W...
4. Prove the Following: a. Prove that if V is a vector space with subspace W ⊂ V, and if U ⊂ W is a subspace of the vector space W, then U is also a subspace of V b. Given span of a finite collection of vectors {v1, . . . , vn} ⊂ V as follows: Span(v1, . . . , vn) := {a1v1 + · · · + anvn : ai are scalars in the scalar field}...
For a nonempty subset S of a vector space V , define span(S) as the set...
For a nonempty subset S of a vector space V , define span(S) as the set of all linear combinations of vectors in S. (a) Prove that span(S) is a subspace of V . (b) Prove that span(S) is the intersection of all subspaces that contain S, and con- clude that span(S) is the smallest subspace containing S. Hint: let W be the intersection of all subspaces containing S and show W = span(S). (c) What is the smallest subspace...
Let T be a 1-1 linear transformation from a vector space V to a vector space...
Let T be a 1-1 linear transformation from a vector space V to a vector space W. If the vectors u, v and w are linearly independent in V, prove that T(u), T(v), T(w) are linearly independent in W
A2. Let v be a fixed vector in an inner product space V. Let W be...
A2. Let v be a fixed vector in an inner product space V. Let W be the subset of V consisting of all vectors in V that are orthogonal to v. In set language, W = { w LaTeX: \in ∈V: <w, v> = 0}. Show that W is a subspace of V. Then, if V = R3, v = (1, 1, 1), and the inner product is the usual dot product, find a basis for W.
Let S={u,v,w}S={u,v,w} be a linearly independent set in a vector space V. Prove that the set...
Let S={u,v,w}S={u,v,w} be a linearly independent set in a vector space V. Prove that the set S′={3u−w,v+w,−2w}S′={3u−w,v+w,−2w} is also a linearly independent set in V.
1. Let T be a linear transformation from vector spaces V to W. a. Suppose that...
1. Let T be a linear transformation from vector spaces V to W. a. Suppose that U is a subspace of V, and let T(U) be the set of all vectors w in W such that T(v) = w for some v in V. Show that T(U) is a subspace of W. b. Suppose that dimension of U is n. Show that the dimension of T(U) is less than or equal to n.
Let V and W be finite-dimensional vector spaces over F, and let φ : V →...
Let V and W be finite-dimensional vector spaces over F, and let φ : V → W be a linear transformation. Let dim(ker(φ)) = k, dim(V ) = n, and 0 < k < n. A basis of ker(φ), {v1, . . . , vk}, can be extended to a basis of V , {v1, . . . , vk, vk+1, . . . , vn}, for some vectors vk+1, . . . , vn ∈ V . Prove that...
Determine whether the given set ?S is a subspace of the vector space ?V. A. ?=?2V=P2,...
Determine whether the given set ?S is a subspace of the vector space ?V. A. ?=?2V=P2, and ?S is the subset of ?2P2 consisting of all polynomials of the form ?(?)=?2+?.p(x)=x2+c. B. ?=?5(?)V=C5(I), and ?S is the subset of ?V consisting of those functions satisfying the differential equation ?(5)=0.y(5)=0. C. ?V is the vector space of all real-valued functions defined on the interval [?,?][a,b], and ?S is the subset of ?V consisting of those functions satisfying ?(?)=?(?).f(a)=f(b). D. ?=?3(?)V=C3(I), and...
1) Let S={v_1, ..., v_p} be a linearly dependent set of vectors in R^n. Explain why...
1) Let S={v_1, ..., v_p} be a linearly dependent set of vectors in R^n. Explain why it is the case that if v_1=0, then v_1 is a trivial combination of the other vectors in S. 2) Let S={(0,1,2),(8,8,16),(1,1,2)} be a set of column vectors in R^3. This set is linearly dependent. Label each vector in S with one of v_1, v_2, v_3 and find constants, c_1, c_2, c_3 such that c_1v_1+ c_2v_2+ c_3v_3=0. Further, identify the value j and v_j...