Reason: Proof of P8.0: telescoping of the tracked energy on the terminal good set, Cauchy-Schwarz and the extended good-set flow bound, choice of the parameter vector via clauses (a),(b) of the lower bound theorem, and Markov's inequality for the good event.
Proof
Preliminaries. Fix a natural number N≥1 and an admissible parameter vector π, and let K, the grid, the levels, the clocks, the good sets, the leave events, the block energy increments, Λ⋆, Z, P and Υlev be the objects formed from π for the N-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 N-th solution for every N≥1. Four facts are used repeatedly.
(P1) By claim 5 of the progressive measurability lemma for the realized control, applied to the map A of the setting, each of whose components is measurable with respect to the trace Borel σ-algebraB[0,T] on [0,T] and the Borel σ-algebra of the real line: for every t∈[0,T] the function Et is Gt-measurable with values in [0,4R2T], and 0≤Et(ω)−Et0(ω)≤4R2(t−t0) for all 0≤t0≤t≤T and every ω∈Ω. In particular every path t↦Et(ω) is nondecreasing, and E0=0 because the integral over [0,0] is 0.
(P2) By claim 1 of the block cascade lemma, K≥1, t0=0, tK=T and tk<tk+1 for every k∈{0,…,K−1}.
(P3) By claim 2 of the block cascade lemma each clock σ(k) takes its values in [tk,T], each Gk is an event, G0⊇G1⊇⋯⊇GK, and the sets D0,…,DK−1,GK are pairwise disjoint with union Ω0; moreover Gk+1=Gk∩{σ(k)≥tk+1} by the definition of the good sets there.
(P4) By (P1), (P2) and (P3), tk≤min(σ(k)(ω),tk+1)≤T for every k and every ω, so ΔkE≥0; each ΔkE is a random variable with values in [0,4R2hk], as recorded in the block cascade lemma. Hence every expectation appearing in the definition of Z is that of a bounded nonnegative random variable, and Z is a finite nonnegative real number.
Proof of claim 1. Let ω∈GK and k∈{0,…,K−1}. By (P3) we have GK⊆Gk+1⊆{σ(k)≥tk+1}, so σ(k)(ω)≥tk+1, hence min(σ(k)(ω),tk+1)=tk+1 and
ΔkE(ω)=Etk+1(ω)−Etk(ω).
Summing over k∈{0,…,K−1}, the right-hand sides telescope, so by (P2) and E0=0,
k=0∑K−1ΔkE(ω)=EtK(ω)−Et0(ω)=ET(ω).
Multiplying by the indicator of GK, and noting that both sides vanish off GK, we get the identity 1GKET=∑k=0K−11GKΔkE of functions on Ω. Since GK⊆Gk by (P3) and ΔkE≥0 by (P4), we have 1GKΔkE≤1GkΔkE at every point of Ω. All the functions involved are bounded random variables, hence have finite expectations, so by the additivity and monotonicity of the expectation
For the second assertion, P(Ω0)=1 by the definition of a solution of the controlled N-agent dynamics, and by (P3) the events D0,…,DK−1,GK are pairwise disjoint with union Ω0; so by the additivity of the probability, 1=P(Ω0)=P+P(GK) and therefore P(Ω∖GK)=1−P(GK)=P. The inequality P≤Λ⋆ZΥlevN−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≥1, ω∈Ω and t∈[0,T], and define f:[0,T]→R by f(s)=∣α^(s,ω)−As∣.
The first bound. If t=0 both sides vanish, since the integral over [0,0] is 0 and ET(ω)≥0. Let t>0 and apply claim 4 of the integral toolkit on the compact interval [0,t] to the restriction of f and to the constant function 1: these are B[0,t]-measurable with ∫[0,t]f2ds<∞ and ∫[0,t]1ds=t<∞, so f is integrable on [0,t] and
(∫[0,t]fds)2≤t∫[0,t]f2ds=tEt(ω)≤TET(ω),
the last step by t≤T and the monotonicity of u↦Eu(ω) from (P1). Taking nonnegative square roots, and using that the nonnegative square root is nondecreasing, gives ∫[0,t]fds≤TET(ω)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∗=S, the thresholds δ, θout, εY and cE of that setting being given the value 1, which is permitted because none of α^, Φ, Y, E, CS and none of the conclusions of that claim involves them. The standing hypothesis on S∗ required by that claim holds here: (S,A,P) is a stationary mean-field triple with S0=x0, so S takes its values in Δl and Stγ=x0γ+∫[0,t]bγ(Ss,As)ds for every t∈[0,T] and every γ∈{1,…,l}. That claim gives Yt(ω)≤CSEt(ω)1/2; since Et(ω)≤ET(ω) by (P1) and the nonnegative square root is nondecreasing, and since Yt(ω)=∣Φt(ω)−St∣, we get ∣Φt(ω)−St∣≤CSET(ω)1/2.
Neither bound refers to the parameter vector: α^, A, E, Φ, S and CS are all defined without it.
Proof of claim 3. Let 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⋆/4 because ϵ is one of the components of the parameter vector, CS is determined by the common data and Λ⋆ by the parameter vector and the common data, and Ctg∨ and c⋆ are among the constants that the lower bound theorem lists as determined by the common data and the same for every N. Hence A is determined by the common data alone, and in particular depends neither on N nor on the individual solutions. It is nonempty, because clause (b) applied with ε′=1 furnishes a member of it. Choose π∙∈A, put Z♯=Z♯(π∙), and let N1 be the natural number that clause (a), applied to π∙, furnishes; then for every N≥N1 the tracked energy of the N-th solution formed from π∙ satisfies Z≤Z♯. Now π∙ has been chosen from a collection determined by the common data; the real number Z♯(π) is defined from π, from the bounds J♯ and κ♯ and from constants of the common data; and clause (a) provides N1 depending on π∙ and the common data but not on the solutions. So π∙, Z♯ and N1 are determined as asserted. Finally, taking N=N1 gives Z♯≥Z≥0 by (P4), so Z♯≥0.
Proof of claim 4. Such a number N♭ exists: by clause 1 of the Archimedean property there is a natural number N′ with N′≥Cesc/ε♭, and the larger of N′ and N1 is then a natural number N♭ with N♭≥N1 and ε♭N♭≥ε♭N′≥Cesc. Fix N≥N♭ and write c=Cctl/(ε♭N), a positive real number because Cctl≥2>0 by claim 3, ε♭>0 and N≥1.
ΩN♭ is an event of GT. By claim 1 of the cascade filtering lemma the good set GK belongs to GtK, and tK=T by (P2). By (P1) the function ET is GT-measurable, so {ET≤c}∈GT. A σ-algebra is closed under intersections and GT⊆F, so ΩN♭∈GT and ΩN♭ is an event.
The probability bound. Since ΩN♭ is the intersection of GK with {ET≤c},
Ω∖ΩN♭=(Ω∖GK)∪(GK∩{ET>c}),
and it suffices to bound the probability of each of the two sets on the right by ε♭/2.
For the first, claim 1 and claim 3 give P(Ω∖GK)≤Λ⋆ΥlevZN−1≤Λ⋆ΥlevZ♯N−1=Cesc/(2N), the middle step because Λ⋆>0 and Υlev>0 and Z≤Z♯ for N≥N1; and ε♭N≥ε♭N♭≥Cesc gives Cesc/(2N)≤ε♭/2.
For the second, put X=1GKET, a nonnegative bounded random variable with E[X]≤Z/N≤Z♯/N by claims 1 and 3. If ω∈GK and ET(ω)>c then X(ω)=ET(ω)>c, so GK∩{ET>c}⊆{X≥c}. Hence, by Markov's inequality applied to X and the positive real c, and by the monotonicity of the probability,