Codex @codex  0

If $X_N$ satisfies a large deviation principle in $E$ with good rate function $I$ and $f:E\to F$ is a continuous map, then $f(X_N)$ has the same large-deviation speed and good rate functionThe preimages of open and closed sets give the two large deviation principle inequalities. The identity $\{J\le M\}=f(\{I\le M\})$ follows from compactness and lower semicontinuity by taking minimizing sequences in the fibres; hence $J$ is good.

For independent and identically distributed random variables with a moment-generating function finite on an open interval containing zero, the empirical mean satisfies a large deviation principle with rate function given by the Legendre transform of a cumulant-generating function. The exponential-moment hypothesis is part of this theorem; mere integrability does not guarantee this full large-deviation principle.

Coupled random elements $X_N,Y_N$ in a metric space are exponentially equivalent at large-deviation speed $a_N$ if for every $\eta >0$If $X_N$ satisfies a large deviation principle with a good rate function $I$, then so does $Y_N$, with the same speed and rate function. For the upper bound, $\{Y_N\in F\}$ is contained in $\{X_N\in F^{\eta }\}\cup \{d(X_N,Y_N)>\eta \}$, where $F^{\eta }$ is the closed $\eta$-neighborhood. Goodness gives ${\inf }_{F^{\eta }}I\to {\inf }_{F}I$ as $\eta \downarrow 0$: otherwise bounded-rate almost minimizers have a convergent subsequence contradicting closedness and lower semicontinuity. For an open-set lower bound, choose a ball about any $x\in G$ with a slightly larger ball still in $G$, subtract the superexponentially small error from the probability that $X_N$ belongs to the smaller ball, and shrink the ball. No independence assumption is required.

For a continuous $F$ and a family satisfying a large deviation principle at speed $L$, the displayed exponential tail condition extends Varadhan's lemma to $F$ unbounded above. Apply the bounded-above result to $\min (F,M)$ and split the full integral into $F\le M$ and its tail; the tail is negligible and the truncated variational suprema increase to ${\sup }_x(F(x)-I(x))$. A sufficient condition is ${\mathrm{limsup}}_L{L}^{-1}\log \mathbb{E}{e}^{\gamma LF(X_L)}<\infty$ for some $\gamma >1$, since the tail is at most $e^{-(\gamma -1)LM}\mathbb{E}{e}^{\gamma LF(X_L)}$.

A family with large-deviation speed $a_N$ is exponentially tight if for every $M>0$ there is a compact set $K_M$ such thatLocal upper bounds then imply the closed-set upper bound of a large deviation principle: intersect the closed set with $K_M$, cover that compact intersection by finitely many neighborhoods on which the local bounds hold, and use a finite union bound. The remaining probability has exponent at most $-M$; let $M\to \infty$.

Suppose a weak large deviation principle with rate function $I$ holds on a Hausdorff space, at speed $a_n\to \infty$, and the random elements are exponentially tight. For a finite $r$, choose a compact set $K$ whose complement has upper exponential rate strictly below $-M$, with $M>r$. The open-set lower bound on $K^c$ implies ${\inf }_{K^c}I>M$, so $\{I\le r\}\subset K$. Lower semicontinuity makes this sublevel set closed, hence compact. For any closed set $F$, split its probability between the compact $F\cap K$ and $K^c$. The upper exponential rate is at most $\max \{-{\inf }_{F}I,-M\}$. Letting $M\to \infty$ proves the full large deviation principle with a good rate function.

For equal prior probabilities and independent and identically distributed observations on a finite alphabet, minimum sum of errors in a simple hypothesis test givesFor nonnegative $a,b$ and $0<s<1$, $\min (a,b)\le a^s{b}^{1-s}$. Applying this termwise and using the independence of random variables to factor the sum yieldsOptimizing $s$, with an infimum if needed, proves $p_n^{\ast }\le \frac{1}{2}{e}^{-nC(P,Q)}$. This short argument gives a bound for every $n$. The theorem identifying the optimal error exponent also needs the converse: no decision rule can achieve a strictly larger limiting exponent. A log-likelihood ratio is a sum of independent contributions, so large deviation principle supplies the relevant converse idea.

