The Steinitz exchange lemma says that if span a vector space and are linearly independent, then , and after reordering the , the family still spans. Here is a proof. Suppose the first replacements have been made. Express in that spanning family. Some coefficient of a remaining must be nonzero, since otherwise belongs to the span of , contrary to linear independence. Solve for that and replace it by ; this preserves spanning. If , the first replacements leave a spanning family , contradicting linear independence of the first vectors. This proves both assertions.
Now suppose is linearly independent and spans . Express each member of the standard basis using finitely many members of , and let be the finite union of those members. Then spans. No element of can exist, since it would be a linear combination of and violate linear independence. Thus is finite. Applying the Steinitz exchange lemma in both directions to and the standard basis gives and . Hence .
If is linearly independent and has elements, apply the Steinitz exchange lemma with as the independent family and the standard basis as the spanning family. All members of the standard basis are replaced, leaving itself spanning. Thus , so is a basis.
If spans and has elements but is linearly dependent, a nontrivial linear combination equal to zero lets us remove one member without changing the span. This produces spanning vectors, whereas the standard basis contains linearly independent vectors, contradicting the Steinitz exchange lemma. Therefore . Together the three deductions establish that any two of the three properties imply the third. For , the only independent or zero-element family is the empty basis, and the same conclusions hold.
Relative to the given basis , the proposed vectors are the columns of
The determinant is nonzero exactly when the columns form a basis. Thus . At the vectors coincide, and at they are negatives of one another.

Articles by others on the same topic (0)

There are currently no matching articles.