Alphabeta Math
TheoremStatement: 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.

Fixed-horizon particle backward smoothing is consistent under stated conditions

Statement

Assume AC and a finite-horizon state-space model with compact metric state spaces E0,…,ET, dominated observation kernels, and an observation history y1:T in the full-measure finite-positive set where Bayes factorization of the smoothing backward kernel applies. Let gt(x,y) be the specified product-measurable observation density relative to its sigma-finite observation measure, as in Exact state-space filtering recursion under dominated observations, and set Gt(x)=gt(x,yt) for 1≤t≤T and G0≡1. Suppose each Gt is continuous and there are constants 0<c≤1≤C<∞ such that c≤Gt(x)≤C for every state and time. For each 0≤t<T, let Mt+1 be the state transition from time t to time t+1 and suppose it has a jointly continuous density ft+1(x′∣x) relative to a Borel probability measure λt+1, meaning Mt+1(x,A)=∫Aft+1(x′∣x) λt+1(dx′) for measurable A, with uniform bounds 0<a≤ft+1(x′∣x)≤b<∞ for all x,x′. Write ηt for the exact filtering-kernel value at y1:t and ψT for the exact smoothing-kernel value at y1:T. Use the model initial law as the initial proposal, these same Mt as transition proposals, and these Gt as potentials in the multinomial bootstrap particle filter. With N≥1 particles, independently draw SN≥1 backward paths conditional on the resulting clouds, where SN→∞ as N→∞. Let ψ^TN be the conditional law of one backward-simulated path given the clouds. For every continuous Φ:E0×⋯×ET→R, ψ^TN(Φ)→ψT(Φ)in probability,1SN∑s=1SNΦ(X~0:Ts)→ψT(Φ)in probability. For a fixed number of simulated paths, their conditional path law is consistent but the empirical path average retains its Monte Carlo error. No time-uniform-in-T convergence claim is made.

Facts & Assumptions

Given: The assumptions above, fixed observations with finite positive evidence, and a bounded continuous test function Φ on the compact path space.

[A1]

AC is used through the finite-horizon Feynman–Kac and conditional smoothing-law constructions. The Axiom of Choice

[F1]

The filtering empirical measures converge weakly in probability under the bounded positive-potential, Feller, multinomial bootstrap assumptions. Finite-horizon bootstrap particle filters are weakly consistent

[F2]

The exact smoother factors into its terminal filtering law and the exact backward conditional kernels. Bayes factorization of the smoothing backward kernel

[F3]

Given filtering particles, the particle backward kernel weights each candidate state by its filter weight times the transition density and normalizes by the predictive density. Particle backward simulator

[F4]

Weak convergence tests against bounded continuous functions. Weak convergence of borel probability measures

[F5]

The nonnegative integral inequality bounds probabilities of squared deviations. Chebyshev-Markov inequality for the integral

[F6]

The observation-density recursion identifies each filtering kernel with the normalized Feynman–Kac update using Gt(x)=gt(x,yt) on finite-positive evidence histories. Exact state-space filtering recursion under dominated observations

Proof

Given: The hypotheses in the Statement.

1.1givenalgebra

For each 0≤t<T, let h be bounded continuous and let xn→x. Uniform continuity of ft+1 on the compact product gives sup⁡x′∣ft+1(x′∣xn)−ft+1(x′∣x)∣→0. Since λt+1 is a probability measure, ∣Mt+1h(xn)−Mt+1h(x)∣≤∥h∥∞sup⁡x′∣ft+1(x′∣xn)−ft+1(x′∣x)∣→0. Thus each transition is Feller.

2.1A1F1F2F3F6step 1.1given

By [F1] and [F6], for every 0≤t≤T the random filtering measure ηtN converges weakly in probability to the exact filtering law ηt at the fixed observation history. For each 0≤t<T, put qt+1(x′)=∫ft+1(x′∣x)ηt(dx) and qt+1N(x′)=∫ft+1(x′∣x)ηtN(dx). The density bounds imply a≤qt+1(x′),qt+1N(x′)≤b for every x′, so every backward denominator used by the algorithm is finite positive.

3.1F1F2F3step 2.1given

Fix 0≤t<T and a continuous h on Et. The families x↦ft+1(x′∣x) and x↦h(x)ft+1(x′∣x) indexed by x′∈Et+1 are uniformly bounded and equicontinuous: joint continuity on the compact product is uniformly continuous. For any ϵ>0, a finite ϵ-net of the compact parameter space gives a finite sup-norm net for each family. Weak convergence in probability from step 2.1 gives convergence of the integrals for every function in each finite net; since all measures have mass one, replacing a family member by a net function changes either integral by at most ϵ. Letting ϵ↓0 proves uniform-in-x′ convergence of both numerators and denominators. Division is stable because all denominators are at least a, so sup⁡x′∣BtNh(x′)−Bth(x′)∣→0 in probability for the empirical and exact backward kernels. The exact function Bth is continuous by dominated convergence.

3.2F2F3step 2.1givenalgebra

For each 0≤t<T, set ωf(δ)=sup⁡x,x′,x′′:d(x′,x′′)≤δ∣ft+1(x′∣x)−ft+1(x′′∣x)∣, which tends to zero by uniform continuity. The exact and empirical backward kernels have densities ft+1(x′∣x)/qt+1(x′) relative to ηt and ft+1(x′∣x)/qt+1N(x′) relative to ηtN, respectively. Using [F2]–[F3], q,qN∈[a,b] from step 2.1, and that both filtering measures have mass one, their total-variation distance at x′,x′′ is at most ωf(δ)(a−1+ba−2). Indeed, if H(u,x) is a continuous integrand indexed by remaining coordinates u, and xu′ denotes the next-state coordinate in u, then the difference of its integrals at u,u′ is bounded by sup⁡x∣H(u,x)−H(u′,x)∣+∥H∥∞∥B(⋅∣xu′)−B(⋅∣xu′′)∥TV; uniform continuity of H and the displayed kernel bound make this tend uniformly to zero as u′→u. Thus each backward integration preserves a common bound and modulus of equicontinuity over the remaining compact coordinates, uniformly over all particle clouds. Since T is finite, iterating this estimate yields one such class for every section in the finite telescoping sum.

4.1A1F1F2F3F4step 2.1step 3.1step 3.2given

Telescope the finite backward product by replacing one empirical kernel at a time with its exact counterpart. The uniform moduli from step 3.2 put every possible section, over all clouds and remaining coordinates, in a uniformly bounded equicontinuous class on a compact metric space. Such a class has a finite sup-norm net: choose a finite δ-net of the domain at a scale given by equicontinuity, quantize the bounded function values on those finitely many points, and retain one representative for each nonempty quantized pattern. Step 3.1 gives convergence for each fixed test in this finite net; since kernels are probabilities, the sup-norm approximation changes an integral difference by at most twice the net radius. The same finite-net argument and [F1] give convergence of the terminal empirical integrals uniformly over the resulting class. Thus every term in the finite telescoping sum tends to zero in probability, and the conditional path law ψ^TN converges weakly in the sense of [F4] to the exact product law ψT in [F2].

5.1F3F5step 4.1given∎

Conditional on the particle clouds, the SN backward paths are IID with law ψ^TN. Their conditional sample mean has variance at most ∥Φ∥∞2/SN. Applying [F5] to its squared centered deviation shows that its difference from ψ^TN(Φ) converges to zero in probability because SN→∞. Combining this with step 4.1 proves the second limit. If SN is fixed, this variance bound need not vanish, so no convergence of the path average is asserted.

Depends on

Used by

Nothing in the library uses this result yet.

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