Throughout, a real-valued function on a subinterval I of the real numbers R 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. Entries of matrices are handled with the componentwise calculus toolkit: entries of a matrix product are finite sums of products of entries; transposition satisfies (UV)⊤=V⊤U⊤; entrywise indefinite Riemann integrals of continuous maps (Riemann integration over compact intervals in the sense of claim 3 of that toolkit) are continuous in the upper limit and additive over subintervals, with the bound that the absolute value of an integral is at most the interval length times the maximum of the absolute integrand; and bilinear forms pass through entrywise integrals, so that, taking one argument over the standard basis vectors, multiplication by a constant vector passes inside an entrywise integral. Finitely many Riemann integrals of continuous functions over a common interval are combined into one by passing to Lebesgue integrals (claim 3 there: for a continuous integrand on a compact interval the two integrals agree) and using the linearity of the integral. For a vector x with n components, ∣x∣≤∑p=1n∣xp∣, since ∣x∣2=∑p(xp)2≤(∑p∣xp∣)2.
Step 1 (Conclusion 1). The components of t↦(St,At) are continuous by clause 1 of the definition of a mean-field trajectory pair (part of the stationary triple setting), and St∈Δl for every t.
By the definition of the fluctuation LQG data, the entries of Et and Bt are the values ∂ibˉγ(St,At), and each ∂ibˉγ exists and is of class C1 — in the scalar sense of clause 3 of that definition — on U×V by part (i) of the regularity of the extended aggregate state drift, hence continuous at every point of U×V by clause 1 of the Ck definition; moreover (St,At)∈Δl×A⊆U×V for every t, since the trajectory pair takes values in Δl×A and the extension has Δl⊂U and A⊆V; the entries of E~t are the values ∂γb~ˉυ(St), and each ∂γb~ˉυ is a C1 map on U~ by part (i) of the regularity of the extended aggregate observation drift, hence continuous by clause 1 of the Ck definition. Continuity in t follows by continuity of compositions along the continuous map t↦(St,At), applied pointwise on [0,T] exactly as in the definition of the fluctuation linear-quadratic cost — the componentwise continuity of clause 1 of the trajectory-pair definition yielding Euclidean continuity of t↦(St,At) via claim 1 of the agreement of Euclidean and metric continuity and the entry–norm inequalities of claim 1 of the componentwise toolkit, as carried out there.
By the definition of the aggregate fluctuation covariance, each entry of Θt⋆=Θ(St,At) is a finite sum of terms ±Stσβ(σ,γ,St,At); on Δl×A each rate β(σ,γ,⋅,⋅) agrees with the restriction of βˉ(σ,γ,⋅,⋅) by clause 1 of the definition of the transition-rate extension, and βˉ(σ,γ,⋅,⋅) is of class C2 on U×V by clause 2 of that definition, hence of class C1 and continuous at every point of U×V by clauses 2 and 1 of the Ck definition; so each entry of t↦Θt⋆ is continuous by composition and sums and products of continuous functions. Likewise b~υ agrees on Δl with the restriction of b~ˉυ by part (i) of the observation-drift regularity lemma, and b~ˉυ is of class C2 on U~ by the same part (i), hence of class C1 and continuous by clauses 2 and 1 of the Ck definition; so t↦b~υ(St) is continuous, and with it every entry of t↦Θ~t⋆, whose entries are 1{υ=υ′}b~υ(St) by the LQG data definition. The entries of Qt, Vt, Rt are fixed linear combinations of the fluctuation Hessian coefficients Hij(t), each continuous on [0,T] by the statement of the fluctuation LQG cost definition, hence continuous.
For the entry formulas of conclusion 1: by the definition of the fluctuation LQG data, (HtSS)γδ=Hγδ(t), (HtSA)γj=Hγ,l+j(t), (HtAS)jγ=Hl+j,γ(t), (HtAA)jk=Hl+j,l+k(t), and (F⋆)γδ=Fγδ; substituting these into the defining matrix formulas for Qt, Vt, Rt, F^ and using the transpose (which exchanges the two indices) gives exactly the displayed entry formulas.
Rt is symmetric since Rtij=41(Hl+i,l+j(t)+Hl+j,l+i(t))=Rtji. By (H1) its quadratic form is at least r∣a∣2>0 at every a=0, so Rt is positive definite and invertible, and the entries of t↦Rt−1 are continuous by continuity of the matrix inverse. Θ~t⋆ is symmetric (its off-diagonal entries vanish), and for y∈Rl~ its quadratic form is ∑υb~υ(St)(yυ)2≥r~∣y∣2 by (H3), so Θ~t⋆ is positive definite and invertible. Let Ξt be the diagonal matrix with diagonal entries 1/b~υ(St), defined since b~υ(St)≥r~>0; a direct entry computation from the definition of the matrix product gives ΞtΘ~t⋆=Θ~t⋆Ξt=I, so Ξt=(Θ~t⋆)−1, whose entries 1{υ=υ′}/b~υ(St) are continuous in t by continuity of the matrix inverse (or directly, the denominators being continuous and bounded below by r~). Finally, by (H2) each entry of t↦Zt is continuous (an entry of a family continuously differentiable in integral form is an integral, with continuous density, of the form appearing in the weighted second-moment evolution lemma, hence continuous in the limit of integration), so the entries of Wt=ZtBt+21Vt, of Wt⊤, and of Gt=Rt−1Wt⊤ are continuous by sums and products. This proves conclusion 1.
Step 2 (Conclusion 2). Ξt=(Θ~t⋆)−1 is symmetric (diagonal). By the transpose identities of the toolkit, D~t⊤=E~t⊤Ξt⊤E~t=D~t, so D~t is symmetric, and a direct entry computation gives, for x∈Rl,
γ=1∑lδ=1∑lD~tγδxγxδ=υ=1∑l~b~υ(St)1(γ=1∑lE~tυγxγ)2≥0,
so D~t is positive semidefinite; its entries are continuous in t as products and sums of continuous entries. Since (St,At)∈Δl×A (Step 1), part 3 of the jump representation lemma applied at (St,At) shows that Θt⋆=Θ(St,At) is positive semidefinite. The global existence and uniqueness theorem for the Kalman covariance Riccati equation, applied on [0,T] with matrix size l, coefficient assignments E, Θ⋆, D~ (continuous, with Θt⋆ and D~t positive semidefinite) and initial value Π0 (positive semidefinite by (H4)), yields exactly one continuous assignment Π satisfying the displayed integral equation, with every Πt symmetric and 0⪯Πt in the semidefinite order, that is, positive semidefinite. The entries of K~t=ΠtE~t⊤Ξt and Mt=Et−BtGt−K~tE~t are then continuous by sums and products of continuous functions. This proves conclusion 2.
Step 3 (Conclusion 3). Since M has continuous entries, the fundamental-solution theorem on [0,T] provides Φ with continuous entries satisfying Φ(t)=I+∫0tMrΦ(r)dr, invertible at every t, with inverse Ψ having continuous entries and satisfying Ψ(t)=I−∫0tΨ(r)Mrdr. Define p:[0,T]→Rl by pt=∫0tΨ(r)K~rb~(Sr)dr; its components are continuous by the toolkit (continuity of indefinite Riemann integrals of continuous integrands).
Fix k≥1 and v∈{1,…,l~}k, and write Tk for the σ-algebra on [0,T]×Rk generated by the relatively open sets, as in the definition of an observation-driven control policy. The coordinate maps (t,τ)↦t and (t,τ)↦τj (j≤k) are measurable with respect to Tk: the preimage of an open subset O of R under either map is the intersection of [0,T]×Rk with an open subset of R1+k, hence relatively open and in Tk; and since the collection of subsets of R whose preimages lie in Tk is a σ-algebra (preimages commute with complements and countable unions) containing the open sets, it contains every Borel set. The indicator (t,τ)↦1{τj≤t} is Tk-measurable: the set {(t,τ):τj>t} is the intersection of [0,T]×Rk with the open set of points of R1+k whose (1+j)-th coordinate exceeds the first, hence lies in Tk, and so does its complement; every preimage under the indicator is one of ∅, these two sets, or everything. Every real function of the form (t,τ)↦u(t,τj) with u sequentially continuous on [0,T]2 in the sense of the composition lemma cited next (the letter u is local to this sentence) — in particular every entry of Φ(t), Gt, Ψ(τj), K~τj, and every component of At and pt — is Tk-measurable by measurability of sequentially continuous functions of measurable Euclidean maps, applied to the measurable pair (t,τ)↦(t,τj); and finite sums and products of Tk-measurable real functions are Tk-measurable by the same lemma. Each component of (t,τ)↦fkN(t,τ,v) is such a finite sum of products, hence Tk-measurable, and so is each component of the candidate map gk,v:(t,τ)↦At−N−1/2GtfkN(t,τ,v); by its two-case definition, hkN(t,τ,v)=gk,v(t,τ) if gk,v(t,τ)∈A and hkN(t,τ,v)=At otherwise.
Measurability of the clamp. By hypothesis (C) the complement of A is open, so A is closed and belongs to the Borel σ-algebra Bm of Rm by claim 4 of the Borel measurability lemma on Euclidean space; and since every component of gk,v is Tk-measurable, the map gk,v is measurable from [0,T]×Rk with the σ-algebra Tk to Rm with Bm, by the componentwise criterion of claim 2 of the same lemma. Hence the set gk,v−1(A)={(t,τ):gk,v(t,τ)∈A} lies in Tk, and its indicator 1gk,v−1(A) is Tk-measurable. By the two-case definition, at every (t,τ) and for j∈{1,…,m},
hkN,j(t,τ,v)=Atj−1gk,v−1(A)(t,τ)N−1/2(GtfkN(t,τ,v))j,
so each component of hkN(⋅,⋅,v) is a finite sum of products of Tk-measurable real functions, hence Tk-measurable. For k=0, the components of f0N and of the candidate map g0:t↦At−N−1/2Gtf0N(t) are continuous in t, hence measurable with respect to the σ-algebra generated by the relatively open subsets of [0,T] by the same preimage argument, and the clamp argument applies verbatim with g0 in place of gk,v, giving measurability of the components of h0N. Thus hN, fN, and h♯ (whose components are those of hkN and fkN) are observation-driven control policies with horizon T, control dimensions m, l, and m+l respectively, and l~ channels. Moreover every value of hkN (and of h0N) lies in A: it is either a point of A by the case condition or the point At, which lies in A because the trajectory pair has A:[0,T]→A; so hN is A-valued, and every value of hk♯ lies in A×Rl, so h♯ is (A×Rl)-valued.
For β♯: its members are functions on Δl×(A×Rl), and A×Rl is a nonempty subset of Rm+l, A being nonempty; clause 1 (bounds) of the definition of a transition-rate family holds since β♯(σ,γ,Σ,(a,x))=β(σ,γ,Σ,a)∈[0,B] for a∈A by clause 1 for β; clause 2 (joint sequential continuity) holds because if (Σn,cn)→(Σ,c) in Δl×(A×Rl), then, writing cn=(an,xn) and c=(a,x), with an,a∈A, the Euclidean distance d(an,a) is at most d(cn,c) (a sum of fewer squares under the square root), so d(an,a)→0 and β♯(σ,γ,Σn,cn)=β(σ,γ,Σn,an)→β(σ,γ,Σ,a)=β♯(σ,γ,Σ,c) by clause 2 for β. This proves conclusion 3.
Step 4 (Conclusion 4(a)). Fix a solution as in conclusion 4. The projected collection (σi,Υυ,α,Ω0) is a solution for β, β~, the same driving system, and hN: each component of α is a component of α♯, hence a random variable, and at every ω∈Ω and t∈[0,T] the vector αt(ω) of the first m components of αt♯(ω)∈A×Rl lies in A, as the solution concept requires of the control process; the policy hN is A-valued by conclusion 3, as the solution concept requires of the policy; conditions 1, 4, and 6 of the definition of a solution do not involve the control process and hold as for the given solution; conditions 2 and 3 involve the control only through the values β(σ,γ,Σs,αs)=β♯(σ,γ,Σs,αs♯), which are unchanged by the definition of β♯, so the required joint measurability, the consumed clock times, and the counters are identical; and condition 5 holds because at every ω∈Ω0 and t∈[0,T], condition 5 for the given solution reads
αt♯=hc~t♯(t,(τ1,…,τc~t),(υ1,…,υc~t))=(hc~tN(t,…),fc~tN(t,…)),
whose first m components give αt=hc~tN(t,…) and whose last l components give the displayed identity s^tN=fc~tN(t,…). Conversely, any solution for β, β~, this driving system, and hN is indistinguishable from the projected solution by the uniqueness part of the existence and uniqueness theorem, both being solutions for the same data.
Combining the identity s^tN=fc~tN(t,…) with the two-case definition of hkN gives, at every ω∈Ω0 and t∈[0,T]: the case condition of hc~tN, evaluated along the solution, reads At−N−1/2Gts^tN∈A, which holds exactly when the clamp indicator χt of the statement equals 1; so αt=At−N−1/2Gts^tN when χt=1 and αt=At when χt=0, which is the displayed identity αt=χt(At−N−1/2Gts^tN)+(1−χt)At; subtracting At, multiplying by N1/2, and inserting Gt=Rt−1Wt⊤ gives the second form, both sides of which vanish when χt=0. At t=0: by condition 2 the consumed clock times vanish at 0, and every clock path is a counting path, which vanishes at 0 by its clause 1; hence every observation counter vanishes at 0 and c~0=0, so s^0N=f0N(0)=Φ(0)(−N1/2p0)=0, the integral over the degenerate interval being 0. This proves (a).
Step 5 (Conclusion 4(b)). Fix ω∈Ω0 and abbreviate κj=K~τjeυj∈Rl (the υj-th column of K~τj) for j∈{1,…,c~T}.
Jump-count identity. By condition 3 of the definition of a solution, the observation total agrees on [0,T] with the restriction of a counting path c, and by condition 5 the times τ1<⋯<τc~T are the jump times of c in [0,T], with c~t=c(t) for t∈[0,T]. We claim that for every t∈[0,T] and j∈{1,…,c~T}:
τj≤t⟺j≤c~t.
For a natural number k≥1 with c(u)≥k for some u∈[0,T], let sk=inf{s≥0:c(s)≥k}≤u be the k-th jump time of the counting-path definition. Then c(s)≥k for every s>sk: there is s′∈(sk,s] with c(s′)≥k by the definition of the greatest lower bound, and c is nondecreasing by clause 2; hence c(sk)≥k by right-continuity (clause 3). Also sk>0, since sk=0 would give c(0)≥k≥1, contradicting c(0)=0 (clause 1). For 0≤s<sk we have c(s)<k, hence c(s)≤k−1, the values being integers (clause 1); so c(sk−)≤k−1, and by the unit-jump clause 4, c(sk)≤c(sk−)+1≤k. Therefore c(sk)=k and c(sk)>c(sk−), so sk is a jump time of c. The sk are strictly increasing in k where defined, since c(sk)=k determines k from sk and c is a function; sk≤T whenever k≤c(T); and sk>u whenever k>c(u), since sk≤u would give c(u)≥c(sk)=k by monotonicity. Conversely, every jump time v of c in [0,T] equals sc(v): with k=c(v) we have c(v)≥k, so v≥sk; and c(v)>c(v−) forces c(s)≤c(v−)≤k−1 for every s<v (monotonicity and integer values), so sk≥v. Hence the jump times of c in [0,T] are exactly s1<s2<⋯<sc(T), so τj=sj for every j∈{1,…,c~T}, and the claim follows: τj≤t implies c~t=c(t)≥c(sj)=j by monotonicity, while c~t≥j implies τj=sj≤t by the definition of sj as a greatest lower bound.
By the jump-count identity, in the identity s^tN=fc~tN(t,…) of (a) the sum over j≤c~t may be extended to j≤c~T (the added terms have τj>t, so their indicators vanish), which yields the stability identity: for every t∈[0,T],
s^tN=Φ(t)(−N1/2pt+N−1/2j=1∑c~T1{τj≤t}Ψ(τj)κj).
Two integral identities. First, for every t∈[0,T]:
Φ(t)pt=∫0t(MrΦ(r)pr+K~rb~(Sr))dr.
Indeed, componentwise, (Φ(t)pt)γ=∑δΦγδ(t)ptδ, each factor is a constant plus an indefinite Riemann integral of a continuous function, and the product rule for indefinite Riemann integrals gives
Φγδ(t)ptδ=∫0t((MrΦ(r))γδprδ+Φγδ(r)(Ψ(r)K~rb~(Sr))δ)dr;
summing over δ, combining the finitely many integrals (via claim 3 of the interval toolkit and the linearity of the integral, the combined integrands being continuous), and using Φ(r)Ψ(r)=I yields the claim. Second, for every j∈{1,…,c~T} and t∈[τj,T]:
Φ(t)Ψ(τj)κj=κj+∫τjtMrΦ(r)Ψ(τj)κjdr,
since Φ(t)−Φ(τj)=∫τjtMrΦ(r)dr by additivity of the entrywise Riemann integral over subintervals (toolkit), right multiplication by the constant vector Ψ(τj)κj passes inside the entrywise integral by the bilinear-form identity of the toolkit with the first argument ranging over the standard basis vectors, and Φ(τj)Ψ(τj)=I; for t=τj the identity is trivial, the integral being degenerate.
Assembly. Fix t∈(0,T]; for t=0 conclusion (b) reads s^0N=0, which is (a). By claim 3 of the interval toolkit, the first identity's Riemann integral equals, componentwise, the Lebesgue integral over [0,t] of the same (continuous) integrand. For j with τj<t, the Riemann integral ∫τjtϕj(r)dr of the continuous map ϕj(r)=MrΦ(r)Ψ(τj)κj equals, componentwise, the Lebesgue integral over [τj,t] of ϕj (claim 3 of the toolkit on [τj,t]), and this equals the Lebesgue integral over [0,t] of 1{τj≤r}ϕj(r): by claim 2 of the toolkit (zero extension), both are the Lebesgue integral over R of the same function, namely the restriction of ϕj to [τj,t] extended by zero. For j with τj=t, both ∫τjtϕj(r)dr and the integral of 1{τj≤r}ϕj(r) over [0,t] vanish: the former is degenerate, and the latter has integrand vanishing off the singleton {t}, so its positive and negative parts have integral 0 by claim 6 of the toolkit with D=[0,t). Each function r↦1{τj≤r} is measurable on [0,t], the set [τj,∞)∩[0,t] lying in the trace Borel σ-algebra, and finite sums and products of measurable real functions are measurable by measurability of sequentially continuous functions of measurable maps. Therefore, by the stability identity, the two integral identities, and the linearity of the integral over the finitely many terms,
s^tN=∫[0,t](MrΦ(r)(−N1/2pr+N−1/2j=1∑c~T1{τj≤r}Ψ(τj)κj)−N1/2K~rb~(Sr))dr+N−1/2j=1∑c~tκj,
and by the stability identity at r the inner bracket times Φ(r) is s^rN, so
s^tN=∫[0,t](Mrs^rN−N1/2K~rb~(Sr))dr+N−1/2j=1∑c~tκj.
Finally, Mrs^rN=Ers^rN−BrGrs^rN−K~rE~rs^rN by the definition of M, an entrywise sum of matrices multiplying a vector splitting into the sum of the matrix-vector products entry by entry, so the integrand equals the one displayed in (b). Its components are measurable on [0,t] (by the stability identity, finite sums of products of continuous functions and the interval indicators above) and bounded there (finitely many terms whose continuous factors attain maximal and minimal values on the compact interval by the extreme value theorem, so their absolute values are bounded), and continuous at every r that is not a jump time, since between consecutive jump times all indicators are constant. This proves (b).
Step 6 (Conclusion 4(c)). Path regularity. Fix ω∈Ω0. By the stability identity, each component path is a finite sum of products of continuous functions of t and the functions t↦1{τj≤t}, each of which is right-continuous everywhere and continuous except at τj; sums and products preserve these properties, so each component path is right-continuous on [0,T] and continuous off {τ1,…,τc~T}.
Measurability. Applying part (c) of the joint measurability lemma to the given solution for β♯, β~, and h♯ (a solution of the controlled N-agent dynamics whose transition-rate family β♯ has control set A×Rl), each map (t,ω)↦1Ω0(ω)αt♯,j(ω), j∈{1,…,m+l}, is measurable with respect to the product σ-algebra; taking j=m+γ gives the claim for 1Ω0s^N,γ.
Bounds. All entries of Φ, Ψ, K~, and G are continuous on [0,T], hence attain maximal and minimal values there by the extreme value theorem, so their absolute values are bounded on [0,T]: fix reals cΦ, cΨ, cK, cG≥0 bounding the absolute values of all entries of Φ(t), Ψ(t), K~t, Gt on [0,T]. By the definition of the aggregate observation drift and the bounds of the observation-rate family, 0≤b~υ(Σ)=∑σΣσβ~(σ,υ,Σ)≤B~ for Σ∈Δl, since the Σσ are nonnegative with sum 1. Hence each component of Ψ(r)K~rb~(Sr) is at most ll~cΨcKB~ in absolute value, each component of pt is at most Tll~cΨcKB~ by the integral bounds of the toolkit, and each component of Φ(t)pt is at most lcΦ⋅Tll~cΨcKB~. Each κj is a column of K~τj, with components at most cK; so each component of Ψ(τj)κj is at most lcΨcK and each component of Φ(t)Ψ(τj)κj at most l2cΦcΨcK. By the stability identity and ∣x∣≤∑p∣xp∣,
∣s^tN∣≤l(N1/2l2l~cΦcΨcKB~T+N−1/2c~tl2cΦcΨcK)≤C1(N1/2+N−1/2c~T)
with C1=l3l~cΦcΨcK(1+B~T), using c~t≤c~T. By (a), N1/2∣αt−At∣=χt∣Gts^tN∣≤∣Gts^tN∣≤mlcG∣s^tN∣, since χt∈{0,1} and each of the m components of Gts^tN is at most lcG∣s^tN∣ in absolute value. Taking C∘=(1+mlcG)C1, which is determined by the quantities listed in the statement and involves neither N nor the driving system nor the solution, proves both bounds and completes the proof.