Alphabeta Math
Pipeline-generated
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 error, CLTs, and degeneracy

1 · Prerequisites

2 · Summary

Objective

Give the finite-horizon empirical-law and particle-count CLTs for sequential importance resampling, with multinomial selection and the residual-selection branch where finite-sample floor counts have a stable limit. State the source weighted-moment class and the recursive target-second-moment conditions needed for the post-resampling CLTs. The page records the exact variance recursions and separate time-uniform asymptotic-variance bounds under actual uniform incremental weights and multistep centered-image control. A proved last-state filtering branch uses positive finite density versions, true-transition mixing, bounded likelihood, target/proposal domination and an initial-weight bound. Weighted-only initialization needs only an L2 centered numerator and a normalized L1 denominator; recursively selected outputs retain the stated stronger target-moment conditions. It makes no finite-particle accuracy claim uniform in time.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Dobrushin contraction coefficient for a probability kernel

Definition

Let (S,Σ) and (E,E) be measurable spaces with S≠∅, and let K:S⇝E be a probability kernel as in Measure kernel and probability kernel. Its Dobrushin contraction coefficient is δ(K):=sup⁡x,x′∈S∥K(x,⋅)−K(x′,⋅)∥TV, where ∥⋅∥TV is the event-supremum distance between probability laws in Total variation distance for probability laws. Thus 0≤δ(K)≤1. The coefficient measures the largest total-variation separation between two one-step output laws.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Uniform density ratios bound the Dobrushin coefficient

Statement

Let K:S⇝E be a probability kernel on a nonempty measurable source space. Suppose a sigma-finite measure λ on E and probability densities kx satisfy K(x,A)=∫Akx dλ for every x∈S and measurable A⊆E. If C≥1 and, for every x,x′∈S, kx(z)≤Ckx′(z) for λ-almost every z, then the Dobrushin coefficient from Dobrushin contraction coefficient for a probability kernel obeys δ(K)≤1−C−1.

Facts & Assumptions

Given: The probability kernel, common dominating measure, normalized densities, and pairwise density-ratio bound in the Statement.

[F1]

Dobrushin contraction coefficient for a probability kernel: δ(K) is the supremum over x,x′ of the event-supremum total-variation distance between K(x,⋅) and K(x′,⋅).

[F2]

Total variation distance for probability laws: For probability measures P,Q, ∥P−Q∥TV=sup⁡A∣P(A)−Q(A)∣.

Proof

Given: The hypotheses in the Statement.

1.1givenalgebra

Fix x,x′∈S and write p=kx, q=kx′. The assumed ordered-pair bound gives p≤Cq almost everywhere, so q≥p/C. Where p≤q, min⁡(p,q)=p≥p/C; where p>q, the same inequality p≤Cq gives min⁡(p,q)=q≥p/C. Hence ∫min⁡(p,q) dλ≥C−1∫p dλ=C−1.

2.1F1F2step 1.1algebra

Let A+={z:p(z)≥q(z)}. For every measurable A, ∣∫A(p−q) dλ∣≤∫(p−q)+ dλ. Since ∫(p−q)=0, the positive and negative parts have equal integral, and ∫(p−q)+ dλ=1−∫min⁡(p,q) dλ; equality is attained at A+. Thus [F2] gives ∥K(x,⋅)−K(x′,⋅)∥TV=1−∫min⁡(p,q) dλ≤1−C−1 by step 1.1.

3.1F1step 2.1∎

The bound in step 2.1 holds for every pair x,x′, so taking their supremum in [F1] proves δ(K)≤1−C−1.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-horizon SMC CLT classes and variance recursions

Definition

Fix a finite horizon T. At each 0≤t≤T, let πt be a probability law on a measurable particle space Θt. Let π~0 be an initial proposal with π0≪π~0, and fix υ0=dπ0/dπ~0. For 1≤t≤T, let kt be a probability kernel from Θt−1 to Θt, and put π~t(A)=∫Θt−1kt(x,A) πt−1(dx). Assume πt≪π~t and fix a nonnegative Radon–Nikodym version υt=dπt/dπ~t, so π~t(υt)=1. The BCS-41 sequential importance-resampling algorithm Sequential importance resampling for Feynman–Kac path targets is this scheme on path spaces when kt appends a proposal transition. Under the support and measurable versions of Feynman–Kac path Radon–Nikodym weight, its normalized incremental weight is υt=(Zt−1/Zt)Gtrt for t≥1, and υ0=G0ρ0/Z0 initially. The previous normalized target is already part of π~t; one does not multiply by the full earlier path-weight product again.

For a measurable vector function ϕ:Θt→Rd, write μ(ϕ)=∫ϕ dμ and Cov⁡μ(ϕ)=∫(ϕ−μ(ϕ))(ϕ−μ(ϕ))⊤ dμ, when the second moment is finite. Also write ktϕ(x)=∫ϕ(z)kt(x,dz) and Cov⁡kt(ϕ)(x)=∫(ϕ(z)−ktϕ(x))(ϕ(z)−ktϕ(x))⊤kt(x,dz).

The source recursive test classes are Φ0(d)={ϕ:π~0(∥ϕ∥2)<∞}, and, for t≥1, Φt(d)={ϕ: for some δ>0, π~t(∥υtϕ∥2+δ)<∞  and  x↦kt(υtϕ)(x)∈Φt−1(d)}. Assume 1∈Φt(1) for every t. This is the source theorem's explicit normalizing-weight condition. For the recursive post-resampling CLTs proved on this page, use the stronger classes Ψt(d). At t=0, let Ψ0(d) consist of the ϕ∈Φ0(d) for which π~0(∥υ0(ϕ−π0(ϕ))∥2)<∞ and π0(∥ϕ∥2)<∞. The initial normalizing denominator needs only its finite first moment π~0(υ0)=1. For t≥1, let Ψt(d) consist of the ϕ∈Φt(d) for which πt(∥ϕ∥2)<∞ and x↦Et(ϕ−πt(ϕ))(x)∈Ψt−1(d). Here Eth=kt(υth) is the operator defined below. Only target second moments are required: fixed-tail truncation supplies the conditional selection Lindeberg condition without a target higher-moment assumption. The recursive target moments supply the offspring variance at every earlier selection used in the induction. The source Φt conditions alone need not imply them. The source condition 1∈Φt and these recursive target moments are the stated hypotheses for the CLT induction; no higher initial normalizer moment is required.

