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.
Weak tests against likelihood tilts do not ensure almost-sure posterior consistency
Statement refuted
In a dominated IID model with a finite KL minimum, a nonempty KL-minimizer set , and positive prior mass in every relative KL neighborhood, suppose that for every there are measurable tests satisfying The false assertion is that these conditions, allowing arbitrary sigma-finite likelihood tilts, imply almost-sure posterior concentration on every neighborhood of . The example below has a unique minimizer and finite log likelihood contrasts, but posterior mass outside each discrete neighborhood of radius less than one has almost-sure limes superior one.
Facts & Assumptions
Given: The explicitly supplied countable model and IID observations constructed below. All logarithms are natural.
The Axiom of Choice is assumed for the imported KL convention; all densities are supplied and no additional selections are used.
KL projection sets and relative KL neighborhoods defines the directional KL contrast, its minimizer set, and relative KL neighborhoods.
Likelihood-tilted measures at a KL projection, Likelihood tilts are sigma-finite measures, and Product likelihood tilts have the product density give the sigma-finite tilt with density and its product density.
A nonconstant centered integrable IID random walk is unbounded above: IID integrable, nonconstant, mean-zero increments have partial sums unbounded above almost surely.
Chebyshev's inequality for random variables bounds a centered finite-variance variable's deviation probability by its variance divided by the squared threshold.
First Borel-Cantelli lemma for events: summable event probabilities imply only finitely many occurrences almost surely.
The finite union bound bounds the probability of at least one of finitely many events by the sum of their probabilities.
Counterexample
Given: The hypotheses and notation just stated.
Let normalize the density on . Its normalizing integral is finite and positive, and . For IID with this density put and . These increments are integrable, nonconstant and centered.
For , direct integration gives and . Moreover : split the integral at , bound the first part by , and the second by . Put for all sufficiently large . By [F6], the probability that any of the first observations exceeds is . The variance of is at most by independence. Dividing this bound by gives . Chebyshev [F4] therefore shows . Define and for , with arbitrary tests for . It follows that .
By [F3], the hitting times are finite almost surely for every positive integer . Define recursively and let be the least integer at least with . Such an integer exists since almost surely. Put . Thus and ; these constants depend only on the true law, not the realized observations. By [F5], eventually almost surely. Also almost surely, since finitely many finite partial sums cannot exceed arbitrarily large levels.
Take sample space with its disjoint-union Borel sigma-algebra and dominating measure equal to Lebesgue measure plus . Set and . On the continuous part supply and ; give each density its remaining mass at . Both continuous masses are strictly between zero and one, so these atom masses are positive, and every density is finite and normalized. Take with the discrete metric and its Borel sigma-algebra; the supplied density family is jointly measurable. By [F1], and , so . All relevant log ratios are integrable because .
On the -support, the tilt at has density . Its total mass is infinite, since , but the finite pointwise density makes it sigma-finite by [F2]. Its product density is . On this is at most , uniformly in , and hence . For , the set at distance greater than from is precisely , so these same tests satisfy both required weak errors. For that set is empty and the type-II requirement is vacuous.
Put and give the model prior , . These masses sum to one. Every relative KL neighborhood has mass at least because it contains . On any observed continuous sample, divide the prior-weighted likelihood by to obtain the alternative numerator . It is finite, being at most , and the total relative evidence is . Thus the posterior mass of the alternatives is .
Almost surely, for every sufficiently large , step 2.2 gives and . Consequently . Since , the posterior mass outside every discrete neighborhood of radius less than one has limes superior one almost surely. This contradicts the claimed a.s. consistency although both test errors in the refuted statement tend to zero.
Remarks
The test statistics converge to zero only in probability: the unbounded positive excursions of make infinitely often almost surely. Thus this counterexample does not satisfy an a.s.-vanishing type-I premise. It does not refute a posterior conclusion formulated only in probability. It specifically refutes the original unrestricted weak-test to almost-sure implication and its proposed exponential-test amplification.
Depends on
- The Axiom of Choice
- KL projection sets and relative KL neighborhoods
- Likelihood-tilted measures at a KL projection
- Likelihood tilts are sigma-finite measures
- Product likelihood tilts have the product density
- A nonconstant centered integrable IID random walk is unbounded above
- Chebyshev's inequality for random variables
- First Borel-Cantelli lemma for events
- The finite union bound
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
37 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
- Kleijn and van der Vaart, The Bernstein-Von-Mises theorem under misspecification, Lemma 3.3 and Corollaries 4.1–4.2 (claims examined here) (standard reference, not scraped)
- Durrett, Probability: Theory and Examples, fifth edition, random walks and zero-one laws (standard reference, not scraped)