Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (openai/gpt-5.4)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.

The unique embedding of ℚ into an ordered field

Statement

Let FF be an ordered field (Ordered field). There is a unique field homomorphism ι:QF\iota : \mathbb{Q} \to F (Field homomorphism and embedding). On the integers it is given by nn1Fn \mapsto n \cdot 1_F (with n(n1F)-n \mapsto -(n \cdot 1_F) and 000 \mapsto 0), and on a rational written as p/qp/q with q1q \ge 1 by ι(p/q)=ι(p)(q1F)1\iota(p/q) = \iota(p)\,(q \cdot 1_F)^{-1}. Moreover ι\iota is injective and order-preserving, so it is an embedding of Q\mathbb{Q} as an ordered subfield of FF, and it is the only field homomorphism QF\mathbb{Q} \to F.

Facts & Assumptions

Given: An ordered field FF; the field Q\mathbb{Q} of The rationals form a totally ordered field, every element of which is 00 or ±p/q\pm p/q with integers p,q1p, q \ge 1. For an integer pp write ι(p)\iota(p) for p1Fp \cdot 1_F if p0p \ge 0 and (p1F)-(|p| \cdot 1_F) if p<0p < 0.

[L1]

Q\mathbb{Q} is an ordered field; a nonzero p/qp/q with q1q \ge 1 is positive exactly when p1p \ge 1 (The rationals form a totally ordered field).

[L2]

The canonical naturals satisfy n1F>0n \cdot 1_F > 0 for n1n \ge 1, nn1Fn \mapsto n \cdot 1_F is injective, (m+n)1F=m1F+n1F(m+n) \cdot 1_F = m \cdot 1_F + n \cdot 1_F, and (mn)1F=(m1F)(n1F)(mn) \cdot 1_F = (m \cdot 1_F)(n \cdot 1_F) (Canonical naturals are positive and strictly increasing).

[L3]

If a>0a > 0 then a1>0a^{-1} > 0 (Inverses of positives are positive, and reciprocation reverses order).

[L4]

Sign rules: a product of positives is positive, and for c>0c > 0 one has a<ba < b iff ac<bcac < bc (Sign rules for products and monotonicity of multiplication).

[L5]

A field homomorphism preserves ++, \cdot, and 11, and hence 00, negation, and inverses (Field homomorphism and embedding).

Proof

technique · direct
1.1

Define ι\iota on the integers by ι(n)=n1F\iota(n) = n \cdot 1_F for n0n \ge 0 and ι(n)=(n1F)\iota(-n) = -(n \cdot 1_F); by [L2] this is additive and multiplicative on Z\mathbb{Z} and sends 11F1 \mapsto 1_F.

L2
1.2

For a rational x=p/qx = p/q with q1q \ge 1 define ι(x)=ι(p)(q1F)1\iota(x) = \iota(p)\,(q \cdot 1_F)^{-1}, which makes sense because q1F>00q \cdot 1_F > 0 \ne 0 has an inverse.

L2
2.1

Well-defined: if p/q=p/qp/q = p'/q' with q,q1q, q' \ge 1, then pq=pqp q' = p' q in Z\mathbb{Z}, so [L2] gives ι(p)(q1F)=ι(p)(q1F)\iota(p)(q' \cdot 1_F) = \iota(p')(q \cdot 1_F), and multiplying by the positive (q1F)1(q1F)1(q \cdot 1_F)^{-1}(q' \cdot 1_F)^{-1} yields ι(p)(q1F)1=ι(p)(q1F)1\iota(p)(q \cdot 1_F)^{-1} = \iota(p')(q' \cdot 1_F)^{-1}; thus ι(x)\iota(x) is independent of the representative.

step 1.1step 1.2L2L3
2.2

