## Have all numbers with “sufficiently many zeros” been proven transcendental?

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Any number less than 1 can be expressed in base g as $\sum _{k=1}^\infty {\frac {D_k}{g^k}}$, where $D_k$ is the value of the $k^{th}$ digit. If we were interested in only the non-zero digits of this number, we could equivilantly express it as $\sum _{k=1}^\infty {\frac {C_k}{g^{Z(k)}}}$, where $Z(k)$ is the position of the $k^{th}$ non-zero digit base $g$ and $C_k$ is the value of that digit (i.e. $C_k = D_{Z(k)}$).

Now, consider all the numbers of this form $(\sum _{k=1}^\infty {\frac {C_k}{g^{Z(k)}}})$ where the function $Z(k)$ eventually dominates any polynomial. Is there a proof that any number of this form is transcendental?

So far, I have found a paper demostrating this result for the case $g=2$; it can be found here: http://www.escholarship.org/uc/item/44t5s388?display=all

-

3
This was also posted on MSE: math.stackexchange.com/questions/6321/… . – Joseph O'Rourke Oct 9 2010 at 16:37

2
Roth's theorem. – Felipe Voloch Oct 9 2010 at 17:05

7
Roth's theorem implies that it is transcendental if $Z(k+1)>(2+\epsilon)Z(k)$ infinitely often. Unfortunately, Z(k) eventually dominating any polynomial is not sufficient to guarantee this. Even $Z(k)=2^k$ doesn't grow fast enough for Roth's theorem to apply. – George Lowther Oct 9 2010 at 17:23

6
But the $p$-adic version of Roth's theorem (due to Ridout in the version one needs here) does the trick if $Z(k+1) > (1+ \epsilon) Z(k)$ infinitely often and, in particular for $Z(k)=2^k$. – Mike Bennett Oct 9 2010 at 22:24

