TheoremBase

Proof

Preliminaries. Fix a natural number N≥1N\ge1 and an admissible parameter vector π\pi, and let KK, the grid, the levels, the clocks, the good sets, the leave events, the block energy increments, Λ⋆\Lambda_{\star}, Z\mathcal{Z}, P\mathcal{P} and Υlev\Upsilon_{\mathrm{lev}} be the objects formed from π\pi for the NN-th solution. By the definition of admissibility every parameter-dependent hypothesis of the ledger lemma holds for that solution, and its remaining standing hypotheses hold by assumption; so the ledger lemma, and with it the block cascade lemma whose setting it adopts, applies to the NN-th solution for every N≥1N\ge1. Four facts are used repeatedly.

(P1) By claim 5 of the progressive measurability lemma for the realized control, applied to the map AA of the setting, each of whose components is measurable with respect to the trace Borel σ\sigma-algebra B[0,T]\mathcal{B}_{[0,T]} on [0,T][0,T] and the Borel σ\sigma-algebra of the real line: for every t∈[0,T]t\in[0,T] the function Et\mathcal{E}_{t} is Gt\mathcal{G}_{t}-measurable with values in [0,4R2T][0,4R^{2}T], and 0≤Et(ω)−Et0(ω)≤4R2(t−t0)0\le\mathcal{E}_{t}(\omega)-\mathcal{E}_{t_{0}}(\omega)\le4R^{2}(t-t_{0}) for all 0≤t0≤t≤T0\le t_{0}\le t\le T and every ω∈Ω\omega\in\Omega. In particular every path t↦Et(ω)t\mapsto\mathcal{E}_{t}(\omega) is nondecreasing, and E0=0\mathcal{E}_{0}=0 because the integral over [0,0][0,0] is 00.

(P2) By claim 1 of the block cascade lemma, K≥1K\ge1, t0=0t_{0}=0, tK=Tt_{K}=T and tk<tk+1t_{k}<t_{k+1} for every k∈{0,…,K−1}k\in\{0,\dots,K-1\}.

(P3) By claim 2 of the block cascade lemma each clock σ(k)\sigma^{(k)} takes its values in [tk,T][t_{k},T], each GkG_{k} is an event, G0⊇G1⊇⋯⊇GKG_{0}\supseteq G_{1}\supseteq\dots\supseteq G_{K}, and the sets D0,…,DK−1,GKD_{0},\dots,D_{K-1},G_{K} are pairwise disjoint with union Ω0\Omega_{0}; moreover Gk+1=Gk∩{σ(k)≥tk+1}G_{k+1}=G_{k}\cap\{\sigma^{(k)}\ge t_{k+1}\} by the definition of the good sets there.

(P4) By (P1), (P2) and (P3), tk≤min⁡(σ(k)(ω),tk+1)≤Tt_{k}\le\min(\sigma^{(k)}(\omega),t_{k+1})\le T for every kk and every ω\omega, so ΔkE≥0\Delta_{k}\mathcal{E}\ge0; each ΔkE\Delta_{k}\mathcal{E} is a random variable with values in [0,4R2hk][0,4R^{2}h_{k}], as recorded in the block cascade lemma. Hence every expectation appearing in the definition of Z\mathcal{Z} is that of a bounded nonnegative random variable, and Z\mathcal{Z} is a finite nonnegative real number.

Proof of claim 1. Let ω∈GK\omega\in G_{K} and k∈{0,…,K−1}k\in\{0,\dots,K-1\}. By (P3) we have GK⊆Gk+1⊆{σ(k)≥tk+1}G_{K}\subseteq G_{k+1}\subseteq\{\sigma^{(k)}\ge t_{k+1}\}, so σ(k)(ω)≥tk+1\sigma^{(k)}(\omega)\ge t_{k+1}, hence min⁡(σ(k)(ω),tk+1)=tk+1\min(\sigma^{(k)}(\omega),t_{k+1})=t_{k+1} and

ΔkE(ω)=Etk+1(ω)−Etk(ω).\Delta_{k}\mathcal{E}(\omega)=\mathcal{E}_{t_{k+1}}(\omega)-\mathcal{E}_{t_{k}}(\omega).

Summing over k∈{0,…,K−1}k\in\{0,\dots,K-1\}, the right-hand sides telescope, so by (P2) and E0=0\mathcal{E}_{0}=0,

