Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Steinitz exchange lemma: if L⊆V is linearly independent and S⊆V spans V with S finite of size n, then L is finite with ∣L∣=m≤n, and there is T⊆S of size n−m such that L∪T spans V

Statement

Let V be a vector space over a field F (Vector space over a field). Let S⊆V span V (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S) with S finite, say S≈n for n∈N (Finite, countably infinite, countable, uncountable, Equinumerous sets, A≈B and A⪯B), and let L⊆V be linearly independent (Linear independence: a finite list v:n→V is independent when ∑i<nλivi=0V forces every λi=0F, and a subset S⊆V is independent when every injective finite list into S is independent). Then:

  1. L is finite, and the unique natural number m with L≈m (The pigeonhole principle on N, claim 3) satisfies m≤n;
  2. writing k for the unique natural number with m+k=n, there is T⊆S with T≈k and span⁡(L∪T)=V.

Sizes are compared through equinumerosity throughout; no cardinal number is used or needed, and "∣X∣=p" below abbreviates X≈p.

Facts & Assumptions

Given: A field F, a vector space V over F, a spanning subset S⊆V with S≈n, and a linearly independent subset L⊆V.

[L1]

span⁡(T) is a linear subspace of V containing T and contained in every linear subspace of V containing T; T⊆T′ implies span⁡(T)⊆span⁡(T′); and span⁡(T) is exactly the set of linear combinations of finite lists into T (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S, The span is monotone and idempotent, span⁡(S)=S exactly when S is a linear subspace, and span⁡(S∪{0V})=span⁡(S), span⁡(S) is exactly the set of linear combinations of finite lists of elements of S, and span⁡(∅)={0V}, Linear subspace of a vector space).

[L2]

span⁡(T) is already the set of ∑i<pνixi with x:p→T injective; and T is linearly dependent exactly when some t∈T lies in span⁡(T∖{t}) (A subset S⊆V is linearly dependent if and only if some s∈S lies in span⁡(S∖{s}); and span⁡(S) is already the set of linear combinations of INJECTIVE finite lists into S).

[L3]

Finite sums: ∑i<0ui=0V and the successor recursion; (F1) an all-0V list sums to 0V; (F3) ∑i<pui=uj+∑i<pui(j) for j<p (The product g0g1⋯gn−1 of a finite list in a monoid, by recursion, with the empty product (n=0) equal to the identity, The sum U+W of two linear subspaces and the sum ∑i<nUi of a finite family).

[L4]

Deleting one index: for k<σ(p) the map δk:p→σ(p) is injective with image σ(p)∖{k}, and a list u:σ(p)→V with uk=0V satisfies ∑j<σ(p)uj=∑i<puδk(i); also every subset of a linearly independent subset of V is linearly independent (Finite sums re-indexed along an injection, with a zero term deleted, and concatenated; and the closure properties of linear independence: an independent list is injective and never 0V, its sublists are independent, a list is independent exactly when it is injective with linearly independent image, and every subset of a linearly independent set is linearly independent, claims 2 and 7).

[L5]

(V,+,0V) is an abelian group; 0Fy=0V; 1Fy=y; (V4) (λμ)y=λ(μy); a linear subspace is closed under +, under scalar multiplication and under additive inverses; and every λ≠0F in F has an inverse (Vector space over a field, In any vector space 0Fv=0V, λ0V=0V, (−λ)v=−(λv), (−1F)v=−v, and λv=0V forces λ=0F or v=0V, Field, Linear subspace of a vector space).

[L6]

Naturals: σ(p)=p∪{p} with p∉p; m≤p  ⟺  ∃k (m+k=p); m+k=m+k′ forces k=k′; σ(m)+k=σ(m+k); addition is commutative with 0+p=p; ≤ is a total order; every p≠0 is a successor; and m<p  ⟺  σ(m)≤p (The natural numbers N (von Neumann), On N the order is membership: m<n  ⟺  m∈n, Order on the natural numbers, Addition of natural numbers, Addition is cancellative, Left successor law for addition, Addition is commutative, ≤ is a linear order on N, Every nonzero natural number is a successor, Discreteness: σ(n) is the immediate successor).

[L8]

A finite set is equinumerous with exactly one natural number (The pigeonhole principle on N, claim 3); X≈Y means a bijection exists; a composite of bijections is a bijection; an injection is a bijection onto its image (Equinumerous sets, A≈B and A⪯B, Injection, surjection, bijection, Finite, countably infinite, countable, uncountable).

Proof

technique · direct
1.1

Removing one element from a finite set. Let X≈σ(p) and x∈X; then X∖{x}≈p. Take a bijection g:σ(p)→X and let c be the unique index with g(c)=x. The map τ:σ(p)→σ(p) with τ(c)=p, τ(p)=c and τ(i)=i for i∉{c,p} is well defined, the clauses agreeing when c=p, and satisfies τ∘τ=id, so it is a bijection. Then h:=g∘τ is a bijection σ(p)→X with h(p)=x, and its restriction to p is a bijection onto X∖{x}: it is injective; its values differ from x, since h is injective and h(p)=x; and every y∈X∖{x} is h(i) for some i∈σ(p) with i≠p, that is i<p.

L6L8
1.2