Define the mutation covariance operators recursively. At time zero, V~0(ϕ)=Cov⁡π~0(ϕ). For t≥1, V~t(ϕ)=V^t−1(ktϕ)+∫Cov⁡kt(ϕ)(x) πt−1(dx). The weighted-estimator covariance is Vt(ϕ)=V~t ⁣(υt(ϕ−πt(ϕ))). For a measurable vector function h on Θt, define the forward operator from Θt−1 by Eth(x)=kt(υth)(x)=∫υt(z)h(z) kt(x,dz). For k<t, write Ek+1:t=Ek+1∘⋯∘Et; set Et+1:t to the identity operator. For multinomial offspring resampling set V^tmulti(ϕ)=Vt(ϕ)+Cov⁡πt(ϕ). For residual offspring resampling, let r(u)=u−⌊u⌋. When ct=π~t(r(υt))>0, define the formal source candidate Rtcand(ϕ)=π~t ⁣(r(υt)ϕϕ⊤)−π~t(r(υt)ϕ) π~t(r(υt)ϕ)⊤ct. Set Rt=Rtcand and V^tres=Vt+Rt only when π~t(υt∈{1,2,…})=0; then ct>0 and the finite-sample floor discontinuities are avoided. If υt=1 π~t-almost everywhere, put Rt=0. Residual offspring are deterministic whenever all sampled weights equal one. In SIR this holds almost surely outside earlier zero-weight fallback events, whose probability tends to zero at a fixed horizon; the almost-everywhere condition alone does not prescribe weights on proposal-null states reached after a fallback. No residual covariance is assigned when ct=0 but υt is not almost everywhere one: the finite-sample normalization can move positive integer weights across floor boundaries. The B-page counterexamples show why the general positive-integer-atom branch remains unassigned.

Remarks

The classes and recursions are definitions. The fixed-horizon CLT proofs below establish finiteness where their stated hypotheses apply. In particular, the source class Φt(d) alone does not ensure Cov⁡πt(ϕ)<∞; the recursive target-moment class Ψt(d) is used for the stated post-resampling conclusions. The residual formula requires a separate continuity condition at positive integer weights; the B-page records finite-state failures without it. For an arbitrary weighted initial proposal, the source class Φ0=L2(π~0) is not by itself enough: the displayed initial weighted-numerator and target moments in Ψ0 are imposed explicitly.

The stronger Ψ hypotheses retain both locally proved fixed-horizon outputs, not the false claim that every source-Φ test has finite post-selection covariance. Separately, a weighted-only initial ratio CLT needs only a target-integrable test and its centered weighted numerator in L2(π~0); its denominator still needs only π~0(υ0)=1.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Uniform SMC backward-operator contraction controls oscillation

Statement

Let Es be the forward operators of Finite-horizon SMC CLT classes and variance recursions, and for bounded real h put osc⁡(h)=sup⁡h−inf⁡h. Suppose there is one β∈[0,1) such that osc⁡(Esh)≤βosc⁡(h) for every s and every bounded real h with πs(h)=0, with bounded measurable versions of Esh. The stronger condition on every bounded h is sufficient but is not necessary here. For bounded ϕ:Θt→R, put Δϕ=osc⁡(ϕ) and ϕˉ=ϕ−πt(ϕ). Then for every 0≤k≤t, ∥Ek+1:tϕˉ∥∞≤βt−kΔϕ, with β0=1 and Et+1:t the identity. This condition concerns the actual SMC backward operators; it is not implied merely by mixing ratios of the proposal densities.

Facts & Assumptions

Given: The SMC flow and operators in the Statement, bounded real ϕ, and the uniform operator contraction hypothesis.

[A1]

The Axiom of Choice: AC is inherited through the finite-horizon path and Radon–Nikodym construction.

[F1]

Finite-horizon SMC CLT classes and variance recursions: Esh=ks(υsh), π~s=πs−1ks, and π~s(υsh)=πs(h).

Proof

Given: The hypotheses in the Statement.

1.1A1F1given

For any bounded measurable h and s≥1, [F1] gives πs−1(Esh)=πs−1(ks(υsh))=π~s(υsh)=πs(h). Iterating this identity yields πk(Ek+1:tϕˉ)=πt(ϕˉ)=0 for every k<t; for k=t the identity operator also gives mean zero.

2.1F1step 1.1given∎

Repeated application of the assumed oscillation contraction gives osc⁡(Ek+1:tϕˉ)≤βt−kosc⁡(ϕˉ)=βt−kΔϕ. By step 1.1 its πk-mean is zero, so its infimum is at most zero and its supremum at least zero; hence its sup norm is at most its oscillation. For k=t this is ∥ϕˉ∥∞≤Δϕ.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Multinomial SMC variance unrolls into local contributions

Statement

Use the operators and multinomial variance recursion of Finite-horizon SMC CLT classes and variance recursions at every selection time. For ϕ∈Ψt(d), put ϕˉ=ϕ−πt(ϕ). Then Vt(ϕ)=∑k=0tπ~k ⁣[υk2 Ek+1:t(ϕˉ)Ek+1:t(ϕˉ)⊤], where the k=t term uses Et+1:tϕˉ=ϕˉ. Each summand is a finite positive-semidefinite matrix under the stated class conditions.

Facts & Assumptions

Given: The finite-horizon target/proposal flow, Radon–Nikodym weights, forward operators, and multinomial covariance recursion in the cited definition.