Multiplicativity: for x=p/qx = p/q, y=r/sy = r/s one has xy=(pr)/(qs)xy = (pr)/(qs), and ι(xy)=ι(pr)((qs)1F)1=ι(p)ι(r)(q1F)1(s1F)1=ι(x)ι(y)\iota(xy) = \iota(pr)((qs) \cdot 1_F)^{-1} = \iota(p)\iota(r)(q \cdot 1_F)^{-1}(s \cdot 1_F)^{-1} = \iota(x)\iota(y), using (mn)1F=(m1F)(n1F)(mn) \cdot 1_F = (m \cdot 1_F)(n \cdot 1_F) and (uv)1=u1v1(uv)^{-1} = u^{-1} v^{-1}.

step 1.2L2
2.3

Additivity: with x+y=(ps+rq)/(qs)x + y = (ps + rq)/(qs), ι(x+y)=(ι(p)(s1F)+ι(r)(q1F))(q1F)1(s1F)1=ι(p)(q1F)1+ι(r)(s1F)1=ι(x)+ι(y)\iota(x+y) = (\iota(p)(s \cdot 1_F) + \iota(r)(q \cdot 1_F))(q \cdot 1_F)^{-1}(s \cdot 1_F)^{-1} = \iota(p)(q \cdot 1_F)^{-1} + \iota(r)(s \cdot 1_F)^{-1} = \iota(x) + \iota(y), using the additive and multiplicative identities of [L2].

step 1.2L2
2.4

Positivity: if x=p/q>0x = p/q > 0 in Q\mathbb{Q} with q1q \ge 1, then p1p \ge 1 by [L1], so ι(p)=p1F>0\iota(p) = p \cdot 1_F > 0 and q1F>0q \cdot 1_F > 0 by [L2], whence (q1F)1>0(q \cdot 1_F)^{-1} > 0 by [L3] and ι(x)=ι(p)(q1F)1>0\iota(x) = \iota(p)(q \cdot 1_F)^{-1} > 0 by [L4].

step 1.2L1L2L3L4
2.5

Uniqueness on Z\mathbb{Z}: let ψ:QF\psi : \mathbb{Q} \to F be any field homomorphism; then ψ(1)=1F\psi(1) = 1_F, additivity forces ψ(n)=n1F=ι(n)\psi(n) = n \cdot 1_F = \iota(n) for n1n \ge 1, and ψ(0)=0\psi(0) = 0, ψ(n)=(n1F)\psi(-n) = -(n \cdot 1_F), so ψ=ι\psi = \iota on Z\mathbb{Z}.

step 1.1L5
3.1

Unit: ι(1)=ι(1/1)=ι(1)(11F)1=1F\iota(1) = \iota(1/1) = \iota(1)(1 \cdot 1_F)^{-1} = 1_F; hence ι\iota is a field homomorphism QF\mathbb{Q} \to F.

step 2.2step 2.3L2L5
3.2

Order: for x<yx < y in Q\mathbb{Q} we have yx>0y - x > 0, so ι(y)ι(x)=ι(yx)>0\iota(y) - \iota(x) = \iota(y - x) > 0 by 2.3 and 2.4, that is ι(x)<ι(y)\iota(x) < \iota(y); thus ι\iota is order-preserving.

step 2.3step 2.4
4.1

Injectivity: if xyx \ne y then x<yx < y or y<xy < x, and 3.2 forces ι(x)ι(y)\iota(x) \ne \iota(y); so ι\iota is injective, an embedding of ordered fields.

step 3.2
5.1

Uniqueness on Q\mathbb{Q}: for p/qQp/q \in \mathbb{Q}, ψ(p/q)=ψ(p)ψ(q)1=ι(p)(q1F)1=ι(p/q)\psi(p/q) = \psi(p)\psi(q)^{-1} = \iota(p)(q \cdot 1_F)^{-1} = \iota(p/q) since ψ\psi preserves products and inverses; hence ψ=ι\psi = \iota, so ι\iota is the unique field homomorphism QF\mathbb{Q} \to F.

step 2.5step 1.2L5

Depends on

Used by

Dependency tree · next 3 levels

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