2024-08-11

720: For Finite-Dimensional Vectors Space, Subset That Spans Space Can Be Reduced to Be Basis

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that for finite-dimensional vectors space, subset that spans space can be reduced to be basis

Topics


About: vectors space

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any finite-dimensional vectors space, any subset that spans the space can be reduced to be a basis.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
F: { the fields }
V: { the d -dimensional F vectors spaces }
S: V
//

Statements:
vV(S{ the finite subsets of S},rjF(v=vjSrjvj)))

B{ the d -ordered subsets of S}(B{ the bases of V})
//


2: Natural Language Description


For any field, F, any d-dimensional F vectors space, V, and any subset, SV, such that vV(S{ the finite subsets of S},rjF(v=vjSrjvj))), there is a d-ordered subset, BS, that is a basis of V.


3: Proof


Whole Strategy: Step 1: deal with the case, V={0}, and suppose otherwise thereafter; Step 2: choose any nonzero element, e1S; Step 3: choose any another element, e2S{e1}, such that {e1,e2} is linearly independent; Step 4: and so on to get a linearly independent {e1,...,ed}; Step 5: see that {e1,...,ed} is a basis.

Step 1:

Let us suppose that V={0}.

Inevitably, S={0}.

B=S will do.

Let us suppose otherwise hereafter.

Step 2:

Let us choose any nonzero element, e1S. That is possible, because if S={0}, S could not span V.

Step 3:

If 2d, let us choose any another element, e2S{e1}, such that {e1,e2} is linearly independent. That is possible, because otherwise, for each vS{e1}, {e1,v} would be linearly dependent, which would mean that c1e1+c2v=0 would have not-all-zero (c1,c2), but c20, because otherwise, c1e1=0, which would mean that e1=0, a contradiction, so, v=c21c1e1, which would mean that {e1} spanned V and {e1} was a basis, a contradiction against V's being d-dimensional.

Step 4:

And so on, and we get a linearly independent {e1,...,ed}. That is possible, because supposing that we have already chosen a linearly independent {e1,...,ej} for any j<d, we can choose an element, ej+1S{e1,...,ej}, such that {e1,...,ej+1} is linearly independent, because otherwise, for each vS{e1,...,ej}, {e1,...,ej,v} would be linearly dependent, which would mean that c1e1+...+cjej+cj+1v=0 would have not-all-zero (c1,...,cj+1), but cj+10, because otherwise, c1e1+...+cjej=0, which would mean that (c1,...,cj)=(0,...,0), because {e1,...,ej} was linearly independent, a contradiction, so, v=cj+11(c1e1+...+cjej), which would mean that {e1,...,ej} spanned V and {e1,...,ej} was a basis, a contradiction against V's being d-dimensional.

Step 5:

{e1,...,ed} is a basis, by the proposition that for any finite-dimensional vectors space, any linearly independent subset with dimension number of elements is a basis.


References


<The previous article in this series | The table of contents of this series | The next article in this series>