This is an infinite binary expansion with digits in . If the usual expansion of has infinitely many digits, list their positions as . If it terminates with a final term , replace that term by
this also covers every dyadic rational. For , use . Thus every has the required form.
The representation by an infinite strictly increasing sequence is unique. If two sequences first differ at exponent , one sum contains and the other does not. The latter's entire possible tail is at most , while the former has plus its own nonempty tail, so the sums cannot agree.
For , factorization of a difference of powers gives
Consequently the polynomial obeys the Lipschitz bound
Since is not a root, is a nonzero integer, and hence
Moreover implies . Applying part (i) to , , and using gives
Rearrangement proves
This is the core estimate behind the Liouville approximation theorem.
Let
The tail satisfies
For every fixed positive integer , this is smaller than for all sufficiently large .
The binary expansion has digits at factorial positions and arbitrarily long blocks of zeros, but it is neither eventually zero nor eventually periodic. Since a rational number has an eventually periodic binary expansion, is irrational. If it were an algebraic number of degree , part (b), or equivalently the Liouville approximation theorem, would give a fixed positive multiple of as a lower bound for all rational approximations. The fractions violate that bound. Thus is a transcendental number.
This can be false. For any nonzero transcendental number , the number is also transcendental, since otherwise its reciprocal would be algebraic. Yet is algebraic.
This is always true for every positive integer . If were algebraic, then would be a root of the polynomial over the field of algebraic numbers. By transitivity of algebraic extensions, would then be algebraic over , contradicting its transcendence.

Articles by others on the same topic (0)

There are currently no matching articles.