let $\psi:[0,1]\times \{0,1\} \rightarrow [0,1]$ be defined by: $$ \psi(x,\beta) = \beta \cos x + (1-\beta) \sin x $$
define $B_n$ as the set of $2^n$ binary strings $b=b_0b_1\dots b_{n-1}$ where each $b_j$ is a $0$ or a $1$.
now, for a given $b \in B_n$ we define a set of $n$ functions: $\psi_{b,k}:[0,1] \rightarrow [0,1] \;(k=0,\dots n-1)$ as follows: $$ \psi_{b,0}(x) = \psi(x,b_0) $$ and for $k=1,\dots,n-1$ $$\psi_{b,k}(x) = \psi(\psi_{b,k-1}(x),b_k) $$ an example may clarify this definition. let $n=5$ and take $b=01101$ then $$ \psi_{b,0}(x) = \psi(x,0) = \sin x \\ \psi_{b,1} (x)= \psi(\sin x,1) = \cos \circ \sin x \\ \psi_{b,2} (x)= \psi(\cos \circ \sin x ,1) = \cos \circ \cos \circ \sin x \\ \psi_{b,3} (x)= \psi(\cos \circ \cos \circ \sin x ,0) = \sin \circ \cos \circ \cos \circ \sin x \\ \psi_{b,4} (x)= \psi(\sin \circ \cos \circ \cos \circ \sin x ,1) = \cos \circ\sin \circ \cos \circ \cos \circ \sin x $$ in this fashion, for any bit-string $b$ of length $n$, we may define $\psi_b:[0,1] \rightarrow [0,1]$ as the last of these functions $\psi_{b,n-1}$
QUESTION my recent question about the convergence of the iterated cosine was answered by user44197 by applying Brower's fixed point theorem. this problem was in fact the case $\psi_1$. can the same method be used to assure the iterative convergence of any $\psi_b$?