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.

Finite-horizon SMC empirical laws converge for integrable tests

Statement

Use the finite-horizon target, proposal and mutation sequence of Finite-horizon SMC CLT classes and variance recursions, and run the SIR procedure of Sequential importance resampling for Feynman–Kac path targets with either multinomial or residual resampling at every selection. Let Xt1:N be the proposal particles after mutation and before correction, let ηtN=N−1∑i=1NδXti, and let ωtN=∑i=1Nυt(Xti)δXti∑i=1Nυt(Xti) when the denominator is positive, using the algorithm's uniform fallback otherwise. Let ηˇtN be the empirical probability measure of one offspring selection from ωtN; for nonterminal times this is the population carried into the next mutation. For each fixed t≤T, ηtN(h)→Pπ~t(h)(h∈L1(π~t)),ωtN(ϕ)→Pπt(ϕ),ηˇtN(ϕ)→Pπt(ϕ)(ϕ∈L1(πt)) as N→∞. The terminal selection in ηˇtN is an auxiliary resampling output; it is not an extra finite-particle accuracy claim.

Facts & Assumptions

Given: AC, the finite-horizon target/proposal flow, the sequential SIR mutation/correction/selection procedure, and one of the two stated offspring laws.

[A1]

The Axiom of Choice: AC is the choice principle assumed by the finite-horizon path-law and particle-law construction.

[F1]

Finite-horizon SMC CLT classes and variance recursions: π~t=πt−1kt, π~t(υt)=1, and πt(dz)=υt(z)π~t(dz).

[F2]

Sequential importance resampling for Feynman–Kac path targets: Particles are initially sampled from the proposal; each later mutation is conditionally independent given the selected parents; correction uses the incremental Radon–Nikodym weights; either named resampling scheme may be selected.

[F3]

Multinomial and residual resampling have unbiased offspring counts: Conditional expected offspring counts equal N times the normalized input weights.

[F4]

Khinchin weak law for integrable IID variables: IID integrable real variables have sample means converging in probability to their expectation.

[F5]

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

[F6]

Markov's inequality for random variables: For any nonnegative random variable Z on a probability space and a>0, P(Z≥a)≤E[Z]/a.

[F7]

Ionescu-Tulcea construction of a Markov chain: The finite sequence of probability kernels defining the particle procedure determines its ordered joint law and conditional kernel factors under AC.

[F8]

Measurability of integration against a kernel: Integrating a measurable nonnegative function against a probability kernel gives a measurable section integral.

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2F4F7given

At time 0, [F2] and the finite particle law [F7] give IID proposal particles with law π~0. For h∈L1(π~0), [F4] gives η0N(h)→π~0(h). If ϕ∈L1(π0), then υ0ϕ is integrable under π~0 and its integral is π0(ϕ) by [F1]; also π~0(υ0)=1. Applying [F4] to numerator and denominator and dividing on the event that the denominator is positive gives ω0N(ϕ)→π0(ϕ). That event has probability tending to one because the denominator average converges to 1.

1.2A1F1F2F5F7F8given

Fix t≥1 and suppose the three convergences hold at t−1. First let h be bounded. By [F2] and [F7], conditional on the selected parents, the Xti are independent with laws kt(Xˇt−1i,⋅); measurability of kth follows from [F8]. Thus ηtN(h)−ηˇt−1N(kth) has conditional mean zero and conditional variance at most ∥h∥∞2/N. By [F5] this difference tends to zero in probability. Since kth is bounded and πt−1(kth)=π~t(h) by [F1], the induction hypothesis proves ηtN(h)→π~t(h).

2.1F3F5F6step 1.1algebra

The selected-law base at time zero follows as well. For bounded ϕ, [F3] makes the conditional selected mean equal to ω0N(ϕ). Under multinomial selection its conditional variance is at most ∥ϕ∥∞2/N; under residual selection the deterministic floor counts have no variance and the at most N remaining categorical draws give the same bound. By [F5] and step 1.1, ηˇ0N(ϕ)→π0(ϕ) in probability. For integrable ϕ, truncate at M. The conditional expected selected average of ∣ϕ∣1{∣ϕ∣>M} is its weighted empirical average by [F3], which converges to the target tail integral by step 1.1. Conditional Markov [F6], using P(tail average>ϵ)≤E[min⁡(1,ω0N(tail)/ϵ)] and bounded continuity of x↦min⁡(1,x/ϵ), makes the limiting tail probability vanish as M→∞. Combining with the bounded truncations proves the selected convergence for all π0-integrable tests.

2.2A1F1F2F6F7F8step 1.2

For general h∈L1(π~t), let hM=h1{∣h∣≤M}. The conditional mean of ηtN(∣h−hM∣) is YN=ηˇt−1N(kt∣h−hM∣), measurable by [F8]. The function inside this last empirical average is integrable under πt−1 and its integral is aM=π~t(∣h−hM∣). The induction hypothesis gives YN→aM in probability. Conditional Markov [F6] bounds P(ηtN(∣h−hM∣)>ϵ) by E[min⁡(1,YN/ϵ)]. For fixed M, bounded continuity of y↦min⁡(1,y/ϵ) and convergence in probability to the constant aM imply that this expectation tends to min⁡(1,aM/ϵ): for any η>0, split on ∣YN−aM∣≤η and its complement, use continuity on the first event and convergence in probability on the second. Since aM→0 by integrability, the limiting tail probability vanishes. Applying the same truncation to the target integral and combining with step 1.2 proves the proposal empirical convergence for every integrable h.

3.1F1F2step 2.2algebra

Apply step 2.2 to h=υt and h=υtϕ, where ϕ∈L1(πt). Their limiting integrals are 1 and πt(ϕ) by [F1]. The ratio consequently converges to πt(ϕ) whenever its denominator is positive; the denominator-zero event has probability tending to zero because its normalized sum converges to 1. The uniform fallback in [F2] on that event cannot change convergence in probability.

4.1F3F5step 3.1

For bounded ϕ, the conditional expectation of ηˇtN(ϕ) is ωtN(ϕ) by [F3]. In multinomial resampling the conditional variance is at most ∥ϕ∥∞2/N. In residual resampling the deterministic floor counts contribute no variance, and the remaining R≤N categorical draws give conditional variance at most ∥ϕ∥∞2/N as well. Chebyshev [F5] and step 3.1 prove ηˇtN(ϕ)→πt(ϕ) for bounded ϕ.

5.1F3F6step 3.1step 4.1

For ϕ∈L1(πt), truncate to ϕM=ϕ1{∣ϕ∣≤M}. By [F3], the conditional expected selected average of ∣ϕ−ϕM∣ is exactly ωtN(∣ϕ−ϕM∣). Step 3.1 applied to this integrable tail and conditional Markov [F6] make the limiting probability of a tail deviation at most min⁡(1,πt(∣ϕ−ϕM∣)/ϵ), which tends to zero as M→∞. Combining with step 4.1 proves the selected empirical convergence for all integrable ϕ.

6.1step 1.1step 2.1step 1.2step 2.2step 3.1step 4.1step 5.1∎

Steps 1.2, 2.2, 3.1, 4.1, and 5.1 establish the induction step from t−1 to t. Steps 1.1 and 2.1 give the base case, so the assertions hold for every fixed finite time. No conclusion is uniform in t.

Depends on

Used by

Dependency tree · two levels

36 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