TheoremBase

Observation-Measurability of the Cascade Good Sets and the Restricted Filtering Bound

Statement

Adopt the setting and notation of the block cascade lemma — the solution of the controlled NN-agent dynamics with regular event Ω0\Omega_{0}, empirical state measure Σ\Sigma, control α\alpha, observation filtration (Gt)t∈[0,T](\mathcal{G}_{t})_{t\in[0,T]} and system filtration (Ftsys)t∈[0,T](\mathcal{F}^{\mathrm{sys}}_{t})_{t\in[0,T]}; the block data T0T_{0}, KK, tkt_{k}, the levels LkL_{k}, the anchored clocks σ(k)\sigma^{(k)}, the good sets GkG_{k} and the leave events DkD_{k} — and the setting and notation of the completion-of-squares theorem: the fluctuation processes st\mathfrak{s}_{t}, at\mathfrak{a}_{t} about a mean-field trajectory pair (S,A)(S,A), the matrices RtR_{t} and WtW_{t}, hypothesis (H1) with constant r>0r>0, hypothesis (H2) with Riccati family ZZ, and the process ut=at+Rt−1WtTstu_{t}=\mathfrak{a}_{t}+R_{t}^{-1}W_{t}^{T}\mathfrak{s}_{t}. Write E\mathbb{E} for the expectation, 1D\mathbf{1}_{D} for the indicator of a set DD, x⋅My=∑p,qMpqxpyqx\cdot My=\sum_{p,q}M^{pq}x^{p}y^{q} for the entry pairing of the completion-of-squares theorem, and ∣⋅∣|\cdot| for the Euclidean norm. Set

Ξt=WtRt−1WtT,\Xi_{t}=W_{t}R_{t}^{-1}W_{t}^{T},

a real matrix with ll rows and ll columns, as in conclusion (b) of the filtering lower-bound reduction lemma.

Then the following hold.

0. (The regular event is observable.) Ω0∈G0\Omega_{0}\in\mathcal{G}_{0}.

1. (The good sets are observable.) For every k∈{0,…,K}k\in\{0,\dots,K\} the event GkG_{k} belongs to Gtk\mathcal{G}_{t_{k}}, and for every k∈{0,…,K−1}k\in\{0,\dots,K-1\} and every t∈[0,T]t\in[0,T] the tracked event

Tk(t)=Gk∩{t<σ(k)}\mathcal{T}_{k}(t)=G_{k}\cap\{t<\sigma^{(k)}\}

belongs to Gt\mathcal{G}_{t} whenever t≥tkt\ge t_{k}.

2. (Symmetry and positive semidefiniteness of Ξ\Xi.) For every t∈[0,T]t\in[0,T] the matrix Ξt\Xi_{t} is symmetric and positive semidefinite, and its entries are continuous, hence bounded, on [0,T][0,T].

3. (Restricted filtering bound.) Let t∈[0,T]t\in[0,T] and let H∈Gt\mathcal{H}\in\mathcal{G}_{t} be an event. The components of st\mathfrak{s}_{t} and of at\mathfrak{a}_{t} are square-integrable, each component of at\mathfrak{a}_{t} is almost surely equal to a Gt\mathcal{G}_{t}-measurable square-integrable random variable by the observation-adaptedness lemma, and for any choice of conditional expectations E[stγ∣Gt]\mathbb{E}[\mathfrak{s}^{\gamma}_{t}\mid\mathcal{G}_{t}], which exist by the existence and uniqueness theorem, the filtering error εt\varepsilon_{t} with components εtγ=stγ−E[stγ∣Gt]\varepsilon^{\gamma}_{t}=\mathfrak{s}^{\gamma}_{t}-\mathbb{E}[\mathfrak{s}^{\gamma}_{t}\mid\mathcal{G}_{t}] satisfies

E[1H ut⋅Rtut] ≥ ∑γ=1l∑δ=1lΞtγδ E[1H εtγεtδ] ≥ 0,\mathbb{E}\bigl[\mathbf{1}_{\mathcal{H}}\,u_{t}\cdot R_{t}u_{t}\bigr]\ \ge\ \sum_{\gamma=1}^{l}\sum_{\delta=1}^{l}\Xi^{\gamma\delta}_{t}\,\mathbb{E}\bigl[\mathbf{1}_{\mathcal{H}}\,\varepsilon^{\gamma}_{t}\varepsilon^{\delta}_{t}\bigr]\ \ge\ 0,

all the expectations being finite. The middle quantity is unchanged if the conditional expectations E[stγ∣Gt]\mathbb{E}[\mathfrak{s}^{\gamma}_{t}\mid\mathcal{G}_{t}] are replaced by any other conditional expectations of the stγ\mathfrak{s}^{\gamma}_{t} given Gt\mathcal{G}_{t}.

4. (Application to the cascade.) In particular, for every k∈{0,…,K−1}k\in\{0,\dots,K-1\} and every t∈[tk,T]t\in[t_{k},T],

E[1Gk1{t<σ(k)} ut⋅Rtut] ≥ ∑γ,δ=1lΞtγδ E[1Gk1{t<σ(k)} εtγεtδ] ≥ 0.\mathbb{E}\bigl[\mathbf{1}_{G_{k}}\mathbf{1}_{\{t<\sigma^{(k)}\}}\,u_{t}\cdot R_{t}u_{t}\bigr]\ \ge\ \sum_{\gamma,\delta=1}^{l}\Xi^{\gamma\delta}_{t}\,\mathbb{E}\bigl[\mathbf{1}_{G_{k}}\mathbf{1}_{\{t<\sigma^{(k)}\}}\,\varepsilon^{\gamma}_{t}\varepsilon^{\delta}_{t}\bigr]\ \ge\ 0 .

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…