Use Slutsky’s theorem to show that: $\sqrt{n}(e^{\frac{S_n}{n}}-e^{\mu}) \xrightarrow{d} \sigma e^{\mu}Z$

probabilityprobability theoryprobability-limit-theoremsself-learning

Let $\{X_n\}_{n\ge1}$ be a sequence of i.i.d. random variables with common mean $\mu$ and variance $\sigma^2 \in (0,\infty)$. Use Slutsky's theorem to show that:
\begin{align}
\sqrt{n}(e^{\frac{S_n}{n}}-e^{\mu}) \xrightarrow{d} \sigma e^{\mu}Z
\end{align}

where $S_n=\sum\limits_{k=1}^{n}X_k$ and $Z\in N(0,1)$.

I have used Slutsky's theorem in plenty of problems before but I cannot make any progress on this one, any help here would be greatly appreciated.

Best Answer

Define $$ G(t)=\begin{cases}\dfrac{e^t-\mu}{t-\mu}, & t\neq \mu,\cr e^\mu, & t=\mu.\end{cases} $$ This function is continuous everywhere since $\lim\limits_{t\to\mu}\dfrac{e^t-\mu}{t-\mu}=(e^t)'_\mu=e^\mu$. By LLN, $\frac{S_n}{n}\xrightarrow{p}\mu$, and by continuous mapping theorem, $$ G\left(\frac{S_n}{n}\right)\xrightarrow{p}G(\mu)=e^\mu. $$ Then $$ \sqrt{n}\left(e^{\frac{S_n}{n}}-e^{\mu}\right)=\sqrt{n}\left(\frac{S_n}n-\mu\right)\cdot G\left(\frac{S_n}{n}\right). $$ Here the first term $\sqrt{n}\left(\frac{S_n}n-\mu\right)\xrightarrow{d}\sigma Z$ by CLT, where $Z\sim N(0,1)$. And the second term converges in probability to $e^\mu$. Slutsky's theorem implies that the product converges in distribution to $\sigma e^\mu Z$.

Note that this is almost the same reasoning as in the previous answer, and indeed the same as the so-called delta method.