Reason: Corrected successor to the flagged lem:kalman-filter-error-covariance-2026b: adds the missing hypothesis (H6) that the control set A is convex, required by the second-moment, fourth-moment, state-residual, and covariance-deviation lemmas invoked in the proof. · 11,051 chars · 31 deps · depth 21
Statement
Adopt the setting, hypotheses (H1)--(H4) and (C), and notation of the approximate Kalman filter and policy lemma: the fluctuation LQG data of the stationary mean-field triple(S,A,P) with matrices Et, Bt, E~t, Θt⋆, Θ~t⋆, the coefficient matrices Qt, Vt, Rt, Wt=ZtBt+21Vt, the feedback gain Gt=Rt−1Wt⊤, the filter covariance Π=(Πt)t∈[0,T] with initial value Π0 from (H4), the Kalman gain K~t=ΠtE~t⊤(Θ~t⋆)−1, and D~t=E~t⊤(Θ~t⋆)−1E~t. Fix a natural number N≥1, an N-agent driving system(Ω,F,P), and a projected solution as in conclusion 4 of the policy lemma: state processes σi, observation processes Υυ, the approximate Kalman control α, the approximate Kalman filter s^N, the regular event Ω0, the system filtration (Ftsys)t∈[0,T] (the system filtration of the solution definition), the empirical state measure Σt, and the observation total c~t with jump times τj and channels υj; this collection is a solution of the controlled N-agent dynamics for β, β~, and the approximate Kalman policy hN, by conclusion 4(a). Since (S,A) is a mean-field trajectory pair (part of the stationary triple), the fluctuation processesst=N(Σt−St) and at=N(αt−At) are defined; by conclusion 4(a) of the policy lemma, at=−χtGts^tN at every point of Ω0×[0,T], where χt is the clamp indicator of that conclusion, equal to 1 at those (t,ω) at which At−N−1/2Gts^tN lies in the control set A and to 0 otherwise. Define the clamp remainder
wt=(1−χt)BtGts^tN∈Rl(t∈[0,T]),
which vanishes at every point at which the clamp is inactive; it is the exact defect in the cancellation Btat+BtGts^tN=wt of the control terms of the state and filter equations. Let es be the state linearization residual of this solution about (S,A) (whose linearization matrices Es and Bs coincide with Es and Bs, by the identical defining formulas of clauses 1 and 2 of the fluctuation LQG data), let e~s be the observation linearization residual (whose observation linearization matrix coincides with E~s, as noted there), let Mt be the state martingale vector of the martingale decomposition (not to be confused with the closed-loop matrix Mt=Et−BtGt−K~tE~t used in the proof below, written Mt in the policy lemma), and let
J~t=J~tK~
be the weighted compensated observation sum with weight F=K~ (admissible there: all entries of t↦K~t are continuous by conclusion 2 of the policy lemma; fix a real CK~≥0 bounding them in absolute value, their absolute values attaining a maximum by the extreme value theorem). Throughout, a real-valued function on a subinterval I of the real numbersR is called continuous on I when it is continuous relative to I, both I and the codomain R carrying the metric of the real line. Write E for the expectation, ∣⋅∣ for the Euclidean norm (Euclidean distance to the origin), 1Ω0 for the indicator of Ω0, and adopt the matrix entry notation of the completion-of-squares theorem: x⋅My=∑p,qMpqxpyq, (MM′)pq=∑rMprM′rq, (M⊤)qp=Mpq. Let Θ be the aggregate fluctuation covariance of β and b~ the aggregate observation drift of β~. Define the filter error
εt=st−s^tN∈Rl(t∈[0,T]),
and set
κ0=1+E[∣s0∣4],
which is finite because ∣s0∣≤2N everywhere (any two points of the probability simplex being at Euclidean distance at most 2). Assume in addition:
(H5) (Interior mean-field control.) There is a real ϱ>0 such that for every t∈[0,T] every a∈Rm with ∣a−At∣≤ϱ lies in the control set A. (The letter ϱ is used for this constant because δ is reserved throughout for a matrix index.)
(H6) (Convex control set.) The control set A is convex.
Then:
(a) (Finiteness and well-definedness.) The control energies
In particular each t↦ΠtN,γδ is continuous on [0,T].
(d) (Uniform moment bounds.) There is a real C1≥0, determined by l, l~, m, T, the rate bounds B and B~, the derivative bounds K and K~ (of the transition-rate and observation-rate extensions respectively), and the entry bounds of the continuous matrix families E, B, E~, G, K~ on [0,T] --- in particular the same for every N, every driving system, and every projected solution --- such that
and consequently, using E[∣⋅∣2]≤1+E[∣⋅∣4] and κ0≥1, also supt(E[∣st∣2]+E[∣s^tN∣2]+E[∣εt∣2]+E[∣at∣2])≤(4+C1)κ0 and A2+A4≤2T(4+C1)κ0.
(e) (Covariance comparison.) There is a real C≥0, determined by the same data as C1 together with the entry bounds of Π and of (Θ~⋆)−1 on [0,T] and the constant ϱ of (H5) --- again not depending on N, on the driving system, or on the solution --- such that for every t∈[0,T] and all γ,δ∈{1,…,l}:
Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.