Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-23 (gpt-6.1-sol)
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.

EnKF large-ensemble scope and nonlinear limits

Remark

Assume the Axiom of Choice (AC), meaning every family of nonempty sets has a choice function, for the Gaussian-law construction. Fix a nonnegative integer horizon T∈Z≥0, positive integers mk for 0≤k≤T and pk for 1≤k≤T, matrices Fk∈Rmk×mk−1 and Hk∈Rpk×mk for 1≤k≤T, and a finite linear-Gaussian coefficient model ak=Fkak−1+qk,yk=Hkak+rk, where μ0∈Rm0, a0∼Nm0(μ0,P0), qk∼Nmk(0,Qk), and rk∼Npk(0,Rk) are mutually independent, P0,Qk are positive semidefinite, and Rk is positive definite. Fix arbitrary observation data y1:T. For each integer ensemble size N≥2, draw the initial members aN,ia,0 independently from Nm0(μ0,P0). At each k, draw process perturbations qN,ik∼Nmk(0,Qk) and observation perturbations ηN,ik∼Npk(0,Rk), with all these perturbations mutually independent across members and times and independent of the initial ensemble, and set aN,if,k=FkaN,ia,k−1+qN,ik. Define aˉNf,k=N−1∑iaN,if,k and the divisor-N covariance CNf,k=N−1∑i(aN,if,k−aˉNf,k)(aN,if,k−aˉNf,k)T. The common gain and perturbed-observation update are KNk=CNf,kHkT(HkCNf,kHkT+Rk)−1,aN,ia,k=aN,if,k+KNk(yk+ηN,ik−HkaN,if,k). Since CNf,k is positive semidefinite and Rk is positive definite, this inverse exists. Define the analysis empirical mean and covariance by aˉNa,k=N−1∑iaN,ia,k and CNa,k=N−1∑i(aN,ia,k−aˉNa,k)(aN,ia,k−aˉNa,k)T. Let mk∣k and Pk∣k be the mean and covariance produced by the exact Kalman recursion in the preceding filtering proposition, which defines an everywhere-defined Gaussian filtering law at every fixed history y1:k. At each fixed k≤T, aˉNa,k and CNa,k converge in probability to mk∣k and Pk∣k as N→∞; moreover, for each fixed bounded Lipschitz function φ:Rmk→R, N−1∑iφ(aN,ia,k) converges in probability to its integral under that filtering law. Here bounded Lipschitz means sup⁡x∣φ(x)∣<∞ and ∣φ(x)−φ(x′)∣≤L∥x−x′∥2 for some finite L and all x,x′. Convergence in probability means that for every ϵ>0, the probability that the error exceeds ϵ tends to zero; use Euclidean norm for vectors, Frobenius norm for matrices, and absolute value for scalars. All probabilities refer to the ensemble sampling just described. The horizon is fixed as N grows, with no uniform-in-time conclusion. At finite N, the common sample-covariance gain couples the update, and the theorem does not assert independent posterior samples or an exact posterior law for the ensemble. It covers the stated linear maps and perturbed-observation formula only. Covariance localization here means replacing the sample covariance by its entrywise product with a prescribed taper matrix; covariance inflation means rescaling the ensemble anomalies by a factor greater than one or adding a prescribed positive-semidefinite covariance; a transport update means applying a selected map to ensemble members instead of the displayed perturbed-observation formula. These modified procedures and nonlinear state or observation maps require their own statements and proofs. The claim is conditional on the chosen finite model; it is not a conclusion that a nonlinear fluid equation or an actual flow is described by it.

Depends on

Dependency tree · 2 levels

Sources