Extending an injective list by one value. Let A be a set, f:p→A injective and y∈A∖f[p]. Since σ(p)=p∪{p} and p∉p, there is exactly one f′:σ(p)→A with f′(i)=f(i) for i<p and f′(p)=y, and f′ is injective because f is and y is not a value of f.

L6L8
1.3

The exchange step. Let L′⊆V be linearly independent, T⊆S, span⁡(L′∪T)=V, and w∈V with w∉span⁡(L′). Then there is t∈T with t∉L′ and span⁡((L′∪{w})∪(T∖{t}))=V. Indeed w∈span⁡(L′∪T), so w=∑i<pνixi for some injective x:p→L′∪T and ν:p→F. Some i0<p has xi0∉L′ and νi0≠0F: otherwise νi=0F whenever xi∉L′, and then, if L′=∅, every term νixi is 0Fxi=0V and (F1) gives w=0V∈span⁡(L′), while if L′≠∅ we may fix a∈L′ and put xi′:=xi when xi∈L′ and xi′:=a otherwise, so that νixi′=νixi for every i, both being 0V in the second case, and w=∑i<pνixi′∈span⁡(L′); either way w∈span⁡(L′), contrary to hypothesis. Put t:=xi0, which lies in T and not in L′, and put U:=(L′∪{w})∪(T∖{t}); since t∉L′ we have (L′∪T)∖{t}=L′∪(T∖{t})⊆U. Now (F3) at i0 gives w=νi0t+R with R=∑i<pνi′xi, where νi0′:=0F and νi′:=νi otherwise; the list i↦νi′xi has the value 0V at i0, so deleting that index expresses R as a linear combination of the xi with i≠i0, all of which lie in (L′∪T)∖{t}, whence R∈span⁡(U). Since w∈U⊆span⁡(U) and span⁡(U) is a linear subspace, νi0t=w+(−R)∈span⁡(U) and therefore t=νi0−1(νi0t)∈span⁡(U). Hence span⁡(U) contains L′∪(T∖{t}) together with t, that is all of L′∪T, so it contains span⁡(L′∪T)=V by minimality of the span.

L1L2L3L4L5
2.1

The exchange induction. For every m∈N: if L′⊆V is linearly independent with L′≈m, then m≤n and there is T⊆S with T≈k, where k is the unique natural with m+k=n, and span⁡(L′∪T)=V. By induction on m. At m=0 we have L′=∅, since ∅ is the only set equinumerous with 0; take T:=S, note 0+n=n so k=n, and span⁡(∅∪S)=span⁡(S)=V; and 0≤n. Assume the statement at m and let L′′ be independent with L′′≈σ(m). Then L′′≠∅, so fix w∈L′′ and put L′:=L′′∖{w}, which is independent and, by step 1.1, satisfies L′≈m. The inductive hypothesis gives m≤n, the unique k with m+k=n, and T⊆S with T≈k and span⁡(L′∪T)=V. Moreover w∉span⁡(L′): otherwise w∈span⁡(L′′∖{w}) would make L′′ dependent. So step 1.3 supplies t∈T with t∉L′ and span⁡(L′′∪(T∖{t}))=V, using L′∪{w}=L′′. Since t∈T we have k≠0, say k=σ(k′), and step 1.1 gives T∖{t}≈k′; finally σ(m)+k′=σ(m+k′)=m+σ(k′)=m+k=n, so σ(m)≤n and k′ is the unique natural with σ(m)+k′=n. Taking T∖{t}⊆S completes the inductive step.

step 1.1step 1.3L1L2L4L6L7L8
3.1

L is finite. Suppose not. Then for every p∈N there is an injection p→L: at p=0 the empty function serves, and given an injective f:p→L, the image f[p] cannot be all of L, since L≈p would make L finite, so some y∈L∖f[p] exists and step 1.2 extends f to an injection σ(p)→L. Take p:=σ(n) and an injection f:σ(n)→L; its image f[σ(n)] is a subset of L, hence independent, and f[σ(n)]≈σ(n). Step 2.1 applied to it gives σ(n)≤n, while n<σ(n), so n<n, which is impossible. Hence L is finite.

step 1.2step 2.1L4L6L7L8
4.1

By step 3.1 the set L is finite, so there is exactly one m∈N with L≈m, and step 2.1 applied to L gives m≤n together with T⊆S satisfying T≈k for the unique k with m+k=n and span⁡(L∪T)=V; these are claims 1 and 2.

step 2.1step 3.1L8∎

Remarks

  • What the induction actually exchanges. At each stage a vector of L is brought in and a vector of T is thrown out, the thrown-out one being chosen so that the spanning property survives; the bound m≤n falls out because T cannot run out before L does. The hypothesis that L is independent is used exactly once per stage, to know that the newly brought-in w is not already in the span of what has been brought in so far.

  • Finiteness of L is proved, not assumed. The argument in step 3.1 builds an injection σ(n)→L from the assumption that L is not finite, one index at a time; this is an induction on the statement that such an injection exists, so it selects nothing globally and uses no choice principle. The conclusion is then the contradiction σ(n)≤n.

  • Sizes are equinumerosity classes, not cardinals. "∣L∣=m" abbreviates L≈m, and it is well posed because a finite set is equinumerous with exactly one natural number (The pigeonhole principle on N). Nothing above needs a theory of cardinal numbers, and nothing above says anything about infinite S.

Depends on

Used by

Dependency tree · two levels

56 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources