Is $f(x)=\sum_{k\in\mathbb N}\frac1k\sin\frac x{2^k}$ bounded?

96 Views Asked by At

$$f(x)=\sum_{k\in\mathbb N}\frac1k\sin\frac x{2^k}$$Is this function bounded?

So obviously this converges because $|\frac1k\sin\frac x{2^k}|<|\frac x{2^k}|$ and $\sum\frac x{2^k}$ converges by the integral test.

Now I need to show that there exists a $N$ for all $y\in\text{range}\,f$ such that $|y|<N$.

So I think:

Let $a_k=\frac1k$ and $b_k=\sin\frac x{2^k}$. From the Schwarz inequality we get $|\sum a_kb_k|\leq\sqrt{\sum|a_k|^2\sum|b_k|^2}$. Since $a_k>0$ for all $k$ we have $a_k=|a_k|$ and thus $|a_k|^2=\frac1{k^2}$. $\sum\frac1{k^2}=\frac{\pi^2}6$ from the Reimann-Zeta. Now all we have left to prove is that $\sum|b_k|^2$ is bounded as well.

1

There are 1 best solutions below

3
On BEST ANSWER

The function is unbounded. In fact, take $x_m = \frac{2^{3m}}7 2\pi$; then the sequence $f(x_m)$ tends to infinity. To see this, note that $$ \sin\Big( \frac n72\pi \Big) \approx \begin{cases} 0.781831, &\text{if }n\equiv1\pmod 7, \\ 0.974928, &\text{if }n\equiv2\pmod 7, \\ -0.433884, &\text{if }n\equiv4\pmod 7. \end{cases} $$ Therefore \begin{align*} f(x_m) &= \sum_{j=1}^m \bigg( \frac1{3j-2}\sin\Big(\frac{2^{3m-(3j-2)}}7 2\pi\Big) + \frac1{3j-1}\sin\Big(\frac{2^{3m-(3j-1)}}7 2\pi\Big) + \frac1{3j}\sin\Big(\frac{2^{3m-3j}}7 2\pi\Big) \bigg) \\ &\qquad{}+ \sum_{k=3m+1}^\infty \frac1k\sin\Big( \frac\pi{7\cdot 2^{k-3m-1}} \Big) \\ &\approx \sum_{j=1}^m \bigg( \frac{0.974928}{3j-2} - \frac{0.433884}{3j-1} + \frac{0.781831}{3j} \bigg) + \sum_{k=3m+1}^\infty \frac1k\sin\Big( \frac\pi{7\cdot 2^{k-3m-1}} \Big) \\ &> \sum_{j=1}^m \frac{0.44}j + \sum_{k=3m+1}^\infty 0 > 0.44 \ln m. \end{align*}