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.
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.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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
- B. J. K. Kleijn and A. W. van der Vaart, The Bernstein-Von-Mises Theorem under Misspecification, §4.1 (standard reference, not scraped)