Infinite-Dimensional Spaces

Can every vector space be given coordinates, the way R3\mathbb{R}^3 is given the coordinates (x,y,z)(x,y,z)? 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.

Key takeaways
  • 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 (RN\mathbb{R}^\mathbb{N}, C[0,1]C[0,1], ℓ2\ell^2, 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 {einx}\{e^{inx}\} for L2L^2), 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 C[0,1]C[0,1] in Example 2 not something one can write down with an explicit formula?]

  • Because C[0,1]C[0,1] is finite-dimensional
  • Because its construction depends on a Hamel basis of C[0,1]C[0,1], whose existence uses the Axiom of Choice and has no explicit description ✓
  • Because linear functionals on normed spaces are always continuous
  • Because C[0,1]C[0,1] 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?

DefinitionHamel basis, infinite-dimensional space

Let VV be a vector space over a field FF (typically F=RF=\mathbb{R} or C\mathbb{C}). A subset B⊆VB \subseteq V is a Hamel basis (or simply a basis, in the pure linear-algebra sense) if: 1. Linear independence. Every finite subset {b1,…,bn}⊆B\{b_1,\dots,b_n\}\subseteq B is linearly independent: if ∑i=1ncibi=0\sum_{i=1}^n c_i b_i = 0 with ci∈Fc_i \in F, then c1=⋯=cn=0c_1=\cdots=c_n=0. 2. Spanning. Every v∈Vv \in V is a finite linear combination of elements of BB: there exist b1,…,bn∈Bb_1,\dots,b_n \in B and scalars c1,…,cn∈Fc_1,\dots,c_n \in F with

v=c1b1+⋯+cnbn.v = c_1 b_1 + \cdots + c_n b_n.

The vector space VV is called infinite-dimensional if it has no finite spanning set — equivalently, if every Hamel basis of VV (should one exist) is an infinite set. The dimension dim⁡V\dim V is the cardinality of any Hamel basis of VV (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 (1,12,14,18,… )(1, \tfrac12, \tfrac14, \tfrac18,\dots) is "the infinite linear combination" ∑n≥02−nen\sum_{n\ge 0} 2^{-n} e_n of the standard unit vectors ene_n. 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 ene_n, so the ene_n 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 RN\mathbb{R}^\mathbb{N}: the "easy" subspace of finitely-supported sequences (Hamel-spanned by the ene_n) versus the much bigger full space, whose Hamel basis needs uncountably many extra vectors that have no simple description.

Figure
Finitely-supported sequences vs. all sequences: why {e1,e2,… }\{e_1,e_2,\dots\} Hamel-spans only a small subspace
V = ℝ^ℕ (all real sequences) span{e₁,e₂,e₃,…} (finite support only) e₃ = (0,0,1,0,0,…) x = (1, ½, ¼, ⅛, …) ∉ span{eₙ} Hamel basis of V must add uncountably many further vectors (no explicit formula) to reach x.

Existence and cardinality of Hamel bases

TheoremExistence of a Hamel basis

Let VV be any vector space over a field FF (allowed to be the zero space). Then VV has a Hamel basis. More generally, if L⊆VL \subseteq V is any linearly independent subset, then LL can be extended to a Hamel basis of VV.

Proof

We use Zorn's Lemma: if a nonempty partially ordered set (P,≤)(\mathcal{P},\le) has the property that every chain (totally ordered subset) has an upper bound in P\mathcal{P}, then P\mathcal{P} has a maximal element. Let P\mathcal{P} be the collection of all linearly independent subsets of VV that contain LL, partially ordered by inclusion ⊆\subseteq. This collection is nonempty since L∈PL \in \mathcal{P} (interpreting LL itself as linearly independent by hypothesis; if L=∅L=\emptyset this is vacuous and still holds).

Chains have upper bounds. Let C={Ai}i∈I\mathcal{C} = \{A_i\}_{i\in I} be a chain in P\mathcal{P}, i.e. a collection of linearly independent sets containing LL, totally ordered by ⊆\subseteq. Let

A∗=⋃i∈IAi.A^\ast = \bigcup_{i \in I} A_i.

We claim A∗A^\ast is linearly independent (and it contains LL since each AiA_i does). Let v1,…,vn∈A∗v_1,\dots,v_n \in A^\ast be distinct and suppose c1v1+⋯+cnvn=0c_1 v_1 + \cdots + c_n v_n = 0. Each vkv_k lies in some AikA_{i_k}. Since C\mathcal{C} is totally ordered, the finite collection Ai1,…,AinA_{i_1},\dots,A_{i_n} has a largest element, say AimA_{i_m} (a finite totally ordered set has a maximum). Then every vk∈Aimv_k \in A_{i_m}. Since AimA_{i_m} is linearly independent, all ck=0c_k=0. This proves A∗A^\ast is linearly independent, hence A∗∈PA^\ast \in \mathcal{P}, and it is clearly an upper bound for C\mathcal{C} in (P,⊆)(\mathcal{P},\subseteq). By Zorn's Lemma, P\mathcal{P} has a maximal element BB. We claim BB is a Hamel basis of VV. BB is linearly independent by definition of P\mathcal{P}. It remains to show BB spans VV. Suppose not: there is v∈Vv \in V not a finite linear combination of elements of BB. We claim B∪{v}B \cup \{v\} is linearly independent, contradicting maximality of BB (since B∪{v}⊋BB \cup \{v\} \supsetneq B would then be a strictly larger element of P\mathcal{P}). Indeed, suppose

c0v+c1b1+⋯+cnbn=0,b1,…,bn∈B distinct.c_0 v + c_1 b_1 + \cdots + c_n b_n = 0, \qquad b_1,\dots,b_n \in B \text{ distinct}.

If c0≠0c_0 \ne 0, then v=−c0−1(c1b1+⋯+cnbn)v = -c_0^{-1}(c_1 b_1 + \cdots + c_n b_n), a finite linear combination of elements of BB, contradicting the choice of vv. So c0=0c_0 = 0, and then c1b1+⋯+cnbn=0c_1 b_1 + \cdots + c_n b_n = 0 forces c1=⋯=cn=0c_1=\cdots=c_n=0 by linear independence of BB. Hence B∪{v}B \cup \{v\} is linearly independent, the desired contradiction. Therefore BB spans VV, so BB is a Hamel basis containing LL. Taking L=∅L = \emptyset gives existence of a Hamel basis for any VV. ■\blacksquare

∎
LemmaExchange Lemma, general form

Let VV be a vector space, let BB be a Hamel basis of VV, and let S⊆VS \subseteq V be linearly independent. Then there is an injection φ:S→B\varphi: S \to B such that for every finite subset S0⊆SS_0 \subseteq S, the set (B∖φ(S0))∪S0(B \setminus \varphi(S_0)) \cup S_0 is still a basis of VV. Consequently ∣S∣≤∣B∣|S| \le |B|.

Proof

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 Q\mathcal{Q} of all partial injections ψ:S′→B\psi: S' \to B (where S′⊆SS' \subseteq S) such that for every finite F⊆S′F \subseteq S', replacing ψ(F)\psi(F) inside BB by FF still yields a basis (i.e. (B∖ψ(F))∪F(B\setminus \psi(F)) \cup F is a basis of VV). Order Q\mathcal{Q} by extension of functions. One checks, exactly as in the finite Steinitz exchange step, that:

  • Q\mathcal{Q} is nonempty (the empty function belongs to Q\mathcal{Q}).
  • Every chain in Q\mathcal{Q} 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, Q\mathcal{Q} has a maximal element φ:S′→B\varphi: S' \to B. We claim S′=SS' = S. If not, pick s∈S∖S′s \in S \setminus S'. Since BB is a basis, write s=c1b1+⋯+cnbns = c_1 b_1 + \cdots + c_n b_n with bi∈Bb_i \in B, ci≠0c_i \ne 0 (discard zero coefficients). If all bib_i already lie in φ(S′)\varphi(S'), then ss would be a linear combination of S′∪(finitely many elements of S′)S' \cup (\text{finitely many elements of } S')-images, and since S∪φ(S′)S \cup \varphi(S') swapped in is still linearly independent (as SS is linearly independent and S′⊊SS'\subsetneq S), one derives a nontrivial dependency among elements of SS together with basis vectors outside the image — a direct check (identical to the finite-dimensional case) shows at least one bi∉φ(S′)b_i \notin \varphi(S') must exist, for otherwise ss together with S′S' would violate the linear independence of SS via the basis expansion of ss. Fix such bi=:bb_i =: b. Extend φ\varphi by φ(s)=b\varphi(s) = b; a direct verification (again identical in form to the single-step finite exchange lemma, applied to the finite dependency exhibited by ss) shows the finite-swap property is preserved for all finite subsets of S′∪{s}S' \cup \{s\}. This contradicts maximality of φ\varphi. Hence S′=SS' = S, so φ:S→B\varphi: S \to B is an injection, giving ∣S∣≤∣B∣|S| \le |B|. ■\blacksquare

∎
TheoremInvariance of dimension

Let VV be a vector space, and let B1,B2B_1, B_2 be two Hamel bases of VV. Then ∣B1∣=∣B2∣|B_1| = |B_2| (they have the same cardinality). Hence dim⁡V:=∣B∣\dim V := |B| for any Hamel basis BB is a well-defined cardinal number.

Proof

If V={0}V = \{0\}, the only basis is ∅\emptyset, so the claim is trivial; assume V≠{0}V \ne \{0\}.

Case 1: some basis is finite. Suppose B1B_1 is finite, ∣B1∣=n|B_1| = n. By the Exchange Lemma applied with S=B2S = B_2 (linearly independent) and B=B1B = B_1 (a basis), we get ∣B2∣≤∣B1∣=n|B_2| \le |B_1| = n, so B2B_2 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 ∣B1∣=∣B2∣|B_1| = |B_2| exactly, by applying the Exchange Lemma symmetrically in both directions: ∣B2∣≤∣B1∣|B_2| \le |B_1| and ∣B1∣≤∣B2∣|B_1| \le |B_2| 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 S=B1S=B_1, basis B=B2B=B_2, and once with S=B2S = B_2, basis B=B1B = B_1), we obtain injections

