Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Exponential tests and KL mass force posterior exclusion

Statement

Let V⊆Θ be measurable. Suppose a relative KL neighborhood Bϵ has positive prior mass and that, for all sufficiently large n, tests ϕn:Xn→[0,1] satisfy ϕn(X1,…,Xn)⟶0P0∞-almost surely,sup⁡θ∈VQθn(1−ϕn)≤e−nβ for a constant β>ϵ. Then Π(V∣X1,…,Xn)⟶0P0∞-almost surely.

Facts & Assumptions

Given: A jointly measurable dominated IID model, a proper prior, Bϵ with Π(Bϵ)>0, and tests with almost-surely vanishing type-I statistics and the displayed exponential type-II bound.

[A1]

AC is assumed for the imported KL and likelihood-density conventions The Axiom of Choice. The jointly measurable density family is supplied, so the proof makes no further selections.

[F1]

KL-neighborhood prior mass lower-bounds the likelihood denominator: for every α>ϵ, the likelihood denominator is eventually at least e−nα almost surely.

[F2]

Product likelihood tilts have the product density: the P0n-density of Qθn is ∏i=1npθ(Xi)/pθ∗(Xi).

[F3]

Bayes formula for dominated kernels: on finite positive evidence fibres, the posterior is the normalized prior-weighted likelihood; the preceding denominator lemma makes these the relevant P0n-almost sure fibres.

[F4]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative jointly measurable likelihood integrands may be integrated in either order.

[F5]

Markov's inequality for random variables: for nonnegative Y and a>0, P(Y>a)≤E[Y]/a.

[F6]

First Borel-Cantelli lemma for events: a sequence of events with summable probabilities occurs only finitely often almost surely.

[F7]

Identical distribution and IID families and Independent random elements have product joint law: the IID sample vector has law P0n for each n, and events with these finite-dimensional probabilities are measured under the corresponding infinite IID law.

[F8]

Probability measures and probability spaces: the prior Π has total mass one.

Proof

Given: The hypotheses and conventions in the Statement.

1.1A1F1F7givenchoose

Choose α with ϵ<α<β. By [A1] and [F1], the denominator Dn is at least e−nα eventually almost surely. By the type-I premise, ϕn(X1,…,Xn)→0 almost surely under the same infinite IID law. Intersect these two full-probability events.

1.2F2F4F8given

Define Nn:=∫V∏i=1npθ(Xi)pθ∗(Xi)(1−ϕn) Π(dθ),Yn:=enαNn. By [F2], [F4], [F8], and the type-II bound, EP0nYn≤enαΠ(V)e−nβ≤e−n(β−α).

2.1F5F6F7step 1.2algebra

Set an=e−n(β−α)/2. For every sufficiently large n, Markov's inequality [F5] gives P0n{Yn>an}≤e−n(β−α)/2. The right-hand side is summable, and the finite initial terms do not matter. Thus [F6] and [F7] imply Yn→0 almost surely.

3.1F1F3step 1.1step 2.1algebra∎

On the full-probability event from the denominator lemma, the ordinary evidence is Zn:=∫Θ∏ipθ(Xi) Π(dθ)=(∏ipθ∗(Xi))Dn, which is finite and positive. Bayes' formula [F3] therefore gives the posterior as the normalized likelihood integral, and division by this positive common factor expresses it using Dn. Decompose the tested likelihood integral over V into its ϕn and 1−ϕn parts. Since 0≤ϕn≤1, ∫VRn(θ) Π(dθ)=∫VϕnRn(θ) Π(dθ)+Nn≤ϕn∫ΘRn(θ) Π(dθ)+Nn=ϕnDn+Nn, where Rn(θ)=∏ipθ(Xi)/pθ∗(Xi). Therefore Π(V∣X1,…,Xn)≤ϕn+NnDn≤ϕn+enαNn=ϕn+Yn. Steps 1.1 and 2.1 make the right-hand side tend to zero.

Remarks

An exponentially small type-I expectation, or merely a summable sequence of type-I expectations, implies the a.s. premise by Markov and Borel–Cantelli. Neither summability nor an exponential type-I bound is required here. Merely vanishing type-I and type-II expectations do not suffice for general likelihood tilts; see Weak tests against likelihood tilts do not ensure almost-sure posterior consistency ↗.

Depends on

Used by

Dependency tree · two levels

47 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