Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04 rests on unproved material
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.

Rests on 1 statement not proved in this library. Every dependency marked below is recorded with a citation but is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

A Banach space has no countably infinite Hamel basis

Statement

Let X be a Banach space over K{R,C}. Then X has no countably infinite Hamel basis. Equivalently, there is no sequence (bn)nN of pairwise distinct vectors whose image is a basis of X 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 X and, for contradiction, a sequence (bn)nN of pairwise distinct vectors whose image is a Hamel basis of X.

[L1]

A Banach space is complete for its norm metric (Banach space).

[L2]

Finite-dimensional normed subspaces are closed (A finite-dimensional normed subspace is closed).

[L4]

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 ).

[L5]

A nonempty countable set is a surjective image of N, and every nonempty subset of N has a least element (A nonempty set is at most countable iff it is a surjective image of N, The well-ordering principle).

Proof

technique · direct
1.1

Let QK:=Q in the real case and QK:={a+ib:a,bQ} in the complex case. In either case QK is countable by [L3], and it is dense in K. Let DX be the set of all finite QK-linear combinations of the basis vectors bn. 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 D, so D is countable. Also 0D, so D is nonempty.

L3construct
1.2

For NN put FN:=spanR{b0,,bN} in the real case, and FN:=spanR{b0,ib0,,bN,ibN} in the complex case. In either case FN is finite-dimensional over R. It is proper: in the real case bN+1FN by linear independence of the basis image, and in the complex case a real-linear relation expressing bN+1 in terms of b0,ib0,,bN,ibN would be the same as a complex-linear relation expressing bN+1 in terms of b0,,bN. Thus [L2] makes every FN closed. Also X=NNFN, because every vector uses only finitely many basis vectors, and in the complex case every complex coefficient splits into real and imaginary parts.

L2givenalgebra
1.3

Every proper linear subspace of a normed space has empty interior. Indeed, if WX were a linear subspace containing some ball B(x,r), then B(0,r)W because W is closed under subtraction, and for any yX{0} the vector (r/(2y))y would lie in B(0,r)W, forcing y=(2y/r)(r/(2y))yW; also 0W. So W=X, contradiction.

givenalgebraassume-contra
2.1

By [L5], fix a surjection d:ND.

step 1.1L5choose
2.2

D is dense in X. Indeed, let x=j=0mλjbnjX and let ε>0. Choose qjQK with λjqj<ε/(2(m+1)(1+j=0mbnj)). Then xj=0mqjbnjj=0mλjqjbnj<ε. So every vector of X lies in the closure of D.

step 1.1algebrachoose
3.1

We now run the separable-complete Baire argument inside the open unit ball U0:={x:x<1}. Because F0 is closed with empty interior, the set U0F0 is nonempty and open. By step 2.2, the set A0:={mN:d(m)U0F0} is nonempty, so [L5] gives its least element m0. Put x0:=d(m0). Since U0F0 is open at x0, the set B0:={kN1:B(x0,1k)U0F0} is nonempty; let k0 be its least element and set r0:=1/k0. Then B(x0,r0)U0F0.

step 2.1step 2.2step 1.3L5chooseconstruct
3.2

Inductively, if closed balls B(xn,rn)U0Fn have been chosen with B(xn,rn)B(xn1,rn1/2) for n1, then B(xn,rn/2)Fn+1 is a nonempty open set. By step 2.2, the set An+1:={mN:d(m)B(xn,rn/2)Fn+1} is nonempty, so [L5] gives its least element mn+1. Put xn+1:=d(mn+1). Since B(xn,rn/2)Fn+1 is open at xn+1, the set Bn+1:={kN1:1k<rn2 and B(xn+1,1k)B(xn,rn/2)Fn+1} is nonempty; let kn+1 be its least element and set rn+1:=1/kn+1. Then B(xn+1,rn+1)B(xn,rn/2)Fn+1B(xn,rn), and rn+1<rn/2. Hence rnr0/2n for every n, so rn0.

step 2.1step 2.2step 1.3L5chooseconstruct
4.1

For m>n, the inclusion from step 3.2 gives xmB(xn,rn/2), so xmxn<rn/2. Hence (xn) is Cauchy. Since X is Banach, [L1] gives xnx for some xX. Each B(xn,rn) is closed and contains all later xm, so it contains the limit x; therefore xB(xn,rn)XFn for every n.

L1step 3.1step 3.2
5.1

Step 4.1 contradicts X=NFN 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 N, and not the unrestricted complete-metric Baire theorem.

L4step 1.2step 4.1discharge-contradiction

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

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