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.

Particle smoothing, backward simulation, and Rao–Blackwellized filters — Examples

1 · Prerequisites

2 · Summary

These examples compute a two-mode Gaussian mixture by conditioning on each nonlinear mode, show why an incompatible terminal particle can make the backward density denominator vanish, and give a finite-state case where a later observation changes the full smoothing law by total variation 1/2. They separate exact conditional Gaussian calculations from finite-particle approximation and fixed-lag truncation bias.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedOpen item page →

A two-mode linear-Gaussian Rao–Blackwellized filter

Example

Let Z0 be uniform on {0,1} and let Z1=Z0. Conditional on Z0=z, take U0∼N(0,1) and U1=azU0+ξ1,Y1=U1+ε1, where a0=0, a1=1, and ξ1,ε1 are independent N(0,1) variables, independent of U0. Observe Y1=0. The exact conditional posterior is the two-component mixture L(U1,Z1∣Y1=0)=33+2N(0,1/2)⊗δ0+23+2N(0,2/3)⊗δ1. These are the component moments and mode weights that the Rao–Blackwellized filter represents analytically; a finite particle cloud still approximates the mode mixture.

Facts & Assumptions

Given: The finite model and observation in the Example.

[F1]

A conditionally linear-Gaussian state-space model has a Markov nonlinear component and a linear-Gaussian component conditional on its nonlinear path. Conditionally linear-Gaussian state-space model

[A1]

AC is inherited from the Gaussian-law and finite-horizon conditional-kernel conventions. The Axiom of Choice

[F2]

Conditional on a nonlinear path, the Kalman filter gives the exact Gaussian state filter and the marginal observation density. The Kalman filter is exact conditional on a nonlinear path

[F3]

The Rao–Blackwellized particle filter retains those conditional Gaussian components and weights nonlinear paths by their conditional observation densities. Rao–Blackwellized particle filter

[F4]

A positive-definite one-dimensional Gaussian covariance gives density (2πS)−1/2exp⁡(−v2/(2S)). A positive-definite multivariate normal law has its Gaussian density

Verification

Given: Z0∼Bernoulli⁡(1/2), Z1=Z0, the conditional Gaussian model stated in the Example, and Y1=0.

1.1A1F1F2given

The state and observation noises are independent centered Gaussians, the conditional initial covariance is 1, the process covariance is 1, and the observation covariance is 1>0. Thus the model satisfies [F1] and the exact conditional Kalman interface [F2].

1.2F2givenalgebra

Conditional on Z1=z, prediction gives m1∣0=0 and P1∣0=az2+1. Hence P1∣0=1 for z=0 and P1∣0=2 for z=1. The innovation is zero and the innovation variances are S0=2 and S1=3.

2.1A1F1F2F4step 1.2algebra

By [F4], the two conditional observation densities at zero are ℓ0=(4π)−1/2 and ℓ1=(6π)−1/2. Multiplying by the equal prior masses and normalizing gives P(Z1=0∣Y1=0)=3/(3+2) and P(Z1=1∣Y1=0)=2/(3+2).

3.1A1F2F3step 2.1algebra∎

The Kalman covariance update is P1∣1=P1∣0R/(P1∣0+R) here, so the two conditional posterior variances are 1/2 and 2/3; both conditional means remain zero. Mixing these exact conditional Gaussians with the mode probabilities from step 2.1 gives the displayed posterior. The filter in [F3] uses these same per-mode likelihoods and Gaussian components; only its finite particle approximation to the mode weights is random.

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

A zero backward-simulation denominator is inadmissible

Example

Take E0=E1={0,1} with counting measure, initial law δ0, and deterministic transition X1=X0. Its transition density is f1(x′∣x)=1 when x′=x and 0 otherwise. A supplied pair of particle clouds with time-zero particle x01=0,w01=1 and terminal particle x11=1,w11=1 has backward denominator ∑j=11w0jf1(x11∣x0j)=0. This terminal cloud is inconsistent with the transition and filtering law; the particle backward algorithm must report its density-mode input as inadmissible rather than inventing uniform backward weights.

Facts & Assumptions

Given: The two-state deterministic model and the supplied particle clouds in the Example.

