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.
Approximate Bayesian computation and the tolerance-conditioned target
Definition
Let and be standard Borel spaces. Let be a prior probability measure on and let be a probability kernel from to , as in Bayesian model as a prior and sampling kernel. Let be a measurable statistic for a fixed integer , and fix an observed summary . The Euclidean norm is .
Under the prior-simulator joint law, first draw and then . The summary-predictive probability measure on is the law of ; on measurable rectangles it is The prior and simulator define a joint law by A prior and model kernel define a joint law, and the change-of-variables formula identifies as the law after applying (Change of variables for expectation).
For , define the closed tolerance ball Its prior-predictive acceptance probability is Only when define the indicator ABC target by This is exactly the conditional law of under the augmented event . The denominator is finite because is a probability, and no quotient is assigned when the event has probability zero. This target is the posterior given a tolerance event, not in general the full-data posterior or the posterior given the exact summary.
Remarks
A positive tolerance separates summary information loss from tolerance bias; using finitely many accepted draws adds a separate Monte Carlo error. At a null summary value, a regular-conditional version may be changed there without affecting its defining identities, so its value is not determined by conditioning alone. The density regularity in ABC targets the density-defined summary posterior at zero tolerance selects the particular density-based target obtained as the positive-tolerance limit.
Depends on
Used by
- ABC rejection sampling Algorithm
- A nonconstant summary can lose an identifiable parameter Counterexample
- An identifiable model can have persistent ABC summary distortion Counterexample
- Pointwise continuity alone does not guarantee the zero-tolerance limit Counterexample
- Positive ABC tolerance changes an identity-summary target Counterexample
- Augmented ABC tolerance target Definition
- A Bernoulli count is a sufficient summary for a finite-sample posterior Example
- Vanishing acceptance probability with a stable zero-tolerance target Example
- The augmented ABC target has the tolerance posterior as its parameter marginal Lemma
- ABC rejection returns the tolerance-conditioned posterior Theorem
- ABC targets the density-defined summary posterior at zero tolerance Theorem
Dependency tree · two levels
32 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
- Jarno Lintusaari, Michael U. Gutmann, Ritabrata Dutta, Samuel Kaski, and Jukka Corander, Fundamentals and Recent Developments in Approximate Bayesian Computation (standard reference, not scraped)
- Martin, Kumar, and Lao, Bayesian Modeling and Computation in Python, Chapter 8 (standard reference, not scraped)
- Aki Honkela, Computational Statistics I, Chapter 9 (standard reference, not scraped)