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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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