[A1]

AC is inherited through the finite-horizon conditional-law convention used for the impossible conditioning fiber. The Axiom of Choice

[F1]

Conditional kernels and smoothing laws are versions on standard-Borel spaces; values on impossible conditioning fibers are not fixed by the conditional identities. Filtering, predictive, and smoothing laws in a finite-horizon state-space model

[F2]

A density-based backward kernel is normalized only when its predictive denominator is finite and positive. Bayes factorization of the smoothing backward kernel

[F3]

The particle backward algorithm requires finite positive denominators and declares other particle-mode inputs inadmissible. Particle backward simulator

Verification

Given: η0=δ0, f1(x′∣x)=1{x′=x}, and the particle weights and states in the Example.

1.1F2F3givenalgebra

Substitution gives f1(1∣0)=0 and w01=1, so the unique backward score is zero and its normalizing denominator is zero. No division by this quantity defines a probability vector.

2.1A1F1givenstep 1.1

The exact predictive law is η0M1=δ0, hence the terminal state 1 has predictive probability zero. By [A1] and [F1] a conditional version on this null fiber is not determined by the model's conditional identities, and the supplied cloud at 1 is not a possible output of the stated filter.

3.1A1F1F3step 1.1step 2.1∎

Because [F3] restricts the density-based backward draw to a finite positive denominator, the procedure rejects this input; a uniform choice would be an unsupported choice of conditional version, not a consequence of Bayes' formula.

ExampleConstruction: AI-generatedVerification: AI-adaptedOpen item page →

Delayed information creates fixed-lag smoothing bias

Example

Let X0∼Bernoulli⁡(1/2) and set X1=X0 and X2=X1. Let Y1=0 deterministically and Y2=X2. For target time t=0 and lag L=1, the fixed-lag procedure conditions only on Y1, whereas the full smoother also uses Y2. In the exact-kernel mode of Fixed-lag particle smoother, the lagged law is Bernoulli⁡(1/2) while, for either observed value Y2=b, the full smoothing marginal at time 0 is δb. Their total-variation distance under the convention sup⁡A∣μ(A)−ν(A)∣ is 1/2. Increasing the number of particles does not remove this truncation bias at fixed lag.

Facts & Assumptions

Given: The finite model, t=0, and L=1 in the Example.

[A1]

AC is inherited through the finite-horizon conditional-law convention for the supplied smoothing kernels. The Axiom of Choice

[F1]

A smoothing law is a conditional law of the full state path given the specified observation history. Filtering, predictive, and smoothing laws in a finite-horizon state-space model

[F2]

The backward conditional-kernel mode returns the exact smoother for the observations it is given, and fixed lag uses only Y1:min⁡(t+L,T). Fixed-lag particle smoother

[F3]

Exact backward conditional kernels factor the finite-horizon smoother. Bayes factorization of the smoothing backward kernel

[F4]

The exact-kernel fixed-lag branch targets the smoothing marginal with the truncated observation history. Exact-kernel fixed-lag smoothing targets the truncated conditional law

Verification

Given: P(X0=0)=P(X0=1)=1/2, X1=X2=X0, Y1=0, and Y2=X2.

1.1A1F1F2F4givenalgebra

Since Y1 is constant, conditioning on Y1 leaves the prior law of X0 unchanged. The time-0 target for lag 1 uses s0=min⁡(0+1,2)=1, so [F2] and [F4] give the lagged law Bernoulli⁡(1/2).

1.2A1F1F3givenalgebra

For each b∈{0,1}, the event Y2=b has probability 1/2. On this event, X0=X1=X2=b surely. Thus the full smoothing path law is δ(b,b,b), and its time-0 marginal is L(X0∣Y1=0,Y2=b)=δb.

2.1step 1.1step 1.2algebra∎

For A={b}, the probabilities under the lagged law and the full smoothing marginal at time 0 are 1/2 and 1, respectively; for any subset A⊆{0,1} their probability difference has absolute value at most 1/2. Hence sup⁡A∣Bernoulli⁡(1/2)(A)−δb(A)∣=1/2. This difference is between the truncated and full targets at time 0, so particle-count growth alone cannot remove it.

Sources