[A1]

The Axiom of Choice: AC is inherited through the finite-horizon path and Radon–Nikodym construction.

[F1]

Finite-horizon SMC CLT classes and variance recursions: υs=dπs/dπ~s, Esh=ks(υsh), πs−1Esh=πsh, and V^s−1multi=Vs−1+Cov⁡πs−1; Ψt recursively supplies the target moments of the centered backward images.

Proof

Given: The hypotheses in the Statement.

1.1A1F1given

For every integrable h on Θs, the Radon–Nikodym identity [F1] gives πs−1(Esh)=πs−1(ks(υsh))=π~s(υsh)=πs(h). Hence if πs(h)=0, then Esh has mean zero under πs−1.

2.1F1step 1.1algebra

For a square-integrable vector function u on Θs, expand u−π~s(u)=(u−ksu)+(ksu−π~s(u)). The cross-covariance terms vanish after integrating the first factor conditionally against ks, because ks(u−ksu)=0. Therefore Cov⁡π~s(u)=∫Cov⁡ks(u)(x) πs−1(dx)+Cov⁡πs−1(ksu). For u=υsh with πs(h)=0, its π~s mean is zero by step 1.1. Substituting the multinomial recursion from [F1] thus yields Vs(h)=Vs−1(Esh)+π~s ⁣[υs2hh⊤].

3.1A1F1step 1.1step 2.1inductionalgebra∎

Starting with h=ϕˉ at time t, apply step 1.1 to see that each backward iterate Ek+1:tϕˉ has πk-mean zero. The recursive Ψ condition also gives its finite target second moment at each such time. Repeated substitution of the one-step identity in step 2.1 gives one new term π~k[υk2(Ek+1:tϕˉ)(Ek+1:tϕˉ)⊤] at each k=t,t−1,…,1, and the remaining initial term is V0(E1:tϕˉ)=Cov⁡π~0(υ0E1:tϕˉ). Its mean is zero by step 1.1, so it equals the k=0 summand. The same base calculation gives the formula when t=0. Each summand is finite: for k≥1, the recursive Φ condition gives a 2+δ proposal moment of υkEk+1:tϕˉ; for k=0, the initial Ψ0 moment gives square integrability of υ0E1:tϕˉ.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Centered filtering Feynman–Kac operators contract terminal tests

Statement

Let X be a nonempty standard-Borel space with a sigma-finite reference measure λ, and let η0 be a probability on it. For s≥1, supply jointly measurable, strictly positive finite densities gs(z∣x) of probability transition kernels relative to λ, and measurable likelihood factors fs with 0<a≤fs(z)≤b<∞. These specified versions satisfy, for one C≥1 and every s,x,x′,z, gs(z∣x)≤Cgs(z∣x′). Define cs=ηs−1(gsfs), ηs(h)=ηs−1(gs(fsh))/cs, and Esh(x)=gs(fsh)(x)/cs. They are the operators of Finite-horizon SMC CLT classes and variance recursions restricted to last-state tests in the corresponding filtering model. Put ρ=1−C−2. For every bounded measurable real terminal test ψ and 0≤k<t, ∥Ek+1:t(ψ−ηtψ)∥∞≤Cρt−kosc⁡(ψ). For k=t the identity image is bounded by osc⁡(ψ); use ρn=0 for n≥1 when C=1. This is a closed last-state-test assertion, not a contraction of arbitrary functions of the full stored path. Positivity, finiteness and the ratio bounds refer to the supplied pointwise density versions, not to unspecified unrelated null-set versions.

Facts & Assumptions

Given: The specified positive finite density versions, probability transitions, initial probability, uniform row ratio and likelihood bounds, and bounded terminal test in the Statement.

[F1]

Measurability of integration against a kernel: a nonnegative measurable function integrated against a probability kernel has a measurable section integral.

[F2]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative measurable product integrals equal their iterated integrals.

[F3]

Uniform density ratios bound the Dobrushin coefficient: normalized probability-kernel density rows with ratio at most R have Dobrushin coefficient at most 1−R−1.

[F4]

Dobrushin contraction coefficient for a probability kernel: the coefficient is the supremum event-supremum total-variation distance between two output laws.

[F5]

Layer-cake formulas for random variables: for a nonnegative bounded random variable U≤1, EU=∫01P(U>r)dr.

Proof

1.1F1givenconstructalgebra

Fix k<t. Define Qj,th(x) by iterating the kernels gj+1,…,gt, multiplying by fj+1,…,ft, and evaluating h at the final state. Put Hj,t=Qj,t1 and Ht,t=1. Measurability follows from [F1], while probability normalization and the bounds on fs give at−j≤Hj,t≤bt−j. Comparing the first transition row gives Hj,t(x)≤CHj,t(x′) for j<t. Consequently rk,t:=Hk,t/ηk(Hk,t) is positive, at most C, and has ηk-mean one.

2.1F1F2F3step 1.1constructalgebra

For j=k+1,…,t, set Lj,t(x,dz)=gj(z∣x)fj(z)Hj,t(z)λ(dz)/Hj−1,t(x). The recursion for H shows that these are probability kernels, with strictly positive finite denominators. The ratio of two of their density rows is [gj(z∣x)/gj(z∣x′)][Hj−1,t(x′)/Hj−1,t(x)]≤C2 by step 1.1. Thus [F3] gives δ(Lj,t)≤1−C−2=ρ. Telescoping the H factors in the product kernel Pk,t=Lk+1,t⋯Lt,t gives Pk,th=Qk,th/Hk,t.

3.1F4F5step 2.1constructalgebra

For any probability kernel K and bounded real h of positive oscillation, put u=(h−inf⁡h)/osc⁡(h). Then 0≤u≤1, and [F5] under each output law gives Ku(x)−Ku(x′)=∫01[K(x,{u>r})−K(x′,{u>r})]dr. By [F4], its absolute value is at most δ(K). If the oscillation is zero, K preserves the constant and the same oscillation bound is immediate. Hence osc⁡(Kh)≤δ(K)osc⁡(h). Iterating this inequality along the kernels in step 2.1 gives osc⁡(Pk,th)≤ρt−kosc⁡(h).

