Alphabeta Math
LemmaStatement: 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.

Assuming the Axiom of Choice, R has a Hamel basis over Q: there is B⊆R such that every real is a finite Q-linear combination of elements of B in exactly one way, and each basis vector carries a well-defined Q-linear coefficient map

Statement

Assume the Axiom of Choice (The Axiom of Choice). The hypothesis is genuinely used: it enters through Every vector space has a basis, whose own Statement begins "Assume the Axiom of Choice", and which rests on Zorn's lemma.

Write Q for the canonical copy {q^:q∈Q} of the rationals inside R (The rationals embed densely in the reals). Then Q is a subfield of R (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations) and R is a vector space over Q by restriction of scalars (A field is a vector space over itself, and over any subfield K⊆F every F-vector space is a K-vector space by restricting the scalars, Vector space over a field); all spans, linear independence and bases below are taken in that structure. Then:

  1. Existence. R has a basis B over Q (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis), called a Hamel basis.
  2. Representation. Every real x is x=∑i<nλibi for some n∈N, some injective list b:n→B (Injection, surjection, bijection) and some λ:n→Q (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S).
  3. Uniqueness along a list. For a fixed n and a fixed injective b:n→B, if λ,μ:n→Q satisfy ∑i<nλibi=∑i<nμibi, then λi=μi for every i<n.
  4. The coefficient map of a basis vector. Fix b⋆∈B and put Wb⋆:=span⁡(B∖{b⋆}). Every real x is x=λ b⋆+w with λ∈Q and w∈Wb⋆ in exactly one way. Writing Λb⋆(x):=λ for that unique scalar, the map Λb⋆:R→Q satisfies Λb⋆(x+y)=Λb⋆(x)+Λb⋆(y),Λb⋆(qx)=q Λb⋆(x)  (q∈Q),Λb⋆(b⋆)=1, its range is the whole of Q, and { x∈R:Λb⋆(x)=0 }=Wb⋆.
  5. The complement is not trivial. Wb⋆≠{0} for every b⋆∈B.

Claim 2 together with claim 4 is the precise content of the phrase "in exactly one way" in the title: a real is a finite Q-combination of basis vectors, and the coefficient attached to each single basis vector is determined by the real alone.

Facts & Assumptions

Given: The field R, the canonical copy Q⊆R of the rationals, and the Axiom of Choice.

[A1]

