Infinite-Dimensional Spaces
Can every vector space be given coordinates, the way is given the coordinates ? The theory of Dimension and Bases answers yes for finite-dimensional spaces. A basis is found there by a finite greedy algorithm. Keep adding linearly independent vectors until none remain. Some spaces, like all polynomials or all sequences, have no finite spanning set. For these, the greedy algorithm never terminates. The very meaning of "basis" must then be re-examined. This matters because most vector spaces of real interest are infinite-dimensional. This includes function spaces, sequence spaces, and spaces of operators, which matter to analysis, physics, and probability. Linear algebra's cleanest theorems are these: every finitely generated space has a basis; all bases have the same size; every linear map is determined by its values on a basis. These either require new tools to survive, or fail outright, once continuity or topology enters the picture. One must understand exactly which finite-dimensional intuitions transport safely. One must also see which do not. This is essential before generalizing responsibly. The big picture is this: purely algebraically, every vector space, of any size, has a basis. This is called a Hamel basis. This fact is equivalent to the Axiom of Choice. Every vector space is therefore linearly isomorphic to a direct sum of copies of its scalar field. But this isomorphism is almost always useless in practice. Hamel bases of familiar infinite-dimensional spaces are uncountable, non-constructive, and invisible to analysis. The "natural" bases used in Fourier analysis or numerical methods are different. These include orthonormal bases and Schauder bases. They form a completely different, topological notion. They require infinite linear combinations, not finite ones. This article makes precise what a Hamel basis is. It proves that one exists in every vector space, via Zorn's Lemma. It proves the invariance-of-cardinality statement that replaces "dimension is well-defined." It then catalogs, with explicit counterexamples, the finite-dimensional facts that collapse. These include closed subspaces failing to have complements, non-continuous linear functionals, proper dense subspaces. They also include linear maps that cannot be diagonalized or even fully described.
- A Hamel basis is a linearly independent spanning set using only finite linear combinations; every vector space has one, but the proof needs Zorn's Lemma / the Axiom of Choice.
- Hamel bases of familiar infinite-dimensional spaces (, , , polynomials) are always uncountably infinite and cannot be written down explicitly.
- "All bases have the same cardinality" still holds in full generality — this is the correct replacement for the finite-dimensional dimension theorem.
- Several finite-dimensional facts fail: subspaces need not have complements found "for free," linear maps need not be continuous, and a space can be linearly isomorphic to a proper subspace of itself.
- Analysis replaces the Hamel basis with a Schauder basis, which allows infinite linear combinations, but this requires a topology (a norm) — pure linear algebra cannot see it.
- Key idea: every vector space has a basis and a well-defined dimension in the abstract algebraic sense, but in infinite dimensions this basis is a non-constructive, analytically useless object, so the finite-dimensional toolbox must be rebuilt.
Where this lives today
Infinite-dimensional linear algebra is the backbone of functional analysis: Banach and Hilbert spaces (spaces of functions, sequences, distributions) are vector spaces whose Hamel dimension is always uncountable but whose useful structure comes from a Schauder basis or an orthonormal basis, replacing finite Hamel sums with convergent infinite series. This is essential in Fourier analysis (the basis for ), quantum mechanics (the state space of a quantum system is an infinite-dimensional Hilbert space, and observables are operators, not matrices), and numerical analysis (finite element methods approximate infinite-dimensional solution spaces by finite-dimensional ones). In probability theory, the existence of a Hamel basis for the space of all real-valued functions is used to construct pathological, non-measurable objects (Hamel-basis-derived functions solving Cauchy's functional equation without being linear, related to Vitali's non-measurable sets). In theoretical computer science and cryptography, infinite-dimensional vector spaces over finite fields (formal power series, infinite-dimensional codes) appear in coding theory and lattice-based cryptography, where the finite-versus-infinite distinction governs which algorithms terminate. In every one of these settings, the moral of this article recurs: the algebraic theorem (a basis exists, dimension is well-defined) is true and useful for abstract classification, but the practical tools (orthonormal expansions, generating functions, approximation schemes) are topological refinements built on top of it, not substitutes for it.
:::quiz[Why is the discontinuous linear functional constructed on in Example 2 not something one can write down with an explicit formula?]
- Because is finite-dimensional
- Because its construction depends on a Hamel basis of , whose existence uses the Axiom of Choice and has no explicit description ✓
- Because linear functionals on normed spaces are always continuous
- Because has no linearly independent uncountable subsets
Ask the tutor: Why must a Hamel basis of an infinite-dimensional Banach space always be uncountable, and how does the Baire Category Theorem prove this?
Let be a vector space over a field (typically or ). A subset is a Hamel basis (or simply a basis, in the pure linear-algebra sense) if: 1. Linear independence. Every finite subset is linearly independent: if with , then . 2. Spanning. Every is a finite linear combination of elements of : there exist and scalars with
The vector space is called infinite-dimensional if it has no finite spanning set — equivalently, if every Hamel basis of (should one exist) is an infinite set. The dimension is the cardinality of any Hamel basis of (well-defined once Dimension is generalized to arbitrary cardinals, as proved below).
Intuition
In a finite-dimensional space, a basis is a finite list of vectors, and every element of the space is reached by a single, finite linear combination — this is baked into the definition above, and it does not change when the space becomes infinite. What changes is only the size of the list. The word "infinite" in "infinite-dimensional" refers purely to the cardinality of the basis, never to the length of the linear combinations used to reach a vector: a Hamel basis combination is always a finite sum, even in a space of dimension the continuum. This is the single most important, and most frequently misunderstood, fact in the subject. It is tempting to think that in the space of all sequences, an element like is "the infinite linear combination" of the standard unit vectors . This is true in the sense of a convergent series — but convergence is a topological, analytic notion, requiring a norm or metric, that plain vector-space (Hamel) theory does not have access to. As a linear-algebraic object with no topology, this sequence is not a finite combination of the , so the alone do not Hamel-span the sequence space; the Hamel basis must be enlarged by an enormous, non-constructive infinite (indeed uncountable) set of further vectors to reach it algebraically. The picture below contrasts the two notions on the sequence space : the "easy" subspace of finitely-supported sequences (Hamel-spanned by the ) versus the much bigger full space, whose Hamel basis needs uncountably many extra vectors that have no simple description.
Existence and cardinality of Hamel bases
Let be any vector space over a field (allowed to be the zero space). Then has a Hamel basis. More generally, if is any linearly independent subset, then can be extended to a Hamel basis of .
We use Zorn's Lemma: if a nonempty partially ordered set has the property that every chain (totally ordered subset) has an upper bound in , then has a maximal element. Let be the collection of all linearly independent subsets of that contain , partially ordered by inclusion . This collection is nonempty since (interpreting itself as linearly independent by hypothesis; if this is vacuous and still holds).
Chains have upper bounds. Let be a chain in , i.e. a collection of linearly independent sets containing , totally ordered by . Let
We claim is linearly independent (and it contains since each does). Let be distinct and suppose . Each lies in some . Since is totally ordered, the finite collection has a largest element, say (a finite totally ordered set has a maximum). Then every . Since is linearly independent, all . This proves is linearly independent, hence , and it is clearly an upper bound for in . By Zorn's Lemma, has a maximal element . We claim is a Hamel basis of . is linearly independent by definition of . It remains to show spans . Suppose not: there is not a finite linear combination of elements of . We claim is linearly independent, contradicting maximality of (since would then be a strictly larger element of ). Indeed, suppose
If , then , a finite linear combination of elements of , contradicting the choice of . So , and then forces by linear independence of . Hence is linearly independent, the desired contradiction. Therefore spans , so is a Hamel basis containing . Taking gives existence of a Hamel basis for any .
∎Let be a vector space, let be a Hamel basis of , and let be linearly independent. Then there is an injection such that for every finite subset , the set is still a basis of . Consequently .
This is the standard finite-dimensional Steinitz Exchange argument, applied one vector at a time and packaged via Zorn's Lemma to handle infinitely many vectors simultaneously; we sketch the mechanism, which is a direct generalization of the finite exchange lemma used to prove that all finite bases have equal size. Consider the set of all partial injections (where ) such that for every finite , replacing inside by still yields a basis (i.e. is a basis of ). Order by extension of functions. One checks, exactly as in the finite Steinitz exchange step, that:
- is nonempty (the empty function belongs to ).
- Every chain in has an upper bound, namely the union of the chain as a function (its domain is the union of the domains, and the defining finite-swap property is a condition on finite subsets, hence is inherited from the chain, since any finite subset of the union domain already lies in one member of the chain by the same finiteness/totally-ordered argument as in the previous proof).
By Zorn's Lemma, has a maximal element . We claim . If not, pick . Since is a basis, write with , (discard zero coefficients). If all already lie in , then would be a linear combination of -images, and since swapped in is still linearly independent (as is linearly independent and ), one derives a nontrivial dependency among elements of together with basis vectors outside the image — a direct check (identical to the finite-dimensional case) shows at least one must exist, for otherwise together with would violate the linear independence of via the basis expansion of . Fix such . Extend by ; a direct verification (again identical in form to the single-step finite exchange lemma, applied to the finite dependency exhibited by ) shows the finite-swap property is preserved for all finite subsets of . This contradicts maximality of . Hence , so is an injection, giving .
∎Let be a vector space, and let be two Hamel bases of . Then (they have the same cardinality). Hence for any Hamel basis is a well-defined cardinal number.
If , the only basis is , so the claim is trivial; assume .
Case 1: some basis is finite. Suppose is finite, . By the Exchange Lemma applied with (linearly independent) and (a basis), we get , so is also finite. Now the classical finite-dimensional replacement theorem (the special case of the Exchange Lemma when both sets are finite, which is exactly the argument used to establish Dimension is well-defined for finite-dimensional spaces) gives exactly, by applying the Exchange Lemma symmetrically in both directions: and force equality of the finite numbers.
Case 2: both bases are infinite. This is the genuinely new, infinite-cardinality case. By the Exchange Lemma applied twice (once with , basis , and once with , basis ), we obtain injections
By the Schröder–Bernstein theorem (a basic fact of cardinal arithmetic: if there are injections and between two sets, then ), the existence of mutual injections gives . In both cases , so is a well-defined cardinal number, independent of the choice of Hamel basis.
∎Let be a vector space over with Hamel basis . Then is linearly isomorphic to the direct sum
the space of functions with finite support, i.e. .
Define as follows. Every has a unique expression where and only finitely many are nonzero: existence is the spanning property of , and uniqueness follows from linear independence of (if two finite expressions for both use only finitely many basis vectors, subtract them to get a finite linear combination of finitely many distinct elements of equal to ; independence forces all coefficients to match). Set . is linear: for and , the uniqueness of coordinate representations and the linearity of the underlying vector space operations show for every , since is itself a finite-support representation and uniqueness forces it to be the representation. is injective: if then all , so . is surjective: given any finitely-supported , the finite sum (only finitely many terms nonzero) is a well-defined element with . Hence is a linear isomorphism .
∎Worked examples
Example 1: The space of all real sequences has dimension (the continuum), realized abstractly but not concretely. Let , the vector space of all sequences of real numbers, with coordinatewise addition and scalar multiplication. We determine . Step 1: . Consider the family of sequences defined by for (so ). We claim any finite sub-collection with distinct is linearly independent. Suppose
Looking at coordinate gives for every . Truncating to gives a linear system with matrix , whose transpose is the Vandermonde matrix on distinct nodes ; its determinant is since the are distinct. Hence the system forces . So the uncountable family is linearly independent, and since , we get . Step 2: . As a set, has cardinality . Any linearly independent subset of , in particular any Hamel basis, has cardinality at most . Combining both bounds, . But note: the proof of Step 1 shows a specific uncountable linearly independent set, not a basis — none of the span (for instance the sequence is not obviously a finite combination of finitely many 's in any explicit way, and completing to an actual Hamel basis requires invoking Zorn's Lemma again, adding further vectors with no closed-form description). This illustrates concretely why is a true, provable cardinal number, yet no one can write down an actual basis — existence is guaranteed by pure set theory, not by construction.
Example 2: A discontinuous linear functional on an infinite-dimensional normed space, built from a Hamel basis. Let , the vector space of continuous real functions on , equipped with the sup-norm . We construct a linear functional that is linear but not continuous — a phenomenon impossible for linear maps out of a finite-dimensional normed space. By the Existence Theorem, extend the linearly independent singleton (the constant function ) to a Hamel basis of with . Since is infinite-dimensional (it contains the linearly independent set , independent by the same Vandermonde-type / degree argument as for polynomials), is infinite, so we may pick some other element with . Define on the basis by
where we additionally arrange (by rescaling within the construction, or just by picking, using the Hamel-basis extension freedom, a sequence with for each — this is possible because we may replace any basis vector by , which remains a valid basis) that for all . Extend to all of by linearity: every has a unique finite basis expansion , and we set (a finite sum, well-defined by uniqueness of Hamel coordinates). This is a well-defined linear functional by the same coordinate argument as in the Direct Sum Corollary. Now is unbounded: while , so
A linear functional on a normed space is continuous if and only if it is bounded on the unit ball (a standard equivalence for linear maps between normed spaces). Since is unbounded on the unit ball, is discontinuous — indeed, discontinuous at every point, since linear maps are continuous everywhere or nowhere. Note this construction is entirely non-constructive: it relies on the existence of a Hamel basis of , which (as in Example 1) cannot be exhibited explicitly.
The Hamel-basis theorem is often mis-stated as: "the standard unit vectors form a basis of the sequence space ." This is false, and seeing why illustrates exactly which hypothesis silently gets dropped. Consider again, and let where has a in coordinate and elsewhere. is linearly independent: any finite subset satisfies for all , by comparing coordinates. But does not satisfy the spanning condition in the Hamel-basis definition, because that condition demands every vector be a finite linear combination. The sequence (all ones) is not a finite linear combination of the : any finite combination has only finitely many nonzero coordinates, while has infinitely many nonzero (in fact all) coordinates. So in the Hamel sense, even though one is tempted to write as an "infinite sum." This shows exactly what breaks if one relaxes "finite linear combination" to "infinite linear combination, provided it makes sense": one gets a different, topological notion (a Schauder basis, which needs a norm/metric to even define convergence of ), not a Hamel basis, and the two coincide only in finite dimensions where all sums are automatically finite. is a genuine linearly independent set but is only a Hamel basis of the proper subspace
Completing to an actual Hamel basis of the full space requires adjoining uncountably many further, non-explicit vectors (such as above and vastly more), exactly as flagged in Example 1.
Scope, edge cases & common traps
| Finite-dimensional fact | Infinite-dimensional status | Why |
|---|---|---|
| Every spanning set contains a basis; every basis has the same finite size | Still true, generalized to cardinals (Invariance of Dimension theorem) | Zorn's Lemma + Schröder–Bernstein replace the finite counting argument |
| A basis can be written down explicitly | Usually false for familiar analytic spaces | Existence proof is non-constructive (depends on choice) |
| of a countable set can be the whole space | Often false: e.g. only spans | Only finite combinations allowed in Hamel spanning |
| Every linear map is continuous | False | Counterexample: discontinuous built from a Hamel basis of |
| Every subspace has a well-defined "dimension complement" that is topologically nice | True algebraically (every subspace has a Hamel complement) but the complement need not be a closed subspace, or even measurable, in a normed setting | Complements come from extending a basis of the subspace to , an act of choice with no topological control |
| A proper subspace can't be isomorphic to the whole space | False | The shift map on sequences gives isomorphisms of infinite-dimensional spaces with proper subspaces of themselves |
The mathematician behind it
Origins · 1 minGeorg Cantor and how this was discovered
Georg Cantor developed the theory of cardinal numbers and proved that infinite sets come in different sizes, most famously that . The invariance-of-dimension theorem above literally uses Cantor's arithmetic of cardinals (via the Schröder–Bernstein theorem) to make sense of statements like "." Cantor's work forced mathematicians to confront the fact that "size" in infinite settings needs its own careful theory, a lesson linear algebra inherits directly whenever a vector space fails to be finitely generated.
Does every infinite-dimensional vector space really have a basis, or is this only true for "nice" spaces like ?
Every vector space, of any cardinality, has a Hamel basis — this is a theorem of pure linear algebra proved via Zorn's Lemma, with no extra hypotheses on the space (no norm, no completeness, no separability needed). The catch is that the proof is non-constructive: it shows a maximal linearly independent set exists without ever describing one explicitly. For "nice" analytic spaces such as , , or , no one has ever written down an actual Hamel basis, and it is provably impossible to do so using only "constructive" (e.g. Borel-definable) methods. So the existence is real and rigorous, but the basis itself remains, in a precise sense, unreachable.
Is a Schauder basis the same thing as a Hamel basis?
No, they are different notions serving different purposes. A Hamel basis allows only finite linear combinations and requires no topology; it exists in every vector space by Zorn's Lemma. A Schauder basis is defined only in a topological vector space (typically a Banach space) and allows infinite linear combinations, in the sense that every vector equals a convergent series in the given norm. In infinite dimensions these notions genuinely diverge: a countable Schauder basis like in is far too small to be a Hamel basis (Hamel dimension of is ), because Hamel spanning forbids the infinite sums that make Schauder bases work.
Why does Vandermonde's determinant appear when proving ?
To show the family , , is linearly independent, one must rule out any nontrivial finite dependency for distinct . Truncating to the first coordinates converts this to a linear system whose coefficient matrix is a Vandermonde matrix, whose determinant is nonzero precisely because the are distinct. A nonzero determinant forces the only solution to be , proving independence of any finite subfamily, and hence of the whole uncountable family.
Can an infinite-dimensional vector space be linearly isomorphic to a proper subspace of itself?
Yes, and this is one of the sharpest breaks from finite-dimensional intuition, where a linear injection from into itself that is not surjective is impossible (rank–nullity forces injective endomorphisms of finite-dimensional spaces to be surjective). In infinite dimensions, the "shift" map on is injective and linear, but its image is the proper subspace of sequences with first coordinate ; more strikingly, sequence spaces like are even linearly isomorphic to , since both have Hamel dimension .
Does "infinite-dimensional" mean the space has no basis?
No — it means every basis is infinite, not that no basis exists. The Existence Theorem guarantees a Hamel basis for every vector space regardless of size. "Infinite-dimensional" is purely a statement about the cardinality of that basis (it is an infinite cardinal, such as or ), not a statement that basis theory breaks down. What genuinely breaks down is the usefulness of that basis for analysis, and several auxiliary finite-dimensional facts (continuity of linear maps, non-existence of proper isomorphic subspaces) that relied implicitly on finiteness.
Why can't we just use the Axiom of Choice to also fix the discontinuity problem, since we used it to get the basis in the first place?
The Axiom of Choice is what lets us build a Hamel basis, and the same freedom is exactly what lets us build weird, discontinuous linear maps on top of it (as in Example 2): we can prescribe wildly different values on different basis vectors with no continuity constraint linking them, whereas continuity would force the values on "nearby" basis vectors to be constrained. There is no way to use Choice to repair this, because the pathology (discontinuity) is a direct, unavoidable consequence of the same freedom that produces the basis; the two are two faces of one phenomenon, not separate problems.