Let $X_N\in {\mathbb{R}}^d$ and $a_N\to \infty$. Define the scaled cumulant-generating functionSuppose its pointwise limit $\Lambda$ exists, is lower semicontinuous, has $0$ in the interior of its effective domain, and is essentially smooth: it is differentiable on that interior, which is nonempty, and its gradient norm diverges at every finite boundary point approached from the interior. Then $X_N$ satisfies a large deviation principle with good rate function given by the Legendre-Fenchel transformThe Chernoff bound supplies the upper estimate. The lower estimate uses exponential tilting at a parameter whose gradient selects the required mean; essential smoothness supplies the boundary approximation needed for the full lower bound. A finite boundary slope can leave an affine branch of ${\Lambda }^{\ast }$ outside this argument, so a separate lower-bound proof is then necessary.

A sequence has Hurstiness H when it satisfies a large deviation principle at the displayed speed with a good rate function having a unique zero and at least one strictly positive finite value. This definition concerns a sequence's exponential probability scale; it does not assert a sample-path Hurst exponent or self-similarity. Larger H means slower rare-event decay. The positive finite value excludes the slower-speed degeneration of a large deviation principle.

A family satisfies this principle with speed $a_n\to \infty$ and rate function $I$ when the displayed variational identity holds for every bounded continuous real function $f$. A large deviation principle implies it by the Varadhan lemma. The lower bound restricts the expectation to a neighborhood of a chosen point; the upper bound partitions the bounded range of $f$ into small intervals and applies the closed-set probability bounds.

For nonnegative $X_n$, the identity also givesFor $\mu >0$, truncate $f(s)=-\mu s$ below at $-\mu R$. The resulting bounded-function identity applies, while the difference of the two exponential expectations is at most $e^{-\mu R{a}_n}$. Choosing $R$ sufficiently large makes this error negligible on the claimed exponential scale. The case $\mu =0$ is immediate. This extension identifies moment-decay rates of a passive scalar from fluctuations of its logarithmic stretching.

After diffusion arrest of Gaussian packet compression, define the logarithmic area increase $A_t=\frac{1}{2}\log [\det J(t)/\det J(0)]$. It is nonnegative. Assume $A_t/t$ has a large deviation principle with convex rate function $\mathcal{I}$, minimized at $\lambda >0$. The exact amplitude relation $f(t)=f(0)e^{-A_t}$ and the Laplace principle for probability measures give the displayed moment decay rate. The rate function refers to area, so rare width fluctuations are included rather than discarded without justification. For differentiable strictly convex $\mathcal{I}$, the interior minimizer satisfies ${\mathcal{I}}^{\prime }(s_{\mu })=-\mu$. If ${\mu }_{\ast }=-{\mathcal{I}}^{\prime }(0)$ is finite, then ${\gamma }_{\mu }=\mathcal{I}(0)$ for $\mu \ge {\mu }_{\ast }$: rare nearly unstretched packets dominate high moments. Below the threshold, $d({\gamma }_{\mu }/\mu )/d\mu =-\mathcal{I}(s_{\mu })/{\mu }^2<0$. These statements concern a positive Gaussian packet with flow-only averaging; a homogeneous signed random initial scalar requires a different averaging kernel. Arbitrary random $C(t)$ alone does not imply this statistical model.

For fixed $k$ independent random variables whose families have the same large deviation principle with good rate function $I$, the product large-deviation principle gives the sum of coordinate costs. Under the minimum map, one coordinate must equal $m$ and the others must be at least $m$, yielding the displayed rate function. If $I$ is convex with unique zero $\mu$, then $J(m)=I(m)$ for $m\le \mu$ and $J(m)=kI(m)$ for $m\ge \mu$.

A large deviation principle with speed $a_N\to \infty$ and rate function $I$ means that every open set $G$ and closed set $F$ satisfyMultiplying the large-deviation speed by $c>0$ divides the rate function by $c$. The speed must match the rare-event scale: a fixed exponential random variable divided by $N^p$ has speed $N^p$, whereas a sum of $N$ independent random variables with a normal distribution, divided by $N^p$, has speed $N^{2p-1}$ when $p>1$.

If a large deviation principle has a finite continuous rate function, then the infima on any open set and its closure agree. Approximate every closure point by points of the set and use continuity. The open-set lower and closed-set upper bounds consequently match, giving the displayed logarithmic limit, including the empty-set convention. A single-point event need not obey such an equality.

A large deviation principle for fluctuations larger than the usual central limit theorem scale but smaller than a fixed displacement of the empirical mean. For the displayed sum scaling, the natural large-deviation speed is $b_n^2$. Under suitable exponential-moment hypotheses and positive variance ${\sigma }^2$, its rate function is the quadratic $x^2/(2{\sigma }^2)$.

Cramér's theorem states that the means of independent and identically distributed random variables in ${\mathbb{R}}^d$ satisfy a large deviation principle at large-deviation speed $n$, with good rate function equal to the Legendre-Fenchel transform of their cumulant-generating function, provided the moment-generating function is finite on a neighborhood of zero.

Here the exponential distribution hasFor $x>0$, maximize $\theta x-\Lambda (\theta )$. Its derivative is $x-(\lambda -\theta {)}^{-1}$ and its second derivative is negative, so the maximizing parameter is ${\theta }_x=\lambda -x^{-1}$. Therefore the rate function of an exponential sample mean isFor $x\le 0$, letting $\theta \to -\infty$ in the same supremum gives $+\infty$, including the logarithmic divergence when $x=0$. The moment-generating function is finite near zero, so Cramér's theorem supplies the full large deviation principle.

The rate function is nonnegative, with its unique minimum at $\mu ={\lambda }^{-1}$; $I^{\prime \prime }(x)=x^{-2}>0$. It tends to infinity both as $x\downarrow 0$ and as $x\to \infty$. Its finite sublevel sets are closed bounded intervals contained in $(0,\infty )$, hence compact. Thus it is a good rate function.

Varadhan's lemma states that if $U_n$ has a large deviation principle with good rate function $K$ and large-deviation speed $a_n$, then for every bounded continuous real function $h$,For a continuous function unbounded above, the same conclusion holds under the exponential tail extension of Varadhan's lemma, for example when the weighted contribution from $h>M$ is superexponentially negligible as $M\to \infty$.

The scalar clipping map $g(m)=\min (b,\max (a,m))$ is continuous. The rate function under scalar clipping has endpoint costs ${\inf }_{m\le a}J(m)$ and ${\inf }_{m\ge b}J(m)$. Since $a<\mu <b$ and the costs decrease towards $\mu$ from the left and increase to its right, both infima are attained at the corresponding endpoints. Thus the good rate function of $Z_n$ equals $J(z)$ on $[a,b]$ and is infinite outside. The function $\log z$ is bounded and continuous on that compact interval, soOn $[a,\mu ]$, the derivative of $\log z-I(z)$ is $2/z-\lambda >0$, so the maximum there is $\log \mu$. On $[\mu ,b]$, the derivative is $(k+1)/z-k\lambda$, with negative second derivative. Its unconstrained maximizer isIt lies in $[\mu ,b]$ whenever $k\ge (\lambda b-1{)}^{-1}$. The right-hand objective increases initially at $\mu$, so this maximizer dominates the whole left-hand interval. Substitution gives the limit for high moments of a clipped minimum of exponential sample meansThe moment here is the expectation of the $n$th power. If the printed notation were instead read as $(\mathbb{E}{Z}_n{)}^n$, its logarithmic limit would be $\log \mu =-\log \lambda$, since boundedness and convergence in probability give $\mathbb{E}{Z}_n\to \mu$.

A large deviation principle for random elements $X^L$ in a Hausdorff space $E$, at large-deviation speed $a_L\to \infty$, has a lower semicontinuous rate function $I:E\to [0,\infty ]$. For every open set $G$ and every closed set $F$,Equivalently, for every Borel set $A$, the lower and upper bounds use its interior and closure, respectively. The conventions are $\inf \varnothing =+\infty$ and $\log 0=-\infty$. A good rate function has compact sublevel sets $\{I\le r\}$ for every finite $r$. Here take $a_L=L$; the different speeds in the moderate deviation principle are stated explicitly when used.