Entropy method for certifiable functions Created 2026-09-24 Updated 2026-10-14
The entropy method combines a coordinatewise certificate with tensorization of entropy to bound the moment-generating function of a certifiable random quantity and hence its tails.
Let be independent random variables, let , and let each depend on every coordinate except . The modified logarithmic Sobolev inequality states that, for every real for which the expectations exist,
To prove it, first apply tensorization of entropy:
Condition on all coordinates except and use the stated variational formula with the admissible constant . The th conditional entropy is at most
Summing and taking the remaining expectations proves the inequality.
Define the tilted probability measure by ; this is normalized because . Then
Let average only coordinate , keeping fixed. The marginal density of relative to is , and hence
Moreover,
Substituting Han's inequality for relative entropy and rearranging gives the tensorization of entropy
Let be independent variables and . Apply the tensorization of entropy to and then apply the stated Bernoulli log-Sobolev inequality in each coordinate. If , this gives
For each fixed , converges in distribution to , where . The Poisson limit theorem in fact gives convergence in total variation. The assumptions and make all displayed integrands bounded, so expectations and entropy pass to the limit. Since ,
Let . The self-bounding function assumptions say and . Apply tensorization of entropy to and the one-coordinate entropy inequality. Since is convex and for , the resulting bound is
Writing and dividing by the moment-generating function reduces this to
Both sides have finite limits at zero and . Integrating from zero to , with the direction interpreted correctly when , yields
which is the required inequality.