Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedSession-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.

If VV has a spanning set with nn elements, then every linearly independent subset of VV is finite with at most nn elements; in particular VV has no linearly independent subset equinumerous with N\mathbb{N}

Statement

Let VV be a vector space over a field FF (Vector space over a field) and suppose VV has a spanning subset SS (Linear combination of a finite list, and the span span(S)\operatorname{span}(S) as the smallest linear subspace containing SS) with SnS \approx n for some nNn \in \mathbb{N} (Equinumerous sets, ABA \approx B and ABA \preceq B). Then:

  1. every linearly independent subset LVL \subseteq V (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) is finite (Finite, countably infinite, countable, uncountable), and the unique mNm \in \mathbb{N} with LmL \approx m satisfies mnm \le n;
  2. no linearly independent subset of VV is equinumerous with N\mathbb{N}.

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.

[L2]

A finite set is equinumerous with exactly one natural number, and N≉p\mathbb{N} \not\approx p for every pNp \in \mathbb{N} (The pigeonhole principle on N\mathbb{N}, claims 3 and 4).

[L3]

\approx is symmetric and transitive, being carried by bijections; and a set is finite when it is equinumerous with some natural number (Equinumerous sets, ABA \approx B and ABA \preceq B, Injection, surjection, bijection, Finite, countably infinite, countable, uncountable, The natural numbers N\mathbb{N} (von Neumann), Order on the natural numbers).

Proof

technique · direct
1.1

Claim 1 is exactly claim 1 of the Steinitz exchange lemma, whose hypotheses are the ones assumed here: SS spans VV and is finite of size nn, and LL is linearly independent.

L1
1.2

Suppose some linearly independent LVL \subseteq V satisfied LNL \approx \mathbb{N}. By claim 1 the set LL is finite, so LmL \approx m for some mNm \in \mathbb{N}; by symmetry and transitivity of \approx this gives Nm\mathbb{N} \approx m, which is impossible.

L1L2L3
2.1

Claim 1 is step 1.1 and claim 2 is step 1.2.

step 1.1step 1.2

Remarks

  • Claim 2 is the form in which later items say a space is infinite-dimensional. Exhibiting a linearly independent subset equinumerous with N\mathbb{N} shows, by this corollary read backwards, that the space has no finite spanning set at all, hence no finite basis. That is exactly the route taken on the companion page by the explicit infinite basis for the eventually zero families and by the independent set of FNF^{\mathbb{N}} that does not span it.

  • The bound is on the independent set, not on the spanning set. A spanning set may be enlarged freely without ceasing to span, so no bound in the other direction holds; what is bounded is how many vectors can be independent, and the bound is the size of any finite spanning set.

  • Nothing here assumes VV has a basis. The hypothesis is a finite spanning set, which need not be independent; that a spanning set contains a basis is Every spanning subset of a vector space contains a basis, proved later and by a different route.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 68 results over 25 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