Alphabeta Math
TheoremStatement: 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 generalized Bayes loss update uniquely minimizes loss plus KL

Statement

Assume the Axiom of Choice (The Axiom of Choice) used by the Kullback–Leibler definition. Let (Θ,T) be the standard Borel parameter space of Generalized Bayes loss update and temperature, let π be a probability prior, let x be fixed, let w>0, and let ℓx:Θ→R be measurable. Suppose 0<Z:=∫Θe−wℓx(θ) π(dθ)<∞ and the update q:=Gw,π,x has finite absolute loss expectation ∫Θ∣ℓx∣ dq<∞.

Let V be the probabilities ν on (Θ,T) such that ν≪π, D(ν∥π)<∞, and ∫Θ∣ℓx∣ dν<∞. Define Jw(ν):=w Eν[ℓx]+D(ν∥π), where expectation is integration under the law ν (Change of variables for expectation). Then q∈V and Jw(ν)−Jw(q)=D(ν∥q)≥0(ν∈V), with equality if and only if ν=q. Thus q is the unique minimizer of loss plus KL over V.

Facts & Assumptions

Given: AC; a probability prior π on the stated parameter space; a fixed measurable real loss section ℓx; w>0; 0<Z<∞; and ∫∣ℓx∣ dq<∞.

[F1]

Generalized Bayes loss update and temperature: when 0<Z<∞, the update has density g=e−wℓx/Z relative to π.

[F2]

A finite-normalizer loss update is a probability measure: the update q=Gw,π,x is a probability measure.

[F3]

The Radon-Nikodym derivative as an almost-everywhere equivalence class: under AC, a Radon–Nikodym derivative is an almost-everywhere class of measurable functions satisfying the setwise integral formula.

[F4]

Kullback–Leibler divergence: for probability measures P≪Q, the definition gives D(P∥Q)=∫log⁡(dP/dQ) dP=∫rlog⁡r dQ for a Radon–Nikodym density r=dP/dQ, with 0log⁡0:=0 and finite negative part. AC is used to supply the derivative representative.

[F5]

Absolute continuity of a signed or complex measure with respect to a positive measure: P≪Q means every measurable Q-null set is P-null.

[F6]

Radon-Nikodym derivatives satisfy the chain rule along nu << mu << lambda: under AC, if ν≪q≪π are sigma-finite positive measures with a common finite exhaustion, then dν/dπ=(dν/dq)(dq/dπ) π-almost everywhere.

[F7]
[F8]

Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and homogeneous under positive scalars.

[F9]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: for positive a,b, log⁡(ab)=log⁡a+log⁡b and log⁡(a/b)=log⁡a−log⁡b; the logarithm is the inverse of the exponential (The natural logarithm as the inverse of the exponential function).

[F10]

The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: log⁡ is differentiable on (0,∞) with derivative 1/t.

[F12]

Change of variables for expectation: for a random element X with law ν, E[g(X)]=∫g dν when g(X) is integrable.

[F13]

A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere: a nonnegative measurable function has integral zero exactly when it vanishes almost everywhere.

[F14]

Probability measures and probability spaces: a probability measure is a measure of total mass one.

[F15]

Measures on sigma-algebras: a measure is countably additive on pairwise disjoint measurable sequences.

[A1]

The Axiom of Choice: AC states that every family of nonempty sets has a choice function. It is used here only through the KL/Radon–Nikodym interfaces in [F3], [F4], and [F6].

Proof

1.1F1F2F7given

Let g(θ)=e−wℓx(θ)/Z. By [F1]–[F2], q is the probability measure with density g relative to π. Since ℓx is real-valued, [F7] gives g>0 everywhere.

1.2F10F11algebra

For t>0, put u(t)=log⁡t−1+t−1. By [F10], u′(t)=(t−1)/t2. If 0<t<1, the mean value theorem on [t,1] gives u(t)>u(1)=0; if t>1, it on [1,t] gives u(t)>u(1)=0. Thus log⁡t≥1−t−1. Multiplying by t>0 gives tlog⁡t≥t−1, with equality only at t=1. At t=0 the inequality also holds under 0log⁡0:=0.

2.1F1F4F9A1F2step 1.1givenalgebra

The update is admissible: q≪π by [F1], and [F4], [F9] give D(q∥π)=∫log⁡g dq=−w∫ℓx dq−log⁡Z, which is finite by the loss-integrability hypothesis and 0<Z<∞. Thus q∈V.

2.2F8F1F15F5step 1.1given

Fix ν∈V. If q(A)=0, then for every integer m≥1, [F8] and [F1] give 0≤m−1π(A∩{g≥m−1})≤∫Ag dπ=q(A)=0. Let A1=A∩{g≥1} and, for m≥2, let Am=(A∩{g≥m−1})∖(A∩{g≥(m−1)−1}). These sets are disjoint, each is π-null by the displayed bound, and their union is A because g>0 everywhere. Countable additivity [F15] therefore gives π(A)=0. Hence π≪q, and ν≪q follows from ν≪π and [F5].

3.1A1F6F1F2F3step 2.2given

The measures ν,q,π are finite probabilities. The constant exhaustion Xm=Θ is therefore a common finite exhaustion, so [A1] and [F6] apply to ν≪q≪π. With r=dν/dπ and h=dν/dq, the chain rule gives r=hg π-almost everywhere.

4.1F3F4step 3.1F9A1givenalgebra

The Radon–Nikodym formula [F3] gives ν({r=0})=∫{r=0}r dπ=0 and likewise ν({h=0})=0, so r,h>0 ν-almost everywhere. Since D(ν∥π)<∞ and the negative part of the log-density integral is finite by [F4], log⁡r is ν-integrable; log⁡g is ν-integrable by ∫∣ℓx∣ dν<∞. Using r=hg from step 3.1, [F9], and log⁡g=−wℓx−log⁡Z, we obtain D(ν∥q)=∫log⁡h dν=D(ν∥π)+w∫ℓx dν+log⁡Z. The right-hand side is finite, so D(ν∥q)<∞.

5.1F4step 4.1A1

For h=dν/dq, the density form of [F4] gives D(ν∥q)=∫log⁡h dν=∫hlog⁡h dq, with 0log⁡0:=0. The integral is finite by step 4.1.

6.1step 1.2step 5.1F13F3F4F9A1F14algebra

Apply step 1.2 to h and integrate under q. Since ∫h dq=ν(Θ)=1 and q(Θ)=1, step 5.1 yields D(ν∥q)=∫hlog⁡h dq≥∫(h−1) dq=0. If equality holds, the nonnegative function hlog⁡h−h+1 has integral zero, so [F13] makes it zero q-almost everywhere. Step 1.2 then gives h=1 q-almost everywhere, and the Radon–Nikodym formula [F3] implies ν=q. Conversely, if ν=q, its Radon–Nikodym density relative to itself is h=1 q-almost everywhere, so [F4] and [F9] give D(q∥q)=∫1log⁡1 dq=0. Thus equality holds exactly when ν=q.

7.1step 4.1F12step 2.1step 6.1algebra∎

By step 4.1 and [F12], Jw(ν)=D(ν∥q)−log⁡Z≥−log⁡Z. Step 2.1 gives Jw(q)=−log⁡Z, and step 6.1 shows equality is possible only for ν=q. Therefore q is the unique minimizer and Jw(ν)−Jw(q)=D(ν∥q).

Depends on

Used by

Dependency tree · two levels

73 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