TheoremBase

Proof

Throughout, c=(σ,γ)c=(\sigma,\gamma) denotes a generic transition label (there are l(l−1)l(l-1) of them), and Q\mathbb{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∈GNx\in\mathbb{G}_N and c=(σ,γ)c=(\sigma,\gamma) put ϕxc(s)=N xσ β(σ,γ,x,as)\phi^{c}_x(s)=N\,x^{\sigma}\,\beta(\sigma,\gamma,x,a_s) for s∈[0,T]s\in[0,T]. We use the restricted Lebesgue measure λ[0,T]\lambda_{[0,T]} on [0,T][0,T] and, for t∈[0,T]t\in[0,T] and a bounded measurable f:[0,T]→Rf:[0,T]\to\mathbb{R}, we write ∫[0,t]f ds\int_{[0,t]}f\,ds for the Lebesgue integral of the restriction of ff to [0,t][0,t]; by claim 2 of the toolkit this equals the integral over [0,T][0,T] of 1[0,t]f\mathbf{1}_{[0,t]}f, since both coincide with the integral over R\mathbb{R} of the common zero extension.

Step 0 (Preliminaries).

(P1) Counting paths. Let qq be a counting path and j≥1j\ge1 a natural number. For u≥0u\ge0 one has τj(q)≤u\tau_j(q)\le u if and only if q(u)≥jq(u)\ge j: if q(u)≥jq(u)\ge j then uu belongs to the set defining τj(q)\tau_j(q); conversely, if τj(q)≤u\tau_j(q)\le u then for every s>us>u there is tt with τj(q)≤t<s\tau_j(q)\le t<s and q(t)≥jq(t)\ge j (by the definition of the greatest lower bound), whence q(s)≥jq(s)\ge j by monotonicity, and right-continuity gives q(u)≥jq(u)\ge j. Consequently q(u)≤j−1q(u)\le j-1 for u<τj(q)u<\tau_j(q), and if τj(q)<∞\tau_j(q)<\infty then q(τj(q))=jq(\tau_j(q))=j: indeed q(τj(q))≥jq(\tau_j(q))\ge j, while q(τj(q)−)≤j−1q(\tau_j(q)-)\le j-1 and the unit-jump condition give q(τj(q))≤jq(\tau_j(q))\le j. Moreover, if u≥0u\ge0 and j=q(u)+1j=q(u)+1, then τj(q)>u\tau_j(q)>u, since q(u)<jq(u)<j. Finally, τj(q)\tau_j(q) is a jump time of qq when finite: τj(q)>0\tau_j(q)>0, since τj(q)≤0\tau_j(q)\le0 would give q(0)≥j≥1q(0)\ge j\ge1, contradicting q(0)=0q(0)=0; and q(τj(q))=j>j−1≥q(τj(q)−)q(\tau_j(q))=j>j-1\ge q(\tau_j(q)-).

(P2) Integrands. For x∈GNx\in\mathbb{G}_N and c=(σ,γ)c=(\sigma,\gamma) the map α↦β(σ,γ,x,α)\alpha\mapsto\beta(\sigma,\gamma,x,\alpha) is sequentially continuous on A\mathcal{A} (condition 2 of Transition-Rate Family with the constant sequence Σn=x\Sigma_n=x), and the components of aa are measurable, so s↦β(σ,γ,x,as)s\mapsto\beta(\sigma,\gamma,x,a_s) is measurable by Sequentially Continuous Functions of Measurable Euclidean Maps are Measurable; multiplying by the constant NxσNx^{\sigma} (claim 2 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions) shows that ϕxc\phi^{c}_x is measurable, and 0≤ϕxc≤NB0\le\phi^{c}_x\le NB because 0≤xσ≤10\le x^{\sigma}\le1 and 0≤β≤B0\le\beta\le B. Products of ϕxc\phi^{c}_x with indicators of measurable subsets of [0,T][0,T] are measurable by claims 1 and 3 of the same lemma.

(P3) Indefinite integrals. Let f:[0,T]→[0,NB]f:[0,T]\to[0,NB] be measurable and put F(t)=∫[0,t]f dsF(t)=\int_{[0,t]}f\,ds. For 0≤s≤t≤T0\le s\le t\le T, F(t)−F(s)=∫[0,T]1(s,t]f dsF(t)-F(s)=\int_{[0,T]}\mathbf{1}_{(s,t]}f\,ds by linearity, and 0≤1(s,t]f≤NB 1(s,t]0\le\mathbf{1}_{(s,t]}f\le NB\,\mathbf{1}_{(s,t]} gives, by monotonicity and the value λ[0,T]((s,t])=t−s\lambda_{[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)0\le F(t)-F(s)\le NB(t-s). Hence FF is nondecreasing, and continuous on [0,T][0,T]. Moreover, if g:[0,T]→[0,NB]g:[0,T]\to[0,NB] is measurable, t∈[0,T]t\in[0,T], and {f≠g}∩[0,t]\{f\neq g\}\cap[0,t] is contained in a set ZZ with λ[0,T](Z)=0\lambda_{[0,T]}(Z)=0, then ∫[0,u]f=∫[0,u]g\int_{[0,u]}f=\int_{[0,u]}g for every u∈[0,t]u\in[0,t]: the functions 1[0,u]f\mathbf{1}_{[0,u]}f and 1[0,u]g\mathbf{1}_{[0,u]}g agree off ZZ, so claim 6 of the toolkit (applied on the co-null set [0,T]∖Z[0,T]\setminus Z) gives equal integrals over [0,T][0,T]. In particular this holds when {f≠g}∩[0,t]\{f\neq g\}\cap[0,t] is finite, a finite set being a Borel set of measure 00 by claim 4 of Existence of Lebesgue Measure on the Real Line (a single point is the interval [s,s][s,s]) and finite additivity of the measure.

Step 1 (Claim 1). Suppose the recursion has produced θk∈[0,T)\theta_k\in[0,T), x(k)∈GNx^{(k)}\in\mathbb{G}_N and levels κkc≥0\kappa^{c}_k\ge0. The integrand defining Ctc,(k)\mathsf{C}^{c,(k)}_t is 1(θk,T]ϕx(k)c\mathbf{1}_{(\theta_k,T]}\phi^{c}_{x^{(k)}}, measurable with values in [0,NB][0,NB] by (P2), so by (P3) the map t↦Ctc,(k)t\mapsto\mathsf{C}^{c,(k)}_t is nondecreasing, satisfies ∣Ctc,(k)−Csc,(k)∣≤NB(t−s)|\mathsf{C}^{c,(k)}_t-\mathsf{C}^{c,(k)}_s|\le NB(t-s), and is continuous; and Cθkc,(k)=κkc\mathsf{C}^{c,(k)}_{\theta_k}=\kappa^{c}_k because the integrand vanishes on [0,θk][0,\theta_k] (applied at step k+1k+1, this is the identity Cθk+1c,(k+1)=κk+1c\mathsf{C}^{c,(k+1)}_{\theta_{k+1}}=\kappa^{c}_{k+1} of claim 1). By (P1), λkc>κkc\lambda^{c}_k>\kappa^{c}_k. For each label cc let hkch^{c}_k be the greatest lower bound of Hkc={t∈[θk,T]:Ctc,(k)≥λkc}H^{c}_k=\{t\in[\theta_k,T]:\mathsf{C}^{c,(k)}_t\ge\lambda^{c}_k\} (equal to +∞+\infty if Hkc=∅H^{c}_k=\emptyset), so that θk+1=min⁡(T,min⁡chkc)\theta_{k+1}=\min(T,\min_c h^{c}_k). Since Cc,(k)\mathsf{C}^{c,(k)} is nondecreasing and continuous, HkcH^{c}_k is an interval of the form [hkc,T][h^{c}_k,T] when nonempty: if t∈Hkct\in H^{c}_k and t≤t′≤Tt\le t'\le T then t′∈Hkct'\in H^{c}_k; and if Hkc≠∅H^{c}_k\neq\emptyset, choosing tn∈Hkct_n\in H^{c}_k with tn→hkct_n\to h^{c}_k gives Chkcc,(k)=lim⁡Ctnc,(k)≥λkc\mathsf{C}^{c,(k)}_{h^{c}_k}=\lim\mathsf{C}^{c,(k)}_{t_n}\ge\lambda^{c}_k. Thus, for u∈[θk,T]u\in[\theta_k,T],

hkc≤u⟺Cuc,(k)≥λkc.(1.1)h^{c}_k\le u\quad\Longleftrightarrow\quad\mathsf{C}^{c,(k)}_u\ge\lambda^{c}_k .\tag{1.1}

Since Cθkc,(k)=κkc<λkc\mathsf{C}^{c,(k)}_{\theta_k}=\kappa^{c}_k<\lambda^{c}_k and there are finitely many labels, continuity yields ϵ>0\epsilon>0 with Ctc,(k)<λkc\mathsf{C}^{c,(k)}_t<\lambda^{c}_k for all cc and all t∈[θk,min⁡(T,θk+ϵ)]t\in[\theta_k,\min(T,\theta_k+\epsilon)], so hkc≥min⁡(T,θk+ϵ)h^{c}_k\ge\min(T,\theta_k+\epsilon) for every cc by (1.1), and θk+1≥min⁡(T,θk+ϵ)>θk\theta_{k+1}\ge\min(T,\theta_k+\epsilon)>\theta_k. If θk+1<T\theta_{k+1}<T, then θk+1=hkc\theta_{k+1}=h^{c}_k for some label cc, and (1.1) with u=hkcu=h^{c}_k gives c∈Jkc\in\mathcal{J}_k. For any c∈Jkc\in\mathcal{J}_k one has hkc≤θk+1h^{c}_k\le\theta_{k+1} by (1.1), while θk+1≤hkc\theta_{k+1}\le h^{c}_k by definition, so hkc=θk+1>θkh^{c}_k=\theta_{k+1}>\theta_k; choosing tn∈[θk,hkc)t_n\in[\theta_k,h^{c}_k) with tn→hkct_n\to h^{c}_k gives Ctnc,(k)<λkc\mathsf{C}^{c,(k)}_{t_n}<\lambda^{c}_k, hence Cθk+1c,(k)≤λkc\mathsf{C}^{c,(k)}_{\theta_{k+1}}\le\lambda^{c}_k by continuity, and together with c∈Jkc\in\mathcal{J}_k this gives Cθk+1c,(k)=λkc\mathsf{C}^{c,(k)}_{\theta_{k+1}}=\lambda^{c}_k. The bound κk+1c≤NBθk+1\kappa^{c}_{k+1}\le NB\theta_{k+1} follows by induction from κ0c=0\kappa^{c}_0=0 and κk+1c−κkc=Cθk+1c,(k)−Cθkc,(k)≤NB(θk+1−θk)\kappa^{c}_{k+1}-\kappa^{c}_k=\mathsf{C}^{c,(k)}_{\theta_{k+1}}-\mathsf{C}^{c,(k)}_{\theta_k}\le NB(\theta_{k+1}-\theta_k).

Counting identity. We claim that for every step kk at which the recursion has not stopped and every label cc,

pc(κk+1c)=pc(κkc)+1{c∈Jk}.(1.2)p^{c}(\kappa^{c}_{k+1})=p^{c}(\kappa^{c}_k)+\mathbf{1}_{\{c\in\mathcal{J}_k\}}.\tag{1.2}

Indeed, write j=pc(κkc)+1j=p^{c}(\kappa^{c}_k)+1, so λkc=τj(pc)\lambda^{c}_k=\tau_j(p^{c}). If c∈Jkc\in\mathcal{J}_k then κk+1c=λkc\kappa^{c}_{k+1}=\lambda^{c}_k is finite and pc(κk+1c)=jp^{c}(\kappa^{c}_{k+1})=j by (P1). If c∉Jkc\notin\mathcal{J}_k then κk+1c=Cθk+1c,(k)<λkc\kappa^{c}_{k+1}=\mathsf{C}^{c,(k)}_{\theta_{k+1}}<\lambda^{c}_k, so pc(κk+1c)≤j−1p^{c}(\kappa^{c}_{k+1})\le j-1 by (P1), while pc(κk+1c)≥pc(κkc)=j−1p^{c}(\kappa^{c}_{k+1})\ge p^{c}(\kappa^{c}_k)=j-1 by monotonicity and κk+1c≥κkc\kappa^{c}_{k+1}\ge\kappa^{c}_k. Summing (1.2) over the steps, Sk=∑cpc(κkc)S_k=\sum_{c}p^{c}(\kappa^{c}_k) satisfies Sk+1≥Sk+1S_{k+1}\ge S_k+1 whenever Jk≠∅\mathcal{J}_k\neq\emptyset, in particular whenever θk+1<T\theta_{k+1}<T. Since κkc≤NBθk≤NBT\kappa^{c}_k\le NB\theta_k\le NBT, monotonicity gives Sk≤M:=∑cpc(NBT)S_k\le M:=\sum_{c}p^{c}(NBT). If the recursion has not stopped at step kk, then θ1,…,θk<T\theta_1,\dots,\theta_k<T, so Sk≥S0+k=kS_k\ge S_0+k=k, whence k≤Mk\le M. Therefore the recursion stops at some K≤M+1K\le M+1.

Step 2 (Claim 2). Uniqueness and necessity of conflict-freeness. Let Σ\Sigma be an open-loop aggregate solution for (p,a,x0)(p,a,x_0), with consumed clock times Cc\mathsf{C}^{c} and counters Nc\mathsf{N}^{c}. We show by induction on kk that, as long as θk\theta_k is defined (the recursion not having stopped before step kk): (i) if θk<T\theta_k<T then Σt=x(k)\Sigma_t=x^{(k)} for t∈[θk,θk+1)t\in[\theta_k,\theta_{k+1}) and Ctc=Ctc,(k)\mathsf{C}^{c}_t=\mathsf{C}^{c,(k)}_t for t∈[θk,θk+1]t\in[\theta_k,\theta_{k+1}] and all cc, while if θk=T\theta_k=T then ΣT=x(k)\Sigma_T=x^{(k)}; and (ii) x(k+1)∈GNx^{(k+1)}\in\mathbb{G}_N whenever θk+1\theta_{k+1} is defined. The starting point is C0c=0=κ0c\mathsf{C}^{c}_0=0=\kappa^{c}_0 and Σ0=x0=x(0)\Sigma_0=x_0=x^{(0)}, the latter from the state identity and N0c=pc(0)=0\mathsf{N}^{c}_0=p^{c}(0)=0.

Assume the recursion has reached step kk with θk<T\theta_k<T and x(k)∈GNx^{(k)}\in\mathbb{G}_N, and that Cθkc=κkc\mathsf{C}^{c}_{\theta_k}=\kappa^{c}_k for all cc and Σθk=x(k)\Sigma_{\theta_k}=x^{(k)} (for k=0k=0 this was just checked; for k≥1k\ge1 it is part of the inductive conclusion below). Let t∗t^{*} be the least upper bound of the set of t∈[θk,T]t\in[\theta_k,T] such that Σs=x(k)\Sigma_s=x^{(k)} for all s∈[θk,t]s\in[\theta_k,t]; this set contains θk\theta_k, and by condition 1 of the definition (piecewise constancy on left-closed, right-open pieces [ti,ti+1)[t_i,t_{i+1}) and on [tn,T][t_n,T], so that each piece contains a right neighbourhood, relative to [0,T][0,T], of each of its points) it contains [θk,θk+ϵ][\theta_k,\theta_k+\epsilon] for some ϵ>0\epsilon>0 with θk+ϵ≤T\theta_k+\epsilon\le T, so t∗>θkt^{*}>\theta_k and Σs=x(k)\Sigma_s=x^{(k)} for s∈[θk,t∗)s\in[\theta_k,t^{*}). For t∈[θk,t∗)t\in[\theta_k,t^{*}) the integrand s↦NΣsσβ(σ,γ,Σs,as)s\mapsto N\Sigma^{\sigma}_s\beta(\sigma,\gamma,\Sigma_s,a_s) defining Cc\mathsf{C}^{c} in the definition (measurable with values in [0,NB][0,NB], as noted there) agrees on (θk,t](\theta_k,t] with ϕx(k)c\phi^{c}_{x^{(k)}}, so, splitting the integral over [0,t][0,t] as in (P3),

Ctc=Cθkc+∫[0,T]1(θk,t]ϕx(k)c ds=κkc+∫[0,t]1(θk,T]ϕx(k)c ds=Ctc,(k),\mathsf{C}^{c}_t=\mathsf{C}^{c}_{\theta_k}+\int_{[0,T]}\mathbf{1}_{(\theta_k,t]}\phi^{c}_{x^{(k)}}\,ds=\kappa^{c}_k+\int_{[0,t]}\mathbf{1}_{(\theta_k,T]}\phi^{c}_{x^{(k)}}\,ds=\mathsf{C}^{c,(k)}_t ,

and by continuity of both sides in tt ((P3) applied to the integrand of the definition, and Step 1) the identity Ctc=Ctc,(k)\mathsf{C}^{c}_t=\mathsf{C}^{c,(k)}_t extends to t=t∗t=t^{*}. Hence Ntc=pc(Ctc,(k))\mathsf{N}^{c}_t=p^{c}(\mathsf{C}^{c,(k)}_t) for t∈[θk,t∗]t\in[\theta_k,t^{*}]. Suppose, for contradiction, that t∗<θk+1t^{*}<\theta_{k+1}. For t∈[θk,t∗]t\in[\theta_k,t^{*}] and every cc we have t<θk+1≤hkct<\theta_{k+1}\le h^{c}_k, so Ctc,(k)<λkc\mathsf{C}^{c,(k)}_t<\lambda^{c}_k by (1.1), and (P1) with monotonicity gives pc(Ctc,(k))=pc(κkc)p^{c}(\mathsf{C}^{c,(k)}_t)=p^{c}(\kappa^{c}_k), i.e. Ntc=Nθkc\mathsf{N}^{c}_t=\mathsf{N}^{c}_{\theta_k}; the state identity then gives Σt=Σθk=x(k)\Sigma_t=\Sigma_{\theta_k}=x^{(k)} for all t∈[θk,t∗]t\in[\theta_k,t^{*}], in particular at t∗<Tt^{*}<T, and condition 1 of the definition (the piece containing t∗t^{*} contains a right neighbourhood of it) yields ϵ>0\epsilon>0 with Σ=x(k)\Sigma=x^{(k)} on [t∗,t∗+ϵ][t^{*},t^{*}+\epsilon], contradicting the definition of t∗t^{*}. Hence t∗≥θk+1t^{*}\ge\theta_{k+1}: Σt=x(k)\Sigma_t=x^{(k)} on [θk,θk+1)[\theta_k,\theta_{k+1}) and Ctc=Ctc,(k)\mathsf{C}^{c}_t=\mathsf{C}^{c,(k)}_t on [θk,θk+1][\theta_k,\theta_{k+1}], so Cθk+1c=κk+1c\mathsf{C}^{c}_{\theta_{k+1}}=\kappa^{c}_{k+1}. By the counting identity (1.2) applied at all steps i≤ki\le k, pc(κk+1c)=#{i≤k:c∈Ji}p^{c}(\kappa^{c}_{k+1})=\#\{i\le k:c\in\mathcal{J}_i\}, so the state identity at θk+1\theta_{k+1} reads

Σθk+1=x0+1N∑cvc #{i≤k:c∈Ji}=x0+1N∑i≤k∑c∈Jivc=x(k+1),\Sigma_{\theta_{k+1}}=x_0+\frac{1}{N}\sum_{c}v_c\,\#\{i\le k:c\in\mathcal{J}_i\}=x_0+\frac{1}{N}\sum_{i\le k}\sum_{c\in\mathcal{J}_i}v_c=x^{(k+1)} ,

and Σθk+1∈GN\Sigma_{\theta_{k+1}}\in\mathbb{G}_N by condition 1, so x(k+1)∈GNx^{(k+1)}\in\mathbb{G}_N. This establishes the inductive step, including the hypotheses Cθk+1c=κk+1c\mathsf{C}^{c}_{\theta_{k+1}}=\kappa^{c}_{k+1} and Σθk+1=x(k+1)\Sigma_{\theta_{k+1}}=x^{(k+1)} for the next step. The induction shows that the recursion never stops through x(k)∉GNx^{(k)}\notin\mathbb{G}_N, hence stops with θK=T\theta_K=T: the data are conflict-free, Σ=Σrec\Sigma=\Sigma^{\mathrm{rec}} on [0,T)[0,T), and ΣT=x(K)=ΣTrec\Sigma_T=x^{(K)}=\Sigma^{\mathrm{rec}}_T. Any two solutions therefore coincide, and a solution exists only if the data are conflict-free; the identities Ctc=Ctc,(k)\mathsf{C}^{c}_t=\mathsf{C}^{c,(k)}_t on [θk,θk+1][\theta_k,\theta_{k+1}] were obtained along the way.

Existence for conflict-free data. Assume the data are conflict-free, so that θ0<θ1<⋯<θK=T\theta_0<\theta_1<\dots<\theta_K=T and every x(k)∈GNx^{(k)}\in\mathbb{G}_N; put Σ=Σrec\Sigma=\Sigma^{\mathrm{rec}}. Here K≥1K\ge1, since θ0=0<T=θK\theta_0=0<T=\theta_K, and 0<θ1<⋯<θK=T0<\theta_1<\dots<\theta_K=T by Step 1. Condition 1 of the definition holds with n=Kn=K and ti=θit_i=\theta_i: Σ\Sigma takes values in GN\mathbb{G}_N and is constant on [0,θ1)[0,\theta_1), on each [θi,θi+1)[\theta_i,\theta_{i+1}), and on [θK,T]={T}[\theta_K,T]=\{T\}. The integrand s↦NΣsσβ(σ,γ,Σs,as)s\mapsto N\Sigma^{\sigma}_s\beta(\sigma,\gamma,\Sigma_s,a_s) defining the consumed clock times equals ∑k<K1[θk,θk+1)ϕx(k)c+1{T}ϕx(K)c\sum_{k<K}\mathbf{1}_{[\theta_k,\theta_{k+1})}\phi^{c}_{x^{(k)}}+\mathbf{1}_{\{T\}}\phi^{c}_{x^{(K)}}, which is measurable by (P2) and claim 2 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions; let Ctc\mathsf{C}^{c}_t be its integral over [0,t][0,t]. We show Ctc=Ctc,(k)\mathsf{C}^{c}_t=\mathsf{C}^{c,(k)}_t for t∈[θk,θk+1]t\in[\theta_k,\theta_{k+1}] by induction on kk. For t∈[θk,θk+1]t\in[\theta_k,\theta_{k+1}], by linearity, Ctc=Cθkc+∫[0,T]1(θk,t] NΣsσβ(σ,γ,Σs,as) ds\mathsf{C}^{c}_t=\mathsf{C}^{c}_{\theta_k}+\int_{[0,T]}\mathbf{1}_{(\theta_k,t]}\,N\Sigma^{\sigma}_s\beta(\sigma,\gamma,\Sigma_s,a_s)\,ds, and on (θk,t](\theta_k,t] the integrand differs from ϕx(k)c\phi^{c}_{x^{(k)}} at most at the single point t=θk+1t=\theta_{k+1}, so by (P3) the integral equals ∫[0,t]1(θk,T]ϕx(k)c ds\int_{[0,t]}\mathbf{1}_{(\theta_k,T]}\phi^{c}_{x^{(k)}}\,ds; with the inductive hypothesis Cθkc=Cθkc,(k−1)=κkc\mathsf{C}^{c}_{\theta_k}=\mathsf{C}^{c,(k-1)}_{\theta_k}=\kappa^{c}_k (for k=0k=0, C0c=0=κ0c\mathsf{C}^{c}_0=0=\kappa^{c}_0) this gives Ctc=Ctc,(k)\mathsf{C}^{c}_t=\mathsf{C}^{c,(k)}_t. Condition 2 (state identity): with the counters Ntc=pc(Ctc)\mathsf{N}^{c}_t=p^{c}(\mathsf{C}^{c}_t) of the definition, for t∈[θk,θk+1)t\in[\theta_k,\theta_{k+1}), (1.1) and t<hkct<h^{c}_k give Ctc,(k)<λkc\mathsf{C}^{c,(k)}_t<\lambda^{c}_k, so Ntc=pc(κkc)=#{i<k:c∈Ji}\mathsf{N}^{c}_t=p^{c}(\kappa^{c}_k)=\#\{i<k:c\in\mathcal{J}_i\} by (P1) and (1.2), and the state identity x0+1N∑cvcNtc=x(k)=Σtx_0+\frac1N\sum_c v_c\mathsf{N}^{c}_t=x^{(k)}=\Sigma_t follows as displayed above; at t=T=θKt=T=\theta_K the same computation with NTc=pc(κKc)=#{i<K:c∈Ji}\mathsf{N}^{c}_T=p^{c}(\kappa^{c}_K)=\#\{i<K:c\in\mathcal{J}_i\} gives ΣT=x(K)\Sigma_T=x^{(K)}. Thus Σrec\Sigma^{\mathrm{rec}} is a solution.

Properties (a)--(c). (a) follows from Step 1 and Ctc=Ctc,(k)\mathsf{C}^{c}_t=\mathsf{C}^{c,(k)}_t on the pieces, together with κkc≤NBθk\kappa^{c}_k\le NB\theta_k: Ctc≤κkc+NB(t−θk)≤NBt\mathsf{C}^{c}_t\le\kappa^{c}_k+NB(t-\theta_k)\le NBt, and the Lipschitz bound across pieces is obtained by adding the bounds on the sub-pieces. (b): Ntc=pc(Ctc)\mathsf{N}^{c}_t=p^{c}(\mathsf{C}^{c}_t) is nondecreasing as a composition of nondecreasing maps, takes values in N0\mathbb{N}_0, vanishes at 00, and Ntc≤pc(NBt)\mathsf{N}^{c}_t\le p^{c}(NBt) by (a); for the right-continuity at t∈[0,T)t\in[0,T), let ℓ\ell be the greatest lower bound of {Nsc:t<s≤T}\{\mathsf{N}^{c}_s:t<s\le T\}, so ℓ≥Ntc\ell\ge\mathsf{N}^{c}_t by monotonicity; if Csc=Ctc\mathsf{C}^{c}_s=\mathsf{C}^{c}_t for some s>ts>t then Nsc=Ntc\mathsf{N}^{c}_s=\mathsf{N}^{c}_t and ℓ=Ntc\ell=\mathsf{N}^{c}_t; otherwise Csc>Ctc\mathsf{C}^{c}_s>\mathsf{C}^{c}_t for all s∈(t,T]s\in(t,T], and by (a) the values Csc\mathsf{C}^{c}_s, s∈(t,T]s\in(t,T], come arbitrarily close to Ctc\mathsf{C}^{c}_t from above, so that condition 3 of Counting Path and Its Jump Times (right-continuity of pcp^{c} at the level Ctc\mathsf{C}^{c}_t) together with monotonicity of pcp^{c} gives ℓ=pc(Ctc)=Ntc\ell=p^{c}(\mathsf{C}^{c}_t)=\mathsf{N}^{c}_t. (c): by construction Σ=x(k)\Sigma=x^{(k)} on [θk,θk+1)[\theta_k,\theta_{k+1}) and Σθk+1=x(k+1)\Sigma_{\theta_{k+1}}=x^{(k+1)}, so Σθk+1−Σs=x(k+1)−x(k)=1N∑c∈Jkvc\Sigma_{\theta_{k+1}}-\Sigma_s=x^{(k+1)}-x^{(k)}=\frac1N\sum_{c\in\mathcal{J}_k}v_c for s∈[θk,θk+1)s\in[\theta_k,\theta_{k+1}); for c∈Jkc\in\mathcal{J}_k, Cθk+1c=Cθk+1c,(k)=λkc=τj(pc)\mathsf{C}^{c}_{\theta_{k+1}}=\mathsf{C}^{c,(k)}_{\theta_{k+1}}=\lambda^{c}_k=\tau_j(p^{c}) with j=pc(κkc)+1j=p^{c}(\kappa^{c}_k)+1 by Step 1, which is a jump time of pcp^{c} by (P1). A time t∈(0,T]t\in(0,T] with Σt≠Σs\Sigma_t\neq\Sigma_s for all s<ts<t close to tt cannot lie in the interior of a constancy interval [θk,θk+1)[\theta_k,\theta_{k+1}), hence is one of θ1,…,θK\theta_1,\dots,\theta_K; and since x(k+1)≠x(k)x^{(k+1)}\neq x^{(k)} forces Jk≠∅\mathcal{J}_k\neq\emptyset, which by (1.2) increases SkS_k by at least one, there are at most M=∑cpc(NBT)M=\sum_c p^{c}(NBT) such times.

Step 3 (Claim 3). We show by induction on kk that, as long as θk≤t\theta_k\le t and neither recursion has stopped before step kk, the two recursions have the same θk\theta_k, x(k)x^{(k)} and κkc\kappa^{c}_k, and moreover θk+1∧t=θk+1′∧t\theta_{k+1}\wedge t=\theta'_{k+1}\wedge t and Csc,(k)=Cs′c,(k)\mathsf{C}^{c,(k)}_s=\mathsf{C}'^{c,(k)}_s for s∈[0,t]s\in[0,t]. Suppose the data of step kk agree and θk≤t\theta_k\le t. The integrands 1(θk,T]ϕx(k)c\mathbf{1}_{(\theta_k,T]}\phi^{c}_{x^{(k)}} and 1(θk,T]ϕx(k)′c\mathbf{1}_{(\theta_k,T]}\phi'^{c}_{x^{(k)}} (formed with a′a') differ on [0,t][0,t] only where as′≠asa'_s\neq a_s, a subset of a λ[0,T]\lambda_{[0,T]}-null set, so (P3) gives Csc,(k)=Cs′c,(k)\mathsf{C}^{c,(k)}_s=\mathsf{C}'^{c,(k)}_s for s≤ts\le t. Since κkc≤NBθk≤NBt\kappa^{c}_k\le NB\theta_k\le NBt, pc(κkc)=p′c(κkc)p^{c}(\kappa^{c}_k)=p'^{c}(\kappa^{c}_k), so the index jj is common; if λkc=τj(pc)≤NBt\lambda^{c}_k=\tau_j(p^{c})\le NBt then p′c(λkc)=pc(λkc)≥jp'^{c}(\lambda^{c}_k)=p^{c}(\lambda^{c}_k)\ge j and p′c(u)=pc(u)≤j−1p'^{c}(u)=p^{c}(u)\le j-1 for u<λkcu<\lambda^{c}_k, so λk′c=λkc\lambda'^{c}_k=\lambda^{c}_k by (P1); if λkc>NBt\lambda^{c}_k>NBt then pc(u)≤j−1p^{c}(u)\le j-1 for u≤NBtu\le NBt, so also p′c(u)≤j−1p'^{c}(u)\le j-1 there and λk′c>NBt\lambda'^{c}_k>NBt. In either case, for s≤ts\le t we have Csc,(k)≤NBs≤NBt\mathsf{C}^{c,(k)}_s\le NBs\le NBt, and (1.1) shows that hkc≤sh^{c}_k\le s if and only if hk′c≤sh'^{c}_k\le s for every s∈[θk,t]s\in[\theta_k,t]; hence θk+1∧t=θk+1′∧t\theta_{k+1}\wedge t=\theta'_{k+1}\wedge t, and if θk+1≤t\theta_{k+1}\le t then θk+1=θk+1′\theta_{k+1}=\theta'_{k+1}, Jk=Jk′\mathcal{J}_k=\mathcal{J}'_k (by (1.1) at u=θk+1u=\theta_{k+1}), x(k+1)=x′(k+1)x^{(k+1)}=x'^{(k+1)} and κk+1c=Cθk+1c,(k)=κk+1′c\kappa^{c}_{k+1}=\mathsf{C}^{c,(k)}_{\theta_{k+1}}=\kappa'^{c}_{k+1}. This proves the inductive assertion; in particular, whether the recursion stops at a step kk with θk≤t\theta_k\le t (through θk=T\theta_k=T or x(k)∉GNx^{(k)}\notin\mathbb{G}_N) is decided by data common to both recursions, so if one recursion stops at an index KK with θK≤t\theta_K\le t then so does the other, with the same x(K)x^{(K)} and κKc\kappa^{c}_K. The recursion paths agree on [0,t][0,t] because, on [θk,θk+1∧t][\theta_k,\theta_{k+1}\wedge t] for the common steps and on [θK,t][\theta_K,t] after a common stop, each is determined by the common data; the recursion consumed times agree on [0,t][0,t] for the same reason, being Csc,(k)=Cs′c,(k)\mathsf{C}^{c,(k)}_s=\mathsf{C}'^{c,(k)}_s on the common pieces and the common κKc\kappa^{c}_K after a stop; and the recursion counters agree on [0,t][0,t] because they are pcp^{c}, respectively p′cp'^{c}, read at the common levels Csrec,c≤NBs≤NBt\mathsf{C}^{\mathrm{rec},c}_s\le NBs\le 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\mathsf{a}. Fix r∈Rr\in\mathsf{R} and a component ai\mathsf{a}^{i} of a\mathsf{a}. Let ptr\mathrm{pt}_{r} be the probability measure on (R,R)(\mathsf{R},\mathcal{R}) with ptr(A)=1\mathrm{pt}_{r}(A)=1 if r∈Ar\in A and ptr(A)=0\mathrm{pt}_{r}(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⊆RE\subseteq\mathbb{R} the set A={(s,r′):ai(s,r′)∈E}A=\{(s,r'):\mathsf{a}^{i}(s,r')\in E\} belongs to B[0,T]⊗R\mathcal{B}_{[0,T]}\otimes\mathcal{R}, so by the section clause of Tonelli and Fubini Theorems on ([0,T]×R,B[0,T]⊗R,λ[0,T]⊗ptr)([0,T]\times\mathsf{R},\mathcal{B}_{[0,T]}\otimes\mathcal{R},\lambda_{[0,T]}\otimes\mathrm{pt}_{r}) (both factors finite measures), applied to the indicator 1A\mathbf{1}_{A}, the section s↦1A(s,r)s\mapsto\mathbf{1}_{A}(s,r) is B[0,T]\mathcal{B}_{[0,T]}-measurable, i.e. {s:ai(s,r)∈E}∈B[0,T]\{s:\mathsf{a}^{i}(s,r)\in E\}\in\mathcal{B}_{[0,T]}. Hence s↦a(s,r)s\mapsto\mathsf{a}(s,r) is a control path.

Reduction to stopped clocks. Fix t0∈[0,T]t_0\in[0,T] and put u0=NBt0u_0=NBt_0. Let P~uc=Pmin⁡(u,u0)c\tilde{\mathsf{P}}^{c}_u=\mathsf{P}^{c}_{\min(u,u_0)}; every path of P~c\tilde{\mathsf{P}}^{c} is a counting path (it is Pc(ω)\mathsf{P}^{c}(\omega) frozen after level u0u_0), P~uc\tilde{\mathsf{P}}^{c}_u is Ht0\mathcal{H}_{t_0}-measurable for every u≥0u\ge0, and P~c\tilde{\mathsf{P}}^{c} agrees with Pc\mathsf{P}^{c} on [0,u0][0,u_0]. By Step 3, the recursion for (P~(ω),a(⋅,r),x0)(\tilde{\mathsf{P}}(\omega),\mathsf{a}(\cdot,r),x_0) produces the same θk\theta_k, x(k)x^{(k)}, κkc\kappa^{c}_k as the recursion for (P(ω),a(⋅,r),x0)(\mathsf{P}(\omega),\mathsf{a}(\cdot,r),x_0) at all steps with θk≤t0\theta_k\le t_0, the same recursion path on [0,t0][0,t_0], and the same recursion consumed times on [0,t0][0,t_0]; since these consumed times are at most u0u_0, the recursion counters on [0,t0][0,t_0] also agree. It therefore suffices to prove: if E⊆F\mathcal{E}\subseteq\mathcal{F} is a σ\sigma-algebra such that Quc\mathsf{Q}^{c}_u is E\mathcal{E}-measurable for every u≥0u\ge0 and every label, where Q=(Qc)\mathsf{Q}=(\mathsf{Q}^{c}) is any family of processes with counting paths, then all quantities of the recursion for (Q(ω),a(⋅,r),x0)(\mathsf{Q}(\omega),\mathsf{a}(\cdot,r),x_0), including the set of conflict-free pairs and, for every tt, the recursion path, consumed times and counters at time tt, are R⊗E\mathcal{R}\otimes\mathcal{E}-measurable functions of (r,ω)(r,\omega), and the recursion path, consumed times and counters are B[0,T]⊗(R⊗E)\mathcal{B}_{[0,T]}\otimes(\mathcal{R}\otimes\mathcal{E})-measurable functions of (t,r,ω)(t,r,\omega), and to apply this with Q=P~\mathsf{Q}=\tilde{\mathsf{P}} and E=Ht0\mathcal{E}=\mathcal{H}_{t_0} (for the statements at time t=t0t=t_0), with Q=P\mathsf{Q}=\mathsf{P} stopped at level NBTNBT and E=HT\mathcal{E}=\mathcal{H}_T (for G\mathsf{G}), and with Q=P\mathsf{Q}=\mathsf{P} and E=F\mathcal{E}=\mathcal{F} (for the joint measurability in (t,r,ω)(t,r,\omega)). Here measurability of a map with values in [0,+∞][0,+\infty] or in a finite subset of Rl\mathbb{R}^l means measurability of the sets {⋅≤u}\{\cdot\le u\} for real uu, respectively of the level sets; for a real-valued map this is measurability with respect to B(R)\mathcal{B}(\mathbb{R}) by Generator Criterion for Measurability, the intervals (−∞,u](-\infty,u] generating B(R)\mathcal{B}(\mathbb{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 NBTNBT. We write M=R⊗E\mathcal{M}=\mathcal{R}\otimes\mathcal{E}, fix a point r0∈Rr_0\in\mathsf{R} (nonempty by hypothesis), and let ptr0⊗P∣E\mathrm{pt}_{r_0}\otimes P|_{\mathcal{E}} be the product measure on M\mathcal{M} of the probability measures ptr0\mathrm{pt}_{r_0} (defined above) and the restriction of PP to E\mathcal{E}, so that Tonelli and Fubini Theorems is available on ([0,T]×(R×Ω),B[0,T]⊗M,λ[0,T]⊗(ptr0⊗P∣E))([0,T]\times(\mathsf{R}\times\Omega),\mathcal{B}_{[0,T]}\otimes\mathcal{M},\lambda_{[0,T]}\otimes(\mathrm{pt}_{r_0}\otimes P|_{\mathcal{E}})), all measures involved being finite.

Jump times of the clocks. For a label cc and j≥1j\ge1, {τj(Qc)≤u}={Quc≥j}∈E\{\tau_j(\mathsf{Q}^{c})\le u\}=\{\mathsf{Q}^{c}_u\ge j\}\in\mathcal{E} for u≥0u\ge0 by (P1), so ω↦τj(Qc(ω))\omega\mapsto\tau_j(\mathsf{Q}^{c}(\omega)) is E\mathcal{E}-measurable; and for a M\mathcal{M}-measurable w:R×Ω→[0,∞)w:\mathsf{R}\times\Omega\to[0,\infty), {Qwc≥j}={τj(Qc)≤w}=⋂n≥1⋃q∈Q, q≥0({τj(Qc)≤q}∩{q<w+1/n})\{\mathsf{Q}^{c}_{w}\ge j\}=\{\tau_j(\mathsf{Q}^{c})\le w\}=\bigcap_{n\ge1}\bigcup_{q\in\mathbb{Q},\,q\ge0}\bigl(\{\tau_j(\mathsf{Q}^{c})\le q\}\cap\{q<w+1/n\}\bigr) is in M\mathcal{M} as a countable intersection of countable unions (if τj≤w\tau_j\le w, every nn admits, by density, a rational q∈[τj,w+1/n)q\in[\tau_j,w+1/n), which is ≥0\ge0; conversely the right side forces τj<w+1/n\tau_j<w+1/n for all nn); hence (r,ω)↦Qw(r,ω)c(ω)(r,\omega)\mapsto\mathsf{Q}^{c}_{w(r,\omega)}(\omega) is M\mathcal{M}-measurable. More generally, for M\mathcal{M}-measurable f,g:R×Ω→[0,+∞]f,g:\mathsf{R}\times\Omega\to[0,+\infty] the set {f≤g}=⋂n≥1(⋃q∈Q({f≤q}∩{q<g+1/n})∪{g=+∞})\{f\le g\}=\bigcap_{n\ge1}\Bigl(\bigcup_{q\in\mathbb{Q}}\bigl(\{f\le q\}\cap\{q<g+1/n\}\bigr)\cup\{g=+\infty\}\Bigr) is in M\mathcal{M} by the same argument (density of Q\mathbb{Q} in the interval [f,g+1/n)[f,g+1/n) when f≤g<+∞f\le g<+\infty); we use this comparison principle below without further comment.

Induction. Extend the recursion beyond its stopping index by freezing: θk=θK\theta_k=\theta_K, x(k)=x(K)x^{(k)}=x^{(K)}, κkc=κKc\kappa^{c}_k=\kappa^{c}_K for k>Kk>K. We prove by induction on kk that θk\theta_k, x(k)x^{(k)} (with values in the finite set {y∈Rl:Nyγ∈{−lk,…,N+lk} ∀γ}\{y\in\mathbb{R}^l:Ny^{\gamma}\in\{-lk,\dots,N+lk\}\ \forall\gamma\}) and κkc\kappa^{c}_k are M\mathcal{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}A_k=\{(r,\omega):\text{the recursion has not stopped at or before step }k\}=\bigcap_{i\le k}\{\theta_i<T\}\cap\{x^{(i)}\in\mathbb{G}_N\}. This is clear for k=0k=0. Given it for kk, fix t∈[0,T]t\in[0,T] and c=(σ,γ)c=(\sigma,\gamma) and consider, for each of the finitely many x∈GNx\in\mathbb{G}_N, the function (s,r,ω)↦1{s>θk(r,ω)} Nxσβ(σ,γ,x,a(s,r))(s,r,\omega)\mapsto\mathbf{1}\{s>\theta_k(r,\omega)\}\,N x^{\sigma}\beta(\sigma,\gamma,x,\mathsf{a}(s,r)) on [0,T]×R×Ω[0,T]\times\mathsf{R}\times\Omega: the indicator is that of the set where the B[0,T]⊗M\mathcal{B}_{[0,T]}\otimes\mathcal{M}-measurable map (s,r,ω)↦s−θk(r,ω)(s,r,\omega)\mapsto s-\theta_k(r,\omega) 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,⋅)\beta(\sigma,\gamma,x,\cdot) on A\mathcal{A} and the map (s,r,ω)↦a(s,r)(s,r,\omega)\mapsto\mathsf{a}(s,r), whose components are measurable because they are compositions of the components of a\mathsf{a} with the projection (s,r,ω)↦(s,r)(s,r,\omega)\mapsto(s,r), which is measurable from B[0,T]⊗M\mathcal{B}_{[0,T]}\otimes\mathcal{M} to B[0,T]⊗R\mathcal{B}_{[0,T]}\otimes\mathcal{R} by the generator criterion of Generator Criterion for Measurability, since preimages of measurable rectangles are measurable rectangles and these generate the product σ\sigma-algebra by Product Sigma-Algebra. By Tonelli and Fubini Theorems the partial integral over s∈[0,t]s\in[0,t] (multiply by 1[0,t](s)\mathbf{1}_{[0,t]}(s)) is an M\mathcal{M}-measurable function of (r,ω)(r,\omega), and on AkA_k one has Ctc,(k)=∑x∈GN1{x(k)=x}(κkc+that partial integral)\mathsf{C}^{c,(k)}_t=\sum_{x\in\mathbb{G}_N}\mathbf{1}\{x^{(k)}=x\}\bigl(\kappa^{c}_k+\text{that partial integral}\bigr); thus (r,ω)↦1AkCtc,(k)(r,\omega)\mapsto\mathbf{1}_{A_k}\mathsf{C}^{c,(k)}_t is M\mathcal{M}-measurable for every tt. Next, on AkA_k, λkc\lambda^{c}_k is M\mathcal{M}-measurable: for u≥0u\ge0, {λkc≤u}∩Ak=⋃j≥1{Qκkcc=j−1}∩{τj(Qc)≤u}∩Ak\{\lambda^{c}_k\le u\}\cap A_k=\bigcup_{j\ge1}\{\mathsf{Q}^{c}_{\kappa^{c}_k}=j-1\}\cap\{\tau_j(\mathsf{Q}^{c})\le u\}\cap A_k, all sets on the right being in M\mathcal{M} by the paragraph on jump times. By (1.1), for u∈[0,T]u\in[0,T], {hkc≤u}∩Ak={u≥θk}∩{λkc≤Cuc,(k)}∩Ak∈M\{h^{c}_k\le u\}\cap A_k=\{u\ge\theta_k\}\cap\{\lambda^{c}_k\le\mathsf{C}^{c,(k)}_u\}\cap A_k\in\mathcal{M} (comparison principle), so θk+1=min⁡(T,min⁡chkc)\theta_{k+1}=\min(T,\min_c h^{c}_k) is M\mathcal{M}-measurable on AkA_k: {θk+1≤u}∩Ak=Ak∩({u≥T}∪⋃c{hkc≤u})\{\theta_{k+1}\le u\}\cap A_k=A_k\cap(\{u\ge T\}\cup\bigcup_c\{h^{c}_k\le u\}). Likewise {c∈Jk}∩Ak={hkc≤θk+1}∩Ak\{c\in\mathcal{J}_k\}\cap A_k=\{h^{c}_k\le\theta_{k+1}\}\cap A_k (by (1.1) at u=θk+1u=\theta_{k+1}) is in M\mathcal{M} by the comparison principle, so x(k+1)=x(k)+1N∑c1{c∈Jk}vcx^{(k+1)}=x^{(k)}+\frac1N\sum_c\mathbf{1}\{c\in\mathcal{J}_k\}v_c is M\mathcal{M}-measurable on AkA_k. Finally, on AkA_k, κ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)\kappa^{c}_{k+1}=\mathsf{C}^{c,(k)}_{\theta_{k+1}}=\sum_{x\in\mathbb{G}_N}\mathbf{1}\{x^{(k)}=x\}\bigl(\kappa^{c}_k+\int_{[0,T]}\mathbf{1}\{\theta_k<s\le\theta_{k+1}\}Nx^{\sigma}\beta(\sigma,\gamma,x,\mathsf{a}(s,r))\,ds\bigr) is measurable by the same Tonelli argument with the jointly measurable indicator of {(s,r,ω):θk(r,ω)<s≤θk+1(r,ω)}\{(s,r,\omega):\theta_k(r,\omega)<s\le\theta_{k+1}(r,\omega)\}. Off AkA_k the frozen values are those of an earlier step, measurable by the inductive hypothesis, and Ak∈MA_k\in\mathcal{M}, so the maps are measurable on the partition {Ak,Akc}\{A_k,A_k^{\mathrm{c}}\}. Hence θk+1\theta_{k+1}, x(k+1)x^{(k+1)}, κk+1c\kappa^{c}_{k+1} and Ak+1=Ak∩{θk+1<T}∩{x(k+1)∈GN}A_{k+1}=A_k\cap\{\theta_{k+1}<T\}\cap\{x^{(k+1)}\in\mathbb{G}_N\} are M\mathcal{M}-measurable, completing the induction. The stopping index satisfies {K=k}=Ak−1∖Ak\{K=k\}=A_{k-1}\setminus A_k (with A−1=R×ΩA_{-1}=\mathsf{R}\times\Omega), so KK is M\mathcal{M}-measurable, and G=⋃k{K=k}∩{θk=T}∩{x(k)∈GN}∈M\mathsf{G}=\bigcup_k\{K=k\}\cap\{\theta_k=T\}\cap\{x^{(k)}\in\mathbb{G}_N\}\in\mathcal{M}; applied with E=HT\mathcal{E}=\mathcal{H}_T and the clocks stopped at level NBTNBT (which by Step 3 with t=Tt=T give the same recursion), this proves G∈R⊗HT\mathsf{G}\in\mathcal{R}\otimes\mathcal{H}_T.

The recursion path, consumed times and counters. For t∈[0,T]t\in[0,T] and a Borel set E⊆RE\subseteq\mathbb{R},

{Σtr,γ∈E}=⋃k≥0({K>k}∩{θk≤t<θk+1}∩{x(k),γ∈E})∪⋃k≥0({K=k}∩{θk≤t}∩{x(k),γ∈E})∈M,\{\Sigma^{r,\gamma}_t\in E\}=\bigcup_{k\ge0}\Bigl(\{K>k\}\cap\{\theta_k\le t<\theta_{k+1}\}\cap\{x^{(k),\gamma}\in E\}\Bigr)\cup\bigcup_{k\ge0}\Bigl(\{K=k\}\cap\{\theta_k\le t\}\cap\{x^{(k),\gamma}\in E\}\Bigr)\in\mathcal{M},

and the same display with tt regarded as a variable exhibits {(t,r,ω):Σtr,γ(ω)∈E}\{(t,r,\omega):\Sigma^{r,\gamma}_t(\omega)\in E\} as a countable union of sets in B[0,T]⊗M\mathcal{B}_{[0,T]}\otimes\mathcal{M} (each {(t,r,ω):θk(r,ω)≤t<θk+1(r,ω)}\{(t,r,\omega):\theta_k(r,\omega)\le t<\theta_{k+1}(r,\omega)\} being measurable, as above). For the recursion consumed times, on {K>k}∩{θk≤t<θk+1}\{K>k\}\cap\{\theta_k\le t<\theta_{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)\mathsf{C}^{r,c}_t=\mathsf{C}^{c,(k)}_t=\sum_{x}\mathbf{1}\{x^{(k)}=x\}\bigl(\kappa^{c}_k+\int_{[0,T]}\mathbf{1}\{\theta_k<s\le t\}Nx^{\sigma}\beta(\sigma,\gamma,x,\mathsf{a}(s,r))\,ds\bigr), and on {K=k}∩{θk≤t}\{K=k\}\cap\{\theta_k\le t\} one has Ctr,c=κkc\mathsf{C}^{r,c}_t=\kappa^{c}_k; the integrand (s,(t,r,ω))↦1{θk(r,ω)<s≤t} Nxσβ(σ,γ,x,a(s,r))(s,(t,r,\omega))\mapsto\mathbf{1}\{\theta_k(r,\omega)<s\le t\}\,Nx^{\sigma}\beta(\sigma,\gamma,x,\mathsf{a}(s,r)) is measurable on [0,T]×([0,T]×R×Ω)[0,T]\times([0,T]\times\mathsf{R}\times\Omega), so by Tonelli and Fubini Theorems (with the finite product measure λ[0,T]⊗(λ[0,T]⊗(ptr0⊗P∣E))\lambda_{[0,T]}\otimes(\lambda_{[0,T]}\otimes(\mathrm{pt}_{r_0}\otimes P|_{\mathcal{E}})) on B[0,T]⊗(B[0,T]⊗M)\mathcal{B}_{[0,T]}\otimes(\mathcal{B}_{[0,T]}\otimes\mathcal{M})) the integral is a measurable function of (t,r,ω)(t,r,\omega), and a fortiori of (r,ω)(r,\omega) for fixed tt; piecing together over the measurable sets above gives measurability of Ctr,c\mathsf{C}^{r,c}_t in (r,ω)(r,\omega) and jointly in (t,r,ω)(t,r,\omega). Finally {Ntr,c≥j}={τj(Qc)≤Ctr,c}\{\mathsf{N}^{r,c}_t\ge j\}=\{\tau_j(\mathsf{Q}^{c})\le\mathsf{C}^{r,c}_t\} by (P1), which is measurable in (r,ω)(r,\omega) and in (t,r,ω)(t,r,\omega) by the comparison principle, since τj(Qc)\tau_j(\mathsf{Q}^{c}) and Ctr,c\mathsf{C}^{r,c}_t are; as Ntr,c\mathsf{N}^{r,c}_t takes values in N0\mathbb{N}_0, this gives its measurability. For the joint measurability in (t,r,ω)(t,r,\omega) we apply the above with E=F\mathcal{E}=\mathcal{F} and Q=P\mathsf{Q}=\mathsf{P} (no stopping), which is legitimate since the induction used only E\mathcal{E}-measurability of the clock variables; for the R⊗Ht0\mathcal{R}\otimes\mathcal{H}_{t_0}-measurability at a fixed time t0t_0 we apply it with Q=P~\mathsf{Q}=\tilde{\mathsf{P}}, E=Ht0\mathcal{E}=\mathcal{H}_{t_0} and t=t0t=t_0, 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}\mathsf{R}=\{r\}, conflict-free data for every ω\omega) is claim 2 applied at each ω\omega together with the R⊗Ht\mathcal{R}\otimes\mathcal{H}_t-measurability just proved, from which the Ht\mathcal{H}_t-measurability of ω↦Σtr,γ(ω)\omega\mapsto\Sigma^{r,\gamma}_t(\omega) follows by the section clause of Tonelli and Fubini Theorems (applied to ptr⊗P∣Ht\mathrm{pt}_{r}\otimes P|_{\mathcal{H}_t} and the indicator of {Σtr,γ∈E}\{\Sigma^{r,\gamma}_t\in E\} for Borel EE).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…