In probability theory, Hoeffding's lemma is an inequality that bounds the moment-generating function of any bounded random variable, implying that such variables are subgaussian. It is named after the Finnish–American mathematical statistician Wassily Hoeffding. The proof of Hoeffding's lemma uses Taylor's theorem and Jensen's inequality. Hoeffding's lemma is itself used in the proof of Hoeffding's inequality as well as the generalization McDiarmid's inequality.

Statement of the lemma

Let X be any real-valued random variable such that almost surely, i.e. with probability one. Then, for all , or equivalently,

Proof

The following proof is direct but somewhat ad-hoc. Another proof uses exponential tilting; proofs with a slightly worse constant are also available using symmetrization. Without loss of generality, by replacing X by, we can assume , so that. Since is a convex function of x, we have that for all x \in [a,b], So, where. By computing derivatives, we find From the AMGM inequality we thus see that for all h, and thus, from Taylor's theorem, there is some such that Thus,.