Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge 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.

Fixed-level SIR has an absolute O(L/N) mean-square bound

Statement

Assume AC. Use the full-resampling fixed-level SIR model of Full-resampling fixed-level SIR splitting with invariant mutations on nested levels A0⊇⋯⊇AL, with N≥1 particles and positive finite prefixes Zp=P(Ap)>0. Its event potentials satisfy 0≤Gp≤1. Then E[p^]=P(AL),E[(p^−P(AL))2]=Var⁡(p^)≤L+14N. The bound is an absolute mean-square error bound for fixed L; it is not a relative-efficiency claim.

Facts & Assumptions

Given: The nested event model, L≥1, N≥1, full multinomial resampling, transitions Mp, and indicator potentials Gp=1Ap in Full-resampling fixed-level SIR splitting with invariant mutations.

[A1]

The Axiom of Choice: AC is inherited through the canonical Feynman–Kac, SIR, and conditional-variance suppliers.

[F1]

Nested rare-event levels and conditional laws: Zp=P(Ap)∈(0,1] for each prefix, and the target is P(AL).

[F2]

Full-resampling fixed-level SIR splitting with invariant mutations: The particle normalizer is multiplied at step p by the empirical mean of Gp; full multinomial resampling followed by Mp supplies conditionally independent proposals from the current weighted empirical law followed by Mp.

[F3]

A bounded-potential SIR update has a uniform unnormalized variance bound: Given z∈[0,1], a probability law ν, transition Mp, potential Gp∈[0,1], and test f∈[0,1], the unnormalized update has conditional mean zνMp(Gpf) and conditional variance at most z2/(4N).

[F4]

Fixed-level full-resampling SIR splitting is unbiased: Under positive prefixes and full resampling, E[p^]=ZL=P(AL).

[F5]

Feynman–Kac path targets and normalizers: The finite-horizon normalizer is the integral of the ordered product of potentials against the initial law and transition kernels.

[F6]

Unbiasedness and exact variance of the IID Monte Carlo mean: The mean of N IID square-integrable variables has variance equal to the common variance divided by N.

[F7]

Conditional variance decomposition: For square-integrable X, Var⁡(X)=E[Var⁡(X∣G)]+Var⁡(E[X∣G]).

[F8]

Moments, variance, and covariance on a probability space: Variance is the expectation of the centered square.

Proof

1.1A1F1F4given

By [F4], the estimate is unbiased for ZL=P(AL), so its mean-square error equals its variance.

1.2F1F2F5giveninduction

Set QL≡1, and recursively Qp−1=Mp(GpQp) for p=L,…,1. Since Mp is a probability kernel and 0≤Gp≤1, backward induction gives 0≤Qp≤1. By [F5], ZL=P(AL)=∫Q0 dP.

2.1A1F2F3step 1.2givenalgebra

Let ΓpN=Z^pηpN be the unnormalized weighted empirical measure after level p, and put Up=ΓpN(Qp). Conditional on the particle history through level p−1, [F2] gives IID proposals from ηp−1NMp; applying [F3] with z=Z^p−1, ν=ηp−1N, and f=Qp yields E[Up∣Fp−1]=Z^p−1ηp−1N(Mp(GpQp))=Up−1,Var⁡(Up∣Fp−1)≤Z^p−1 24N≤14N. Here the final inequality holds because Z^p−1 is a product of averages of potentials in [0,1].

3.1A1F2F6F7F8step 2.1giveninduction

The initial particles are IID from P, so U0=N−1∑i=1NQ0(X0i). Since Q02≤Q0, [F8] gives Var⁡(Q0(X0))≤EQ0−(EQ0)2≤1/4; [F6] then gives Var⁡(U0)≤1/(4N). Iterating [F7] with the conditional mean identity from step 2.1 gives Var⁡(UL)=Var⁡(U0)+∑p=1LE[Var⁡(Up∣Fp−1)]≤L+14N.

4.1F4step 1.1step 3.1algebra∎

Since QL≡1, UL=ΓLN(1)=Z^L=p^. Step 1.1 and step 3.1 prove both assertions. The constant does not involve P(AL), so no lower bound on the event probability is needed for this absolute error bound.

Boundary notes

The bound uses indicator potentials in [0,1], full multinomial resampling, and positive finite prefixes. It does not bound relative error or a family with unbounded numbers of levels.

Source notes

The cited SMC paper treats related nonasymptotic variance bounds with additional domination assumptions. The absolute (L+1)/(4N) estimate here is proved locally from the one-step lemma and bounded-potential backward recursion; the citation is context, not a claim that the source states this exact bound.

Depends on

Used by

Dependency tree · two levels

32 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