Throughout, E={1,…,l}N, Σ:E→GN and X=(Xt)t∈[0,T] are as in Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics, so that Σ^tr=Σ(Xt), and B[0,T] denotes the trace Borel σ-algebra on [0,T], with the analogous notation for other compact intervals. We use freely that two events differing only inside an event of probability zero have the same probability (claims 1 and 2 of Basic Properties of a Measure), and that the preimages of sets under a map commute with complements and countable unions, so that the family of sets whose preimage lies in a given σ-algebra is a σ-algebra; consequently a map into a generated σ-algebra is measurable as soon as the preimages of the generators are measurable.
Step 0 (The copy setting is well posed). By claim 1 of Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics, ar is a control path with horizon T: its values lie in A and its components are measurable with respect to B[0,T]. Hence a♯ is a control path with horizon T′: the preimage under a component of a♯ of a Borel set S′ of the real line is the intersection with [0,T′] of the preimage under the corresponding component of ar, a set of the form S∩[0,T] with S Borel, and S∩[0,T]∩[0,T′]=S∩[0,T′]∈B[0,T′]. Thus the setting of Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon with horizon T′, control path a♯, initial point x0, clock horizon R>NBT′ and P♯(Ω0♯)=1 is as required there, and its conclusions are available on [0,T′]; we write qu♯(y,y′) (u∈[0,T′], y=y′ in GN) for the rates q of that lemma and Σtrec,♯(ω) for the recursion path. Moreover Σˉ0♯=x0 on all of Ω♯: in the aggregate recursion of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution, θ0=0<T′ and x(0)=x0∈GN, so the recursion does not stop at index 0, θ1>θ0 by claim 1 of that theorem, and the recursion path satisfies Σ0rec,♯=x(0)=x0; as x0∈GN, the regularised path satisfies Σˉ0♯=x0.
Step 1 (The rates agree and solutions restrict). By Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon, qu♯(y,y′)=Nyσβ(σ,γ,y,au♯) if y′=y+N1vc with c=(σ,γ) and qu♯(y,y′)=0 otherwise, while by Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics the rates qur(y,y′) are given by the same formula with ar(u) in place of au♯; since au♯=ar(u) for u∈[0,T′], we have qu♯=qur for every u∈[0,T′], and both families have the rate bound l(l−1)NB by those lemmas. Consequently, for F:GN→R, the operators LuF of Uniqueness for the Forward Equation of a Bounded Jump-Rate Family on a Finite Set formed with qr and with q♯ coincide for u∈[0,T′]. We claim: if (νu)u∈[s,T] is a solution of the forward equation on [s,T] for the rates qr (horizon T), with s<T′, then (νu)u∈[s,T′] is a solution of the forward equation on [s,T′] for the rates q♯ (horizon T′). Indeed, property (i): the restriction to [s,T′] of a bounded B[s,T]-measurable map is bounded and B[s,T′]-measurable, its preimages being the intersections with [s,T′] of the preimages of the original map, which are of the form S∩[s,T] with S Borel; property (ii): for t∈[s,T′] the identity required on [s,T′] is the identity of property (ii) on [s,T] at the same t, the two integrands u↦νu(LuF) agreeing on [s,t] because the operators agree for u≤T′. Also, if (μu)u∈[s,T′] is a solution on [s,T′] for q♯ and κ≥0 is a real number, then (κμu)u∈[s,T′] is a solution: (i) is preserved under multiplication by a constant (claim 2 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions); for (ii), (κμt)(F)=κμt(F) and (κμu)(LuF)=κμu(LuF) by the definition of the pairing, and ∫[s,t]κμu(LuF)du=κ∫[s,t]μu(LuF)du by claim 2 of Linearity and Monotonicity of the Lebesgue Integral, the integrand being integrable on [s,t] as noted in Uniqueness for the Forward Equation of a Bounded Jump-Rate Family on a Finite Set; so multiplying the identity of (ii) by κ gives (ii) for (κμu).
Step 2 (Events of the two filtrations). For u∈[0,T] and y∈GN, {Σ^ur=y}=⋃x∈E:Σ(x)=y{Xu=x}, a finite union of members of Fusys,r by (D3) of claim 1 of Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics; so {Σ^ur=y}∈Fusys,r⊆F, and in particular D0∈F0sys,r. Likewise, for u∈[0,T′], {Σˉu♯=y}∈Fu♯⊆F♯ by (D3) of claim 1 of Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon (the state space there being GN, not the E of this proof). Since the two families are filtrations, events of Fusys,r belong to Fu′sys,r for u≤u′, and likewise for F♯.
Step 3 (Claim 1, by induction). Fix n, times 0≤s1<⋯<sn≤T′ and points x1,…,xn∈GN; put s0=0 and, for j∈{0,…,n},
Dj=D0∩i=1⋂j{Σ^sir=xi},Dj♯=i=1⋂j{Σˉsi♯=xi}(D0♯=Ω♯).
By Step 2, Dj∈Fsjsys,r and Dj♯∈Fsj♯ (for j=0 because Ω♯∈F0♯, a σ-algebra on Ω♯). We prove by induction on j the statement
(Hj)P(Dj∩{Σ^ur=y})=P(D0)P♯(Dj♯∩{Σˉu♯=y})for all u∈[sj,T′] and y∈GN.
Let j∈{0,…,n} and assume (Hj−1) if j≥1. First suppose sj=T′ (so j≥1, since s0=0<T′); then u=T′=sj, and Dj∩{Σ^sjr=y} equals Dj−1∩{Σ^sjr=xj} if y=xj and is empty otherwise, and likewise Dj♯∩{Σˉsj♯=y} equals Dj−1♯∩{Σˉsj♯=xj} if y=xj and is empty otherwise; so (Hj) follows from (Hj−1) at u=sj∈[sj−1,T′] and y=xj. Now suppose sj<T′. By claim 2 of Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics with s=sj∈[0,T) and D=Dj, the family νu(y)=P(Dj∩{Σ^ur=y}), u∈[sj,T], is a solution of the forward equation on [sj,T] for the rates qr, hence, by Step 1, (νu)u∈[sj,T′] is a solution on [sj,T′] for the rates q♯. By claim 2 of Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon (horizon T′) with its time r equal to sj∈[0,T′) and D=Dj♯, the family μu(y)=P♯(Dj♯∩{Σˉu♯=y}), u∈[sj,T′], is a solution on [sj,T′] for q♯, and so is (P(D0)μu)u∈[sj,T′] by Step 1. The two solutions agree at u=sj. If j=0: ν0(y)=P(D0∩{Σ^0r=y}) equals P(D0) if y=x0 and 0 otherwise, while μ0(y)=P♯(Σˉ0♯=y) equals 1 if y=x0 and 0 otherwise by Step 0. If j≥1: νsj(y)=P(Dj∩{Σ^sjr=y}) equals P(Dj−1∩{Σ^sjr=xj}) if y=xj and 0 otherwise, which by (Hj−1) at u=sj∈[sj−1,T′] equals P(D0)P♯(Dj−1♯∩{Σˉsj♯=xj})=P(D0)P♯(Dj♯) if y=xj and 0 otherwise; and P(D0)μsj(y)=P(D0)P♯(Dj♯∩{Σˉsj♯=y}) equals P(D0)P♯(Dj♯) if y=xj and 0 otherwise. Hence, by Uniqueness for the Forward Equation of a Bounded Jump-Rate Family on a Finite Set applied on the finite set GN with horizon T′, time sj∈[0,T′), rates q♯ and rate bound l(l−1)NB, νu=P(D0)μu for every u∈[sj,T′], which is (Hj). This completes the induction. Claim 1 is (Hn) at u=sn and y=xn: there Dn∩{Σ^snr=xn}=Dn and Dn♯∩{Σˉsn♯=xn}=Dn♯.
Step 4 (The maps Πr and Π♯). Let ω∈Ωr. By (H1) of claim 1 of Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics, there are a count K and times 0<t1<⋯<tK≤T such that t↦Xt(ω) is constant on [0,t1), on each [ti,ti+1) and on [tK,T] (on [0,T] if K=0); the same then holds for t↦Σ^tr(ω)=Σ(Xt(ω)). Let k be the number of indices i with ti≤T′. Then the restriction of Σ^⋅r(ω) to [0,T′] is constant on [0,t1) if k≥1, on [ti,ti+1) for i<k, and on [tk,T′], since [tk,T′]⊆[tk,tk+1) when k<K and [tk,T′]⊆[tK,T] when k=K; if k=0 it is constant on [0,T′]⊆[0,t1) (or on [0,T′]⊆[0,T] when K=0). Hence Πr(ω)∈Path with the times t1,…,tk; for ω∈/Ωr, Πr(ω) is constant, so lies in Path with k=0. For ω∈Ω0♯ the data (P♯(ω),a♯,x0) are conflict-free, so by claim 2 of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution the recursion path t↦Σtrec,♯(ω) is an open-loop aggregate solution on [0,T′]; condition 1 of that definition says precisely that it takes values in GN and belongs to Path, and Σˉ⋅♯(ω)=Σ⋅rec,♯(ω) because the path stays in GN. For ω∈/Ω0♯, Π♯(ω) is constant. Thus both maps take values in Path.
For measurability it suffices, by the remark in the preamble, to consider a generator Z={p∈Path:p(u)=y} with u∈[0,T′] and y∈GN. We have {Πr∈Z}=(Ωr∩{Σ^ur=y})∪((Ω∖Ωr)∩{ω∈Ω:x0=y}), the last set being Ω∖Ωr if y=x0 and empty otherwise; both pieces lie in F by Step 2 and Ωr∈F. Likewise {Π♯∈Z}=(Ω0♯∩{Σˉu♯=y})∪((Ω♯∖Ω0♯)∩{ω∈Ω♯:x0=y})∈F♯, since Ω0♯∈F♯ (claim 4 of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution, as recalled in Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon). Hence Πr and Π♯ are measurable.
Step 5 (Cylinder sets). For k≥1, times 0≤u1<⋯<uk≤T′ and points y1,…,yk∈GN let Z(u1,…,uk;y1,…,yk)={p∈Path:p(ui)=yi for i=1,…,k} (a cylinder set), and let Z be the family of all cylinder sets together with the empty set. Z is a π-system: it is nonempty, and the intersection of two cylinder sets is either empty (when they prescribe different values at a common time) or the cylinder set on the increasing enumeration of the union of their two time sets with the prescribed values (which agree at common times). The generators of C are the cylinder sets with k=1, so C is contained in the σ-algebra generated by Z; conversely every cylinder set is a finite intersection of generators, so Z⊆C and the σ-algebra generated by Z is contained in C (Generated Sigma-Algebra). Hence C is the σ-algebra generated by Z.
For a cylinder set Z=Z(u1,…,uk;y1,…,yk) we have {Πr∈Z}∩Ωr=⋂i=1k{Σ^uir=yi}∩Ωr and {Π♯∈Z}∩Ω0♯=⋂i=1k{Σˉui♯=yi}∩Ω0♯, so that, Ω∖Ωr and Ω♯∖Ω0♯ having probability zero,
P(D0∩{Πr∈Z})=P(D0∩i=1⋂k{Σ^uir=yi})=P(D0)P♯(i=1⋂k{Σˉui♯=yi})=P(D0)P♯(Π♯∈Z),(1)
the middle equality being claim 1 with n=k; (1) holds trivially for Z=∅.
Step 6 (Claim 2). Let P0 be the measure with density 1D0 with respect to P on (Ω,F) (claim 3 of that lemma): for A∈F, P0(A)=∫Ω1A1D0dP=P(A∩D0), the integrand being the nonnegative simple function 1A∩D0. Let Q=(P0)Πr and Q♯=(P♯)Π♯ be the image measures on (Path,C) (claim 1 of that lemma, Πr and Π♯ being measurable by Step 4), so that Q(A)=P(D0∩{Πr∈A}) and Q♯(A)=P♯(Π♯∈A) for A∈C, with Q(Path)=P(D0) and Q♯(Path)=1. Let Q~ be the measure with density ϱ≡P(D0) with respect to Q♯: Q~(A)=∫Path1AϱdQ♯=P(D0)Q♯(A) for A∈C, the integrand being the nonnegative simple function P(D0)1A. Then Q and Q~ are measures on C with Q(Path)=P(D0)=Q~(Path)<∞, and by (1) they agree on the π-system Z, which generates C by Step 5. By claim 1 of Uniqueness of Finite Measures on a Generating Pi-System and the Density of the Exponential Law, Q=Q~, that is, P(D0∩{Πr∈A})=P(D0)P♯(Π♯∈A) for every A∈C, the first identity of claim 2.
Finally let Φ:Path→[0,∞] be C-measurable. The compositions Φ∘Πr and Φ∘Π♯ are measurable in the sense of Lebesgue Integral of a Nonnegative Measurable Function, since {Φ∘Πr>α}={Πr∈{Φ>α}} and {Φ>α}∈C for every real α, and likewise for Π♯. Using successively claim 3 of Image Measures, Measures with Densities, and Change of Variables for P0, claim 2 of that lemma for Q, the identity Q=Q~, claim 3 of that lemma for Q~, claim 1 of Linearity and Monotonicity of the Lebesgue Integral with the constant P(D0)∈[0,∞), and claim 2 of Image Measures, Measures with Densities, and Change of Variables for Q♯,
∫Ω1D0Φ(Πr)dP=∫ΩΦ∘ΠrdP0=∫PathΦdQ=∫PathΦdQ~=∫PathΦϱdQ♯=P(D0)∫PathΦdQ♯=P(D0)∫Ω♯Φ∘Π♯dP♯,
which is the second identity of claim 2.