Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The PAC-Bayes change-of-measure inequality

Statement

Let (Θ,A) be a measurable space, let π be a probability measure, and let ρ be a probability measure absolutely continuous with respect to π, meaning that π(A)=0 implies ρ(A)=0 for all A∈A. Define KL(ρ∥π):=sup⁡P∑A∈Pρ(A)log⁡ρ(A)π(A), where P ranges over finite measurable partitions of Θ, a zero-numerator term is 0, and a positive numerator over a zero denominator is +∞. For every bounded measurable f:Θ→R, Eθ∼ρf(θ)≤KL(ρ∥π)+log⁡Eθ∼πexp⁡(f(θ)), with the inequality interpreted as vacuous when KL(ρ∥π)=+∞.

Statement references

PAC-Bayes priors, posteriors, and relative entropy: a posterior is absolutely continuous with respect to the prior, and KL is the supremum over finite measurable partitions.

The natural logarithm as the inverse of the exponential function: log⁡ is the inverse of the real exponential on the positive reals.

Finite log-sum inequality with support and equality cases: for finite nonnegative vectors, the sum of coordinatewise relative-entropy terms is at least the corresponding aggregate term.

Alquier, User-friendly Introduction to PAC-Bayes Bounds, Chapter 2, Lemma 2.2: states the Donsker–Varadhan variational formula for bounded measurable functions.

Facts & Assumptions

Given: A measurable space (Θ,A), probability measures π,ρ with ρ≪π, and a bounded measurable f:Θ→R.

[F1]

KL(ρ∥π) is the supremum over finite measurable partitions P of ∑A∈Pρ(A)log⁡(ρ(A)/π(A)), with zero-numerator terms set to 0. PAC-Bayes priors, posteriors, and relative entropy

[F2]

If ai,bi≥0, A=∑iai, and B=∑ibi, then ∑ai>0ailog⁡(ai/bi)≥Alog⁡(A/B), with the stated support conventions. Finite log-sum inequality with support and equality cases

[F3]

The real exponential and natural logarithm are defined on the stated domains; the exponential is positive and increasing and satisfies exp⁡(u+v)=exp⁡(u)exp⁡(v), while the natural logarithm is increasing and satisfies log⁡(xy)=log⁡x+log⁡y for positive x,y. The real exponential function and the number e by a power series, The natural logarithm as the inverse of the exponential function, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x), The exponential function is strictly increasing, The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y), Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm

[F4]

On a probability space, expectation is the Lebesgue integral; a real measurable function is integrable when its absolute value has finite integral. The nonnegative integral is monotone and positively homogeneous, and for a nonnegative simple function s=∑jcj1Aj its integral is ∑jcjP(Aj). A constant c≥0 therefore has integral c when P(Θ)=1. Probability measures and probability spaces, Expectation of a nonnegative or integrable random variable, Integrable real and complex functions, and their integrals, The nonnegative Lebesgue integral, Nonnegative simple measurable functions, The integral of a nonnegative simple function, Monotonicity and nonnegative homogeneity of the nonnegative integral

[F5]

For integrable real functions, expectation is linear and ∣Eg∣≤E∣g∣. Linearity, monotonicity, and the modulus bound for expectation

[F6]

Measurable functions are defined by measurable preimages; composition with a Borel measurable map preserves measurability, and a continuous real map has Borel preimages of Borel sets. A measurable function between measurable spaces, A continuous map has Borel preimages of Borel sets, Composition with a Borel measurable outer map preserves measurability

Proof

Given: The hypotheses in the Statement.

1.1F3F4F6given

If g is bounded and measurable with ∣g∣≤C on either probability space, then E∣g∣≤∫C dP=C, so g is integrable. If g is finite-valued, writing its positive and negative parts on its finite level-set partition and applying the simple-integral formula in [F4] gives EPg=∑jgjP(Aj). Since f is measurable and exp⁡ is continuous by [F3], [F6] makes exp⁡∘f measurable; boundedness of f gives 0<exp⁡(−C)≤Eπexp⁡(f)≤exp⁡(C)<∞ for some C≥0. We may assume KL(ρ∥π)<∞, since otherwise the claim is immediate.

2.1F2F3step 1.1given

First let f be finite-valued, with values f1,…,fN on the finite measurable partition A1,…,AN. Put pj=π(Aj) and rj=ρ(Aj). Absolute continuity gives pj=0⇒rj=0. For aj=rj and bj=pjexp⁡(fj), the sums are 1 and Eπexp⁡(f) by step 1.1. Applying [F2] yields ∑rj>0rjlog⁡rjpjexp⁡(fj)≥−log⁡Eπexp⁡(f).

2.2F3F4F5F6step 1.1construct

For each integer n≥1, partition the bounded range of f into finitely many half-open intervals of width at most 1/n, including the final endpoint, and let fn equal each interval's left endpoint on its preimage. These preimages are measurable by [F6], and ∥fn−f∥∞≤1/n. By [F5] and step 1.1, ∣Eρfn−Eρf∣≤1/n. Monotonicity and homogeneity in [F4], together with [F3], give e−1/nEπef≤Eπefn≤e1/nEπef. The logarithms are defined by step 1.1 and [F3], and differ by at most 1/n.

3.1F1F2step 1.1step 2.1algebra

Expanding the logarithm and using step 1.1, the left side of step 2.1 equals ∑jrjlog⁡(rj/pj)−Eρf. The first term is the divergence of this partition, hence at most KL(ρ∥π) by [F1]. Rearrangement gives the claim for finite-valued f.

4.1step 3.1step 2.2algebra∎

Apply step 3.1 to each fn and let n→∞; the two expectation terms converge by the bounds in step 2.2, proving the stated inequality for bounded measurable f.

Depends on

Used by

Dependency tree · two levels

59 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources