Ordered Fields

Why is it impossible to arrange the complex numbers on a line the way we arrange the rationals or the reals? The answer is not a matter of taste or convention. It is a theorem. It hinges on a precise notion of what it means for a number system to be ordered in a way that respects addition and multiplication. This article isolates that notion: an ordered field is a field equipped with an order relation. This relation interacts with the field operations in exactly two controlled ways. Everything you already know about inequalities turns out to be derivable from just these two compatibility axioms. You can add the same quantity to both sides. Multiplying by a positive number preserves an inequality, while multiplying by a negative one reverses it. Squares are never negative. This matters because it separates two kinds of facts about the real numbers. Some facts (like the existence of least upper bounds) are special to R\mathbb{R}. They fail for Q\mathbb{Q}. Other facts (like "if a<ba<b and c>0c>0 then ac<bcac<bc") hold in any ordered field. This includes Q\mathbb{Q}, and requires no completeness at all. Cleanly axiomatizing "ordered field" lets us prove the second kind of fact once and for all. We need not re-derive it every time we meet a new example. The big picture: a field is an algebraic structure (addition, multiplication, their laws). An order is a separate relational structure (transitivity, trichotomy). An ordered field glues the two together via compatibility axioms. This gluing is where all the familiar "rules of inequalities" come from. Once the rules are proved here, they become available as black boxes for everything downstream. This applies most immediately to the study of absolute value. It eventually applies to the single extra axiom (completeness) that promotes Q\mathbb{Q} into R\mathbb{R}. This article delivers: the formal definition of an ordered field; a full derivation of the basic sign-and-inequality rules from the axioms (the "algebra of inequalities"); worked numerical examples in Q\mathbb{Q}; a rigorous demonstration that C\mathbb{C} cannot be ordered compatibly with its field structure; and a map of where ordered fields sit relative to the further order theory and the rationals as the prototype example.

Key takeaways
  • An ordered field is a field FF with a relation << satisfying trichotomy, transitivity, and two compatibility laws with ++ and ⋅\cdot.
  • From these axioms alone you can prove: adding preserves order, multiplying by positives preserves order, multiplying by negatives reverses it, and x2≥0x^2 \geq 0 always.
  • Q\mathbb{Q} and R\mathbb{R} are ordered fields; C\mathbb{C} and finite fields like Z/3Z\mathbb{Z}/3\mathbb{Z} cannot be ordered at all.
  • The proof that C\mathbb{C} is not orderable uses only the fact that −1-1 is a square there, contradicting a theorem valid in every ordered field.
  • Dropping either compatibility axiom (not just trichotomy) produces a "relation on a field" that fails to reproduce ordinary inequality behavior.
  • Key idea: order and algebra are compatible exactly when translation preserves order and multiplication by positives preserves order — everything else about inequalities is a logical consequence of these two facts.

Where this lives today

The ordered-field axioms are the silent scaffolding underneath every inequality manipulation in calculus, from solving ∣x−3∣<5|x-3|<5 to justifying the squeeze theorem. In real analysis, the compatibility rules proved here are exactly what license algebraic manipulation of ϵ\epsilon-inequalities in limit proofs, and they are the base layer on which absolute value and later the completeness axiom are built to get from Q\mathbb{Q} to R\mathbb{R}. In algebra, the Artin–Schreier theory of formally real fields (which of the counterexample above is a first instance) governs which fields can carry a compatible order at all — a question central to real algebraic geometry, where one studies solution sets of polynomial inequalities over ordered fields. In logic and model theory, "real closed fields" (ordered fields satisfying an additional first-order completeness-like scheme) underlie quantifier elimination algorithms used in computer algebra systems and automated theorem proving. In optimization and control theory, linear and semidefinite programming over the reals depend at every step on the sign-preservation rules of Theorem parts (1)–(3) to justify manipulating constraint inequalities. In cryptography, the impossibility of ordering finite fields (illustrated by the Z/3Z\mathbb{Z}/3\mathbb{Z} remark in the counterexample) is one reason finite-field arithmetic (used in elliptic-curve cryptography) behaves so differently from real-number arithmetic — there is no notion of "positive" or "less than" to exploit or defend against.

