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 — Examples

1 · Prerequisites

2 · Summary

Objective

Use finite models to show ancestry collapse, dominant weights and low weight-based ESS, the target-moment gap in the source test class, instability of residual offspring floors at positive integers, and the failure of proposal-density ratio bounds to control time-uniform SMC variance when proposals vary. Contrast the fixed-horizon variance growth with a bounded-weight filter contracting the closed last-state test subspace, with exact variance 1/4. This does not assert contraction of arbitrary stored-path tests. These examples state the limits of the accompanying CLT and variance claims.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

Ancestry collapse under repeated multinomial resampling

Example

Track N=2 particles with equal weights through m≥1 repeated multinomial resampling steps and identity mutation. Use fresh independent randomness at each call: the m pairs of child indices are mutually independent, each uniform on {1,2}2. Each child records the original ancestor from which its state descends. The normalized particle weights remain (1/2,1/2) at each step.

Facts & Assumptions

Given: Two distinct initial ancestors, N=2, equal normalized weights (1/2,1/2), multinomial resampling with independent index pairs across calls, and the identity mutation that leaves each selected state unchanged.

[F1]

Multinomial and residual offspring resampling: Under multinomial resampling, the two child indices are conditionally IID with probabilities equal to the normalized parent weights.

[F2]

Multinomial and residual resampling have unbiased offspring counts: Each parent has conditional expected offspring count Npj.

Verification

Given: The finite two-particle system in the Example.

1.1F1givenalgebra

The two child indices are independent fair draws by [F1]. They choose the same parent with probability (1/2)2+(1/2)2=1/2. The expected number of distinct parents represented is 2{1−(1−1/2)2}=3/2, since each parent is selected at least once with probability 3/4.

2.1F1givenstep 1.1

If both children select one parent, identity mutation leaves two copies of that same original ancestor. Every later resampling copies represented ancestors, so it cannot restore the lost ancestor. If both lineages remain, their survival through the next call requires different parent indices. By the stipulated independence across calls and step 1.1, this has conditional probability 1/2 given the full preceding index history.

3.1F2step 2.1inductionalgebra∎

Starting from two lineages, the probability that no collapse occurs in m successive resampling steps is (1/2)m by induction on m using step 2.1. Hence the probability of a single represented ancestor is 1−2−m→1, even though the expected offspring counts at each step remain (1,1) by [F2].

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

The source function class need not give finite SMC CLT variances

Statement refuted

The source class Φt in Finite-horizon SMC CLT classes and variance recursions, together with 1∈Φt, guarantees that every displayed finite-horizon weighted and post-resampling CLT covariance is finite, including V0 for a separately weighted initial proposal.

Facts & Assumptions

Given: The recursive class Φt, target/proposal laws, and variance notation in the cited definition.

[F1]

Finite-horizon SMC CLT classes and variance recursions: Φ0 requires a finite proposal second moment; ϕ∈Φt requires π~t(∣υtϕ∣2+δ)<∞ and kt(υtϕ)∈Φt−1; the post-multinomial covariance adds Var⁡πt(ϕ).

[F2]

Finite-horizon SMC CLT classes and variance recursions: For an initially weighted proposal, V0(ϕ)=Cov⁡π~0(υ0(ϕ−π0ϕ)); finiteness requires its displayed second moment to exist.

Counterexample

Given: Let Θ0=Θ1=N0 with its power-set sigma-algebra and proposal p0=1/2, pn=2−(n+1) for n≥1. At time zero set π~0=π0=p and υ0=1. Put wn=2−n2 for n≥1, s=∑n≥1pnwn, and w0=(1−s)/p0. Let k1(n,⋅)=δn, π~1=p, υ1(n)=wn, and π1(n)=pnwn. Define ϕ(0)=0 and ϕ(n)=wn−3/4 for n≥1.

1.1givenalgebra

The geometric proposal masses sum to one. Since 0<s<1/2, w0 is finite and positive, and ∑n≥0pnwn=1 by construction; hence π1 is a probability law with density w relative to p. The identity kernel gives π~1=p.

1.2F1F2givenalgebra

For a separate initial-proposal witness, let Θ0=N≥1, π~0{n}=2−n, c=(∑n≥12−n/2)−1, and υ0(n)=c2n/2. Put π0{n}=2−nυ0(n) and ϕ(n)=1{n even}. Then ∑nπ~0{n}υ0(n)=1, so π0 is a probability law and υ0=dπ0/dπ~0. Both ϕ and 1 are bounded, hence belong to Φ0.

