Reason: Proof carried forward onto lem:n-agent-cost-filtering-reduction-2026b: references bumped to the standing 2026b/c layer; Step 1 hypothesis enumeration completed with (H1)-(H2) and the per-N data; adaptedness citation re-pinned to claim 2 of lem:n-agent-control-observation-adapted-2026c; square-integrability of the filtering error warranted; measurability of the covariance integrands cited; generic letters in Step 5 renamed to free U, V, M for the new layer.
Proof
Throughout, fix the common data, Z, and W as in the statement, write M2=21(1+M), and abbreviate st=st(N), at=at(N), ut=ut(N), Σt=Σt(N), αt=αt(N), and εtγ=εt(N),γ when N is fixed. All pointwise inequalities between random variables below hold at every point of Ω, and expectations of nonnegative random variables are taken in [0,∞] with the additivity and monotonicity of the linearity and monotonicity theorem.
Step 1 (second moments and applicability). For a real a≥0, (1−a)2≥0 gives a≤21(1+a2). Applying this at each ω with a=∣at∣2 and a=∣st∣2 and taking expectations, hypothesis (M) gives, for every N and t,
E[∣at∣2]≤21(1+E[∣at∣4])≤M2,E[∣st∣2]≤M2.
The function t↦E[∣at∣2] is measurable with well-defined Lebesgue integral over the compact interval[0,T], by part (a) of the a priori second-moment bound, and is bounded by the constant M2, so A2(N)≤TM2<∞ by the monotonicity of the interval integral. Hence the integrability hypothesis A2<∞ of the second-order expansion holds for every N — its remaining hypotheses (the common data, the per-N driving system, A-valued policy, and solution, the extensions, and the convexity of the control set A), and hypotheses (H1)--(H2) of the completion-of-squares theorem, being assumed in the statement — and with it all conclusions of the expansion and of the completion-of-squares theorem.
Step 2 (the identity defining rN). Conclusion (c) of the expansion gives JN=LQG[(s),(a)]+RN, and conclusion (c) of the completion-of-squares theorem gives
with all integrals finite. By clause (b) of the covariance deviation lemma, each s↦E[Θγδ(Σs,αs)] is bounded and measurable, and by clause (c) there each s↦Θs⋆γδ is continuous and bounded; the entries of s↦Zs are continuous and bounded by CZ (conclusion (a) of the completion-of-squares theorem and hypothesis (H2)). Hence s↦∑γδZsγδE[Θγδ(Σs,αs)] and s↦∑γδZsγδΘs⋆γδ are bounded measurable functions with finite interval integrals — each entry s↦Zsγδ, being continuous, is measurable by clause 3 of the interval toolkit, as is each s↦Θs⋆γδ, and finite sums and products of measurable real functions are measurable by the arithmetic of measurable functions —, so the third integral above splits by the linearity of the interval integral, with s↦2E[ss⋅Zses], the difference of integrable functions, integrable. Subtracting ∫[0,T]∑γδZsγδΘs⋆γδds from both sides of the identity of the statement, we conclude that rN is well defined and
Step 3 (RN vanishes). Let ωL,ωb,ωG and ρt be as in the expansion theorem, and set ω∞=2Kc+6lKCP, so that ωL(u)+CPωb(u)≤ω∞ and ωG(u)≤2Kc for every u≥0 by conclusion (a) there. Fix δ>0. At every point of [0,T]×Ω, either ρt≤δ, and then (ωL(ρt)+CPωb(ρt))(∣st∣2+∣at∣2)≤(ωL(δ)+CPωb(δ))(∣st∣2+∣at∣2) since the moduli are nondecreasing, or ρt>δ, and then, because ∣st∣2+∣at∣2=Nρt2>Nδ2 and (x+y)2≤2x2+2y2,
the integral over [0,T] of the left-hand side is well defined and finite by conclusion (b) of the expansion, and is at most T times the constant right-hand side by monotonicity. Similarly, since d(ΣT,ST)=N−1/2∣sT∣,
Given ε′′>0, conclusion (a) of the expansion provides δ>0 with ωL(δ)+CPωb(δ) and ωG(δ) so small that the δ-terms sum to at most ε′′/2, and then N1 with the 1/N-terms at most ε′′/2 for N≥N1; hence ∣RN∣≤ε′′ for N≥N1, and (RN) has limit0.
Step 4 (IIN and IIIN vanish). By the componentwise estimate ∣xγ∣≤∣x∣ of the componentwise calculus toolkit and ∣Zsγδ∣≤CZ, at every point ∣ss⋅Zses∣≤∑γ,δCZ∣ssγ∣∣esδ∣≤CZl2∣ss∣∣es∣, so by conclusion (b) of the completion-of-squares theorem, ∣ss⋅Zses∣≤CZl2ceN−1/2∣ss∣(∣ss∣2+∣as∣2). Pointwise, (∣s∣−∣s∣2)2≥0 gives ∣s∣3≤21(∣s∣2+∣s∣4), and (∣s∣−∣a∣2)2≥0 gives ∣s∣∣a∣2≤21(∣s∣2+∣a∣4); hence with Step 1 and (M), E[∣ss∣(∣ss∣2+∣as∣2)]≤M2+M=:M3 for every s. Therefore ∣2E[ss⋅Zses]∣≤2E[∣ss⋅Zses∣]≤2CZl2ceM3N−1/2 for every s (monotonicity, and ±X≤∣X∣), so by monotonicity of the interval integral ∣IIN∣≤2TCZl2ceM3N−1/2, and (IIN) has limit 0. For IIIN: with cΘ as in the covariance deviation lemma, its clause (b) and Step 1 give, for every s,
so ∣IIIN∣≤TCZl2cΘ(2M2)1/2N−1/2, and (IIIN) has limit 0. Combining Steps 3--4 with the triangle inequality, (rN) has limit 0. Together with the finiteness assertions of Step 2 this proves conclusion (a).
Step 5 (filtering bound). Fix N and t, and write K=Rt−1WtT, a real matrix with m rows and l columns with entries bounded by CK (conclusion (a) of the completion-of-squares theorem). Each component of st is bounded: every coordinate of the empirical state measure and of St lies in [0,1], both lying in the probability simplex at every ω, so ∣stγ∣≤N at every ω, and bounded random variables are square-integrable by monotonicity. Each component of at satisfies E[(atj)2]≤E[∣at∣2]≤M2 (componentwise estimate and Step 1), hence is square-integrable, and is almost surely equal to a Gt(N)-measurable square-integrable random variable by claim 2 of the observation-adaptedness lemma, applied with the mean-field trajectory pair (S,A) of the common data. Set X=−Kst componentwise, so Xi=−∑γ=1lKiγstγ is square-integrable by the closure properties of the square-integrability definition, and Y=at; then Y−X=ut componentwise, and E[ut⋅Rtut]=E[(Y−X)⋅(Rt(Y−X))], the entry pairing of the completion-of-squares theorem and the index formula of the conditional mean-square optimality lemma being the identical double sum. Each Rt is symmetric positive definite (conclusion (a) of the completion-of-squares theorem), hence positive semidefinite, so that lemma applies with k=m, G=Gt(N), and weight Rt: fixing conditional expectationsμγ of stγ given Gt(N), so that εtγ=stγ−μγ — each μγ being Gt(N)-measurable and square-integrable by the defining conditions of the conditional-expectation definition, so that each εtγ is square-integrable by the closure properties of the square-integrability definition — and conditional expectations μXi of Xi,
E[ut⋅Rtut]≥E[εX⋅(RtεX)],εXi=Xi−μXi.
By the linearity of conditional expectation (part 1 of the basic properties lemma, applied finitely many times), −∑γKiγμγ is a conditional expectation of Xi, so μXi=−∑γKiγμγalmost surely by the uniqueness assertion of the existence and uniqueness theorem; hence εXi=−∑γKiγεtγ almost surely. For square-integrable random variables φ,φ~,ψ with φ almost surely equal to φ~ (the letters U and V being reserved for the open sets of the extension and M for the moment bound) one has E[φψ]=E[φ~ψ], since ∥φ−φ~∥2=0 by the null-equivalence statement of the square-integrability definition and ∣E[(φ−φ~)ψ]∣≤∥φ−φ~∥2∥ψ∥2=0 by the Cauchy--Schwarz inequality; a product both of whose factors are replaced by almost-sure equals requires two applications, one factor at a time. Applying this and the linearity of the integral entrywise,
using the reverse-order law for the transpose of a product (claim 3 of the componentwise calculus toolkit), the involutivity of the transpose (immediate from its definition), and the symmetry of Rt−1. The matrix Ξt is symmetric, ΞtT=Wt(Rt−1)TWtT=Ξt, and positive semidefinite: for x∈Rl, x⋅(Ξtx)=(WtTx)⋅(Rt−1(WtTx))≥0, using the adjoint identity of claim 3 of the toolkit (a matrix moves across the dot product as its transpose) and the positive definiteness of Rt−1. Finally ∑γδΞtγδE[εtγεtδ]=E[εt⋅(Ξtεt)]≥0 by claim 1 of the expected quadratic form lemma and the pointwise nonnegativity of εt(ω)⋅(Ξtεt(ω)) with monotonicity of the integral. If μˉγ is another choice of conditional expectations, each μˉγ is almost surely equal to μγ by the uniqueness assertion, so each product expectation E[εtγεtδ] is unchanged, again by two applications of the almost-sure substitution above; the middle quantity is therefore independent of the choice. This proves conclusion (b).
Step 6 (lower bound). By claim 1 of the expected quadratic form lemma, E[s0⋅Z0s0]=∑γδZ0γδE[s0γs0δ]. Let ε′>0. By hypothesis (I) there is N1 such that ∣E[s0(N),γs0(N),δ]−Π0γδ∣≤ε′/(2l2CZ+2) for all γ,δ and N≥N1, whence E[s0⋅Z0s0]−∑γδZ0γδΠ0γδ≤l2CZ⋅ε′/(2l2CZ+2)≤ε′/2; and by conclusion (a) there is N2 with ∣rN∣≤ε′/2 for N≥N2. For N≥N0=max(N1,N2), the identity of conclusion (a) gives