Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Finite partition-ratio estimator and overlap variance

Statement

Let X be a finite nonempty set equipped with counting measure. For a∈{0,1}, let wa:X→(0,∞) be a finite positive weight, define Za=∑x∈Xwa(x), and define the probability mass function πa(x)=wa(x)/Za. For an integer n≥1, let X1,…,Xn be independent random variables with common law π0. Define R(x)=w1(x)/w0(x), r^n=n−1∑j=1nR(Xj), and χ2(π1∥π0)=∑x∈Xπ0(x)(π1(x)/π0(x)−1)2. Then

Eπ0[r^n]=Z1Z0,Var⁡π0(r^n)(Z1/Z0)2=χ2(π1∥π0)n.

The estimator uses only the finite raw-weight ratios w1(Xj)/w0(Xj); the partition sums define the target ratio and probability laws but are not inputs to its computation.

Facts & Assumptions

Given: The finite nonempty state set, strictly positive finite weights w0,w1, their finite normalizing sums Z0,Z1, and independent samples Xj∼π0.

[F1]

Ordinary importance sampling: for an unnormalized target p~, proposal density q, integrand f, and target normalizer Zp, the weighted value is fp~/(Zpq) on q>0 and zero otherwise. Its support and integrability conditions are explicit, and its normalizing constant Zp is a known input to that algorithm.

[F2]

Ordinary importance sampling has finite variance and a CLT under a weighted second moment: under the ordinary importance-sampling hypotheses and finite weighted second moment, the finite-sample variance is the variance of one weighted value divided by n; the finite-sample conclusion is choice-free.

Proof

Given: [F1], [F2], and the finite positive weights and IID π0 sample in the Statement.

1.1F1givenalgebra

Put R=w1/w0. Finite summation gives Eπ0R=∑x(w0(x)/Z0)(w1(x)/w0(x))=Z1/Z0. Since w0(x),w1(x)>0 on every point of X, the formal ordinary-importance-sampling setup with counting measure, p~=w1, q=π0, f≡1, and Zp=Z1 has full support and finite weighted second moment. Its weighted value is Y=(Z0/Z1)R=π1/π0, and finite summation gives Eπ0Y=(Z0/Z1)Eπ0R=1. Here Z1 is used only to identify this mathematical random variable; it is not supplied to or computed by the raw-weight ratio estimator.

2.1F2givenstep 1.1algebra

Apply [F2] to this formal weighted variable with mean 1 from step 1.1. It gives Var⁡(Y‾n)=n−1(Eπ0[Y2]−1). Since Y‾n=(Z0/Z1)r^n, rescaling gives Var⁡(r^n)/(Z1/Z0)2=n−1(∑xπ0(x)(π1(x)/π0(x))2−1).

3.1givenstep 2.1algebra∎

The probability masses sum to one, so expanding the square gives χ2(π1∥π0)=∑xπ0(x)(π1(x)/π0(x))2−2∑xπ1(x)+∑xπ0(x)=∑xπ0(x)(π1(x)/π0(x))2−1. Substitution into step 2.1 proves the variance identity.

Remarks

The proof uses the ordinary importance-sampling variance identity only after symbolically normalizing the target. It does not treat the ordinary importance-sampling algorithm, whose contract requires a known target normalizer, as a procedure for computing an unknown partition ratio.

Depends on

Dependency tree · 2 levels

Sources