Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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\mathbb{R} up to a unique isomorphism

Statement

Any two complete ordered fields FF and GG (Complete ordered field (least-upper-bound property)) are isomorphic via a unique ordered-field isomorphism (Ordered-field isomorphism) φ:FG\varphi : F \to G, and this φ\varphi fixes Q\mathbb{Q} (φιF=ιG\varphi \circ \iota_F = \iota_G). Consequently R\mathbb{R} is the unique complete ordered field up to a unique isomorphism, and it admits Q\mathbb{Q} as an ordered subfield via ιF\iota_F.

Facts & Assumptions

Given: Complete ordered fields F,GF, G with canonical embeddings ιF:QF\iota_F : \mathbb{Q} \to F, ιG:QG\iota_G : \mathbb{Q} \to G; for xFx \in F set Lx:={ιG(q):qQ, ιF(q)<x}GL_x := \{\iota_G(q) : q \in \mathbb{Q},\ \iota_F(q) < x\} \subseteq G and define φ:FG\varphi : F \to G by φ(x):=supLx\varphi(x) := \sup L_x, and symmetrically ψ:GF\psi : G \to F by ψ(y):=sup{ιF(q):qQ, ιG(q)<y}\psi(y) := \sup\{\iota_F(q) : q \in \mathbb{Q},\ \iota_G(q) < y\}.

[L1]

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

[L2]

The canonical embedding ι:QF\iota : \mathbb{Q} \to F is a field homomorphism that is injective and order-preserving in both directions (q<r    ι(q)<ι(r)q < r \iff \iota(q) < \iota(r)); likewise ιG\iota_G (The unique embedding of ℚ into an ordered field).

[L3]

Density: in an Archimedean ordered field, for u<vu < v there is qQq \in \mathbb{Q} with u<ι(q)<vu < \iota(q) < v (ℚ is dense in every Archimedean ordered field).

[L4]

Any field homomorphism between ordered fields fixes Q\mathbb{Q} (Field homomorphisms between ordered fields fix Q\mathbb{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 FF (resp. GG) 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 ++, \cdot, and 11 (Ordered-field isomorphism, Field homomorphism and embedding).

[L8]

Least-upper-bound calculus in GG: for nonempty TGT \subseteq G bounded above with u=supTu = \sup T, any upper bound ww of TT satisfies wuw \ge u; and translation zz+cz \mapsto z + c and, for c>0c > 0, scaling zczz \mapsto cz preserve \le 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<zz+c<z+cz < z' \Rightarrow z + c < z' + c and, for c>0c > 0, z<z    cz<czz < z' \iff cz < cz'; the nonstrict forms used here are those together with the equality cases, in which z+c=z+cz + c = z' + c and cz=czcz = cz', the order being total by trichotomy (Ordered field). Hence from αιG(q)+c\,\alpha \ge \iota_G(q) + c for all qq with ιF(q)<x\iota_F(q) < x one gets αφ(x)+c\alpha \ge \varphi(x) + c, and from αιG(q)c\,\alpha \ge \iota_G(q)\,c (with c>0c > 0) for all such qq with q>0q > 0 one gets αφ(x)c\alpha \ge \varphi(x)\,c (using that the positive rationals below xx are cofinal when x>0x > 0).

Proof

technique · direct
1.1

For each xFx \in F, applying [L3] (with FF Archimedean by [L1]) to x1<xx - 1 < x and to x<x+1x < x + 1 gives rationals a,ba, b with ιF(a)<x<ιF(b)\iota_F(a) < x < \iota_F(b); then ιG(a)Lx\iota_G(a) \in L_x, and every ιG(q)Lx\iota_G(q) \in L_x has ιF(q)<ιF(b)\iota_F(q) < \iota_F(b) so q<bq < b hence ιG(q)<ιG(b)\iota_G(q) < \iota_G(b), so LxL_x is nonempty and bounded above and φ(x)=supLx\varphi(x) = \sup L_x exists in GG by [L6].

L1L2L3L6
1.2

If x>0x > 0, then applying [L3] to 0<x0 < x gives a rational qq with 0<ιF(q)<x0 < \iota_F(q) < x, whence q>0q > 0, ιG(q)>0\iota_G(q) > 0, and ιG(q)Lx\iota_G(q) \in L_x, so φ(x)=supLxιG(q)>0\varphi(x) = \sup L_x \ge \iota_G(q) > 0.

L2L3
1.3

For rQr \in \mathbb{Q}, LιF(r)={ιG(q):q<r}L_{\iota_F(r)} = \{\iota_G(q) : q < r\} by [L2]; ιG(r)\iota_G(r) is an upper bound, and any w<ιG(r)w < \iota_G(r) is exceeded by some ιG(q)LιF(r)\iota_G(q') \in L_{\iota_F(r)} via density [L3] in GG, so sup=ιG(r)\sup = \iota_G(r), i.e. φ(ιF(r))=ιG(r)\varphi(\iota_F(r)) = \iota_G(r).

L2L3
2.1

For rationals q,qq, q' with ιF(q)<x\iota_F(q) < x and ιF(q)<x\iota_F(q') < x', additivity of ιF\iota_F gives ιF(q+q)<x+x\iota_F(q + q') < x + x', so ιG(q)+ιG(q)=ιG(q+q)Lx+x\iota_G(q) + \iota_G(q') = \iota_G(q + q') \in L_{x + x'} and φ(x+x)ιG(q)+ιG(q)\varphi(x + x') \ge \iota_G(q) + \iota_G(q'); fixing qq' and taking the sup over qq, then over qq', yields φ(x+x)φ(x)+φ(x)\varphi(x + x') \ge \varphi(x) + \varphi(x') by the least-upper-bound calculus [L8].

