Ordered field

From Wikipedia, the free encyclopedia
  (Redirected from Field ordering)
Jump to: navigation, search

In mathematics, an ordered field is a field together with a total ordering of its elements that is compatible with the field operations. Historically, the axiomatization of an ordered field was abstracted gradually from the real numbers, by mathematicians including David Hilbert, Otto Hölder and Hans Hahn. This grew eventually into the Artin–Schreier theory of ordered fields and formally real fields.

An ordered field necessarily has characteristic 0 since the elements 0 < 1 < 1 + 1 < 1 + 1 + 1 < ... necessarily are all distinct. Thus, an ordered field necessarily contains an infinite number of elements: a finite field cannot be ordered.

Every subfield of an ordered field is also an ordered field in the inherited order. Every ordered field contains an ordered subfield that is isomorphic to the rational numbers. Any Dedekind-complete ordered field is isomorphic to the real numbers. Squares are necessarily non-negative in an ordered field. This implies that the complex numbers cannot be ordered since the square of the imaginary unit i is −1. Every ordered field is a formally real field.


There are two equivalent common definitions of an ordered field. The definition of total order appeared first historically and is a first-order axiomatization of the ordering ≤ as a binary predicate. Artin and Schreier gave the definition in terms of positive cone in 1926, which axiomatizes the subcollection of nonnegative elements. Although the latter is higher-order, viewing positive cones as maximal prepositive cones provides a larger context in which field orderings are extremal partial orderings.

Total order[edit]

A field (F, +, ×) together with a total order ≤ on F is an ordered field if the order satisfies the following properties for all a, b and c in F:

  • if ab then a + cb + c, and
  • if 0 ≤ a and 0 ≤ b then 0 ≤ a × b.

The symbol for multiplication will be henceforth omitted.

Positive cone[edit]

A prepositive cone or preordering of a field F is a subset PF that has the following properties:[1]

  • For x and y in P, both x + y and xy are in P.
  • If x is in F, then x2 is in P.
  • The element −1 is not in P.

A preordered field is a field equipped with a preordering P. Its non-zero elements P form a subgroup of the multiplicative group of F.

If in addition, the set F is the union of P and −P, we call P a positive cone of F. The non-zero elements of P are called the positive elements of F.

An ordered field is a field F together with a positive cone P.

The preorderings on F are precisely the intersections of families of positive cones on F. The positive cones are the maximal preorderings.[1]

Equivalence of the two definitions[edit]

Let F be a field. There is a bijection between the field orderings of F and the positive cones of F.

Given a field ordering ≤ as in the first definition, the set of elements such that x ≥ 0 forms a positive cone of F. Conversely, given a positive cone P of F as in the second definition, one can associate a total ordering ≤P on F by setting xP y to mean yxP. This total ordering ≤P satisfies the properties of the first definition.

Examples of ordered fields[edit]

Examples of ordered fields are:

  • the rational numbers
  • the real numbers
  • any subfield of an ordered field, such as the real algebraic numbers or computable numbers
  • the field of real rational functions , where and are polynomials with real coefficients, , can be made into an ordered field where the polynomial is greater than any constant polynomial, by defining that whenever , for and . This ordered field is not Archimedean.
  • The field of formal Laurent series with real coefficients, where x is taken to be infinitesimal and positive
  • real closed fields
  • the superreal numbers
  • the hyperreal numbers

The surreal numbers form a proper class rather than a set, but otherwise obey the axioms of an ordered field. Every ordered field can be embedded into the surreal numbers.

Properties of ordered fields[edit]

The property
The property

For every a, b, c, d in F:

  • Either −a ≤ 0 ≤ a or a ≤ 0 ≤ −a
  • One can "add inequalities": if ab and cd, then a + cb + d
  • One can "multiply inequalities with positive elements": if ab and 0 ≤ c, then acbc
  • Transitivity of inequality: if a < b and b < c, then a < c
  • If x < y and x, y > 0, then 1/y < 1/x
  • 1 is positive
  • An ordered field has characteristic 0. (Since 1 > 0, then 1 + 1 > 0, and 1 + 1 + 1 > 0, etc. If the field had characteristic p > 0, then −1 would be the sum of p − 1 ones, but −1 is not positive.) In particular, finite fields cannot be ordered.
  • Squares are non-negative: 0 ≤ a2 for all a in F

Every subfield of an ordered field is also an ordered field (inheriting the induced ordering). The smallest subfield is isomorphic to the rationals (as for any other field of characteristic 0), and the order on this rational subfield is the same as the order of the rationals themselves. If every element of an ordered field lies between two elements of its rational subfield, then the field is said to be Archimedean. Otherwise, such field is a non-Archimedean ordered field and contains infinitesimals. For example, the real numbers form an Archimedean field, but hyperreal numbers form a non-Archimedean field, because it extends real numbers with elements greater than any standard natural number.[2]

An ordered field K is isomorphic to the real number field if every non-empty subset of K with an upper bound in K has a least upper bound in K. This property implies that the field is Archimedean.

Vector spaces over an ordered field[edit]

Vector spaces (particularly, n-spaces) over an ordered field exhibit some special properties and have some specific structures, namely: orientation, convexity, and positively-definite inner product. See Real coordinate space#Geometric properties and uses for discussion of those properties of Rn, which can be generalized to vector spaces over other ordered fields.

Which fields can be ordered?[edit]

Every ordered field is a formally real field, i.e., 0 cannot be written as a sum of nonzero squares.[3][4]

Conversely, every formally real field can be equipped with a compatible total order, that will turn it into an ordered field. (This order need not be uniquely determined.) The proof uses Zorn's lemma.[5]

Finite fields and more generally fields of finite characteristic cannot be turned into ordered fields, because in characteristic p, the element −1 can be written as a sum of (p − 1) squares 12. The complex numbers also cannot be turned into an ordered field, as −1 is a square (of the imaginary number i) and would thus be positive. Also, the p-adic numbers cannot be ordered, since according to Hensel's lemma Q2 contains a square root of −7, thus 12+12+12+22+(−7)2=0, and Qp (p > 2) contains a square root of 1−p, thus (p−1)·12+(1−p)2=0.

Topology induced by the order[edit]

If F is equipped with the order topology arising from the total order ≤, then the axioms guarantee that the operations + and × are continuous, so that F is a topological field.

Harrison topology[edit]

The Harrison topology is a topology on the set of orderings XF of a formally real field F. Each order can be regarded as a multiplicative group homomorphism from F onto ±1. Giving ±1 the discrete topology and ±1F the product topology induces the subspace topology on XF. The Harrison sets form a subbasis for the Harrison topology. The product is a Boolean space (compact, Hausdorff and totally disconnected), and XF is a closed subset, hence again Boolean.[6][7]

Fans and superordered fields[edit]

A fan on F is a preordering T with the property that if S is a subgroup of index 2 in F containing T − {0} and not containing −1 then S is an ordering (that is, S is closed under addition).[8] A superordered field is a totally real field in which the set of sums of squares forms a fan.[9]

See also[edit]


  1. ^ a b Lam (2005) p. 289
  2. ^ Bair, Jaques; Henry, Valérie. "Implicit differentiation with microscopes" (PDF). University of Liege. Retrieved 2013-05-04. 
  3. ^ Lam (2005) p. 41
  4. ^ Lam (2005) p. 232
  5. ^ Lam (2005) p. 236
  6. ^ Lam (2005) p. 271
  7. ^ Lam (1983) pp. 1–2
  8. ^ Lam (1983) p. 39
  9. ^ Lam (1983) p. 45