Steinitz Exchange Lemma
   HOME

TheInfoList



OR:

The Steinitz exchange lemma is a basic theorem in
linear algebra Linear algebra is the branch of mathematics concerning linear equations such as :a_1x_1+\cdots +a_nx_n=b, linear maps such as :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matrix (mathemat ...
used, for example, to show that any two bases for a finite- dimensional
vector space In mathematics and physics, a vector space (also called a linear space) is a set (mathematics), set whose elements, often called vector (mathematics and physics), ''vectors'', can be added together and multiplied ("scaled") by numbers called sc ...
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 Saunders Mac Lane (August 4, 1909 – April 14, 2005), born Leslie Saunders MacLane, was an American mathematician who co-founded category theory with Samuel Eilenberg. Early life and education Mac Lane was born in Norwich, Connecticut, near w ...
of Steinitz's lemma to
matroid In combinatorics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid Axiomatic system, axiomatically, the most significant being in terms ...
s.


Statement

Let U and W be finite subsets of a vector space V. If U is a set of
linearly independent In the theory of vector spaces, a set of vectors is said to be if there exists no nontrivial linear combination of the vectors that equals the zero vector. If such a linear combination exists, then the vectors are said to be . These concep ...
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 m \le n, and that after rearranging the w_j if necessary, the set \ 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 \ 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 \ spans V. Since u_\in V, there exist coefficients \mu_1, \ldots, \mu_n such that :u_=\sum_^ \mu_i u_i+\sum_^n \mu_j w_j. At least one of the \mu_j for j \ge m must be non-zero, since otherwise this equality would contradict the linear independence of \; this also shows that indeed m \le n. By reordering \mu_w_,\ldots,\mu_w_n if necessary, we may assume that \mu_ is nonzero. Therefore, we have : w_= \frac\left(u_ - \sum_^ \mu_j u_j - \sum_^n \mu_j w_j\right). In other words, w_ is in the span of \. Since this span contains each of the vectors u_1, \ldots, u_, w_, w_, \ldots, w_n , by the inductive hypothesis it contains V.


Applications

The Steinitz exchange lemma is a basic result in
computational mathematics Computational mathematics is the study of the interaction between mathematics and calculations done by a computer.National Science Foundation, Division of Mathematical ScienceProgram description PD 06-888 Computational Mathematics 2006. Retri ...
, especially in
linear algebra Linear algebra is the branch of mathematics concerning linear equations such as :a_1x_1+\cdots +a_nx_n=b, linear maps such as :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matrix (mathemat ...
and in
combinatorial algorithms An algorithm is fundamentally a set of rules or defined procedures that is typically designed and used to solve a specific problem or a broad set of problems. Broadly, algorithms define process(es), sets of rules, or methodologies that are to be f ...
.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 The Mizar system consists of a formal language for writing mathematical definitions and proofs, a proof assistant, which is able to mechanically check proofs written in this language, and a library of formalized mathematics, which can be used ...
proof: http://mizar.org/version/current/html/vectsp_9.html#T19 Lemmas in linear algebra Matroid theory