Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 (Θ,T) and (Y,Y) be standard Borel spaces. Let Π be a prior probability measure on (Θ,T) and let K be a probability kernel from (Θ,T) to (Y,Y), as in Bayesian model as a prior and sampling kernel. Let S:Y→Rd be a measurable statistic for a fixed integer d≥1, and fix an observed summary s0∈Rd. The Euclidean norm is ∥x∥2=(∑j=1dxj2)1/2.

Under the prior-simulator joint law, first draw θ∼Π and then Y∼K(θ,⋅). The summary-predictive probability measure M on Θ×Rd is the law of (θ,S(Y)); on measurable rectangles it is M(A×C)=∫AK(θ,S−1(C)) Π(dθ). 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 M as the law after applying S (Change of variables for expectation).

For ϵ≥0, define the closed tolerance ball Bϵ(s0)={s∈Rd:∥s−s0∥2≤ϵ}. Its prior-predictive acceptance probability is pϵ(s0):=M(Θ×Bϵ(s0))∈[0,1]. Only when pϵ(s0)>0 define the indicator ABC target by Πϵ(A∣s0):=M(A×Bϵ(s0))pϵ(s0)(A∈T). This is exactly the conditional law of θ under the augmented event S(Y)∈Bϵ(s0). The denominator is finite because M 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

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