Steinitz exchange lemma
{{Short description|Extension of independent vectors to bases}}
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
{{citation|last=Mac Lane|first=Saunders|authorlink=Saunders Mac Lane|year=1936|title=Some interpretations of abstract linear dependence in terms of projective geometry|journal=American Journal of Mathematics|volume=58|pages=236–240|doi=10.2307/2371070| jstor=2371070 | issue=1|publisher=The Johns Hopkins University Press}}.
of Steinitz's lemma to matroids.
{{citation|editor-last=Kung|editor-first=Joseph P. S.|title=A Source Book in Matroid Theory|publisher=Birkhäuser|mr=0890330|isbn=0-8176-3173-9|location=Boston|year=1986|doi=10.1007/978-1-4684-9199-9|url-access=registration|url=https://archive.org/details/sourcebookinmatr0000kung}}.
Statement
Let and be finite subsets of a vector space . If is a set of linearly independent vectors, and spans , then:
1. ;
2. There is a set with such that spans .
Proof
Suppose and . We wish to show that , and that after rearranging the if necessary, the set spans . We proceed by induction on .
For the base case, suppose is zero.
In this case, the claim holds because there are no vectors , and the set spans by hypothesis.
For the inductive step, assume the proposition is true for . By the inductive hypothesis we may reorder the so that spans . Since , there exist coefficients such that
:.
At least one of the for must be non-zero, since otherwise this equality would contradict the linear independence of ; this also shows that indeed By reordering if necessary, we may assume that is nonzero. Therefore, we have
: .
In other words, is in the span of . Since this span contains each of the vectors , by the inductive hypothesis it contains .
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