Infinite Random Power Towers
Abstract
We prove a probabilistic generalization of the classic result that infinite power towers, cc…, converge if and only if c∈[e-e,e1/e]. Given an i.i.d. sequence \Ai\i∈ N, we find that convergence of the power tower A1A2… is determined by the bounds of A1's support, a=∈f(supp(A1)) and b=(supp(A1)). When b∈[e-e,e1/e], a<1<b, or a=0, the power tower converges almost surely. When b<e-e, we define a special function B such that almost sure convergence is equivalent to a<B(b). Only in the case when a=1 and b>e1/e are the values of a and b insufficient to determine convergence. We show a rather complicated necessary and sufficient condition for convergence when a=1 and b is finite. We also briefly discuss the relationship between the distribution of A1 and the corresponding power tower T=A1A2…. For example, when T[0,1], then the corresponding distribution of A1 is given by UV where U,V[0,1] are independent. We generalize this example by showing that for U[α,β] and r∈ R, there exists an i.i.d. sequence \Ai\i∈ N such that Ur d= A1A2… if and only if r∈[0, 11+ β].
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.