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.

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ϕˉ.

Depends on

Used by

Dependency tree · two levels

7 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