Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

Feynman–Kac targets and sequential particle filters — Examples

1 · Prerequisites

2 · Summary

Objective

Finite calculations compare bootstrap and informed proposals, show how missing proposal support loses positive target mass, and compute multinomial versus residual offspring counts for one weight vector. The examples illustrate the scope of the general identities without claiming general finite-particle accuracy or a uniform variance ordering for the resampling schemes.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Multinomial and residual resampling on three weights

Example

Resample N=5 particles from normalized weights p=(31/50,7/25,1/10,0,0)=(0.62,0.28,0.10,0,0). The last two particles have zero weight, so compare the three nonzero-weight coordinates; both zero-weight offspring counts remain zero. Compare the expected offspring counts and marginal count variances for the multinomial and residual schemes.

Facts & Assumptions

Given: The normalized weights and the two procedures in the Example.

[F1]

Multinomial and residual offspring resampling: Multinomial counts are sums of conditionally independent categorical indicators; residual counts add integer floors to categorical draws from normalized fractional remainders.

[F2]

Multinomial and residual resampling have unbiased offspring counts: Both schemes have conditional expected count Npj for each particle.

Verification

Given: N=5 and p=(31/50,7/25,1/10,0,0).

1.1F2givenalgebra

The vector is a probability vector, and Np=(31/10,7/5,1/2,0,0)=(3.1,1.4,0.5,0,0). By [F2], both schemes therefore have those expected counts.

1.2F1givenalgebra

In multinomial resampling each count is a sum of five independent Bernoulli indicators with success probability pj, so its variance is 5pj(1−pj). The first three marginal variances are 1.178, 1.008, and 0.45; the last two are zero.

1.3F1givenalgebra

Residual resampling has deterministic floors (3,1,0,0,0) and fractional remainders (0.1,0.4,0.5,0,0), whose sum is R=1. It draws one extra index with these probabilities, so the marginal count variances are 0.1(0.9)=0.09, 0.4(0.6)=0.24, and 0.5(0.5)=0.25 on the first three coordinates, with variance zero on the last two.

2.1step 1.2step 1.3algebra∎

The expected counts agree componentwise, while for these weights each of the first three residual marginal variances is smaller than its multinomial counterpart, while the last two variances are zero in both schemes. This is a calculation for this input vector, not a general variance-ordering claim.

Remarks

The comparison concerns offspring counts only. It does not compare posterior accuracy or claim that residual resampling uniformly improves every statistic.

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Bootstrap and informed proposals on a two-state particle filter

Example

Let X0={∗} and X1={a,b} with counting sigma-algebras. Set μ0=ν0=δ∗, M1(∗,{a})=M1(∗,{b})=1/2, G0(∗)=1, G1(a)=1/5, and G1(b)=4/5. Compare the bootstrap proposal R1=M1 with the informed proposal R1(∗,{a})=1/5, R1(∗,{b})=4/5. With one particle, the bootstrap normalizer estimate is random, while the informed proposal gives the exact normalizer at this horizon.

Facts & Assumptions

Given: The finite model in the Example and the one-particle algorithm.

[F1]

Feynman–Kac path targets and normalizers: The path target weights the initial/transition path law by the product of the nonnegative potentials, and normalizes only for a finite positive normalizer.

[F2]

Sequential importance resampling for Feynman–Kac path targets: The initial and incremental particle weights are G0ρ0 and Gkrk, and the normalizer estimate is the product of their sample averages.

[F3]

Ordinary importance sampling: For a target density p~ and proposal density q, the ordinary importance weight is proportional to p~/q.

[F4]

Ordinary importance sampling is unbiased: Under positive proposal support on the target integrand and integrability, the ordinary importance-sampling estimator has expectation equal to the target expectation.

Verification

Given: Counting measure on {a,b}, one particle, and the model specified above.

1.1F1givenalgebra

The unnormalized path masses are γ1(a)=M1(∗,{a})G1(a)=1/10 and γ1(b)=M1(∗,{b})G1(b)=2/5. Thus Z1=1/2 and the normalized target masses are (1/5,4/5).

2.1F2step 1.1algebra

For the bootstrap proposal, ρ0=1 and r1(a)=r1(b)=1. The one-particle incremental weight is therefore 1/5 with probability 1/2 and 4/5 with probability 1/2, so its expectation is 1/2 but it is not constant.

2.2F2step 1.1algebra

For the informed proposal, r1(a)=(1/2)/(1/5)=5/2 and r1(b)=(1/2)/(4/5)=5/8. Multiplication by G1 gives G1(a)r1(a)=G1(b)r1(b)=1/2, so the one-particle normalizer estimate equals Z1 for either sampled state.

3.1F3F4step 1.1step 2.1step 2.2algebra∎

Against counting measure, the unnormalized target density is p~(a)=1/10, p~(b)=2/5, and both proposal densities are strictly positive, so the support and finite-integrability hypotheses of [F4] hold. Setting f=1 in [F4] gives EQ[p~(X)/q(X)]=Z1 after multiplying the unbiased normalized estimate by Z1; the explicit bootstrap and informed weights above are exactly these ordinary importance-sampling ratios.

Remarks

The informed proposal is tailored to this single fixed potential and horizon. This finite example makes no claim that such a proposal is generally available or computationally cheaper.

CounterexampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A particle proposal can miss positive target mass

Statement refuted

False claim: The transition support condition Mk(x,⋅)≪Rk(x,⋅) may be dropped while the same proposal-weighted particle measure still represents the Feynman–Kac target.

Facts & Assumptions

Given: The finite model and proposal in the Counterexample.

[F1]

Feynman–Kac path targets and normalizers: The unnormalized path law is the initial/transition path law weighted by the product of the specified potentials.

[F2]

Sequential importance resampling for Feynman–Kac path targets: Particle paths are proposed using Rk and then weighted using the target-to-proposal kernel derivative; the procedure requires the support and derivative hypotheses in its definition.

Counterexample

1.1F1givenalgebra

Let X0={∗} and X1={a,b}. Take μ0=ν0=δ∗, M1(∗,{a})=M1(∗,{b})=1/2, R1(∗,{a})=1, R1(∗,{b})=0, and G0=G1=1. By [F1], γ1 is the transition law itself, Z1=1, and the normalized target assigns mass 1/2 to b.

2.1F2step 1.1given

The support premise fails because M1(∗,{b})=1/2 while R1(∗,{b})=0. A proposal path drawn from Q1=ν0R1 equals (∗,a) with probability one, so every empirical measure formed from such paths assigns mass zero to the event {x1=b}.

3.1step 1.1step 2.1algebra∎

If a kernel derivative r1 represented M1(∗,⋅) with respect to R1(∗,⋅), then M1(∗,{b})=∫{b}r1(∗,y)R1(∗,dy)=0, contradicting the value 1/2. Thus the required importance weight does not exist on this target-positive, proposal-null set, and the false claim fails.

Remarks

The example refutes target coverage after support failure; it does not assert that every numerical normalizer estimate must be biased when support fails.

Sources