Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

R\mathbb{R} as a vector space over Q\mathbb{Q} has a basis, and every such basis is infinite; the existence proof exhibits none

Example

Assume the Axiom of Choice (The Axiom of Choice). Let R\mathbb{R} be the real numbers (The real numbers), a field (The reals form a field) and an ordered field (The reals form a totally ordered field, Ordered field), with the least-upper-bound property and hence complete as an ordered field (The Cauchy-sequence reals have the least-upper-bound property, Complete ordered field (least-upper-bound property)), and let Q\mathbb{Q} be the rationals (The rationals as equivalence classes of pairs of integers), a field (The rationals form a field). Let ι:QR\iota : \mathbb{Q} \to \mathbb{R} be the unique field homomorphism (The unique embedding of ℚ into an ordered field, Field homomorphism and embedding), which is injective, and put QR:=ι[Q]\mathbb{Q}_{\mathbb{R}} := \iota[\mathbb{Q}]. Then:

  1. QR\mathbb{Q}_{\mathbb{R}} is a subfield of R\mathbb{R} (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations) and R\mathbb{R} is a vector space over QR\mathbb{Q}_{\mathbb{R}} by restriction of scalars (A field is a vector space over itself, and over any subfield KFK \subseteq F every FF-vector space is a KK-vector space by restricting the scalars); setting qx:=ι(q)xq \cdot x := \iota(q)\,x also makes R\mathbb{R} a vector space over Q\mathbb{Q} itself;
  2. R\mathbb{R} has a basis over QR\mathbb{Q}_{\mathbb{R}} (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Every vector space has a basis);
  3. R\mathbb{R} is infinite-dimensional over QR\mathbb{Q}_{\mathbb{R}} (Finite-dimensional vector space, and its dimension dimFV\dim_F V; infinite-dimensional means having no finite basis): no basis of R\mathbb{R} over QR\mathbb{Q}_{\mathbb{R}} is finite;
  4. the two structures of claim 1 have the same linearly independent subsets, the same spans and the same bases, so claims 2 and 3 hold verbatim for R\mathbb{R} as a Q\mathbb{Q}-vector space.

The existence proof exhibits no basis. Claim 2 comes from Every vector space has a basis, which runs through Zorn's lemma and therefore through the Axiom of Choice; nothing in it names a real number belonging to the basis it produces. That is a statement about this proof. It is not claimed here that no basis can be exhibited by any means: that would be a metamathematical assertion about what is definable, and this library has established nothing of the kind.

Facts & Assumptions

Given: The Axiom of Choice; the complete ordered field R\mathbb{R}, the field Q\mathbb{Q}, the unique field homomorphism ι:QR\iota : \mathbb{Q} \to \mathbb{R}, and QR=ι[Q]\mathbb{Q}_{\mathbb{R}} = \iota[\mathbb{Q}].

[L1]

There is a unique field homomorphism ι:QR\iota : \mathbb{Q} \to \mathbb{R} and it is injective (The unique embedding of ℚ into an ordered field); a field homomorphism satisfies φ(x+y)=φ(x)+φ(y)\varphi(x+y) = \varphi(x)+\varphi(y), φ(xy)=φ(x)φ(y)\varphi(xy) = \varphi(x)\varphi(y), φ(1)=1\varphi(1) = 1, φ(0)=0\varphi(0) = 0, φ(x)=φ(x)\varphi(-x) = -\varphi(x) and φ(x1)=φ(x)1\varphi(x^{-1}) = \varphi(x)^{-1} for x0x \ne 0 (Field homomorphism and embedding); a subfield is a subset containing 11, closed under aba - b and abab, and containing x1x^{-1} for each nonzero xx in it (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations).

[L2]

A field is a vector space over itself, and an FF-vector space is a KK-vector space for every subfield KFK \subseteq F by restricting the scalar multiplication (A field is a vector space over itself, and over any subfield KFK \subseteq F every FF-vector space is a KK-vector space by restricting the scalars, Vector space over a field, Field).

[L5]

