Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-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.

Homomorphisms out of a complete ordered field are order-preserving

Statement

Let FF be a complete ordered field and GG an ordered field, and let φ:FG\varphi : F \to G be a field homomorphism (Field homomorphism and embedding). Then φ\varphi is injective and order-preserving: x>0x > 0 in FF implies φ(x)>0\varphi(x) > 0 in GG, and consequently a<ba < b implies φ(a)<φ(b)\varphi(a) < \varphi(b).

Facts & Assumptions

Given: A complete ordered field FF, an ordered field GG, and a field homomorphism φ:FG\varphi : F \to G.

[L1]

φ(1F)=1G\varphi(1_F) = 1_G, φ(x+y)=φ(x)+φ(y)\varphi(x + y) = \varphi(x) + \varphi(y), φ(xy)=φ(x)φ(y)\varphi(xy) = \varphi(x)\varphi(y), φ(x)=φ(x)\varphi(-x) = -\varphi(x); and every field homomorphism is injective, its kernel being an ideal of the field FF with φ(1F)=1G0G\varphi(1_F) = 1_G \ne 0_G (Field homomorphism and embedding).

[L2]

In a complete ordered field every a0a \ge 0 is a square a=y2a = y^2; the positive elements are exactly the nonzero squares (Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}).

[L3]

In any ordered field a nonzero square is positive: y0y2>0y \ne 0 \Rightarrow y^2 > 0 (Squares of nonzero elements are positive).

[L4]

Order via the positive cone: x>0x > 0 means xPx \in P, a<ba < b means baPb - a \in P; trichotomy holds (Ordered field).

Proof

technique · direct
1.1

φ\varphi is injective: by [L1] its kernel is an ideal of the field FF, and since φ(1F)=1G0G\varphi(1_F) = 1_G \ne 0_G the kernel is {0F}\{0_F\}.

L1
1.2

Fix xFx \in F with x>0x > 0; then x0x \ge 0, so by [L2] there is yFy \in F with x=y2x = y^2, and y0y \ne 0 since y=0y = 0 would give x=0x = 0, against x>0x > 0 by [L4].

L2L4
2.1

Applying φ\varphi, φ(x)=φ(y2)=φ(y)2\varphi(x) = \varphi(y^2) = \varphi(y)^2, and φ(y)0G\varphi(y) \ne 0_G because y0y \ne 0 and φ\varphi is injective.

step 1.1step 1.2L1
3.1

By [L3] in GG, the nonzero square φ(y)2\varphi(y)^2 is positive, so φ(x)=φ(y)2>0\varphi(x) = \varphi(y)^2 > 0; as x>0x > 0 was arbitrary, x>0φ(x)>0x > 0 \Rightarrow \varphi(x) > 0 for all xFx \in F.

step 2.1L3
4.1

If a<ba < b then ba>0b - a > 0, so φ(ba)>0\varphi(b - a) > 0; since φ(ba)=φ(b)φ(a)\varphi(b - a) = \varphi(b) - \varphi(a) by [L1], we get φ(b)φ(a)>0\varphi(b) - \varphi(a) > 0, i.e. φ(a)<φ(b)\varphi(a) < \varphi(b).

step 3.1L1L4
5.1

Hence φ\varphi is an injective, order-preserving field homomorphism.

step 1.1step 4.1

Depends on

Used by

Dependency tree · next 3 levels

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