Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck 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.

A field homomorphism of ordered fields need not preserve order

Statement refuted

Refuted claim: every field homomorphism φ:F→G between ordered fields is order-preserving, that is, a<b in F implies φ(a)<φ(b) in G.

The witness is the conjugation map on Q(2)={a+b2:a,b∈Q}⊆R, which is a field homomorphism from an ordered field to itself yet sends the positive element 2 to the negative element −2.

Facts & Assumptions

Given: The reals R, a complete ordered field, with the positive square root 2 of 2.

[L1]

In R the element 2=1+1 has a positive square root 2 with (2)2=2 and 2>0 (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}).

[L2]

No rational number squares to 2, so 2 is irrational (FALSE: some rational number squares to 2).

[L3]

A field homomorphism φ satisfies φ(x+y)=φ(x)+φ(y), φ(xy)=φ(x)φ(y), and φ(1)=1 (Field homomorphism and embedding).

[L4]

In an ordered field, x>0 means x lies in the positive cone, and a<b means b−a>0; exactly one of x>0, x=0, x<0 holds (Ordered field).

[L5]

A field homomorphism from a complete ordered field into an ordered field is order-preserving (Homomorphisms out of a complete ordered field are order-preserving).

Counterexample

technique · direct
1.1

Working inside R, let K={a+b2:a,b∈Q}; then (a+b2)+(c+d2)=(a+c)+(b+d)2 and (a+b2)(c+d2)=(ac+2bd)+(ad+bc)2 both lie in K, so K is closed under addition and multiplication.

L1algebra
1.2

Each nonzero a+b2∈K is invertible in K, with (a+b2)−1=a−b2a2−2b2, where a2−2b2≠0 since otherwise (a,b)≠(0,0) forces b≠0 and the rational (a/b)2=2, contradicting [L2].

L2algebra
1.3

The representation of an element of K as a+b2 with a,b∈Q is unique, for a+b2=a′+b′2 with b≠b′ would give 2=(a′−a)/(b−b′)∈Q.

L2algebra
1.4

In K the element 2=0+1⋅2 satisfies 2>0.

L1L4
2.1

By steps 1.1 and 1.2, K is a subfield of R, hence an ordered field under the positive cone inherited from R.

step 1.1step 1.2L4
2.2

By the uniqueness in step 1.3, the map σ:K→K given by σ(a+b2)=a−b2 is well defined.

step 1.3
2.3

The real number 21/4=2 is not in K, for 21/4=a+b2 would square to 2=(a2+2b2)+2ab2, whence step 1.3 forces a2+2b2=0 and 2ab=1, impossible for real a,b.

step 1.3algebra
3.1

σ is additive: σ((a+b2)+(c+d2))=(a+c)−(b+d)2=(a−b2)+(c−d2)=σ(a+b2)+σ(c+d2).

step 2.2algebra
3.2

σ is multiplicative: σ((a+b2)(c+d2))=(ac+2bd)−(ad+bc)2=(a−b2)(c−d2)=σ(a+b2) σ(c+d2).

step 2.2algebra
3.3

σ fixes the identity: σ(1)=σ(1+0⋅2)=1.

step 2.2
3.4

σ(2)=σ(0+1⋅2)=−2, and −2<0 in K by step 1.4.

step 2.2step 1.4L4
4.1

By steps 3.1, 3.2, and 3.3, σ satisfies the three homomorphism identities, so σ:K→K is a field homomorphism between ordered fields.

step 3.1step 3.2step 3.3L3
5.1

Steps 2.1 and 4.1 exhibit a field homomorphism σ between ordered fields with 2>0 in the domain yet σ(2)=−2<0 by step 3.4, so σ is not order-preserving, refuting the claim that every field homomorphism between ordered fields is order-preserving.

step 2.1step 4.1step 3.4L4
6.1

There is no conflict with [L5]: if K were complete, [L5] would make σ order-preserving, contrary to step 5.1. Hence K is not complete.

step 5.1L5∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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