The problem is to calculate $A$: $$ A = \sqrt{2}^{\sqrt{2}^{\sqrt{2}^{\dots}}} $$ Here, each term (except the first and second) is a power of the previous power. I applied my usual method: $$ A = \sqrt{2}^A $$ However, this seems incorrect because $A$ could be both 2 and 4. What's wrong with my method, and what would be the correct approach?
-
2You have to make clear your notation and put some parentheis to indicate the order of the operations – guestDiego Jun 01 '16 at 14:41
-
http://math.stackexchange.com/questions/1089458/how-can-i-prove-the-convergence-of-a-power-tower – almagest Jun 01 '16 at 14:50
-
I assume you are talking about power towers. Your method is a way of finding out what the limit is if the tower converges. Yes, $A=\sqrt2^A$ has two solutions $2,4$ but it is easy to see that the sequence does not converge to 4. – almagest Jun 01 '16 at 14:52
-
@almagest How do you prove that it isn't $4$? – Zubin Mukerjee Jun 01 '16 at 14:55
-
Let $A_n$ be a tower of $n$ of the $\sqrt2$. Then we have $A_1=\sqrt2<2$. We claim that $A_n<2$ for all $n$. Induction $A_{n+1}=\sqrt2^{A_n}<\sqrt2^2=2$. – almagest Jun 01 '16 at 14:57
-
@almagest very nice – Zubin Mukerjee Jun 01 '16 at 21:32
3 Answers
When looking for $A$ such that $A=\sqrt2^A$, you're actually assuming that $A$ converges. So, when you find $A=2$ or $A=4$, you proved: "If $A$ converges, then it's either equal to $2$ or $4$".
I have no idea about proving the convergence of this, but in my opinion, the sequence diverges
EDIT: added some more info
Let $A_1 = \sqrt{2}$ and for $n>1$, let $$A_n=\sqrt{2}^{A_{n-1}}$$
You have shown that if this sequence of $A_n$ converges as $n\to\infty$, then it must converge to $2$ or $4$.
It is known that this sequence converges, since $$\frac{1}{e^e}\leq \sqrt{2}\leq \sqrt[e]{e}$$
Now, what is left to show is that it converges to $2$ and not $4$.
-
3I edited your answer to include some more info ... I know it's probably going to be $2$ because numerically, after the first few iterations, it gets very close to $2$ ... but I don't know how to prove it. Feel free to revert the edits if you want :) – Zubin Mukerjee Jun 01 '16 at 14:54
-
-
If $A=\sqrt{2}^A$ then it should also be the reverse relation valid: $\log_{\sqrt{2}}(A) = A $. Now apply that second relation to the iteration. See to which value this converges. Keywords are "attracting" and "repelling" fixpoints... – Gottfried Helms Jul 19 '16 at 06:07
First of all we need to formalize. Define the following sequence:
$$\left\{\begin{aligned}x_1 &:= \sqrt{2}\\ x_{n+1} &:= \Big(\sqrt{2}\Big)^{x_n}\end{aligned}\right.$$
$x_1 = \sqrt{2}$, $x_2 = \sqrt{2}^{\sqrt{2}}$, $x_3 = \sqrt{2}^{\sqrt{2}^{\sqrt{2}}}$, ...
The problem is equivalent to compute $\lim\limits_{n \to \infty} x_n$.
Convergence
To prove that $x_n$ converges (i.e. the limit is a real number), show monotone and bounded by induction: $$x_n \le x_{n+1}\quad\text{and}\quad x_n \le 2$$
Hint:
$$x_{n-1}\ln(\sqrt{2}) \le x_{n}\ln(\sqrt{2}) \le 2\ln(\sqrt{2})$$
Computing the limit
Let $L$ the limit. i.e. $L := \lim_{n \to \infty} x_n$.
Using the continuity of $f(x) = \sqrt{2}^x$:
$$\lim_{n \to \infty} x_{n+1} = \Big(\sqrt{2}\Big)^{\lim\limits_{n\to\infty} x_n}$$
i.e. $$L = \sqrt{2}^L$$
and $$x_n\le 2 \implies L \le 2$$
Therefore $L$ is a solution of $\sqrt{2}^x = x$ with $x \le 2$.
Finally we need to show the only solution is $L = 2$, to get $$\sqrt{2}^{\sqrt{2}^{ \sqrt{2}^{.^{.^.}} } } = 2$$
For $x \le 2$,
$$x \le 2$$ $$x\ln(\sqrt{2}) \le 2\ln(\sqrt{2})$$ $$\sqrt{2}^x \le \sqrt{2}^2$$ $$\ln(\sqrt{2})\sqrt{2}^x - 1 \le \ln(\sqrt{2})\sqrt{2}^2 - 1$$
By monotonicity of the integral, $$\underbrace{\int_{x}^2 \ln(\sqrt{2})\sqrt{2}^t - 1 \,dt}_{0 - (\sqrt{2}^x - x)} \le \Big(\underbrace{\ln(\sqrt{2})\sqrt{2}^2 - 1}_{\ln(2)-1}\Big)(2-x) $$
Then, $$\Big(1 - \ln(2)\Big)(2-x) \le \sqrt{2}^x - x$$
For $x \lneqq 2$, $$0 < \underbrace{\Big(1 - \ln(2)\Big)}_{> 0}\underbrace{(2-x)}_{>0 }\le \sqrt{2}^x - x$$ because $e > 2 \implies 1 > \ln(2) \implies 1-\ln(2) > 0$.
In summary, the only solution is $x = 2$ because in other case $x < \sqrt{2}^x$. i.e. $x \neq \sqrt{2}^x$.

- 175
- 6
We can show that the sequence converges with a proof by induction.
For $n =1$,we have that $\sqrt{2} < 2$. Assume that for some $n > 1$, $\sqrt{2} \uparrow \uparrow n < 2$. Then we have that
$$\sqrt{2} \uparrow \uparrow (n + 1) = \sqrt{2}^{\sqrt{2} \uparrow \uparrow n} < \sqrt{2}^2 = 2$$
Therefore the sequence is monotone (we know $x^y > x$ for $x > 1, y > 1$), and bounded, and therefore converges.

- 185
-
To show the sequence is monotone, it's not enough for $x^y > x$ for $x > 1$, $y > 1$. It has to be that $x^y > y$ which is not in general true given those conditions. – fblundun Nov 28 '17 at 10:12