Adopt the setting and notation of Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics with its fixed record r∈R: in particular the natural numbers N≥1, l≥2 and m≥1, the control set A⊆Rm, the transition-rate family β with rate bound B, the horizon T>0, the probability space (Ω,F,P) of the N-agent driving system, the record-frozen control path ar, the event Ωr of probability one, the family Σ^r=(Σ^tr)t∈[0,T] of maps with values in the aggregate lattice GN, and the system filtration (Ftsys,r)t∈[0,T]. Write 1S for the indicator of a set S and {Π∈A} for the preimage of a set A under a map Π.
Let T′ be a real number with 0<T′≤T, let x0∈GN, and let a♯:[0,T′]→A be the restriction of ar to [0,T′], au♯=ar(u) for u∈[0,T′], which is a control path with horizon T′. Adopt the setting of Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon with the same N, l, m, A, β and B, with the horizon T′ in place of T, with the control path a♯ and the initial point x0, and with the probability space there called (Ω♯,F♯,P♯): it carries a family P♯=(P♯,c) of Poisson clocks with a horizon R>NBT′ whose generated σ-algebras are independent, the aggregate recursion of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution for the data (P♯(ω),a♯,x0) is run for every ω∈Ω♯, and Σˉ♯=(Σˉt♯)t∈[0,T′], (Ft♯)t∈[0,T′] and Ω0♯ denote the regularised recursion path, the recursion filtration and the conflict-free event of that lemma; as there, assume P♯(Ω0♯)=1 (Ω0♯ is the conflict-free event of the horizon-T′ recursion; when T′=T the copy clocks of The Copy Clocks Are Independent Poisson Clocks with Horizon R, and Every Record Is Almost Surely Conflict-Free for Them qualify, by claims 2, 3 and 4 of that lemma, provided their horizon satisfies the strict inequality R>NBT). Put D0={Σ^0r=x0}, an event of F0sys,r. Then:
1. (Finite-dimensional laws.) For every natural number n, all times 0≤s1<⋯<sn≤T′ and all points x1,…,xn∈GN,
P(D0∩j=1⋂n{Σ^sjr=xj})=P(D0)P♯(j=1⋂n{Σˉsj♯=xj}).
2. (Path laws.) Let Path=Path(GN,T′) be the space of piecewise constant paths in GN with horizon T′, that is, the set of maps p:[0,T′]→GN for which there are a count k, either 0 or a natural number, and times 0<t1<⋯<tk≤T′ such that p is constant on [0,t1), on [tj,tj+1) for each j∈{1,…,k−1}, and on [tk,T′] (constant on [0,T′] when k=0), and let C=CT′ be the σ-algebra generated on Path by the sets {p∈Path:p(u)=y} with u∈[0,T′] and y∈GN, as in that lemma. Define Πr on Ω, with values in the set of maps [0,T′]→GN, by Πr(ω)(u)=Σ^ur(ω) for ω∈Ωr and Πr(ω)(u)=x0 for ω∈/Ωr (u∈[0,T′]), and Π♯ on Ω♯, with values in the same set of maps, by Π♯(ω)(u)=Σˉu♯(ω) for ω∈Ω0♯ and Π♯(ω)(u)=x0 for ω∈/Ω0♯. Then Πr and Π♯ take their values in Path and are measurable with respect to F, respectively F♯, and C; for every A∈C,
P(D0∩{Πr∈A})=P(D0)P♯(Π♯∈A);
and for every function Φ:Path→[0,∞] that is measurable with respect to C,
∫Ω1D0Φ(Πr)dP=P(D0)∫Ω♯Φ(Π♯)dP♯,
both sides being integrals of nonnegative measurable functions with values in [0,∞], the product 1D0Φ(Πr) being formed with the multiplication convention 0⋅∞=0 of Image Measures, Measures with Densities, and Change of Variables.