φ:B1↪B2,ψ:B2↪B1.\varphi: B_1 \hookrightarrow B_2, \qquad \psi: B_2 \hookrightarrow B_1.

By the Schröder–Bernstein theorem (a basic fact of cardinal arithmetic: if there are injections A↪CA \hookrightarrow C and C↪AC \hookrightarrow A between two sets, then ∣A∣=∣C∣|A| = |C|), the existence of mutual injections φ,ψ\varphi,\psi gives ∣B1∣=∣B2∣|B_1| = |B_2|. In both cases ∣B1∣=∣B2∣|B_1|=|B_2|, so dim⁡V\dim V is a well-defined cardinal number, independent of the choice of Hamel basis. ■\blacksquare

∎
CorollaryEvery vector space is a direct sum of copies of the scalar field

Let VV be a vector space over FF with Hamel basis BB. Then VV is linearly isomorphic to the direct sum

F(B):=⨁b∈BF,F^{(B)} := \bigoplus_{b \in B} F,

the space of functions B→FB \to F with finite support, i.e. V≅F(B)V \cong F^{(B)}.

Proof

Define T:V→F(B)T: V \to F^{(B)} as follows. Every v∈Vv \in V has a unique expression v=∑b∈Bcb(v) bv = \sum_{b\in B} c_b(v)\, b where cb(v)∈Fc_b(v) \in F and only finitely many cb(v)c_b(v) are nonzero: existence is the spanning property of BB, and uniqueness follows from linear independence of BB (if two finite expressions for vv both use only finitely many basis vectors, subtract them to get a finite linear combination of finitely many distinct elements of BB equal to 00; independence forces all coefficients to match). Set T(v)=(cb(v))b∈B∈F(B)T(v) = (c_b(v))_{b \in B} \in F^{(B)}. TT is linear: for v,w∈Vv,w \in V and λ∈F\lambda \in F, the uniqueness of coordinate representations and the linearity of the underlying vector space operations show cb(v+λw)=cb(v)+λcb(w)c_b(v+\lambda w) = c_b(v) + \lambda c_b(w) for every bb, since v+λw=∑b(cb(v)+λcb(w))bv + \lambda w = \sum_b (c_b(v)+\lambda c_b(w)) b is itself a finite-support representation and uniqueness forces it to be the representation. TT is injective: if T(v)=0T(v) = 0 then all cb(v)=0c_b(v) = 0, so v=∑b0⋅b=0v = \sum_b 0\cdot b = 0. TT is surjective: given any finitely-supported (cb)b∈B∈F(B)(c_b)_{b\in B} \in F^{(B)}, the finite sum ∑bcbb\sum_{b} c_b b (only finitely many terms nonzero) is a well-defined element v∈Vv \in V with T(v)=(cb)T(v) = (c_b). Hence TT is a linear isomorphism V≅F(B)V \cong F^{(B)}. ■\blacksquare

