Throughout, c=(σ,γ) denotes a generic transition label (there are l(l−1) of them), and Q the rational numbers, a countable set which is dense in the real line (claim 1 there: every nonempty open interval contains a rational). For x∈GN and c=(σ,γ) put ϕxc(s)=Nxσβ(σ,γ,x,as) for s∈[0,T]. We use the restricted Lebesgue measure λ[0,T] on [0,T] and, for t∈[0,T] and a bounded measurable f:[0,T]→R, we write ∫[0,t]fds for the Lebesgue integral of the restriction of f to [0,t]; by claim 2 of the toolkit this equals the integral over [0,T] of 1[0,t]f, since both coincide with the integral over R of the common zero extension.
Step 0 (Preliminaries).
(P1) Counting paths. Let q be a counting path and j≥1 a natural number. For u≥0 one has τj(q)≤u if and only if q(u)≥j: if q(u)≥j then u belongs to the set defining τj(q); conversely, if τj(q)≤u then for every s>u there is t with τj(q)≤t<s and q(t)≥j (by the definition of the greatest lower bound), whence q(s)≥j by monotonicity, and right-continuity gives q(u)≥j. Consequently q(u)≤j−1 for u<τj(q), and if τj(q)<∞ then q(τj(q))=j: indeed q(τj(q))≥j, while q(τj(q)−)≤j−1 and the unit-jump condition give q(τj(q))≤j. Moreover, if u≥0 and j=q(u)+1, then τj(q)>u, since q(u)<j. Finally, τj(q) is a jump time of q when finite: τj(q)>0, since τj(q)≤0 would give q(0)≥j≥1, contradicting q(0)=0; and q(τj(q))=j>j−1≥q(τj(q)−).
(P2) Integrands. For x∈GN and c=(σ,γ) the map α↦β(σ,γ,x,α) is sequentially continuous on A (condition 2 of Transition-Rate Family with the constant sequence Σn=x), and the components of a are measurable, so s↦β(σ,γ,x,as) is measurable by Sequentially Continuous Functions of Measurable Euclidean Maps are Measurable; multiplying by the constant Nxσ (claim 2 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions) shows that ϕxc is measurable, and 0≤ϕxc≤NB because 0≤xσ≤1 and 0≤β≤B. Products of ϕxc with indicators of measurable subsets of [0,T] are measurable by claims 1 and 3 of the same lemma.
(P3) Indefinite integrals. Let f:[0,T]→[0,NB] be measurable and put F(t)=∫[0,t]fds. For 0≤s≤t≤T, F(t)−F(s)=∫[0,T]1(s,t]fds by linearity, and 0≤1(s,t]f≤NB1(s,t] gives, by monotonicity and the value λ[0,T]((s,t])=t−s of the restricted measure on an interval (claim 1 of the toolkit and claim 4 of Existence of Lebesgue Measure on the Real Line, the integral of an indicator being the measure of its set by Simple Function and Its Integral), that 0≤F(t)−F(s)≤NB(t−s). Hence F is nondecreasing, and continuous on [0,T]. Moreover, if g:[0,T]→[0,NB] is measurable, t∈[0,T], and {f=g}∩[0,t] is contained in a set Z with λ[0,T](Z)=0, then ∫[0,u]f=∫[0,u]g for every u∈[0,t]: the functions 1[0,u]f and 1[0,u]g agree off Z, so claim 6 of the toolkit (applied on the co-null set [0,T]∖Z) gives equal integrals over [0,T]. In particular this holds when {f=g}∩[0,t] is finite, a finite set being a Borel set of measure 0 by claim 4 of Existence of Lebesgue Measure on the Real Line (a single point is the interval [s,s]) and finite additivity of the measure.
Step 1 (Claim 1). Suppose the recursion has produced θk∈[0,T), x(k)∈GN and levels κkc≥0. The integrand defining Ctc,(k) is 1(θk,T]ϕx(k)c, measurable with values in [0,NB] by (P2), so by (P3) the map t↦Ctc,(k) is nondecreasing, satisfies ∣Ctc,(k)−Csc,(k)∣≤NB(t−s), and is continuous; and Cθkc,(k)=κkc because the integrand vanishes on [0,θk] (applied at step k+1, this is the identity Cθk+1c,(k+1)=κk+1c of claim 1). By (P1), λkc>κkc. For each label c let hkc be the greatest lower bound of Hkc={t∈[θk,T]:Ctc,(k)≥λkc} (equal to +∞ if Hkc=∅), so that θk+1=min(T,minchkc). Since Cc,(k) is nondecreasing and continuous, Hkc is an interval of the form [hkc,T] when nonempty: if t∈Hkc and t≤t′≤T then t′∈Hkc; and if Hkc=∅, choosing tn∈Hkc with tn→hkc gives Chkcc,(k)=limCtnc,(k)≥λkc. Thus, for u∈[θk,T],
hkc≤u⟺Cuc,(k)≥λkc.(1.1)
Since Cθkc,(k)=κkc<λkc and there are finitely many labels, continuity yields ϵ>0 with Ctc,(k)<λkc for all c and all t∈[θk,min(T,θk+ϵ)], so hkc≥min(T,θk+ϵ) for every c by (1.1), and θk+1≥min(T,θk+ϵ)>θk. If θk+1<T, then θk+1=hkc for some label c, and (1.1) with u=hkc gives c∈Jk. For any c∈Jk one has hkc≤θk+1 by (1.1), while θk+1≤hkc by definition, so hkc=θk+1>θk; choosing tn∈[θk,hkc) with tn→hkc gives Ctnc,(k)<λkc, hence Cθk+1c,(k)≤λkc by continuity, and together with c∈Jk this gives Cθk+1c,(k)=λkc. The bound κk+1c≤NBθk+1 follows by induction from κ0c=0 and κk+1c−κkc=Cθk+1c,(k)−Cθkc,(k)≤NB(θk+1−θk).
Counting identity. We claim that for every step k at which the recursion has not stopped and every label c,
pc(κk+1c)=pc(κkc)+1{c∈Jk}.(1.2)
Indeed, write j=pc(κkc)+1, so λkc=τj(pc). If c∈Jk then κk+1c=λkc is finite and pc(κk+1c)=j by (P1). If c∈/Jk then κk+1c=Cθk+1c,(k)<λkc, so pc(κk+1c)≤j−1 by (P1), while pc(κk+1c)≥pc(κkc)=j−1 by monotonicity and κk+1c≥κkc. Summing (1.2) over the steps, Sk=∑cpc(κkc) satisfies Sk+1≥Sk+1 whenever Jk=∅, in particular whenever θk+1<T. Since κkc≤NBθk≤NBT, monotonicity gives Sk≤M:=∑cpc(NBT). If the recursion has not stopped at step k, then θ1,…,θk<T, so Sk≥S0+k=k, whence k≤M. Therefore the recursion stops at some K≤M+1.
Step 2 (Claim 2). Uniqueness and necessity of conflict-freeness. Let Σ be an open-loop aggregate solution for (p,a,x0), with consumed clock times Cc and counters Nc. We show by induction on k that, as long as θk is defined (the recursion not having stopped before step k): (i) if θk<T then Σt=x(k) for t∈[θk,θk+1) and Ctc=Ctc,(k) for t∈[θk,θk+1] and all c, while if θk=T then ΣT=x(k); and (ii) x(k+1)∈GN whenever θk+1 is defined. The starting point is C0c=0=κ0c and Σ0=x0=x(0), the latter from the state identity and N0c=pc(0)=0.
Assume the recursion has reached step k with θk<T and x(k)∈GN, and that Cθkc=κkc for all c and Σθk=x(k) (for k=0 this was just checked; for k≥1 it is part of the inductive conclusion below). Let t∗ be the least upper bound of the set of t∈[θk,T] such that Σs=x(k) for all s∈[θk,t]; this set contains θk, and by condition 1 of the definition (piecewise constancy on left-closed, right-open pieces [ti,ti+1) and on [tn,T], so that each piece contains a right neighbourhood, relative to [0,T], of each of its points) it contains [θk,θk+ϵ] for some ϵ>0 with θk+ϵ≤T, so t∗>θk and Σs=x(k) for s∈[θk,t∗). For t∈[θk,t∗) the integrand s↦NΣsσβ(σ,γ,Σs,as) defining Cc in the definition (measurable with values in [0,NB], as noted there) agrees on (θk,t] with ϕx(k)c, so, splitting the integral over [0,t] as in (P3),
Ctc=Cθkc+∫[0,T]1(θk,t]ϕx(k)cds=κkc+∫[0,t]1(θk,T]ϕx(k)cds=Ctc,(k),
and by continuity of both sides in t ((P3) applied to the integrand of the definition, and Step 1) the identity Ctc=Ctc,(k) extends to t=t∗. Hence Ntc=pc(Ctc,(k)) for t∈[θk,t∗]. Suppose, for contradiction, that t∗<θk+1. For t∈[θk,t∗] and every c we have t<θk+1≤hkc, so Ctc,(k)<λkc by (1.1), and (P1) with monotonicity gives pc(Ctc,(k))=pc(κkc), i.e. Ntc=Nθkc; the state identity then gives Σt=Σθk=x(k) for all t∈[θk,t∗], in particular at t∗<T, and condition 1 of the definition (the piece containing t∗ contains a right neighbourhood of it) yields ϵ>0 with Σ=x(k) on [t∗,t∗+ϵ], contradicting the definition of t∗. Hence t∗≥θk+1: Σt=x(k) on [θk,θk+1) and Ctc=Ctc,(k) on [θk,θk+1], so Cθk+1c=κk+1c. By the counting identity (1.2) applied at all steps i≤k, pc(κk+1c)=#{i≤k:c∈Ji}, so the state identity at θk+1 reads
Σθk+1=x0+N1c∑vc#{i≤k:c∈Ji}=x0+N1i≤k∑c∈Ji∑vc=x(k+1),
and Σθk+1∈GN by condition 1, so x(k+1)∈GN. This establishes the inductive step, including the hypotheses Cθk+1c=κk+1c and Σθk+1=x(k+1) for the next step. The induction shows that the recursion never stops through x(k)∈/GN, hence stops with θK=T: the data are conflict-free, Σ=Σrec on [0,T), and ΣT=x(K)=ΣTrec. Any two solutions therefore coincide, and a solution exists only if the data are conflict-free; the identities Ctc=Ctc,(k) on [θk,θk+1] were obtained along the way.
Existence for conflict-free data. Assume the data are conflict-free, so that θ0<θ1<⋯<θK=T and every x(k)∈GN; put Σ=Σrec. Here K≥1, since θ0=0<T=θK, and 0<θ1<⋯<θK=T by Step 1. Condition 1 of the definition holds with n=K and ti=θi: Σ takes values in GN and is constant on [0,θ1), on each [θi,θi+1), and on [θK,T]={T}. The integrand s↦NΣsσβ(σ,γ,Σs,as) defining the consumed clock times equals ∑k<K1[θk,θk+1)ϕx(k)c+1{T}ϕx(K)c, which is measurable by (P2) and claim 2 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions; let Ctc be its integral over [0,t]. We show Ctc=Ctc,(k) for t∈[θk,θk+1] by induction on k. For t∈[θk,θk+1], by linearity, Ctc=Cθkc+∫[0,T]1(θk,t]NΣsσβ(σ,γ,Σs,as)ds, and on (θk,t] the integrand differs from ϕx(k)c at most at the single point t=θk+1, so by (P3) the integral equals ∫[0,t]1(θk,T]ϕx(k)cds; with the inductive hypothesis Cθkc=Cθkc,(k−1)=κkc (for k=0, C0c=0=κ0c) this gives Ctc=Ctc,(k). Condition 2 (state identity): with the counters Ntc=pc(Ctc) of the definition, for t∈[θk,θk+1), (1.1) and t<hkc give Ctc,(k)<λkc, so Ntc=pc(κkc)=#{i<k:c∈Ji} by (P1) and (1.2), and the state identity x0+N1∑cvcNtc=x(k)=Σt follows as displayed above; at t=T=θK the same computation with NTc=pc(κKc)=#{i<K:c∈Ji} gives ΣT=x(K). Thus Σrec is a solution.
Properties (a)--(c). (a) follows from Step 1 and Ctc=Ctc,(k) on the pieces, together with κkc≤NBθk: Ctc≤κkc+NB(t−θk)≤NBt, and the Lipschitz bound across pieces is obtained by adding the bounds on the sub-pieces. (b): Ntc=pc(Ctc) is nondecreasing as a composition of nondecreasing maps, takes values in N0, vanishes at 0, and Ntc≤pc(NBt) by (a); for the right-continuity at t∈[0,T), let ℓ be the greatest lower bound of {Nsc:t<s≤T}, so ℓ≥Ntc by monotonicity; if Csc=Ctc for some s>t then Nsc=Ntc and ℓ=Ntc; otherwise Csc>Ctc for all s∈(t,T], and by (a) the values Csc, s∈(t,T], come arbitrarily close to Ctc from above, so that condition 3 of Counting Path and Its Jump Times (right-continuity of pc at the level Ctc) together with monotonicity of pc gives ℓ=pc(Ctc)=Ntc. (c): by construction Σ=x(k) on [θk,θk+1) and Σθk+1=x(k+1), so Σθk+1−Σs=x(k+1)−x(k)=N1∑c∈Jkvc for s∈[θk,θk+1); for c∈Jk, Cθk+1c=Cθk+1c,(k)=λkc=τj(pc) with j=pc(κkc)+1 by Step 1, which is a jump time of pc by (P1). A time t∈(0,T] with Σt=Σs for all s<t close to t cannot lie in the interior of a constancy interval [θk,θk+1), hence is one of θ1,…,θK; and since x(k+1)=x(k) forces Jk=∅, which by (1.2) increases Sk by at least one, there are at most M=∑cpc(NBT) such times.
Step 3 (Claim 3). We show by induction on k that, as long as θk≤t and neither recursion has stopped before step k, the two recursions have the same θk, x(k) and κkc, and moreover θk+1∧t=θk+1′∧t and Csc,(k)=Cs′c,(k) for s∈[0,t]. Suppose the data of step k agree and θk≤t. The integrands 1(θk,T]ϕx(k)c and 1(θk,T]ϕx(k)′c (formed with a′) differ on [0,t] only where as′=as, a subset of a λ[0,T]-null set, so (P3) gives Csc,(k)=Cs′c,(k) for s≤t. Since κkc≤NBθk≤NBt, pc(κkc)=p′c(κkc), so the index j is common; if λkc=τj(pc)≤NBt then p′c(λkc)=pc(λkc)≥j and p′c(u)=pc(u)≤j−1 for u<λkc, so λk′c=λkc by (P1); if λkc>NBt then pc(u)≤j−1 for u≤NBt, so also p′c(u)≤j−1 there and λk′c>NBt. In either case, for s≤t we have Csc,(k)≤NBs≤NBt, and (1.1) shows that hkc≤s if and only if hk′c≤s for every s∈[θk,t]; hence θk+1∧t=θk+1′∧t, and if θk+1≤t then θk+1=θk+1′, Jk=Jk′ (by (1.1) at u=θk+1), x(k+1)=x′(k+1) and κk+1c=Cθk+1c,(k)=κk+1′c. This proves the inductive assertion; in particular, whether the recursion stops at a step k with θk≤t (through θk=T or x(k)∈/GN) is decided by data common to both recursions, so if one recursion stops at an index K with θK≤t then so does the other, with the same x(K) and κKc. The recursion paths agree on [0,t] because, on [θk,θk+1∧t] for the common steps and on [θK,t] after a common stop, each is determined by the common data; the recursion consumed times agree on [0,t] for the same reason, being Csc,(k)=Cs′c,(k) on the common pieces and the common κKc after a stop; and the recursion counters agree on [0,t] because they are pc, respectively p′c, read at the common levels Csrec,c≤NBs≤NBt (Step 1), where the two clock families agree. The final assertion follows from claim 2, the solutions being the recursion paths with the recursion consumed times and counters.
Step 4 (Claim 4). Sections of a. Fix r∈R and a component ai of a. Let ptr be the probability measure on (R,R) with ptr(A)=1 if r∈A and ptr(A)=0 otherwise (a measure, countable additivity holding because a point lies in at most one member of a disjoint family). For a Borel set E⊆R the set A={(s,r′):ai(s,r′)∈E} belongs to B[0,T]⊗R, so by the section clause of Tonelli and Fubini Theorems on ([0,T]×R,B[0,T]⊗R,λ[0,T]⊗ptr) (both factors finite measures), applied to the indicator 1A, the section s↦1A(s,r) is B[0,T]-measurable, i.e. {s:ai(s,r)∈E}∈B[0,T]. Hence s↦a(s,r) is a control path.
Reduction to stopped clocks. Fix t0∈[0,T] and put u0=NBt0. Let P~uc=Pmin(u,u0)c; every path of P~c is a counting path (it is Pc(ω) frozen after level u0), P~uc is Ht0-measurable for every u≥0, and P~c agrees with Pc on [0,u0]. By Step 3, the recursion for (P~(ω),a(⋅,r),x0) produces the same θk, x(k), κkc as the recursion for (P(ω),a(⋅,r),x0) at all steps with θk≤t0, the same recursion path on [0,t0], and the same recursion consumed times on [0,t0]; since these consumed times are at most u0, the recursion counters on [0,t0] also agree. It therefore suffices to prove: if E⊆F is a σ-algebra such that Quc is E-measurable for every u≥0 and every label, where Q=(Qc) is any family of processes with counting paths, then all quantities of the recursion for (Q(ω),a(⋅,r),x0), including the set of conflict-free pairs and, for every t, the recursion path, consumed times and counters at time t, are R⊗E-measurable functions of (r,ω), and the recursion path, consumed times and counters are B[0,T]⊗(R⊗E)-measurable functions of (t,r,ω), and to apply this with Q=P~ and E=Ht0 (for the statements at time t=t0), with Q=P stopped at level NBT and E=HT (for G), and with Q=P and E=F (for the joint measurability in (t,r,ω)). Here measurability of a map with values in [0,+∞] or in a finite subset of Rl means measurability of the sets {⋅≤u} for real u, respectively of the level sets; for a real-valued map this is measurability with respect to B(R) by Generator Criterion for Measurability, the intervals (−∞,u] generating B(R); a map which is measurable on each member of a finite or countable measurable partition of its domain is measurable; and all partial integrals produced by Tonelli and Fubini Theorems below are real-valued, being bounded by NBT. We write M=R⊗E, fix a point r0∈R (nonempty by hypothesis), and let ptr0⊗P∣E be the product measure on M of the probability measures ptr0 (defined above) and the restriction of P to E, so that Tonelli and Fubini Theorems is available on ([0,T]×(R×Ω),B[0,T]⊗M,λ[0,T]⊗(ptr0⊗P∣E)), all measures involved being finite.
Jump times of the clocks. For a label c and j≥1, {τj(Qc)≤u}={Quc≥j}∈E for u≥0 by (P1), so ω↦τj(Qc(ω)) is E-measurable; and for a M-measurable w:R×Ω→[0,∞), {Qwc≥j}={τj(Qc)≤w}=⋂n≥1⋃q∈Q,q≥0({τj(Qc)≤q}∩{q<w+1/n}) is in M as a countable intersection of countable unions (if τj≤w, every n admits, by density, a rational q∈[τj,w+1/n), which is ≥0; conversely the right side forces τj<w+1/n for all n); hence (r,ω)↦Qw(r,ω)c(ω) is M-measurable. More generally, for M-measurable f,g:R×Ω→[0,+∞] the set {f≤g}=⋂n≥1(⋃q∈Q({f≤q}∩{q<g+1/n})∪{g=+∞}) is in M by the same argument (density of Q in the interval [f,g+1/n) when f≤g<+∞); we use this comparison principle below without further comment.
Induction. Extend the recursion beyond its stopping index by freezing: θk=θK, x(k)=x(K), κkc=κKc for k>K. We prove by induction on k that θk, x(k) (with values in the finite set {y∈Rl:Nyγ∈{−lk,…,N+lk} ∀γ}) and κkc are M-measurable, as is the set Ak={(r,ω):the recursion has not stopped at or before step k}=⋂i≤k{θi<T}∩{x(i)∈GN}. This is clear for k=0. Given it for k, fix t∈[0,T] and c=(σ,γ) and consider, for each of the finitely many x∈GN, the function (s,r,ω)↦1{s>θk(r,ω)}Nxσβ(σ,γ,x,a(s,r)) on [0,T]×R×Ω: the indicator is that of the set where the B[0,T]⊗M-measurable map (s,r,ω)↦s−θk(r,ω) is positive, and the second factor is measurable by Sequentially Continuous Functions of Measurable Euclidean Maps are Measurable applied to the sequentially continuous map β(σ,γ,x,⋅) on A and the map (s,r,ω)↦a(s,r), whose components are measurable because they are compositions of the components of a with the projection (s,r,ω)↦(s,r), which is measurable from B[0,T]⊗M to B[0,T]⊗R by the generator criterion of Generator Criterion for Measurability, since preimages of measurable rectangles are measurable rectangles and these generate the product σ-algebra by Product Sigma-Algebra. By Tonelli and Fubini Theorems the partial integral over s∈[0,t] (multiply by 1[0,t](s)) is an M-measurable function of (r,ω), and on Ak one has Ctc,(k)=∑x∈GN1{x(k)=x}(κkc+that partial integral); thus (r,ω)↦1AkCtc,(k) is M-measurable for every t. Next, on Ak, λkc is M-measurable: for u≥0, {λkc≤u}∩Ak=⋃j≥1{Qκkcc=j−1}∩{τj(Qc)≤u}∩Ak, all sets on the right being in M by the paragraph on jump times. By (1.1), for u∈[0,T], {hkc≤u}∩Ak={u≥θk}∩{λkc≤Cuc,(k)}∩Ak∈M (comparison principle), so θk+1=min(T,minchkc) is M-measurable on Ak: {θk+1≤u}∩Ak=Ak∩({u≥T}∪⋃c{hkc≤u}). Likewise {c∈Jk}∩Ak={hkc≤θk+1}∩Ak (by (1.1) at u=θk+1) is in M by the comparison principle, so x(k+1)=x(k)+N1∑c1{c∈Jk}vc is M-measurable on Ak. Finally, on Ak, κk+1c=Cθk+1c,(k)=∑x∈GN1{x(k)=x}(κkc+∫[0,T]1{θk<s≤θk+1}Nxσβ(σ,γ,x,a(s,r))ds) is measurable by the same Tonelli argument with the jointly measurable indicator of {(s,r,ω):θk(r,ω)<s≤θk+1(r,ω)}. Off Ak the frozen values are those of an earlier step, measurable by the inductive hypothesis, and Ak∈M, so the maps are measurable on the partition {Ak,Akc}. Hence θk+1, x(k+1), κk+1c and Ak+1=Ak∩{θk+1<T}∩{x(k+1)∈GN} are M-measurable, completing the induction. The stopping index satisfies {K=k}=Ak−1∖Ak (with A−1=R×Ω), so K is M-measurable, and G=⋃k{K=k}∩{θk=T}∩{x(k)∈GN}∈M; applied with E=HT and the clocks stopped at level NBT (which by Step 3 with t=T give the same recursion), this proves G∈R⊗HT.
The recursion path, consumed times and counters. For t∈[0,T] and a Borel set E⊆R,
{Σtr,γ∈E}=k≥0⋃({K>k}∩{θk≤t<θk+1}∩{x(k),γ∈E})∪k≥0⋃({K=k}∩{θk≤t}∩{x(k),γ∈E})∈M,
and the same display with t regarded as a variable exhibits {(t,r,ω):Σtr,γ(ω)∈E} as a countable union of sets in B[0,T]⊗M (each {(t,r,ω):θk(r,ω)≤t<θk+1(r,ω)} being measurable, as above). For the recursion consumed times, on {K>k}∩{θk≤t<θk+1} one has Ctr,c=Ctc,(k)=∑x1{x(k)=x}(κkc+∫[0,T]1{θk<s≤t}Nxσβ(σ,γ,x,a(s,r))ds), and on {K=k}∩{θk≤t} one has Ctr,c=κkc; the integrand (s,(t,r,ω))↦1{θk(r,ω)<s≤t}Nxσβ(σ,γ,x,a(s,r)) is measurable on [0,T]×([0,T]×R×Ω), so by Tonelli and Fubini Theorems (with the finite product measure λ[0,T]⊗(λ[0,T]⊗(ptr0⊗P∣E)) on B[0,T]⊗(B[0,T]⊗M)) the integral is a measurable function of (t,r,ω), and a fortiori of (r,ω) for fixed t; piecing together over the measurable sets above gives measurability of Ctr,c in (r,ω) and jointly in (t,r,ω). Finally {Ntr,c≥j}={τj(Qc)≤Ctr,c} by (P1), which is measurable in (r,ω) and in (t,r,ω) by the comparison principle, since τj(Qc) and Ctr,c are; as Ntr,c takes values in N0, this gives its measurability. For the joint measurability in (t,r,ω) we apply the above with E=F and Q=P (no stopping), which is legitimate since the induction used only E-measurability of the clock variables; for the R⊗Ht0-measurability at a fixed time t0 we apply it with Q=P~, E=Ht0 and t=t0, and transfer the result to the unstopped recursion by the first paragraph of this step. The final assertion of claim 4 (one-point R={r}, conflict-free data for every ω) is claim 2 applied at each ω together with the R⊗Ht-measurability just proved, from which the Ht-measurability of ω↦Σtr,γ(ω) follows by the section clause of Tonelli and Fubini Theorems (applied to ptr⊗P∣Ht and the indicator of {Σtr,γ∈E} for Borel E).