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.
A Banach space has no countably infinite Hamel basis
Statement
Let be a Banach space over . Then has no countably infinite Hamel basis. Equivalently, there is no sequence of pairwise distinct vectors whose image is a basis of in the sense of Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis.
Facts & Assumptions
Given: A Banach space and, for contradiction, a sequence of pairwise distinct vectors whose image is a Hamel basis of .
A Banach space is complete for its norm metric (Banach space).
Finite-dimensional normed subspaces are closed (A finite-dimensional normed subspace is closed).
is countably infinite ( is countably infinite, Finite, countably infinite, countable, uncountable).
The choice-strength ledger records that the separable complete-metric Baire theorem is available in ZF, while the unrestricted complete-metric theorem is strictly stronger (The Baire category theorem is four inequivalent statements over ZF ‡).
A nonempty countable set is a surjective image of , and every nonempty subset of has a least element (A nonempty set is at most countable iff it is a surjective image of , The well-ordering principle).
Proof
Let in the real case and in the complex case. In either case is countable by [L3], and it is dense in . Let be the set of all finite -linear combinations of the basis vectors . Coding a finite combination by the finite list of its indices together with its coefficient list gives an explicit surjection from a countable set onto , so is countable. Also , so is nonempty.
For put in the real case, and in the complex case. In either case is finite-dimensional over . It is proper: in the real case by linear independence of the basis image, and in the complex case a real-linear relation expressing in terms of would be the same as a complex-linear relation expressing in terms of . Thus [L2] makes every closed. Also , because every vector uses only finitely many basis vectors, and in the complex case every complex coefficient splits into real and imaginary parts.
Every proper linear subspace of a normed space has empty interior. Indeed, if were a linear subspace containing some ball , then because is closed under subtraction, and for any the vector would lie in , forcing ; also . So , contradiction.
By [L5], fix a surjection .
is dense in . Indeed, let and let . Choose with . Then So every vector of lies in the closure of .
We now run the separable-complete Baire argument inside the open unit ball . Because is closed with empty interior, the set is nonempty and open. By step 2.2, the set is nonempty, so [L5] gives its least element . Put . Since is open at , the set is nonempty; let be its least element and set . Then .
Inductively, if closed balls have been chosen with for , then is a nonempty open set. By step 2.2, the set is nonempty, so [L5] gives its least element . Put . Since is open at , the set is nonempty; let be its least element and set . Then and . Hence for every , so .
For , the inclusion from step 3.2 gives , so . Hence is Cauchy. Since is Banach, [L1] gives for some . Each is closed and contains all later , so it contains the limit ; therefore for every .
Step 4.1 contradicts from step 1.2. Therefore no countably infinite Hamel basis exists. The foundational point recorded in [L4] is that the proof used only a fixed countable dense set, with both the recurring point selections and the ball radii chosen canonically from , and not the unrestricted complete-metric Baire theorem.
Remarks
- The proof is written over the underlying real normed space in the complex case, so no separate complex Baire argument is needed.
Depends on
- Banach space
- A finite-dimensional normed subspace is closed
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Finite, countably infinite, countable, uncountable
- $\mathbb{Q}$ is countably infinite
- The Baire category theorem is four inequivalent statements over ZF
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- The well-ordering principle
Used by
Dependency tree · two levels
48 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
- Paul Howard and Eleftherios Tachtsis, On infinite-dimensional Banach spaces and weak forms of the axiom of choice (standard reference, not scraped)
- Christopher Heil, A Basis Theory Primer (standard reference, not scraped)