∎

Worked examples

Example 1: The space of all real sequences has dimension 2ℵ02^{\aleph_0} (the continuum), realized abstractly but not concretely. Let V=RNV = \mathbb{R}^{\mathbb{N}}, the vector space of all sequences (x0,x1,x2,… )(x_0,x_1,x_2,\dots) of real numbers, with coordinatewise addition and scalar multiplication. We determine dim⁡V\dim V. Step 1: dim⁡V≥2ℵ0\dim V \ge 2^{\aleph_0}. Consider the family of sequences {r(t)}t∈R\{r^{(t)}\}_{t \in \mathbb{R}} defined by rn(t)=tnr^{(t)}_n = t^n for n=0,1,2,…n = 0,1,2,\dots (so r(t)=(1,t,t2,t3,… )r^{(t)} = (1, t, t^2, t^3, \dots)). We claim any finite sub-collection r(t1),…,r(tk)r^{(t_1)},\dots,r^{(t_k)} with distinct t1,…,tkt_1,\dots,t_k is linearly independent. Suppose

c1r(t1)+⋯+ckr(tk)=0.c_1 r^{(t_1)} + \cdots + c_k r^{(t_k)} = 0.

Looking at coordinate nn gives ∑i=1kcitin=0\sum_{i=1}^k c_i t_i^n = 0 for every n≥0n \ge 0. Truncating to n=0,1,…,k−1n = 0,1,\dots,k-1 gives a linear system with matrix (ti n)0≤n≤k−1, 1≤i≤k(t_i^{\,n})_{0\le n \le k-1,\ 1\le i\le k}, whose transpose is the Vandermonde matrix on distinct nodes t1,…,tkt_1,\dots,t_k; its determinant is ∏i<j(tj−ti)≠0\prod_{i<j}(t_j - t_i) \ne 0 since the tit_i are distinct. Hence the system forces c1=⋯=ck=0c_1=\cdots=c_k=0. So the uncountable family {r(t):t∈R}\{r^{(t)}: t\in\mathbb{R}\} is linearly independent, and since ∣R∣=2ℵ0|\mathbb{R}| = 2^{\aleph_0}, we get dim⁡V≥2ℵ0\dim V \ge 2^{\aleph_0}. Step 2: dim⁡V≤2ℵ0\dim V \le 2^{\aleph_0}. As a set, V=RNV = \mathbb{R}^{\mathbb{N}} has cardinality ∣R∣ℵ0=(2ℵ0)ℵ0=2ℵ0⋅ℵ0=2ℵ0|\mathbb{R}|^{\aleph_0} = (2^{\aleph_0})^{\aleph_0} = 2^{\aleph_0 \cdot \aleph_0} = 2^{\aleph_0}. Any linearly independent subset of VV, in particular any Hamel basis, has cardinality at most ∣V∣=2ℵ0|V| = 2^{\aleph_0}. Combining both bounds, dim⁡V=2ℵ0\dim V = 2^{\aleph_0}. But note: the proof of Step 1 shows a specific uncountable linearly independent set, not a basis — none of the r(t)r^{(t)} span VV (for instance the sequence (1,0,1,0,1,0,… )(1,0,1,0,1,0,\dots) is not obviously a finite combination of finitely many r(t)r^{(t)}'s in any explicit way, and completing {r(t)}\{r^{(t)}\} to an actual Hamel basis requires invoking Zorn's Lemma again, adding further vectors with no closed-form description). This illustrates concretely why dim⁡(RN)=2ℵ0\dim(\mathbb{R}^\mathbb{N}) = 2^{\aleph_0} 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 V=C[0,1]V = C[0,1], the vector space of continuous real functions on [0,1][0,1], equipped with the sup-norm ∥f∥∞=sup⁡x∈[0,1]∣f(x)∣\|f\|_\infty = \sup_{x\in[0,1]} |f(x)|. We construct a linear functional φ:V→R\varphi: V \to \mathbb{R} 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 {1}\{1\} (the constant function 11) to a Hamel basis BB of VV with 1∈B1 \in B. Since C[0,1]C[0,1] is infinite-dimensional (it contains the linearly independent set {1,x,x2,x3,… }\{1,x,x^2,x^3,\dots\}, independent by the same Vandermonde-type / degree argument as for polynomials), BB is infinite, so we may pick some other element g∈Bg \in B with g≠1g \ne 1. Define φ:V→R\varphi: V \to \mathbb{R} on the basis BB by

