Math 2.0

statement theorem

Uniqueness of the complete ordered field

Statement

Let FF and KK be complete ordered fields. Then there is exactly one field isomorphism φ ⁣:F→K\varphi \colon F \to K that preserves the order, that is, with φ(a)≤φ(b)\varphi(a) \le \varphi(b) whenever a≤ba \le b.

Remarks

The proof first maps the rational elements of FF to those of KK. Each other element is the supremum of the rational elements below it, and φ\varphi maps it to the supremum of their images. In fact each field isomorphism between two complete ordered fields preserves the order, because the nonnegative elements are exactly the squares.

Explanations

L1 human

Two people may build the real numbers in different ways, for example with Dedekind cuts and with Cauchy sequences. This theorem says that they get the same number system, with only different names for the numbers.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Complete ordered field concept
  2. Ordered field definition
  3. Uniqueness of the complete ordered field statement

Sources

  1. Web https://en.wikipedia.org/wiki/Real_number, "The complete ordered field"