Reason: Proof of P8.1b: instantiation of the record-frozen closeness-set and envelope lemmas, tail of the noise majorant, the control- and flow-closeness lemma at tolerance N^{-1/2}, and the union bound.
Proof
Applicability of the record-frozen closeness-set lemma. Fix N≥1. The data of the N-th solution are an instance of the setting of the record-frozen closeness-set lemma: the natural numbers N≥1, l≥2, l~≥1, m≥1 are those of the common data; (β0,β1) is an affine-controlled transition-rate family on l states with control set A and Lipschitz constant Λ, with A nonempty, convex and compact, and R=supα∈A∣α∣ is its control bound; β is its transition-rate family, β~ the observation-rate family, T the horizon, (Ω,F,P) the driving system, h(N) an A-valued observation-driven control policy with horizon T, control dimension m and l~ channels, and the N-th solution is a solution on [0,T] for these data with regular event Ω0 and observation record W; the family (τj,υj)j≥1 and the realized control α^ are those fixed in the Data, formed from claims 1 and 2 of the realized-control lemma with the same point a0∈A and the same dense sequence fixed in the setting of that lemma as in the control- and flow-closeness lemma (neither enters the conclusions used here, which concern points of Ω0). As comparison data take S∗=S and K∗=1: the components of S are continuous on [0,T] by condition 1 of the definition of a mean-field trajectory pair, and ∣St∣≤1 because St lies in the probability simplex, whose points have coordinates in [0,1] summing to 1, so that (Stγ)2≤Stγ for each γ and ∣St∣2=∑γ(Stγ)2≤∑γStγ=1, whence ∣St∣≤1 as ∣St∣≥0; and the map A:[0,T]→A has B[0,T]-measurable components as recorded in the Data. As path data take E={0Rl}, the origin of Rl (a nonempty finite subset of Rl); the path data enter only claims 3 and 4 of that lemma, which are not used here. Hence claims 1 and 2 of the record-frozen closeness-set lemma hold for the N-th solution, with the control discrepancy d of the Data.
Applicability of the envelope lemma. The setting of the pre-stopping envelope lemma consists of the setting of the extended good-set stopping-time lemma, the setting of the pathwise tracking lemma for the same data, policy, solution and realized control (only claims 1 and 2 of which are used there, its hypothesis (LipC) not being assumed and its population cost data being arbitrary), a mean-field trajectory pair (S,A) whose control is the map A of the extended good-set setting and whose initial state is S0=x0, the stipulation S∗=S, and a barrier εY>0. All of this is available for the N-th solution: the extended good-set setting determined by the present data (the same α^, x0, Φ, Y, A, E and S∗=S as in the control- and flow-closeness lemma, none of which involves the four thresholds) is instantiated here with εY=cE=δ=θout=1; the objects and conclusions of the envelope lemma used below (its claims 2, 4 and 6) involve the thresholds only through the shift b=εY+Q, which is undone below, the parts of its claim 2 that retain εY (the bounds on the second and fourth moments of b) not being used; the setting of the tracking lemma is part of the standing hypotheses of the lower bound theorem, which even assumes its hypothesis (LipC); (S,A) is a mean-field trajectory pair for β with horizon T by the definition of a stationary mean-field triple, its control is the map A of the setting, and S0=x0 by assumption; and we take εY=1. The number κ0=1+E[∣s0∣4] of the envelope lemma is the number so named in the lower bound theorem, the state fluctuation st=N(Σt−St) being formed from the same trajectory pair. By the definitions in the envelope lemma, Q=b−εY=M+ΛbeΛbTI+eΛbTN−1/2∣s0∣, which does not involve εY, and cQ is the constant displayed in the statement.
Proof of claim 1. Fix N≥1. By claim 2 of the envelope lemma, b is a random variable, hence so is Q=b−1 (claims 1 and 2 of the arithmetic lemma for measurable functions, the constant function −1 being measurable), and E[Q4]≤cQκ0N−2. Hypothesis (I′) gives κ0≤κ♯, hence E[Q4]≤cQκ♯N−2, because N−2>0 and cQ≥0, being a sum of products of the nonnegative numbers cM, κT, Λb4, T4 and values of the exponential function. For real θ>0, claim 4 of the envelope lemma gives P(b≥εY+θ)≤cQκ0θ−4N−2≤cQκ♯θ−4N−2, and {b≥εY+θ}={Q≥θ} since Q=b−εY. Finally, claim 6 of the envelope lemma states that ∣st(ω)∣≤N(Yt(ω)+Q(ω)) for every ω∈Ω0 and t∈[0,T], where Yt(ω)=∣Φt(ω)−St∗∣=∣Φt(ω)−St∣ is the deviation of the extended good-set setting with S∗=S. Since ∣st(ω)∣=N∣Σt(ω)−St∣ and N>0, dividing by N gives ∣Σt(ω)−St∣≤∣Φt(ω)−St∣+Q(ω). (The same bound follows from the noise-majorant lemma, whose setting is that of the envelope lemma and which gives ∣Σt(ω)−Φt(ω)∣≤Q(ω) on Ω0, together with the triangle inequality of claim 6 of the elementary properties of the Euclidean norm.)
Proof of claim 2.Existence of N2. By clause 1 of the Archimedean property there is a natural number N′≥Cesc2, and the larger of N′ and N1 is a natural number N2 with N2≥N1 and N2≥Cesc2.
Applicability of claim 4 of the control- and flow-closeness lemma. Fix N≥N2 and put ε♭=N−1/2 and N♭=N. Then 0<ε♭≤1 because N≥1 gives N≥1; N♭=N≥N2≥N1; and ε♭N♭=N/N=N≥Cesc2=∣Cesc∣≥Cesc, because N≥Cesc2 and the nonnegative square root is nondecreasing (if 0≤a≤b then a≤b, since a>b would give a>b), and Cesc2=∣Cesc∣ as ∣Cesc∣ is nonnegative with square Cesc2. Hence claim 4 of that lemma applies to the N-th solution with these ε♭ and N♭ (and N≥N♭), and furnishes the event ΩN♭=ΩN♭(N−1/2), which belongs to GT and hence to F, with P(Ω∖ΩN♭)≤ε♭=N−1/2 and such that, for every ω∈ΩN♭ and every t∈[0,T],
using ε♭N=N and 1/N=N−1/2. Now (N)1/2=N1/4 by the definition of N1/4; the nonnegative square root of a product of nonnegative reals is the product of their square roots (both sides being nonnegative with the same square); and (N−1/2)1/2=N−1/4, since N−1/4=1/N1/4 is nonnegative with square 1/(N1/4)2=1/N=N−1/2. So the right-hand sides are (TCctl)1/2N−1/4=εctl(N) and CflwN−1/4 respectively.
ΩNcl is an event.Ω0∈F by the definition of a solution; ΩN♭∈F as just recalled; and {Q<N−1/4}∈F because Q is a random variable by claim 1. A σ-algebra is closed under finite intersections, so ΩNcl∈F.
The probability bound. A point of Ω outside ΩNcl lies outside Ω0, or outside ΩN♭, or in {Q≥N−1/4}; so Ω∖ΩNcl⊆(Ω∖Ω0)∪(Ω∖ΩN♭)∪{Q≥N−1/4}. Now P(Ω0)=1 by the definition of a solution, so P(Ω∖Ω0)=1−P(Ω0)=0 by claim 3 of the basic properties of a measure; P(Ω∖ΩN♭)≤N−1/2; and, by claim 1 with θ=N−1/4,
using (N−1/4)−4=1/(N−1/4)4=(N1/4)4=N. By the monotonicity and countable subadditivity of the probability (claims 2 and 4 of the basic properties of a measure, the latter applied to the three sets padded by empty sets), P(Ω∖ΩNcl)≤0+N−1/2+cQκ♯N−1.
The three bounds. Let ω∈ΩNcl and t∈[0,T]. Since ω∈Ω0, claim 1 gives ∣Σt(ω)−St∣≤∣Φt(ω)−St∣+Q(ω); since ω∈ΩN♭, ∣Φt(ω)−St∣≤CflwN−1/4; and Q(ω)<N−1/4 by the definition of ΩNcl. Adding, ∣Σt(ω)−St∣≤(Cflw+1)N−1/4=εS(N), the first bound. The second bound, ∫[0,t]∣α^(u,ω)−Au∣du≤εctl(N), was recalled above for every ω∈ΩN♭. For the third, ω∈Ω0, so claim 2 of the record-frozen closeness-set lemma, applicable to the N-th solution as verified at the start of the proof, gives d(W(ω))=∫[0,T]∣α^(u,ω)−Au∣du, which is the second bound at t=T; hence d(W(ω))≤εctl(N). This completes the proof.