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.

Hellinger geometry and posterior consistency

1 · Prerequisites

2 · Summary

Objective

This page defines root-L2 Hellinger distance for laws with supplied densities against a common sigma-finite measure and proves its invariance under a change of common dominating measure. It translates the comparison to the library's event-supremum total variation convention, which has no half-factor.

For well-specified dominated IID Bayesian models, the posterior consistency theorem separates prior KL support from testability of every metric-separated complement. Its proof establishes a denominator lower bound and amplifies summable tests before controlling the tested posterior numerator. Joint measurability of the likelihood density is stated explicitly. The root-L2 comparison also shows that KL support supplies positive prior mass to every Hellinger ball. The companion counterexample shows that an injective model map and KL support do not replace uniform testability.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Root-L2 Hellinger distance for dominated laws

Definition

Let (X,A) be a measurable space and let P,Q be probability measures (Probability measures and probability spaces) on it, both dominated by a specified common sigma-finite positive measure μ as in Dominated statistical experiments. For supplied finite-valued nonnegative measurable density representatives p=dP/dμ and q=dQ/dμ in the convention of Likelihood densities, the root-L2 Hellinger distance is

h(P,Q):=(∫(p−q)2 dμ)1/2.

The square roots are measurable: for every real r, {p>r} is the whole space if r<0 and equals {p>r2} if r≥0, and the same holds for q (Threshold characterisations of real-valued and extended-real-valued measurability). The arithmetic and lattice rules make the nonnegative integrand measurable (Arithmetic and lattice operations preserve measurability whenever they are defined). It is integrable because (p−q)2≤p+q and the integral is additive on nonnegative functions (Additivity of the nonnegative Lebesgue integral), so its integral is at most P(X)+Q(X)=2.

The generic density-selection convention Likelihood densities assumes the Axiom of Choice The Axiom of Choice. When p and q are explicitly given, this displayed integral requires no further choice.

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

Hellinger invariance and comparison with library total variation

Statement

Assume AC for the imported density-representative convention. Let P,Q be probability laws on a measurable space, both dominated by one specified common sigma-finite positive measure. Then the root-L2 Hellinger distance from Root-L2 Hellinger distance for dominated laws is independent of the choice of common dominating measure. With the library convention ∥P−Q∥TV:=sup⁡A∣P(A)−Q(A)∣ from Total variation distance for probability laws,

∥P−Q∥TV≤h(P,Q),h(P,Q)2≤2∥P−Q∥TV.

Facts & Assumptions

Given: Probability laws P,Q with a specified common sigma-finite dominating measure. The conclusions are the common-measure invariance and both displayed inequalities.

[A1]

Assume the Axiom of Choice for the general density-selection convention in Likelihood densities. After finite-valued density representatives are supplied, the calculations use no further choice. The Axiom of Choice

[F1]

For finite-valued nonnegative density representatives p,q against a common measure μ, h(P,Q)2=∫(p−q)2 dμ. Root-L2 Hellinger distance for dominated laws

[F2]

The library total-variation distance is sup⁡A∣P(A)−Q(A)∣, with no factor 1/2 in the event supremum. Total variation distance for probability laws

[F3]

A common dominating measure is sigma-finite and satisfies P,Q≪μ. Dominated statistical experiments

[F4]

Under AC, a law dominated by the specified sigma-finite measure has a finite-valued nonnegative measurable density representative. Likelihood densities

[F5]

For square-integrable real functions f,g, ∫∣fg∣ dμ≤∥f∥2∥g∥2. Holder's inequality for integrals, including the endpoint cases

[F6]

A finite measure is sigma-finite, and a sigma-finite measure has a countable finite-measure exhaustion. Finite, sigma-finite, and semifinite measures

[F7]

Sums, products, scalar multiples, and lattice operations of finite real-valued measurable functions are measurable. Arithmetic and lattice operations preserve measurability whenever they are defined

[F8]

A set defined by a real threshold of a measurable real-valued function is measurable. Threshold characterisations of real-valued and extended-real-valued measurability

[F9]

For nonnegative measurable f,g, the density measure satisfies ∫g d(f dμ)=∫gf dμ. Integrating against a density agrees with integrating the product

Proof

Given: The hypotheses in the Statement.

1.1A1F3F4F6F7F10given