Ask the tutor: How does the completeness axiom get added on top of the ordered-field axioms to single out R\mathbb{R} among all ordered fields?

DefinitionOrdered Field

Let F=(F,+,⋅,0,1)F=(F,+,\cdot,0,1) be a field. An order on FF is a relation << on FF satisfying, for all x,y,z∈Fx,y,z \in F:

(O1) Trichotomy. Exactly one of x<yx<y, x=yx=y, y<xy<x holds.

(O2) Transitivity. If x<yx<y and y<zy<z, then x<zx<z. The pair (F,<)(F,<) is an ordered field if, in addition, << is compatible with the field operations:

(O3) Compatibility with addition. If x<yx<y, then x+z<y+zx+z<y+z for every z∈Fz\in F.

(O4) Compatibility with multiplication. If x<yx<y and 0<z0<z, then xz<yzxz<yz. We write x>yx>y for y<xy<x, x≤yx\leq y for "x<yx<y or x=yx=y", and call xx positive if x>0x>0, negative if x<0x<0. An element P⊆FP\subseteq F of positive elements satisfying "for each xx, exactly one of x∈Px\in P, x=0x=0, −x∈P-x\in P holds" and "PP closed under +,⋅+,\cdot" gives an equivalent formulation: define x<y  ⟺  y−x∈Px<y \iff y-x\in P. Both formulations are used interchangeably in the literature.

Intuition

Think of a field as a machine with two operations obeying algebraic laws (associativity, distributivity, inverses), entirely blind to any notion of "bigger" or "smaller." An order relation is, on its own, just a way of lining up elements on an abstract line, with no reference to ++ or ⋅\cdot at all — trichotomy and transitivity alone would let you order the field arbitrarily, in a way with no connection to the arithmetic. The content of an ordered field is that the lining-up is forced to respect the arithmetic. Axiom (O3) says the order is translation invariant: sliding the whole number line by zz doesn't change which of two points is to the right. Axiom (O4) says multiplying by a positive number is a order-preserving rescaling: it can stretch or shrink distances, but a point to the right of another stays to the right, as long as you rescale by something positive. These two axioms alone force an enormous amount of structure — including the fact, proved below, that −1-1 must be negative, and hence that no square root of −1-1 can exist in an ordered field. The picture to keep in mind is the ordinary number line for Q\mathbb{Q}: shifting every point right by zz preserves left-right order (O3), and stretching the line by a positive factor zz preserves left-right order too (O4), while stretching by a negative factor flips the whole line over — a fact we will derive, not assume.

Figure
Translation (O3) and positive scaling (O4) both preserve left–right order on the line
L x=1 y=3 x+z=1+2 y+z=3+2 z = 2 : order preserved (O3) x=1 y=3 xz = 1·2 z = 2 > 0 : order preserved (O4)
TheoremAlgebra of Inequalities in an Ordered Field

Let (F,<)(F,<) be an ordered field, and let a,b,c,d∈Fa,b,c,d\in F. Then: 1. If a<ba<b and c<dc<d, then a+c<b+da+c<b+d. 2. If a<ba<b, then −b<−a-b<-a. 3. If a<ba<b and c<0c<0, then bc<acbc<ac (multiplying by a negative reverses the order). 4. a≠0  ⟹  a2>0a\neq 0 \implies a^2>0. In particular 1>01>0. 5. If 0<a<b0<a<b then 0<b−1<a−10<b^{-1}<a^{-1}. 6. 00 is neither positive nor negative, and if a>0a>0, then −a<0-a<0 (and conversely).

Proof

We use only (O1)–(O4), the Field Axioms, and the standard algebraic consequences of the field axioms (uniqueness of additive/multiplicative inverses, x⋅0=0x\cdot 0=0, (−1)x=−x(-1)x=-x, −(−x)=x-(-x)=x). The technique throughout is direct derivation from axioms — no step assumes any conclusion of this theorem in advance.

