Reason: Proof of P8.1a: counting identity and unit-jump argument identifying the event times, Tonelli on the sigma-finite record measure for the control discrepancy, dyadic reduction for the path deviation, measurable rectangle for the closeness set.
Proof
Elementary facts used repeatedly. Throughout, #F denotes the number of elements of a finite set F, and a nonempty finite set of real numbers has a largest and a least element (by induction on the number of elements), so that maxima and minima over nonempty finite sets, such as KE, are defined. (E1) For points x,y of Rν (ν a natural number), claim 6 of the elementary properties of the Euclidean norm gives ∣x+y∣≤∣x∣+∣y∣; since y−x=(−1)(x−y), claim 5 there gives ∣y−x∣=∣x−y∣; and applying the first inequality to x=(x−y)+y and to y=(y−x)+x yields the reverse form ∣x∣−∣y∣≤∣x−y∣. Consequently the Euclidean norm is sequentially continuous on Rν: if the Euclidean distance from xn to x, which equals ∣xn−x∣ by claim 2 of the same lemma, converges to 0, then ∣xn∣−∣x∣≤∣xn−x∣ and claim 3 of the order properties of limits give ∣xn∣→∣x∣.
Proof of claim 1. Fix ω∈Ω0. By condition 3 of the definition of a solution, the observation total u↦c~u(ω) coincides on [0,T] with the restriction of a counting pathc, so by condition 1 of the definition of a counting path c~u(ω) is 0 or a natural number for every u∈[0,T]. For u∈[0,T] put Ju={j≥1:τj(ω)≤u}. By claim 1 of the realized-control lemma, τj(ω)≤u if and only if c~u(ω)≥j; hence Ju={j≥1:j≤c~u(ω)}, a set with exactly c~u(ω) elements (empty when c~u(ω)=0), so that
c~u(ω)=#{j≥1:τj(ω)≤u}(u∈[0,T]).
Since τj(ω)≤t implies τj(ω)≤T for t∈[0,T], we have Jt⊆JT; and JT={1,…,K} with K=KT(ω)=c~T(ω). In particular c~t(ω)≤K.
The event times of condition 5 are τ1(ω),…,τK(ω). By condition 5 of the definition of a solution and the definition of the observation record, the event times of the solution at ω are the jump times of c lying in [0,T], listed in increasing order, and there are K of them. By claim 1 of the realized-control lemma, for 1≤j≤K the number τj(ω) is the j-th jump time of the observation total, that is, τj(ω)=inf{u≥0:c(u)≥j} in the sense of the definition of a counting path, and τj(ω)∈[0,T] because c~T(ω)≥j. We check that these K numbers are exactly the jump times of c in [0,T], in increasing order. First, τj(ω)>0 for every j≥1, since τj(ω)≤0 would give c~0(ω)≥j≥1, whereas c(0)=0. Next, the τj(ω), 1≤j≤K, are pairwise distinct: if τj(ω)=τj+1(ω)=:u∈(0,T] for some j<K, then by the displayed counting identity c(u)=c~u(ω)≥j+1, while for every s∈[0,u) the set {i≥1:τi(ω)≤s} omits j and j+1 and is contained in {1,…,j−1} (as τi(ω)≤s<u=τj(ω) forces i<j by the ordering τ1(ω)≤τ2(ω)≤⋯ of claim 1 of the realized-control lemma), so c(s)≤j−1, whence c(u−)≤j−1 and c(u)−c(u−)≥2, contradicting condition 4 of the definition of a counting path. Hence τ1(ω)<⋯<τK(ω). Each τj(ω), 1≤j≤K, is a jump time of c: with u=τj(ω) we have c(u)≥j and, by the same argument, c(s)≤j−1 for s<u, so c(u−)≤j−1<c(u). Conversely, let u∈(0,T] be a jump time of c. If u were none of the τj(ω), 1≤j≤K, then, the finitely many τj(ω) (j≤K) that are smaller than u having a largest one, say u′<u (or u′=0 if there is none), we would have {j≥1:τj(ω)≤s}={j≥1:τj(ω)≤u} for every s∈[u′,u) — using Ju⊆JT={1,…,K}, so that only the τj(ω) with j≤K can be at most u, none of which equals u — hence c(s)=c(u) for s∈[u′,u) by the counting identity, so c(u−)≥c(u) and u would not be a jump time. Therefore the jump times of c in [0,T] are exactly τ1(ω)<⋯<τK(ω), and listing them in increasing order returns τj(ω) in the j-th place; the channel of condition 5 attached to the j-th event time is then υj(ω) by claim 1 of the realized-control lemma. This justifies the identification recorded in the Data.
The record-frozen control at the record. Fix t∈[0,T]. Suppose first K≥1. By the definition of the observation record, W(ω)=(K,(τ1(ω),…,τK(ω)),(υ1(ω),…,υK(ω))). By the definition of the record-frozen control path, kW(ω)(t) is the number of indices j∈{1,…,K} with τj(ω)≤t, that is, kW(ω)(t)=#(Jt∩JT)=#Jt=c~t(ω). Writing k=c~t(ω), that definition gives
read as h0(t) when k=0 (the first k event times of the record are τ1(ω),…,τk(ω) because Jt={1,…,k} is an initial segment); and by claim 2 of the realized-control lemma α^(t,ω) is the same expression, since ω∈Ω0 and k=c~t(ω). Suppose next K=0. Then W(ω)=r∅ by the definition of the observation record, the record r∅ has no event times, so kr∅(t)=0 and ar∅(t)=h0(t); on the other hand c~t(ω)≤K=0, so c~t(ω)=0=kW(ω)(t) and α^(t,ω)=h0(t) by claim 2 of the realized-control lemma. In both cases kW(ω)(t)=c~t(ω) and α^(t,ω)=aW(ω)(t). Finally α^(t,ω)=αt(ω) for ω∈Ω0 by claim 2 of the realized-control lemma.
Joint measurability. Let pr:[0,T]×R→[0,T] be the projection (u,r)↦u. For B∈B[0,T] the preimage pr−1(B)=B×R is a measurable rectangle, hence belongs to B[0,T]⊗R by the definition of the product σ-algebra. Consequently, for each component Aj of A and each Borel set C of the real line, the preimage of C under (u,r)↦Auj is (Aj)−1(C)×R∈B[0,T]⊗R, so (u,r)↦Auj is B[0,T]⊗R-measurable. Each component of (u,r)↦ar(u) is B[0,T]⊗R-measurable by claim 1 of the record-frozen control lemma. By claim 2 of the arithmetic lemma, (E1) and the composition lemma, the map F(u,r)=∣ar(u)−Au∣ on [0,T]×R is B[0,T]⊗R-measurable; it is real-valued and nonnegative.
Measurability of d. Recall that a measure is σ-finite when its space is the union of a sequence of measurable sets of finite measure. The measure space ([0,T],B[0,T],λ[0,T]) has total mass T<∞ by claim 1 of the integral toolkit, hence is σ-finite (take the constant sequence [0,T]). The measure space (R,R,ϱ) is, by the definition of the observation record space, the countable disjoint union of the cell measure spaces: the cell C∅ carries the one-point measure space with unit mass, of total mass 1, and for k≥1 and a mark vector v the cell Ck,v carries the transport along a bijection of the restriction of (Rk,Bk,λk) to the ordered time simplex Dk(T), whose total mass is λk(Dk(T))=Tk/k!<∞ by claims 1 and 2 of the assembly lemma and the ordered time simplex lemma. Since every cell has finite mass, claim 4(a) of the assembly lemma shows that R is the union of countably many members of R of finite ϱ-measure, that is (listing them as a sequence, repeating a set if the family is finite), ϱ is σ-finite. Both factors being σ-finite and F being B[0,T]⊗R-measurable with values in [0,∞), Tonelli's theorem shows that the map r↦∫[0,T]F(u,r)du=d(r) is R-measurable as a [0,∞]-valued map, that is, {r:d(r)>a}∈R for every real a; as d is real-valued, this is measurability with respect to R and the Borel σ-algebra of the real line, as noted in the definition of the integral of a nonnegative function.
The record of the solution. Let ω∈Ω0. By claim 1, aW(ω)(u)=α^(u,ω) for every u∈[0,T], so the integrands u↦∣aW(ω)(u)−Au∣ and u↦∣α^(u,ω)−Au∣ coincide at every point of [0,T], and their integrals agree: d(W(ω))=∫[0,T]∣α^(u,ω)−Au∣du.
Proof of claim 3. Fix p∈Path(E,T). For every u∈[0,T], p(u)∈E gives ∣p(u)∣≤KE, so by (E1) 0≤∣p(u)−Su∗∣≤∣p(u)∣+∣Su∗∣≤KE+K∗. The set {∣p(u)−Su∗∣:u∈[0,T]} is therefore nonempty and bounded above by KE+K∗, so its least upper bound s(p) exists by the least upper bound property of the real numbers and satisfies 0≤s(p)≤KE+K∗; the same property furnishes the supremum over the nonempty subset D of [0,T] used below.
Reduction to dyadic times. The set D is a nonempty subset of [0,T] (it contains 0 and T), so supq∈D∣p(q)−Sq∗∣≤s(p). For the reverse inequality let u∈[0,T]; we show ∣p(u)−Su∗∣≤supq∈D∣p(q)−Sq∗∣. If u=T this is clear since T∈D. Let u<T. By claim 2 of the path-space lemma there is a real δ>0 with p(s)=p(u) for all s∈[u,u+δ)∩[0,T]. For every natural number n let in be the least integer i≥0 with iT2−n≥u (such integers exist by clause 1 of the Archimedean property, and a least one exists by the well ordering of the natural numbers, applied to the nonempty set of natural numbers i with iT2−n≥u when u>0, while in=0 when u=0), and put qn=inT2−n. Then qn≥u; if in≥1 the minimality of in gives (in−1)T2−n<u, so qn<u+T2−n, and if in=0 then u≤0, so u=0=qn; in both cases u≤qn<u+T2−n. Moreover qn≤T: if in≥1 then (in−1)T2−n<u<T gives in−1<2n, so in≤2n; and in=0 is trivial. Hence qn∈D∩[u,u+T2−n) for every n. Now 2n≥n+1 for every natural number n (by induction: 21=2, and 2n+1=2⋅2n≥2n+2≥n+2), so 0≤qn−u<T2−n≤T/(n+1)<T/n. The sequence (T/n)n≥1 converges to 0: given ε>0, clause 3 of the Archimedean property gives a natural number n1 with 1/n1<ε/T, and then 0<T/n≤T/n1<ε for all n≥n1. Hence (qn)n≥1 converges to u by claim 3 of the order properties of limits. In particular there is a natural number n0 with T2−n<δ for all n≥n0 (take n0=n1 for ε=δ), and for such n we have qn∈[u,u+δ)∩[0,T], hence p(qn)=p(u).
Convergence of Sqn∗. We show that ∣Sqn∗−Su∗∣→0. Let ε>0. For each γ∈{1,…,l} the component S∗,γ is continuous at u relative to [0,T], so there is δγ>0 with ∣Ss∗,γ−Su∗,γ∣<ε/(2l) for all s∈[0,T] with ∣s−u∣<δγ. Let δ′ be the least of δ1,…,δl; since qn→u there is n2 with ∣qn−u∣<δ′ for all n≥n2, and for such n every coordinate of Sqn∗−Su∗ has absolute value at most ε/(2l), so ∣Sqn∗−Su∗∣≤l⋅ε/(2l)=ε/2<ε by the coordinate bound for the Euclidean norm. This being true for every ε>0, the limit of ∣Sqn∗−Su∗∣ is 0.
Conclusion of the reduction. For n≥n0, by p(qn)=p(u) and the reverse form in (E1),
Applying claim 3 of the order properties of limits to the sequences indexed by n≥n0 (a shift of the index does not affect convergence, the definition of the limit involving only tails), ∣p(u)−Su∗∣ is the limit of the sequence ∣p(qn)−Sqn∗∣, n≥n0, each term of which is at most M=supq∈D∣p(q)−Sq∗∣ because qn∈D; by claim 1 of the order properties of limits (comparison with the constant sequence M, which converges to M), ∣p(u)−Su∗∣≤M. This holds for every u∈[0,T], hence s(p)≤supq∈D∣p(q)−Sq∗∣, and the two suprema agree.
Measurability of s. For each natural number n put Dn={iT2−n:i∈{0,1,…,2n}}, a finite set, and define gn:Path(E,T)→R by gn(p)=maxq∈Dn∣p(q)−Sq∗∣. For fixed q∈[0,T] the map p↦∣p(q)−Sq∗∣ is CT-measurable by claim 1 of the path-space lemma, applied to the function ϕ:E→R, ϕ(y)=∣y−Sq∗∣. The maximum of finitely many measurable real-valued maps is measurable by repeated application of claim 4 of the arithmetic lemma, so each gn is CT-measurable, and ∣gn(p)∣≤KE+K∗ for every p by the bound above. Since iT2−n=(2i)T2−(n+1) with 2i≤2n+1, we have Dn⊆Dn+1, and D=⋃n≥1Dn (the points iT2−n of D with n=0, namely 0 and T, also lie in D1). Hence, for every p, supn≥1gn(p)=supq∈D∣p(q)−Sq∗∣: each gn(p) is a maximum over a subset of D, so it is at most the right-hand side, and every q∈D lies in some Dn, so ∣p(q)−Sq∗∣≤gn(p)≤supngn(p). By the reduction to dyadic times, supn≥1gn(p)=s(p). Claim 1 of the toolkit for countable suprema applied to the uniformly bounded measurable maps gn (n≥1) now shows that s is CT-measurable.
Proof of claim 4. The set (−∞,ε] is closed in the real line, its complement (ε,∞) being open, so it belongs to the Borel σ-algebra, which contains the open sets and is closed under complements. Hence {p:s(p)≤ε}=s−1((−∞,ε])∈CT by claim 3, and likewise {r:d(r)≤ε′}=d−1((−∞,ε′])∈R by claim 2. The closeness set E(ε,ε′) is the Cartesian product of these two sets, a measurable rectangle, and therefore belongs to CT⊗R by the definition of the product σ-algebra. This completes the proof.