Steinitz exchange lemma explained

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^[1] by Saunders Mac Laneof Steinitz's lemma to matroids.^[2]

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 = \{u _{1,} ... , u _{m\}} and W = \{w _{1,} ... , w _{n\}} . We wish to show that m \le n , and that after rearranging the w _{j} if necessary, the set \{u _{1,} ... c, u _{m,} w _{m} , ... c, w _{n\}} spans V . We proceed by induction on m .

For the base case, suppose

m is zero.In this case, the claim holds because there are no vectors u _{i} , and the set \{w _{1,} ... c, w _{n\}} spans V by hypothesis.

For the inductive step, assume the proposition is true for

m -1 . By the inductive hypothesis we may reorder the w _{i} so that \{ u _{1,\ldots,} u _{m-1} ,w _{m} ,\ldots,w _{n\}} spans V . Since u _{m} \in V , there exist coefficients \mu _{1,} \ldots, \mu _{n} such thatu _{m} = \sum ^{m -1} _{i =1} \mu _{i} u _{i+\sum} ^{n} ^{j = m} \mu _{j} w _{j} .At least one of the \mu _{j} must be non-zero, since otherwise this equality would contradict the linear independence of \{ u _{1,\ldots,u} _{m} \} ; it follows that m \le n . By reordering \mu _{m} w _{m} ,\ldots,\mu _{n} w _{n} if necessary, we may assume that \mu _{m} is nonzero. Therefore, we havew _{m} = (1)/(\mu _{m}) \left(u _{m} - \sum ^{m -1} _{j =1} \mu _{j} u _{j} - \sum ^{n} _{j = m +1} \mu _{j} w _{j\right)} .In other words, w _{m} is in the span of \{ u _{1,\ldots,} u _{m} ,w _{m+1} ,\ldots,w _{n\}} . Since this span contains each of the vectors u _{1,} \ldots, u _{m-1} , w _{m} , w _{m+1} , \ldots, w _{n} , by the inductive hypothesis it contains V .

Applications

The Steinitz exchange lemma is a basic result in computational mathematics, especially in linear algebra and in combinatorial algorithms.^[3]

References

1. .
2. .
3. Page v in Stiefel:Book: Stiefel, Eduard L.. Eduard Stiefel

   . Eduard Stiefel. An introduction to numerical mathematics. registration. Translated by Werner C. Rheinboldt & Cornelie J. Rheinboldt from the second German. Academic Press. New York. 1963. x+286. 181077.

• 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