Alphabeta Math
Pipeline-generated
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.

ABC-MCMC and ABC-sequential Monte Carlo

1 · Prerequisites

2 · Summary

Objective

This page makes the simulator-based approximate target explicit on the augmented parameter-data space whenever the tolerance-event probability is positive. Under AC, with standard-Borel state spaces and a probability proposal kernel, the general Metropolis–Hastings construction preserves this target. The sequential population procedure uses a finite nonincreasing schedule of positive tolerances with positive normalizers, and reweights proposals when each reached proposal mixture dominates the prior almost surely. Summary reduction and positive tolerance can bias the target, while acceptance rates, finite-particle error, and MCMC mixing remain separate questions.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Augmented ABC tolerance target

Definition

Use the prior and simulator setup of Approximate Bayesian computation and the tolerance-conditioned target: standard-Borel parameter and data spaces (Θ,T) and (Y,Y), a prior probability Π, a probability kernel K(θ,⋅), a measurable summary map S:Y→Rd with d≥1, an observed summary s0∈Rd, and tolerance ϵ≥0. Let Bϵ(s0)={s∈Rd:∥s−s0∥2≤ϵ},Aϵ=S−1(Bϵ(s0)). The prior-simulator joint law H on the product sigma-algebra (Θ×Y,T⊗Y) is H(C)=∫ΘK(θ,Cθ) Π(dθ),Cθ={y:(θ,y)∈C}, which is a probability measure by A prior and model kernel define a joint law. The finite product is standard Borel by Finite products of standard Borel spaces are standard Borel. Put hϵ(θ,y)=1Aϵ(y),Zϵ=∫Θ×Yhϵ dH=∫ΘK(θ,Aϵ) Π(dθ). Thus 0≤Zϵ≤1, and Zϵ is the prior-predictive probability pϵ(s0) in Approximate Bayesian computation and the tolerance-conditioned target. Only when Zϵ>0 define the augmented ABC tolerance target Π~ϵ(C)=1Zϵ∫Chϵ dH(C∈T⊗Y). It is the prior-simulator joint law conditioned on the summary-tolerance event. Its parameter marginal is identified in The augmented ABC target has the tolerance posterior as its parameter marginal. The definition does not assert that summary reduction or a positive tolerance preserves the full-data posterior.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The augmented ABC target has the tolerance posterior as its parameter marginal

Statement

Under the hypotheses of Augmented ABC tolerance target with Zϵ>0, the Θ-marginal of Π~ϵ is the tolerance-conditioned law Πϵ(⋅∣s0) defined in Approximate Bayesian computation and the tolerance-conditioned target.

Facts & Assumptions

Given: A prior probability Π, simulator probability kernel K, measurable summary S, observed summary s0, and ϵ≥0 with Zϵ=pϵ(s0)>0.

[F1]

Augmented ABC tolerance target: H(C)=∫K(θ,Cθ)Π(dθ), Aϵ=S−1(Bϵ(s0)), and Π~ϵ(C)=Zϵ−1∫C1Aϵ(y) dH.

[F2]

Approximate Bayesian computation and the tolerance-conditioned target: with M the law of (θ,S(Y)) under the prior-simulator joint law, M(A×D)=∫AK(θ,S−1(D))Π(dθ), pϵ(s0)=M(Θ×Bϵ(s0)), and Πϵ(A∣s0)=M(A×Bϵ(s0))/pϵ(s0).

[F3]

A prior and model kernel define a joint law: for measurable A⊆Θ and D⊆Y, H(A×D)=∫AK(θ,D)Π(dθ).

Proof

Given: The hypotheses in the Statement.

1.1F1F3given

For each A∈T, [F1] and the rectangle formula [F3] give Π~ϵ(A×Y)=Zϵ−1∫AK(θ,Aϵ)Π(dθ).

2.1F1F2step 1.1algebra∎

Since Aϵ=S−1(Bϵ(s0)), [F2] gives M(A×Bϵ(s0))=∫AK(θ,Aϵ)Π(dθ) and pϵ(s0)=Zϵ; substitution into [F2] makes step 1.1 exactly Πϵ(A∣s0) for every measurable A, so the parameter marginal is the tolerance posterior.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

ABC Metropolis–Hastings on simulator-augmented states

Definition

