Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge 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.

Vanishing acceptance probability with a stable zero-tolerance target

Statement

Let Θ={0,1} have equal prior probabilities and let Y∣θ be uniform on [θ,θ+1]. With identity summary and observed value s0=1/2, the ABC acceptance probability equals ϵ for 0<ϵ<1/2, so it tends to zero, while every such ABC target is δ0 and the density-selected zero-tolerance posterior is also δ0.

Facts & Assumptions

Given: Countable Choice and the model, ABC target, and rejection conventions in Approximate Bayesian computation and the tolerance-conditioned target and ABC rejection sampling.

[F1]

The measure with a nonnegative measurable density is defined by integration. The measure with density f relative to μ, The indefinite integral of a nonnegative measurable function is a measure

[F3]

A Polish presentation is separable and has a compatible complete metric; the Borel sigma-algebra is generated by its open sets. Standard Borel spaces, Polish spaces are separable completely metrizable spaces, Separability: the existence of an at most countable dense subset, The Borel sigma-algebra of a topological space

[F4]

Countable Choice is the axiom assumed by the density-limit result invoked below. The Axiom of Countable Choice (ACω)

[F5]

Positive-tolerance ABC conditions the prior-predictive law on its tolerance event, and rejection returns that target. Approximate Bayesian computation and the tolerance-conditioned target, ABC rejection returns the tolerance-conditioned posterior

[F6]

Under Countable Choice, the zero-tolerance theorem identifies the density-selected limit when the specified version is continuous at the observed summary and has an integrable local envelope and positive finite averaged density. ABC targets the density-defined summary posterior at zero tolerance

Example

Take Θ={0,1} with prior Π({0})=Π({1})=1/2, data space R, summary S(y)=y, and densities m0(s)=1[0,1](s),m1(s)=1[1,2](s).

Verification

Given: The model, prior, and densities in the Example.

1.1givenF1F2F3construct

Give Θ its discrete metric. Since Cauchy means that tail distances are eventually below every positive radius, a Cauchy sequence is eventually constant at radius 1/2, so the metric is complete; the finite set is countable and dense in itself, and its singletons are open. Its Borel sigma-algebra is the power set, so [F3] gives standard Borelness. By [F2], the usual metric on R is complete and has countable dense subset Q; its balls are ordinary intervals, so it induces the usual topology. Thus both the data and summary Borel spaces are standard Borel by [F3]. Each displayed density is nonnegative measurable and integrates to one because its supporting interval has length one. Thus K(θ,ds)=mθ(s) ds is a probability kernel on the finite parameter space, and the identity summary is measurable. For every product-measurable E⊆Θ×R, the section maps s↦(θ,s) are measurable, so Eθ={s:(θ,s)∈E} is measurable, and E=⨆θ∈Θ{θ}×Eθ. Since Θ is finite, the rectangle identity extends by this finite disjoint decomposition to M(E)=∑θ∈ΘΠ({θ})∫Eθmθ(s) ds=∫Emθ(s) (Π×λ1)(dθ,ds). Thus the finite-parameter summary-predictive law has the specified joint density required by the zero-tolerance theorem.

2.1givenF1F5step 1.1algebra

For 0<ϵ<1/2, the tolerance ball about 1/2 is [1/2−ϵ,1/2+ϵ]. Its intersection with [0,1] has length 2ϵ, while it is disjoint from [1,2] because its upper endpoint is strictly below 1. The parameter-conditional acceptance probabilities are therefore 2ϵ at 0 and 0 at 1. Averaging against the equal prior gives pϵ=ϵ>0, and conditioning gives ABC target δ0. In particular pϵ→0. By [F5], the accepted parameter also has law δ0.

2.2givenF6step 1.1

On the neighborhood [1/4,3/4] of s0=1/2, m0 is identically 1 and m1 is identically 0. Both densities are continuous at s0, and the constant envelope H(θ)=1 is integrable under Π. The averaged density is z0=12m0(1/2)+12m1(1/2)=1/2, so the density-selected posterior is δ0.

3.1givenF4F6step 2.1step 2.2∎

The hypotheses of [F6] hold under the Countable Choice assumption [F4] (with, for example, neighborhood radius 1/4), so the ABC targets converge in total variation to δ0 as ϵ↓0. Here step 2.1 shows the stronger exact identity Πϵ=δ0 for every 0<ϵ<1/2, even though the acceptance probability vanishes.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

114 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