∑k=0K−1ΔkE(ω)=EtK(ω)−Et0(ω)=ET(ω).\sum_{k=0}^{K-1}\Delta_{k}\mathcal{E}(\omega)=\mathcal{E}_{t_{K}}(\omega)-\mathcal{E}_{t_{0}}(\omega)=\mathcal{E}_{T}(\omega).

Multiplying by the indicator of GKG_{K}, and noting that both sides vanish off GKG_{K}, we get the identity 1GKET=∑k=0K−11GKΔkE\mathbf{1}_{G_{K}}\mathcal{E}_{T}=\sum_{k=0}^{K-1}\mathbf{1}_{G_{K}}\Delta_{k}\mathcal{E} of functions on Ω\Omega. Since GK⊆GkG_{K}\subseteq G_{k} by (P3) and ΔkE≥0\Delta_{k}\mathcal{E}\ge0 by (P4), we have 1GKΔkE≤1GkΔkE\mathbf{1}_{G_{K}}\Delta_{k}\mathcal{E}\le\mathbf{1}_{G_{k}}\Delta_{k}\mathcal{E} at every point of Ω\Omega. All the functions involved are bounded random variables, hence have finite expectations, so by the additivity and monotonicity of the expectation

E[1GKET]=∑k=0K−1E[1GKΔkE]≤∑k=0K−1E[1GkΔkE]=ZN,\mathbb{E}\bigl[\mathbf{1}_{G_{K}}\mathcal{E}_{T}\bigr]=\sum_{k=0}^{K-1}\mathbb{E}\bigl[\mathbf{1}_{G_{K}}\Delta_{k}\mathcal{E}\bigr]\le\sum_{k=0}^{K-1}\mathbb{E}\bigl[\mathbf{1}_{G_{k}}\Delta_{k}\mathcal{E}\bigr]=\frac{\mathcal{Z}}{N},

the last equality being the definition of Z\mathcal{Z}.

For the second assertion, P(Ω0)=1P(\Omega_{0})=1 by the definition of a solution of the controlled NN-agent dynamics, and by (P3) the events D0,…,DK−1,GKD_{0},\dots,D_{K-1},G_{K} are pairwise disjoint with union Ω0\Omega_{0}; so by the additivity of the probability, 1=P(Ω0)=P+P(GK)1=P(\Omega_{0})=\mathcal{P}+P(G_{K}) and therefore P(Ω∖GK)=1−P(GK)=PP(\Omega\setminus G_{K})=1-P(G_{K})=\mathcal{P}. The inequality P≤Λ⋆ZΥlevN−1\mathcal{P}\le\Lambda_{\star}\mathcal{Z}\Upsilon_{\mathrm{lev}}N^{-1} is the first assertion of clause (d) of claim 1 of the ledger lemma. Finiteness of the three quantities holds by (P4) and because probabilities are finite.

Proof of claim 2. Fix N≥1N\ge1, ω∈Ω\omega\in\Omega and t∈[0,T]t\in[0,T], and define f:[0,T]→Rf:[0,T]\to\mathbb{R} by f(s)=∣α^(s,ω)−As∣f(s)=|\hat{\alpha}(s,\omega)-A_{s}|.

The function ff is measurable and bounded. By claim 3 of the realized-control lemma the path s↦α^(s,ω)s\mapsto\hat{\alpha}(s,\omega) takes all its values in A\mathcal{A} and is square-integrable; in particular each of its components is B[0,T]\mathcal{B}_{[0,T]}-measurable, by the definition of the Lebesgue space of square-integrable vector-valued maps. Each component of AA is B[0,T]\mathcal{B}_{[0,T]}-measurable, as recorded in (P1). Hence by claim 2 of the arithmetic of measurable real functions each component of s↦α^(s,ω)−Ass\mapsto\hat{\alpha}(s,\omega)-A_{s} is B[0,T]\mathcal{B}_{[0,T]}-measurable, and since the Euclidean norm is continuous on Rm\mathbb{R}^{m}, hence sequentially continuous there, the composition lemma for sequentially continuous functions of measurable Euclidean maps shows that ff is B[0,T]\mathcal{B}_{[0,T]}-measurable. Both α^(s,ω)\hat{\alpha}(s,\omega) and AsA_{s} lie in A\mathcal{A} and ∣a∣≤R|a|\le R for every a∈Aa\in\mathcal{A}, so 0≤f≤2R0\le f\le2R by the triangle inequality for the Euclidean norm; and f2f^{2}, which is B[0,T]\mathcal{B}_{[0,T]}-measurable by claim 3 of the arithmetic lemma, satisfies ∫[0,t]f2 ds=Et(ω)\int_{[0,t]}f^{2}\,ds=\mathcal{E}_{t}(\omega), a finite number by (P1).

The first bound. If t=0t=0 both sides vanish, since the integral over [0,0][0,0] is 00 and ET(ω)≥0\mathcal{E}_{T}(\omega)\ge0. Let t>0t>0 and apply claim 4 of the integral toolkit on the compact interval [0,t][0,t] to the restriction of ff and to the constant function 11: these are B[0,t]\mathcal{B}_{[0,t]}-measurable with ∫[0,t]f2 ds<∞\int_{[0,t]}f^{2}\,ds<\infty and ∫[0,t]1 ds=t<∞\int_{[0,t]}1\,ds=t<\infty, so ff is integrable on [0,t][0,t] and

(∫[0,t]f ds)2 ≤ t∫[0,t]f2 ds = t Et(ω) ≤ T ET(ω),\Bigl(\int_{[0,t]}f\,ds\Bigr)^{2}\ \le\ t\int_{[0,t]}f^{2}\,ds\ =\ t\,\mathcal{E}_{t}(\omega)\ \le\ T\,\mathcal{E}_{T}(\omega),

the last step by t≤Tt\le T and the monotonicity of u↦Eu(ω)u\mapsto\mathcal{E}_{u}(\omega) from (P1). Taking nonnegative square roots, and using that the nonnegative square root is nondecreasing, gives ∫[0,t]f ds≤T ET(ω)1/2\int_{[0,t]}f\,ds\le\sqrt{T}\,\mathcal{E}_{T}(\omega)^{1/2}.

The second bound. Apply claim 4 of the extended good-set stopping-time lemma in the instance of its setting determined by the present data with S∗=SS^{*}=S, the thresholds δ\delta, θout\theta_{\mathrm{out}}, εY\varepsilon_{Y} and cEc_{\mathcal{E}} of that setting being given the value 11, which is permitted because none of α^\hat{\alpha}, Φ\Phi, YY, E\mathcal{E}, CSC_{S} and none of the conclusions of that claim involves them. The standing hypothesis on S∗S^{*} required by that claim holds here: (S,A,P)(S,A,P) is a stationary mean-field triple with S0=x0S_{0}=x_{0}, so SS takes its values in Δl\Delta^{l} and Stγ=x0γ+∫[0,t]bγ(Ss,As) dsS^{\gamma}_{t}=x^{\gamma}_{0}+\int_{[0,t]}b^{\gamma}(S_{s},A_{s})\,ds for every t∈[0,T]t\in[0,T] and every γ∈{1,…,l}\gamma\in\{1,\dots,l\}. That claim gives Yt(ω)≤CS Et(ω)1/2Y_{t}(\omega)\le C_{S}\,\mathcal{E}_{t}(\omega)^{1/2}; since Et(ω)≤ET(ω)\mathcal{E}_{t}(\omega)\le\mathcal{E}_{T}(\omega) by (P1) and the nonnegative square root is nondecreasing, and since Yt(ω)=∣Φt(ω)−St∣Y_{t}(\omega)=|\Phi_{t}(\omega)-S_{t}|, we get ∣Φt(ω)−St∣≤CS ET(ω)1/2|\Phi_{t}(\omega)-S_{t}|\le C_{S}\,\mathcal{E}_{T}(\omega)^{1/2}.

Neither bound refers to the parameter vector: α^\hat{\alpha}, AA, E\mathcal{E}, Φ\Phi, SS and CSC_{S} are all defined without it.