Fix ϵ≥0 with Zϵ>0 and let Π~ϵ be the target in Augmented ABC tolerance target. The state is x=(θ,y)∈Θ×Y, a standard-Borel product by Finite products of standard Borel spaces are standard Borel, and admissible initial states satisfy y∈Aϵ. As proposal inputs take a parameter probability kernel q(θ,dθ′) and the simulator kernel K(θ′,dy′) from Augmented ABC tolerance target, such that Q((θ,y),dθ′,dy′)=q(θ,dθ′)K(θ′,dy′) is a probability kernel on the augmented state space. Construct the transition kernel Pϵ by applying Metropolis–Hastings kernel with target Π~ϵ and proposal Q. Each iteration proposes a new parameter from q, simulates new data from K, applies the general Metropolis–Hastings accepted-flow rule, and retains the current augmented state after rejection.

This definition uses one fixed tolerance and the augmented state (θ,y). It does not claim irreducibility, uniqueness of a stationary law, convergence, a mixing rate, or recovery of the full-data posterior.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Sequential ABC importance-resampling with tolerance populations

Definition

Fix a finite horizon T≥0, N≥1, a positive nonincreasing tolerance schedule ϵ0≥ϵ1≥⋯≥ϵT>0, and assume Zϵt>0 for every t. Let Π~ϵt be the normalized augmented target from Augmented ABC tolerance target. The parameter proposal at stage t is a probability kernel Qt(θ,dθ′) on Θ.

