Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 LVL \subseteq V is linearly independent and SVS \subseteq V spans VV with SS finite of size nn, then LL is finite with L=mn|L| = m \le n, and there is TST \subseteq S of size nmn - m such that LTL \cup T spans VV

Statement

Let VV be a vector space over a field FF (Vector space over a field). Let SVS \subseteq V span VV (Linear combination of a finite list, and the span span(S)\operatorname{span}(S) as the smallest linear subspace containing SS) with SS finite, say SnS \approx n for nNn \in \mathbb{N} (Finite, countably infinite, countable, uncountable, Equinumerous sets, ABA \approx B and ABA \preceq B), and let LVL \subseteq V be linearly independent (Linear independence: a finite list v:nVv : n \to V is independent when i<nλivi=0V\sum_{i<n} \lambda_i v_i = 0_V forces every λi=0F\lambda_i = 0_F, and a subset SVS \subseteq V is independent when every injective finite list into SS is independent). Then:

  1. LL is finite, and the unique natural number mm with LmL \approx m (The pigeonhole principle on N\mathbb{N}, claim 3) satisfies mnm \le n;
  2. writing kk for the unique natural number with m+k=nm + k = n, there is TST \subseteq S with TkT \approx k and span(LT)=V\operatorname{span}(L \cup T) = V.

Sizes are compared through equinumerosity throughout; no cardinal number is used or needed, and "X=p|X| = p" below abbreviates XpX \approx p.

Facts & Assumptions

Given: A field FF, a vector space VV over FF, a spanning subset SVS \subseteq V with SnS \approx n, and a linearly independent subset LVL \subseteq V.

[L1]

span(T)\operatorname{span}(T) is a linear subspace of VV containing TT and contained in every linear subspace of VV containing TT; TTT \subseteq T' implies span(T)span(T)\operatorname{span}(T) \subseteq \operatorname{span}(T'); and span(T)\operatorname{span}(T) is exactly the set of linear combinations of finite lists into TT (Linear combination of a finite list, and the span span(S)\operatorname{span}(S) as the smallest linear subspace containing SS, The span is monotone and idempotent, span(S)=S\operatorname{span}(S) = S exactly when SS is a linear subspace, and span(S{0V})=span(S)\operatorname{span}(S \cup \{0_V\}) = \operatorname{span}(S), span(S)\operatorname{span}(S) is exactly the set of linear combinations of finite lists of elements of SS, and span()={0V}\operatorname{span}(\varnothing) = \{0_V\}, Linear subspace of a vector space).

[L2]

span(T)\operatorname{span}(T) is already the set of i<pνixi\sum_{i<p}\nu_i x_i with x:pTx : p \to T injective; and TT is linearly dependent exactly when some tTt \in T lies in span(T{t})\operatorname{span}(T \setminus \{t\}) (A subset SVS \subseteq V is linearly dependent if and only if some sSs \in S lies in span(S{s})\operatorname{span}(S \setminus \{s\}); and span(S)\operatorname{span}(S) is already the set of linear combinations of INJECTIVE finite lists into SS).

[L3]

Finite sums: i<0ui=0V\sum_{i<0}u_i = 0_V and the successor recursion; (F1) an all-0V0_V list sums to 0V0_V; (F3) i<pui=uj+i<pui(j)\sum_{i<p}u_i = u_j + \sum_{i<p}u^{(j)}_i for j<pj < p (The product g0g1gn1g_0 g_1 \cdots g_{n-1} of a finite list in a monoid, by recursion, with the empty product (n=0n = 0) equal to the identity, The sum U+WU + W of two linear subspaces and the sum i<nUi\sum_{i<n} U_i of a finite family).

[L4]

Deleting one index: for k<σ(p)k < \sigma(p) the map δk:pσ(p)\delta_k : p \to \sigma(p) is injective with image σ(p){k}\sigma(p) \setminus \{k\}, and a list u:σ(p)Vu : \sigma(p) \to V with uk=0Vu_k = 0_V satisfies j<σ(p)uj=i<puδk(i)\sum_{j<\sigma(p)}u_j = \sum_{i<p}u_{\delta_k(i)}; also every subset of a linearly independent subset of VV 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 0V0_V, 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)(V,+,0_V) is an abelian group; 0Fy=0V0_F y = 0_V; 1Fy=y1_F y = y; (V4) (λμ)y=λ(μy)(\lambda\mu)y = \lambda(\mu y); a linear subspace is closed under ++, under scalar multiplication and under additive inverses; and every λ0F\lambda \ne 0_F in FF has an inverse (Vector space over a field, In any vector space 0Fv=0V0_F v = 0_V, λ0V=0V\lambda 0_V = 0_V, (λ)v=(λv)(-\lambda)v = -(\lambda v), (1F)v=v(-1_F)v = -v, and λv=0V\lambda v = 0_V forces λ=0F\lambda = 0_F or v=0Vv = 0_V, Field, Linear subspace of a vector space).

