Proof Linear Span Subsets: Proving L(S) is Smallest Subspace of V

Caroline Fields
Messages
1
Reaction score
0
This question asks me to prove a statement regarding linear spans. I have devised a proof but I am not sure if it is substantial enough to prove the statement.

1. Homework Statement

Let L(S) be the subspace spanned by a subset S of a linear space V. Prove that if S is a subset of T and T is a subset of V and if T is a subspace of V, then L(S) is a subspace of T. (This property is described by saying that L(S) is the smallest subspace of V which contains S).

Homework Equations


In part (a) of the question I proved that for S={u1, ..., un}, S is always a subset of L(S).

The Attempt at a Solution


From the definition of the span of S, we know that L(S) is the smallest subspace of V that contains S. Therefore, for any T that is a subset of V such that S is a subset of T, it is clear from the definition of span that L(S) is a subset of T.
Is this proof substantial enough?
 
Physics news on Phys.org
Caroline Fields said:
This question asks me to prove a statement regarding linear spans. I have devised a proof but I am not sure if it is substantial enough to prove the statement.

1. Homework Statement

Let L(S) be the subspace spanned by a subset S of a linear space V. Prove that if S is a subset of T and T is a subset of V and if T is a subspace of V, then L(S) is a subspace of T. (This property is described by saying that L(S) is the smallest subspace of V which contains S).

Homework Equations


In part (a) of the question I proved that for S={u1, ..., un}, S is always a subset of L(S).

The Attempt at a Solution


From the definition of the span of S, we know that L(S) is the smallest subspace of V that contains S. Therefore, for any T that is a subset of V such that S is a subset of T, it is clear from the definition of span that L(S) is a subset of T.
Is this proof substantial enough?
No. Because you don't use the fact that T is a subspace.
You can use the fact that L(S) is the smallest subspace containing S or consider L(T).
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top