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.
Posterior consistency at a KL projection — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Characteristic Functions Inversion and Continuity
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conformal Prediction and Exchangeable Ranks
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Equivalent Forms of Completeness
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fundamental Trigonometric Identities
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minimax Lower Bounds
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Posterior consistency at a KL projection
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Stationary Markov Chains and Ergodic Limits
- Statistical Experiments, Models and Identifiability
- Strong Laws of Large Numbers
- Suprema and Infima
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
2 · Summary
Objective
These examples calculate a unique and a nonunique KL projection, show that parameter-distant alternatives can defeat uniform testability even when every KL neighborhood has positive prior mass, and compute finite likelihood tilts whose total masses lie below and above one. The examples keep posterior concentration on the whole minimizer set distinct from selection of one parameter label.
The final counterexample has a unique finite KL minimizer, positive prior mass at it, and uniformly weakly consistent tests against sigma-finite likelihood tilts, yet posterior mass outside its discrete neighborhood has almost-sure limes superior one. It distinguishes weak expected test errors from the sufficient almost-sure type-I and exponential type-II interface.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Distant alternatives can prevent uniform testability
Example
On with counting measure, let . Use labels , with at label and, for , Give label prior probability and label prior probability . Use the discrete metric if and otherwise, so every alternative is distance one from label . Take observations IID with the law at the selected parameter label.
Facts & Assumptions
Given: The model, prior, parameter metric, and IID law in the Example.
KL projection sets and relative KL neighborhoods: the relative KL neighborhoods are defined using .
Assume AC through the imported KL convention The Axiom of Choice. The displayed finite density family is explicit.
Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric: a metric separates distinct points and obeys the triangle inequality.
Verification
For , direct substitution gives Thus . Every relative KL neighborhood contains and therefore has prior mass at least , while every lies in the distance-one alternative set.
Fix and choose . For one coordinate define a joint law of by masses at , at , and at , with zero mass at . Its marginals are and , and its disagreement probability is . Take the -fold product of this finite joint law. By the union bound, the coupled vectors differ with probability at most . For every event , the indicators of and can differ only when the vectors differ, so by [F2],
For probability laws on the finite set , : the set of points with positive difference attains the supremum over events, and no event can sum more than all positive differences. Hence for every test with , Taking , and rearranging gives If , then . Since the selected minimizer is the true law, here. Thus no test sequence has both error limits required by the KL-projection theorem.
A nonunique KL projection set need not select one parameter
Example
On with counting measure, let , ; ; and , . Give prior probabilities and . On the labels use for and otherwise. Take IID with law .
Facts & Assumptions
Given: The finite model, prior, and IID sampling law in the Example.
KL projection sets and relative KL neighborhoods: the KL projection is the full set of parameters minimizing .
Assume AC through the imported KL convention The Axiom of Choice. No additional choice is used in this finite model.
Kolmogorov iid l1 strong law: integrable IID real variables have sample means converging almost surely to their expectation.
Verification
Since , their KL losses are equal. Direct calculation gives Thus the minimizer set is .
The likelihoods at and agree for every data vector, so their posterior odds remain . The posterior odds of against have log equal to . By [F2], the sum divided by tends almost surely to . Hence the posterior mass of , the complement of , tends to zero while the posterior never selects one of over the other.
A finite misspecified model with a unique KL projection
Example
On with counting measure, let the true density be , , and let the model densities be and , . Give and prior probability each and use the metric for and otherwise. Take IID with law .
Facts & Assumptions
Given: The finite model, prior, and IID sampling law in the Example.
KL projection sets and relative KL neighborhoods: the KL projection set consists of the minimizers of the directional contrast .
Assume AC through the imported KL convention The Axiom of Choice. No additional choice is used in this finite model.
Likelihood-tilted measures at a KL projection: for a selected minimizer , the likelihood-tilt mass at is and need not equal one.
Likelihood tilts are sigma-finite measures: the likelihood tilt is a measure; its total mass is the integral of its density.
Kolmogorov iid l1 strong law: integrable IID real variables have sample means converging almost surely to their expectation.
Verification
The relative KL contrast is Thus is the unique KL minimizer.
The posterior odds are The log factors are bounded and IID, with expectation . By [F3], their sample mean converges almost surely to that negative number, so the odds tend to zero and .
The tilted measure has total mass This example has a unique KL projection and a finite likelihood tilt that is not a probability law.
A likelihood tilt can be a finite measure of mass below one
Example
On with counting measure, let , , and model densities , , , . Give and prior probability each. The density is the unique KL minimizer, while the likelihood tilt at has total mass .
Facts & Assumptions
Given: The finite model, prior, and IID law in the Example.
KL projection sets and relative KL neighborhoods: the projection minimizes the directional contrast .
Assume AC through the imported KL convention. No further choice is used in this finite model. The Axiom of Choice
Likelihood-tilted measures at a KL projection: the total likelihood-tilt mass is and is not required to equal one.
Likelihood tilts are sigma-finite measures: the tilted set function is a measure; a finite total mass is allowed to be below one.
Verification
The KL loss at is At , is not absolutely continuous with respect to , so . Thus is the unique minimizer and every KL neighborhood has prior mass at least .
The likelihood tilt at assigns mass Hence , so is a finite nonprobability measure.
A likelihood tilt can be a finite measure of mass above one
Example
On with counting measure, let , , and , where each pair lists the values at and . Give and prior probability each. Then is the unique KL minimizer and the tilt at has mass .
Facts & Assumptions
Given: The finite density model and prior in the Example.
Assume AC for the imported directional KL convention The Axiom of Choice. No additional choice is used.
KL projection sets and relative KL neighborhoods: a KL projection minimizes .
Likelihood-tilted measures at a KL projection: for selected , .
Likelihood tilts are sigma-finite measures: the likelihood tilt is a sigma-finite measure, whether or not its total mass is one.
Verification
The density is positive at both sample points, so . At , while , so and by [F1]. Therefore is the unique minimizer.
Since and , The tilt is a finite nonprobability measure by [F2] and [F3].
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.
Sources
- R. V. Ramamoorthi, K. Sriram, and R. Martin, On Posterior Concentration in Misspecified Models, §1, pp. 760–761
- B. J. K. Kleijn and A. W. van der Vaart, The Bernstein-Von-Mises Theorem under Misspecification, §4.1, p. 378
- B. J. K. Kleijn and A. W. van der Vaart, The Bernstein-Von-Mises Theorem under Misspecification, Corollary 4.2, p. 379
- B. J. K. Kleijn and A. W. van der Vaart, The Bernstein-Von-Mises Theorem under Misspecification, §4.1
- B. J. K. Kleijn and A. W. van der Vaart, The Bernstein-Von-Mises Theorem under Misspecification, §3.2, pp. 368–370
- B. J. K. Kleijn and A. W. van der Vaart, The Bernstein-Von-Mises Theorem under Misspecification, §3.2
- Kleijn and van der Vaart, The Bernstein-Von-Mises theorem under misspecification, Lemma 3.3 and Corollaries 4.1–4.2 (claims examined here)
- Durrett, Probability: Theory and Examples, fifth edition, random walks and zero-one laws