Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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 as a vector space over 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 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 be the rationals (The rationals as equivalence classes of pairs of integers), a field (The rationals form a field). Let ι:Q→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]. Then:

  1. QR 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 QR 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); setting q⋅x:=ι(q) x also makes R a vector space over Q itself;
  2. R has a basis over QR (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 is infinite-dimensional over QR (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis): no basis of R over QR 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 as a 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, the field Q, the unique field homomorphism ι:Q→R, and QR=ι[Q].

[L1]

There is a unique field homomorphism ι:Q→R and it is injective (The unique embedding of ℚ into an ordered field); a field homomorphism satisfies φ(x+y)=φ(x)+φ(y), φ(xy)=φ(x)φ(y), φ(1)=1, φ(0)=0, φ(−x)=−φ(x) and φ(x−1)=φ(x)−1 for x≠0 (Field homomorphism and embedding); 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).

[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 scalar multiplication (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, Field).

[L5]

Q≈N (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 is uncountable (R is uncountable (Cantor's nested intervals, 1874)); a finite set is equinumerous with exactly one natural (The pigeonhole principle on N); "at most countable" means finite or equinumerous with N, and this property transfers along a bijection (Finite, countably infinite, countable, uncountable, Equinumerous sets, A≈B and A⪯B, Injection, surjection, bijection).

Verification

technique · direct
1.1

Claim 1. QR=ι[Q] is a subfield of R: it contains ι(1)=1; for p,q∈Q it contains ι(p)−ι(q)=ι(p−q) and ι(p)ι(q)=ι(pq); and if ι(q)≠0 then q≠0, since ι(0)=0, so ι(q)−1=ι(q−1)∈QR. Since R is a vector space over itself, restriction of scalars makes it a vector space over QR, with the field multiplication restricted to QR×R. The operation (q,x)↦ι(q)x is a map Q×R→R, and it satisfies (V2) to (V5) because ι preserves sums and products and ι(1)=1, while (V1) is the abelian group (R,+,0); so it makes R a vector space over Q.

L1L2
1.2

QR is at most countable: ι is injective with image QR, hence a bijection Q→QR, and Q≈N; composing bijections gives QR≈N.

L1L5
1.3

If K is at most countable then so is Kn, the set of functions n→K, for every n∈N. By induction on n: at n=0 the set K0 has exactly one element, the empty function, so it is finite; and the map Kσ(n)→Kn×K sending f to the pair consisting of its restriction to n and its value at n is a bijection, since σ(n)=n∪{n} and n∉n, so a function on σ(n) is determined by, and may be assembled from, those two data. Hence Kσ(n)≈Kn×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:n→R and scalars λ:n→Q, the vector ∑i<nλi⋅vi computed in the Q-structure is by definition ∑i<nι(λi)vi, computed in the QR-structure; the two structures have the same underlying set, the same addition and the same zero, so their finite sums agree. Since ι is a bijection Q→QR, the scalar lists λ:n→Q and ι∘λ:n→QR correspond bijectively, and λi=0 for all i exactly when ι(λi)=0 for all i. 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 is a vector space over QR by step 1.1, and every vector space has a basis, so a basis B of R over QR exists.

step 1.1L3
2.2

Claim 3. Suppose some basis B of R over QR were finite, say B≈n. A bijection n→B is an injective list whose image is a basis, hence an ordered basis, so every x∈R is ∑i<nλibi for exactly one λ:n→QR. The resulting map Φ:R→(QR)n, sending x to that λ, is injective, since Φ(x)=Φ(y) makes x and y the same sum. By steps 1.2 and 1.3 the set (QR)n is at most countable, hence so is its subset Φ[R]; and Φ is a bijection R→Φ[R], so R is at most countable, contradicting the uncountability of R. So no basis of R over QR is finite, and R is infinite-dimensional over QR.

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 as a 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 · two levels

111 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