For each t≥1, write the previous weighted population as Zt−1=((θt−1i,yt−1i)i=1N,(Wt−1i)i=1N) in the standard-Borel space EN=(Θ×Y)N×[0,1]N, where [0,1] has its Borel sigma-algebra and is standard Borel because the closed interval with the Euclidean metric is Polish. Thus EN is standard Borel by Finite products of standard Borel spaces are standard Borel. Let λt−1 be the law of Zt−1 conditional on the algorithm reaching stage t, when that event has positive probability. For z=((θi,yi)i=1N,(wi)i=1N)∈EN, define the probability kernel ϕtN by ϕtN(z,B)={∑i=1NwiQt(θi,B),∑iwi=1,1N∑i=1NQt(θi,B),∑iwi≠1. For each fixed measurable B⊆Θ, z↦Qt(θi,B) and z↦wi are measurable. For nonnegative measurable u,v on EN, the superlevel sets satisfy {uv>a}=EN (a<0),{uv>a}=⋃q∈Q, q>0({u>q}∩{v>a/q}) (a≥0), so each product wiQt(θi,B) is measurable. Finite sums and scalar multiples are measurable by Closure properties of measurable functions used by the integral, making the branch condition and both branch evaluations measurable. Each branch is a convex combination of probability measures, so Measure kernel and probability kernel gives a probability kernel. The second branch only extends the kernel to ambient states outside the algorithm; every actual previous population has normalized weights and uses the proposal mixture in the first branch. Require Π≪ϕtN(z,⋅) for λt−1-almost every z at every stage that is reached with positive probability. Apply Jointly measurable Radon–Nikodym derivatives for probability kernels to the constant kernel z↦Π and the kernel ϕtN to obtain a product-measurable derivative on EN×Θ. Set its value to zero where it is infinite; since its integral is one for λt−1-almost every z, this gives a finite-valued product-measurable version rtN(z,θ)=dΠ/dϕtN(z,⋅)(θ) for almost every previous population.

At stage 0, draw (θi,yi) independently from the prior-simulator law H, and set a0i=1Aϵ0(yi). If ∑ia0i=0, stop and report finite-particle degeneracy; otherwise normalize these weights to obtain W0i and report the weighted empirical measure Π^0N=∑i=1NW0iδ(θi,yi).

For each t=1,…,T, form the proposal mixture ϕtN(⋅)=∑i=1NWt−1iQt(θt−1i,⋅). Draw N ancestor indices from the previous weights using the multinomial branch of Multinomial and residual offspring resampling. Conditional on those ancestors, independently draw one perturbed parameter from its Qt kernel and one datum from K for each child. For a candidate (θtj,ytj) set atj=1Aϵt(ytj)rtN(Zt−1,θtj). If ∑jatj=0, stop and report finite-particle degeneracy; do not report a normalized target estimate. If the sum is positive, set Wtj=atj/∑katk and report the weighted empirical measure Π^tN=∑jWtjδ(θtj,ytj).

If a stage degenerates, return that status and no normalized estimate for the stage or any later target. If every stage through T succeeds, return Π^TN; in particular, when T=0 the returned estimate is Π^0N.

The mixture support condition is stage-specific and must hold almost surely under the law of the actual previous population. The algorithm makes no finite-N accuracy, mixing, or posterior-recovery claim.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

ABC Metropolis–Hastings preserves its augmented tolerance target

Statement

Assume AC and the hypotheses of ABC Metropolis–Hastings on simulator-augmented states with Zϵ>0. Its output Pϵ is reversible with respect to and leaves invariant the augmented ABC tolerance target Π~ϵ on Θ×Y. This is invariance for the fixed tolerance target only; it gives no convergence or full-data posterior conclusion.

Facts & Assumptions

Given: AC, a standard-Borel augmented state space, ϵ≥0 with Zϵ>0, the target Π~ϵ, the simulator proposal kernel Q, and the ABC-MH procedure.

[A1]

The Axiom of Choice: AC states that every family of nonempty sets has a choice function.

[F1]

Augmented ABC tolerance target: when Zϵ>0, Π~ϵ=Zϵ−1hϵH is a probability measure on the product of the standard-Borel parameter and data spaces.

[F2]

ABC Metropolis–Hastings on simulator-augmented states: the algorithm applies Metropolis–Hastings kernel with target Π~ϵ and proposal probability kernel Q, retaining rejected proposals as self-transitions.

[F3]

Metropolis–Hastings flow is reversible and invariant: under AC, for a standard-Borel space, probability target, and probability proposal kernel, the general Metropolis–Hastings output is reversible with respect to and leaves invariant its target.

Proof

Given: The hypotheses in the Statement.

1.1F1F2given

By [F1], Π~ϵ is a probability target on the product state space; by [F2], the proposal is a probability kernel and the returned kernel is exactly the general Metropolis–Hastings output for this target and proposal.

2.1A1F1F2F3step 1.1∎

The state space is standard Borel and [A1] supplies AC, so [F3] applies to the target and proposal identified in step 1.1; it gives reversibility and invariance of Pϵ with respect to Π~ϵ, with no irreducibility or convergence assertion.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Sequential ABC Radon–Nikodym weights target each tolerance law

Statement

Assume the setup of Sequential ABC importance-resampling with tolerance populations and put γt(dθ,dy)=Π(dθ)K(θ,dy)1Aϵt(y),πt=γt/Zϵt=Π~ϵt. For a measure μ, write μ(f)=∫f dμ for bounded nonnegative measurable f. For every bounded nonnegative product-measurable f:Θ×Y→[0,∞), let X0j=(Θ0j,Y0j), 1≤j≤N, be the initial N independent prior-simulator draws with law H and weights a0j=1Aϵ0(Y0j) satisfy E ⁣[1N∑j=1Na0jf(X0j)]=γ0(f). For each 1≤t≤T reached with positive probability, let Zt−1=((Θt−1i,Yt−1i)i=1N,(Wt−1i)i=1N) be the previous population and let λt−1 be its law conditional on reaching stage t. Use the standard-Borel population space and probability kernel ϕtN(z,⋅) from Sequential ABC importance-resampling with tolerance populations, and assume Π≪ϕtN(z,⋅) for λt−1-almost every z. The kernel Radon–Nikodym lemma Jointly measurable Radon–Nikodym derivatives for probability kernels then supplies a product-measurable derivative; use the finite-valued version specified in Sequential ABC importance-resampling with tolerance populations after changing infinite values to zero. Write this version as rtN(z,θ)=dΠ/dϕtN(z,⋅)(θ) for almost every z. Put atj=1Aϵt(Ytj)rtN(Zt−1,Θtj) for the candidates produced by multinomial ancestor resampling, perturbation, and simulation. For every bounded nonnegative product-measurable f:Θ×Y→[0,∞), E ⁣[1N∑j=1Natjf(Θtj,Ytj) | previous population]=γt(f)almost surely on reaching stage t. In particular, the average weight is conditionally unbiased for Zϵt. If candidates with positive total weight are resampled by the multinomial or residual scheme from normalized weights, then for every bounded measurable f their conditional empirical mean equals the weighted candidate empirical mean in expectation. No unbiasedness is asserted for the self-normalized finite-N estimate, and a finite sample may have zero total weight or fail to represent positive target mass.

Facts & Assumptions

Given: AC, a prior Π, simulator probability kernel K, tolerance event Aϵt, a previous weighted population, mixture ϕtN, Π≪ϕtN, and Zϵt>0.

[A1]

The Axiom of Choice: AC states that every family of nonempty sets has a choice function.

[F1]

Augmented ABC tolerance target: the unnormalized augmented target is γt=Π(dθ)K(θ,dy)1Aϵt(y) with normalizer Zϵt>0 and normalized target πt=γt/Zϵt.

[F2]

Sequential ABC importance-resampling with tolerance populations: the initial draws use H with indicator weights; later stages use multinomial ancestor-resampling, perturbation, simulation, the tolerance indicator, and a product-measurable prior-to-mixture derivative evaluated at the previous population and candidate parameter. Its stage-specific support condition holds almost surely under the population law.

[F3]

Jointly measurable Radon–Nikodym derivatives for probability kernels: for probability kernels M,R on standard-Borel spaces, if M(z,⋅)≪R(z,⋅) for λ-almost every z, there is a product-measurable density that represents dM(z,⋅)/dR(z,⋅) for almost every z.

[F4]

For this joint density h, the section identity at B=Θ gives ∫h(z,θ) ϕtN(z,dθ)=1 for almost every z. Thus the set where h(z,⋅)=+∞ is ϕtN(z,⋅)-null there, and setting h to zero on its product-measurable infinite-value set gives a finite-valued product-measurable density version.

[F5]

Integrating against a Radon-Nikodym derivative recovers integration against the measure: if r=dΠ/dϕ, then Π(B)=∫Br dϕ for every measurable B; finite simple-function integration follows by finite addition.

[F6]

Every nonnegative measurable function is the increasing limit of simple measurable functions and Monotone convergence for the integral: every nonnegative measurable function is an increasing limit of simple functions, and integrals pass to that limit.

[F7]

Multinomial and residual offspring resampling: the resampling procedure returns a length-N ancestor list encoded by its offspring counts.

[F8]

Multinomial and residual resampling have unbiased offspring counts: conditional on input weights, each offspring count has expectation N times its normalized input weight.

[F9]

A prior and model kernel define a joint law: the prior and simulator kernel define a probability measure on Θ×Y and integrate nonnegative product-measurable functions by iterated integration.

[F10]

Measurability of integration against a kernel: integrating a nonnegative product-measurable function against a probability kernel gives a measurable section integral.

[F11]

Closure properties of measurable functions used by the integral: finite sums, scalar multiples, and products of measurable functions with measurable indicators remain measurable.

Proof

Given: The hypotheses in the Statement.

1.1F1givenalgebra

Each initial draw X0j has law H and weight a0j=1Aϵ0(Y0j), so definition of γ0 gives E[a0jf(X0j)]=∫f1Aϵ0 dH=γ0(f); linearity of the finite average proves the identity.

1.2A1F1F3F4F5F6F9F10F11given

Fix t with positive probability of reaching stage t, and let λt−1 be the conditional law of the previous population. By [F3], the constant kernel z↦Π and the proposal-mixture kernel ϕtN have a product-measurable density h(z,θ); by [F4], its finite version rtN(z,θ) is a derivative for λt−1-almost every z. By [F10], gf(θ)=∫Y1Aϵt(y)f(θ,y)K(θ,dy) is measurable and bounded. Choose simple functions sn↑gf by [F6]; each sn is a finite sum of measurable indicators, so sn(θ)rtN(z,θ) is measurable by [F11]. For almost every z, applying the setwise RN identity [F5] to the level sets of sn gives ∫sn(θ)rtN(z,θ) ϕtN(z,dθ)=∫sn dΠ. Since rtN is finite and nonnegative, [F6] and monotone convergence give ∫gf(θ)rtN(z,θ) ϕtN(z,dθ)=∫gf dΠ. The right side is ∫f1Aϵt dH=γt(f) by the iterated-integral formula [F9] and target definition [F1]. Thus the one-candidate conditional proposal expectation equals γt(f) for λt−1-almost every previous population.

2.1F2F8step 1.2algebra

Given parent i, each child has law Qt(θt−1i,dθ)K(θ,dy); the multinomial expected count is NWt−1i by [F8]. Conditional on the previous population z, summing contributions over parents and dividing by N gives the one-candidate expectation under ϕtN(z,dθ)K(θ,dy) with weight 1Aϵt(y)rtN(z,θ). Step 1.2 makes this γt(f) for λt−1-almost every z, proving the conditional identity.

3.1F2F7F8algebra∎

For candidate weights aj=1Aϵt(yj)rtN(Zt−1,θj) with ∑jaj>0, [F8] gives conditional offspring-count means Naj/∑kak; hence for bounded measurable f, E[1N∑jCjf(θtj,ytj)∣(θti,yti,ai)i=1N]=∑jajf(θtj,ytj)/∑kak, the weighted empirical mean. If the total weight is zero, [F2] reports degeneracy and makes no normalized-target claim.

5 · Examples, counterexamples and false statements

None yet.

Sources