Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In what sense (if at all) does the iteration $x \mapsto 2x^2 - 1$ converge to $\cos 2^n x$ in the unit interval [-1,1]?

One might try to plot in Mathematica:

y = x;
Table[y = 2 y^2 - 1; y, {k, 1, 5}]
Plot[%, {x, -1, 1}]

And you get an some plots resembling cosines of increasing frequency. Can this be made rigorous?

enter image description here

This is related to a similar question I asked.

share|cite|improve this question
up vote 4 down vote accepted

The recurrence $x_{n+1}=2x_n^2-1$ with $x_0$ in $[-1,1]$ can be translated to $x_0=\cos \alpha_0$ and $\cos\alpha_{n+1}=\cos 2\alpha_n=...=\cos 2^n \alpha_0$.

You cannot say that the iteration converges to $\cos 2^n \alpha_0$, because convergence would mean taking the limit as $n \to \infty$, and for $\alpha_0 \neq 0$ that limit may not exist.

Still, the recurrence means doubling the argument in a cosine function.

share|cite|improve this answer
Interestingly enough, you can use repeated doubling for numerically computing the cosine: start with some approximation like the Maclaurin series evaluated on an argument halved for the appropriate number of times, and then apply the doubling recursion the same number of times the original argument was halved. One could equivalently view this iteration with Chebyshev polynomials... – J. M. Sep 15 '11 at 2:51

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.