Wiki
Wiki

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 II is independent and I⊆AI\subseteq A, there is a unique largest set SS such that

I⊆S⊆A,r(S)=∣I∣.I\subseteq S\subseteq A,\qquad r(S)=|I|.

It is

sp⁡A(I)=I∪{e∈A∖I:I∪{e} is dependent}.\operatorname{sp}_A(I) =I\cup\{e\in A\setminus I:I\cup\{e\}\text{ is dependent}\}.

Proof. At least one eligible set exists, namely II. Since AA is finite, choose an inclusion-maximal eligible set SS. If I∪{e}I\cup\{e\} is independent for e∈A∖Ie\in A\setminus I, then ee cannot lie in SS, since it would give an independent subset of SS larger than r(S)=∣I∣r(S)=|I|.

If instead I∪{e}I\cup\{e\} is dependent, no element of (S∪{e})∖I(S\cup\{e\})\setminus I can be added to II: elements of SS cannot enlarge an independent set already of size r(S)r(S), and ee cannot by assumption. Hence II is maximal independent in S∪{e}S\cup\{e\}, so this union has rank ∣I∣|I|. Maximality of SS forces e∈Se\in S. These two observations identify SS 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 S=sp⁡A(I)S=\operatorname{sp}_A(I) and I′⊆SI'\subseteq S is independent of size ∣I∣|I|, then sp⁡A(I′)=S\operatorname{sp}_A(I')=S. Indeed, adjoining an element of SS to I′I' cannot increase its independent size, so S⊆sp⁡A(I′)S\subseteq\operatorname{sp}_A(I'). The latter set has rank ∣I∣|I| and contains II, so the largest-set assertion for II gives the opposite inclusion. This argument is part of the same span deduction. □\square