TheoremBase

Relative Entropy on a Measurable Space: the Gibbs Inequality, the Variational Criterion and Formula, the Entropy Inequality, Small Sets and Data Processing

On any measurable space, relative entropy dominates the Donsker-Varadhan functional of every bounded measurable test function and equals its supremum; a uniform bound on that functional forces finite relative entropy. Consequences: the entropy inequality, a bound on the mass of small sets, and data processing under measurable maps.

Statement

In the settings of The Real Numbers: Standing Notation and Background and Measure Spaces and the Lebesgue Integral: Standing Notation, the measure space of the latter being instantiated at each use by the measure space named, let (S,S)(S,\mathcal{S}) be a measurable space and let ν\nu and γ\gamma be probability measures on it. Finite relative entropy with respect to γ\gamma and H(ν ∣ γ)H(\nu\,|\,\gamma) are those of that definition; exp⁡\exp is the exponential function and log⁡\log the natural logarithm. A function h:S→Rh:S\to\mathbb{R} is called bounded measurable if it is measurable with respect to S\mathcal{S} and bounded. For bounded measurable hh, claim 1 below makes hh integrable with respect to ν\nu and ∫Sexp⁡∘h dγ\int_{S}\exp\circ h\,d\gamma a positive real number, and we write

Λhγ(ν)=∫Sh dν−log⁡∫Sexp⁡∘h dγ.\Lambda^{\gamma}_{h}(\nu)=\int_{S}h\,d\nu-\log\int_{S}\exp\circ h\,d\gamma .

1. (The functional) Let h:S→Rh:S\to\mathbb{R} be bounded measurable. Then hh is integrable with respect to every probability measure on (S,S)(S,\mathcal{S}), the function exp⁡∘h\exp\circ h is bounded measurable, and ∫Sexp⁡∘h dγ\int_{S}\exp\circ h\,d\gamma is a positive real number.

2. (Gibbs inequality) If ν\nu has finite relative entropy with respect to γ\gamma, then Λhγ(ν)≤H(ν ∣ γ)\Lambda^{\gamma}_{h}(\nu)\le H(\nu\,|\,\gamma) for every bounded measurable h:S→Rh:S\to\mathbb{R}; in particular 0≤H(ν ∣ γ)0\le H(\nu\,|\,\gamma).

3. (Variational criterion) Let C∈RC\in\mathbb{R} be such that Λhγ(ν)≤C\Lambda^{\gamma}_{h}(\nu)\le C for every bounded measurable h:S→Rh:S\to\mathbb{R}. Then ν\nu has finite relative entropy with respect to γ\gamma, and H(ν ∣ γ)≤CH(\nu\,|\,\gamma)\le C.

4. (Variational formula) If ν\nu has finite relative entropy with respect to γ\gamma, then H(ν ∣ γ)H(\nu\,|\,\gamma) is the least upper bound of the set of real numbers Λhγ(ν)\Lambda^{\gamma}_{h}(\nu), h:S→Rh:S\to\mathbb{R} bounded measurable.

5. (Entropy inequality) Let ν\nu have finite relative entropy with respect to γ\gamma, let g:S→Rg:S\to\mathbb{R} be measurable with respect to S\mathcal{S} with 0≤g(s)0\le g(s) for every s∈Ss\in S, and let tt be a positive real number such that exp⁡∘(tg)\exp\circ(tg) is integrable with respect to γ\gamma. Then 1≤∫Sexp⁡∘(tg) dγ1\le\int_{S}\exp\circ(tg)\,d\gamma, the function gg is integrable with respect to ν\nu, and

∫Sg dν≤1t(H(ν ∣ γ)+log⁡∫Sexp⁡∘(tg) dγ).\int_{S}g\,d\nu\le\frac{1}{t}\Bigl(H(\nu\,|\,\gamma)+\log\int_{S}\exp\circ(tg)\,d\gamma\Bigr).

6. (Small sets) Let ν\nu have finite relative entropy with respect to γ\gamma and let A∈SA\in\mathcal{S}. If γ(A)=0\gamma(A)=0, then ν(A)=0\nu(A)=0. If γ(A)>0\gamma(A)>0, then

ν(A) log⁡(1+1γ(A))≤H(ν ∣ γ)+log⁡2.\nu(A)\,\log\Bigl(1+\frac{1}{\gamma(A)}\Bigr)\le H(\nu\,|\,\gamma)+\log2 .

7. (Data processing) Let (S′,S′)(S',\mathcal{S}') be a measurable space, let T:S→S′T:S\to S' be measurable with respect to S\mathcal{S} and S′\mathcal{S}', and let T#νT_{\#}\nu and T#γT_{\#}\gamma be the image measures B↦ν(T−1(B))B\mapsto\nu(T^{-1}(B)) and B↦γ(T−1(B))B\mapsto\gamma(T^{-1}(B)) of claim 1 of that lemma, probability measures on (S′,S′)(S',\mathcal{S}') by that claim. If ν\nu has finite relative entropy with respect to γ\gamma, then T#νT_{\#}\nu has finite relative entropy with respect to T#γT_{\#}\gamma, and H(T#ν ∣ T#γ)≤H(ν ∣ γ)H(T_{\#}\nu\,|\,T_{\#}\gamma)\le H(\nu\,|\,\gamma).

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…