Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

The perturbed-observation EnKF converges to the Kalman filter at fixed horizon

Statement

Assume AC and a finite-horizon model from Linear-Gaussian state-space models with independent noises with Xk=FkXk−1+qk, Yk=HkXk+rk, positive-semidefinite P0,Qk, and positive-definite observation covariances Rk. Fix data values y1:T. For each N≥2, initialize the perturbed-observation EnKF of Perturbed-observation ensemble Kalman filter with iid N(m0,P0) members, and at each k use independent per-member draws qN,ik∼N(0,Qk) and ηN,ik∼N(0,Rk), independent across times and members and of the initial ensemble. Use the divisor-N sample covariance specified in that algorithm. Write XˉNa,k and CNa,k for the updated empirical mean and covariance, and πk(⋅;y1:k)=N(mk∣k,Pk∣k) for the exact Kalman filtering law. Then, for each fixed k≤T, XˉNa,k→Pmk∣k,CNa,k→PPk∣k. Moreover, for every fixed bounded Lipschitz function φ:Rdk→R, N−1∑i=1Nφ(XN,ia,k)→P∫φ(x) πk(dx;y1:k). The horizon is fixed while N→∞; no uniform-in-time error bound is asserted. The exact conclusion is restricted to linear-Gaussian dynamics and observations. It does not make nonlinear finite-ensemble EnKF exact.

Facts & Assumptions

Given: AC, the finite-horizon linear-Gaussian model, Rk≻0, fixed observations, and the independent per-member initial and perturbation draws in the Statement.

[A1]

AC is used by the Gaussian-law and exact-filter suppliers. The Axiom of Choice

[F1]

The model has affine state and observation equations, independent Gaussian initial/process/observation noises, and positive-semidefinite state and process covariances. Linear-Gaussian state-space models with independent noises

[F2]

The perturbed-observation EnKF forms a common gain from the empirical forecast covariance and updates each member with its own perturbed datum. Perturbed-observation ensemble Kalman filter

[F3]

The Kalman algorithm's forecast and analysis equations are mf=Fkm, Pf=FkPFkT+Qk, ma=mf+K(yk−Hkmf), and Pa=Pf−KSkKT. Exact linear-Gaussian Kalman filter

[F4]

For the stated model and positive-definite innovations, those Kalman recursions give the exact Gaussian conditional law at every data history. The finite-horizon linear-Gaussian Kalman filter is exact

[F5]

A real symmetric matrix has an orthonormal eigenbasis; if it dominates Rk≻0 in quadratic form, its inverse operator norm is at most 1/λmin⁡(Rk). Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis

[F6]

Expectations of products of independent integrable random variables factor into products of expectations. Expectations factor over finite products of independent random variables

[F7]

For a nonnegative measurable W and t>0, P(W≥t)≤t−1EW. Chebyshev-Markov inequality for the integral

[F8]

A finite independent stack of Gaussian vectors is jointly Gaussian, including when its covariance blocks are singular. A finite stack of independent Gaussian vectors is jointly Gaussian

[L1]

Jointly exchangeable input rows remain jointly exchangeable after the permutation-equivariant perturbed-observation update. The perturbed-observation EnKF update preserves exchangeability

[L2]

If an exchangeable row is close in L4 to an iid row with finite fourth moment, its divisor-N sample mean and covariance converge in probability to the iid moments. Sample covariance converges for exchangeable arrays close in L4 to iid rows

[L3]

The deterministic-gain perturbed-observation reference ensemble is iid with the exact Kalman filtering law at every fixed time. Independent perturbed-observation reference members follow the Kalman filter

[L4]

The finite-horizon EnKF state and gain have moments of every finite order bounded uniformly in N and member index when Rk≻0. Uniform finite-horizon moment bounds for perturbed-observation EnKF ensembles

[L5]

Convergence in probability plus a uniform higher-moment bound implies convergence in every lower finite Lp. Convergence in probability plus a higher-moment bound implies Lp convergence

Proof

Given: The model, observations, and EnKF and Kalman procedures in the Statement.

1.1A1givenbase

Couple the EnKF members with a reference ensemble by using the same iid initial vectors, process-error draws, and perturbed observations. At time 0, XN,ia,0=UN,ia,0, so the paired row is exchangeable and the memberwise difference is zero in every finite Lp.

