theorem on constructible numbers
Theorem 1.
Let be the field of constructible numbers and . Then there exists a nonnegative integer such that .
Before proving this theorem, some preliminaries must be addressed.
First of all, within this entry, the following nonconventional definition will be used:
Let be a subset of that contains a nonzero complex number and . Then is immediately constructible from if any of the following hold:
- •
for some ;
- •
for some ;
- •
for some ;
- •
for some with ;
- •
for some with and with .
The following lemmas are clear from this definition:
Lemma 1.
Let be a subset of that contains a nonzero complex number and . Then is constructible from if and only if there exists a finite sequence such that is immediately constructible from , is immediately constructible from , , and is immediately constructible from .
Lemma 2.
Let be a subfield of and . If is immediately constructible from , then either or .
Now to prove the theorem.
Proof.
By the first lemma, there exists a finite sequence such that is immediately constructible from , is immediately constructible from , , and is immediately constructible from . Thus, is immediately constructible from , , and is immediately constructible from . By the second lemma, is equal to either or , is equal to either or , , and is equal to either or . Therefore, there exists a nonnegative integer such that . Since , it follows that there exists a nonnegative integer such that .∎