2.1F1step 1.1

Choose δ=1. For n≥1, wnϕ(n)=wn1/4, so ∑pn∣wnϕ(n)∣3=∑n≥1pnwn3/4<∞ and ∑pn∣wnϕ(n)∣2=∑n≥1pnwn1/2<∞. Thus k1(wϕ)=wϕ∈Φ0 and ϕ∈Φ1. Also ∑pnwn3<∞ and k1w=w∈Φ0, so 1∈Φ1.

2.2step 1.1algebra

The target mean is π1(ϕ)=∑n≥1pnwn1/4<∞, but π1(ϕ2)=∑n≥1pnwn−1/2=∑n≥12−(n+1)2n2/2=∞, since the summands do not tend to zero. Therefore Var⁡π1(ϕ)=∞.

3.1F1step 2.1step 2.2algebra

The weighted covariance V1(ϕ) is finite: the identity mutation has zero conditional variance, w(ϕ−π1ϕ)∈L2(p) by step 2.1 and the finite mean in step 2.2, and the initial multinomial covariance at time zero is finite because υ0=1 and g=w(ϕ−π1ϕ)∈L2(p). Yet the post-multinomial formula in [F1] adds the infinite target variance from step 2.2. Thus the source class and 1∈Φ1 do not suffice for the claimed finite post-resampling covariance.

4.1F2step 1.2algebra∎

Let q=π0(ϕ). Positive proposal and target mass occur on both parities, so 0<q<1. For every even n, π~0{n}υ0(n)2(ϕ(n)−q)2=c2(1−q)2>0, so the sum over even n diverges. Thus π~0(υ02(ϕ−q)2)=∞ and [F2] gives V0(ϕ)=∞, despite ϕ,1∈Φ0. This independently refutes the claimed initial weighted-estimator covariance finiteness.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Residual resampling is discontinuous at positive integer weights

Statement refuted

Under the recursive weighted-moment class and normalization hypotheses in Finite-horizon SMC CLT classes and variance recursions, the residual offspring covariance is always the displayed Rt(ϕ) computed from the limiting fractional parts r(υt), including when the importance-weight law has an atom at a positive integer.

Facts & Assumptions

Given: The CLT classes and residual covariance formula in the cited definition, and the standard normalized-weight residual procedure.

[F1]

Finite-horizon SMC CLT classes and variance recursions: υt=dπt/dπ~t has π~t-mean one; the formal source candidate Rtcand is computed from r(υt).

[F2]

Multinomial and residual offspring resampling: With normalized input weights pi, residual resampling uses floors ⌊Npi⌋ and distributes the remaining N−∑i⌊Npi⌋ children according to normalized fractional remainders.

[F3]

Lindeberg-Levy iid central limit theorem: IID real variables with finite positive variance have the usual normalized Gaussian sample-mean limit.

[F4]

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

[F5]

Continuous mapping theorem: A measurable map continuous outside a null set of the limiting law preserves weak convergence.

Counterexample

Given: At time 0, let the proposal law on {A,B} be π~0(A)=1/4, π~0(B)=3/4. Let the target be π0(A)=π0(B)=1/2, with Radon–Nikodym weights υ0(A)=2, υ0(B)=2/3. Use ϕ=1{A}. Both weights are positive and finite, ϕ is bounded, and π~0(r(υ0))=1/2>0.

1.1F3F4givenalgebra

For N IID proposal particles, let MN be the number at A and pN=MN/N. The weighted empirical estimate is SN=2MN2MN+(2/3)(N−MN)=3pN1+2pN. Since MN is binomial with parameters (N,1/4), [F3] gives N(pN−1/4)⇒N(0,3/16). The identity N(SN−1/2)=2N(pN−1/4)/(1+2pN) and [F4] yield ZN:=N(SN−1/2)⇒Z∼N(0,1/3). Moreover, ZN>0 exactly when pN>1/4.

1.2F1givenalgebra

The limiting-weight candidate in [F1] gives r(2)=0 and r(2/3)=2/3. Because ϕ(B)=0, both π~0(r(υ0)ϕ2) and π~0(r(υ0)ϕ) are zero, so R0cand(ϕ)=0. If used as a universal residual CLT variance, it predicts a post-resampling Gaussian limit with variance V0(ϕ)=π~0[υ02(ϕ−1/2)2]=1/3.

