$$
x\_{n}=\sum^{n-1}\_{i=0} {a\_i x\_{n-1-i}}
$$
where
$$
\sum^{+\infty}\_{i=0} {a\_i}=1,1>a\_i>0,1>x\_i>0
$$


In fact, the specific problem (comes from probability theory) I want to solve is that:


$0<d<0.2$ is a constant.
$E\_n(p) \in C[0,1]$is a function of p, $E\_0(p)=p$, and $E\_n(p)$ can be defined by：


$$
E\_n(p)=a\_n(p)+\sum^{n-1}\_{i=0} {a\_{n-1-i}(p) E\_i(p)}
$$


$$
if p>1-5d, then\ a\_n(p)=0,
$$$$
otherwise,\ a\_n(p)=l\_n(p)
$$
where
\begin{eqnarray}
l\_n(p)=
\begin{cases}
p, & n=0 \cr
\prod^{n-1}\_{k=0}{(1-p-d k)} (p+d n), & 1\leq n\leq 4 \cr
\prod^{4}\_{k=0}{(1-p-d k)} (1-p-5d)^{n-5} (p+5d),& n \geq 5 \cr
\end{cases}
\end{eqnarray}


I am sure that there is a function $u \in C[0,1]$ s.t.
\begin{eqnarray}
\lim\limits\_{n\to+ \infty}|| E\_n(p)-u(p)||\_{max}=0
\end{eqnarray}
but I do not know how to prove the convergence.


It is bounded, but it seems that the sequence is not monotonous.I tried some elementary methods to simplify the question, but we still need to prove $E\_{n+1}-E\_{n}$->0.


I found that $E\_{n+1}-E\_{n}$ is not decreasing, and I have no good ideas now.


By the way, I guess there is no easy(elementary) expression, but I cannot prove the existence yet.



How to prove the convergence of this kind of sequence?
If $p>1-5d$, then $a\_n(p)=0$ for all $n\ge1$ and hence $E\_n(p)=0$ for all $n\ge1$.


So, without loss of generality $0\le p\le1-5d$. Then, letting $E\_{-1}:=1$, for all $n\ge0$ we get
\begin{equation\*}
 E\_n=\sum\_{i=-1}^{n-1}l\_{n-1-i}E\_i, 
\end{equation\*}
where $E\_n:=E\_n(p)$ and $l\_n:=l\_n(p)$.


Here is the key point: Using the fact that $(l\_5,l\_6,\dots)$ is a geometric progression, one can check that
\begin{equation\*}
 E\_{n+1}=\sum\_{j=0}^5 b\_j E\_{n-j} \tag{1}
\end{equation\*}
for all $n\ge4$, where
\begin{equation\*}
 b\_j:=l\_j+(p+5d-1)l\_{j-1}. 
\end{equation\*}
Moreover, one can check that
\begin{equation}
\text{$b\_0,\dots,b\_5$ are $>0$ and $\sum\_{j=0}^5 b\_j=1$. }\tag{2} 
\end{equation}


The [general solution](https://en.wikipedia.org/wiki/Recurrence_relation#Roots_of_the_characteristic_polynomial) of the [linear difference equation](https://en.wikipedia.org/wiki/Linear_difference_equation#Characteristic_equation_and_roots) (1) is given by
\begin{equation\*}
 E\_n=\sum\_{k=0}^5 C\_k(n) z\_k^n, \tag{3}
\end{equation\*}
where the $z\_k$'s are the roots of the characteristic polynomial
\begin{equation\*}
 P(z):=z^6-\sum\_{j=0}^5 b\_j z^{5-j}=z^6-\sum\_{j=0}^5 b\_{5-j}z^j
\end{equation\*}
and the $C\_k(n)$'s are polynomials in $n$ (whose degrees are nonzero if the corresponding roots $z\_k$ are multiple ones). Moreover, in view of (2), we have the following:


(i) $1$ is a root of $P(z)$; say, $z\_0=1$.


(ii) The multiplicity of $z\_0=1$ is $1$, since $P'(1)=6-\sum\_{j=0}^5 b\_j(5-j)\ge6-5\sum\_{j=0}^5 b\_j=1>0$. So, $C\_0:=C\_0(n)$ does not depend on $n$.


(iii) $|z\_k|<1$ for all $k=1,\dots,5$: Indeed, if $0=P(z)=z^6-\sum\_{j=0}^5 b\_{5-j}z^j$ for some complex $z$ with $|z|\ge1$, then, by the triangle inequality, $|z|^6\le\sum\_{j=0}^5 b\_{5-j}|z|^j\le\sum\_{j=0}^5 b\_{5-j}|z|^5=|z|^5$, so that $|z|\le1$ and hence $|z|=1$. Moreover, similarly the condition $|z|=1$ for a root $z$ of $P(z)$ implies the contradictory inequality $|z|^6<|z|^5$ unless the complex numbers $1$ and $z$ lie on the same ray emanating from $0$ -- that is, unless $z=1$.


It follows from (3) and (i)--(iii) that
\begin{equation}
 E\_n\to C\_0 \tag{4}
\end{equation}
as $n\to\infty$. Of course, $E\_n$ and $C\_0$ may/will depend on $d,p$. The convergence in (4) holds for each pair $(d,p)$ satisfying the OP conditions $0<d<1/5$ and $0\le p\le1-5d$.


