Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-25
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.

Uniqueness of the complete ordered field: R up to a unique isomorphism

Statement

Any two complete ordered fields F and G (Complete ordered field (least-upper-bound property)) are isomorphic via a unique ordered-field isomorphism (Ordered-field isomorphism) φ:F→G, and this φ fixes Q (φ∘ιF=ιG). Consequently R is the unique complete ordered field up to a unique isomorphism, and it admits Q as an ordered subfield via ιF.

Facts & Assumptions

Given: Complete ordered fields F,G with canonical embeddings ιF:Q→F, ιG:Q→G; for x∈F set Lx:={ιG(q):q∈Q, ιF(q)<x}⊆G and define φ:F→G by φ(x):=sup⁡Lx, and symmetrically ψ:G→F by ψ(y):=sup⁡{ιF(q):q∈Q, ιG(q)<y}.

[L1]

Every complete ordered field is Archimedean (Every complete ordered field is Archimedean).

[L2]

The canonical embedding ι:Q→F is a field homomorphism that is injective and order-preserving in both directions (q<r  ⟺  ι(q)<ι(r)); likewise ιG (The unique embedding of ℚ into an ordered field).

[L3]

Density: in an Archimedean ordered field, for u<v there is q∈Q with u<ι(q)<v (ℚ is dense in every Archimedean ordered field).

[L4]

Any field homomorphism between ordered fields fixes Q (Field homomorphisms between ordered fields fix Q).

[L5]

A field homomorphism from a complete ordered field into an ordered field is injective and order-preserving, hence (the domain being totally ordered) order-preserving in both directions (Homomorphisms out of a complete ordered field are order-preserving).

[L6]

Completeness: every nonempty subset of F (resp. G) bounded above has a least upper bound (Complete ordered field (least-upper-bound property)).

[L7]

An ordered-field isomorphism is a bijective field homomorphism order-preserving in both directions; a field homomorphism preserves +, ⋅, and 1 (Ordered-field isomorphism, Field homomorphism and embedding).

[L8]

Least-upper-bound calculus in G: for nonempty T⊆G bounded above with u=sup⁡T, any upper bound w of T satisfies w≥u; and translation z↦z+c and, for c>0, scaling z↦cz preserve ≤ as well as <. Order is preserved by adding a constant and by adding inequalities (claim 1) and Sign rules for products and monotonicity of multiplication (claim 4) state the STRICT forms and only those, z<z′⇒z+c<z′+c and, for c>0, z<z′  ⟺  cz<cz′; the nonstrict forms used here are those together with the equality cases, in which z+c=z′+c and cz=cz′, the order being total by trichotomy (Ordered field). Hence from  α≥ιG(q)+c for all q with ιF(q)<x one gets α≥φ(x)+c, and from  α≥ιG(q) c (with c>0) for all such q with q>0 one gets α≥φ(x) c (using that the positive rationals below x are cofinal when x>0).

Proof

technique · direct
1.1

For each x∈F, applying [L3] (with F Archimedean by [L1]) to x−1<x and to x<x+1 gives rationals a,b with ιF(a)<x<ιF(b); then ιG(a)∈Lx, and every ιG(q)∈Lx has ιF(q)<ιF(b) so q<b hence ιG(q)<ιG(b), so Lx is nonempty and bounded above and φ(x)=sup⁡Lx exists in G by [L6].

L1L2L3L6
1.2

If x>0, then applying [L3] to 0<x gives a rational q with 0<ιF(q)<x, whence q>0, ιG(q)>0, and ιG(q)∈Lx, so φ(x)=sup⁡Lx≥ιG(q)>0.

L2L3
1.3

For r∈Q, LιF(r)={ιG(q):q<r} by [L2]; ιG(r) is an upper bound, and any w<ιG(r) is exceeded by some ιG(q′)∈LιF(r) via density [L3] in G, so sup⁡=ιG(r), i.e. φ(ιF(r))=ιG(r).

L2L3
2.1

For rationals q,q′ with ιF(q)<x and ιF(q′)<x′, additivity of ιF gives ιF(q+q′)<x+x′, so ιG(q)+ιG(q′)=ιG(q+q′)∈Lx+x′ and φ(x+x′)≥ιG(q)+ιG(q′); fixing q′ and taking the sup over q, then over q′, yields φ(x+x′)≥φ(x)+φ(x′) by the least-upper-bound calculus [L8].

step 1.1L2L3L8
2.2

For any rational s with ιF(s)<x+x′ we have ιF(s)−x′<x; density [L3] gives a rational q with ιF(s)−x′<ιF(q)<x, so ιF(q)<x, and the left inequality gives ιF(s)−ιF(q)<x′, i.e. ιF(s−q)=ιF(s)−ιF(q)<x′ by additivity of ιF; whence ιG(s)=ιG(q)+ιG(s−q)≤φ(x)+φ(x′); as s was arbitrary and φ(x+x′)=sup⁡Lx+x′, the least upper bound is ≤φ(x)+φ(x′) [L8], i.e. φ(x+x′)≤φ(x)+φ(x′).

