Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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