φ(g)=nfor n=1,2,3,… along a chosen countably infinite subset {g1,g2,… }⊂B∖{1},φ(b)=0 for all other b∈B,\varphi(g) = n \quad \text{for } n=1,2,3,\dots \text{ along a chosen countably infinite subset } \{g_1,g_2,\dots\}\subset B\setminus\{1\}, \qquad \varphi(b) = 0 \text{ for all other } b \in B,

where we additionally arrange (by rescaling within the construction, or just by picking, using the Hamel-basis extension freedom, a sequence gk∈Bg_k \in B with ∥gk∥∞≤1\|g_k\|_\infty \le 1 for each kk — this is possible because we may replace any basis vector bb by b/∥b∥∞b/\|b\|_\infty, which remains a valid basis) that ∥gk∥∞≤1\|g_k\|_\infty \le 1 for all kk. Extend φ\varphi to all of VV by linearity: every f∈Vf \in V has a unique finite basis expansion f=∑cbbf = \sum c_b b, and we set φ(f)=∑cbφ(b)\varphi(f) = \sum c_b \varphi(b) (a finite sum, well-defined by uniqueness of Hamel coordinates). This φ\varphi is a well-defined linear functional by the same coordinate argument as in the Direct Sum Corollary. Now φ\varphi is unbounded: φ(gk)=k\varphi(g_k) = k while ∥gk∥∞≤1\|g_k\|_\infty \le 1, so

sup⁡∥f∥∞≤1∣φ(f)∣≥sup⁡k∣φ(gk)∣=sup⁡kk=∞.\sup_{\|f\|_\infty \le 1} |\varphi(f)| \ge \sup_k |\varphi(g_k)| = \sup_k k = \infty.

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 φ\varphi is unbounded on the unit ball, φ\varphi 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 C[0,1]C[0,1], which (as in Example 1) cannot be exhibited explicitly.

CounterexampleWhy finiteness of the spanning set cannot be dropped: a "basis" that only handles finite sums fails to reach the whole space

The Hamel-basis theorem is often mis-stated as: "the standard unit vectors e1,e2,e3,…e_1,e_2,e_3,\dots form a basis of the sequence space RN\mathbb{R}^\mathbb{N}." This is false, and seeing why illustrates exactly which hypothesis silently gets dropped. Consider V=RNV = \mathbb{R}^\mathbb{N} again, and let E={e1,e2,e3,… }E = \{e_1, e_2, e_3, \dots\} where ene_n has a 11 in coordinate nn and 00 elsewhere. EE is linearly independent: any finite subset {en1,…,enk}\{e_{n_1},\dots,e_{n_k}\} satisfies ∑cieni=0⇒ci=0\sum c_i e_{n_i} = 0 \Rightarrow c_i = 0 for all ii, by comparing coordinates. But EE does not satisfy the spanning condition in the Hamel-basis definition, because that condition demands every vector be a finite linear combination. The sequence x=(1,1,1,1,… )x = (1,1,1,1,\dots) (all ones) is not a finite linear combination of the ene_n: any finite combination c1en1+⋯+ckenkc_1 e_{n_1} + \cdots + c_k e_{n_k} has only finitely many nonzero coordinates, while xx has infinitely many nonzero (in fact all) coordinates. So x∉span⁡(E)x \notin \operatorname{span}(E) in the Hamel sense, even though one is tempted to write x=∑nenx = \sum_{n} e_n 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 ∑cnen\sum c_n e_n), not a Hamel basis, and the two coincide only in finite dimensions where all sums are automatically finite. EE is a genuine linearly independent set but is only a Hamel basis of the proper subspace

c00={(xn)∈RN:xn=0 for all but finitely many n}⊊RN.c_{00} = \{(x_n) \in \mathbb{R}^\mathbb{N} : x_n = 0 \text{ for all but finitely many } n\} \subsetneq \mathbb{R}^\mathbb{N}.

Completing EE to an actual Hamel basis of the full space RN\mathbb{R}^\mathbb{N} requires adjoining uncountably many further, non-explicit vectors (such as xx above and vastly more), exactly as flagged in Example 1.

Scope, edge cases & common traps

