Proof sketch: by induction on the length, a dependent spanning family has a vector in the span of the preceding ones, which can be dropped without changing the span.
Routine facts about equality of tuples are used without comment (Toolkit for AL2). We prove the claim by induction on (Induction on ββ from 0 for a Condition Expressed by a Predicative Formula (ii)), for all spanning -tuples at once: the statement proved for is that (i) holds for every -tuple in that spans . In both the base case and the induction step, a spanning family that is linearly independent is itself a basis (Finite Basis of a Vector Space (i)), and we may take and .
For this always applies: the empty family is linearly independent by Elementary Properties of Linear Independence (vi), so, as it spans , it is a basis, and we take and the empty map.
For the induction step, assume the claim for , and let span . By the remark above we may assume that is linearly dependent. Then Elementary Properties of Linear Independence (iv) gives with . Let be the -tuple of the other vectors of , as in Dropping a Redundant Vector Does Not Change the Span. For we have (Bijections between Intervals: the Gap Map and the Reversal (i)), so ; hence by The Span of a Finite Family is the Smallest Subspace Containing It (ii) and The Span of a Finite Family is the Smallest Subspace Containing It (iii). Therefore , and by Dropping a Redundant Vector Does Not Change the Span (i) the -tuple spans .
The induction hypothesis, applied to , gives and a map , strictly increasing in the sense of (i), such that is a basis of . Put . It is strictly increasing because is, by its definition in Bijections between Intervals: the Gap Map and the Reversal (i), and for every , so is that same basis; and . This completes the induction and proves (i).
Loadingβ¦