1.3F2givenalgebra

Put wˉN=2/3+(4/3)pN and uA=2/wˉN, uB=(2/3)/wˉN. On 1/4<pN<1/3, the normalized residual sizes are uA∈(1,2) and uB∈(0,1); hence each A particle receives one deterministic child, each B particle receives none, and R=N−MN children are sampled from the remainders. If XN is the number of residual children at A, then conditionally on the proposal sample, XN∼Bin(R,aN) with aN=MN(uA−1)/R. As pN↓1/4, R/N→3/4 and aN→1/3.

2.1F2step 1.3algebra

On that event, the post-resampling mean is (MN+XN)/N and its conditional mean is SN. A Taylor expansion of the binomial characteristic function, uniform for 0≤aN≤1 and R≤N, gives E ⁣[exp⁡ ⁣(iuXN−RaNN)|MN]=exp⁡ ⁣(−u22RNaN(1−aN)+O(N−1/2)). Thus, on the positive branch pN>1/4, the extra resampling fluctuation has limiting variance (3/4)(1/3)(2/3)=1/6.

2.2F2F3step 1.3algebra

On the negative branch with pN<1/4 and pN→1/4, one has uA∈(2,3) and uB∈(0,1). The floor for each A particle is two, and its total fractional remainder is MN(uA−2)=OP(N), because uA−2=2(1/wˉN−1)=OP(∣pN−1/4∣). Conditional variance of the residual A count is at most this total remainder. Consequently the variance of N times the post-resampling proportion about its weighted conditional mean is OP(N−1/2), so the extra resampling fluctuation tends to zero in probability on the negative branch. The events pN∉(1/5,1/3) have probability tending to zero by [F3].

3.1F5step 1.1step 2.1step 2.2step 1.2algebra∎

Put UN=N(ηˇ0N(ϕ)−SN), the post-resampling fluctuation centered at the weighted mean, and condition on the proposal count MN. For any real v,s, steps 2.1, 2.2 and the negligible exceptional event show that E[eisUN∣MN] converges in probability to e−s2/12 when ZN>0 and to 1 when ZN<0. Since ZN⇒Z and P(Z=0)=0, [F5] gives E[eivZN+isUN]⟶E ⁣[eivZ(1{Z>0}e−s2/12+1{Z<0})]. This is the joint characteristic function of (Z,1{Z>0}W) for an independent W∼N(0,1/6), so the post-resampling limit is Z+1{Z>0}W. Its mean is zero and its third moment is 3E[Z1{Z>0}]E[W2]>0, so it is not Gaussian. This contradicts the variance-1/3 Gaussian predicted in step 1.2.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Zero limiting remainder does not make finite residual offspring deterministic

Statement refuted

If π~(r(υ))=0, then standard residual resampling has deterministic offspring counts for every finite particle sample, so its residual covariance may always be set to zero.

Facts & Assumptions

Given: The residual-weight notation in Finite-horizon SMC CLT classes and variance recursions and the standard normalized-weight residual algorithm.

[F1]

Finite-horizon SMC CLT classes and variance recursions: r(u)=u−⌊u⌋ and a normalized Radon–Nikodym weight satisfies π~(υ)=1.

[F2]

Multinomial and residual offspring resampling: Residual counts are ⌊Npj⌋ plus multinomial draws from the fractional remainders of the normalized weights Npj.

Counterexample

Given: Let the proposal law on {A,C,B} assign probabilities (1/4,1/4,1/2), and let the importance weights be (2,2,0). Their proposal expectation is one, the target law is (1/2,1/2,0), and π~(r(υ))=0.

1.1F1givenalgebra

For N=3, the event that the proposal sample contains one A, one C, and one B has probability 3!(1/4)(1/4)(1/2)=3/16>0. On this event the total weight is four and the normalized weights are (1/2,1/2,0).

2.1F2step 1.1algebra∎

The scaled normalized weights are (NpA,NpC,NpB)=(3/2,3/2,0), so their floor counts are (1,1,0) and their fractional remainders are (1/2,1/2,0). By [F2] one residual child is drawn, with equal probability from A and C; hence the offspring-count vector is random although the limiting proposal remainder integral is zero. This contradicts the Statement.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A dominant particle weight and the effective sample size

Example

