Euclidean ordered field

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short descriptionScript error: No such module "about".

In mathematics, a Euclidean field is an ordered field KScript error: No such module "Check for unknown parameters". for which every non-negative element is a square: that is, x ≥ 0Script error: No such module "Check for unknown parameters". in KScript error: No such module "Check for unknown parameters". implies that x = y2Script error: No such module "Check for unknown parameters". for some yScript error: No such module "Check for unknown parameters". in KScript error: No such module "Check for unknown parameters"..

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

Examples

Every real closed field is a Euclidean field. The following examples are also real closed fields.

Counterexamples

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.

References

<templatestyles src="Reflist/styles.css" />

  1. Martin (1998) p. 89
  2. a b Lam (2005) p.270
  3. Martin (1998) pp. 35–36
  4. Martin (1998) p. 35
  5. Efrat (2006) p. 177

Script error: No such module "Check for unknown parameters".

  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".

External links