Reason: Proof of thm:n-agent-cost-lqg-lower-bound-2026c: the 2026b proof with claim 1 simplified under (I0), claim 2 transferring the filtering error to the certificate space by claim 5 of the law-invariance lemma and applying the mixture-weight certificate lemma with varkappa=(q-eps)^2; claims 3-4 unchanged up to naming the driving system.
Proof
Claim 1.
The initial covariance. By hypothesis (I0) the matrix Π0 is the zero matrix, which is symmetric and positive semidefinite, x⋅(Π0x)=0 for every x∈Rl.
so every D~t is positive semidefinite. The Riccati existence theorem therefore applies on [0,T] with k there equal to l, A=E, C=Θ⋆, D=D~ and P0=Π0, and yields the unique Π with continuous entries, every Πt being symmetric and satisfying 0⪯Πt, that is, positive semidefinite.
The weight Ξ. Every Ξt is symmetric positive semidefinite with continuous entries by claim 2 of the cascade filtering lemma. Fix t. Under (H1), conclusion (a) of the completion-of-squares theorem gives that Rt is symmetric positive definite, so Rt−1 is symmetric positive definite by Invertibility of Symmetric Positive Definite Matrices, and by the Cholesky factorisation there is a real matrix Lt with m rows and m columns and Rt−1=LtLt⊤. Put Bt=WtLt, a real matrix with l rows and m columns (this matrix always carries a time subscript and is distinct from the control matrix Bt and from the rate bound B of the common data), and let bt,1,…,bt,m∈Rl be its columns, so that (Bt)γj=bt,jγ. Then
called the column identity below. Taking M=Πt shows ∑γ,δΞtγδΠtγδ≥0, every Πt being positive semidefinite. That function of t is a finite sum of products of continuous functions, hence continuous, and therefore Lebesgue integrable on [0,T] by claim 3 of Restricted Lebesgue Measure and Integral Toolkit on a Compact Interval. This proves claim 1.
Claim 2. Fix s∈[0,T], c∈Rl and η>0, and put κ=c⋅(Πsc), a nonnegative real by claim 1.
The filtering error of Xs′. Let N≥1 and put Δs=Xs′−ss=N(Ss−Φs). Each component Δsγ is Gs-measurable, being the constant NSsγ minus the Gs-measurable random variable NΦsγ (claim 3 of the realized-flow adaptedness lemma), and is square-integrable as the difference of the square-integrable Xs′γ and ssγ. By the second immediate consequence recorded in the conditional-expectation definition, Δsγ is a conditional expectation of itself given Gs. Let Msγ be the conditional expectation of ssγ chosen in the definition of εsγ=ssγ−Msγ. By claim 1 of the conditional expectation properties lemma, Msγ+Δsγ is a conditional expectation of ssγ+Δsγ=Xs′γ given Gs, so by the uniqueness part of the existence and uniqueness theorem every conditional expectation M~γ of Xs′γ given Gs satisfies M~γ=Msγ+Δsγalmost surely, whence
Xs′γ−M~γ=ssγ+Δsγ−Msγ−Δsγ=εsγalmost surely.
This is the first assertion of claim 2.
The quadratic form of the filtering error. At every point of Ωag one has ∑γ,δcγcδεsγεsδ=(c⋅εs)2, where c⋅εs=∑γcγεsγ; each product εsγεsδ is integrable, the factors being square-integrable (closure properties of square-integrability), so by the linearity of the integral
E[γ,δ∑cγcδεsγεsδ]=E[(c⋅εs)2]≥0,(2.1)
the inequality being the nonnegativity of the expectation of a nonnegative random variable. Let M~γ be conditional expectations of Xs′γ given Gs and put c⋅M~=∑γcγM~γ. By the first assertion of claim 2, c⋅εs=c⋅Xs′−c⋅M~ almost surely, and by claim 1 of the conditional expectation properties lemma, applied finitely many times, c⋅M~ is a conditional expectation of the square-integrable random variable c⋅Xs′ given Gs. Almost surely equal integrable random variables have equal expectations, so
E[(c⋅εs)2]=E[(c⋅Xs′−E[c⋅Xs′∣Gs])2],(2.2)
the right-hand side being independent of the choice of the conditional expectation by the uniqueness part of the existence and uniqueness theorem.
the last step by hypothesis (I′). This is the moment bound of claim 2. In particular ∣Xs′∣2 is square-integrable.
Apply Adjoint Energy Identity for the Kalman Covariance Riccati Equation with the endpoints 0 and T in the roles of a and b there, k there equal to l, the data E, Θ⋆, D~, Π0 and Π of claim 1, the time s and the vector x=c. It produces an assignment λ with continuous components and λ(s)=c, and by its claim 2 the assignment u↦Πuλ(u) has continuous components and satisfies the integral equation defining ψλ — that lemma writes its integrals as Riemann integrals of continuous functions, which coincide with the Lebesgue integrals over compact intervals used here by claim 3 of Restricted Lebesgue Measure and Integral Toolkit on a Compact Interval; by the uniqueness in claim 3 of the variation of constants theorem, ψλ(u)=Πuλ(u) for every u. Its claim 3 then gives
Suppose first κ=0; this is the case whenever s=0, because Π0 is the zero matrix by (I0). Then (2.1) gives, for every N≥1,
E[γ,δ∑cγcδεsγεsδ]≥0=κ≥κ−η,
and N3=1 serves.
Suppose now κ>0; then s>0, since κ=0 when s=0. Put
ϵ=min{8κ,8κ,3+4κη}>0,q=κ+ϵκ−ϵ>0
(positive because ϵ≤κ/8<κ), with ⋅ the nonnegative square root, which is nondecreasing on [0,∞) (for 0≤x≤y one has x≤y, since x>y≥0 would give x>y on squaring). Three elementary estimates follow from 0<ϵ≤κ/8 and ϵ≤κ/8. First, (κ−3ϵ)(κ+ϵ)=κ2−2κϵ−3ϵ2≤κ2−2κϵ+ϵ2=(κ−ϵ)2, so, dividing by κ+ϵ>0, q2≥κ−3ϵ. Second, ϵ≤3κ gives ϵ2≤3κϵ, hence (κ−ϵ)2=κ2−2κϵ+ϵ2≤κ2+κϵ=κ(κ+ϵ), so q2≤κ and q≤κ. Third, (2κ)2=4κ≥κ+ϵ, so 2κ≥κ+ϵ, whence, using κ−ϵ≥7κ/8 and κ/κ=κ,
q≥2κκ−ϵ≥16κ7κ=167κ≥2ϵ,
the last step because 2ϵ≤κ/4≤167κ by ϵ≤κ/8.
Now put ϰ=(q−ϵ)2; since q−ϵ≥ϵ>0, the uniqueness of the nonnegative square root gives ϰ=q−ϵ≥ϵ, and ϰ>0. Apply (VT′) with this s, this c, this profile λ and this ϵ, obtaining N2; put N3=N2, let N≥N3, and let (Ω′,F′,P′), Y, Y, ϱ0, d, ϑ1,…,ϑd, D′, X†, p, G, α, z, a1,…,ad be data as provided by (VT′), satisfying its conditions (a), (C1), (C2′), (C3) and (C4′). Write E′ for the expectation on (Ω′,F′,P′).
Transfer of the filtering error to the certificate space. By (a), the map (c⋅Xs′,W(s)) is measurable with respect to Fag and B(R)⊗Rs. Hence W(s) is measurable with respect to Fag and Rs: for E∈Rs the set R×E belongs to the product σ-algebraB(R)⊗Rs, being a product of measurable sets, and its preimage under (c⋅Xs′,W(s)) is (W(s))−1(E). In the same way D′, regarded as Rs-valued, is measurable with respect to F′ and Rs, by the first assertion of (a). Put G′=σ(D′)={D′−1(E):E∈Rs}. By claim 1 of Factorisation of Random Variables Through a Measurable Map, the Variational Form of the Mean-Square Filtering Error, and Its Invariance Under the Joint Law, applied on (Ω′,F′,P′) with the measurable space (Rs,Rs) and the map D′, G′ is a σ-algebra on Ω′ with G′⊆F′; it is D′-generated up to null sets in the sense of that lemma, since σ(D′)⊆G′⊆F′ and every A∈G′ admits A′=A∈σ(D′), whose symmetric difference with A is empty. By (C0), Gs is W(s)-generated up to null sets in (Ωag,Fag,Pag) for the same measurable space (Rs,Rs). Claim 5 of Factorisation of Random Variables Through a Measurable Map, the Variational Form of the Mean-Square Filtering Error, and Its Invariance Under the Joint Law therefore applies with (Ωag,Fag,Pag), the measurable space (Rs,Rs), the map W(s) in the role of D, the square-integrable random variable c⋅Xs′ (square-integrable by (a)) in the role of X and Gs in the role of G on one side, and (Ω′,F′,P′), D′, X† in the role of X′ and G′ on the other; its hypothesis on the image measures is the law identity of (a). It gives
The certificate on the copy. By (C1), G′={D′−1(E):E∈Y}. Apply Localized Filtering Lower Bound from a Mixture-Weight van Trees Certificate on the probability space (Ω′,F′,P′) with the sub-σ-algebra G′, with l there equal to 1, the tuple (X†) in the role of X, the vector (1)∈R1 in the role of its vector c, the event H=Ω′ (which lies in G′, being D′−1(Rs), and has 1H≡1), the tolerance ϵ and the value ϰ, and with the certificate data d, n=d, (Y,Y), ϱ0, D′ in the role of D (measurable with respect to F′ and Y by (VT′)), ϑ1,…,ϑd in the role of Θ1,…,Θd, the function p, the vectors α, z, a1,…,ad and the map G. Its condition (C1) asks that every G′-measurable square-integrable random variable be almost surely equal to g(D′) for some Y-measurable g with g(D′) square-integrable; this is given by (C1) of (VT′), which even provides equality at every point. Its condition (C2′) is (C2′) of (VT′), and the mixture-weight information Iz of the two conditions is the same number. Its condition (C3) reads ∥α⋅ϑ+G(D′)−1Ω′X†∥2≤ϵ, which is (C3) of (VT′). For its condition (C4′): by (C4′) of (VT′) and the identities c⋅ψλ(s)=κ and As(λ)=κ established above,
α⋅z≥κ−ϵ>0,Iz≤κ+ϵ,1≤j≤dmax∣α⋅aj∣≤ϵ;
the nonnegative square root being nondecreasing, Iz≤κ+ϵ; the factor maxj∣α⋅aj∣+ϰ is nonnegative and at most ϵ+(q−ϵ)=q, and κ+ϵ≥0; hence
which together with α⋅z>0 is condition (C4′) of the lemma with this ϰ. Moreover ϰ≥ϵ was shown above.
Claim 2 of Localized Filtering Lower Bound from a Mixture-Weight van Trees Certificate is therefore available. Its claim 1, with 1Ω′≡1, identifies the quantity bounded there with E′[(X†−M′)2] for a conditional expectation M′ of X† given G′, and the lemma records that this quantity does not depend on the choice of M′; so its claim 2 gives
the third-to-last step by ϵ2≥0, the second-to-last by the first two elementary estimates (q2≥κ−3ϵ and q≤κ), and the last by the choice ϵ≤η/(3+4κ). Combining this with (2.3), (2.2) and (2.1) yields the bound of claim 2 for every N≥N3. This proves claim 2.
Claim 3. Fix an admissible parameter vector π satisfying the absorption condition, fix η>0, and for k∈{0,…,K−1} and N≥1 define
fN(k)(s)=E[1Tknr(s)us⋅Rsus](s∈[tk,tk+1]).
Each fN(k) is nonnegative, because us⋅Rsus≥r∣us∣2≥0 by (H1), and is measurable on [tk,tk+1] by hypothesis (MS); its integral over that block is the k-th summand appearing in claim 7 of the ledger lemma. Define also the bad sets and their probabilities
(in this claim the letter p denotes these probabilities; the certificate density of (VT′) is not used here).
By claim 2 of the ledger lemma Tknr(s)∈Gs, so Ck(s)∈Gs, a σ-algebra being closed under complements. By the definitions in the ledger lemma, Tk(s) is the disjoint union of Tknr(s) and Tkfr(s), so Ck(s) is the disjoint union of Ωag∖Tk(s) and Tkfr(s) and
pN(k)(s)=E[1−1Tk(s)]+E[1Tkfr(s)],
a function measurable on [tk,tk+1] by hypothesis (MS) and claim 2 of the arithmetic of measurable functions, with values in [0,1]. Its integral over the block is the sum of the integrals of the two summands, by the linearity of the integral (both summands are nonnegative, measurable and bounded by 1, so by monotonicity their integrals are at most tk+1−tk, the measure of the block by claim 1 of Restricted Lebesgue Measure and Integral Toolkit on a Compact Interval); summing over the blocks and using claims 1(c) and 1(d) of the ledger lemma,
with P≤Λ⋆ZΥlevN−1 from claim 1(d). Since π satisfies the absorption condition, part (a) of the asymptotic lower bound theorem provides N1 with Z≤Z♯(π) for N≥N1. Put Cπ=(TΛ⋆Υlev+ϱ−2)Z♯(π), a real number that does not depend on N: ϱ is a component of π; Λ⋆ and the level sum Υlev=∑k=0K−1Lk−2 of the ledger lemma are given by the explicit formulas Λ⋆=max(4Ca2K22T0,λc,λo) and Lk=(2Ca)k+1−Kε1 of the block cascade lemma, in which K is determined by T0 and T, the constant Ca by l, Λb and T, and K2 is one of the constants of the ledger lemma that the asymptotic lower bound theorem records as being the same for every N; so neither depends on N; and Z♯(π) is the real number of part (a) of that theorem. Every summand on the left being nonnegative,
The bad-set estimate. Fix k, s∈[tk,tk+1], c∈Rl and N≥1, write C=Ck(s) and p=pN(k)(s), and let M~γ be conditional expectations of Xs′γ given Gs, so that c⋅εs=c⋅Xs′−c⋅M~ almost surely by claim 2, where c⋅M~=∑γcγM~γ. By claim 1 of the conditional expectation properties lemma, c⋅M~ is a conditional expectation of c⋅Xs′ given Gs; by claim 4 of that lemma, applied with the bounded Gs-measurable Z=1C, the random variables 1C(c⋅Xs′) and 1C(c⋅M~) are square-integrable and the latter is a conditional expectation of the former given Gs; and by claim 6 of that lemma, ∥1C(c⋅M~)∥2≤∥1C(c⋅Xs′)∥2. Since 1C(c⋅εs)=1C(c⋅Xs′)−1C(c⋅M~) almost surely, and almost surely equal random variables have the same mean-square norm, claim 2 of the triangle inequality for the mean-square norm gives ∥1C(c⋅εs)∥2≤2∥1C(c⋅Xs′)∥2, hence
Lower bound for the tracked density. For s∈[0,T] put τs=∑γΞsγγ; the function s↦τs is continuous on [0,T] by claim 1, hence by the extreme value theorem there is a real τ♯ with τs≤τ♯ for every s∈[0,T], and τ♯≥0 because τs=∑j=1m∑γ(bs,jγ)2≥0 by the factorisation Ξsγδ=∑jbs,jγbs,jδ of claim 1. Now fix k and s∈[tk,tk+1], and write H=Tknr(s) and C=Ck(s), so that 1H=1−1C. Since H∈Gs, claim 3 of the cascade filtering lemma gives
the first equality by the column identity of claim 1 applied to the matrix Mγδ=E[1Hεsγεsδ], by the pointwise identity (b⋅εs)2=∑γ,δbγbδεsγεsδ and by the linearity of the integral, the second by 1H=1−1C and linearity again. Now ∑j=1m∣bs,j∣2=∑j∑γ(bs,jγ)2=τs≤τ♯. Applying (3.2) to each c=bs,j and summing,
Passage to the limit. For N≥1 define on [tk,tk+1]
gN(k)(s)=fN(k)(s)+4C4τ♯pN(k)(s),
which is measurable: the nonnegative square root is sequentially continuous on E=[0,1], because for x≥y≥0 one has (y+x−y)2=x+2yx−y≥x, hence ∣x−y∣≤∣x−y∣ for all x,y≥0, so that ∣xn−x∣<ζ2 forces ∣xn−x∣<ζ; therefore pN(k) is measurable as the composition of the measurable function pN(k), with values in E, with a sequentially continuous function on E (sequentially continuous functions of measurable maps are measurable, with d=1), and sums and scalar multiples of measurable functions are measurable (claim 2 of the arithmetic of measurable functions); and which is nonnegative by (3.3), since gN(k)(s)≥∑jE[(bs,j⋅εs)2]≥0. Fix s∈[tk,tk+1] and let η′>0. Applying claim 2 to each of the m vectors c=bs,j with tolerance η′/m and taking the largest of the resulting thresholds, there is N′′ such that for every N≥N′′
By Fatou's lemma, applied to the nonnegative measurable functions gN(k) on [tk,tk+1] with the restricted Lebesgue measure, and then by the monotonicity of the integral together with claim 1,
The correction term vanishes in the limit: for every real θ>0 and every real x≥0 one has 2θx≤θ2+x, because (x−θ)2≥0; hence, by the monotonicity and linearity of the integral and by (3.1), for N≥N1
the integrals being finite because the integrands are nonnegative, measurable and bounded by 1, so that by monotonicity each is at most the measure tk+1−tk of the block (claim 1 of Restricted Lebesgue Measure and Integral Toolkit on a Compact Interval). Thus limsupN→∞∫[tk,tk+1]pN(k)ds≤θT/2 for every θ>0, so this sequence of nonnegative reals converges to 0. Since ∫gN(k)ds=∫fN(k)ds+4C4τ♯∫pN(k)ds over [tk,tk+1] by the linearity of the integral of nonnegative measurable functions (claim 1 of the linearity theorem, an identity in [0,∞]), the second summand is finite, and the sequence of second summands converges to 0 — so that the two sequences ∫fN(k)ds and ∫gN(k)ds, with values in [0,∞], have the same limit inferior in [0,∞] —
Hence for each k there is N(k) with ∫[tk,tk+1]fN(k)ds≥∫[tk,tk+1]∑γ,δΞsγδΠsγδds−η/K for every N≥N(k). Let N4 be the largest of N1,N(0),…,N(K−1) and sum over k. Since t0=0, tK=T and tk<tk+1 for k≤K−1 (the number of blocks K being least with KT0≥T), the intervals [tk,tk+1] are adjacent with union [0,T], so by the additivity of the Riemann integral of a continuous function over adjacent compact intervals (Additivity of the Riemann Integral on Adjacent Intervals), the Lebesgue integral of a continuous function over a compact interval being its Riemann integral by claim 3 of Restricted Lebesgue Measure and Integral Toolkit on a Compact Interval, the sum of the right-hand sides is ∫[0,T]∑γ,δΞsγδΠsγδds−η. This proves claim 3.
Claim 4. Let ε′′>0. By conclusion (b) of the asymptotic lower bound theorem, applied with ε′=ε′′/2, there are an admissible parameter vector π satisfying the absorption condition of part (a) of that theorem and a natural number N0 such that for every N≥N0
the blocks and near-field tracked events being those formed from π. Apply claim 3 to this π (which satisfies the absorption condition) with η=ε′′/2, obtaining N4, and put N5=max(N0,N4). For N≥N5 the two displays combine to