Math 2.0

statement theorem

The constructible numbers form a field closed under square roots

Statement

The set of the constructible numbers is a subfield of C\mathbb{C}. If zz is constructible, then the square roots of zz are constructible. Moreover, the field of constructible numbers is the smallest subfield of C\mathbb{C} that is closed under square roots.

Remarks

The proof of closure uses classical constructions: parallels and similar triangles give products and quotients, and a circle on a diameter of length 1+x1 + x gives x\sqrt{x}. Conversely, the intersection points of lines and circles have coordinates that come from the old ones by field operations and square roots. So a number is constructible if and only if it is obtained from Q\mathbb{Q} by finitely many field operations and square roots. The constructible real numbers form an ordered field in which every positive element has a square root.

Explanations

L1 human

You can add, subtract, multiply and divide lengths with straightedge and compass, and you can take square roots. Nothing else is possible, because lines and circles only lead to equations of degree one or two.

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 depends on this

5 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Constructible_number, Algebraic properties
  2. Web https://en.wikipedia.org/wiki/Constructible_number, Equivalence of algebraic and geometric definitions