step 1.1L2L3L8
2.2

For any rational ss with ιF(s)<x+x\iota_F(s) < x + x' we have ιF(s)x<x\iota_F(s) - x' < x; density [L3] gives a rational qq with ιF(s)x<ιF(q)<x\iota_F(s) - x' < \iota_F(q) < x, so ιF(q)<x\iota_F(q) < x, and the left inequality gives ιF(s)ιF(q)<x\iota_F(s) - \iota_F(q) < x', i.e. ιF(sq)=ιF(s)ιF(q)<x\iota_F(s - q) = \iota_F(s) - \iota_F(q) < x' by additivity of ιF\iota_F; whence ιG(s)=ιG(q)+ιG(sq)φ(x)+φ(x)\iota_G(s) = \iota_G(q) + \iota_G(s - q) \le \varphi(x) + \varphi(x'); as ss was arbitrary and φ(x+x)=supLx+x\varphi(x + x') = \sup L_{x + x'}, the least upper bound is φ(x)+φ(x)\le \varphi(x) + \varphi(x') [L8], i.e. φ(x+x)φ(x)+φ(x)\varphi(x + x') \le \varphi(x) + \varphi(x').

step 1.1L2L3L8
2.3

For x,x>0x, x' > 0 and positive rationals q,qq, q' with ιF(q)<x\iota_F(q) < x, ιF(q)<x\iota_F(q') < x', multiplying positives gives ιF(qq)<xx\iota_F(qq') < xx', so ιG(q)ιG(q)=ιG(qq)Lxx\iota_G(q)\iota_G(q') = \iota_G(qq') \in L_{xx'} and φ(xx)ιG(q)ιG(q)\varphi(xx') \ge \iota_G(q)\iota_G(q'); since positive rationals below xx are cofinal (as x>0x > 0) their images have supremum φ(x)>0\varphi(x) > 0, so scaling by ιG(q)>0\iota_G(q') > 0 and taking sups over qq then qq' gives φ(xx)φ(x)φ(x)\varphi(xx') \ge \varphi(x)\varphi(x') by the least-upper-bound calculus [L8].

step 1.1step 1.2L2L3L8algebra
2.4

For x,x>0x, x' > 0 and any positive rational ss with ιF(s)<xx\iota_F(s) < xx' we have ιF(s)(x)1<x\iota_F(s)(x')^{-1} < x; density [L3] gives a rational qq with ιF(s)(x)1<ιF(q)<x\iota_F(s)(x')^{-1} < \iota_F(q) < x, where ιF(s)(x)1>0\iota_F(s)(x')^{-1} > 0 (as s>0s > 0, x>0x' > 0), so ιF(q)>0\iota_F(q) > 0 and q>0q > 0; the left inequality gives ιF(s)<ιF(q)x\iota_F(s) < \iota_F(q)\,x', hence ιF(s/q)=ιF(s)ιF(q)1<x\iota_F(s/q) = \iota_F(s)\iota_F(q)^{-1} < x' (dividing by ιF(q)>0\iota_F(q) > 0), while ιF(q)<x\iota_F(q) < x; therefore ιG(s)=ιG(q)ιG(s/q)φ(x)φ(x)\iota_G(s) = \iota_G(q)\iota_G(s/q) \le \varphi(x)\varphi(x'), and as the positive rationals ss with ιF(s)<xx\iota_F(s) < xx' are cofinal, φ(xx)=supLxxφ(x)φ(x)\varphi(xx') = \sup L_{xx'} \le \varphi(x)\varphi(x') by [L8].

step 1.1step 1.2L2L3L8algebra
3.1

Combining the two inequalities, φ(x+x)=φ(x)+φ(x)\varphi(x + x') = \varphi(x) + \varphi(x') for all x,xFx, x' \in F; in particular φ(0F)=0G\varphi(0_F) = 0_G and φ(x)=φ(x)\varphi(-x) = -\varphi(x).

step 2.1step 2.2
3.2

Combining the two inequalities, φ(xx)=φ(x)φ(x)\varphi(xx') = \varphi(x)\varphi(x') whenever x,x>0x, x' > 0.

step 2.3step 2.4
4.1

For arbitrary signs, φ(0Fx)=0G=0Gφ(x)\varphi(0_F \cdot x') = 0_G = 0_G \cdot \varphi(x'), and for x<0<xx < 0 < x' we get φ(xx)=φ(((x)x))=φ((x)x)=φ(x)φ(x)=φ(x)φ(x)\varphi(xx') = \varphi(-((-x)x')) = -\varphi((-x)x') = -\varphi(-x)\varphi(x') = \varphi(x)\varphi(x') using step 3.1 and step 3.2; the remaining sign cases are identical, so φ(xx)=φ(x)φ(x)\varphi(xx') = \varphi(x)\varphi(x') for all x,xFx, x' \in F.

step 3.1step 3.2
5.1

By step 3.1, step 4.1, and φ(1F)=ιG(1)=1G\varphi(1_F) = \iota_G(1) = 1_G from step 1.3, φ\varphi preserves ++, \cdot, and 11, so φ\varphi is a field homomorphism FGF \to G.

step 1.3step 3.1step 4.1
6.1

Hence by [L5] (as FF is complete) φ\varphi is injective and order-preserving in both directions, and by [L4] it fixes Q\mathbb{Q}: φιF=ιG\varphi \circ \iota_F = \iota_G.

step 5.1L4L5
7.1

The construction and steps 1.1-6.1 used only that FF and GG are complete ordered fields with canonical embeddings ιF,ιG\iota_F, \iota_G; applying that entire argument verbatim with the roles of FF and GG interchanged shows the symmetric map ψ:GF\psi : G \to F is likewise an injective, order-preserving field homomorphism that fixes Q\mathbb{Q}.

step 6.1
8.1

For xFx \in F, since φ\varphi fixes Q\mathbb{Q} and is order-preserving in both directions, ιG(q)<φ(x)    ιF(q)<x\iota_G(q) < \varphi(x) \iff \iota_F(q) < x, so ψ(φ(x))=sup{ιF(q):ιF(q)<x}=x\psi(\varphi(x)) = \sup\{\iota_F(q) : \iota_F(q) < x\} = x by density [L3]; symmetrically φ(ψ(y))=y\varphi(\psi(y)) = y, so φ\varphi is a bijection with inverse ψ\psi.

step 6.1step 7.1L3
9.1

Thus φ\varphi is a bijective field homomorphism order-preserving in both directions, i.e. an ordered-field isomorphism FGF \cong G fixing Q\mathbb{Q}.

step 6.1step 8.1L7
10.1

For uniqueness let χ:FG\chi : F \to G be any ordered-field isomorphism; being such it is in particular a field homomorphism ([L7]), so by [L4] it fixes Q\mathbb{Q}, and it is order-preserving, so for each xx every ιG(q)Lx\iota_G(q) \in L_x equals χ(ιF(q))<χ(x)\chi(\iota_F(q)) < \chi(x), making χ(x)\chi(x) an upper bound of LxL_x, hence χ(x)φ(x)\chi(x) \ge \varphi(x).

step 9.1L4L7
11.1

Conversely, were χ(x)>φ(x)\chi(x) > \varphi(x), density [L3] would give a rational qq with φ(x)<ιG(q)<χ(x)\varphi(x) < \iota_G(q) < \chi(x); then ιG(q)>supLx\iota_G(q) > \sup L_x forces ιF(q)x\iota_F(q) \ge x, since ιF(q)<x\iota_F(q) < x would put ιG(q)\iota_G(q) into LxL_x and hence below supLx\sup L_x; so χ(x)χ(ιF(q))=ιG(q)<χ(x)\chi(x) \le \chi(\iota_F(q)) = \iota_G(q) < \chi(x), which is impossible, hence χ(x)φ(x)\chi(x) \le \varphi(x).

step 10.1L3L4
12.1

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

step 10.1step 11.1
13.1

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

step 9.1step 12.1L2

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 44 results over 9 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