The Axiom of Choice, used only through [L4] (The Axiom of Choice, Zorn's lemma).

[L1]

The map q↦q^ is an embedding of ordered fields of Q into R (The rationals embed densely in the reals); a subfield is a subset containing 1, closed under a−b and ab, and containing x−1 for each nonzero x in it (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations, Field, Complete ordered field (least-upper-bound property)).

[L2]

A field is a vector space over itself, and an F-vector space is a K-vector space for every subfield K⊆F by restricting the scalars (A field is a vector space over itself, and over any subfield K⊆F every F-vector space is a K-vector space by restricting the scalars, Vector space over a field).

[L5]

For S⊆V: S is linearly dependent if and only if some s∈S lies in span⁡(S∖{s}); and span⁡(S) is already the set of linear combinations of injective finite lists into S (A subset S⊆V is linearly dependent if and only if some s∈S lies in span⁡(S∖{s}); and span⁡(S) is already the set of linear combinations of INJECTIVE finite lists into S, claims 1 and 2, span⁡(S) is exactly the set of linear combinations of finite lists of elements of S, and span⁡(∅)={0V}).

[L6]

A finite list v:n→V is an ordered basis of V if and only if every x∈V is ∑i<nλivi for exactly one λ:n→F; an ordered basis is an injective list whose image is a basis; and for a linear subspace U⊆V and A⊆U the readings of "A is linearly independent" and "A is a basis" computed in U and in V agree (A finite list v:n→V is an ordered basis if and only if every x∈V equals ∑i<nλivi for exactly one λ:n→F; those scalars are the coordinates of x in that ordered basis, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, The natural numbers N (von Neumann)).

[L8]

Q≈N and R is uncountable; a nonempty at most countable set is the image of a surjection from N, and the image of a surjection from N is at most countable (Q is countably infinite, R is uncountable (Cantor's nested intervals, 1874), A nonempty set is at most countable iff it is a surjective image of N, Finite, countably infinite, countable, uncountable).

Proof

technique · direct
1.1

Q={q^:q∈Q} is a subfield of R: it contains 1^=1; it is closed under differences and products, since p^−q^=p−q^ and p^ q^=pq^; and if q^≠0 then q≠0 and q^−1=q−1^ lies in it.

L1
2.1

R is a vector space over itself, so restricting the scalars to the subfield Q makes R a vector space over Q, with the field addition as vector addition and the field multiplication restricted to Q×R as scalar multiplication.

step 1.1L2
3.1

Claim 1: assuming the Axiom of Choice, that vector space has a basis B, a linearly independent subset of R with span⁡(B)=R.

step 2.1A1L4
4.1

Claim 2: since span⁡(B)=R and the span of a set is already the set of linear combinations of injective finite lists into it, every real x is ∑i<nλibi with b:n→B injective and λ:n→Q.

step 3.1L5
4.2

Claim 3: let b:n→B be injective and put U:=span⁡(b[n]), a linear subspace of R. The list b is linearly independent, since B is a linearly independent subset and b is an injective finite list into B; its image b[n] spans U by construction, so b[n] is a basis of U and b is an ordered basis of U, independence and spanning being the same conditions read in U as in R.

step 3.1L3L6
4.3

Fix b⋆∈B and put U0:=span⁡{b⋆}={ λb⋆:λ∈Q } and U1:=Wb⋆=span⁡(B∖{b⋆}), both linear subspaces of R.

step 3.1L3construct
5.1

With b and U as in step 4.2, the coordinate theorem applied to the vector space U says that every x∈U is ∑i<nλibi for exactly one λ:n→Q; in particular ∑i<nλibi=∑i<nμibi forces λ=μ, which is claim 3.

step 4.2L6
5.2

U0+U1=R. Indeed U0+U1=span⁡(U0∪U1); the set B is contained in U0∪U1, since b⋆∈U0 and B∖{b⋆}⊆U1 by extensiveness of the span, so R=span⁡(B)⊆span⁡(U0∪U1) by monotonicity; and U0∪U1⊆span⁡(B), again by monotonicity, so span⁡(U0∪U1)⊆span⁡(span⁡(B))=span⁡(B)=R by idempotence.

step 3.1step 4.3L3L7
5.3

b⋆≠0 and b⋆∉U1. If b⋆ lay in span⁡(B∖{b⋆}) then B would be linearly dependent, contrary to step 3.1; and 0∈B would likewise make B dependent, since 0∈span⁡(B∖{0}), every span containing the zero vector.

step 3.1step 4.3L5
6.1

U0∩U1={0}. Let z∈U0∩U1 and write z=λb⋆ with λ∈Q. If λ≠0 then b⋆=λ−1z∈U1, because U1 is a linear subspace and λ−1∈Q, contradicting step 5.3; so λ=0 and z=0.

step 4.3step 5.3L3
7.1

Hence R=U0⊕U1: condition (D1) is step 5.2, and condition (D2) is step 6.1, since for the two-member family the sum of the other summands is U1 in the one case and U0 in the other. By the direct-sum criterion every real x is u0+u1 with u0∈U0 and u1∈U1 in exactly one way.

step 5.2step 6.1L7
8.1

Writing u0=λb⋆, the scalar λ∈Q is determined by u0, since b⋆≠0; so Λb⋆(x):=λ is a well-defined map R→Q, and x=Λb⋆(x) b⋆+w with w∈Wb⋆ in exactly one way.

step 5.3step 7.1L3
9.1

Λb⋆ is additive and Q-homogeneous: if x=λb⋆+w and y=μb⋆+w′ with w,w′∈Wb⋆, then x+y=(λ+μ)b⋆+(w+w′) with w+w′∈Wb⋆, and qx=(qλ)b⋆+qw with qw∈Wb⋆ for q∈Q, both because Wb⋆ is a linear subspace; uniqueness in step 8.1 then identifies the coefficients.

step 8.1L3
10.1

Λb⋆(b⋆)=1, from the representation b⋆=1⋅b⋆+0; the range of Λb⋆ is all of Q, since Λb⋆(qb⋆)=q for every q∈Q; and Λb⋆(x)=0 holds exactly when x=0⋅b⋆+w=w∈Wb⋆. Claim 4 is proved.

step 8.1step 9.1
11.1

Claim 5: if Wb⋆={0} then step 8.1 gives R={λb⋆:λ∈Q}. That set is the image of Q under λ↦λb⋆, and Q is the image of a surjection from N, so composing gives a surjection from N onto R and R would be at most countable, contradicting its uncountability. So Wb⋆≠{0}.

step 8.1L8∎

Remarks

  • How this differs from R as a vector space over Q has a basis, and every such basis is infinite; the existence proof exhibits none, exactly. That item, homed on the examples page of Linear independence, bases and dimension, proves three things: that R is a vector space over the canonical copy of Q, that it has a basis there, and that every such basis is infinite, together with the observation that the existence proof exhibits none. The present lemma proves the first two and does not prove the third: nothing above says that a Hamel basis is infinite. What it adds instead is claims 2 to 5 — the representation by injective lists, uniqueness of the coefficients along a list, the coefficient map Λb⋆ of a single basis vector with its kernel, and the fact that Wb⋆≠{0} — none of which appears there. So neither statement contains the other, and they are not the same statement.

The duplication of the two shared clauses is deliberate. An examples page is a leaf of this library and nothing outside it may depend on an item homed there, so a citable Hamel basis had to be built on a page that is not a leaf. The proofs of those clauses are the same proof, and no originality is claimed for them.

Depends on

Used by

Dependency tree · two levels

98 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