Kronecker Approximation theorem and Fibonacci numbers - MathOverflow most recent 30 from http://mathoverflow.net 2013-06-19T03:50:20Z http://mathoverflow.net/feeds/question/58113 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/58113/kronecker-approximation-theorem-and-fibonacci-numbers Kronecker Approximation theorem and Fibonacci numbers Ostap Chervak 2011-03-10T22:53:24Z 2011-06-14T19:33:53Z <p>There is a famous old theorem by Kronecker that for every positive real $\alpha$ and $\epsilon>0$ there exists a positive integer n such that $\alpha n$ is within $\epsilon$ of an integer.</p> <p>Recently I found that the same result is true if we replace $\alpha n$ by $\alpha n^2$ or any polinomial p such that $p(0)=0$.</p> <p>Could this result be generalised to other functions? Particularly I'm curious about sequences $\alpha 2^n$ and $\alpha F_n$ where by $F_n$ I denote n-th Fibonacci number.</p> <p>Does anyone know anything about it?</p> http://mathoverflow.net/questions/58113/kronecker-approximation-theorem-and-fibonacci-numbers/58116#58116 Answer by Gerry Myerson for Kronecker Approximation theorem and Fibonacci numbers Gerry Myerson 2011-03-10T23:31:30Z 2011-03-10T23:31:30Z <p>$\alpha2^n$ is clearly not going to work, e.g., for $\alpha=1/3$. One place to look is the Kuipers and Niederreiter book on uniform distribution of sequences, although uniform distribution is a bit of overkill for the question you are asking about. </p> http://mathoverflow.net/questions/58113/kronecker-approximation-theorem-and-fibonacci-numbers/58119#58119 Answer by Nikita Sidorov for Kronecker Approximation theorem and Fibonacci numbers Nikita Sidorov 2011-03-11T00:35:57Z 2011-03-11T01:13:02Z <p>Well, as Gerry has pointed out, this is certainly not true for all $\alpha$. On the other hand, this is true for a.e. $\alpha$. More precisely, the sequence $2^n\alpha$ is equidistributed mod 1 for a.e. $\alpha$.</p> <p>I believe this result is due to H. Weyl and can be found in Cornfeld, Fomin and Sinai `Ergodic Theory'. (I don't have it with me.) </p> <p>The same must be true for the Fibonacci sequence, I'm sure. </p> <p>So, what you probably need is for this to be true for all $\alpha$, except some small (countable?) set. After all, $\|2^n\alpha\|&lt;\varepsilon$ is indeed much weaker than equidistibution. </p> <p><strong>Update.</strong> Come to think about it, the answer is as follows: let $$\alpha = \sum_{k=1}^\infty a_k2^{-k}$$ be the binary expansion of $\alpha$. Then the sequence $2^n\alpha\bmod 1$ gets arbitrarily close to 0 if and only if the sequence $(a_k)$ has unbounded strings of 0s. In particular, any rational $\alpha$ is out of the picture, apart from the binary rationals, of course.</p> <p>All in all, your set of $\alpha$'s is indeed of full measure, but the exceptional set is of Hausdorff dimension 1, i.e., pretty big.</p> <p>For the Fibonacci sequence you'll need to replace binary expansion with the $\beta$-expansion, where $\beta=(\sqrt5-1/)2$, with the same conclusion. </p> http://mathoverflow.net/questions/58113/kronecker-approximation-theorem-and-fibonacci-numbers/67797#67797 Answer by Asaf for Kronecker Approximation theorem and Fibonacci numbers Asaf 2011-06-14T19:33:53Z 2011-06-14T19:33:53Z <p>You've received two good answers, but I'll elaborate a bit. Usually equidistribution on the torus (or more general, compact groups) wrt the Haar measure is achieved by computing the Weyl sums and showing that there are some cancellations.</p> <p>The question you are referring to is studied in the area of so-called "sparse equidistribution" (although it is more of sparse density if you would like).</p> <p>The problem with the harmonic-analytic approach is by summing (or integrating) over very sparse part of your period. It is usually not stright forward to bound such exponential sums. For example, Vinogradov proved for example that ${p_{n}x}$ is equidistributed mod 1 for all irrational x, to bound the Weyl sums, he used sieves with what is called now Vinogradov sums, and a result about the odd Goldbach conjecture.</p> <p>Now if you are interested in a metric result (i.e. a.e. x), then it is a very classical result that for every increasing unbounded sequence \${a_{n}}$ and for a.e. x, one have that ${a_{n}x}$ is equi. mod 1, this is done by taking the Weyl sum, computing its L^2 norm, and then sub. limit and integration by the DCT.</p> <p>Now the question if such a result follows for every x is very subtle, and not always amenable to harmonic-analytic approach, and the current state of the art actually lies in the ergodic approaches.</p> <p>If you have a sequence which is contained inside a geometric progression, then there exists x's for which ${a_{n}x}$ is not equi. more generally, for ${q^{n}}$ say, you can find x's whose orbit closure is with any Hausdorff dimension you want (the reason here that as a dynamical system, this is isomorphic to Bernoulli shift on $q$ letters). More generally, a result due to Boshernitzan says that if you have a lacunary sequence (the limit of the ratios of consecutive elements is larger than 1), then the Hausdorff dimension of the set of exceptional x's (such that ${a_{n}x}$ is not dense/equidistributed) is 1. On the contrary, Boshernitzan shown that if the sequence is non-lacunary (the ratio tends to 1, you should think about it as having sub-exp. growth), then the Hausdorff dimension of the set for which ${a_{n}x}$ is equi. is 1. There were even some old results due to Erdos from the 1950's about it (he talked about convolution of Bernoulli measures, which can be interpreted in this sense as well).</p> <p>A very peculiar discovery by Furstenberg (67) shown that if you have a non-lacunary semigroup, say ${2^{n}3^{m}}$ then for every irrational x you get that ${2^{n}3^{m}x}$ is dense mod 1 (certainly not equidistributed). This result is very interesting, because you have density for every x. Moreover, recently, Bourgain-Lindenstrauss-P. Michel and Venkatesh proved an effective version of that theorem (meaning that you fix some epsilon, you can estimate how far you need to go in-order to find an element which is epsilon-close to an integer). An even recent work (by myself, still preprint), generalizing the Bourgain-Lindenstrauss paper, and I shown that sets like ${2^{n}3^{3^{m}}3^{3^{k^2}}x}$ are dense for every x.</p> <p>About Fibonacci sequences, it follows from my work (based on other work of D. Meiri whith Yuval Peres and Elon Lindnstrauss), that you can prove density of sequences such as ${2^{n}3^{3^{m}}F_{k}x}$ for every irrational x. For the general Fibonachi sequences, you are basically in the lacunary case, which Boshernitzan already covered in certain sense.</p>