Preliminaries. For each j, the space (Ω,F,P) with initial states ςj and the common clocks satisfies conditions 1--3 of N-Agent Driving System by hypothesis, and condition 4 as well: the required product identities involve one event from σ(ςj1,…,ςjN) and one from each of finitely many clock σ-algebras, and since σ(ςj1,…,ςjN)⊆S0 each such identity is an instance of the hypothesis that S0 together with the clock σ-algebras forms an independent family. Hence clause (vi) of Existence, Uniqueness, and Regularity for the Controlled N-Agent Dynamics applies to the given solution for hj on this driving system, at time r with the caps (ca): writing Hj for the σ-algebra generated by ςj1,…,ςjN together with the capped clock variables, there is C^j∈Hj with P(Cj△C^j)=0, and for every F∈Frsys,j there is H∈Hj with P((F∩Cj)△(H∩Cj))=0. Note Hj⊆H: every generator of Hj is either a capped clock variable or a ςji, which is S0-measurable.
Claim 1. First, C=⋂jCj agrees mod null with C^:=⋂jC^j∈H, since C△C^⊆⋃j(Cj△C^j). Let A={F∈F:∃H∈H with P((F∩C)△(H∩C))=0}. Then Ω∈A (take H=Ω). If F∈A with witness H, then Fc∈A with witness Hc: within C, membership of F△H and of Fc△Hc coincide, so (Fc∩C)△(Hc∩C)=(F∩C)△(H∩C). If Fn∈A with witnesses Hn, then ⋃nFn∈A with witness ⋃nHn, since (⋃nFn∩C)△(⋃nHn∩C)⊆⋃n((Fn∩C)△(Hn∩C)). So A is a σ-algebra. For F∈Frsys,j with clause-(vi) witness H∈Hj⊆H: (F∩C)△(H∩C)=((F∩Cj)△(H∩Cj))∩C, which is null. Hence Frsys,j⊆A for every j, and therefore Frsys,1∨⋯∨Frsys,J⊆A.
Claim 2. For an indicator Z=1F with F in the join, claim 1 provides H with 1F1C=1H1C almost surely; take Z^=1H. For a nonnegative simple Z=∑k≤Kzk1Fk take Z^=∑k≤Kzk1Hk, the finitely many null events uniting. For general Z:Ω→[0,∞] measurable with respect to the join, let Zn=2−n⌊2n(Z∧2n)⌋, a nondecreasing sequence of nonnegative simple functions, measurable with respect to the join, with Zn→Z pointwise; let Z^n be witnesses from the simple case and set Z^=limsupnZ^n, an H-measurable [0,∞]-valued map (countable suprema and infima of measurable maps are measurable). Off the union of the countably many null events, on C one has Z^n=Zn for every n, hence Z^=limnZn=Z there; that is, Z1C=Z^1C almost surely.
Claim 3. Fix a clock label a and write J=σ(Yca+sa−Ycaa:s≥0).
Step 1. Ya has independent increments (clause 2 of its definition as a homogeneous Poisson process) and Y0a=0 everywhere (property 1 of Counting Path and Its Jump Times). By part (b) of Grouping Independence and the Fresh-Start Sigma-Algebra of an Independent-Increment Process, J is independent of the natural-filtration σ-algebra FcaYa=σ(Yua:0≤u≤ca).
Step 2. Consider the σ-algebra Ha+=σ(S0∪⋃b=aσ(Yub:u≥0)∪FcaYa) of the statement, the union over the clock labels b=a. Fix J0∈J and define the finite measures ν1(F)=P(J0∩F) and ν2(F)=P(J0)P(F) on Ha+. Let P be the collection of sets S∩Eb1∩⋯∩Ebk∩E with k≥0, S∈S0, distinct clock labels b1,…,bk all =a, Ebi∈σ(Yubi:u≥0), and E∈FcaYa. Then P is a π-system (intersect componentwise, intersecting events of coincident labels within their σ-algebra), contains Ω, and generates Ha+. For a member of P: J0∩E∈σ(Yua:u≥0), so the hypothesis independence of the family consisting of S0 and the clock σ-algebras gives
P(S∩Eb1∩⋯∩Ebk∩E∩J0)=P(S)P(Eb1)⋯P(Ebk)P(E∩J0)=P(S)P(Eb1)⋯P(Ebk)P(E)P(J0),
the last step by Step 1; and the same family independence gives P(S∩Eb1∩⋯∩Ebk∩E)=P(S)P(Eb1)⋯P(Ebk)P(E). Hence ν1=ν2 on P, with equal total masses ν1(Ω)=P(J0)=ν2(Ω). By claim 1 of Uniqueness of Finite Measures on a Generating Pi-System and the Density of the Exponential Law, ν1=ν2 on σ(P)=Ha+. Since J0∈J was arbitrary, J is independent of Ha+. The final clause of the statement follows by restriction: H⊆Ha+ (every generator of H is S0-measurable, a capped variable of a clock b=a, hence σ(Yub:u≥0)-measurable, or a capped variable of a, hence FcaYa-measurable), and increments of a clock b=a beyond arbitrary levels are σ(Yub:u≥0)-measurable, so every σ-algebra named there is a sub-σ-algebra of Ha+, and independence restricts to sub-σ-algebras.