LA - Proof Involving Linear Independence and Spanning

[MushroomPirat]

Homework Statement

I was trying to prove a theorem from Axler's Linear Algebra text and my proof is different from the one in the book, and I'm wondering if someone can check whether or not my proof works, since I'm just starting to write proofs.

Theorem 2.6 (pg. 25): In a finite-dimensional vector space, the length of every linearly independent list of vectors is less than or equal to the length of every spanning list of vectors.

Homework Equations

The Attempt at a Solution

Let $V$ be a finite-dimensional vector space. Suppose $(u_1,...,u_m)$, where $u_1,...,u_m \in V$ is a list of linearly independent vectors and $(w_1,...,w_n)$ where $w_1,...,w_n \in V$ spans $V$. We need to prove that $m \leq n$. Suppose $m>n$. Because the list $(w_1,...,w_n)$ spans V, there exist scalars $a_{i,j}$ where $i \in [1,m], j \in [1,n]$ such that $u_i=a_{i,1}w_1+...+a_{i,n}w_n$. Thus, the vectors in $(u_1,...,u_m)$ can be replaced by these linear combinations. However, since $m>n$, there exists some $k$ where $m<k\leq n$ such that $u_k$ can be written in terms of $u_1,...,u_{k-1}$, and thus $(u_1,...,u_m)$ is a linearly dependent list, and we have reached a contradiction. Therefore, $m\leq n$.

If someone could please look this over that would be great. Also, I would really like any criticism on my logic or proof writing skills in general since I have learned proofs on my own and no one has really seen my proofs before.

Thanks for your help :)

 

[lanedance]

i think that's looking good and so is the logic ;)

 

[MushroomPirat]

That's good to hear I'm on the right track. Thanks for taking a look at it :)