step 1.1L2L3L8
2.3

For x,x′>0 and positive rationals q,q′ with ιF(q)<x, ιF(q′)<x′, multiplying positives gives ιF(qq′)<xx′, so ιG(q)ιG(q′)=ιG(qq′)∈Lxx′ and φ(xx′)≥ιG(q)ιG(q′); since positive rationals below x are cofinal (as x>0) their images have supremum φ(x)>0, so scaling by ιG(q′)>0 and taking sups over q then q′ gives φ(xx′)≥φ(x)φ(x′) by the least-upper-bound calculus [L8].

step 1.1step 1.2L2L3L8algebra
2.4

For x,x′>0 and any positive rational s with ιF(s)<xx′ we have ιF(s)(x′)−1<x; density [L3] gives a rational q with ιF(s)(x′)−1<ιF(q)<x, where ιF(s)(x′)−1>0 (as s>0, x′>0), so ιF(q)>0 and q>0; the left inequality gives ιF(s)<ιF(q) x′, hence ιF(s/q)=ιF(s)ιF(q)−1<x′ (dividing by ιF(q)>0), while ιF(q)<x; therefore ιG(s)=ιG(q)ιG(s/q)≤φ(x)φ(x′), and as the positive rationals s with ιF(s)<xx′ are cofinal, φ(xx′)=sup⁡Lxx′≤φ(x)φ(x′) by [L8].

step 1.1step 1.2L2L3L8algebra
3.1

Combining the two inequalities, φ(x+x′)=φ(x)+φ(x′) for all x,x′∈F; in particular φ(0F)=0G and φ(−x)=−φ(x).

step 2.1step 2.2
3.2

Combining the two inequalities, φ(xx′)=φ(x)φ(x′) whenever x,x′>0.

step 2.3step 2.4
4.1

For arbitrary signs, φ(0F⋅x′)=0G=0G⋅φ(x′), and for x<0<x′ we get φ(xx′)=φ(−((−x)x′))=−φ((−x)x′)=−φ(−x)φ(x′)=φ(x)φ(x′) using step 3.1 and step 3.2; the remaining sign cases are identical, so φ(xx′)=φ(x)φ(x′) for all x,x′∈F.

step 3.1step 3.2
5.1

By step 3.1, step 4.1, and φ(1F)=ιG(1)=1G from step 1.3, φ preserves +, ⋅, and 1, so φ is a field homomorphism F→G.

step 1.3step 3.1step 4.1
6.1

Hence by [L5] (as F is complete) φ is injective and order-preserving in both directions, and by [L4] it fixes Q: φ∘ιF=ιG.

step 5.1L4L5
7.1

The construction and steps 1.1-6.1 used only that F and G are complete ordered fields with canonical embeddings ιF,ιG; applying that entire argument verbatim with the roles of F and G interchanged shows the symmetric map ψ:G→F is likewise an injective, order-preserving field homomorphism that fixes Q.

step 6.1
8.1

For x∈F, since φ fixes Q and is order-preserving in both directions, ιG(q)<φ(x)  ⟺  ιF(q)<x, so ψ(φ(x))=sup⁡{ιF(q):ιF(q)<x}=x by density [L3]; symmetrically φ(ψ(y))=y, so φ is a bijection with inverse ψ.

step 6.1step 7.1L3
9.1

Thus φ is a bijective field homomorphism order-preserving in both directions, i.e. an ordered-field isomorphism F≅G fixing Q.

step 6.1step 8.1L7
10.1

For uniqueness let χ:F→G be any ordered-field isomorphism; being such it is in particular a field homomorphism ([L7]), so by [L4] it fixes Q, and it is order-preserving, so for each x every ιG(q)∈Lx equals χ(ιF(q))<χ(x), making χ(x) an upper bound of Lx, hence χ(x)≥φ(x).

step 9.1L4L7
11.1

Conversely, were χ(x)>φ(x), density [L3] would give a rational q with φ(x)<ιG(q)<χ(x); then ιG(q)>sup⁡Lx forces ιF(q)≥x, since ιF(q)<x would put ιG(q) into Lx and hence below sup⁡Lx; so χ(x)≤χ(ιF(q))=ιG(q)<χ(x), which is impossible, hence χ(x)≤φ(x).

step 10.1L3L4
12.1

Therefore χ(x)=φ(x) for every x, so χ=φ: the ordered-field isomorphism is unique.

step 10.1step 11.1
13.1

Applying this to any two constructions of R, which are complete ordered fields, R is the unique complete ordered field up to a unique ordered-field isomorphism, and ιF:Q→R exhibits Q as an ordered subfield.

step 9.1step 12.1L2∎

Depends on

Used by

Dependency tree · two levels

27 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