Reason: First version. Converts a van Trees certificate for a localized estimand into a lower bound on the conditional-mean-square filtering error restricted to an event of the conditioning sigma-algebra; the localization is absorbed into the estimand, so no uniform integrability of the error is needed.
Assume the following van Trees certificate for the data (X,G,H,c) with tolerance ϵ and value ϰ: there are a natural numberd≥1, a measurable space(Y,Y), a σ-finite measureϱ0 on it, a map D:Ω→Ymeasurable with respect to F and Y, square-integrable random variables Θ1,…,Θd with Θ=(Θ1,…,Θd), and vectors α,z∈Rd with z nonzero, such that:
(C1) every G-measurable square-integrable random variable is almost surely equal to g(D)=g∘D for some g:Y→R measurable with respect to Y and the Borel σ-algebra for which g(D) is square-integrable;
(C2) the random variables Θ1,…,Θd, the map D and the measure ϱ0 satisfy hypotheses (i)--(iv) of the multivariate van Trees inequality, with l there replaced by d and with data space (Y,Y) carrying ϱ0; write I for the resulting van Trees information matrix, which is positive definite by hypothesis (iv) there;
1. (Localization of the filtering error.) The random variables 1H(c⋅X) and 1H(c⋅M) are square-integrable, 1H(c⋅M) is a conditional expectation of 1H(c⋅X) given G, and
E[1Hγ=1∑lδ=1∑lcγcδεγεδ]=E[1H(c⋅ε)2].
2. (Certified lower bound.) If ϰ≥ϵ then
E[1H(c⋅ε)2]≥(ϰ−ϵ)2.
Both quantities are unchanged if the conditional expectations Mγ are replaced by any other conditional expectations of the Xγ given G.
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.