Level-Revealed Conditioning for Jointly Driven Solutions of the Controlled N-Agent Dynamics
lemmaProbabilitylem:n-agent-level-revealed-conditioning-2026aLet , , , be natural numbers with , , , , let be a transition-rate family on states with control dimension and rate bound , let be an observation-rate family with channels and rate bound , and let be a real number. Let be a probability space carrying transition clocks and observation clocks as in conditions 2 and 3 of N-Agent Driving System, and let be a -algebra such that the finite family of -algebras consisting of together with the -algebra generated by the variables of each single clock is independent. As in Compensated Counters of the Controlled N-Agent Dynamics are Square-Integrable Martingales, a clock label is either a pair with or a pair ; write for the corresponding clock and for when is a transition label and for when is an observation label (the bounds are used by results adopting this setting).
Let be a natural number and, for each , let be -measurable random variables with values in . Then with the initial states and the common clocks is an -agent driving system (condition 4 there holding since ). For each let be an observation-driven control policy with horizon , control dimension , and channels, and let a solution of the controlled -agent dynamics on for on the -th driving system be given, with consumed clock times (indexed by the clock labels ) and system filtration .
Fix and a nonnegative real for each clock label . Let be the -algebra generated by together with the clock variables for all clock labels and all real with ; let be the event that for every clock label ; and let .
1. (Embedding of events) The event agrees up to an event of probability zero with an event of ; and for every in the -algebra generated by the union of the system -algebras at time , there is such that the symmetric difference of and is an event of probability zero.
2. (Embedding of random variables) For every -measurable there is an -measurable with almost surely.
3. (Fresh clock beyond its cap) For every clock label , the -algebra generated by the increments of beyond is independent of the -algebra the union over all clock labels ; in particular it is independent of , and of every -algebra generated by together with increments of clocks other than beyond arbitrary levels.
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.