QN\mathbb{Q} \approx \mathbb{N} (Q\mathbb{Q} is countably infinite); a product of two at most countable sets is at most countable (A product of two at most countable sets is at most countable); a subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable); the Cauchy-sequence reals have the least-upper-bound property and hence form a complete ordered field (The Cauchy-sequence reals have the least-upper-bound property, Complete ordered field (least-upper-bound property)), so R\mathbb{R} is uncountable (R\mathbb{R} is uncountable (Cantor's nested intervals, 1874)); a finite set is equinumerous with exactly one natural (The pigeonhole principle on N\mathbb{N}); "at most countable" means finite or equinumerous with N\mathbb{N}, and this property transfers along a bijection (Finite, countably infinite, countable, uncountable, Equinumerous sets, ABA \approx B and ABA \preceq B, Injection, surjection, bijection).

Verification

technique · direct
1.1

Claim 1. QR=ι[Q]\mathbb{Q}_{\mathbb{R}} = \iota[\mathbb{Q}] is a subfield of R\mathbb{R}: it contains ι(1)=1\iota(1) = 1; for p,qQp, q \in \mathbb{Q} it contains ι(p)ι(q)=ι(pq)\iota(p) - \iota(q) = \iota(p-q) and ι(p)ι(q)=ι(pq)\iota(p)\iota(q) = \iota(pq); and if ι(q)0\iota(q) \ne 0 then q0q \ne 0, since ι(0)=0\iota(0) = 0, so ι(q)1=ι(q1)QR\iota(q)^{-1} = \iota(q^{-1}) \in \mathbb{Q}_{\mathbb{R}}. Since R\mathbb{R} is a vector space over itself, restriction of scalars makes it a vector space over QR\mathbb{Q}_{\mathbb{R}}, with the field multiplication restricted to QR×R\mathbb{Q}_{\mathbb{R}} \times \mathbb{R}. The operation (q,x)ι(q)x(q,x) \mapsto \iota(q)x is a map Q×RR\mathbb{Q} \times \mathbb{R} \to \mathbb{R}, and it satisfies (V2) to (V5) because ι\iota preserves sums and products and ι(1)=1\iota(1) = 1, while (V1) is the abelian group (R,+,0)(\mathbb{R},+,0); so it makes R\mathbb{R} a vector space over Q\mathbb{Q}.

L1L2
1.2

QR\mathbb{Q}_{\mathbb{R}} is at most countable: ι\iota is injective with image QR\mathbb{Q}_{\mathbb{R}}, hence a bijection QQR\mathbb{Q} \to \mathbb{Q}_{\mathbb{R}}, and QN\mathbb{Q} \approx \mathbb{N}; composing bijections gives QRN\mathbb{Q}_{\mathbb{R}} \approx \mathbb{N}.

L1L5
1.3

If KK is at most countable then so is KnK^{n}, the set of functions nKn \to K, for every nNn \in \mathbb{N}. By induction on nn: at n=0n = 0 the set K0K^{0} has exactly one element, the empty function, so it is finite; and the map Kσ(n)Kn×KK^{\sigma(n)} \to K^{n} \times K sending ff to the pair consisting of its restriction to nn and its value at nn is a bijection, since σ(n)=n{n}\sigma(n) = n \cup \{n\} and nnn \notin n, so a function on σ(n)\sigma(n) is determined by, and may be assembled from, those two data. Hence Kσ(n)Kn×KK^{\sigma(n)} \approx K^{n} \times K, which is at most countable by the inductive hypothesis and the product theorem, and countability transfers along the bijection.

L5L6
1.4

Claim 4. For a list v:nRv : n \to \mathbb{R} and scalars λ:nQ\lambda : n \to \mathbb{Q}, the vector i<nλivi\sum_{i<n}\lambda_i \cdot v_i computed in the Q\mathbb{Q}-structure is by definition i<nι(λi)vi\sum_{i<n}\iota(\lambda_i)v_i, computed in the QR\mathbb{Q}_{\mathbb{R}}-structure; the two structures have the same underlying set, the same addition and the same zero, so their finite sums agree. Since ι\iota is a bijection QQR\mathbb{Q} \to \mathbb{Q}_{\mathbb{R}}, the scalar lists λ:nQ\lambda : n \to \mathbb{Q} and ιλ:nQR\iota \circ \lambda : n \to \mathbb{Q}_{\mathbb{R}} correspond bijectively, and λi=0\lambda_i = 0 for all ii exactly when ι(λi)=0\iota(\lambda_i) = 0 for all ii. So a vanishing combination exists on one side exactly when it does on the other, and likewise for representations of an arbitrary vector; hence the two structures have the same linearly independent subsets, the same spans and the same bases.

L1L3L4
2.1

Claim 2. R\mathbb{R} is a vector space over QR\mathbb{Q}_{\mathbb{R}} by step 1.1, and every vector space has a basis, so a basis BB of R\mathbb{R} over QR\mathbb{Q}_{\mathbb{R}} exists.

step 1.1L3
2.2

Claim 3. Suppose some basis BB of R\mathbb{R} over QR\mathbb{Q}_{\mathbb{R}} were finite, say BnB \approx n. A bijection nBn \to B is an injective list whose image is a basis, hence an ordered basis, so every xRx \in \mathbb{R} is i<nλibi\sum_{i<n}\lambda_i b_i for exactly one λ:nQR\lambda : n \to \mathbb{Q}_{\mathbb{R}}. The resulting map Φ:R(QR)n\Phi : \mathbb{R} \to (\mathbb{Q}_{\mathbb{R}})^{n}, sending xx to that λ\lambda, is injective, since Φ(x)=Φ(y)\Phi(x) = \Phi(y) makes xx and yy the same sum. By steps 1.2 and 1.3 the set (QR)n(\mathbb{Q}_{\mathbb{R}})^{n} is at most countable, hence so is its subset Φ[R]\Phi[\mathbb{R}]; and Φ\Phi is a bijection RΦ[R]\mathbb{R} \to \Phi[\mathbb{R}], so R\mathbb{R} is at most countable, contradicting the uncountability of R\mathbb{R}. So no basis of R\mathbb{R} over QR\mathbb{Q}_{\mathbb{R}} is finite, and R\mathbb{R} is infinite-dimensional over QR\mathbb{Q}_{\mathbb{R}}.

step 1.1step 1.2step 1.3L3L4L5
3.1

Claim 1 is step 1.1, claim 2 is step 2.1, claim 3 is step 2.2, and claim 4 is step 1.4; by claim 4 the last two transfer to R\mathbb{R} as a Q\mathbb{Q}-vector space.

step 1.1step 1.4step 2.1step 2.2

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 172 results over 37 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources