= Solution
Write $a_n=n^{2(1-H)}$ and $b_n=n^{2(1-G)}$. Then $a_n/b_n=n^{2(G-H)}\to\infty$. The <large deviation principle> on the whole space forces $\inf I=0$; compact <sublevel sets> and <lower semicontinuity> make that <infimum> attained. The unique possible zero is therefore mu, and $I(\mu)=0$.
If a <closed set> C contains mu, its new <infimum> rate is zero and the claimed upper bound follows from probabilities being at most one. If it excludes mu, then $\eta=\inf_CI>0$, possibly infinite: otherwise a sequence of rates tending to zero would have a <convergent subsequence> in a compact <sublevel set>, with limit in C and zero rate, contradicting uniqueness. This is the fact that <a good rate function is separated from zero away from its minimizer>.
Choose any $0<c<\eta$. The original upper bound gives $\log\mathbb P(X_n\in C)\leq-ca_n$ for all sufficiently large n. Thus
$$
\limsup_n b_n^{-1}\log\mathbb P(X_n\in C)\leq\lim_n-c\frac{a_n}{b_n}=-\infty=-\inf_CI'.
$$
Together these cases prove the \b[closed-set upper bound at the slower speed], with rate zero only at mu. Its finite sublevels are the compact singleton $\{\mu\}$, so it is a <good rate function>.
Back to article page