Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Rejection sampling has the target acceptance law

Statement

Let (S,S,μ) be a measure space and let f~,g~:S→[0,∞] be measurable with 0<Zf:=∫f~ dμ<∞ and 0<Zg:=∫g~ dμ<∞. Suppose c>0 is finite and f~≤cg~ μ-almost everywhere. Apply Rejection sampling with proposal law G(A)=Zg−1∫Ag~ dμ. If N is the first accepted proposal, then N<∞ almost surely, the per-proposal acceptance probability is p=ZfcZg, and for every A∈S, P(YN∈A)=1Zf∫Af~ dμ. Thus the accepted law has density f~/Zf. In the normalized case Zf=Zg=1, this gives acceptance probability 1/c and accepted density f; necessarily c≥1.

Facts & Assumptions

Given: The measure space, nonnegative measurable shapes, positive finite normalizers, a finite envelope constant, and the ideal independent draws in Rejection sampling.

[A1]

The common envelope holds outside a measurable μ-null set. The algorithm's ratio is defined to be zero where g~=0.

[F1]

Rejection sampling and Identical distribution and IID families: the proposal draws have law G, the auxiliary draws have the uniform law on (0,1), and the two IID sequences are independent.

[F2]

The measure with density f relative to μ and Probability measures and probability spaces: a nonnegative measurable density h defines the measure A↦∫Ah dμ; if its total mass is Z∈(0,∞), division by Z gives a probability measure.

[F3]

A nonnegative measurable function with finite integral is finite almost everywhere: finite nonnegative integral implies the function is finite almost everywhere.

[F4]

The nonnegative Lebesgue integral and The integral of a nonnegative simple function define the nonnegative integral by simple minorants and the simple integral by level-set measures; Additivity of the nonnegative Lebesgue integral gives additivity for extended nonnegative measurable functions.

[F5]

Expectation of a nonnegative or integrable random variable and Change of variables for expectation: the expectation of a nonnegative measurable indicator is its probability, and expectations of nonnegative measurable functions equal their integrals against the random element's law.

[F6]

Independent random elements have product joint law: independent random elements have joint law equal to the product of their marginal laws.

[F7]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: a nonnegative product-measurable function on a product of probability spaces can be integrated in either order.

[F8]

Integrating against a density agrees with integrating the product: if ν=h dμ, then ∫q dν=∫qh dμ for every nonnegative measurable q.

[F9]

Rejection sampling, The product sigma-algebra and its finite iterates, Arithmetic and lattice operations preserve measurability whenever they are defined, Composition with a Borel measurable outer map preserves measurability, and Threshold characterisations of real-valued and extended-real-valued measurability: the algorithm proves its reciprocal extension Borel and its acceptance function measurable; the coordinate projections on S×(0,1) are measurable, and {(y,u):y∈A, u≤a(y)} is a measurable threshold set.

[F10]

Monotonicity and nonnegative homogeneity of the nonnegative integral: pointwise order of nonnegative functions implies the same order of their integrals.

[F11]

Measures on sigma-algebras: a measure is countably additive on disjoint measurable sequences.

[F13]

Law or distribution of a random element: the law of a random element assigns to each measurable set the probability of its inverse image.

Proof

Given: The objects and hypotheses in the Statement.

1.1A1F3F4F9F11F13givenconstruct

By [F3], both shapes are finite outside null sets. Let E0 be the measurable null union of those sets and the envelope exception from [A1]. For any nonnegative measurable h supported on E0, every simple minorant has all its positive level sets contained in E0, so its simple integral is zero; hence ∫h dμ=0 by [F4]. For either shape h and any measurable A, the decomposition h1A=h1A∖E0+h1A∩E0 and additivity [F4] therefore give ∫Ah dμ=∫Ah1S∖E0 dμ. Products here use 0⋅∞=0, and are measurable by [F9]. Replace each shape by h1S∖E0; neither density measure nor any displayed integral changes. In particular G(E0)=0. By [F13] and countable additivity [F11], the probability that any proposal hits E0 is zero; changing the acceptance rule there leaves the output law unchanged. The new shapes are finite and satisfy f~≤cg~ everywhere, so g~=0 implies f~=0.

1.2F1F5F6F9F13given

Fix A∈S and let Q(A):=P(Y1∈A, U1≤a(Y1)). By [F9] the event is measurable. By [F1] and [F6] the joint law of (Y1,U1) is G⊗Λ. Hence [F5] and [F13] give Q(A)=∫S×(0,1)1A(y)1{u≤a(y)} (G⊗Λ)(d(y,u)).

2.1step 1.2F7F1

Tonelli [F7] evaluates the last integral as Q(A)=∫AΛ((0,a(y)]) G(dy)=∫Aa(y) G(dy), including a(y)=0 and a(y)=1, since Λ((0,t])=t on [0,1].

3.1step 2.1F2F8step 1.1algebra

Apply [F8] to the proposal density g~/Zg and the measurable function 1Aa. Where g~>0, the envelope makes a=f~/(cg~); where g~=0, [step 1.1] gives f~=0. Therefore Q(A)=1Zg∫Aag~ dμ=1cZg∫Af~ dμ.

4.1step 3.1F10A1algebra

Taking A=S in step 3.1 gives p=Q(S)=Zf/(cZg)>0. Integrating the pointwise envelope and using [F10] gives Zf≤cZg, so p≤1. For normalized densities, Zf=Zg=1, hence p=1/c and c≥1.

5.1step 4.1F1F12

Put q=1−p. Independence of the proposal-uniform pairs [F1] gives P(N>m)=qm for every m≥1. Since 0≤q<1, [F12] gives qm→0; the event {N=∞} is contained in every {N>m}, so P(N=∞)=0.

6.1step 2.1step 4.1step 5.1F1F11F12algebra∎

For each k≥1, independence across trials gives P(N=k, Yk∈A)=qk−1Q(A). These events are disjoint, so countable additivity [F11] and the geometric series [F12] yield P(the algorithm outputs a value in A)=∑k=1∞qk−1Q(A)=Q(A)p=1Zf∫Af~ dμ. The almost-sure termination in step 5.1 makes this the full output law.

Depends on

Used by

Cited to discharge well-definedness by Rejection sampling.

Dependency tree · two levels

83 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