[L6]

Naturals: σ(p)=p{p}\sigma(p) = p \cup \{p\} with ppp \notin p; mp    k (m+k=p)m \le p \iff \exists k\ (m + k = p); m+k=m+km + k = m + k' forces k=kk = k'; σ(m)+k=σ(m+k)\sigma(m) + k = \sigma(m+k); addition is commutative with 0+p=p0 + p = p; \le is a total order; every p0p \ne 0 is a successor; and m<p    σ(m)pm < p \iff \sigma(m) \le p (The natural numbers N\mathbb{N} (von Neumann), On N\mathbb{N} the order is membership: m<n    mnm < n \iff m \in n, Order on the natural numbers, Addition of natural numbers, Addition is cancellative, Left successor law for addition, Addition is commutative, \le is a linear order on N\mathbb{N}, Every nonzero natural number is a successor, Discreteness: σ(n)\sigma(n) is the immediate successor).

[L7]

Induction on N\mathbb{N} (The principle of mathematical induction).

[L8]

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

Proof

technique · direct
1.1

Removing one element from a finite set. Let Xσ(p)X \approx \sigma(p) and xXx \in X; then X{x}pX \setminus \{x\} \approx p. Take a bijection g:σ(p)Xg : \sigma(p) \to X and let cc be the unique index with g(c)=xg(c) = x. The map τ:σ(p)σ(p)\tau : \sigma(p) \to \sigma(p) with τ(c)=p\tau(c) = p, τ(p)=c\tau(p) = c and τ(i)=i\tau(i) = i for i{c,p}i \notin \{c,p\} is well defined, the clauses agreeing when c=pc = p, and satisfies ττ=id\tau \circ \tau = \mathrm{id}, so it is a bijection. Then h:=gτh := g \circ \tau is a bijection σ(p)X\sigma(p) \to X with h(p)=xh(p) = x, and its restriction to pp is a bijection onto X{x}X \setminus \{x\}: it is injective; its values differ from xx, since hh is injective and h(p)=xh(p) = x; and every yX{x}y \in X \setminus \{x\} is h(i)h(i) for some iσ(p)i \in \sigma(p) with ipi \ne p, that is i<pi < p.

L6L8
1.2

Extending an injective list by one value. Let AA be a set, f:pAf : p \to A injective and yAf[p]y \in A \setminus f[p]. Since σ(p)=p{p}\sigma(p) = p \cup \{p\} and ppp \notin p, there is exactly one f:σ(p)Af' : \sigma(p) \to A with f(i)=f(i)f'(i) = f(i) for i<pi < p and f(p)=yf'(p) = y, and ff' is injective because ff is and yy is not a value of ff.

L6L8
1.3

