Steinitz Exchange Lemma

The Steinitz exchange lemma is a basic theorem in linear algebra used, for example, to show that any two bases for a finite-dimensional vector space have the same number of elements. The result is named after the German mathematician Ernst Steinitz. The result is often called the Steinitz–Mac Lane exchange lemma, also recognizing the generalization
by Saunders Mac Lane
of Steinitz's lemma to matroids.

Statement

Let $U$ and $W$ be finite subsets of a vector space $V$. If $U$ is a set of linearly independent vectors, and $W$ spans $V$, then:

1. $, U, \leq , W,$;

2. There is a set $W' \subseteq W$ with $, W', =, W, -, U,$ such that $U \cup W'$ spans $V$.

Proof

Suppose $U=\$ and $W=\$. We wish to show that for each $k \in \$, we have that $k \le n$, and that the set $\$ spans $V$ (where the $w_j$ have possibly been reordered, and the reordering depends on $k$). We proceed by induction on $k$.

For the base case, suppose $k$ is zero.
In this case, the claim holds because there are no vectors $u_i$, and the set $\$ spans $V$ by hypothesis.

For the inductive step, assume the proposition is true for some $k < m$. Since $u_\in V$, and $\$ spans $V$ (by the induction hypothesis), there exist coefficients $\mu_1,\ldots,\mu_n$ such that
:$u_=\sum_^k \mu_j u_j+\sum_^n \mu_j w_j$.
At least one of $\$ must be non-zero, since otherwise this equality would contradict the linear independence of $\$; note that this additionally implies that $k+1 \le n$. By reordering the $\mu_w_,\ldots,\mu_w_n$, we may assume that $\mu_$ is not zero. Therefore, we have
: $w_= \frac\left(u_ - \sum_^k \mu_j u_j - \sum_^n \mu_j w_j\right)$.
In other words, $w_$ is in the span of $\$. The latter span therefore contains each of the vectors $u_1, \ldots, u_k, w_, w_, \ldots, w_n$, and hence must contain the span of these latter vectors as a subset. But since the latter span is $V$ (by the induction hypothesis), this simply means that the span of $\$ contains $V$ as a subset (thus is $V$). We have therefore shown that our claim is true of $k+1$, completing the inductive step.

We have thus shown that for each $k \in \$, we have that $k \le n$, and that the set $\$ spans $V$ (where the $w_j$ have possibly been reordered, and the reordering depends on $k$).

The fact that $m \leq n$ follows from setting $k = m$ in this result.

Applications

The Steinitz exchange lemma is a basic result in computational mathematics, especially in linear algebra and in combinatorial algorithms.Page v in Stiefel:
{{cite book, last=Stiefel, first=Eduard L., authorlink=Eduard Stiefel, title=An introduction to numerical mathematics, url=https://archive.org/details/introductiontonu1963stie, url-access=registration, edition=Translated by Werner C. Rheinboldt & Cornelie J. Rheinboldt from the second German, publisher=Academic Press, location=New York, year=1963, pages=x+286, mr=181077

References

* Julio R. Bastida, ''Field extensions and Galois Theory'', Addison–Wesley Publishing Company (1984).

External links

* Mizar system proof: http://mizar.org/version/current/html/vectsp_9.html#T19

Lemmas in linear algebra
Matroid theory