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

Conditional multinomial resampling central limit theorem

Statement

Fix a time t in the finite-horizon SIR system of Finite-horizon SMC CLT classes and variance recursions. Let ωtN be its corrected weighted empirical law and let ηˇtN be the empirical law after multinomial offspring resampling. Suppose πt(ϕ2)<∞, the empirical-law conclusions of Finite-horizon SMC empirical laws converge for integrable tests hold, and N{ωtN(ϕ)−πt(ϕ)}⇒N(0,V) for a finite V≥0. Then N{ηˇtN(ϕ)−ωtN(ϕ)}⇒N(0,Var⁡πt(ϕ)), asymptotically independently of the weighted-estimator fluctuation, and N{ηˇtN(ϕ)−πt(ϕ)}⇒N ⁣(0,V+Var⁡πt(ϕ)).

Facts & Assumptions

Given: The corrected weighted empirical law, the multinomial selection rule, the target second-moment condition πt(ϕ2)<∞, and the weighted-estimator CLT in the Statement.

[A1]

The Axiom of Choice: AC is inherited through the finite-horizon particle-law construction and the cited probability limit theorem.

[F1]

Finite-horizon SMC CLT classes and variance recursions: the target variance is πt((ϕ−πtϕ)2) for a target-square-integrable test. The Statement assumes this second-moment domain.

[F2]

Multinomial and residual offspring resampling: Conditional on the corrected particles, multinomial offspring are IID draws from ωtN.

[F3]

Finite-horizon SMC empirical laws converge for integrable tests: For every πt-integrable test h, ωtN(h)→πt(h) in probability.

[F4]

Lindeberg-Feller central limit theorem: sufficiency: A centered independent triangular array with positive total variance and the Lindeberg condition, divided by its row standard deviation, converges to N(0,1).

[F5]

Chebyshev's inequality for random variables: For a square-integrable variable on any probability space, the probability of an absolute centered deviation at least a>0 is at most its variance divided by a2.

[F6]

Slutsky's theorem for real random variables: Multiplying a distributionally convergent real variable by one converging in probability to a constant gives the scaled limit.

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2F3given

Let FN contain the corrected particles and their weights. By [F2], conditionally on FN the selected values Y1N,…,YNN are IID with law ωtN. Their centered conditional variance is sN2=ωtN(ϕ2)−ωtN(ϕ)2, which converges in probability to s2=Var⁡πt(ϕ) by [F1] and [F3].

2.1F1F2F3step 1.1givenalgebra

Put mN=ωtN(ϕ) and ξiN=ϕ(YiN)−mN. By [F3], mN→πtϕ in probability, hence mN=OP(1). For a fixed threshold a>0, choose fixed K and then R≥K. On {∣mN∣≤K} and for all sufficiently large N with aN>R+K, the event ∣ϕ(YiN)−mN∣>aN implies ∣ϕ(YiN)∣>R, and ∣ϕ(YiN)−mN∣2≤4ϕ(YiN)2 there. Thus the conditional Lindeberg sum is at most 4ωtN(ϕ21{∣ϕ∣>R}) on that event. For fixed R, [F3] makes this upper bound converge to 4πt(ϕ21{∣ϕ∣>R}), which tends to zero as R→∞ by the finite target second moment. Given any error probability, first choose K so that the probability of ∣mN∣>K is small, then choose R≥K with this tail integral small, and finally let N→∞. This proves that the conditional Lindeberg sum tends to zero in probability using only target L2.

3.1F4F5F6step 1.1step 2.1

Along any subsequence, choose a further subsequence on which sN→s almost surely. If s>0, then eventually sN>s/2; the normalized Lindeberg sum for draws divided by sNN is bounded by step 2.1 at threshold as/2, divided by sN2. It therefore tends to zero in probability, and a further subsequence makes that convergence almost sure. Apply [F4] to obtain a standard-normal limit for the normalized row. Slutsky [F6] with sN→s gives convergence of the conditional characteristic function of N−1/2∑iξiN to e−u2s2/2. If s=0, conditional [F5] gives P(∣N−1/2∑iξiN∣>a∣FN)≤min⁡(1,sN2/a2)→0, giving the degenerate characteristic-function limit. The subsequence criterion therefore gives convergence in probability of these conditional characteristic functions along the full sequence.

4.1step 3.1givenalgebra∎

The conditional characteristic functions are bounded by one, so their differences from e−u2s2/2 converge to zero in L1. For arbitrary real v,u, multiply the conditional resampling characteristic function at u by the bounded factor eivN(ωtN(ϕ)−πt(ϕ)) and take expectations. The resulting joint characteristic function tends to e−v2V/2e−u2s2/2. Thus the resampling fluctuation is asymptotically independent of the weighted fluctuation, and their sum has variance V+s2.

Depends on

Used by

Dependency tree · two levels

29 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