Proof of claim 3. Let A\mathsf{A} be the collection of those parameter vectors that are admissible and satisfy the absorption condition of clause (a) of the lower bound theorem. Both requirements involve only the parameter vector and constants of the common data: admissibility does so by the remark to that effect in the lower bound theorem, and the absorption condition 2Ctg∨Λ⋆+2ϵCS2≤c⋆/42C^{\vee}_{tg}\Lambda_{\star}+2\epsilon C_{S}^{2}\le c_{\star}/4 because ϵ\epsilon is one of the components of the parameter vector, CSC_{S} is determined by the common data and Λ⋆\Lambda_{\star} by the parameter vector and the common data, and Ctg∨C^{\vee}_{tg} and c⋆c_{\star} are among the constants that the lower bound theorem lists as determined by the common data and the same for every NN. Hence A\mathsf{A} is determined by the common data alone, and in particular depends neither on NN nor on the individual solutions. It is nonempty, because clause (b) applied with ε′=1\varepsilon'=1 furnishes a member of it. Choose π∙∈A\pi_{\bullet}\in\mathsf{A}, put Z♯=Z♯(π∙)\mathcal{Z}^{\sharp}=\mathcal{Z}^{\sharp}(\pi_{\bullet}), and let N1N_{1} be the natural number that clause (a), applied to π∙\pi_{\bullet}, furnishes; then for every N≥N1N\ge N_{1} the tracked energy of the NN-th solution formed from π∙\pi_{\bullet} satisfies Z≤Z♯\mathcal{Z}\le\mathcal{Z}^{\sharp}. Now π∙\pi_{\bullet} has been chosen from a collection determined by the common data; the real number Z♯(π)\mathcal{Z}^{\sharp}(\pi) is defined from π\pi, from the bounds J♯\mathcal{J}^{\sharp} and κ♯\kappa^{\sharp} and from constants of the common data; and clause (a) provides N1N_{1} depending on π∙\pi_{\bullet} and the common data but not on the solutions. So π∙\pi_{\bullet}, Z♯\mathcal{Z}^{\sharp} and N1N_{1} are determined as asserted. Finally, taking N=N1N=N_{1} gives Z♯≥Z≥0\mathcal{Z}^{\sharp}\ge\mathcal{Z}\ge0 by (P4), so Z♯≥0\mathcal{Z}^{\sharp}\ge0.

Proof of claim 4. Such a number N♭N_{\flat} exists: by clause 1 of the Archimedean property there is a natural number N′N' with N′≥Cesc/ε♭N'\ge C_{\mathrm{esc}}/\varepsilon_{\flat}, and the larger of N′N' and N1N_{1} is then a natural number N♭N_{\flat} with N♭≥N1N_{\flat}\ge N_{1} and ε♭N♭≥ε♭N′≥Cesc\varepsilon_{\flat}N_{\flat}\ge\varepsilon_{\flat}N'\ge C_{\mathrm{esc}}. Fix N≥N♭N\ge N_{\flat} and write c=Cctl/(ε♭N)c=C_{\mathrm{ctl}}/(\varepsilon_{\flat}N), a positive real number because Cctl≥2>0C_{\mathrm{ctl}}\ge2>0 by claim 3, ε♭>0\varepsilon_{\flat}>0 and N≥1N\ge1.

ΩN♭\Omega^{\flat}_{N} is an event of GT\mathcal{G}_{T}. By claim 1 of the cascade filtering lemma the good set GKG_{K} belongs to GtK\mathcal{G}_{t_{K}}, and tK=Tt_{K}=T by (P2). By (P1) the function ET\mathcal{E}_{T} is GT\mathcal{G}_{T}-measurable, so {ET≤c}∈GT\{\mathcal{E}_{T}\le c\}\in\mathcal{G}_{T}. A σ\sigma-algebra is closed under intersections and GT⊆F\mathcal{G}_{T}\subseteq\mathcal{F}, so ΩN♭∈GT\Omega^{\flat}_{N}\in\mathcal{G}_{T} and ΩN♭\Omega^{\flat}_{N} is an event.

The probability bound. Since ΩN♭\Omega^{\flat}_{N} is the intersection of GKG_{K} with {ET≤c}\{\mathcal{E}_{T}\le c\},

Ω∖ΩN♭=(Ω∖GK)∪(GK∩{ET>c}),\Omega\setminus\Omega^{\flat}_{N}=(\Omega\setminus G_{K})\cup\bigl(G_{K}\cap\{\mathcal{E}_{T}>c\}\bigr),

and it suffices to bound the probability of each of the two sets on the right by ε♭/2\varepsilon_{\flat}/2.

For the first, claim 1 and claim 3 give P(Ω∖GK)≤Λ⋆ΥlevZN−1≤Λ⋆ΥlevZ♯N−1=Cesc/(2N)P(\Omega\setminus G_{K})\le\Lambda_{\star}\Upsilon_{\mathrm{lev}}\mathcal{Z}N^{-1}\le\Lambda_{\star}\Upsilon_{\mathrm{lev}}\mathcal{Z}^{\sharp}N^{-1}=C_{\mathrm{esc}}/(2N), the middle step because Λ⋆>0\Lambda_{\star}>0 and Υlev>0\Upsilon_{\mathrm{lev}}>0 and Z≤Z♯\mathcal{Z}\le\mathcal{Z}^{\sharp} for N≥N1N\ge N_{1}; and ε♭N≥ε♭N♭≥Cesc\varepsilon_{\flat}N\ge\varepsilon_{\flat}N_{\flat}\ge C_{\mathrm{esc}} gives Cesc/(2N)≤ε♭/2C_{\mathrm{esc}}/(2N)\le\varepsilon_{\flat}/2.

