Reason: Proof of the progressive-measurability lemma for the realized control: null-event transfer into the observation filtration, event times and channels via sampled channel subtotals at stopping times, the sigma-algebra argument for the policy composition, truncated controls as observation-measurable random elements, and the control energy process.
Proof
Throughout, a real-valued map on a measurable space(Ξ,H) is called H-measurable when it is measurable with respect to H and the Borel σ-algebraB(R) of the real line. We use two devices, formulated for a generic measurable space (Ξ,H); these two letters are placeholders and are re-instantiated at each use. (D1) If f1,…,fd:Ξ→R are H-measurable and g:Rd→R is sequentially continuous, then g(f1,…,fd) is H-measurable, by Sequentially Continuous Functions of Measurable Euclidean Maps are Measurable; since sums, differences, products, absolute values, squares, maxima and minima are sequentially continuous, they preserve H-measurability, the indicator of a set of H is H-measurable (its preimages are ∅, the set, its complement, or Ξ), and {f1≤f2}={f2−f1≥0}∈H for H-measurable f1,f2. (D2) If (En)n is a countable family in H covering Ξ and f:Ξ→R satisfies En∩f−1(Γ)∈H for every n and every Γ∈B(R), then f is H-measurable, since f−1(Γ)=⋃n(En∩f−1(Γ)). Write λ for Lebesgue measure on the real line and λ[0,t] for its restriction to [0,t] as in Restricted Lebesgue Measure and Integral Toolkit on a Compact Interval, so that ∫[0,t]⋅ds=∫[0,t]⋅dλ[0,t] for t>0. Finally, a function θ:Ξ→R with {θ≤q}∈H for every real q is H-measurable, by the criterion of claim 3 of Rational Intervals and Rays Generate the Borel Sigma-Algebra of the Real Line applied to the complements {θ>q}.
The first set lies in Gt, as X′−1(Γ)∈Gt and Z∈Gt. The second is an event of F, being an intersection of two events, and is contained in Z, so it has probability zero by monotonicity of P (claim 2 of Basic Properties of a Measure); hence it lies in Gt as well. Thus X−1(Γ)∈Gt, and X is Gt-measurable.
The function θj=min(τj,T) takes values in [0,T] since τj takes values in [0,T]∪{T+1}. For t∈[0,T) one has {θj≤t}={τj≤t}∈Gt, and {θj≤T}=Ω∈GT; so θj is a stopping time of (Gt)t∈[0,T].
For the channels, fix t∈[0,T], j≥1 and υ. Write c~sυ=∑i=1NN~si,υ for the channel subtotal, a random variable by (D1), and put Ψsυ=1Ω0c~sυ for s∈[0,T]. Since c~sυ=NΥsυ at every point of Ω0 by condition 4, Ψsυ=1Ω0NΥsυ everywhere, which is Gs-measurable by (D1), as Ω0∈Gs by claim 1 and Υsυ is a generator of Gs. Every path of Ψυ is right-continuous in the sense of Progressive Measurability: Sections, Right-Continuous Adapted Processes, Arithmetic, and Indefinite Time Integrals: off Ω0 it vanishes identically, and at ω∈Ω0 it is the sum over i of the paths s↦N~si,υ(ω), each of which coincides on [0,T] with the restriction of a counting path by condition 3. A counting path c is nondecreasing with integer values (clauses 1 and 2 of its definition), and by clause 3 the value c(s) is the greatest lower bound of the set of integers {c(s′):s′>s}, which is therefore attained at some s0>s (a nonempty set of integers bounded below has a least element), so that c is constant on [s,s0] by monotonicity; a finite sum of such paths is thus constant to the right of every s<T on the intersection of the corresponding intervals, and every sequence in [s,T] converging to s eventually lies in that intersection; for s=T every sequence in [T,T] is constant, so the condition holds trivially. Hence Ψυ is adapted to (Gt)t∈[0,T] with every path right-continuous, and is progressively measurable by claim 2 of the toolkit. Put θ0=0 and θi=min(τi,T) for i≥1; these are stopping times by the preceding paragraph and claim 1 of Stopping Times on a Compact Time Interval: Elementary Operations, the Prior Sigma-Algebra, Dyadic Approximation, Sampling, and Hitting Times, so min(t,θi) is a stopping time bounded by t (claim 1 of that toolkit), and the sampled variable Ψmin(t,θi)υ is measurable with respect to Gmin(t,θi)⊆Gt by claims 4(ii) and 2 there. Consequently, by (D1),
We claim that {τj≤t}∩{υj=υ}∩Ω0=H. Let ω∈Ω0 with τj(ω)≤t. By claim 1 of The Realized Control of the Controlled N-Agent Dynamics as a Random Element of the Control Set, c~t(ω)≥j, hence j≤c~T(ω) by monotonicity, and τ1(ω)<⋯<τc~T(ω)(ω) are the jump times in [0,T] of the counting path c with which c~(ω) agrees on [0,T] (condition 3), listed in condition 5 as strictly increasing; also τ1(ω)>0, since by condition 5 these numbers are jump times of c in the sense of the counting-path definition, and jump times are positive. With τ0=0 we thus have 0≤τj−1(ω)<τj(ω)≤t, so min(t,θi(ω))=τi(ω) and Ψτiυ(ω)=c~τiυ(ω) for i∈{j−1,j}. Next, c~τj(ω)≥j by the equivalence of claim 1, while c~τj(ω)<j+1: if j+1≤c~T(ω) this is the same equivalence together with τj+1(ω)>τj(ω), and otherwise c~τj(ω)≤c~T(ω)=j. As c~ is integer-valued, c~τj(ω)=j; likewise c~τj−1(ω)=j−1, which for j=1 reads c~0(ω)=0, clause 1 of the counting-path definition. Summing over channels, ∑υ′=1l~(c~τjυ′(ω)−c~τj−1υ′(ω))=1, each summand being a nonnegative integer because every counter is nondecreasing and integer-valued; so exactly one channel υ∗ has increment 1 and every other channel has increment 0. Finally υ∗=υj(ω): by claim 1 of the realized-control lemma, υj(ω) is the channel of condition 5, so some counter N~i,υj(ω) has τj(ω) as a jump time, meaning that its value at τj(ω) exceeds the least upper bound of its values on [0,τj(ω)), in particular its value at τj−1(ω); adding the inequalities N~τji′,υj(ω)(ω)≥N~τj−1i′,υj(ω)(ω) for the remaining agents i′ (claim 3 of Elementary Order Arithmetic in an Ordered Field) gives c~τjυj(ω)(ω)>c~τj−1υj(ω)(ω), so the increment of channel υj(ω) is positive, hence equal to 1, and υ∗=υj(ω). Thus, at such ω, υj(ω)=υ holds exactly when ω∈H′, which proves the claimed identity. Hence {τj≤t}∩{υj=υ}∩Ω0=H, and
{τj≤t}∩{υj=υ}=H∪({τj≤t}∩{υj=υ}∩(Ω∖Ω0)),
where the second set is an event of F (τj and υj being random variables) of probability zero, hence a member of Gt by claim 1. So the union lies in Gt.
Claim 3. Fix t∈[0,T] and κ∈{1,…,m}, put Ξ=[0,t]×Ω and H=B[0,t]⊗Gt. For j≥1 define τjt:Ω→[0,T+1] by τjt(ω)=τj(ω) if τj(ω)≤t and τjt(ω)=T+1 otherwise. For real q the set {τjt≤q} is ∅ if q<0, is {τj≤min(q,t)} if 0≤q<T+1, and is Ω if q≥T+1; by claim 2 and the inclusion Gmin(q,t)⊆Gt (the family being a filtration) all of these lie in Gt, so τjt is Gt-measurable by the sublevel criterion. Moreover, for (s,ω)∈Ξ one has τj(ω)≤s if and only if τjt(ω)≤s, because s≤t<T+1.
The maps (s,ω)↦s and (s,ω)↦τjt(ω) on Ξ are H-measurable: preimages of Borel sets are (Γ∩[0,t])×Ω and [0,t]×(τjt)−1(Γ), which lie in H by Product Sigma-Algebra (for t=0 the first is ∅ or {0}×Ω). Hence by (D1) and the equivalence just noted, the set {(s,ω)∈Ξ:τj(ω)≤s}={(s,ω)∈Ξ:τjt(ω)≤s} lies in H. Every c~s is integer-valued: at ω∈Ω0 by condition 3 and clause 1 of the counting-path definition, and off Ω0 because every observation counter vanishes there (clause (vii)(c) of Existence, Uniqueness, and Regularity for the Controlled N-Agent Dynamics), so that c~s(ω)=0; hence {c~s=k}={c~s≥k}∖{c~s≥k+1}, and therefore the following sets lie in H:
using claims 1 and 2. For (s,ω)∈Λk with ω∈Ω0 and k≥1 one has τi(ω)≤τk(ω)≤s≤t for i≤k (the τi being nondecreasing in i), so Ek,v is exactly the set of (s,ω)∈Λk with ω∈Ω0 and υi(ω)=vi for i≤k. Since at every ω∈Ω0 and s∈[0,t] the count c~s(ω) equals exactly one k and the channels υ1(ω),…,υk(ω) form some tuple v, the countable family consisting of E∗ and the sets Ek,v covers Ξ. On E∗ the map α^κ is the constant a0κ by the definition of α^ in claim 2 of The Realized Control of the Controlled N-Agent Dynamics as a Random Element of the Control Set, so its preimages meet E∗ in ∅ or E∗.
Fix k≥0 and v, let Πk=[0,T]×Rk(T)⊆R1+k (so Π0=[0,T]), and let Qk be the σ-algebra on Πkgenerated by the sets U∩Πk with U an open subset of R1+k; by Observation-Driven Control Policy the component hkκ(⋅,⋅,v) is measurable with respect to Qk and B(R). Let Zk(s,ω)=(s,τ1t(ω),…,τkt(ω)) on Ξ. Its components are H-measurable, so Zk is measurable with respect to H and the σ-algebra B1+k of The Borel Sigma-Algebra of a Euclidean Space as a Product, and Measurability of Projections, Sequentially Continuous Maps, and Open and Closed Sets by claim 2 there, and B1+k contains every open subset of R1+k by claim 4 there. For (s,ω)∈Ek,v we have τit(ω)=τi(ω) for i≤k, and, by the well-definedness assertion of claim 2 of The Realized Control of the Controlled N-Agent Dynamics as a Random Element of the Control Set applied at (s,ω) with k=c~s(ω), Zk(s,ω)∈Πk and α^κ(s,ω)=hkκ(Zk(s,ω),v) (read as h0κ(s) when k=0). Let V be the family of subsets V⊆Πk with Ek,v∩Zk−1(V)∈H. Because Zk maps Ek,v into Πk, preimages of complements and countable unions taken within Πk meet Ek,v in complements within Ek,v and in countable unions, so V is a σ-algebra on Πk; it contains every U∩Πk with U open, since Ek,v∩Zk−1(U∩Πk)=Ek,v∩Zk−1(U)∈H. Hence Qk⊆V. For Γ∈B(R) the set V={p∈Πk:hkκ(p,v)∈Γ} lies in Qk, and Ek,v∩(α^κ)−1(Γ)=Ek,v∩Zk−1(V)∈H. By (D2), the restriction of α^κ to Ξ is H-measurable. As t was arbitrary, α^κ is progressively measurable with respect to (Gt)t∈[0,T].