Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck 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 dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V

Statement

Let V be a vector space over a field F (Vector space over a field) that is finite-dimensional with dim⁡FV=n (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis), and let U be a linear subspace of V (Linear subspace of a vector space). Then

  1. U is finite-dimensional over F and dim⁡FU≤n;
  2. dim⁡FU=n if and only if U=V;
  3. Extension, with no choice principle. Every linearly independent A0⊆U is contained in a basis of U: there is a basis B of U with A0⊆B⊆U. Claim 1 is the case A0=∅. Since V is itself a linear subspace of V (Linear subspace of a vector space), claim 3 applies with V in place of U, and hence to any finite-dimensional vector space over F in place of the pair (V,U).

Nothing above uses a choice principle, and claim 3 in particular is the finite-dimensional substitute for the Zorn-based extension theorem stated earlier on this page. In finite dimension the extension terminates on its own, because 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 N bounds the size of an independent set and The well-ordering principle then supplies a largest one; no selection is made anywhere.

Finiteness is essential in claim 2. Without it the equality case fails: the companion page exhibits a proper linear subspace of an infinite-dimensional space whose basis is equinumerous with a basis of the whole space.

Facts & Assumptions

Given: A field F, a vector space V over F with dim⁡FV=n, and a linear subspace U of V.

[L2]
[L3]

For A⊆U, linear independence computed in U and in V is the same condition, and span⁡U(A)=span⁡V(A); so A is a basis of U exactly when A is linearly independent and span⁡(A)=U (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, section on bases of a linear subspace, Linear subspace of a vector space).

[L6]

Every nonempty subset of N has a least element (The well-ordering principle); ≤ is a total order; m<σ(p)  ⟺  m≤p; every p≠0 is a successor; and σ(p)=p∪{p} with p∉p (≤ is a linear order on N, Order on the natural numbers, On N the order is membership: m<n  ⟺  m∈n, Every nonzero natural number is a successor, The natural numbers N (von Neumann)).

[L7]

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

Proof

technique · direct
1.1

Fix a basis B of V with B≈n. It spans V and is finite of size n, so every linearly independent subset of V is finite with at most n elements.

L1L2
1.2

A subset A⊆U is linearly independent as a subset of U exactly when it is linearly independent as a subset of V, and its span is the same set computed in either space; so "basis of U" is unambiguous, and every linearly independent subset of U is a linearly independent subset of V.

L3
1.3

A nonempty K⊆N with an upper bound has a greatest element. Let M be the set of upper bounds of K in N, nonempty by hypothesis, and let j0 be its least element. If j0=0 then every k∈K satisfies k≤0, hence k=0, and K is nonempty, so 0∈K. If j0≠0, write j0=σ(p) and suppose j0∉K; then every k∈K satisfies k≤j0 and k≠j0, hence k<σ(p), hence k≤p, so p∈M with p<j0, contradicting leastness. Either way j0∈K, and j0 is an upper bound, so it is the greatest element of K.

L6
2.1

Fix a linearly independent A0⊆U, possibly empty, and let K:={ p∈N:some linearly independent A with A0⊆A⊆U has A≈p }. Then K is nonempty: by step 1.2 the set A0 is a linearly independent subset of V, so it is finite by step 1.1, say A0≈a0, and A0 itself witnesses a0∈K. And every p∈K satisfies p≤n, since the witnessing A is likewise a linearly independent subset of V and step 1.1 bounds its size, the size being unique. So K is nonempty and bounded by n, and step 1.3 gives it a greatest element d≤n; fix a linearly independent A with A0⊆A⊆U and A≈d.

step 1.1step 1.2step 1.3L7
3.1

That A is a basis of U containing A0. Suppose some w∈U had w∉span⁡(A). Then A∪{w} is linearly independent and w∉A, and A0⊆A∪{w}⊆U; moreover a bijection d→A extends to a bijection σ(d)→A∪{w} by sending d to w, so A∪{w}≈σ(d) and σ(d)∈K, contradicting the maximality of d in K. Hence U⊆span⁡(A); and span⁡(A)⊆U because U is a linear subspace of V containing A. So span⁡(A)=U and A is a basis of U with A0⊆A.

step 2.1L3L4L5L6L7
4.1

Claim 1. Run steps 2.1 and 3.1 at A0=∅, which is linearly independent and contained in U. They produce a basis A of U with A≈d, so U is finite-dimensional with dim⁡FU=d, and d≤n by step 2.1.

step 2.1step 3.1L1
4.2

Claim 3. For an arbitrary linearly independent A0⊆U, steps 2.1 and 3.1 produce a basis A of U with A0⊆A⊆U, which is the assertion. Every selection made along the way is a single existential instantiation from a nonempty set, and the greatest element supplied by step 1.3 is determined by K rather than chosen from it, so no choice principle is used. Applying this with V in the roles of both V and U, which is legitimate because V is a linear subspace of itself, gives the statement for an arbitrary finite-dimensional vector space over F.

step 2.1step 3.1L3L6
5.1

Claim 2. If U=V then dim⁡FU=dim⁡FV=n. Conversely suppose dim⁡FU=n; then d=n by step 4.1, so the basis A produced at A0=∅ in step 3.1 is a linearly independent subset of V with A≈n and span⁡(A)=U. If U≠V, pick w∈V∖U=V∖span⁡(A); then A∪{w} is a linearly independent subset of V with A∪{w}≈σ(n), and σ(n)≤n by step 1.1, which is impossible since n<σ(n). So U=V.

step 1.1step 3.1step 4.1L4L6L7
6.1

Claim 1 is step 4.1, claim 2 is step 5.1 and claim 3 is step 4.2.

step 4.1step 4.2step 5.1∎

Remarks

Depends on

Used by

Dependency tree · two levels

57 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