For the second, put X=1GKETX=\mathbf{1}_{G_{K}}\mathcal{E}_{T}, a nonnegative bounded random variable with E[X]≤Z/N≤Z♯/N\mathbb{E}[X]\le\mathcal{Z}/N\le\mathcal{Z}^{\sharp}/N by claims 1 and 3. If ω∈GK\omega\in G_{K} and ET(ω)>c\mathcal{E}_{T}(\omega)>c then X(ω)=ET(ω)>cX(\omega)=\mathcal{E}_{T}(\omega)>c, so GK∩{ET>c}⊆{X≥c}G_{K}\cap\{\mathcal{E}_{T}>c\}\subseteq\{X\ge c\}. Hence, by Markov's inequality applied to XX and the positive real cc, and by the monotonicity of the probability,

P(GK∩{ET>c}) ≤ P(X≥c) ≤ E[X]c ≤ Z♯Nc = ε♭ Z♯Cctl = ε♭ Z♯2(Z♯+1) ≤ ε♭2,P\bigl(G_{K}\cap\{\mathcal{E}_{T}>c\}\bigr)\ \le\ P(X\ge c)\ \le\ \frac{\mathbb{E}[X]}{c}\ \le\ \frac{\mathcal{Z}^{\sharp}}{Nc}\ =\ \frac{\varepsilon_{\flat}\,\mathcal{Z}^{\sharp}}{C_{\mathrm{ctl}}}\ =\ \frac{\varepsilon_{\flat}\,\mathcal{Z}^{\sharp}}{2(\mathcal{Z}^{\sharp}+1)}\ \le\ \frac{\varepsilon_{\flat}}{2},

the last step because Z♯≥0\mathcal{Z}^{\sharp}\ge0 and hence Z♯≤Z♯+1\mathcal{Z}^{\sharp}\le\mathcal{Z}^{\sharp}+1. Adding the two bounds and using the subadditivity of the probability gives P(Ω∖ΩN♭)≤ε♭P(\Omega\setminus\Omega^{\flat}_{N})\le\varepsilon_{\flat}.

The three pathwise bounds. Let ω∈ΩN♭\omega\in\Omega^{\flat}_{N} and t∈[0,T]t\in[0,T]. By (P1) and the definition of ΩN♭\Omega^{\flat}_{N},

∫[0,t]∣α^(s,ω)−As∣2 ds=Et(ω)≤ET(ω)≤c=Cctlε♭N,\int_{[0,t]}|\hat{\alpha}(s,\omega)-A_{s}|^{2}\,ds=\mathcal{E}_{t}(\omega)\le\mathcal{E}_{T}(\omega)\le c=\frac{C_{\mathrm{ctl}}}{\varepsilon_{\flat}N},

which is the first bound. Since the nonnegative square root is nondecreasing, ET(ω)1/2≤c1/2\mathcal{E}_{T}(\omega)^{1/2}\le c^{1/2}, so claim 2 gives

∫[0,t]∣α^(s,ω)−As∣ ds ≤ T c1/2=(T Cctlε♭N)1/2,∣Φt(ω)−St∣ ≤ CS c1/2=CS Cctl1/2(ε♭N)1/2=Cflw(ε♭N)1/2,\int_{[0,t]}|\hat{\alpha}(s,\omega)-A_{s}|\,ds\ \le\ \sqrt{T}\,c^{1/2}=\Bigl(\frac{T\,C_{\mathrm{ctl}}}{\varepsilon_{\flat}N}\Bigr)^{1/2},\qquad |\Phi_{t}(\omega)-S_{t}|\ \le\ C_{S}\,c^{1/2}=\frac{C_{S}\,C_{\mathrm{ctl}}^{1/2}}{(\varepsilon_{\flat}N)^{1/2}}=\frac{C_{\mathrm{flw}}}{(\varepsilon_{\flat}N)^{1/2}},

which are the second and third bounds. This completes the proof.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…