Alphabeta Math
Pipeline-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.

Generalized Bayes loss updates and temperature

1 · Prerequisites

2 · Summary

For a fixed observation, a measurable real loss, a probability prior and a positive temperature, the generalized Bayes update is the prior reweighted by e−wℓ when its normalizer is finite and positive. The page proves normalization, the KL variational identity and uniqueness over the explicitly specified finite-objective class, and finite-sequence coherence at one fixed temperature. It does not identify a loss with a likelihood or assert a sampling-model posterior without the additional model and dominated-formula hypotheses. Temperature calibration methods are recorded with their extra inputs and limits; a target chosen through an M-loss alone supplies neither a robust-risk theorem nor a coverage guarantee.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Generalized Bayes loss update and temperature

Definition

Let (Θ,T) be a standard Borel parameter space (Standard Borel spaces). Let X be a set of possible observations, and let ℓ:Θ×X→R be a loss whose section ℓx(θ):=ℓ(θ,x) is T-measurable for every x∈X. A prior is a probability measure π on (Θ,T) (Probability measures and probability spaces). A temperature is a fixed scalar w>0 that multiplies the observed loss.

For x∈X, define the normalizer Zw(π,x):=∫Θexp⁡{−wℓx(θ)} π(dθ). The integrand is measurable by continuity of the exponential and composition of measurable maps (The exponential function is strictly increasing, Composition with a Borel measurable outer map preserves measurability). When 0<Zw(π,x)<∞, the generalized Bayes loss update (or Gibbs loss update) is the set function Gw,π,x(A):=1Zw(π,x)∫Aexp⁡{−wℓx(θ)} π(dθ),A∈T. It is a positive scalar multiple of the measure with density exp⁡{−wℓx} relative to π (The measure with density f relative to μ). If the normalizer is zero or infinite, this definition supplies no update.

Remarks

  • This is a fixed-observation update from a supplied probability prior. It does not specify a sampling model or claim that the loss is a likelihood.
  • The standard Borel assumption is the scope adopted by the BCS-19 design; the fixed-fiber normalization formula itself uses only the stated measurable space and probability prior.
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A finite-normalizer loss update is a probability measure

Statement

Let Gw,π,x be the update of Generalized Bayes loss update and temperature, with prior probability π and normalizer 0<Zw(π,x)<∞. Then Gw,π,x is a probability measure on (Θ,T).

Facts & Assumptions

Given: A prior probability π, a fixed observation x, a temperature w>0, and 0<Zw(π,x)<∞.

[F1]

Generalized Bayes loss update and temperature: for each measurable A⊆Θ, Gw,π,x(A)=Zw(π,x)−1∫Ae−wℓx(θ) π(dθ).

[F2]

The measure with density f relative to μ: if f≥0 is measurable, then A↦∫Af dπ is a measure.

[F3]

Nonnegative scalar multiples and countable weighted sums of measures are measures: a nonnegative scalar multiple of a measure is a measure.

[F4]

Integrating against a density agrees with integrating the product: for f,g≥0 measurable, ∫g d(f dπ)=∫gf dπ.

[F5]

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

Proof

1.1F1F2given

Put f(θ)=e−wℓx(θ) and μ(A)=∫Af dπ. By [F1]–[F2], μ is the measure with density f relative to π.

2.1F1F3F4step 1.1given

Since Zw(π,x)>0, [F1] gives Gw,π,x=Zw(π,x)−1μ, which is a measure by [F3]. Also [F4] gives μ(Θ)=∫Θ1 d(f dπ)=∫Θf dπ=Zw(π,x), so Gw,π,x(Θ)=1.

3.1F5step 2.1∎

By [F5], the measure in step 2.1 with total mass one is a probability measure.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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).

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Fixed-temperature generalized Bayes updates are sequentially coherent

Statement

Let π0 be a probability prior on the parameter space of Generalized Bayes loss update and temperature, let w>0 be fixed, and let x1,…,xn be any finite sequence of observations with measurable real loss sections ℓi(θ):=ℓ(θ,xi). Set πi:=Gw,πi−1,xi recursively, and assume each sequential normalizer zi:=∫e−wℓi(θ) πi−1(dθ) is finite and positive. Then, for every measurable A, πn(A)=∫Ae−w∑i=1nℓi(θ) π0(dθ)∫e−w∑i=1nℓi(θ) π0(dθ),∫e−w∑i=1nℓi(θ) π0(dθ)=∏i=1nzi. For n=0, the empty sum is zero, the empty product is one, and πn=π0. Thus sequential updating at a fixed temperature agrees with one update using the sum of the observed losses. No independence or sampling-model assumption is asserted.

Facts & Assumptions

Given: A probability prior π0, a fixed temperature w>0, measurable real loss sections ℓ1,…,ℓn, and finite-positive sequential normalizers zi.

[F1]

Generalized Bayes loss update and temperature: when a prior, observation, temperature, and finite-positive normalizer are supplied, Gw,π,x(A)=Zw(π,x)−1∫Ae−wℓx dπ.

[F2]

A finite-normalizer loss update is a probability measure: each such update is a probability measure.

[F3]

Integrating against a density agrees with integrating the product: for nonnegative measurable f,g, ∫g d(f dπ)=∫gf dπ.

[F4]

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

[F5]

The measure with density f relative to μ: f dπ is the measure A↦∫Af dπ for a nonnegative measurable f.

[F6]

The principle of mathematical induction: if a property holds at a natural number and each case implies the next, it holds for every later natural number.

[F7]

Arithmetic and lattice operations preserve measurability whenever they are defined: sums and real scalar multiples of measurable real functions are measurable.

[F9]

The real exponential function and the number e by a power series: the power series definition gives e0=1.

Proof

1.1F9F4givenalgebra

For n=0, the cumulative loss is the empty sum zero. In the power series definition [F9] at zero, the zeroth term is 1 and every positive-degree term vanishes, so its exponential weight is 1. By [F4], ∫1 dπ0=π0(Θ)=1. Thus the empty normalizer is the empty product one and the displayed formula is π0(A)=π0(A).

1.2F1F2givenbase

For n=1, the claim is exactly the update definition [F1], with z1=∫e−wℓ1 dπ0. This normalizer is finite positive by hypothesis, so the update is a probability by [F2].

1.3F7F1F8F3F5givenih

For n≥2, suppose the formula holds at n−1, with cumulative normalizer cn−1=∏i=1n−1zi and density fn−1(θ)=e−w∑i=1n−1ℓi(θ) relative to π0. The finite cumulative loss is measurable by repeated use of [F7], so [F1] gives measurability of fn−1 and of e−wℓn. Algebra and [F8] factor the cumulative exponential into fn−1e−wℓn. Then [F3] gives zn=∫e−wℓn dπn−1=cn−1−1∫e−w∑i=1nℓi dπ0. Thus the cumulative normalizer is cn=cn−1zn=∏i=1nzi, which is finite and positive.

2.1F1F3F8F7step 1.3algebra

By [F1], [F3], and the same factorization [F8], for every measurable A, πn(A)=zn−1∫Ae−wℓn dπn−1=cn−1∫Ae−w∑i=1nℓi dπ0. This proves the induction step.

3.1step 1.2step 1.3step 2.1F6step 1.1F4F2discharge-induction: step 2.1∎

Define Q(m) to be the claimed formula at n=m+1. Step 1.2 proves Q(0). For any m∈N, set n=m+2≥2; steps 1.3–2.1 prove that the formula at n−1=m+1 implies it at n=m+2, hence Q(m) implies Q(m+1). Therefore [F6] gives the formula for every n≥1; step 1.1 covers n=0. The initial π0 is a probability by [F4], and every later πi is a probability by [F2]. The proof uses only fixed-temperature updates and the stated normalizers.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Calibrating generalized Bayes temperature

Remarks

In the objective of The generalized Bayes loss update uniquely minimizes loss plus KL, w scales the data-loss term relative to the KL penalty. Replacing ℓx by cℓx for c>0 has the same algebraic effect as replacing w by cw; the numerical temperature therefore depends on the loss units.

Bissiri, Holmes, and Walker (2016, §§3.1–3.4) describe several model- or elicitation-specific ways to choose w: cross-validation and subjective selection; matching expected loss-to-data and loss-to-prior using a specified joint reference law (with an empirical alternative); putting a hierarchical loss prior on w; and matching posterior probability of a loss-based confidence interval to its nominal level or eliciting a posterior-to-prior odds change at reference points. These are calibration proposals with additional inputs, not consequences of the update formula.

An M-loss can be chosen because its risk minimizer is the target of interest. That target choice alone proves neither contamination robustness nor frequentist coverage. The finite counterexample on the companion page shows why a positive temperature cannot supply a general coverage guarantee.

5 · Examples, counterexamples and false statements

None yet.

Sources