Euclidean field
Template:Short descriptionTemplate:About
In mathematics, a Euclidean field is an ordered field Template:Math for which every non-negative element is a square: that is, Template:Math in Template:Math implies that Template:Math for some Template:Math in Template:Math.
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
- The real constructible numbers, those (signed) lengths which can be constructed from a rational segment by ruler and compass constructions, form a Euclidean field.[3]
Every real closed field is a Euclidean field. The following examples are also real closed fields.
- The real numbers with the usual operations and ordering form a Euclidean field.
- The field of real algebraic numbers is a Euclidean field.
- The field of hyperreal numbers is a Euclidean field.
Counterexamples
- The rational numbers 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]
- The complex numbers 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 Template:Mvar is an extension of Template:Mvar in the quadratic closure of Template:Mvar which is maximal with respect to being an ordered field with an order extending that of Template:Mvar.[5] It is also the smallest subfield of the algebraic closure of Template:Mvar that is a Euclidean field and is an ordered extension of Template:Mvar.