So I have come across the following theorem(see below)in my linear algebra notes and am slightly confused. I feel I understand both the statement and the proof, my confusion arises from the fact that for (1) E being minimal(note: with regards to inclusion)amongst generating sets is equivalent to it being a basis. Similarly L being maximal amongst l.i. sets means it is a basis. I guess my question is why has the proof been framed this way and why the need for E and L need to subsets? Why is this a helpful way of proving the c.o.b.?
(A useful variant on the Characterisation of Bases). Let V be a vector space.
(1) If L ⊂ V is a linearly independent subset and E is minimal amongst all generating sets of our vector space with the property that L ⊆ E, then E is a basis.
(2) If E ⊆ V is a generating system and if L is maximal amongst all linearly independent subsets of vector space with the property L ⊆ E, then L is a basis.
PROOF. (1) If E were not a basis, then there would be a non-trivial relation between its vectors λ1⃗v1 + ··· + λr⃗vr = ��0 with r ≥ 1, the ⃗vi ∈ E pairwise distinct, and all λi ̸= 0. Not all the vectors ⃗vi could belong to L because L is linearly independent. Thus there is a ⃗vi belonging to E \ L and it can be written as a linear combination of the other elements of E. But then E \ {⃗vi} is also a generating system that contains L and so E was not minimal.
(2) If L were not a basis, then L could not be a generating set and so there would necessarily be a vector ⃗v ∈ E that didn’t lie in the subspace generated by L. If we add that vector to L then we obtain a bigger linearly independent subset contained in E and so L was not maximal.