4.1F2step 1.1step 2.1step 3.1givenalgebra∎

The filtering recursion and iterated integration [F2] yield ηth=ηk(Qk,th)/ηk(Hk,t) and ∏j=k+1tcj=ηk(Hk,t). Thus Ek+1:th=rk,tPk,th. Take h=ψ−ηtψ. Then ηk(rk,tPk,th)=0, and rk,tηk is a probability by step 1.1. Therefore the global infimum of Pk,th is at most zero and its supremum is at least zero, so its sup norm is at most its oscillation. Step 3.1 bounds this by ρt−kosc⁡(ψ); multiplying by rk,t≤C proves the claim. For k=t, the mean ηtψ lies between inf⁡ψ and sup⁡ψ, giving the identity-case bound.

Source notes

The local proof supplies the normalized future-kernel argument explicitly. The density-ratio hypothesis alone does not compare a target transition to its proposal; the separate variance theorem imposes that additional domination and an initial weight bound. No finite-particle or arbitrary-path time-uniform claim is imported from the source.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Conditional mutation and weighted correction CLT

Statement

Fix t≥1. Suppose the selected empirical array at time t−1 has the CLT with covariance V^t−1 for ktψ. Let ψ:Θt→R satisfy π~t(∣ψ∣2+δ)<∞ for some δ>0 and ktψ∈Φt−1(1). Then the proposal empirical mean after mutation satisfies N(ηtN(ψ)−π~t(ψ))⇒N ⁣(0,V^t−1(ktψ)+πt−1 ⁣(Var⁡kt(ψ)))=N(0,V~t(ψ)). For weighted correction, take ψ=υt(ϕ−πt(ϕ)) and explicitly require the preceding selected-population CLT for ktψ=Et(ϕ−πt(ϕ)). In particular, if ϕ∈Ψt(1), 1∈Φs(1) for 0≤s≤t, and this preceding selected CLT holds, the weighted corrected estimate satisfies N(ωtN(ϕ)−πt(ϕ))⇒N(0,Vt(ϕ)). At t=0, a separate weighted-only conclusion holds whenever π0(∣ϕ∣)<∞ and Z=υ0(ϕ−π0ϕ)∈L2(π~0): the weighted estimate has the ratio CLT with variance V0(ϕ)=π~0(Z2). No target second moment, proposal second moment of ϕ, or denominator second moment is required for this weighted-only conclusion. The stronger Ψ0 assumptions imply it and support subsequent selected-population conclusions.

Facts & Assumptions

Given: The finite-horizon particle scheme, the previous selected-population CLT, and the function-class hypotheses in the Statement.

[A1]

The Axiom of Choice: AC is inherited through the finite-horizon particle-law construction and the Lindeberg–Feller supplier.

[F1]

Finite-horizon SMC CLT classes and variance recursions: π~t=πt−1kt, πt=υtπ~t, and Ψt supplies a target second moment and recursive membership of kt(υt(ϕ−πtϕ)) in Ψt−1.

[F2]

Sequential importance resampling for Feynman–Kac path targets: Conditional on the selected parents, the next proposal particles are drawn independently through kt and are then corrected by the incremental RN weights.

[F3]

Finite-horizon SMC empirical laws converge for integrable tests: Integrable proposal and selected empirical averages converge in probability to their target-law integrals at each fixed time.

[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]

Slutsky's theorem for real random variables: If XN⇒X and YN→c in probability, then XNYN⇒cX; for c≠0, the corresponding ratio converges to X/c.

[F6]

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.

[F7]

Dominated convergence: integrable domination permits passage to limits under the integral.

Proof

Given: The hypotheses in the Statement.

1.1A1F1F3F4F5F6F7givenalgebra

At t=0, the centered weighted numerator Z=υ0(ϕ−π0ϕ) has mean zero and finite second moment under the weighted-only assumptions; the Ψ0 assumptions are sufficient for them. If its variance σZ2 is positive, its IID row satisfies Lindeberg because σZ−2E[Z21{∣Z∣>aσZN}]→0 by [F7] for each a>0. Thus [F4] gives the IID CLT; if its variance is zero, [F6] gives convergence of its centered sample mean to zero. The denominator η0N(υ0) converges to one by [F3], since π~0(υ0)=1. Slutsky [F5] gives the ratio CLT with variance V0(ϕ). For p≥1, ∣ax+by∣p≤2p−1(∣a∣p∣x∣p+∣b∣p∣y∣p); choosing the smaller available positive δ therefore proves closure of Φt under finite linear combinations, by induction from Φ0. Kernel integration is linear on these integrable functions. The same inequality gives closure of the target and centered weighted L2 conditions in Ψt, and its centered images combine linearly; induction proves closure of Ψt. If ϕ∈Ψt, then ψ=υt(ϕ−πtϕ) has a finite proposal 2+δ moment because ϕ,1∈Φt, and ktψ=Et(ϕ−πtϕ)∈Ψt−1 by the recursive Ψt condition.

1.2A1F1F2F3given

For the mutation part, kt∣ψ∣2+δ is πt−1-integrable, with integral π~t(∣ψ∣2+δ). By [F3], HN=ηˇt−1N(kt∣ψ∣2+δ) converges in probability to this finite value, so HN<∞ with probability tending to one. On this event condition on the selected parent paths Xˇt−11:N and set mi=ktψ(Xˇt−1i). Each parent has a finite conditional 2+δ moment; under the product kernel in [F2], Di,N=ψ(Xti)−mi are independent and centered. Their row variance is sN2=1N∑i=1NVar⁡kt(Xˇt−1i)(ψ), which converges in probability to σ2=πt−1(Var⁡kt(ψ)) by [F3], since Var⁡kt(ψ)≤kt(ψ2) is integrable by Jensen's inequality. The event removed has probability tending to zero and does not affect the distributional limits below. When σ2>0, normalize the array by sNN, where sN2 is the displayed variance. For every a>0, the resulting conditional Lindeberg sum is at most Cδa−δN−δ/2sN−(2+δ) HN, where Cδ is a finite constant from ∣a−b∣2+δ≤21+δ(∣a∣2+δ+∣b∣2+δ) and Jensen's inequality. Since sN→σ>0 and HN converges in probability to a finite value, this conditional Lindeberg sum tends to zero.

