Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Lemma 2, printed p. 151 (published PDF).
Statement. If is independent and , there is a unique largest set such that
It is
Proof. At least one eligible set exists, namely . Since is finite, choose an inclusion-maximal eligible set . If is independent for , then cannot lie in , since it would give an independent subset of larger than .
If instead is dependent, no element of can be added to : elements of cannot enlarge an independent set already of size , and cannot by assumption. Hence is maximal independent in , so this union has rank . Maximality of forces . These two observations identify with the displayed set. Every eligible set is contained in it, proving both uniqueness and the largest-set assertion.
Consequence used in the exchange proof. If and is independent of size , then . Indeed, adjoining an element of to cannot increase its independent size, so . The latter set has rank and contains , so the largest-set assertion for gives the opposite inclusion. This argument is part of the same span deduction.