Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Variational and finite-partition formulas for measurable-space KL

Statement

Let P,Q be probability measures on one measurable space. For bounded measurable real f, put ΦP,Q(f):=∫f dP−ln⁡∫ef dQ. Then D(P∥Q)=sup⁡f bounded measurableΦP,Q(f). Equivalently, for every finite measurable partition P=(A1,…,Am) of the whole space, D(P∥Q)=sup⁡P∑i=1mP(Ai)ln⁡P(Ai)Q(Ai), where 0ln⁡(0/q)=0 and a term with P(Ai)>0=Q(Ai) is +∞. The result includes singular and infinite-divergence cases.

Facts & Assumptions

Given: AC and probability measures P,Q on a common measurable space.

[A1]

AC is the hypothesis used by the Radon–Nikodym definition of measurable-space KL. The Axiom of Choice

[F1]

If P≪̸Q, then D(P∥Q)=+∞; if P≪Q with density r, then D(P∥Q)=∫log⁡r dP, whose negative part is finite. Kullback–Leibler divergence

[F2]

KL divergence between probability measures is nonnegative. Kullback–Leibler divergence is nonnegative

[F3]

On a finite alphabet, measurable-space KL equals the finite sum with the same support conventions. Finite KL divergence agrees with measurable-space KL

[F4]

Dominated convergence and monotone convergence apply to the stated finite or nonnegative integrals. Dominated convergence Monotone convergence for the integral

Proof

Given: AC and probability measures P,Q.

1.1A1F1F2givenalgebra

First suppose P≪Q and D(P∥Q)<∞. For bounded measurable f, let Zf=∫ef dQ and define Qf by dQf=efZf−1dQ. Then Qf is a probability equivalent to Q, and dP/dQf=(dP/dQ)Zfe−f. Taking logarithms and integrating under P gives D(P∥Qf)=D(P∥Q)−ΦP,Q(f). By [F2], ΦP,Q(f)≤D(P∥Q). If D(P∥Q)=+∞ or P≪̸Q, this upper bound is automatic.

1.2F1givenchoose

If P≪̸Q, choose a measurable A with Q(A)=0<P(A). For ft=t1A, ∫eftdQ=1 and ΦP,Q(ft)=tP(A)→+∞. Thus the bounded-function supremum is +∞=D(P∥Q) in the singular case.

2.1F1F4step 1.1

Suppose P≪Q, let r=dP/dQ, and set ℓ=log⁡r on {r>0}, with ℓ=−∞ on {r=0}; the latter set is P-null. Define fn=max⁡(−n,min⁡(n,ℓ)), taking fn=−n on {r=0}. The negative part of ℓ is integrable by [F1]; its clipped negative parts converge by [F4], while the clipped positive parts increase to ℓ+ and converge in integral by [F4]. Hence ∫fn dP→D(P∥Q), including value +∞. Pointwise, efn→r Q-a.e. and 0≤efn≤r+1, so [F4] gives ∫efndQ→∫r dQ=1. Therefore ΦP,Q(fn)→D(P∥Q) and the bounded-function supremum is at least the divergence.

2.2F2F3step 1.1algebra

Fix a finite measurable partition (Ai)i=1m and put pi=P(Ai), qi=Q(Ai). For constants ci, the simple function f=∑ici1Ai has Φ(f)=∑ipici−ln⁡∑iqieci. If some pi>0=qi, this expression is unbounded above by taking ci→+∞. Otherwise its supremum over the ci is ∑i:pi>0piln⁡(pi/qi): the upper bound follows by applying [F2] to the finite probability vector with masses proportional to qieci, and the lower bound follows by taking ci=ln⁡(pi/qi) when pi>0 and ci→−∞ on cells with pi=0<qi. The cases pi=qi=0 do not affect either sum.

3.1F3step 2.1step 2.2algebra∎

Every bounded measurable f is uniformly approximated by finite-valued measurable simple functions. If ∥f−g∥∞≤ε, then ∣∫f dP−∫g dP∣≤ε and e−ε∫egdQ≤∫efdQ≤eε∫egdQ, so ∣Φ(f)−Φ(g)∣≤2ε. Thus the supremum over bounded functions equals the supremum over simple functions. Step 2.2 identifies the latter with the supremum over finite partitions; step 2.1 identifies it with D(P∥Q). No step subtracts infinite quantities.

Depends on

Used by

Dependency tree · two levels

65 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