By [A1], [F3], and [F4], take finite-valued nonnegative densities p=dP/dμ and q=dQ/dμ for a common sigma-finite dominator μ. Define ρ(A):=P(A)+Q(A). For disjoint measurable Ak, countable additivity of P,Q and regrouping nonnegative series give ρ(⋃kAk)=∑kρ(Ak); also ρ(∅)=0 and ρ(X)=2. Thus ρ is a finite, hence sigma-finite, measure by [F6]. Additivity of the nonnegative integral [F10] gives ρ(A)=∫A(p+q) dμ, with p+q measurable by [F7].

1.2F2F3F4F7F8F10algebra

Using p,q against μ, the set B:={p≥q} is measurable by [F7,F8]. On B, p=(p−q)+q, so additivity [F10] gives δ:=P(B)−Q(B)=∫B(p−q) dμ≥0. On Bc, q=(q−p)+p and the total masses are one, hence ∫Bc(q−p) dμ=Q(Bc)−P(Bc)=δ. Additivity then gives ∫∣p−q∣ dμ=2δ. For any measurable A, the difference on A∩B lies in [0,δ] by monotonicity [F10], while the difference on A∩Bc lies in [−δ,0]; thus ∣P(A)−Q(A)∣≤δ, and A=B attains δ. Therefore [F2] gives ∥P−Q∥TV=δ=12∫∣p−q∣ dμ.

2.1F7F8F9step 1.1algebra

On {p+q>0} define pˉ=p/(p+q) and qˉ=q/(p+q), and set both to zero on {p+q=0}. For r<0, {pˉ>r} is the whole space; for r≥0, it is {p+q>0}∩{p−r(p+q)>0}. Thus [F7,F8] make pˉ measurable, and the same argument applies to qˉ. Since p=q=0 where p+q=0, [F9] gives ∫Apˉ dρ=∫Apˉ(p+q) dμ=P(A) and ∫Aqˉ dρ=Q(A) for every measurable A. Hence pˉ,qˉ are finite-valued density representatives of P,Q against ρ.

2.2F1F5F10step 1.2algebra

Pointwise ∣p−q∣=∣p−q∣(p+q). Hölder [F5] therefore gives ∫∣p−q∣ dμ≤h(P,Q)(∫(p+q)2 dμ)1/2. The squared second factor is 2+2∫pq dμ≤4, since [F5] applied to p,q bounds their product integral by 1. Step 1.2 now gives ∥P−Q∥TV≤h(P,Q).

3.1F1F7F8F9F10step 1.1step 2.1algebra

Write Hλ(P,Q)2 for the defining Hellinger integral computed from supplied densities against a common dominator λ. Applying [F1] and [F9] to the densities in step 2.1 gives Hρ(P,Q)2=∫(pˉ−qˉ)2 dρ=∫{p+q>0}(p−q)2 dμ=Hμ(P,Q)2, because both original densities vanish where p+q=0. For any measure α and finite-valued nonnegative densities f,g of the same finite measure Λ with respect to α, they agree α-almost everywhere: on Em:={f≥g+1/m}, equality of their density integrals gives 0=∫Em(f−g) dα≥α(Em)/m, so α(Em)=0. Since {f>g}=⋃m≥1Em, and the same argument with f,g swapped handles {g>f}, this proves uniqueness almost everywhere. Thus changing supplied representatives against a fixed dominator does not change the Hellinger integral.

4.1step 1.1step 2.1step 3.1F1F3F4

For any other common sigma-finite dominator ν, repeat steps 1.1 and 2.1 using its densities to obtain density representatives pˉν,qˉν against the same finite measure ρ=P+Q. The uniqueness argument in step 3.1 gives pˉν=pˉ and qˉν=qˉ ρ-almost everywhere. The same density-change calculation as in step 3.1 therefore identifies the Hellinger integral against ν with the same canonical value against ρ, and hence with that against μ.

5.1F1F10step 1.2algebra∎

Pointwise (p−q)2≤∣p−q∣. Integrating by monotonicity [F10] and using [F1] and step 1.2 gives h(P,Q)2≤∫∣p−q∣ dμ=2∥P−Q∥TV.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Posterior consistency from KL support and uniformly summable tests

Statement

Assume AC for the imported general Kullback–Leibler divergence and likelihood-density conventions. Let (Θ,T) be a measurable parameter space with a proper prior probability Π. Let (X,A,μ) be an observation space with sigma-finite positive measure μ. Suppose θ↦Pθ is a parameter-measurable probability kernel, every Pθ is dominated by μ, and the truth is well-specified: P0=Pθ0 for some θ0∈Θ. Assume a specified nonnegative function p:Θ×X→[0,∞) is jointly measurable and, for every θ∈Θ and A∈A, Pθ(A)=∫Ap(θ,x) μ(dx) with ∫p(θ,x) μ(dx)=1. Write p0(x)=p(θ0,x).

Assume KL support at P0: for every ϵ>0 there is a measurable Bϵ⊆{θ:D(P0∥Pθ)<ϵ} with Π(Bϵ)>0. Let d be a metric on the model laws and require Vη:={θ:d(Pθ,P0)>η} to be measurable for each η>0. For each η with Vη≠∅, suppose there are measurable tests ϕn:Xn→[0,1] such that

∑n=1∞P0nϕn<∞,∑n=1∞sup⁡θ∈VηPθn(1−ϕn)<∞.

For each A∈T, define the posterior by

Πn(A∣x1:n)=∫A∏i=1np(θ,xi) Π(dθ)∫Θ∏i=1np(θ,xi) Π(dθ)

on fibres with finite positive denominator, and use Π as the fixed probability filler otherwise. Then, for any IID sequence with common law P0, Πn(Vη∣X1:n)→0 almost surely for every fixed η>0.

For the root-L2 Hellinger distance of Root-L2 Hellinger distance for dominated laws, every Hellinger ball about P0 is measurable as a parameter set and has positive prior mass. Moreover, h(P0,Pθ)4≤2D(P0∥Pθ) under the library event-supremum total-variation convention; thus D(P0∥Pθ)<η4/2 implies h(P0,Pθ)<η.

Facts & Assumptions

Given: A proper prior probability, a parameter-measurable dominated sampling kernel, its specified jointly measurable normalized density, the well-specified truth, KL support, measurable metric complements, and tests with the two stated summable error series.

[A1]

Assume AC for the imported KL/Radon–Nikodym and Pinsker conventions. The density p in the Statement is supplied as part of the model data, so the local proof does not select a density representative. The Axiom of Choice

[F1]

A probability measure has total mass one, and a parameter-measurable model is a probability kernel whose event-probability sections are measurable. Probability measures and probability spaces, Parameter-measurable statistical models as kernels

[F2]

Measurability is defined by measurable preimages, and sections of a product-measurable function are measurable. A measurable function between measurable spaces, Every section of a product-measurable function is measurable

[F3]

A dominated experiment has a specified sigma-finite measure μ with Pθ≪μ for every parameter; this alone supplies neither a parameter sigma-algebra nor joint measurability. Dominated statistical experiments

[F4]

Under AC, separate likelihood densities can be selected as finite-valued nonnegative representatives, but their separate existence does not assert joint measurability. Likelihood densities

[F5]

KL is directional: if P≪̸Q then D(P∥Q)=+∞; when P≪Q, it is the P-integral of the log Radon–Nikodym derivative, with finite negative part. Kullback–Leibler divergence

[F6]

For a nonnegative product-measurable function on sigma-finite factors, Tonelli makes section integrals measurable and equates product and iterated integrals. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F7]

With a proper prior, a probability sampling kernel, a sigma-finite data measure and one specified nonnegative jointly measurable density, the normalized likelihood is a posterior kernel on finite-positive evidence fibres; the prior fills the other fibres, which are prior-predictive null. Bayes formula for dominated kernels

[F8]

An IID family is mutually independent and identically distributed; the definition itself imposes no moment condition. Identical distribution and IID families

[F9]

Measurable coordinatewise maps preserve independence. Measurable coordinatewise functions preserve independence

[F10]

A finite vector of independent random elements has the product of its marginal laws. Independent random elements have product joint law

[F11]

IID integrable real random variables obey the strong law of large numbers. Kolmogorov iid l1 strong law

[F12]

If 0≤Y≤1, then Eexp⁡{λ(Y−EY)}≤exp⁡(λ2/8) for every real λ. The Hoeffding MGF bound for a variable in a unit interval

[F13]

The exponential is convex: exp⁡((1−t)x+ty)≤(1−t)exp⁡(x)+texp⁡(y) for 0≤t≤1. The two-point convexity inequality for the exponential function

[F14]

Jensen's integral inequality gives φ(∫f)≤∫φ(f) for integrable f and convex φ when φ∘f is integrable. Jensen's integral inequality for a probability measure

[F15]

For nonnegative Z and a>0, P(Z≥a)≤EZ/a. Markov's inequality for random variables

[F16]

If event probabilities are summable, the limsup event has probability zero; independence is not required. First Borel-Cantelli lemma for events

[F17]

With ∥P−Q∥TV=sup⁡A∣P(A)−Q(A)∣ and under AC, Pinsker gives ∥P−Q∥TV≤D(P∥Q)/2. Total variation distance for probability laws, Pinsker’s inequality with event-supremum total variation

[F18]

Under the same event-supremum convention, h(P,Q)2≤2∥P−Q∥TV. Hellinger invariance and comparison with library total variation

[F20]

The finite product sigma-algebra is generated by measurable rectangles. The product sigma-algebra and its finite iterates

[F21]

Products of sigma-finite measures exist, satisfy the rectangle formula and remain sigma-finite. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique

[F22]

Measures agreeing on a generating pi-system with an increasing finite-measure exhaustion from that system are equal. Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system

[F23]

Products and lattice operations of measurable extended-real functions are measurable under the library's zero-times-infinity convention. Arithmetic and lattice operations preserve measurability whenever they are defined

[F24]

If f≥0 is measurable, then A↦∫Af dμ is a measure. The indefinite integral of a nonnegative measurable function is a measure

[F25]

A real-valued function is measurable if its strict threshold preimages are measurable; in particular, for f≥0, {f>r}={f>r2} when r≥0, and {f>r} is the whole space when r<0. Threshold characterisations of real-valued and extended-real-valued measurability

[F26]

The exponential satisfies exp⁡(x+y)=exp⁡(x)exp⁡(y). The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y)

[F27]

The exponential is positive and strictly increasing, exp⁡(0)=1, and exp⁡(−x)=1/exp⁡(x). The exponential function is strictly increasing, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x)

[F28]
[F29]

Since the exponential is strictly increasing and log⁡ is its inverse, for u>0 and real s, log⁡u>s exactly when u>exp⁡(s). The natural logarithm as the inverse of the exponential function, The exponential function is strictly increasing

Proof

Given: The hypotheses and conventions in the Statement.

1.1F1F6F8F10F20F21F22F23F24given

For n≥1 put Ln(θ,x1:n)=∏i=1np(θ,xi) and Zn(x1:n)=∫ΘLn(θ,x1:n) Π(dθ). The coordinate maps into Θ×X are measurable by the product sigma-algebra definition [F20]; joint measurability of p and closure under finite products [F23] make Ln product-measurable. For each fixed θ, repeated Tonelli [F6, F21] and ∫p(θ,x) dμ=1 give ∫Ln(θ,⋅) dμn=1. By [F24], Ln(θ,⋅)dμn is a measure. On every measurable rectangle ∏i=1nAi, repeated Tonelli and the density identity give mass ∏iPθ(Ai); this is also the rectangle mass of Pθn by [F8, F10]. Rectangles generate the product sigma-algebra [F20], and both are probability measures, so [F22], using the whole sample space as a finite-measure exhaustion, identifies these measures. Tonelli over Π and μn now gives ∫Zn dμn=1, hence Zn<∞ μn-almost everywhere and P0n-almost surely.

1.2A1F3F4F5F17F19given

Fix 0<a<b, choose measurable Ba⊆{θ:D(P0∥Pθ)<a} with Π(Ba)>0, and let Πa be the normalized restriction of Π to Ba. For each θ∈Ba, finite KL gives P0≪Pθ. Define rθ=p0/p(θ,⋅) where p(θ,⋅)>0 and zero elsewhere. Since P0({p(θ,⋅)=0})=0, direct integration of the two supplied densities gives ∫Arθ dPθ=P0(A) for every measurable A, so rθ is a Radon–Nikodym derivative. Define Zθ=log⁡(p(θ,⋅)/p0) where both densities are positive and zero elsewhere; then Zθ=−log⁡rθ P0-almost surely. For u≥1, [F19] gives log⁡u≤u, so E0Zθ+≤∫{p(θ,x)>p0(x)}p(θ,x) dμ≤1. Pinsker [F17] gives D(P0∥Pθ)≥0, and [F5] yields E0Zθ−=D(P0∥Pθ)+E0Zθ+≤a+1. Thus E0∣Zθ∣≤a+2.

1.3F8F9F10given

Fix η>0 with Vη≠∅, and let αn=P0nϕn and βn=sup⁡θ∈VηPθn(1−ϕn). The two summable series imply αn,βn→0. Choose m≥1 with αm<1/4 and βm<1/4. For ℓ=⌊n/m⌋, group the first ℓm observations into disjoint consecutive blocks of length m. By [F8, F10] the block vectors are independent and identically distributed under each fixed IID law; [F9] makes Yj:=ϕm(block j) independent [0,1] random variables. Their means are at most 1/4 under P0 and at least 3/4 under every Pθ with θ∈Vη. Let ϕ~n=1{ℓ−1∑j=1ℓYj>1/2} for ℓ≥1, and 0 otherwise.

2.1F3step 1.1given

Since P0=Pθ0≪μ, p0(Xi)>0 for every sampled coordinate almost surely. On this event define the relative evidence Dn=Zn(X1:n)/∏i=1np0(Xi); it is finite P0n-almost surely by step 1.1.

2.2F2F5F6F20F23F25F27F29step 1.2

Let u(θ,x)=p(θ,x)/p0(x) when both densities are positive and 0 otherwise; the lift of p0 to Θ×X is measurable by [F2,F20], and the piecewise quotient is measurable by [F23,F25]. Extend Z(θ,x)=log⁡u(θ,x) on u>0 by 0 on u=0. For every real s, its upper threshold is {u>exp⁡(s)} if s≥0 and {u=0}∪{u>exp⁡(s)} if s<0; [F27,F29] and [F25] therefore make Z product-measurable. For each θ∈Ba, [F5] identifies D(P0∥Pθ)=−E0Zθ; applying [F6] to the positive and negative parts shows that these section integrals, and hence θ↦D(P0∥Pθ) on Ba, are measurable. Tonelli [F6] and the uniform bound in step 1.2 show G(x):=∫Z(θ,x) Πa(dθ) is finite for P0-almost every x and integrable, with E0G=−κ where κ:=∫D(P0∥Pθ) Πa(dθ)≤a. For each θ∈Ba, P0{x:p(θ,x)=0}=0; Tonelli [F6] applied to the measurable indicator of this set implies Πa{θ:p(θ,Xi)=0}=0 almost surely for each coordinate i. Intersecting these probability-one events over all i, exp⁡(∑i=1nZ(θ,Xi))=∏i=1np(θ,Xi)/p0(Xi) for Πa-almost every θ and every n. Set G=0 on the measurable P0-null set where the integral is not finite.

2.3F6F10F12F15F26step 1.3algebra

For ℓ≥1, [F26] writes the exponential of the centered sum as a product; the finite product law [F10] and Tonelli [F6] factor its expectation, and [F12] bounds each factor by eλ2/8. Thus Eexp⁡{λ∑j=1ℓ(Yj−EYj)}≤eℓλ2/8. Under P0, rejection requires an upward deviation greater than ℓ/4; Markov [F15] with λ=1 gives P0nϕ~n≤e−ℓ/8. Under every Pθ in Vη, nonrejection requires a downward deviation at least ℓ/4; Markov with λ=−1 gives Pθn(1−ϕ~n)≤e−ℓ/8. Since ℓ≥n/m−1, both errors are at most e1/8e−cn for c:=1/(8m) and all n≥m.

3.1F6F8F9F11F13F14step 1.1step 1.2step 2.2given

The variables G(Xi) are IID by [F8, F9] and integrable by step 2.2. The strong law [F11] gives n−1∑i=1nG(Xi)→−κ; because κ≤a<b, eventually ∑iG(Xi)>−nb. Tonelli and the bound in step 1.2 also give ∫∑i∣Zθ(Xi)∣ Πa(dθ)<∞ for P0n-almost every sample; the exponential is integrable by step 1.1. By step 2.2, the likelihood ratio in Dn agrees with exp⁡(∑iZθ(Xi)) for Πa-almost every θ, so Dn≥Π(Ba)∫exp⁡(∑iZθ(Xi)) Πa(dθ). Jensen [F13, F14] bounds this integral below by exp⁡(∑iG(Xi)), giving Dn≥Π(Ba)e−nb eventually.

3.2F6step 1.1step 2.2step 2.3

On {p0(Xi)>0 for 1≤i≤n}, define An:=(1−ϕ~n)∫Vη∏i=1n[p(θ,Xi)/p0(Xi)] Π(dθ), and set An=0 otherwise. The product-density identity in step 1.1 and Tonelli [F6] imply EP0nAn=∫VηPθn((1−ϕ~n)1{p0(Xi)>0 ∀i}) Π(dθ)≤e1/8e−cn for n≥m, by step 2.3 and Π(Vη)≤1.

4.1F7step 3.1step 3.2given

On valid posterior fibres, split the likelihood numerator over the test and its complement. The posterior formula [F7] gives Πn(Vη∣X1:n)≤ϕ~n+An/Dn. Step 3.1 ensures the denominator is finite and positive for all sufficiently large n almost surely.

5.1F15F16F27F28step 3.1step 2.3step 4.1step 3.2

Choose 0<a<b<c and use step 3.1 with these radii. Since c>0 and c−b>0, [F27] gives e−c,e−(c−b)∈(0,1); [F28] makes the corresponding geometric series finite. For each r>0, Markov [F15] gives ∑n≥mP0n(enbAn>r)≤r−1e1/8∑n≥me−n(c−b)<∞. Borel–Cantelli [F16], first for r=1/k and then by countability, gives enbAn→0 almost surely. The type-I bound from step 2.3 is also summable, so [F16] gives ϕ~n→0 almost surely. Combining these limits with Dn≥Π(Ba)e−nb from step 3.1 and step 4.1 proves Πn(Vη∣X1:n)→0 almost surely.

6.1step 5.1algebra

The consistency conclusion holds simultaneously for all η>0: intersect the probability-one events for positive rational q; for any η>0 choose rational q<η, so Vη⊆Vq.

7.1A1F2F6F17F18F23F25algebra∎

For each θ with finite KL, Pinsker [F17] and the local comparison [F18] give h(P0,Pθ)2≤2D(P0∥Pθ)/2, hence h(P0,Pθ)4≤2D(P0∥Pθ). The parameter map θ↦h(P0,Pθ)2 is measurable: [F25] makes both square-root sections measurable, [F23] makes their squared difference product-measurable, and Tonelli [F6] makes its μ-integral measurable in θ. Thus every Hellinger ball is measurable. Taking a positive-measure KL subset Bη4/2 places it inside {θ:h(P0,Pθ)<η}, proving positive prior mass.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Identifiability and KL support do not replace testability

Statement refuted

Under the library AC convention for KL divergence and density representatives, refute the claim that in every well-specified dominated IID model an injective parameter-to-law mapping and positive prior mass in every KL neighborhood of the truth suffice for posterior consistency in every metric on the model laws, even without a uniform testing condition.

Facts & Assumptions

Given: Refute the universal claim with a well-specified dominated IID model that is identifiable and has KL support at its truth, but has no uniformly consistent tests for a metric-separated complement and has posterior mass one on that complement at every sample size.

[A1]

The Axiom of Choice is the premise in the general published definitions of KL divergence and likelihood-density representatives; the Bernoulli densities below are explicitly supplied. The Axiom of Choice

[F1]

A parametric model is identifiable exactly when its parameter-to-law map is injective. Identifiability of an estimand

[F2]

KL divergence is directional: D(P∥Q)=+∞ if P≪̸Q, and otherwise it is the P-expectation of log⁡(dP/dQ). Kullback–Leibler divergence

[F3]

Under the root-L2 Hellinger and library event-supremum conventions, ∥P−Q∥TV≤h(P,Q) and h(P,Q)2≤2∥P−Q∥TV. Hellinger invariance and comparison with library total variation

[F4]

Library total variation is sup⁡A∣P(A)−Q(A)∣. Total variation distance for probability laws

[F5]

For a proper prior and a jointly measurable dominated probability kernel, a finite-positive evidence fibre has posterior proportional to its likelihood times the prior. Bayes formula for dominated kernels

[F6]

An IID family is mutually independent and identically distributed. Identical distribution and IID families

[F7]

A finite vector of independent random elements has the product of its marginal laws. Independent random elements have product joint law

[F8]

A dominated experiment specifies a sigma-finite measure dominating each law, and the likelihood-density convention supplies finite-valued nonnegative density representatives. Dominated statistical experiments, Likelihood densities

[F9]

A parameter-measurable statistical model is a probability kernel whose event-probability sections are measurable. Parameter-measurable statistical models as kernels

[F10]

For ∣r∣<1, ∑k=1∞rk=r/(1−r); in particular ∑k=1∞2−k=1. For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges

[F12]

A probability measure has total mass one. Probability measures and probability spaces

Counterexample

1.1F1F8F9givenconstruct

Let X={0,1} with counting measure, let Θ={0,1,2,…} with its power-set sigma-algebra, and put δk=(k+2)−2 for k≥1. Define P0=Bernoulli⁡(1/2) and Pk=Bernoulli⁡(1/2+δk). Every mass is strictly between zero and one, and the map k↦Pk is injective because the δk are distinct. Thus the model is identifiable by [F1]. The parameter and observation spaces are discrete, so every event-probability section is measurable by [F9] and every function on their countable product, including the pointwise Bernoulli density, is jointly measurable. The counting measure is sigma-finite and the displayed densities are normalized, so this is a dominated model by [F8].

2.1A1F2F10F11F12step 1.1algebra

Give the true parameter 0 prior mass zero and set Π({k})=2−k for k≥1. By [F10] these masses sum to one, so [F12] makes Π a probability. For δ=δk, the explicit densities and [F2] give D(P0∥Pk)=12log⁡1/21/2+δ+12log⁡1/21/2−δ=−12log⁡(1−4δ2). For 0<x<1, [F11] gives 0≤−log⁡(1−x)=∫1−x1dt/t≤x/(1−x); hence 0≤D(P0∥Pk)≤2δk2/(1−4δk2)→0. Every KL neighborhood of P0 therefore contains some Pk with prior mass 2−k>0.

2.2F4F5F10step 1.1algebragiven

Put d(Pj,Pk)=1 for distinct model laws and d(Pj,Pj)=0. This is a metric: if the endpoints in a triangle inequality differ, at least one adjacent pair differs and the sum of its two distances is at least one; if they agree, the left side is zero. Thus the parameter complement is V1/2={k≥1}. For every finite data vector, all Pkn(x1:n)>0 and are at most one, so the evidence ∑k≥12−kPkn(x1:n) is finite and positive. By [F5], the posterior is supported on {k≥1}; consequently Πn(V1/2∣x1:n)=1 for every data vector and every n.

2.3A1F3F4F6F7step 1.1algebra

Let ρk=∑x∈{0,1}P0({x})Pk({x}). Then 0≤ρk≤1, since h(P0,Pk)2=2−2ρk is an integral of a square. The IID product law [F6, F7] and distributivity give product affinity ρkn, so h(P0n,Pkn)2=2(1−ρkn)≤n 2(1−ρk)=nh(P0,Pk)2, since 1−rn=(1−r)∑j=0n−1rj≤n(1−r) for 0≤r≤1. Also ∥P0−Pk∥TV=δk: the four events in {0,1} have probability differences 0,δk,−δk,0. Thus [F3] gives ∥P0n−Pnn∥TV≤h(P0n,Pnn)≤2nδn→0.

3.1F4step 2.3algebra

Write Δn(x)=P0n({x})−Pnn({x}) on the finite sample space. Since ∑xΔn(x)=0, the positive and negative sums each have magnitude ∥P0n−Pnn∥TV: the event {x:Δn(x)>0} attains the positive sum, and every event sum lies between the negative and positive sums. For any randomized test 0≤ϕn≤1, it follows term-by-term that ∣P0nϕn−Pnnϕn∣=∣∑xϕn(x)Δn(x)∣≤∥P0n−Pnn∥TV. Hence sup⁡k≥1Pkn(1−ϕn)≥Pnn(1−ϕn)≥1−P0nϕn−∥P0n−Pnn∥TV. If the type-I error tends to zero, step 2.3 makes this uniform type-II lower bound tend to one. No tests with both errors tending to zero exist for this complement, although the model is identifiable and the prior has KL support.

4.1step 1.1step 2.1step 2.2step 2.3step 3.1∎

Steps 1.1 and 2.1 establish identifiability and KL support, while steps 2.2, 2.3, and 3.1 establish posterior inconsistency and absence of uniformly consistent tests. This refutes the statement.

5 · Examples, counterexamples and false statements

None yet.

Sources