2.1F1F2F3F8L3givenstep 1.1IHalgebra

Fix k∈{1,…,T} and assume the induction hypothesis: the paired analysis row (XN,ia,k−1,UN,ia,k−1)i=1N is exchangeable and ∥XN,1a,k−1−UN,1a,k−1∥p→0 for every finite p. Couple the forecasts with the same qN,ik; then XN,if,k−UN,if,k=Fk(XN,ia,k−1−UN,ia,k−1). Thus forecast differences tend to zero in every finite Lp. The independent iid process-error and observation-perturbation rows have permutation-invariant laws and are independent of the paired analysis row; their product with that row is permutation-invariant, and the same forecast map is applied to each member. Hence the forecast pair row with its perturbations is exchangeable. By [F8] and [F1], each reference forecast is Gaussian, with mean and covariance mf=Fkmk−1∣k−1 and Pf=FkPk−1∣k−1FkT+Qk as in [F3]; independence across members follows from the independent per-member inputs.

3.1F1F2F3F5L2givenstep 2.1algebra

Apply [L2] to the forecast pair row with p=4. The reference forecast covariance is Pk∣k−1 by [F1] and [F3], so CNf,k→Pk∣k−1 in probability. Since Rk≻0, both SN=HkCNf,kHkT+Rk and S=HkPk∣k−1HkT+Rk dominate Rk in quadratic form. [F5] bounds both inverse operator norms by 1/λmin⁡(Rk). The identity SN−1−S−1=SN−1(S−SN)S−1 therefore gives KNk=CNf,kHkTSN−1→Kk=Pk∣k−1HkTS−1 in probability.

4.1F2L1L3givenstep 2.1step 3.1algebra

Let DN,ik=yk+ηN,ik. Subtracting the reference update from the EnKF update yields XN,ia,k−UN,ia,k=(I−KNkHk)(XN,if,k−UN,if,k)+(KNk−Kk)(DN,ik−HkUN,if,k). The first factor in the first product is bounded in probability because KNk→Kk in probability. The first factor in the second product tends to zero in probability, while DN,ik−HkUN,if,k has a fixed finite-moment Gaussian law. Splitting on whether this latter norm exceeds an arbitrary M shows the product tends to zero in probability. The same bounded-in-probability argument for the first product gives XN,1a,k−UN,1a,k→0 in probability. By [L1], the updated paired row is exchangeable.

5.1L3L4L5step 2.1step 4.1algebra

The uniform moment bounds [L4] and the Gaussian reference law [L3] give a uniform bound on E∥XN,1a,k−UN,1a,k∥s for every finite s. Apply [L5] with any s>p to the probability convergence in step 4.1; the memberwise difference tends to zero in Lp for every finite p. Together, the preceding steps establish the induction hypothesis at time k.

6.1A1F4F6F7L1L2L3step 1.1step 5.1algebra

At any fixed k, the paired row is exchangeable, the reference members are iid with law πk by [L3], and [F4] identifies that Kalman law with the exact filtering law at the fixed data. At k=0, the memberwise difference is identically zero by step 1.1, hence tends to zero in L4; for k≥1, it tends to zero in L4 by step 5.1. The sample-moment result [L2] gives the claimed mean and covariance convergence. For bounded Lipschitz φ, the empirical-average difference is at most Lip⁡(φ)N−1∑i∥XN,ia,k−UN,ia,k∥; its expectation tends to zero by exchangeability and the L1 convergence in step 1.1 when k=0 and step 5.1 when k≥1, so the pointwise bound P(W≥t)≤t−1EW from [F7] makes it vanish in probability. For the iid reference average, independence [F6] makes all distinct centered cross terms have expectation zero, so its variance is Var⁡(φ(UN,1a,k))/N≤∥φ∥∞2/N. Apply [F7] to its squared centered deviation at threshold ϵ2 to obtain convergence in probability to ∫φ dπk. This proves the limits for each fixed k.

7.1step 1.1step 5.1step 6.1discharge-induction: step 1.1step 5.1∎

Step 1.1 is the base case, and for every k≥1 the four induction steps establish the induction hypothesis at time k from time k−1. Thus the coupling bounds hold through T, and step 6.1 gives the three asserted limits for every fixed k≤T.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

70 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