Euclidean field explained
In mathematics, a Euclidean field is an ordered field for which every non-negative element is a square: that is, in implies that for some in .
The constructible numbers form a Euclidean field. It is the smallest Euclidean field, as every Euclidean field contains it as an ordered subfield. In other words, the constructible numbers form the Euclidean closure of the rational numbers.
Properties
- Every Euclidean field is an ordered Pythagorean field, but the converse is not true.[1]
- If E/F is a finite extension, and E is Euclidean, then so is F. This "going-down theorem" is a consequence of the Diller–Dress theorem.[2]
Examples
Every real closed field is a Euclidean field. The following examples are also real closed fields.
with the usual operations and ordering form a Euclidean field.
is a Euclidean field.
Counterexamples
with the usual operations and ordering do not form a Euclidean field. For example, 2 is not a square in
since the
square root of 2 is
irrational.
[4] By the going-down result above, no
algebraic number field can be Euclidean.
[2]
do not form a Euclidean field since they cannot be given the structure of an ordered field.
Euclidean closure
The Euclidean closure of an ordered field is an extension of in the quadratic closure of which is maximal with respect to being an ordered field with an order extending that of .[5] It is also the smallest subfield of the algebraic closure of that is a Euclidean field and is an ordered extension of .
References
- Book: Efrat, Ido . Valuations, orderings, and Milnor K-theory . Mathematical Surveys and Monographs . 124 . Providence, RI . . 2006 . 0-8218-4041-X . 1103.12002 .
- Book: Lam, Tsit-Yuen . Tsit Yuen Lam
. Introduction to Quadratic Forms over Fields . 67 . . Tsit Yuen Lam . American Mathematical Society . 2005 . 0-8218-1095-2 . 1068.11023 . 2104929 .
- Book: Martin, George E. . Geometric Constructions . Geometric Constructions. . . 1998 . 0-387-98276-0 . 0890.51015 .
Notes and References
- Martin (1998) p. 89
- Lam (2005) p.270
- Martin (1998) pp. 35–36
- Martin (1998) p. 35
- Efrat (2006) p. 177