TheoremBase

Proof sketch: linear combinations are closed under sums and scalar multiples, each vector of the family is a combination with one coefficient 1, and a subspace containing the vectors contains every combination by induction on the length.

Proof

Routine facts about tuples built termwise or with one distinguished component, and about nonempty segments, are used without comment (Toolkit for AL2). We first establish the four identities of (i). The first follows from Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (v), which combines the two sums term by term, together with Ξ»ivi+ΞΌivi=(Ξ»i+ΞΌi)vi\lambda_{i}v_{i}+\mu_{i}v_{i}=(\lambda_{i}+\mu_{i})v_{i} (Vector Space over a Field (viii)). For the second, the map x↦cxx\mapsto cx on VV is additive by Vector Space over a Field (vii) and fixes 0V0_{V} by Elementary Identities in a Vector Space (iii), so Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (vi) moves it inside the sum, and c(Ξ»ivi)=(cΞ»i)vic(\lambda_{i}v_{i})=(c\lambda_{i})v_{i} by Vector Space over a Field (v). For the third, uβˆ’w=u+(βˆ’1)wu-w=u+(-1)w by The Zero Vector, Negatives and Differences in a Vector Space (iii) and Elementary Identities in a Vector Space (iv), so the first two identities give

βˆ‘i=1nΞ»iviβˆ’βˆ‘i=1nΞΌivi=βˆ‘i=1nΞ»ivi+βˆ‘i=1n(βˆ’ΞΌi)vi=βˆ‘i=1n(Ξ»iβˆ’ΞΌi)vi.\sum_{i=1}^{n}\lambda_{i}v_{i}-\sum_{i=1}^{n}\mu_{i}v_{i}=\sum_{i=1}^{n}\lambda_{i}v_{i}+\sum_{i=1}^{n}(-\mu_{i})v_{i}=\sum_{i=1}^{n}(\lambda_{i}-\mu_{i})v_{i}.

For the fourth, each term is 0 vi=0V0\,v_{i}=0_{V} by Elementary Identities in a Vector Space (ii), and a sum of zero vectors is 0V0_{V}, by Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (vi) for the constant map on VV with value 0V0_{V} (for n=0n=0 this is Span of a Finite Family; Spanning Families (i)). This proves (i).

By the fourth identity, 0V0_{V} is a linear combination of vv and so lies in span⁑(v1,…,vn)\operatorname{span}(v_{1},\dots,v_{n}); by the first two, sums and scalar multiples of linear combinations of vv are again linear combinations of vv. So the span is a linear subspace of VV by Linear Subspaces (i).

Now let j∈[n]j\in[n], so that nβ‰₯1n\geq1, and take the coefficients Ξ»j=1\lambda_{j}=1 and Ξ»i=0\lambda_{i}=0 for iβ‰ ji\neq j. By Iterated Operations over an Interval: Extracting One Term and Reversing the Order (i), applied with nβˆ’1n-1 in place of nn and with the gap map gj:[nβˆ’1]β†’[n]g_{j}:[n-1]\to[n] of Bijections between Intervals: the Gap Map and the Reversal (i),

βˆ‘i=1nΞ»ivi=βˆ‘k=1nβˆ’10 vgj(k)+1vj=0V+vj=vj,\sum_{i=1}^{n}\lambda_{i}v_{i}=\sum_{k=1}^{n-1}0\,v_{g_{j}(k)}+1v_{j}=0_{V}+v_{j}=v_{j},

where the second equality uses the fourth identity of (i) for the (nβˆ’1)(n-1)-tuple (vgj(1),…,vgj(nβˆ’1))(v_{g_{j}(1)},\dots,v_{g_{j}(n-1)}) and Vector Space over a Field (vi), and the third uses The Zero Vector, Negatives and Differences in a Vector Space (i). So vj∈span⁑(v1,…,vn)v_{j}\in\operatorname{span}(v_{1},\dots,v_{n}), and with the previous paragraph this proves (ii).

For (iii), let WW be a linear subspace of VV containing every vjv_{j}, and let (Ξ»1,…,Ξ»n)∈Kn(\lambda_{1},\dots,\lambda_{n})\in K^{n}. Since WW contains 0V0_{V} and is closed under addition and scalar multiplication (Linear Subspaces (i)), each Ξ»ivi\lambda_{i}v_{i} lies in WW. We show by induction on k∈N0k\in\mathbb{N}_{0} (Induction on β„•β‚€ from 0 for a Condition Expressed by a Predicative Formula (ii)) that, if k≀nk\leq n, the partial sum βˆ‘i=1kΞ»ivi\sum_{i=1}^{k}\lambda_{i}v_{i} lies in WW. For k=0k=0 it is 0V0_{V} by Span of a Finite Family; Spanning Families (i). If the claim holds for kk and k+1≀nk+1\leq n, then by Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (vii)

βˆ‘i=1k+1Ξ»ivi=βˆ‘i=1kΞ»ivi+Ξ»k+1vk+1,\sum_{i=1}^{k+1}\lambda_{i}v_{i}=\sum_{i=1}^{k}\lambda_{i}v_{i}+\lambda_{k+1}v_{k+1},

a sum of two vectors of WW, which lies in WW. Taking k=nk=n, every linear combination of vv lies in WW, so span⁑(v1,…,vn)βŠ†W\operatorname{span}(v_{1},\dots,v_{n})\subseteq W. This proves (iii).

Finally, if n=0n=0, the set K0K^{0} consists of the empty map alone (Tuples in a Set: the Set of n-Tuples and Their Components (ii)), and the corresponding sum is 0V0_{V} (Span of a Finite Family; Spanning Families (i)). So span⁑(v1,…,vn)={0V}\operatorname{span}(v_{1},\dots,v_{n})=\{0_{V}\}, which is (iv).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…