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.
Measure kernel and probability kernel
Definition
A measure kernel from to is a map such that, for every , is a measure on , and for every , is -measurable. Measures and measurability have the meanings in Measures on sigma-algebras and A measurable function between measurable spaces; the evaluation functions use the Borel sigma-algebra on .
A probability kernel satisfies for every s. A finite kernel satisfies for every s; there need not be a common bound on these masses. A uniformly sigma-finite kernel, in the convention of this page, comes with a specified sequence increasing to T such that for every s and n. This is a common measurable exhaustion, not a bound uniform in s. A finite kernel has the constant exhaustion . An arbitrary measure kernel is not assumed to have such an exhaustion.
All these requirements are pointwise in s, not merely almost everywhere for an unspecified measure on S. If T is empty, its only measure is zero, so a probability kernel into T can exist only when S is empty. If S is empty, the kernel requirements are vacuous. The zero kernel is finite. This definition selects no versions and uses no choice axiom.
Definition references
Depends on
Used by
- ABC Metropolis–Hastings on simulator-augmented states Algorithm
- Contrastive divergence with k transitions Algorithm
- Exact Gibbs block update Algorithm
- Exponential mechanism Algorithm
- Finite-class empirical-risk selection with exponential weights Algorithm
- Full-resampling fixed-level SIR splitting with invariant mutations Algorithm
- Laplace mechanism Algorithm
- Measurement-guided reverse-kernel reconstruction Algorithm
- Metropolis–Hastings kernel Algorithm
- Particle marginal Metropolis–Hastings Algorithm
- Prior-preserving Crank–Nicolson sampler Algorithm
- Randomized weighted majority with full information Algorithm
- Recursive Bayesian filtering under dominated observations Algorithm
- Sequential ABC importance-resampling with tolerance populations Algorithm
- Higher-dimensional simple symmetric walks are transient Corollary
- Irreducible recurrence/transience dichotomy Corollary
- One-dimensional simple symmetric walk is recurrent Corollary
- The one-sample Hotelling F test has exact size alpha Corollary
- Two-dimensional simple symmetric walk is recurrent Corollary
- A nonconstant summary can lose an identifiable parameter Counterexample
- A systematic composition of reversible kernels need not be reversible Counterexample
- An external dominating law need not be a valid sufficiency reference Counterexample
- An identifiable model can have persistent ABC summary distortion Counterexample
- Diminishing adaptation and uniform ergodicity need not give a strong law Counterexample
- Infinite-dimensional Gaussian random-walk reverse flow is singular Counterexample
- Positive ABC tolerance changes an identity-summary target Counterexample
- Regular conditional laws are not unique on null conditioning values Counterexample
- The density ratio is undefined on zero marginal fibres Counterexample
- Aperiodicity for a general-state Markov kernel Definition
- Approximate Bayesian computation and the tolerance-conditioned target Definition
- Assumptions for identifying natural effects Definition
- Augmented ABC tolerance target Definition
- Bayes-reversed Gaussian smoothing kernels Definition
- Bayes-reversed transition kernels for a diffusion Definition
- Bayesian model as a prior and sampling kernel Definition
- Bayesian posterior as a regular conditional law Definition
- Belief states and the finite Bayes filter Definition
- Causally sufficient perfect-oracle discovery regime Definition
- Channel sequences Definition
- Composition of probability kernels Definition
…and 216 more results.
Dependency tree · two levels
6 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
- Durrett, Probability: Theory and Examples, fifth edition (standard reference, not scraped)
- Varadhan, Probability Theory, Chapter 4 (standard reference, not scraped)