Laplace Principle

Asymptotic evaluation of log-integrals of exp(n f) by the supremum of f; a deterministic precursor to Varadhan’s lemma.
Laplace Principle

This lemma is a deterministic prototype for and is closely related to the . It is frequently used to approximate partition functions and free energies via maximization.

Statement

Let KK be a compact topological space and let μ\mu be a finite Borel measure on KK such that every nonempty open set has positive μ\mu-measure. If f:KRf:K\to\mathbb{R} is continuous, then

limn1nlog ⁣Kenf(x)μ(dx)=maxxKf(x). \lim_{n\to\infty}\frac{1}{n}\log\!\int_K e^{n f(x)}\,\mu(dx) ={} \max_{x\in K} f(x).

More generally, if ff is upper semicontinuous and bounded above on compact KK, the same conclusion holds with max\max replaced by sup\sup.

Key hypotheses and conclusions

Hypotheses

  • Compactness of KK (ensures ff attains its maximum when ff is continuous).
  • μ\mu does not ignore neighborhoods of maximizers (positivity on open sets).
  • Regularity of ff (at least continuity for the simplest version).

Conclusions

  • Exponential integrals are governed at leading order by the global maximum of ff: the integral behaves like exp(nmaxf)\exp\big(n\max f\big) up to subexponential factors.
  • A discrete analogue: for finitely many numbers {ai}\{a_i\}, limn1nlogienai=maxiai\lim_{n\to\infty}\frac1n\log\sum_i e^{n a_i}=\max_i a_i.

Proof idea / significance

Let M=maxKfM=\max_K f. For the upper bound, KenfdμenMμ(K)\int_K e^{n f}\,d\mu\le e^{nM}\mu(K) gives lim supM\limsup \le M. For the lower bound, choose xKx_\star\in K with f(x)=Mf(x_\star)=M and a neighborhood UU where fMεf\ge M-\varepsilon. Then KenfdμUenfdμμ(U)en(Mε)\int_K e^{n f}\,d\mu\ge \int_U e^{n f}\,d\mu\ge \mu(U)\,e^{n(M-\varepsilon)}, so lim infMε\liminf \ge M-\varepsilon and let ε0\varepsilon\downarrow 0.

In statistical mechanics, this principle explains why a partition function (an integral or sum of exponentials) yields a free energy that can often be expressed as a variational supremum. It is the leading-order version of the more refined , which also provides prefactors.