2.1F4F5F6step 1.2algebra

Along any subsequence, choose a further subsequence on which sN→σ almost surely. If σ>0, a further subsequence makes the normalized Lindeberg sums converge almost surely; [F4] gives a standard-normal limit for the normalized row, and Slutsky [F5] with sN→σ gives the conditional characteristic-function limit e−u2σ2/2. If σ=0, conditional [F6] gives P ⁣(∣N−1/2∑iDi,N∣>a | Xˇt−11:N)≤min⁡(1,sN2/a2)⟶0 for every a>0, yielding the same characteristic-function limit with variance zero. The subsequence criterion therefore gives convergence in probability of the conditional characteristic functions along the full sequence. They are bounded by one, so their L1 differences from that limit also tend to zero.

3.1F1F2step 2.1given

The conditional mean part is PN=N(ηˇt−1N(ktψ)−πt−1(ktψ)), and has the previous selected-population CLT by the hypothesis of the Statement. The total proposal error is PN+N−1/2∑iDi,N. Multiplying the conditional characteristic function from step 2.1 by the bounded factor eiuPN and integrating shows that its limit is the product of the previous Gaussian characteristic function and e−u2σ2/2. Hence the two covariance contributions add, giving V~t(ψ).

4.1F1F3F5step 1.1step 3.1algebra∎

For ϕ∈Ψt, apply the mutation result to ψ=υt(ϕ−πtϕ) using step 1.1 and the preceding selected CLT for ktψ∈Ψt−1. By [F3], ηtN(υt)→π~t(υt)=1 in probability, and the event of a zero denominator has probability tending to zero. On its complement, N(ωtN(ϕ)−πt(ϕ))=N ηtN(υt(ϕ−πtϕ))ηtN(υt). Slutsky [F5] gives the stated limit with covariance V~t(υt(ϕ−πtϕ))=Vt(ϕ). The fallback on a zero empirical weight sum changes the ratio only on an event whose probability tends to zero.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Conditional residual resampling central limit theorem away from integer weights

Statement

Fix a time t in the finite-horizon SIR system of Finite-horizon SMC CLT classes and variance recursions. Let Xt1:N have proposal empirical law ηtN, corrected law ωtN, and residual-resampled law ηˇtN. Assume the proposal empirical law converges in probability for every integrable test as in Finite-horizon SMC empirical laws converge for integrable tests, the weighted estimate has a finite-variance CLT N{ωtN(ϕ)−πt(ϕ)}⇒N(0,V), and πt(ϕ2)<∞. Write u=υt and assume either u=1 π~t-almost everywhere, or π~t(u∈{1,2,…})=0. In the second case c=π~t(r(u))>0. Then, with Rt(ϕ)=π~t(r(u)ϕ2)−π~t(r(u)ϕ)2c, where Rt(ϕ)=0 in the constant-weight case, N{ηˇtN(ϕ)−ωtN(ϕ)}⇒N(0,Rt(ϕ)), asymptotically independently of the weighted-estimator fluctuation, and N{ηˇtN(ϕ)−πt(ϕ)}⇒N(0,V+Rt(ϕ)).

Facts & Assumptions

Given: The proposal empirical-law convergence, the weighted-estimator CLT, the target second-moment condition, and the residual offspring algorithm 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: u=dπt/dπ~t, π~t(u)=1, r(v)=v−⌊v⌋, and the formal residual candidate is assigned as Rt only in the no-positive-integer-atom branch or the constant-weight branch.

[F2]

Multinomial and residual offspring resampling: For normalized weights ρi, residual resampling gives each particle ⌊Nρi⌋ deterministic copies and fills the remaining count with IID draws proportional to r(Nρi).

[F3]

Finite-horizon SMC empirical laws converge for integrable tests: The proposal and corrected empirical laws converge in probability for integrable tests.