Use proposal probabilities q(A)=1/4, q(B)=3/4 and target probabilities π(A)=99/100, π(B)=1/100. Compute the weight-based effective sample size for four proposal draws containing one A and three B values.

Facts & Assumptions

Given: The proposal, target, and observed finite draw described in the Example.

[F1]

Finite-horizon SMC CLT classes and variance recursions: Importance weights are Radon–Nikodym derivatives of target law with respect to proposal law and have proposal mean one.

[F2]

Weight-based effective sample size: For nonnegative weights with positive sum, ESS⁡w=(∑iwi)2/∑iwi2; it depends only on observed weights.

Verification

Given: q(A)=1/4, q(B)=3/4, π(A)=99/100, and one observed A with three observed B values.

1.1F1givenalgebra

The proposal-to-target ratios are w(A)=π(A)/q(A)=99/25 and w(B)=π(B)/q(B)=1/75, and q(A)w(A)+q(B)w(B)=1. The event of exactly one A in four IID proposal draws has probability (41)(1/4)(3/4)3=27/64>0.

2.1F2step 1.1givenalgebra∎

The four unnormalized weights sum to 99/25+3/75=4, so their normalized values are 99/100,1/300,1/300,1/300. By [F2], ESS⁡w=((99/100)2+3(1/300)2)−1=75007351≈1.0203. The first particle carries 99% of the observed weight, which explains the low ESS; the calculation concerns weight concentration only.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Proposal mixing ratios alone do not bound SMC asymptotic variance over time

Statement refuted

Uniform bounds on the true transition density ratios g(x∣x′)/g(x∣x′′) and proposal density ratios qt(x∣x′)/qt(x∣x′′), together with a likelihood bounded above and away from zero and a bounded test oscillation, suffice by themselves to keep the SIR asymptotic variance Vt(ϕ) bounded uniformly in time.

Facts & Assumptions

Given: The finite-horizon SMC variance recursion, density-ratio conventions, and SIR target/proposal setup in the cited definition.

[F1]

Finite-horizon SMC CLT classes and variance recursions: Eth(x0:t−1)=∫kt(x0:t−1,dxt)υt(x0:t)h(x0:t) and Vt is the weighted-estimator asymptotic covariance.

[F2]

Multinomial SMC variance unrolls into local contributions: For multinomial SIR, Vt(ϕ) is the sum of the proposal expectations of υk2(Ek+1:t(ϕ−πtϕ))2 over 0≤k≤t.

Counterexample

Given: Let X={0,1} with counting measure, an initial state X0=0, and a one-point observation space with likelihood density f(∗∣x)=1. Let the true transition density be g(x∣x′)=1/2 for both x=0,1 and all x′. For t≥1, let the proposal be independent of the preceding state, with qt(1∣x′)=ϵt=2−t−2 and qt(0∣x′)=1−ϵt. Use ϕ(x0:t)=1{xt=1}.

1.1F1givenalgebra

For every pair of preceding states, both g(x∣x′)/g(x∣x′′) and qt(x∣x′)/qt(x∣x′′) equal 1. The likelihood satisfies 0<1≤f(∗∣x)≤1, and Δϕ=1. The filtering target at every t≥1 has last-state law πt(Xt=1)=1/2, while the proposal last-state law is qt. Its normalized incremental Radon–Nikodym weight is υt(1)=1/(2ϵt) and υt(0)=1/(2(1−ϵt)).

2.1F1F2step 1.1algebra

For every preceding path, the forward image of the centered test is Et(ϕ−1/2)=∑x=01qt(x∣xt−1)υt(x)(1{x=1}−1/2)=∑x=01g(x∣xt−1)(1{x=1}−1/2)=0. Consequently Ek+1:t(ϕ−πtϕ)=0 for every k<t, so all earlier-time terms in [F2] vanish.

3.1F2step 1.1step 2.1algebra∎

The remaining k=t term in [F2] is Vt(ϕ)=ϵt(12ϵt)214+(1−ϵt)(12(1−ϵt))214=116ϵt+116(1−ϵt). Since ϵt=2−t−2↓0, Vt(ϕ)→∞ despite all the stated ratio, likelihood, and oscillation bounds. Thus those conditions alone do not imply the claimed time-uniform variance bound.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A bounded-weight mixing filter has bounded asymptotic variance

Example

