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 is linearly independent and spans with finite of size , then is finite with , and there is of size such that spans
Statement
Let be a vector space over a field (Vector space over a field). Let span (Linear combination of a finite list, and the span as the smallest linear subspace containing ) with finite, say for (Finite, countably infinite, countable, uncountable, Equinumerous sets, and ), and let be linearly independent (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent). Then:
- is finite, and the unique natural number with (The pigeonhole principle on , claim 3) satisfies ;
- writing for the unique natural number with , there is with and .
Sizes are compared through equinumerosity throughout; no cardinal number is used or needed, and "" below abbreviates .
Facts & Assumptions
Given: A field , a vector space over , a spanning subset with , and a linearly independent subset .
is a linear subspace of containing and contained in every linear subspace of containing ; implies ; and is exactly the set of linear combinations of finite lists into (Linear combination of a finite list, and the span as the smallest linear subspace containing , The span is monotone and idempotent, exactly when is a linear subspace, and , is exactly the set of linear combinations of finite lists of elements of , and , Linear subspace of a vector space).
is already the set of with injective; and is linearly dependent exactly when some lies in (A subset is linearly dependent if and only if some lies in ; and is already the set of linear combinations of INJECTIVE finite lists into ).
Finite sums: and the successor recursion; (F1) an all- list sums to ; (F3) for (The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity, The sum of two linear subspaces and the sum of a finite family).
Deleting one index: for the map is injective with image , and a list with satisfies ; also every subset of a linearly independent subset of 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 , 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).
is an abelian group; ; ; (V4) ; a linear subspace is closed under , under scalar multiplication and under additive inverses; and every in has an inverse (Vector space over a field, In any vector space , , , , and forces or , Field, Linear subspace of a vector space).
Naturals: with ; ; forces ; ; addition is commutative with ; is a total order; every is a successor; and (The natural numbers (von Neumann), On the order is membership: , 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 , Every nonzero natural number is a successor, Discreteness: is the immediate successor).
Induction on (The principle of mathematical induction).
A finite set is equinumerous with exactly one natural number (The pigeonhole principle on , claim 3); means a bijection exists; a composite of bijections is a bijection; an injection is a bijection onto its image (Equinumerous sets, and , Injection, surjection, bijection, Finite, countably infinite, countable, uncountable).
Proof
Removing one element from a finite set. Let and ; then . Take a bijection and let be the unique index with . The map with , and for is well defined, the clauses agreeing when , and satisfies , so it is a bijection. Then is a bijection with , and its restriction to is a bijection onto : it is injective; its values differ from , since is injective and ; and every is for some with , that is .
Extending an injective list by one value. Let be a set, injective and . Since and , there is exactly one with for and , and is injective because is and is not a value of .
The exchange step. Let be linearly independent, , , and with . Then there is with and . Indeed , so for some injective and . Some has and : otherwise whenever , and then, if , every term is and (F1) gives , while if we may fix and put when and otherwise, so that for every , both being in the second case, and ; either way , contrary to hypothesis. Put , which lies in and not in , and put ; since we have . Now (F3) at gives with , where and otherwise; the list has the value at , so deleting that index expresses as a linear combination of the with , all of which lie in , whence . Since and is a linear subspace, and therefore . Hence contains together with , that is all of , so it contains by minimality of the span.
The exchange induction. For every : if is linearly independent with , then and there is with , where is the unique natural with , and . By induction on . At we have , since is the only set equinumerous with ; take , note so , and ; and . Assume the statement at and let be independent with . Then , so fix and put , which is independent and, by step 1.1, satisfies . The inductive hypothesis gives , the unique with , and with and . Moreover : otherwise would make dependent. So step 1.3 supplies with and , using . Since we have , say , and step 1.1 gives ; finally , so and is the unique natural with . Taking completes the inductive step.
is finite. Suppose not. Then for every there is an injection : at the empty function serves, and given an injective , the image cannot be all of , since would make finite, so some exists and step 1.2 extends to an injection . Take and an injection ; its image is a subset of , hence independent, and . Step 2.1 applied to it gives , while , so , which is impossible. Hence is finite.
By step 3.1 the set is finite, so there is exactly one with , and step 2.1 applied to gives together with satisfying for the unique with and ; these are claims 1 and 2.
Remarks
-
What the induction actually exchanges. At each stage a vector of is brought in and a vector of is thrown out, the thrown-out one being chosen so that the spanning property survives; the bound falls out because cannot run out before does. The hypothesis that is independent is used exactly once per stage, to know that the newly brought-in is not already in the span of what has been brought in so far.
-
Finiteness of is proved, not assumed. The argument in step 3.1 builds an injection from the assumption that 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 .
-
Sizes are equinumerosity classes, not cardinals. "" abbreviates , and it is well posed because a finite set is equinumerous with exactly one natural number (The pigeonhole principle on ). Nothing above needs a theory of cardinal numbers, and nothing above says anything about infinite .
Depends on
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is 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 $0_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
- A subset $S \subseteq V$ is linearly dependent if and only if some $s \in S$ lies in $\operatorname{span}(S \setminus \{s\})$; and $\operatorname{span}(S)$ is already the set of linear combinations of INJECTIVE finite lists into $S$
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- $\operatorname{span}(S)$ is exactly the set of linear combinations of finite lists of elements of $S$, and $\operatorname{span}(\varnothing) = \{0_V\}$
- The span is monotone and idempotent, $\operatorname{span}(S) = S$ exactly when $S$ is a linear subspace, and $\operatorname{span}(S \cup \{0_V\}) = \operatorname{span}(S)$
- Linear subspace of a vector space
- The sum $U + W$ of two linear subspaces and the sum $\sum_{i<n} U_i$ of a finite family
- The product $g_0 g_1 \cdots g_{n-1}$ of a finite list in a monoid, by recursion, with the empty product ($n = 0$) equal to the identity
- Vector space over a field
- Field
- In any vector space $0_F v = 0_V$, $\lambda 0_V = 0_V$, $(-\lambda)v = -(\lambda v)$, $(-1_F)v = -v$, and $\lambda v = 0_V$ forces $\lambda = 0_F$ or $v = 0_V$
- The natural numbers $\mathbb{N}$ (von Neumann)
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
- Order on the natural numbers
- Addition of natural numbers
- The principle of mathematical induction
- Left successor law for addition
- Addition is commutative
- Addition is cancellative
- Every nonzero natural number is a successor
- Discreteness: $\sigma(n)$ is the immediate successor
- $\le$ is a linear order on $\mathbb{N}$
- Finite, countably infinite, countable, uncountable
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Injection, surjection, bijection
- The pigeonhole principle on $\mathbb{N}$
Used by
- If V has a spanning set with n elements, then every linearly independent subset of V is finite with at most n elements; in particular V has no linearly independent subset equinumerous with ℕ Corollary
- If V has a basis with n elements and a basis with m elements then n = m; and if V has one finite basis then every basis of V is finite Theorem
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
- Steinitz exchange lemma (Wikipedia) (standard reference, not scraped)
- S. Axler, Linear Algebra Done Right, 4th ed., Ch. 2 (standard reference, not scraped)
- Western Washington University notes: Bases and the Steinitz exchange lemma (standard reference, not scraped)