Asymptotic Lower Bound for the Recentred N-Agent Cost without Uniform Control-Moment Hypotheses
theoremAnalysisProbabilitythm:n-agent-cost-lower-bound-2026aCommon data. Fix an affine-controlled transition-rate family on states with compact convex control set and control bound , its transition-rate family with rate bound , an observation-rate family , a horizon , population cost data convex in the control on , a twice continuously differentiable extension of , a twice continuously differentiable extension of , and a stationary mean-field triple for these data with in the probability simplex. Let be the aggregate fluctuation covariance of and write . Adopt the setting of the completion-of-squares theorem for these data — the matrices , , , , , , the entry pairing , and hypothesis (H2) with a Riccati family , which is part of the common data and does not depend on . Write for the expectation, for the Euclidean norm, and for the Lebesgue integral over a compact interval.
The family of solutions. For each natural number let there be given an -agent driving system, an -valued observation-driven control policy with horizon , and a solution of the controlled -agent dynamics on for these data, with regular event , empirical state measure , control and observation filtration . Write and for its fluctuation processes, , and for the recentred cost of the first-order expansion lemma. These objects depend on ; the superscript is suppressed.
Standing hypotheses. Assume that the common data and each of these solutions satisfy every standing hypothesis of the ledger lemma that does not involve the cascade parameters: hypotheses (A) and (U) of the quadratic growth lemma, hypothesis (JC) of the localized joint coercivity lemma with constant , hypothesis (H2) above, hypothesis (LipC) of the pathwise tracking lemma, the optimality and hypothesis (TG) of the to-go comparison lemma, and the standing hypothesis on of the block cascade lemma. All the constants of the ledger lemma that are determined by the common data — in particular , , , , , , , , , , , , , , , , , , and the moduli — are then the same for every . Assume moreover:
(I) (Initial covariance convergence.) There is a symmetric real matrix with rows and columns such that for all the real sequence has limit .
(I) (Uniform initial fourth moment.) There is a real with for every .
(CB) (Cost bound.) There is a real with for every .
Neither (I) nor (CB) constrains the fluctuation processes at positive times: (I) is a hypothesis on the initial data alone, and (CB) is a hypothesis on the costs, vacuously satisfiable along any family whose costs are bounded above and carrying no information when they are not. No hypothesis bounding or uniformly in at positive times is made.
The limit value. By conclusion (a) of the completion-of-squares theorem and (H2) each entry is continuous and bounded on , and by clause (c) of the covariance deviation lemma so is each ; the product is therefore continuous by continuity of sums and products and has a finite Lebesgue integral over by claim 3 of the integral toolkit. Set
a real number determined by the common data and .
Admissible parameter vectors. Call a tuple of positive reals with and — the clipping threshold being written , as in the ledger lemma, because the letter serves throughout as a state index — admissible if, when the block cascade of the block cascade lemma and the near-field data of the ledger lemma are formed from for the -th solution, every parameter-dependent requirement of the ledger lemma holds — namely the smallness hypothesis (SM), the requirement with chosen from as in the ledger lemma, and the near-field smallness condition (SN). These requirements involve only and constants of the common data, so admissibility does not depend on .
Then the following hold.
(a) (Uniform tracked energy bound.) Let be admissible and let be the number of blocks it determines. Set
If in addition satisfies the absorption condition , then there is a natural number , depending on and on the common data but not on the solutions, such that for every the tracked energy of the -th solution satisfies , and consequently with as in the ledger lemma.
(b) (Parameter ladder.) For every real there are an admissible satisfying the absorption condition of (a) and a natural number such that for every
the blocks , the near-field tracked events and the process being those of the ledger lemma formed from for the -th solution, and the displayed sum being nonnegative.
(c) (Asymptotic lower bound.) ; that is, for every real there is a natural number with for every .
Conclusion (c) is the conclusion of clause (c) of the filtering lower-bound reduction lemma, with its filtering term discarded, obtained without that lemma's uniform fourth-moment hypothesis on and . The filtering term retained in (b) is the object on which a lower bound by the Kalman filter covariance would act; no such bound is asserted here.
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.