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

Uniform finite-horizon moment bounds for perturbed-observation EnKF ensembles

Statement

Fix a finite horizon linear-Gaussian model from Linear-Gaussian state-space models with independent noises, with each observation covariance Rk≻0. Run the perturbed-observation procedure of Perturbed-observation ensemble Kalman filter with iid Gaussian initial members and independent Gaussian process and observation perturbations having the model's laws. For every finite p≥1, there are constants ck,p for 0≤k≤T and bk,p for 1≤k≤T, independent of ensemble size N≥2 and member index i, such that sup⁡N,iE∥XN,ia,k∥p≤ck,p(0≤k≤T),sup⁡NE∥KNk∥opp≤bk,p(1≤k≤T). Here ∥⋅∥op is the Euclidean operator norm. The claim is for each fixed finite horizon, not a bound uniform in k as the horizon grows.

Facts & Assumptions

Given: The finite-horizon model, strictly positive-definite Rk, iid Gaussian initialization and independent per-member Gaussian noises in the Statement.

[A1]

AC is assumed for the multivariate-normal laws. The Axiom of Choice

[F1]

The algorithm uses the divisor-N empirical covariance, gain KN=Cxz(Czz+Rk)−1, and perturbed-observation update. Perturbed-observation ensemble Kalman filter

[F2]

Gaussian vectors with positive-semidefinite covariance are affine images of vectors with independent standard-normal coordinates. Multivariate normal law, including singular covariance

[F3]

A standard normal has density proportional to e−x2/2; hence it has finite absolute moments of every finite order. Standard normal and normal laws

[F5]

Holder's inequality bounds an expected product by the corresponding conjugate-moment norms. Holder's inequality for random variables

Proof

Given: The hypotheses in the Statement.

1.1A1F2F3givenbasealgebra

By [A1] and [F2]–[F3], each Gaussian vector is an affine image of finitely many standard normals. For every finite p, the integral of ∣x∣pe−x2/2 is finite because for sufficiently large ∣x∣, ∣x∣p≤ex2/4 and e−x2/4 is integrable; bounded intervals contribute a finite integral. Finite-dimensional triangle inequalities then give finite moments for each vector input, with laws independent of N and i. This proves the asserted state bound at k=0.

2.1F1F2F3givenstep 1.1IH

Assume the induction hypothesis that at time k−1 the state moments are bounded uniformly in N,i at every finite order. The forecast formula in [F1] is a fixed linear map plus a Gaussian process-error draw. The triangle inequality and (a+b)p≤2p−1(ap+bp) for a,b≥0 therefore give uniform bounds at every order for the forecast members XN,if,k.

3.1F1step 2.1algebra

Write the forecast sample covariance as CN=N−1∑iXiXiT−XˉXˉT. Since ∥xxT∥op=∥x∥2, Jensen's inequality for finite averages bounds the pth moment of the first term by N−1∑iE∥Xi∥2p and bounds E∥Xˉ∥2p by the same average. Thus [F1] and the forecast bounds in step 2.1 give sup⁡NE∥CN∥opp<∞ for every finite p.

4.1F1F4givenstep 3.1algebra

The matrix HkCNHkT is positive semidefinite, so SN=HkCNHkT+Rk has quadratic form at least that of Rk. Let rk>0 be the least eigenvalue of Rk, which exists by [F4]. Every eigenvalue of SN is at least rk, hence ∥SN−1∥op≤rk−1. It follows from KN=CNHkTSN−1 and step 3.1 that sup⁡NE∥KN∥opp<∞ at every finite order.

5.1F1F3F5givenstep 2.1step 4.1algebra

Let Di=yk+ηN,ik. The update in [F1] gives ∥XN,ia,k∥≤∥XN,if,k∥+∥KN∥op∥HkXN,if,k∥+∥KN∥op∥Di∥. Apply [F5] with exponent pair (2,2) to the middle product; for the last product use that Di is independent of KN and has finite Gaussian moments. The forecast, gain, and perturbation bounds in steps 2.1 and 4.1 therefore bound the pth moment of the updated state uniformly in N,i. This proves the induction step at time k.

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

Step 1.1 proves the state bound at time zero. For each k∈{1,…,T}, step 5.1 derives both the state and gain bounds at time k from the state bound at time k−1. Finite induction therefore proves the state bounds for every 0≤k≤T and the gain bounds for every 1≤k≤T, for each finite p.

Depends on

Used by

Dependency tree · two levels

38 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