(6) first, since it is used below. By (O1) applied to 00 and 00: exactly one of 0<00<0, 0=00=0, 0<00<0 holds; since 0=00=0 is true, 0<00<0 is false. So 00 is neither positive (0>00>0 means 0<00<0... more precisely "00 positive" means 0<00<0 is not the definition — let us restate cleanly: by definition a>0a>0 means 0<a0<a. Apply (O1) to the pair (0,0)(0,0): since 0=00=0, neither 0<00<0 nor 0<00<0 (the same statement) can also hold as a strict alternative — trichotomy forces that 0<00<0 is false. Hence 00 is not >0>0 and not <0<0 simultaneously in the strict sense of being its own comparison; concretely, 00 fails "0<00<0", so 00 is not positive, and 00 is not negative either (negative means 0>00>0... no: negative means a<0a<0, i.e. 0>a0>a; for a=0a=0 this reads 0<00<0, false). So 00 is neither positive nor negative. Now suppose a>0a>0, i.e. 0<a0<a. By (O3) with z=−az=-a: 0+(−a)<a+(−a)0+(-a) < a+(-a), i.e. −a<0-a<0. Conversely if −a<0-a<0, apply (O3) with z=az=a: −a+a<0+a-a+a<0+a, i.e. 0<a0<a, so a>0a>0. This proves (6).

(1) Suppose a<ba<b and c<dc<d. By (O3) (adding cc to both sides of a<ba<b): a+c<b+ca+c<b+c. By (O3) again (adding bb to both sides of c<dc<d): c+b<d+bc+b<d+b, i.e. b+c<b+db+c<b+d. By (O2) (transitivity) applied to a+c<b+ca+c<b+c and b+c<b+db+c<b+d: a+c<b+da+c<b+d. ■\blacksquare

(2) Suppose a<ba<b. By (O3) add (−a−b)(-a-b) to both sides:

a+(−a−b)<b+(−a−b),a+(-a-b) < b+(-a-b),

which simplifies (using field axioms: associativity/commutativity of ++ and additive inverses) to −b<−a-b<-a. ■\blacksquare

(3) Suppose a<ba<b and c<0c<0. By (6) (already proved), c<0c<0 means −c>0-c>0. By (O4) applied to a<ba<b and the positive element −c-c:

a(−c)<b(−c).a(-c) < b(-c).

By field-axiom consequences, a(−c)=−(ac)a(-c)=-(ac) and b(−c)=−(bc)b(-c)=-(bc), so we have −(ac)<−(bc)-(ac) < -(bc). By part (2) just proved (applied to the inequality −(ac)<−(bc)-(ac)<-(bc), i.e. taking a′:=−(ac)a':=-(ac), b′:=−(bc)b':=-(bc) and noting −a′=ac-a'=ac, −b′=bc-b'=bc), we get −(−(bc))<−(−(ac))-(-(bc)) < -(-(ac)), i.e. bc<acbc<ac. ■\blacksquare

(4) Let a≠0a\neq 0. By (O1) applied to aa and 00, since a≠0a\neq 0, either a>0a>0 or a<0a<0. Case a>0a>0: By (O4) applied to 0<a0<a and the positive element z=az=a: 0⋅a<a⋅a0\cdot a < a\cdot a, i.e. 0<a20<a^2 (using 0⋅a=00\cdot a=0, a standard field consequence). So a2>0a^2>0. Case a<0a<0: By (6), −a>0-a>0. By the case just proved (applied to −a-a in place of aa), (−a)2>0(-a)^2>0. But (−a)2=(−1)2a2=a2(-a)^2 = (-1)^2a^2 = a^2 by field-axiom consequences ((−1)(−1)=1(-1)(-1)=1). So a2>0a^2>0. Either way a2>0a^2>0. Since 1=121=1^2 and 1≠01\neq 0 (a field axiom), taking a=1a=1 gives 1>01>0. ■\blacksquare

(5) Suppose 0<a<b0<a<b. First we show a−1,b−1a^{-1}, b^{-1} exist and are positive. Since a≠0a\neq 0 and b≠0b\neq 0 (as a,b>0≠a,b>0\neq zero by (6)), inverses exist by the field axioms. Suppose toward showing a−1>0a^{-1}>0: by (O1), a−1≠0a^{-1}\neq 0 (since a⋅a−1=1≠0a\cdot a^{-1}=1\neq 0, and a⋅0=0a\cdot 0=0, so a−1≠0a^{-1}\neq 0), so either a−1>0a^{-1}>0 or a−1<0a^{-1}<0. If a−1<0a^{-1}<0, then by part (3) (multiplying 0<a0<a by the negative number a−1a^{-1}, with roles c=a−1<0c=a^{-1}<0): a⋅a−1<0⋅a−1a\cdot a^{-1} < 0\cdot a^{-1}, i.e. 1<01<0, contradicting part (4) which gives 1>01>0 and (O1) trichotomy (both 1>0,1<01>0,1<0 cannot hold). Hence a−1>0a^{-1}>0. Identically b−1>0b^{-1}>0. Now apply (O4) to a<ba<b multiplied by the positive element a−1b−1a^{-1}b^{-1} (positive since it is a product of positives — a fact we verify: if x>0,y>0x>0,y>0 then xy>0xy>0 by (O4) applied to 0<x0<x times yy, giving 0⋅y<xy0\cdot y<xy, i.e. 0<xy0<xy):

a⋅(a−1b−1)<b⋅(a−1b−1).a\cdot(a^{-1}b^{-1}) < b\cdot(a^{-1}b^{-1}).

The left side simplifies to b−1b^{-1} (since a⋅a−1=1a\cdot a^{-1}=1) and the right side to a−1a^{-1} (since b⋅b−1=1b\cdot b^{-1}=1), using commutativity/associativity. So b−1<a−1b^{-1}<a^{-1}, and both are positive as shown, giving 0<b−1<a−10<b^{-1}<a^{-1}. ■\blacksquare

∎

Worked examples

Example 1 (checking compatibility numerically in Q\mathbb{Q}). Let F=QF=\mathbb{Q} with its usual order. Take a=−53a=-\tfrac{5}{3}, b=27b=\tfrac{2}{7}, c=−4c=-4. We verify Theorem parts (1) and (3) with these asymmetric numbers. Part (1) check. We need a second pair; take c′=19c'=\tfrac{1}{9}, d′=12d'=\tfrac{1}{2} (indeed c′<d′c'<d' since 19=0.111…<0.5\tfrac1{9}=0.111\ldots < 0.5). Since a<ba<b (as −1.6‾<0.2857…-1.\overline{6}<0.2857\ldots), part (1) predicts

a+c′<b+d′.a+c' < b+d'.

Compute: a+c′=−53+19=−159+19=−149≈−1.5556a+c' = -\tfrac{5}{3}+\tfrac19 = -\tfrac{15}{9}+\tfrac19=-\tfrac{14}{9}\approx -1.5556. And b+d′=27+12=414+714=1114≈0.7857b+d'=\tfrac27+\tfrac12=\tfrac{4}{14}+\tfrac{7}{14}=\tfrac{11}{14}\approx 0.7857. Indeed −1.5556<0.7857-1.5556<0.7857. ✓. Part (3) check. With a<ba<b as above and c=−4<0c=-4<0, the theorem predicts bc<acbc<ac, i.e. multiplying by the negative number −4-4 reverses the order. Compute ac=(−53)(−4)=203≈6.667ac = \left(-\tfrac53\right)(-4)=\tfrac{20}{3}\approx 6.667, and bc=(27)(−4)=−87≈−1.143bc=\left(\tfrac27\right)(-4)=-\tfrac{8}{7}\approx -1.143. Indeed bc=−1.143<ac=6.667bc=-1.143 < ac=6.667, confirming the reversal, and matching the direction "the originally smaller number (aa) now yields the larger product (acac)." ✓

Example 2 (solving a rational inequality using only the axioms/theorem, not calculus). Solve, over Q\mathbb{Q}, the inequality

2x−7x+3<1,\frac{2x-7}{x+3} < 1,

for x≠−3x\neq -3, citing only field-and-order facts (parts of the Theorem) at each step — no appeal to continuity or graphing. Step 1. Rewrite: 2x−7x+3−1<0  ⟺  2x−7−(x+3)x+3<0  ⟺  x−10x+3<0\dfrac{2x-7}{x+3}-1<0 \iff \dfrac{2x-7-(x+3)}{x+3}<0 \iff \dfrac{x-10}{x+3}<0, using only field axioms (common denominator, distributivity) — this is an equality of expressions, not yet an order step. Step 2. A quotient x−10x+3\dfrac{x-10}{x+3} is negative exactly when numerator and denominator have opposite (strict) signs. This is itself a consequence of the Theorem: if u,vu,v have opposite signs, say u>0,v<0u>0,v<0, then v−1<0v^{-1}<0 (by the same sign-of-inverse argument used in part (5), noting v−1⋅v=1>0v^{-1}\cdot v=1>0 forces v−1v^{-1} and vv to share a sign, since a negative times a positive is negative by part (3), yet the product must be the positive number 11 — so v−1<0v^{-1}<0 when v<0v<0). Then u⋅v−1u\cdot v^{-1} is a product of a positive and a negative, hence negative by part (3) (taking c=v−1<0c=v^{-1}<0, a=0<ua=0<u, giving u⋅v−1<0⋅v−1=0u\cdot v^{-1}<0\cdot v^{-1}=0). Symmetrically opposite signs the other way also give a negative quotient, and like signs give a positive quotient (product of two positives, or two negatives, is positive — the latter since (−p)(−q)=pq(-p)(-q)=pq for p,q>0p,q>0 by field-axiom consequences, and pq>0pq>0 by (O4)). Step 3. Apply Step 2 to u=x−10u=x-10, v=x+3v=x+3. Two cases give a negative quotient:

  • Case A: x−10>0x-10>0 and x+3<0x+3<0. The first gives x>10x>10; the second gives x<−3x<-3. No xx satisfies both (if x>10x>10 then certainly not x<−3x<-3, by transitivity (O2): x<−3<10<xx<-3<10<x would give x<xx<x, impossible by (O1)). Case A is empty.
  • Case B: x−10<0x-10<0 and x+3>0x+3>0. The first gives x<10x<10; the second gives x>−3x>-3. Both hold exactly for −3<x<10-3<x<10.

Conclusion. The solution set is {x∈Q:−3<x<10}\{x\in\mathbb{Q} : -3<x<10\}. As a numerical check take x=4x=4 (asymmetric, inside the interval): 2(4)−74+3=17≈0.143<1\frac{2(4)-7}{4+3}=\frac{1}{7}\approx 0.143<1. ✓. Take x=20x=20 (outside): 2(20)−720+3=3323≈1.435≮1\frac{2(20)-7}{20+3}=\frac{33}{23}\approx 1.435 \not< 1. ✓ consistent with exclusion.

Counterexamplewhy the compatibility axioms — not just trichotomy — are needed: C\mathbb{C} has no compatible order

Drop nothing about trichotomy or transitivity; instead show that no order making C\mathbb{C} an ordered field can exist, i.e. (O3)+(O4) are jointly unsatisfiable by any relation on C\mathbb{C} compatible with its field structure. This demonstrates the compatibility axioms are a genuine, restrictive constraint, not automatically satisfiable for every field — some fields admit no ordering at all.

Claim. There is no relation << on C\mathbb{C} satisfying (O1)–(O4) simultaneously with the field operations of C\mathbb{C}.

Proof. Suppose, for contradiction, that such a << exists, making (C,<)(\mathbb{C},<) an ordered field. By Theorem part (4), for every nonzero z∈Cz\in\mathbb{C}, z2>0z^2>0. In particular, taking z=iz=i (recall i≠0i\neq 0 and i2=−1i^2=-1 in C\mathbb{C}):

−1=i2>0.-1 = i^2 > 0.

Also taking z=1z=1 (nonzero), Theorem part (4) gives 12=1>01^2=1>0. By part (1) of the Theorem applied to −1>0-1>0 (i.e. 0<−10<-1) and 1>01>0 (i.e. 0<10<1): adding these,

0+0<(−1)+1,0+0 < (-1)+1,

i.e. 0<00<0. But this directly contradicts (O1) (trichotomy), which forbids 0<00<0 (since 0=00=0 is the true alternative, and trichotomy says exactly one of the three holds). This is a genuine contradiction, so no such order exists on C\mathbb{C}. ■\blacksquare This is exactly why "C\mathbb{C} is bigger than R\mathbb{R} algebraically but cannot be lined up on a ray compatibly with +,⋅+,\cdot" — the obstruction is entirely that −1-1 is a square in C\mathbb{C}, while Theorem part (4) forces every nonzero square to be positive in any ordered field. The same argument shows any field in which −1-1 is a sum of squares (e.g. finite fields such as Z/3Z\mathbb{Z}/3\mathbb{Z}, where 12+12=2=−11^2+1^2=2=-1) cannot be ordered, by an identical chain: sums of positives are positive by repeated use of part (1), so −1-1 would have to be simultaneously positive (as i2i^2 or as a sum of squares) and force 0<00<0.

Scope, edge cases & common traps

SituationWhat holdsWhat fails / must be checked
F=QF=\mathbb{Q}, usual orderFull ordered field; all Theorem parts applyNot complete — no least upper bounds for sets like {x:x2<2}\{x:x^2<2\}
F=RF=\mathbb{R}, usual orderFull ordered field, plus completeness (a further axiom, not part of "ordered field")Completeness is extra structure, covered separately
F=CF=\mathbb{C}Field, but no order making it an ordered fieldCommon error: assuming ∣z∣|z| or componentwise comparison gives "C\mathbb{C} ordered" — neither is compatible with (O4)
F=Z/pZF=\mathbb{Z}/p\mathbb{Z}, pp primeFieldNo order at all, since −1-1 is a sum of squares (finite fields are never orderable)
Multiplying an inequality by a variable expression zzNeed the sign of zz to know directionClassic trap: multiplying a<ba<b by zz without checking z>0z>0 vs z<0z<0 silently reverses or preserves incorrectly
Squaring both sides of an inequalityValid only when both sides are known nonnegativea<ba<b does not imply a2<b2a^2<b^2 in general (e.g. −5<1-5<1 but 25>125>1)

The mathematician behind it

Origins · 1 minRichard Dedekind and how this was discovered
RD
Richard Dedekind
1831–1916 · Foundations of arithmetic and the real numbers, Braunschweig and Göttingen

Dedekind was one of the last students of Gauss and a lifelong friend and correspondent of Riemann. Trained in the Göttingen tradition of rigorous foundational thinking, he became dissatisfied with the informal way real numbers, limits, and inequalities were handled in the calculus of his era — the same informality this article's axioms are designed to eliminate. His 1872 pamphlet Stetigkeit und irrationale Zahlen ("Continuity and Irrational Numbers") gave the first fully rigorous construction of the real numbers from the rationals via what are now called Dedekind cuts, making precise exactly which order properties of Q\mathbb{Q} carry over unchanged and which new property (completeness) must be added. His broader program — reducing analysis to arithmetic, and arithmetic to precisely stated axioms — is the direct ancestor of the field-and-order axiomatic treatment given here.

History
- 1858 — Dedekind, dissatisfied with appeals to geometric intuition when teaching calculus in Zürich, begins searching for a purely arithmetic foundation for continuity.
- 1872 — Dedekind publishes Stetigkeit und irrationale Zahlen, constructing R\mathbb{R} from Q\mathbb{Q} via cuts and isolating the order properties inherited from Q\mathbb{Q}.
- 1889 — Giuseppe Peano axiomatizes the natural numbers, part of the broader late-19th-century push toward explicit axiom systems that the ordered-field axioms belong to.
- 1899 — David Hilbert's Grundlagen der Geometrie popularizes the modern style of listing axioms explicitly and deriving all consequences from them, the style used throughout this article.
- 1930s — Emil Artin and Otto Schreier develop the general theory of formally real fields and orderable fields, proving exactly which fields admit an order (those in which −1-1 is not a sum of squares), generalizing the counterexample given above.
Is every field orderable?

No. A field can be ordered (made into an ordered field) if and only if −1-1 is not expressible as a sum of squares in that field — this is the Artin–Schreier criterion, and such orderable fields are called formally real. The counterexample above shows C\mathbb{C} fails this: −1=i2-1=i^2 is literally a single square, hence a "sum of squares" of length one, so C\mathbb{C} is not formally real and admits no compatible order. Similarly every finite field fails to be orderable, since in a finite field −1-1 can always be written as a sum of squares (a consequence of counting arguments on quadratic residues). So orderability is a genuinely restrictive algebraic property, not automatic.

Is Q\mathbb{Q} an ordered field, and is it "the same" order as on R\mathbb{R}?

Yes, Q\mathbb{Q} with its usual order is an ordered field, and every Theorem part in this article applies to it verbatim — none of the proofs used anything beyond the field and order axioms, so they hold in Q\mathbb{Q} exactly as they do in R\mathbb{R}. What Q\mathbb{Q} lacks, and R\mathbb{R} has, is completeness: the least-upper-bound property. The order relation "<<" on Q\mathbb{Q} is literally the restriction of the order on R\mathbb{R}, so in that sense it is "the same" order, just applied to a smaller field that is not closed under taking suprema of bounded sets.

Does "ordered field" require the order to be a total (linear) order?

Yes, and this is exactly what trichotomy (O1) guarantees: for any two elements, one comparison out of <,=,><,=,> must hold, so no two elements are incomparable. This is what makes ordered fields "linearly ordered" rather than merely partially ordered. Without trichotomy you could have a field with a relation satisfying (O2)–(O4) but leaving some pairs of elements incomparable (a partial order compatible with the field operations); such structures exist and are studied, but they are not called ordered fields in the sense used here or in Rudin/Abbott-style real analysis.

Can there be more than one order on the same field?

For Q\mathbb{Q} and R\mathbb{R}, the order is unique — it turns out to be definable purely in field-theoretic terms as "x≤yx\le y iff y−xy-x is a square," and this pins down a single order compatible with the field axioms. In general, though, some fields admit multiple distinct compatible orders; for example Q(2)\mathbb{Q}(\sqrt2) can be ordered in two genuinely different ways depending on whether 2\sqrt2 is placed as the positive or negative root, both compatible with all of (O1)–(O4). Uniqueness of the order is therefore a special feature of specific fields, not a general theorem about all ordered fields.

Why bother separating "field axioms" from "order axioms" instead of just working with R\mathbb{R} directly?

Separating them tells you exactly which facts are "cheap" (true in any ordered field, provable from four simple axioms) versus "expensive" (require the extra completeness axiom special to R\mathbb{R}). Every inequality-manipulation rule you use in basic calculus — flipping inequalities when multiplying by negatives, adding inequalities, comparing reciprocals — is cheap in this sense, and this article proves all of them without ever invoking completeness. Recognizing this saves enormous effort: once you know a fact only needs ordered-field axioms, you know it transfers automatically to Q\mathbb{Q}, to any subfield of R\mathbb{R}, and to more exotic ordered fields, with zero extra work.

What exactly goes wrong if we only require trichotomy and transitivity, but drop compatibility (O3)/(O4)?

You get what's called a linearly ordered field-with-an-order-that-ignores-the-arithmetic — technically just a field carrying some total order, but the order and the arithmetic can be entirely unrelated. For instance, you could take Q\mathbb{Q} and impose a bizarre well-order or any other total order unrelated to magnitude; trichotomy and transitivity would hold, but statements like "a<b  ⟹  a+c<b+ca<b\implies a+c<b+c" would simply be false for that order. None of the familiar inequality algebra (Theorem parts 1–6) would be available, because every one of those proofs used (O3) or (O4) as an essential step.

How does this connect to what comes next, like absolute value?

The absolute value function ∣x∣|x| is typically defined using the order relation (as max⁡(x,−x)\max(x,-x) or via cases on the sign of xx), and virtually every property of ∣⋅∣|\cdot| — the triangle inequality, ∣xy∣=∣x∣∣y∣|xy|=|x||y|, ∣x∣≥0|x|\ge 0 — is proved by case-splitting on sign exactly the way the Theorem's proof does, then invoking parts (2)–(4) of this Theorem directly. In that sense, this article's Theorem is the toolbox that the theory of absolute value draws from immediately; nothing new about order needs to be re-derived there.

Before this

Where this leads