Finite-dimensional factInfinite-dimensional statusWhy
Every spanning set contains a basis; every basis has the same finite sizeStill 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 explicitlyUsually false for familiar analytic spacesExistence proof is non-constructive (depends on choice)
span⁡\operatorname{span} of a countable set can be the whole spaceOften false: e.g. E={en}E=\{e_n\} only spans c00⊊RNc_{00}\subsetneq \mathbb{R}^\mathbb{N}Only finite combinations allowed in Hamel spanning
Every linear map is continuousFalseCounterexample: discontinuous φ\varphi built from a Hamel basis of C[0,1]C[0,1]
Every subspace has a well-defined "dimension complement" that is topologically niceTrue algebraically (every subspace has a Hamel complement) but the complement need not be a closed subspace, or even measurable, in a normed settingComplements come from extending a basis of the subspace to VV, an act of choice with no topological control
A proper subspace can't be isomorphic to the whole spaceFalseThe 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
GC
Georg Cantor
1845–1918 · Founder of set theory, whose cardinal arithmetic underlies the invariance-of-dimension theorem for infinite bases

Georg Cantor developed the theory of cardinal numbers and proved that infinite sets come in different sizes, most famously that ∣R∣>∣N∣|\mathbb{R}| > |\mathbb{N}|. 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 "dim⁡(RN)=2ℵ0\dim(\mathbb{R}^\mathbb{N}) = 2^{\aleph_0}." 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.

History
- 1874 — Cantor shows the real numbers are uncountable, establishing that infinite sets have different cardinalities.
- 1888 — Giuseppe Peano gives one of the first modern axiomatic definitions of a vector space, in finite dimension.
- 1904–1908 — Ernst Zermelo formulates the Axiom of Choice and, later, the Zermelo–Fraenkel axioms, providing the logical foundation later used to prove every vector space has a basis.
- 1932 — Hamel-type bases (following Georg Hamel's 1905 use of a basis of R\mathbb{R} over Q\mathbb{Q} to build a pathological additive function) become a standard tool; the general existence theorem for arbitrary vector spaces is folklore built directly on Zorn's Lemma (1935).
- 1940s–1950s — Banach space theory (Banach, Steinhaus) develops Schauder bases and open-mapping/closed-graph theorems, formalizing exactly why Hamel bases are analytically unusable and topological substitutes are needed.
Does every infinite-dimensional vector space really have a basis, or is this only true for "nice" spaces like Rn\mathbb{R}^n?

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 C[0,1]C[0,1], ℓ2\ell^2, or RN\mathbb{R}^\mathbb{N}, 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 ∑cnbn\sum c_n b_n in the given norm. In infinite dimensions these notions genuinely diverge: a countable Schauder basis like {en}\{e_n\} in ℓ2\ell^2 is far too small to be a Hamel basis (Hamel dimension of ℓ2\ell^2 is 2ℵ02^{\aleph_0}), because Hamel spanning forbids the infinite sums that make Schauder bases work.

Why does Vandermonde's determinant appear when proving dim⁡(RN)=2ℵ0\dim(\mathbb{R}^\mathbb{N}) = 2^{\aleph_0}?

To show the family r(t)=(1,t,t2,… )r^{(t)}=(1,t,t^2,\dots), t∈Rt\in\mathbb{R}, is linearly independent, one must rule out any nontrivial finite dependency ∑i=1kcir(ti)=0\sum_{i=1}^k c_i r^{(t_i)}=0 for distinct t1,…,tkt_1,\dots,t_k. Truncating to the first kk coordinates converts this to a linear system whose coefficient matrix is a Vandermonde matrix, whose determinant ∏i<j(tj−ti)\prod_{i<j}(t_j-t_i) is nonzero precisely because the tit_i are distinct. A nonzero determinant forces the only solution to be c1=⋯=ck=0c_1=\cdots=c_k=0, 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 VV 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 S(x1,x2,x3,… )=(0,x1,x2,… )S(x_1,x_2,x_3,\dots) = (0,x_1,x_2,\dots) on RN\mathbb{R}^\mathbb{N} is injective and linear, but its image is the proper subspace of sequences with first coordinate 00; more strikingly, sequence spaces like RN\mathbb{R}^\mathbb{N} are even linearly isomorphic to RN×RN\mathbb{R}^\mathbb{N}\times\mathbb{R}^\mathbb{N}, since both have Hamel dimension 2ℵ02^{\aleph_0}.

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 ℵ0\aleph_0 or 2ℵ02^{\aleph_0}), 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.

Before this