Let X={0,1}, set the initial target and proposal to the uniform law, and use at every step the true transition and proposal kernel K(x,⋅)=(1/2,1/2), with constant likelihood one. Thus all incremental weights equal one. For ϕ(x0:t)=1{xt=1}, compute the asymptotic variance and verify the time-uniform bound.

Facts & Assumptions

Given: The two-state model, its uniform transition/proposal kernel, unit likelihood and test in the Example.

[F1]

Finite-horizon SMC CLT classes and variance recursions: If target and proposal transitions agree and likelihood is one, then υs=1, and for last-state tests h(x0:s)=hs(xs) the restricted operator is Eshs=Khs.

[F2]

Dobrushin contraction coefficient for a probability kernel: δ(K) is the supremum total-variation distance between two transition rows.

[F3]

Uniform density ratios bound the Dobrushin coefficient: A common density ratio bound C implies δ(K)≤1−C−1.

[F4]

Centered filtering Feynman–Kac operators contract terminal tests: the stated filtering density row bound C gives a centered last-state image estimate with A=C and ρ=1−C−2.

[F5]

Time-uniform SMC asymptotic variance under uniform weight and operator bounds: bounded weights and the multistep centered-image bound give Vt(ϕ)≤A2B2(Δϕ)2/(1−ρ2).

Verification

Given: The finite two-state filtering model in the Example.

1.1F1F2F3givenalgebra

Every transition row is (1/2,1/2), so the target and proposal transitions coincide and the likelihood contributes no correction. By [F1], υs=1, hence B=1, and πs is uniform for every s≥0. Since the row does not depend on its predecessor, [F2] gives δ(K)=0; its density rows are identical, so [F3] also applies with C=1.

1.2F1F4givenalgebra

On the closed last-state subspace the forward operator is Eshs=Khs, which maps a last-state test to its uniform average. The true transition and proposal density versions relative to counting measure are all 1/2, so [F4] applies with C=1, A=1, and ρ=0. No contraction of arbitrary path-history functions is asserted. The test has Δϕ=1 and is centered by 1/2. Every earlier backward image is zero; the final k=t term in the variance expansion is Var⁡πt(ϕ)=1/4. Hence Vt(ϕ)=1/4 for every t.

2.1F5step 1.1step 1.2∎

Applying [F5] with A=B=1, ρ=0 and Δϕ=1 gives Vt(ϕ)≤1, uniformly in t; the exact variance 1/4 from step 1.2 satisfies the bound. This verifies a time-uniform asymptotic-variance result under explicit mixing and weight conditions.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Fixed-horizon asymptotic variance can grow without mixing

Example

Let X={0,1} have the uniform target and proposal at time zero. Use identity mutation, unit incremental weights, and multinomial resampling at every time. For each fixed horizon t, take ϕ(x0:t)=1{xt=1}. Compute the fixed-horizon asymptotic variance and compare its dependence on t with a time-uniform bound.

Facts & Assumptions

Given: The uniform initial law, identity mutation, unit weights, multinomial selection, and terminal indicator in the Example.

[F1]

Finite-horizon SMC CLT classes and variance recursions: With identity mutation and unit weights, Esh=h and πs=π0.

[F2]

Multinomial SMC variance unrolls into local contributions: Vt(ϕ) is the sum of the proposal expectations of squared backward images of ϕ−πtϕ over k=0,…,t.

[F3]

Fixed-horizon SMC central limit theorem with multinomial resampling: For each fixed horizon and the stated class, the weighted estimate has CLT variance Vt(ϕ) and the post-resampling estimate has variance Vt(ϕ)+Var⁡πt(ϕ).

Verification

Given: The finite-state identity-mutation filter in the Example and any fixed integer t≥0.

1.1F1F2givenalgebra

The identity kernel leaves the uniform law invariant and has incremental weight one. Thus [F1] gives Ek+1:t(ϕ−πtϕ)=ϕ−1/2 for every k≤t. Since (ϕ−1/2)2=1/4 everywhere, each of the t+1 summands in [F2] equals 1/4. Therefore Vt(ϕ)=(t+1)/4.

2.1F3step 1.1algebra∎

By [F3], at every fixed t the weighted estimate has a valid CLT with variance (t+1)/4, and the post-resampling estimate has variance (t+2)/4. Both variance sequences are unbounded as t ranges over the integers. The fixed-horizon theorem therefore supplies no uniform-in-time variance bound or finite-particle accuracy guarantee.

Sources