Adopt the setting and notation of Open-Loop Aggregate Solution Driven by Aggregate Transition Clocks and Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution: natural numbers N≥1, l≥2, m≥1, a nonempty subset A of Euclidean space Rm, real numbers B≥0 and T>0, a transition-rate family β on l states with control set A and rate bound B, the aggregate lattice GN (a finite subset of the probability simplex Δl), the transition labels c, clock families of counting paths, control paths, and, for data (p,a,x0), the recursion with its stopping index K, times 0=θ0<θ1<⋯<θK≤T, points x(0),…,x(K), recursion path Σrec, and the notion of conflict-free data. Let l~≥1 be a natural number, let β~ be an observation-rate family on l states with l~ observation channels and rate bound B~ (a real number with B~≥0), let b~=(b~υ)υ=1l~ be its aggregate observation drift, and put b~tot=∑υ=1l~b~υ on Δl. Let (R,R,ρ)=(R(T,l~),R(T,l~),ρ(T,l~)) be the observation record space with horizon T and l~ channels, records written r=(k,t,v) with t=(t1,…,tk) and v=(v1,…,vk), with cells C∅ and Ck,v and with R(k) the set of records with exactly k events; let πs− (s∈[0,T]) be the strict prefix maps. Let h=(hk)k≥0 be an observation-driven control policy with horizon T, control dimension m, and l~ channels, all of whose members take values in A, and for r∈R let ar be its record-frozen control path at r, with event count kr. Let (Ω,F,P) be a probability space carrying a family P=(Pc), indexed by the transition labels, of stochastic processes Pc=(Puc)u≥0 all of whose paths are counting paths, write P(ω) for the clock family (u↦Puc(ω)), and let Ht (t∈[0,T]) be the σ-algebra generated by the variables Puc with u∈[0,NBt] and c ranging over all labels, as in claim 4 of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution. Fix x0∈GN.
Write B[0,T] for the trace Borel σ-algebra on [0,T], ∫[0,T]⋅ds for the Lebesgue integral over the compact interval [0,T], B(R) for the Borel σ-algebra of the real line, ⊗ for the product σ-algebra, and exp for the real exponential function; measurability of real-valued maps is always with respect to B(R) on the target. Coordinates of points of Rl carry superscripts, x=(x1,…,xl).
1. (Joint measurability of the record-frozen control) Each component of the map a:[0,T]×R→A, a(s,r)=ar(s), is measurable with respect to B[0,T]⊗R. Consequently claim 4 of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution applies with (R,R)=(R,R); for r∈R and ω∈Ω write Σtr(ω) for the recursion path of the data (P(ω),ar,x0), and G∈R⊗HT for the set of pairs (r,ω) whose data are conflict-free.
2. (Regularised recursion path and its left limits) For r∈R, ω∈Ω and t∈[0,T] put Σˉtr(ω)=Σtr(ω) if Σtr(ω)∈GN and Σˉtr(ω)=x0 otherwise. Then, for every (r,ω), with K and θ0,…,θK those of the recursion for (P(ω),ar,x0):
(a) Σˉtr(ω)∈GN for every t; the map t↦Σˉtr(ω) is constant on [θk,θk+1) for each k<K and constant on [θK,T], and it coincides with Σr(ω) on [0,θK);
(b) for every t∈(0,T] there is exactly one point Σˉt−r(ω)∈GN, the left limit, for which there is a real number δ>0 such that Σˉsr(ω)=Σˉt−r(ω) for all s∈[t−δ,t)∩[0,T]; put Σˉ0−r(ω)=x0; the set of t∈[0,T] with Σˉt−r(ω)=Σˉtr(ω) is contained in {θ1,…,θK};
(c) if (r,ω)∈G, then Σˉtr(ω)=Σtr(ω) for every t, and t↦Σtr(ω) is the unique open-loop aggregate solution on [0,T] for the data (P(ω),ar,x0);
(d) for every γ∈{1,…,l} the maps (t,r,ω)↦Σˉtr,γ(ω) and (t,r,ω)↦Σˉt−r,γ(ω) on [0,T]×R×Ω are measurable with respect to B[0,T]⊗(R⊗F), and for every fixed ω∈Ω the maps (t,r)↦Σˉtr,γ(ω) and (t,r)↦Σˉt−r,γ(ω) on [0,T]×R are measurable with respect to B[0,T]⊗R.
3. (The record-driven intensity is causal) For ω∈Ω, υ∈{1,…,l~}, t∈[0,T] and r∈R put
λtω,υ(r)=Nb~υ(Σˉt−r(ω)).
Then for every ω the family λω=(λω,υ)υ is a causal intensity on R with bound NB~, whose total intensity is λtω,tot(r)=Nb~tot(Σˉt−r(ω)). The non-anticipation rests on the following identity: for every t∈[0,T], every r∈R and every ω,
Σˉuπt−(r)(ω)=Σˉur(ω)for all u∈[0,t),henceΣˉt−πt−(r)(ω)=Σˉt−r(ω).
If moreover b≥0 is a real number with b~υ(x)≥b for all x∈Δl and all υ, then λtω,υ(r)≥Nb for all ω,υ,t,r.
4. (The record-driven likelihood) Let ℓω=ℓλω be the likelihood of λω. Then the map (r,ω)↦ℓω(r) on R×Ω is measurable with respect to R⊗F; 0≤ℓω(r)≤(NB~)k for r∈R(k) (with (NB~)0=1); ∫Rℓωdρ=1 for every ω∈Ω; and for every (r,ω)∈G with r=(k,t,v),
ℓω(r)=(∏i=1kNb~vi(Σti−r(ω)))exp(−N∫[0,T]b~tot(Σsr(ω))ds),
where Σr(ω) is the open-loop aggregate solution of claim 2(c), Σti−r(ω)=Σˉti−r(ω) its left limit, and the finite product is 1 when k=0.