[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.1F1F3givenalgebra

Put uˉN=ηtN(u) and biN=r(u(Xti)/uˉN) on the event uˉN>0, whose probability tends to one by [F3]. If u=1 almost everywhere, exclude all earlier zero-weight fallback events; their union has probability tending to zero by [F3] and the fixed horizon. On the remaining event every proposal particle avoids proposal-null sets almost surely: initially particles have the proposal law, and inductively positive-weight selection avoids target-null sets, after which mutation avoids π~s-null sets since π~s=πs−1ks. Thus all sampled u values equal one almost surely there, so residual selection is deterministic. The resampling fluctuation is zero outside an event of probability tending to zero, proving the constant-weight branch. In the other case, for the three tests a=1,ϕ,ϕ2, where πt(ϕ2)<∞, one has 1N∑ibiNa(Xti)→Pπ~t(r(u)a). To verify this triangular empirical limit, fix M and first restrict to u≤M and ∣ϕ∣≤M. The compact u interval meets only finitely many positive-integer discontinuities of r. Delete open γ-neighborhoods of those integers. On the remaining compact set, r(u/uˉN)→r(u) uniformly as uˉN→1, and ∣a∣≤max⁡(1,M,M2), so [F3] gives convergence of the restricted averages. Each deleted neighborhood has proposal integral of ∣a∣ tending to zero as γ↓0: it lies where u≥1/2, and π~t(u∣a∣)=πt(∣a∣)<∞; the no-atom condition gives the limit zero. [F3] controls its empirical average for each fixed γ. For the tails, when uˉN∈[1/2,2], biN≤2u(Xti); hence the ∣ϕ∣>M contribution is bounded by 2ηtN(u∣a∣1{∣ϕ∣>M}), whose limit tends to zero by target integrability. On u>M, use biN≤1 and π~t(∣a∣1{u>M})≤M−1πt(∣a∣), with [F3] again controlling the empirical average. The corresponding target tails obey the same bounds because r(u)≤u and r(u)≤1. Taking first N→∞, then γ↓0 and M→∞, proves the claim.

2.1F1F2step 1.1algebra

Taking a=1 in step 1.1 gives N−1∑ibiN→c. Here c>0: if c=0, then u is integer-valued almost surely; the no-positive-integer-atom assumption would force u=0 almost surely, contradicting π~t(u)=1. Thus the number MN=∑ibiN of residual draws diverges and MN/N→c. Their conditional sampling probabilities are biN/MN.

3.1F1F2F3F4step 1.1step 2.1givenalgebra

Let mN=MN−1∑ibiNϕ(Xti). Given the particles, the residual offspring contribution to the centered, N-scaled empirical mean is N−1/2∑ℓ=1MN(ϕ(YℓN)−mN), with IID conditional draws YℓN from probabilities biN/MN. By step 1.1 its conditional variance converges in probability to c{π~t(r(u)ϕ2)c−(π~t(r(u)ϕ)c)2}=Rt(ϕ). The residual draw mean mN is bounded in probability by the a=ϕ limit in step 1.1 and MN/N→c>0. Fix a threshold a0>0 and fixed K, then R≥K. On {∣mN∣≤K, uˉN∈[1/2,2]}, for sufficiently large N with a0N>R+K, the conditional Lindeberg sum for N−1/2∑ℓ=1MN(ϕ(YℓN)−mN) is at most 4N−1∑ibiNϕ(Xti)21{∣ϕ(Xti)∣>R}. Since biN≤2u(Xti) on this event, it is at most 8ηtN(uϕ21{∣ϕ∣>R}). For fixed R, [F3] makes this converge to 8π~t(uϕ21{∣ϕ∣>R})=8πt(ϕ21{∣ϕ∣>R}), which tends to zero as R→∞. Choosing K, then R, then N controls the exceptional mean event and the integrable fixed tail; uˉN→1 handles the normalization event. Thus conditional Lindeberg holds under target L2, with no target higher moment.

4.1A1F2F4F5F6givenstep 3.1algebra∎

Along any subsequence, choose a further subsequence on which the conditional residual variance converges almost surely. If Rt(ϕ)>0, the conditional standard deviation is eventually greater than Rt(ϕ)/2. Apply the bound in step 3.1 at threshold aRt(ϕ)/2 and divide by the conditional variance; this gives the Lindeberg condition after normalizing the residual sum by its conditional standard deviation. Conditional [F4] gives a standard-normal limit, and Slutsky [F6] with the conditional standard deviation converging to Rt(ϕ) gives the characteristic-function limit e−u02Rt(ϕ)/2. If Rt(ϕ)=0, conditional [F5] bounds the deviation probability by the conditional variance divided by the squared threshold, giving the same degenerate limit. AC is inherited only through the particle law and conditional CLT supplier [F4]; the finite residual calculation adds no choice. The subsequence criterion gives convergence in probability along the full sequence. These conditional characteristic functions are bounded by one. For arbitrary real v,u0, multiply this conditional characteristic function at u0 by eivN(ωtN(ϕ)−πt(ϕ)) and integrate. The limit is e−v2V/2e−u02Rt(ϕ)/2, proving joint asymptotic independence and adding Rt(ϕ) to V. The deterministic-floor part is centered at its conditional expectation, so the conditional mean of the selected empirical law is exactly ωtN(ϕ).

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Time-uniform SMC asymptotic variance under uniform weight and operator bounds

Statement

Use multinomial offspring resampling and the covariance Vt of Finite-horizon SMC CLT classes and variance recursions. Suppose all normalized incremental weights satisfy υs≤B<∞ almost everywhere under their proposals, including s=0. For a chosen bounded real terminal test ϕ and every 0≤k≤t, assume the bounded versions of its centered backward images satisfy ∥Ek+1:t(ϕ−πtϕ)∥∞≤Aρt−kΔϕ, with fixed A≥1 and 0≤ρ<1, uniformly over the horizons considered; use ρ0=1. Then Vt(ϕ)≤A2B2(Δϕ)21−ρ2. The one-step centered oscillation condition of Uniform SMC backward-operator contraction controls oscillation gives the original specialization A=1, ρ=β and bound B2(Δϕ)2/(1−β2).

There is a separate filtering-density sufficient branch. Use the strictly positive finite density versions, true-transition row-ratio bound C≥1, likelihood bounds 0<a≤fs≤b<∞ and normalized filtering operators in Centered filtering Feynman–Kac operators contract terminal tests. Additionally require strictly positive finite proposal densities qs(z∣x) with gs(z∣x)≤Dqs(z∣x) uniformly for a finite D, and an initial normalized weight υ0≤Binit<∞ under its proposal. Put B=max⁡(Binit,Db/a) and ρ=1−C−2. For bounded last-state tests ϕ(x0:t)=ψ(xt), the bound holds with A=C: Vt(ψ)≤B2C2(osc⁡ψ)21−(1−C−2)2. This branch concerns the closed last-state test subspace and its backward images, not all path observables. Both bounds concern fixed-horizon CLT variances, uniform in the time index; neither is a finite-particle time-uniform error bound.

Facts & Assumptions

Given: The multinomial SMC flow, the uniform incremental-weight bound B, and the stated multistep centered-image constants A,ρ; for the filtering branch, the explicit density, domination and initial-weight hypotheses.

[A1]

The Axiom of Choice: AC is inherited through the finite-horizon SMC path-law and Radon–Nikodym construction.

[F1]

Finite-horizon SMC CLT classes and variance recursions: Vt is the weighted-estimator covariance, υs is the normalized incremental Radon–Nikodym weight, and Φs,Ψs are the recursive moment classes.

[F2]

Multinomial SMC variance unrolls into local contributions: Vt(ϕ) is the sum over k=0,…,t of π~k[υk2(Ek+1:t(ϕ−πtϕ))2].

[F3]

Uniform SMC backward-operator contraction controls oscillation: the stated one-step centered contraction gives the multistep image bound with A=1 and ρ=β.

[F4]

Centered filtering Feynman–Kac operators contract terminal tests: for the stated filtering density model and bounded last-state tests, the multistep image bound holds with A=C and ρ=1−C−2.

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2given

Put ht=ϕ−πt(ϕ) and hk=Ek+1:tht for 0≤k<t, with ht itself at k=t. The multistep hypothesis supplies bounded versions of these centered images. By [F1], πk(hk)=0 and Ekhk=hk−1 for 1≤k≤t. At k=0, boundedness and υ0≤B almost everywhere give h0∈Ψ0. If hk−1∈Ψk−1, then boundedness of hk and υk≤B almost everywhere give π~k(∣υkhk∣2+δ)<∞ and Ekhk=hk−1∈Φk−1, so hk∈Φk. Also πk(hk2)<∞ and Ekhk=hk−1∈Ψk−1, hence hk∈Ψk. Induction gives ht∈Ψt, so [F2] applies to Vt(ht)=Vt(ϕ). Its summands are nonnegative and finite because υk≤B almost everywhere and each hk has a bounded version.

2.1F2F3step 1.1givenalgebra

The multistep bound in the Statement makes the kth summand at most B2A2ρ2(t−k)(Δϕ)2. Summing the geometric series gives Vt(ϕ)≤A2B2(Δϕ)2/(1−ρ2). Applying [F3] yields the original one-step specialization.

3.1F1F4step 2.1givenalgebra∎

In the filtering branch, the actual increment is υs(x,z)=gs(z∣x)fs(z)/(csqs(z∣x)), with cs=ηs−1(gsfs)∈[a,b]. Hence υs≤Db/a for s≥1; the initial bound gives υs≤B at every time. The last-state subspace is preserved by the filtering operators, and [F4] supplies its centered-image estimate with A=C, ρ=1−C−2. Step 2.1 proves the displayed filtering bound; when C=1, all earlier images vanish and the same formula applies.

Remarks

Uniform predecessor ratios for gs and qs alone do not bound gs/qs or the incremental weights when proposals vary with time. The B-page finite-state counterexample refutes that displayed source/design implication. The additional domination and initial-weight assumptions above are explicit corrections, not consequences ascribed to those predecessor ratios. The abstract branch remains available under its own actual operator assumptions.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Fixed-horizon SMC central limit theorem with multinomial resampling

Statement

Fix a finite horizon t and use the target/proposal flow and classes Φs(d),Ψs(d) of Finite-horizon SMC CLT classes and variance recursions, with 1∈Φs(1) for every 0≤s≤t. Run the SIR procedure with multinomial resampling at each time. For ϕ∈Ψt(d), let ωtN be the corrected weighted empirical law and ηˇtN the post-resampling empirical law. Then N{ωtN(ϕ)−πt(ϕ)}⇒Nd(0,Vt(ϕ)),N{ηˇtN(ϕ)−πt(ϕ)}⇒Nd(0,V^tmulti(ϕ)), where V^tmulti(ϕ)=Vt(ϕ)+Cov⁡πt(ϕ). The horizon is fixed as N→∞; the theorem asserts no time-uniform finite-particle accuracy.

Facts & Assumptions

Given: A fixed finite SIR horizon with multinomial selection, the recursive target-moment class Ψt(d), and the source normalizer condition 1∈Φs(1) at every time through t.

[A1]

The Axiom of Choice: AC is inherited through the finite-horizon path-law and particle-law construction.

[F1]

Finite-horizon SMC CLT classes and variance recursions: Ψt includes the terminal target moment and recursively places each centered forward image in Ψt−1; the source requires 1∈Φs; Vt and V^tmulti are the stated covariance recursions.

[F2]

Conditional mutation and weighted correction CLT: Given the preceding selected-population CLT, the mutation and correction steps give the weighted-estimator CLT with covariance Vs; the initial weighted proposal has the ratio CLT under Ψ0.

[F3]

Conditional multinomial resampling central limit theorem: Given the weighted-estimator CLT, a finite target second moment, and the empirical-law conclusions of [F5], multinomial selection adds Cov⁡πs(ϕ) and gives the selected-population CLT.

[F4]

Cramer wold device: Convergence of all scalar linear projections to the corresponding centered Gaussian projections implies vector weak convergence to the multivariate Gaussian with that covariance matrix.

[F5]

Finite-horizon SMC empirical laws converge for integrable tests: In the stated finite-horizon SIR flow with multinomial or residual selection, proposal empirical averages converge in probability for every proposal-integrable test, and corrected and selected empirical averages do so for every target-integrable test, at each fixed time.

Proof

Given: The hypotheses in the Statement.

1.1A1F1F5givenalgebra

The finite-horizon SIR flow and multinomial selection satisfy [F5], so all its integrable-test empirical-law conclusions hold at every s≤t, as required by [F2] and [F3]. Fix a∈Rd and put h=a⊤ϕ. The bound ∣a⊤x∣≤∥a∥ ∥x∥ and linearity of each Es show from [F1] that h∈Ψt(1). We prove by induction on s≤t the scalar assertion for every test in Ψs(1); at s=t this includes h.

1.2F1F2giveninduction

Let 1≤s≤t, assume the assertion holds for every test in Ψs−1, and take arbitrary h∈Ψs. By [F1], Es(h−πsh)∈Ψs−1, so the induction hypothesis gives the selected CLT needed by [F2] for the centered weighted test. The source condition 1∈Φs makes the correction ratio well defined in the same class. Thus [F2] yields the weighted CLT at time s with covariance Vs(h).

2.1F1F2F3step 1.1

At time zero, let h∈Ψ0. By [F2], the initial weighted ratio has CLT variance V0(h). The target moment in Ψ0 and the weighted CLT meet [F3], which gives the post-resampling CLT with variance V0(h)+Var⁡π0(h).

2.2F1F2F3step 1.1step 1.2

The target moment h∈Ψs, the weighted CLT just obtained, and the empirical laws from step 1.1 satisfy [F3]. Multinomial resampling therefore gives the selected CLT with covariance Vs(h)+Var⁡πs(h)=V^smulti(h). This proves the induction assertion for every h∈Ψs.

3.1F1F4step 1.1step 2.1step 1.2step 2.2∎

The base step 2.1 and induction steps 1.2, 2.2 prove both scalar limits at time t for every h∈Ψt. For each a∈Rd, a⊤ϕ∈Ψt by step 1.1 and has covariance projections a⊤Vt(ϕ)a and a⊤V^tmulti(ϕ)a. Since a was arbitrary, [F4] gives the two vector limits. No bound uniform over the horizon follows from this fixed-t argument.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Fixed-horizon SMC central limit theorem with residual resampling away from integer weights

Statement

Fix a finite horizon t and use the target/proposal flow and classes Φs(d),Ψs(d) of Finite-horizon SMC CLT classes and variance recursions, with 1∈Φs(1) for every 0≤s≤t. Run SIR with residual resampling at each time. At every 0≤s≤t, assume either υs=1 π~s-almost everywhere, or π~s(υs∈{1,2,…})=0. For ϕ∈Ψt(d), let ωtN be the corrected weighted empirical law and ηˇtN the post-resampling empirical law. Then N{ωtN(ϕ)−πt(ϕ)}⇒Nd(0,Vt(ϕ)),N{ηˇtN(ϕ)−πt(ϕ)}⇒Nd(0,V^tres(ϕ)), where V^sres=Vs+Rs is defined by Finite-horizon SMC CLT classes and variance recursions in the stated branches. No conclusion is asserted for a nonconstant weight law with positive mass at a positive integer. The horizon is fixed as N→∞.

Facts & Assumptions

Given: A fixed finite SIR horizon with residual selection, the recursive target-moment class Ψt(d), the source condition 1∈Φs(1) at every time, and the no-positive-integer-atom or constant-weight condition at every time.

[A1]

The Axiom of Choice: AC is inherited through the finite-horizon path-law and particle-law construction.

[F1]

Finite-horizon SMC CLT classes and variance recursions: Ψt includes the terminal target moment and recursively places centered forward images in Ψt−1; the source condition is 1∈Φs; the displayed residual covariance is assigned only in the stated branches.

[F2]

Conditional mutation and weighted correction CLT: Given the preceding selected-population CLT, mutation and correction give the weighted-estimator CLT with covariance Vs, with the initial ratio CLT at s=0.

[F3]

Conditional residual resampling central limit theorem away from integer weights: Under proposal empirical-law convergence and the stated residual-weight condition, residual selection adds Rs to the weighted-estimator variance and gives the selected-population CLT.

[F4]

Cramer wold device: Convergence of all scalar linear projections to the corresponding centered Gaussian projections implies vector weak convergence to the multivariate Gaussian with that covariance matrix.

[F5]

Finite-horizon SMC empirical laws converge for integrable tests: In the stated finite-horizon SIR flow with multinomial or residual selection, proposal empirical averages converge in probability for every proposal-integrable test, and corrected and selected empirical averages do so for every target-integrable test, at each fixed time.

Proof

Given: The hypotheses in the Statement.

1.1A1F1F5givenalgebra

The finite-horizon SIR flow and residual selection satisfy [F5], so all its integrable-test empirical-law conclusions hold at every s≤t, as required by [F2] and [F3]. Fix a∈Rd and put h=a⊤ϕ. The bound ∣a⊤x∣≤∥a∥ ∥x∥ and linearity of each Es show from [F1] that h∈Ψt(1). We prove by induction on s≤t the scalar assertion for every test in Ψs(1); at s=t this includes h.

1.2F1F2giveninduction

Let 1≤s≤t, assume the assertion holds for every test in Ψs−1, and take arbitrary h∈Ψs. By [F1], Es(h−πsh)∈Ψs−1, so the induction hypothesis gives the selected CLT needed by [F2] for the centered weighted test. The source condition 1∈Φs makes the correction ratio well defined in the stated class. Thus [F2] yields the weighted CLT at time s with covariance Vs(h).

2.1F1F2F3step 1.1

At time zero, let h∈Ψ0. By [F2], the initial weighted ratio has CLT variance V0(h). The assumed residual-weight branch either has constant weight one, in which case selection is deterministic and R0(h)=0, or has no positive-integer atom; in the latter case the target moment and weighted CLT meet [F3], which gives the selected CLT with its stated R0(h).

2.2F1F2F3step 1.1step 1.2

The target moment h∈Ψs, the weighted CLT just obtained, the empirical laws from step 1.1, and the residual-weight condition satisfy [F3]. Residual selection gives the selected CLT with covariance Vs(h)+Rs(h)=V^sres(h). This proves the induction assertion for every h∈Ψs while retaining the stated weight condition at each time.

3.1F1F4step 1.1step 2.1step 1.2step 2.2∎

The base step 2.1 and induction steps 1.2, 2.2 prove both scalar limits at time t for every h∈Ψt. For each a∈Rd, a⊤ϕ∈Ψt by step 1.1 and has covariance projections a⊤Vt(ϕ)a and a⊤V^tres(ϕ)a. Since a was arbitrary, [F4] yields the two vector limits. The integer-boundary branch is excluded by hypothesis and receives no conclusion here.

5 · Examples, counterexamples and false statements

None yet.

Sources