TheoremBase

Level-Revealed Conditioning for Jointly Driven Solutions of the Controlled N-Agent Dynamics

Statement

Let NN, ll, l~\tilde{l}, mm be natural numbers with N≥1N\ge1, l≥2l\ge2, l~≥1\tilde{l}\ge1, m≥1m\ge1, let A\mathcal{A} be a nonempty subset of Euclidean space Rm\mathbb{R}^m, let β\beta be a transition-rate family on ll states with control set A\mathcal{A} and rate bound BB, let β~\tilde{\beta} be an observation-rate family with l~\tilde{l} channels and rate bound B~\tilde{B}, and let T>0T>0 be a real number. Let (Ω,F,P)(\Omega,\mathcal{F},P) be a probability space carrying transition clocks Yi,σγY^{i,\sigma\gamma} and observation clocks Y~i,υ\tilde{Y}^{i,\upsilon} as in conditions 2 and 3 of N-Agent Driving System, and let S0⊆F\mathcal{S}_0\subseteq\mathcal{F} be a σ\sigma-algebra such that the finite family of σ\sigma-algebras consisting of S0\mathcal{S}_0 together with the σ\sigma-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 aa is either a pair (i,σγ)(i,\sigma\gamma) with σ≠γ\sigma\neq\gamma or a pair (i,υ)(i,\upsilon); write YaY^{a} for the corresponding clock and BaB_a for BB when aa is a transition label and for B~\tilde{B} when aa is an observation label (the bounds BaB_a are used by results adopting this setting).

Let J≥1J\ge1 be a natural number and, for each j∈{1,…,J}j\in\{1,\dots,J\}, let ςj=(ςj1,…,ςjN)\varsigma_j=(\varsigma_j^1,\dots,\varsigma_j^N) be S0\mathcal{S}_0-measurable random variables with values in {1,…,l}\{1,\dots,l\}. Then (Ω,F,P)(\Omega,\mathcal{F},P) with the initial states ςj\varsigma_j and the common clocks is an NN-agent driving system (condition 4 there holding since σ(ςj1,…,ςjN)⊆S0\sigma(\varsigma_j^1,\dots,\varsigma_j^N)\subseteq\mathcal{S}_0). For each jj let hjh_j be an observation-driven control policy with horizon TT, control dimension mm, and l~\tilde{l} channels, which is A\mathcal{A}-valued, and let a solution of the controlled NN-agent dynamics on [0,T][0,T] for hjh_j on the jj-th driving system be given, with consumed clock times AjaA_j^{a} (indexed by the clock labels aa) and system filtration (Ftsys,j)t∈[0,T](\mathcal{F}^{\mathrm{sys},j}_t)_{t\in[0,T]}.

Fix r∈[0,T]r\in[0,T] and a nonnegative real cac_a for each clock label aa. Let H\mathcal{H} be the σ\sigma-algebra generated by S0\mathcal{S}_0 together with the clock variables YuaY^{a}_u for all clock labels aa and all real uu with 0≤u≤ca0\le u\le c_a; let CjC_j be the event that Aja(r)≤caA_j^{a}(r)\le c_a for every clock label aa; and let C=C1∩⋯∩CJC=C_1\cap\dots\cap C_J.

1. (Embedding of events) The event CC agrees up to an event of probability zero with an event of H\mathcal{H}; and for every FF in the σ\sigma-algebra Frsys,1∨⋯∨Frsys,J\mathcal{F}^{\mathrm{sys},1}_r\vee\dots\vee\mathcal{F}^{\mathrm{sys},J}_r generated by the union of the system σ\sigma-algebras at time rr, there is H∈HH\in\mathcal{H} such that the symmetric difference of F∩CF\cap C and H∩CH\cap C is an event of probability zero.

2. (Embedding of random variables) For every Frsys,1∨⋯∨Frsys,J\mathcal{F}^{\mathrm{sys},1}_r\vee\dots\vee\mathcal{F}^{\mathrm{sys},J}_r-measurable Z:Ω→[0,∞]Z:\Omega\to[0,\infty] there is an H\mathcal{H}-measurable Z^:Ω→[0,∞]\hat{Z}:\Omega\to[0,\infty] with Z 1C=Z^ 1CZ\,\mathbf{1}_C=\hat{Z}\,\mathbf{1}_C almost surely.

3. (Fresh clock beyond its cap) For every clock label aa, the σ\sigma-algebra σ(Yca+sa−Ycaa: s≥0)\sigma(Y^{a}_{c_a+s}-Y^{a}_{c_a}:\ s\ge0) generated by the increments of YaY^{a} beyond cac_a is independent of the σ\sigma-algebra Ha+=σ(S0 ∪ ⋃b≠aσ(Yub:u≥0) ∪ σ(Yua:0≤u≤ca)),\mathcal{H}^{+}_{a}=\sigma\Bigl(\mathcal{S}_0\ \cup\ \bigcup_{b\neq a}\sigma\bigl(Y^{b}_u:u\ge0\bigr)\ \cup\ \sigma\bigl(Y^{a}_u:0\le u\le c_a\bigr)\Bigr), the union over all clock labels b≠ab\neq a; in particular it is independent of H\mathcal{H}, and of every σ\sigma-algebra generated by H\mathcal{H} together with increments of clocks other than aa beyond arbitrary levels.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…