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.

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.

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