The exchange step. Let LVL' \subseteq V be linearly independent, TST \subseteq S, span(LT)=V\operatorname{span}(L' \cup T) = V, and wVw \in V with wspan(L)w \notin \operatorname{span}(L'). Then there is tTt \in T with tLt \notin L' and span((L{w})(T{t}))=V\operatorname{span}\bigl((L' \cup \{w\}) \cup (T \setminus \{t\})\bigr) = V. Indeed wspan(LT)w \in \operatorname{span}(L' \cup T), so w=i<pνixiw = \sum_{i<p}\nu_i x_i for some injective x:pLTx : p \to L' \cup T and ν:pF\nu : p \to F. Some i0<pi_0 < p has xi0Lx_{i_0} \notin L' and νi00F\nu_{i_0} \ne 0_F: otherwise νi=0F\nu_i = 0_F whenever xiLx_i \notin L', and then, if L=L' = \varnothing, every term νixi\nu_i x_i is 0Fxi=0V0_F x_i = 0_V and (F1) gives w=0Vspan(L)w = 0_V \in \operatorname{span}(L'), while if LL' \ne \varnothing we may fix aLa \in L' and put xi:=xix'_i := x_i when xiLx_i \in L' and xi:=ax'_i := a otherwise, so that νixi=νixi\nu_i x'_i = \nu_i x_i for every ii, both being 0V0_V in the second case, and w=i<pνixispan(L)w = \sum_{i<p}\nu_i x'_i \in \operatorname{span}(L'); either way wspan(L)w \in \operatorname{span}(L'), contrary to hypothesis. Put t:=xi0t := x_{i_0}, which lies in TT and not in LL', and put U:=(L{w})(T{t})U := (L' \cup \{w\}) \cup (T \setminus \{t\}); since tLt \notin L' we have (LT){t}=L(T{t})U(L' \cup T) \setminus \{t\} = L' \cup (T \setminus \{t\}) \subseteq U. Now (F3) at i0i_0 gives w=νi0t+Rw = \nu_{i_0}t + R with R=i<pνixiR = \sum_{i<p}\nu'_i x_i, where νi0:=0F\nu'_{i_0} := 0_F and νi:=νi\nu'_i := \nu_i otherwise; the list iνixii \mapsto \nu'_i x_i has the value 0V0_V at i0i_0, so deleting that index expresses RR as a linear combination of the xix_i with ii0i \ne i_0, all of which lie in (LT){t}(L' \cup T)\setminus\{t\}, whence Rspan(U)R \in \operatorname{span}(U). Since wUspan(U)w \in U \subseteq \operatorname{span}(U) and span(U)\operatorname{span}(U) is a linear subspace, νi0t=w+(R)span(U)\nu_{i_0}t = w + (-R) \in \operatorname{span}(U) and therefore t=νi01(νi0t)span(U)t = \nu_{i_0}^{-1}(\nu_{i_0}t) \in \operatorname{span}(U). Hence span(U)\operatorname{span}(U) contains L(T{t})L' \cup (T\setminus\{t\}) together with tt, that is all of LTL' \cup T, so it contains span(LT)=V\operatorname{span}(L' \cup T) = V by minimality of the span.

L1L2L3L4L5
2.1

The exchange induction. For every mNm \in \mathbb{N}: if LVL' \subseteq V is linearly independent with LmL' \approx m, then mnm \le n and there is TST \subseteq S with TkT \approx k, where kk is the unique natural with m+k=nm + k = n, and span(LT)=V\operatorname{span}(L' \cup T) = V. By induction on mm. At m=0m = 0 we have L=L' = \varnothing, since \varnothing is the only set equinumerous with 00; take T:=ST := S, note 0+n=n0 + n = n so k=nk = n, and span(S)=span(S)=V\operatorname{span}(\varnothing \cup S) = \operatorname{span}(S) = V; and 0n0 \le n. Assume the statement at mm and let LL'' be independent with Lσ(m)L'' \approx \sigma(m). Then LL'' \ne \varnothing, so fix wLw \in L'' and put L:=L{w}L' := L'' \setminus \{w\}, which is independent and, by step 1.1, satisfies LmL' \approx m. The inductive hypothesis gives mnm \le n, the unique kk with m+k=nm + k = n, and TST \subseteq S with TkT \approx k and span(LT)=V\operatorname{span}(L' \cup T) = V. Moreover wspan(L)w \notin \operatorname{span}(L'): otherwise wspan(L{w})w \in \operatorname{span}(L'' \setminus \{w\}) would make LL'' dependent. So step 1.3 supplies tTt \in T with tLt \notin L' and span(L(T{t}))=V\operatorname{span}(L'' \cup (T \setminus \{t\})) = V, using L{w}=LL' \cup \{w\} = L''. Since tTt \in T we have k0k \ne 0, say k=σ(k)k = \sigma(k'), and step 1.1 gives T{t}kT \setminus \{t\} \approx k'; finally σ(m)+k=σ(m+k)=m+σ(k)=m+k=n\sigma(m) + k' = \sigma(m + k') = m + \sigma(k') = m + k = n, so σ(m)n\sigma(m) \le n and kk' is the unique natural with σ(m)+k=n\sigma(m) + k' = n. Taking T{t}ST \setminus \{t\} \subseteq S completes the inductive step.

step 1.1step 1.3L1L2L4L6L7L8
3.1

LL is finite. Suppose not. Then for every pNp \in \mathbb{N} there is an injection pLp \to L: at p=0p = 0 the empty function serves, and given an injective f:pLf : p \to L, the image f[p]f[p] cannot be all of LL, since LpL \approx p would make LL finite, so some yLf[p]y \in L \setminus f[p] exists and step 1.2 extends ff to an injection σ(p)L\sigma(p) \to L. Take p:=σ(n)p := \sigma(n) and an injection f:σ(n)Lf : \sigma(n) \to L; its image f[σ(n)]f[\sigma(n)] is a subset of LL, hence independent, and f[σ(n)]σ(n)f[\sigma(n)] \approx \sigma(n). Step 2.1 applied to it gives σ(n)n\sigma(n) \le n, while n<σ(n)n < \sigma(n), so n<nn < n, which is impossible. Hence LL is finite.

step 1.2step 2.1L4L6L7L8
4.1

By step 3.1 the set LL is finite, so there is exactly one mNm \in \mathbb{N} with LmL \approx m, and step 2.1 applied to LL gives mnm \le n together with TST \subseteq S satisfying TkT \approx k for the unique kk with m+k=nm + k = n and span(LT)=V\operatorname{span}(L \cup 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 LL is brought in and a vector of TT is thrown out, the thrown-out one being chosen so that the spanning property survives; the bound mnm \le n falls out because TT cannot run out before LL does. The hypothesis that LL is independent is used exactly once per stage, to know that the newly brought-in ww is not already in the span of what has been brought in so far.

  • Finiteness of LL is proved, not assumed. The argument in step 3.1 builds an injection σ(n)L\sigma(n) \to L from the assumption that LL 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\sigma(n) \le n.

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

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 69 results over 24 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources