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.
Parameter-measurable statistical models as kernels
Definition
Suppose an experiment on also has a measurable parameter space (Measurable spaces and measurable sets). A Markov kernel (or probability kernel) representation is a function
such that, for every , the set function is a probability measure on , and, for every and every Borel set ,
Here the Borel sigma-algebra on is generated by its relatively open subsets , where is open in . Thus the second condition says that each event-probability map is measurable. The kernel represents the given experiment exactly when for every and (Statistical experiments, Probability measures and probability spaces).
This is an optional parameter-measurable version of a model. An arbitrary experiment does not include a measurable structure on or imply this kernel condition.
Depends on
Used by
- Identifiability and KL support do not replace testability Counterexample
- Bayes risk and minimax risk Definition
- Bayesian model as a prior and sampling kernel Definition
- Finite-group hierarchical Bayesian model Definition
- A dense Gaussian mean lower bound by Assouad’s method Example
- A finite identifiable model with posterior consistency Example
- A Gaussian two-point lower bound Example
- A prior and model kernel define a joint law Lemma
- A posterior-risk minimizer minimizes prior risk Theorem
- Assouad lower bound for a squared-error hypercube Theorem
- Fano’s packing bound with a reference-distribution KL bound Theorem
- Gaussian-process posterior contraction in density and regression models Theorem
- Posterior consistency from KL support and uniformly summable tests Theorem
- Two-point Le Cam lower bound for squared-error risk Theorem
Dependency tree · two levels
8 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
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §§1.3.6, 1.4.1 and 5.1, PDF pp. 20–23 and 100–102 (standard reference, not scraped)
- Botond Szabó and Aad van der Vaart, Bayesian Statistics, lecture notes, §1.1, Definition 1.1 and the statistical-model kernel conditions following it (standard reference, not scraped)