1
I see the correct theorem now. The paper is Rational approximations to algebraic numbers (dx.doi.org/10.1112/S0025579300001182). Not free access, but it is quoted in An explicit version of the theorem of Roth-Ridout (seminariomatematico.dm.unito.it/rendiconti/…) Theorem 2 (Ridout's theorem). This does indeed do the job! Many thanks for that. In fact you only need the denominators to have factors from some finite set of primes, which covers Z(k) growing exponentially and any base. Still, the case for Z(k) merely dominating any polynomial seems to be open. – George Lowther Oct 11 2010 at 1:25
show 5 more comments

## 2 Answers

I don't know of a paper proving the result, but I can prove it for you now. In fact, the methods in the paper you link generalize to an arbitrary base g > 2. The authors of the paper don't seem to think that it generalizes quite so easily, as in the Open Problems section they state that "For bases b  > 2 there is the problem of having more than two possible digits. What kinds of bounds might be placed on counts of 1's and 2's for ternary expansions of algebraic numbers?". Hopefully I have not made any major mistakes...

[Edit: A paper by Bugeaud, On the b-ary expansion of an algebraic number, available from his homepage gives lower bounds on the number of nonzero digits in an irrational algebraic number. There, he references the paper linked in the question, saying "Apparently, their approach does not extend to a base b with b ≥ 3". However, he has just responded to this question, agreeing that the method does indeed generalize. So I'm more confident about my proof now.]

Use #(x,N) to denote the number of nonzero base-g digits in the expansion of x, up to and including the Nth digit after the 'decimal' point, then what you are asking for is implied by the following.

If x is irrational and satisfies a rational polynomial of degree D then #(x,N) ≥ cN1/D for a positive constant c and all N.

First, I'll introduce some notation similar to that used in the linked paper. Use r1(n) to denote that n'th base-g digit of x, so that 0 ≤ r1(n) ≤ g-1 and $$x=\sum_nr_1(n)g^{-n}.$$

It's enough to consider 1 ≤ x < 2, so I'll do that throughout. Then r1(n)=0 for n < 0 and r1(0) = 1. Also use rd(n) to denote $$r_d(n)=\sum_{p_1+p_2+\cdots+p_d=n}r_1(p_1)r_1(p_2)\cdots r_1(p_d)=\sum_{j+k=n}r_1(j)r_{d-1}(k)$$ This satisfies the inequalities rd(n) ≥ r1(0)rd-1(n) = rd-1(n) and $$\sum_{n\le N}r_d(n)\le(g-1)^d \#(x,N)^d\le(g-1)^d(N+1)^d.\qquad\qquad(1)$$ Also, raising x to the d'th power gives $$x^d=\sum_nr_d(n)g^{-n},$$ which differs from the base g expansion of xd only because rd(n) can exceed g. We also introduce notation for the expansion of x with the digits shifted to the left R places and truncated to leave the fractional part, $$T_d(R)=\sum_{n\ge1}r_d(R+n)g^{-n},$$ so that gRxd-Td(R) is an integer. This can also be bounded, using (1), $$\begin{array}{rl} \displaystyle T_d(R)&\displaystyle\le\sum_{n\ge1}(g-1)^d(R+n+1)^dg^{-n}\\ &\displaystyle\le\sum_{n\ge1}(g-1)^d(R+1)^d(n+1)^dg^{-n}\\ &\displaystyle\le C_d(R+1)^d \end{array}$$ where $C_d=\sum_{n\ge1}(g-1)^d(n+1)^dg^{-d}$ is a constant independent of R.

Now suppose that x satisfies an integer polynomial of degree D > 1, $$A_Dx^D+A_{D-1}x^{D-1}+\cdots+A_1x+A_0=0$$ with AD > 0. It follows that $$T(R)\equiv\sum_{d=1}^D A_dT_d(R)$$ is an integer for each R. The following is similar to Theorem 3.1 in the linked paper.

Lemma 1: For all sufficiently large N, there exists n ∈ (N/(D+1),N) with r1(n) > 0.

Proof: This is a consequence of Liouville's theorem for rational approximation. If the statement was false then setting $m=\lfloor N/(D+1)\rfloor$, $p=\sum_{n=0}^mr_1(n)g^{-n}$, $q=g^{m}$ gives infinitely many approximations $\vert x-p/q\vert=q^{-D}o(1)$ as N increases, contradicting Liouville's theorem.

In Lemma 1, Roth's theorem could have been used to reduce the D+1 term to 2+ε. In fact, Ridout's theorem as discussed in the comments can be used to reduce it even further to 1+ε. This isn't needed here, so I just used the more elementary Liouville's theorem.

Lemma 6.1 from the linked paper generalizes to base b, and puts upper bounds on the number of times at which T(n) can be nonzero.

Lemma 2: For large enough N, setting $K=\lceil 2D\log_g N\rceil$ gives $$\sum_{1\le R\le N-K}T_d(R) < (g-1)^{d-1} \#(x,N)^d+1$$ for 1 ≤ d ≤ D and so, $$\sum_{1\le R\le N-K}\vert T(R)\vert\le\sum_{d=1}^D\vert A_d\vert ((g-1)^{d-1} \#(x,N)^D+1)$$

Proof: Using similar inequalities to the proof used in the linked paper, $$\begin{array}{rl} \displaystyle\sum_{1\le R\le N-K}T_d(R) &\displaystyle=\sum_{m\ge1}g^{-m}\sum_{R\le N-K}r_d(R+m)\\ &\displaystyle\le\sum_{m=1}^Kg^{-m}\sum_{R\le N}r_d(R)+g^{-K}\sum_{m > K}g^{K-m}\sum_{R\le N-K}r_d(R+m)\\ &\displaystyle \le \frac{1}{g-1}\sum_{R\le N}r_d(R)+g^{-K}\sum_{K\le R\le N}T_d(R)\\ &\displaystyle\le(g-1)^{d-1}\#(x,N)^d+g^{-K}NC_d(N+1)^d. \end{array}$$ The final term is bounded by Cd(N+1)d+1/N2D which will be less than 1 for N large.

Lemma 6.2 also generalizes, which gives blocks where T(R) is nonzero.

Lemma 3: Let R1 < R2 be positive integers with rD-1(R) = 0 for all R ∈ (R0,R1] and T(R1) > 0. Then T(R) > 0 for all R ∈ [R0,R1].

Proof: We have the following relation for T, $$T(R-1)=\frac{1}{g}T(R)+\frac{1}{g}\sum_{d=1}^D A_dr_d(R).$$ As rd(n) ≥ rd-1(n), the hypothesis implies that rd(R) = 0 for all 1 ≤d ≤D-1 and R ∈ (R0,R1]. Therefore, $$T(R-1)=\frac{1}{g}T(R)+\frac{1}{g}A_Dr_D(R)\ge \frac{1}{g}T(R).$$ Assuming inductively that T(R) > 0 gives T(R-1) > 0.

Putting this together gives the result (Theorem 7.2 in the linked paper).

Theorem 4: There is a constant c such that, for all sufficiently large N $$\#(x,N)>cN^{1/D}$$

Proof: Suppose not, then for any δ > 0, there are infinitely many N with #(x,N) < δN1/D and, using (1), $$\sum_{n\le N}r_{D-1}(n)\le \delta N^{1-1/D}\qquad\qquad(2)$$ In particular, the proportion of integers R with rD-1(R) > 0 goes to 0. Let 0 = R1 < R2 <...< RM ≤ N be those integers in the range [0,N] with rD-1(Rk) > 0 and set RM+1 = N. Then (2) gives M+1 ≤ δN1-1/D, and rd(R) = 0 for d ≤ D-1 and R in any of the ranges (Ri,Ri+1). So, Td(R-1) = gR-Ri+1Td(Ri+1-1).

Fixing ε > 0 and letting I denote the numbers i with Ri+1-Ri > εN1/D gives $$\sum_{i\in I}(R_{i+1}-R_i)\ge N - (M+1)\epsilon N^{1/D}\ge N(1-\epsilon \delta).$$ So, the intervals (Ri,Ri+1) larger than εN1/D cover most of the interval [0,N], as long as εδ is small enough.

If R is in the range (Ri,Ri+1-DloggN) and rD(R) > 0 then T(R-1) > 0: $$T(R-1)\ge \frac{1}{g}A_D-g^{R-R_{i+1}}\sum_{d=1}^{D-1}\vert A_d\vert T_d(R_{i+1}-1) \ge\frac1g-N^{-D}\sum_{d=1}^{D-1}\vert A_d\vert C_d R_{i+1}^d$$ which is positive, so long as N is chosen large enough.

Assuming that N is large enough, by Lemma 1, for each i in I, there is $$j\in\left(\frac{1}{D+1}(R_{i+1}-R_i-D\log_gN),R_{i+1}-R_i-D\log_gN\right)$$ with r1(j) > 0. Then, rD(Ri+j) ≥ rD-1(Ri)r1(j) is positive, so T(Ri+j-1) > 0. Lemma 3 implies that T(Ri+j) is positive for all 0 ≤ j< (Ri+1-Ri-DloggN)/(D+1). $$\sum_{1\le n< N-2D\log_g N}\vert T(n)\vert\ge\frac{1}{D+1}\sum_{i\in I}(R_{i+1}-R_i-2D\log_gN) \ge\frac{N(1-\epsilon\delta)}{D+1}-2\delta N^{1-1/D}\log_gN$$ This contradicts Lemma 2, which gives, for N large, $$\sum_{1\le n< N-2D\log_g N}\vert T(n)\vert =O(\delta^D N).$$

-

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

I must apologize and correct what I wrote in an earlier paper: the method does extend to base > 2. Using Liouville's inequality, you lose a bit in the constant c, but the great advantage is that everything can be made fully explicit.

-

+1. Many thanks for your response! Unfortunately, with less than 50 rep you can't add a comment to my answer, but I'll edit it to refer to this response. – George Lowther Oct 11 2010 at 15:36
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 23, "mathjax_display_tex": 20, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.919136106967926, "perplexity_flag": "head"}