TheoremBase

Proof of Almost Sure Tracking on the Synthetic Copy: Jump Times of the Deterministic-Count Clocks, Almost Sure Conflict-Freeness of Every Record, Almost Sure Null Mass of the Untracked Records, and Trimming an Event to the Tracked Set

lemmalem:copy-tracked-records-almost-sure-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Proof of lem:copy-tracked-records-almost-sure-2026a (P6.1b): ties pin a driving point to a measurable functional of the other driving variables (deleted clocks + ties lemma), independence-Fubini with the uniform law kills the event; Tonelli and Markov for the rho-null statement.

Proof

Throughout, "measurable" for a real-valued map on a measurable space means measurable with respect to the given σ\sigma-algebra and the Borel σ\sigma-algebra B(R)\mathcal{B}(\mathbb{R}) of the real line, and for a [0,][0,\infty]-valued map it is the notion of Lebesgue Integral of a Nonnegative Measurable Function (for real-valued maps the two agree, as stated there); integrals of [0,][0,\infty]-valued measurable maps are those of Lebesgue Integral of a Nonnegative Measurable Function, and for the indicator 1A\mathbf{1}_A of a measurable set AA the integral is the measure of AA, since 1A\mathbf{1}_A is a nonnegative simple function with that integral. We use claims 1 to 5 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions for measurability of constants, indicators, sums, products, minima and pointwise limits, and claims 2 and 4 of Basic Properties of a Measure for monotonicity and countable subadditivity of measures (a finite union being a sequence padded with the empty set). The recursion and its quantities θk\theta_k, x(k)x^{(k)}, KK, κkc\kappa^{c}_k, Cc,(k)\mathsf{C}^{c,(k)}, λkc\lambda^{c}_k, Jk\mathcal{J}_k and Crec,c\mathsf{C}^{\mathrm{rec},c} are those of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution (undecorated KK is the recursion stopping index; the decorated KcK^{c} are the Poisson driving variables and K\mathsf{K} is the cell-count vector), and ties are those of Ties in the Aggregate Recursion: Consumed Levels and First Hitting Times, Conflict-Freeness in the Absence of Ties, and the Point-Deletion Identity. Generic Borel sets are written BB', the letter BB being the rate bound. Write λ\lambda for Lebesgue measure on R\mathbb{R} (undecorated λ\lambda always means Lebesgue measure; the decorated λkc\lambda^{c}_k are the next jump levels of the recursion and are unrelated to it) and #S\#S for the number of elements of a finite set SS. Whenever G\mathcal{G} is a sub-σ\sigma-algebra of F\mathcal{F}, the restriction PGP|_{\mathcal{G}} of PP to G\mathcal{G} is a probability measure on (Ω,G)(\Omega,\mathcal{G}) (countable additivity on disjoint sequences in G\mathcal{G} and PG(Ω)=1P|_{\mathcal{G}}(\Omega)=1 are inherited from PP), and PG(A)=P(A)P|_{\mathcal{G}}(A)=P(A) for AGA\in\mathcal{G}.

Step 0 (finite point configurations). Let MN0M\in\mathbb{N}_0 and let u1,,uM>0u_1,\dots,u_M>0 be pairwise distinct real numbers; put q(t)=a=1M1{uat}=#{a:uat}q(t)=\sum_{a=1}^{M}\mathbf{1}\{u_a\le t\}=\#\{a:u_a\le t\} for t0t\ge0 (the zero function when M=0M=0). We show: (a) qq is a counting path and q(t)=#{a:ua<t}q(t-)=\#\{a:u_a<t\} for every t>0t>0; (b) the jump times of qq are exactly u1,,uMu_1,\dots,u_M; (c) if n1n\ge1 is a natural number with τn(q)<+\tau_n(q)<+\infty, then τn(q)\tau_n(q) is a jump time of qq, hence equals one of the uau_a.

The values of qq lie in {0,,M}\{0,\dots,M\} and q(0)=0q(0)=0 since every ua>0u_a>0; qq is nondecreasing since {a:uas}{a:uat}\{a:u_a\le s\}\subseteq\{a:u_a\le t\} for sts\le t. Fix t0t\ge0 and choose ϵ>0\epsilon>0 smaller than every uatu_a-t with ua>tu_a>t (ϵ=1\epsilon=1 if there is no such aa); for s(t,t+ϵ)s\in(t,t+\epsilon) we have {a:uas}={a:uat}\{a:u_a\le s\}=\{a:u_a\le t\}, so q(s)=q(t)q(s)=q(t), and together with q(s)q(t)q(s)\ge q(t) for all s>ts>t this shows that q(t)q(t) is the greatest lower bound of {q(s):s>t}\{q(s):s>t\}: condition 3 of Counting Path and Its Jump Times. Now let t>0t>0 and q=#{a:ua<t}q^{-}=\#\{a:u_a<t\}. For 0s<t0\le s<t, {a:uas}{a:ua<t}\{a:u_a\le s\}\subseteq\{a:u_a<t\}, so q(s)qq(s)\le q^{-}; and taking s=0s=0 if no uau_a satisfies ua<tu_a<t, and otherwise ss the largest uau_a with ua<tu_a<t (in both cases s[0,t)s\in[0,t)), we get q(s)=qq(s)=q^{-}. Hence the least upper bound q(t)q(t-) of {q(s):0s<t}\{q(s):0\le s<t\} equals qq^{-}, and q(t)q(t)=#{a:ua=t}1q(t)-q(t-)=\#\{a:u_a=t\}\le1 by distinctness; also q(0)q(0)=0q(0)-q(0-)=0. So qq is a counting path, (a) holds, and q(t)>q(t)q(t)>q(t-) holds exactly when t=uat=u_a for some aa, which is (b). For (c), let t0=τn(q)<+t_0=\tau_n(q)<+\infty, the greatest lower bound of the nonempty set S={t0:q(t)n}S=\{t\ge0:q(t)\ge n\}. If s>t0s>t_0, then ss is not a lower bound of SS, so some tSt\in S satisfies t<st<s, and q(s)q(t)nq(s)\ge q(t)\ge n; by condition 3, q(t0)q(t_0) is the greatest lower bound of {q(s):s>t0}\{q(s):s>t_0\}, so q(t0)nq(t_0)\ge n. Since q(0)=0<nq(0)=0<n we have t00t_0\neq0, so t0>0t_0>0. For 0s<t00\le s<t_0 we have sSs\notin S, so q(s)n1q(s)\le n-1 (q(s)q(s) being an integer below nn), whence q(t0)n1<nq(t0)q(t_0-)\le n-1<n\le q(t_0): t0t_0 is a jump time, and by (b) it is one of the uau_a.

Step 1 (claim 1). Let ωΩ0U\omega\in\Omega^{U}_0, yN0Ly\in\mathbb{N}_0^{\mathsf{L}} and cc a label. Since ωΩ0U\omega\in\Omega^{U}_0, the factor 1Ω0U(ω)\mathbf{1}_{\Omega^{U}_0}(\omega) in the definition of the deterministic-count clocks in The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record equals 11, so Pu(y),c(ω)=j=1Jci=1yc,j1{Uic,j(ω)u}\mathsf{P}^{(y),c}_u(\omega)=\sum_{j=1}^{J_c}\sum_{i=1}^{y_{c,j}}\mathbf{1}\{U^{c,j}_i(\omega)\le u\} for u0u\ge0; and on Ω0U\Omega^{U}_0 the points Uic,j(ω)U^{c,j}_i(\omega) (1jJc1\le j\le J_c, 1iyc,j1\le i\le y_{c,j}) are pairwise distinct and lie in Ic,j(0,R]I_{c,j}\subseteq(0,R], so are positive. Thus uPu(y),c(ω)u\mapsto\mathsf{P}^{(y),c}_u(\omega) is the path qq of Step 0 for these finitely many points, and claim 1 is (b) and (c) of Step 0.

Step 2 (measurability of the bad sets). Fix yN0Ly\in\mathbb{N}_0^{\mathsf{L}}. By claim 3 of The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record, The Record-Driven Causal Intensity of the Open-Loop Aggregate Solution: Joint Measurability of the Record-Frozen Control, the Regularised Recursion Path, Non-Anticipation, and Measurability of the Likelihood applies to the probability space (Ω,U,PU)(\Omega,\mathcal{U},P|_{\mathcal{U}}) with the clocks P(y)\mathsf{P}^{(y)}, and its claim 1 gives G(y)RHT(y)\mathsf{G}^{(y)}\in\mathcal{R}\otimes\mathcal{H}^{(y)}_T, where HT(y)\mathcal{H}^{(y)}_T is the σ\sigma-algebra generated by the variables Pu(y),c\mathsf{P}^{(y),c}_u, u[0,NBT]u\in[0,NBT]; these variables are U\mathcal{U}-measurable (claim 2 of The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record), so their preimages of Borel sets lie in the σ\sigma-algebra U\mathcal{U} and HT(y)U\mathcal{H}^{(y)}_T\subseteq\mathcal{U}. Every measurable rectangle of RHT(y)\mathcal{R}\otimes\mathcal{H}^{(y)}_T is a measurable rectangle of RU\mathcal{R}\otimes\mathcal{U} (Product Sigma-Algebra), and RU\mathcal{R}\otimes\mathcal{U} is a σ\sigma-algebra containing them, so RHT(y)RU\mathcal{R}\otimes\mathcal{H}^{(y)}_T\subseteq\mathcal{R}\otimes\mathcal{U} and G(y)RU\mathsf{G}^{(y)}\in\mathcal{R}\otimes\mathcal{U}. Hence fy=1(R×Ω)G(y)f_y=\mathbf{1}_{(\mathbf{R}\times\Omega)\setminus\mathsf{G}^{(y)}} is an RU\mathcal{R}\otimes\mathcal{U}-measurable map into [0,][0,\infty]. The measure spaces (R,R,ρ)(\mathbf{R},\mathcal{R},\rho) and (Ω,U,PU)(\Omega,\mathcal{U},P|_{\mathcal{U}}) are σ\sigma-finite (ρ\rho by The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record, PP being finite), so the section statement of Tonelli and Fubini Theorems applies to fyf_y: for every rRr\in\mathbf{R} the map ωfy(r,ω)=1Ωr,y(ω)\omega\mapsto f_y(r,\omega)=\mathbf{1}_{\Omega^{r,y}}(\omega) is U\mathcal{U}-measurable, so Ωr,y={ω:fy(r,ω)>0}U\Omega^{r,y}=\{\omega:f_y(r,\omega)>0\}\in\mathcal{U}; and for every ωΩ\omega\in\Omega the map rfy(r,ω)=1Bω(y)(r)r\mapsto f_y(r,\omega)=\mathbf{1}_{B^{(y)}_\omega}(r) is R\mathcal{R}-measurable, so Bω(y)RB^{(y)}_\omega\in\mathcal{R}. This proves the first assertions of claims 2 and 3.

Step 3 (the deleted clocks and the hitting functional). Fix yN0Ly\in\mathbb{N}_0^{\mathsf{L}} and rRr\in\mathbf{R}. Call a pair (ι,ι)(\iota,\iota') of triples ι=(c0,j,i)\iota=(c_0,j,i), ι=(c,j,i)\iota'=(c',j',i') admissible if c0c_0 and cc' are distinct labels, 1jJc01\le j\le J_{c_0}, 1iyc0,j1\le i\le y_{c_0,j}, 1jJc1\le j'\le J_{c'} and 1iyc,j1\le i'\le y_{c',j'}; there are finitely many admissible pairs. Fix one. Every object introduced in this step depends on (y,r,ι,ι)(y,r,\iota,\iota'); this dependence is suppressed in the notation except where it is displayed. Let Gι\mathcal{G}_\iota be the σ\sigma-algebra generated by the family of all driving variables other than Uic0,jU^{c_0,j}_i (a sub-σ\sigma-algebra of F\mathcal{F}). Let Ω~ι\tilde\Omega_\iota be the complement of the union of the countably many events {Ua1c,j1=Ua2c,j2}\{U^{c,j_1}_{a_1}=U^{c,j_2}_{a_2}\}, with cc a label, j1,j2{1,,Jc}j_1,j_2\in\{1,\dots,J_c\}, a1,a2Na_1,a_2\in\mathbb{N}, (j1,a1)(j2,a2)(j_1,a_1)\neq(j_2,a_2) and neither (c,j1,a1)(c,j_1,a_1) nor (c,j2,a2)(c,j_2,a_2) equal to ι\iota, and {Ua1c,j1Ic,j1}\{U^{c,j_1}_{a_1}\notin I_{c,j_1}\} with cc a label, j1{1,,Jc}j_1\in\{1,\dots,J_c\}, a1Na_1\in\mathbb{N} and (c,j1,a1)ι(c,j_1,a_1)\neq\iota. Each of these events lies in Gι\mathcal{G}_\iota: the first kind is the preimage of the Borel set {0}\{0\} under the Gι\mathcal{G}_\iota-measurable difference of two Gι\mathcal{G}_\iota-measurable variables, the second is the preimage of the Borel set RIc,j1\mathbb{R}\setminus I_{c,j_1}. Hence Ω~ιGι\tilde\Omega_\iota\in\mathcal{G}_\iota; and Ω0UΩ~ι\Omega^{U}_0\subseteq\tilde\Omega_\iota, since the conditions defining Ω~ι\tilde\Omega_\iota are among those defining Ω0U\Omega^{U}_0. For every label cc and u0u\ge0 put Quc=1Ω~ιj=1Jca=1yc,j1{(c,j,a)ι}1{Uac,ju},\mathsf{Q}^{c}_u=\mathbf{1}_{\tilde\Omega_\iota}\sum_{j''=1}^{J_c}\sum_{a=1}^{y_{c,j''}}\mathbf{1}\{(c,j'',a)\neq\iota\}\,\mathbf{1}\{U^{c,j''}_a\le u\}, where 1{(c,j,a)ι}\mathbf{1}\{(c,j'',a)\neq\iota\} is the constant 00 or 11. Each Quc\mathsf{Q}^{c}_u is Gι\mathcal{G}_\iota-measurable (the event {Uac,ju}\{U^{c,j''}_a\le u\} is the preimage of a Borel set under a variable generating Gι\mathcal{G}_\iota whenever (c,j,a)ι(c,j'',a)\neq\iota; then use claims 1 to 3 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions). Every path uQuc(ω)u\mapsto\mathsf{Q}^{c}_u(\omega) is a counting path: for ωΩ~ι\omega\notin\tilde\Omega_\iota it is the zero function, which satisfies conditions 1 to 4 of Counting Path and Its Jump Times (all greatest lower and least upper bounds involved being 00); for ωΩ~ι\omega\in\tilde\Omega_\iota it is the path qq of Step 0 for the finitely many points Uac,j(ω)U^{c,j''}_a(\omega) with 1jJc1\le j''\le J_c, 1ayc,j1\le a\le y_{c,j''} and (c,j,a)ι(c,j'',a)\neq\iota, which are pairwise distinct and lie in Ic,j(0,R]I_{c,j''}\subseteq(0,R] by the definition of Ω~ι\tilde\Omega_\iota. Thus Q=(Qc)c\mathsf{Q}=(\mathsf{Q}^{c})_c is a family of stochastic processes on the probability space (Ω,Gι,PGι)(\Omega,\mathcal{G}_\iota,P|_{\mathcal{G}_\iota}) all of whose paths are counting paths, and we write Q(ω)\mathsf{Q}(\omega) for the clock family (uQuc(ω))c(u\mapsto\mathsf{Q}^{c}_u(\omega))_c. Moreover, for ωΩ0U\omega\in\Omega^{U}_0 (so that 1Ω0U(ω)=1Ω~ι(ω)=1\mathbf{1}_{\Omega^{U}_0}(\omega)=\mathbf{1}_{\tilde\Omega_\iota}(\omega)=1) the definition of P(y)\mathsf{P}^{(y)} gives Quc(ω)=Pu(y),c(ω) (cc0),Quc0(ω)=Pu(y),c0(ω)1{uUic0,j(ω)}(u0):\mathsf{Q}^{c}_u(\omega)=\mathsf{P}^{(y),c}_u(\omega)\ (c\neq c_0),\qquad \mathsf{Q}^{c_0}_u(\omega)=\mathsf{P}^{(y),c_0}_u(\omega)-\mathbf{1}\{u\ge U^{c_0,j}_i(\omega)\}\qquad(u\ge0): Q(ω)\mathsf{Q}(\omega) is the family obtained from P(y)(ω)\mathsf{P}^{(y)}(\omega) by deleting the jump of P(y),c0(ω)\mathsf{P}^{(y),c_0}(\omega) at Uic0,j(ω)U^{c_0,j}_i(\omega), in the sense of claim 3 of Ties in the Aggregate Recursion: Consumed Levels and First Hitting Times, Conflict-Freeness in the Absence of Ties, and the Point-Deletion Identity.

By claim 1 of The Record-Driven Causal Intensity of the Open-Loop Aggregate Solution: Joint Measurability of the Record-Frozen Control, the Regularised Recursion Path, Non-Anticipation, and Measurability of the Likelihood (available by claim 3 of The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record), each component of a(s,r)=ar(s)\mathsf{a}(s,r')=a^{r'}(s) on [0,T]×R[0,T]\times\mathbf{R} is measurable with respect to B[0,T]R\mathcal{B}_{[0,T]}\otimes\mathcal{R}. Apply claim 4 of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution on the probability space (Ω,Gι,PGι)(\Omega,\mathcal{G}_\iota,P|_{\mathcal{G}_\iota}) with the clocks Q\mathsf{Q}, the measurable space (R,R)(\mathbf{R},\mathcal{R}) (nonempty, as rRr\in\mathbf{R}) and the map a\mathsf{a}: for rRr'\in\mathbf{R} and ωΩ\omega\in\Omega run the recursion for the data (Q(ω),ar,x0)(\mathsf{Q}(\omega),a^{r'},x_0) and write CtQ,r,c(ω)\mathsf{C}^{\mathsf{Q},r',c}_t(\omega) for its recursion consumed times; then for every t[0,T]t\in[0,T] and every label cc the map (r,ω)CtQ,r,c(ω)(r',\omega)\mapsto\mathsf{C}^{\mathsf{Q},r',c}_t(\omega) is RGι\mathcal{R}\otimes\mathcal{G}_\iota-measurable. By claim 1 of Ties in the Aggregate Recursion: Consumed Levels and First Hitting Times, Conflict-Freeness in the Absence of Ties, and the Point-Deletion Identity applied to each data set (Q(ω),ar,x0)(\mathsf{Q}(\omega),a^{r'},x_0), this map is nonnegative, so the section statement of Tonelli and Fubini Theorems (for the σ\sigma-finite spaces (R,R,ρ)(\mathbf{R},\mathcal{R},\rho) and (Ω,Gι,PGι)(\Omega,\mathcal{G}_\iota,P|_{\mathcal{G}_\iota})) shows that ωCtc(ω):=CtQ,r,c(ω)\omega\mapsto\mathsf{C}^{c}_t(\omega):=\mathsf{C}^{\mathsf{Q},r,c}_t(\omega), for our fixed rr, is a Gι\mathcal{G}_\iota-measurable real-valued map, for every t[0,T]t\in[0,T] and every cc. By the same claim 1, for every ω\omega the map tCtc(ω)t\mapsto\mathsf{C}^{c}_t(\omega) is nondecreasing on [0,T][0,T] with C0c(ω)=0\mathsf{C}^{c}_0(\omega)=0 and Ctc(ω)Csc(ω)NB(ts)|\mathsf{C}^{c}_t(\omega)-\mathsf{C}^{c}_s(\omega)|\le NB(t-s) for 0stT0\le s\le t\le T.

Put W=Uic,jW=U^{c',j'}_{i'} (a symbol coined here; it is not one of the driving variables VicV^{c}_i), which is Gι\mathcal{G}_\iota-measurable because ιι\iota'\neq\iota (as cc0c'\neq c_0). For ωΩ\omega\in\Omega let t(ω)t^{*}(\omega) be the greatest lower bound of Sω={t[0,T]:Ctc(ω)W(ω)}S_\omega=\{t\in[0,T]:\mathsf{C}^{c'}_t(\omega)\ge W(\omega)\} (++\infty if SωS_\omega is empty), let tˉ(ω)=min(t(ω),T)[0,T]\bar{t}(\omega)=\min(t^{*}(\omega),T)\in[0,T], and let F(ω)=Ctˉ(ω)c0(ω).F(\omega)=\mathsf{C}^{c_0}_{\bar{t}(\omega)}(\omega).

(a) For every s[0,T]s\in[0,T], {ω:t(ω)s}={ω:Csc(ω)W(ω)}\{\omega:t^{*}(\omega)\le s\}=\{\omega:\mathsf{C}^{c'}_s(\omega)\ge W(\omega)\}. Indeed, if Csc(ω)W(ω)\mathsf{C}^{c'}_s(\omega)\ge W(\omega) then sSωs\in S_\omega and t(ω)st^{*}(\omega)\le s. Conversely let t(ω)st^{*}(\omega)\le s; then SωS_\omega is nonempty and t(ω)[0,T]t^{*}(\omega)\in[0,T]. For every ϵ>0\epsilon>0 there is tSωt\in S_\omega with t<t(ω)+ϵt<t^{*}(\omega)+\epsilon (otherwise t(ω)+ϵt^{*}(\omega)+\epsilon would be a lower bound of SωS_\omega exceeding its greatest lower bound), and tt(ω)t\ge t^{*}(\omega), so the Lipschitz bound gives Ct(ω)c(ω)Ctc(ω)NBϵW(ω)NBϵ\mathsf{C}^{c'}_{t^{*}(\omega)}(\omega)\ge\mathsf{C}^{c'}_t(\omega)-NB\epsilon\ge W(\omega)-NB\epsilon; as ϵ>0\epsilon>0 is arbitrary, Ct(ω)c(ω)W(ω)\mathsf{C}^{c'}_{t^{*}(\omega)}(\omega)\ge W(\omega), and by monotonicity Csc(ω)W(ω)\mathsf{C}^{c'}_s(\omega)\ge W(\omega). Consequently {ts}={CscW0}Gι\{t^{*}\le s\}=\{\mathsf{C}^{c'}_s-W\ge0\}\in\mathcal{G}_\iota (preimage of the Borel set [0,)[0,\infty) under a Gι\mathcal{G}_\iota-measurable difference), and {tˉs}Gι\{\bar{t}\le s\}\in\mathcal{G}_\iota for every s[0,T]s\in[0,T], this set being {ts}\{t^{*}\le s\} for s<Ts<T and Ω\Omega for s=Ts=T.

(b) FF is Gι\mathcal{G}_\iota-measurable. For nNn\in\mathbb{N} and 1kn1\le k\le n put An,k={tˉkT/n}{tˉ(k1)T/n}={tˉ((k1)T/n,kT/n]}GιA_{n,k}=\{\bar{t}\le kT/n\}\setminus\{\bar{t}\le(k-1)T/n\}=\{\bar{t}\in((k-1)T/n,kT/n]\}\in\mathcal{G}_\iota and Fn=k=1n1An,kCkT/nc0F_n=\sum_{k=1}^{n}\mathbf{1}_{A_{n,k}}\mathsf{C}^{c_0}_{kT/n}, a Gι\mathcal{G}_\iota-measurable map. Let ωΩ\omega\in\Omega. If tˉ(ω)=0\bar{t}(\omega)=0, then F(ω)=C0c0(ω)=0F(\omega)=\mathsf{C}^{c_0}_0(\omega)=0 and ωAn,k\omega\notin A_{n,k} for all kk, so Fn(ω)=0=F(ω)F_n(\omega)=0=F(\omega). Otherwise tˉ(ω)(0,T]\bar{t}(\omega)\in(0,T] lies in exactly one of the intervals ((k1)T/n,kT/n]((k-1)T/n,kT/n], 1kn1\le k\le n, so Fn(ω)=CkT/nc0(ω)F_n(\omega)=\mathsf{C}^{c_0}_{kT/n}(\omega) for that kk and, by the Lipschitz bound, Fn(ω)F(ω)NB(kT/ntˉ(ω))NBT/n|F_n(\omega)-F(\omega)|\le NB\,(kT/n-\bar{t}(\omega))\le NBT/n. Hence Fn(ω)F_n(\omega) converges to F(ω)F(\omega) for every ω\omega, and FF is Gι\mathcal{G}_\iota-measurable by claim 5 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions. We write Fι,ιF_{\iota,\iota'} for FF when the admissible pair needs to be displayed.

Step 4 (the bad set is covered by tie events). Keep yy and rr fixed and put, for each admissible pair, Eι,ι={ωΩ: Uic0,j(ω)=Fι,ι(ω)}E_{\iota,\iota'}=\{\omega\in\Omega:\ U^{c_0,j}_i(\omega)=F_{\iota,\iota'}(\omega)\}. We show Ωr,y(ΩΩ0U)(ι,ι) admissibleEι,ι.\Omega^{r,y}\subseteq(\Omega\setminus\Omega^{U}_0)\cup\bigcup_{(\iota,\iota')\text{ admissible}}E_{\iota,\iota'} . Let ωΩr,yΩ0U\omega\in\Omega^{r,y}\cap\Omega^{U}_0 and run the recursion for the data (p,a,x0)(p,a,x_0) with p=P(y)(ω)p=\mathsf{P}^{(y)}(\omega) and a=ara=a^{r}. These data are not conflict-free, so by claim 2 of Ties in the Aggregate Recursion: Consumed Levels and First Hitting Times, Conflict-Freeness in the Absence of Ties, and the Point-Deletion Identity some step k<Kk<K is a tie: Jk\mathcal{J}_k contains two distinct labels c0c_0 and cc'. By the definition of Jk\mathcal{J}_k, Cθk+1c0,(k)λkc0\mathsf{C}^{c_0,(k)}_{\theta_{k+1}}\ge\lambda^{c_0}_k with a real left side, so λkc0=τn0(pc0)\lambda^{c_0}_k=\tau_{n_0}(p^{c_0}) (with n0=pc0(κkc0)+1n_0=p^{c_0}(\kappa^{c_0}_k)+1) is finite; by claim 1 of the present lemma (Step 1), u:=λkc0u:=\lambda^{c_0}_k is a jump time of pc0p^{c_0} and u=Uic0,j(ω)u=U^{c_0,j}_i(\omega) for some 1jJc01\le j\le J_{c_0} and 1iyc0,j1\le i\le y_{c_0,j}. In the same way v:=λkc=Uic,j(ω)v:=\lambda^{c'}_k=U^{c',j'}_{i'}(\omega) for some 1jJc1\le j'\le J_{c'} and 1iyc,j1\le i'\le y_{c',j'}. Then ι=(c0,j,i)\iota=(c_0,j,i), ι=(c,j,i)\iota'=(c',j',i') is an admissible pair. Apply claim 3 of Ties in the Aggregate Recursion: Consumed Levels and First Hitting Times, Conflict-Freeness in the Absence of Ties, and the Point-Deletion Identity to pp, the label c0c_0, the jump time uu, the step kk and the label cc' (so that its vv is our vv): the deleted family pp^{-} there is exactly Q(ω)\mathsf{Q}(\omega) for this ι\iota by the identity displayed in Step 3, so the quantities marked by a minus sign there are those of the recursion for (Q(ω),ar,x0)(\mathsf{Q}(\omega),a^{r},x_0), that is, Ct,rec,c=Ctc(ω)\mathsf{C}^{-,\mathrm{rec},c}_t=\mathsf{C}^{c}_t(\omega) in the notation of Step 3 for this admissible pair (ι,ι)(\iota,\iota') (which also fixes W=Uic,jW=U^{c',j'}_{i'}, tt^{*} and tˉ\bar{t} there). Its conclusion gives θk+1=inf{t[0,T]:Ctc(ω)v}\theta_{k+1}=\inf\{t\in[0,T]:\mathsf{C}^{c'}_t(\omega)\ge v\}, which is t(ω)t^{*}(\omega) because v=W(ω)v=W(\omega); thus t(ω)=θk+1(0,T]t^{*}(\omega)=\theta_{k+1}\in(0,T], tˉ(ω)=θk+1\bar{t}(\omega)=\theta_{k+1}, and the conclusion u=Cθk+1,rec,c0u=\mathsf{C}^{-,\mathrm{rec},c_0}_{\theta_{k+1}} reads Uic0,j(ω)=Ctˉ(ω)c0(ω)=Fι,ι(ω)U^{c_0,j}_i(\omega)=\mathsf{C}^{c_0}_{\bar{t}(\omega)}(\omega)=F_{\iota,\iota'}(\omega), i.e. ωEι,ι\omega\in E_{\iota,\iota'}.

Step 5 (each tie event is null). Fix an admissible pair and let X=Uic0,jX=U^{c_0,j}_i, a random variable, that is, measurable from F\mathcal{F} to B(R)\mathcal{B}(\mathbb{R}), which is the σ\sigma-algebra B1\mathcal{B}_1 of Finite Products of Lebesgue Measure and Coordinate Integration on Rl\mathbb{R}^l. The driving variables form an independent family indexed by a countable set; enumerating this index set by a bijection with N\mathbb{N} (independence of a family is a condition on its finite subfamilies and is therefore unaffected by reindexing) and applying Grouping Lemma for Independent Random Variables to the two disjoint nonempty index sets consisting of the index of XX and of all other indices, the σ\sigma-algebras σ(X)\sigma(X) and Gι\mathcal{G}_\iota are independent. The image measure μX\mu_X of PP under XX, μX(B)=P(X1(B))\mu_X(B)=P(X^{-1}(B)), is the distribution of XX, which by The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record is the uniform law νI\nu_{I} on I=Ic0,jI=I_{c_0,j} of Uniform Representation of the Rate-One Poisson Counting Path on a Bounded Interval: Distinct Points, Poisson Increments, Conditional Law Given the Cell Counts, and Point Insertion: μX(B)=λ(IB)/λ(I)\mu_X(B')=\lambda(I\cap B')/\lambda(I) for Borel BB', with λ(I)=bjc0bj1c0=Ic0,j\lambda(I)=b^{c_0}_j-b^{c_0}_{j-1}=|I_{c_0,j}| by claim 4 of Existence of Lebesgue Measure on the Real Line, which is >0>0 since bj1c0<bjc0b^{c_0}_{j-1}<b^{c_0}_j.

Define Ψ:Ω×R[0,]\Psi:\Omega\times\mathbb{R}\to[0,\infty] by Ψ(ω,u)=1{u=F(ω)}\Psi(\omega,u)=\mathbf{1}\{u=F(\omega)\}. It is GιB(R)\mathcal{G}_\iota\otimes\mathcal{B}(\mathbb{R})-measurable: the maps (ω,u)u(\omega,u)\mapsto u and (ω,u)F(ω)(\omega,u)\mapsto F(\omega) are measurable with respect to GιB(R)\mathcal{G}_\iota\otimes\mathcal{B}(\mathbb{R}), since for a Borel set BB' their preimages Ω×B\Omega\times B' and F1(B)×RF^{-1}(B')\times\mathbb{R} are measurable rectangles; hence their difference is measurable, the set Z={(ω,u):uF(ω)=0}Z=\{(\omega,u):u-F(\omega)=0\} is the preimage of the Borel set {0}\{0\}, and Ψ=1Z\Psi=\mathbf{1}_Z. By claim 3 of Independence Fubini: Integration in an Independent Random Vector Given a Sub-Sigma-Algebra (with n=1n=1, G=Gι\mathcal{G}=\mathcal{G}_\iota and this XX), E[Ψ(,X())]=E[RΨ(,u)dμX(u)].\mathbb{E}\bigl[\Psi(\cdot,X(\cdot))\bigr]=\mathbb{E}\Bigl[\int_{\mathbb{R}}\Psi(\cdot,u)\,d\mu_X(u)\Bigr]. The left side is P(Eι,ι)P(E_{\iota,\iota'}), because Ψ(ω,X(ω))=1Eι,ι(ω)\Psi(\omega,X(\omega))=\mathbf{1}_{E_{\iota,\iota'}}(\omega), and this map is F\mathcal{F}-measurable by claim 1 of the same lemma, so that Eι,ιE_{\iota,\iota'}, the preimage of the Borel set {1}\{1\} under it, lies in F\mathcal{F}. On the right, for every ω\omega the section uΨ(ω,u)u\mapsto\Psi(\omega,u) is the indicator of the Borel set {F(ω)}\{F(\omega)\}, so the inner integral equals μX({F(ω)})=λ(I{F(ω)})/λ(I)λ({F(ω)})/λ(I)=0\mu_X(\{F(\omega)\})=\lambda(I\cap\{F(\omega)\})/\lambda(I)\le\lambda(\{F(\omega)\})/\lambda(I)=0, since the interval {F(ω)}=[F(ω),F(ω)]\{F(\omega)\}=[F(\omega),F(\omega)] has Lebesgue measure 00 by claim 4 of Existence of Lebesgue Measure on the Real Line. Hence the right side is the expectation of the zero function, which is 00, and P(Eι,ι)=0P(E_{\iota,\iota'})=0.

Step 6 (claim 2). By Step 4, monotonicity and subadditivity, P(Ωr,y)P(ΩΩ0U)+(ι,ι)P(Eι,ι)P(\Omega^{r,y})\le P(\Omega\setminus\Omega^{U}_0)+\sum_{(\iota,\iota')}P(E_{\iota,\iota'}), the sum running over the finitely many admissible pairs. Each summand is 00 by Step 5, and P(ΩΩ0U)=1P(Ω0U)=0P(\Omega\setminus\Omega^{U}_0)=1-P(\Omega^{U}_0)=0 by claim 3 of Basic Properties of a Measure and claim 1 of The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record. So P(Ωr,y)=0P(\Omega^{r,y})=0, which with Step 2 proves claim 2.

Step 7 (claim 3). Fix yy and let fyf_y be as in Step 2. In this paragraph we work on the probability space (Ω,U,PU)(\Omega,\mathcal{U},P|_{\mathcal{U}}), writing P=PUP'=P|_{\mathcal{U}} and E\mathbb{E}' for the expectation with respect to PP'. By Tonelli and Fubini Theorems on (R,R,ρ)(\mathbf{R},\mathcal{R},\rho) and (Ω,U,P)(\Omega,\mathcal{U},P'), the map ϕy(ω)=Rfy(r,ω)dρ(r)\phi_y(\omega)=\int_{\mathbf{R}}f_y(r,\omega)\,d\rho(r) is U\mathcal{U}-measurable with values in [0,][0,\infty], and ΩϕydP=R(Ωfy(r,ω)dP(ω))dρ(r).\int_{\Omega}\phi_y\,dP'=\int_{\mathbf{R}}\Bigl(\int_{\Omega}f_y(r,\omega)\,dP'(\omega)\Bigr)d\rho(r). For fixed rr the inner integrand is 1Ωr,y\mathbf{1}_{\Omega^{r,y}} with Ωr,yU\Omega^{r,y}\in\mathcal{U}, whose integral is P(Ωr,y)=P(Ωr,y)=0P'(\Omega^{r,y})=P(\Omega^{r,y})=0 by claim 2; so the inner integrals vanish identically and ΩϕydP=0\int_{\Omega}\phi_y\,dP'=0. Also, for fixed ω\omega, fy(r,ω)=1Bω(y)(r)f_y(r,\omega)=\mathbf{1}_{B^{(y)}_\omega}(r) with Bω(y)RB^{(y)}_\omega\in\mathcal{R} (Step 2), so ϕy(ω)=ρ(Bω(y))\phi_y(\omega)=\rho(B^{(y)}_\omega) and Ωy={ϕy=0}=Ω{ϕy>0}U\Omega_y=\{\phi_y=0\}=\Omega\setminus\{\phi_y>0\}\in\mathcal{U}. Put ψ=min(ϕy,1)\psi=\min(\phi_y,1); then {ψ>α}={ϕy>α}\{\psi>\alpha\}=\{\phi_y>\alpha\} for real α<1\alpha<1 and {ψ>α}=\{\psi>\alpha\}=\emptyset for α1\alpha\ge1, so ψ\psi is a U\mathcal{U}-measurable map with values in [0,1][0,1], a nonnegative random variable on (Ω,U,P)(\Omega,\mathcal{U},P'), with ψϕy\psi\le\phi_y and therefore E[ψ]ΩϕydP=0\mathbb{E}'[\psi]\le\int_{\Omega}\phi_y\,dP'=0 by claim 1 of Linearity and Monotonicity of the Lebesgue Integral. Markov's inequality (Markov's and Chebyshev's Inequalities) on (Ω,U,P)(\Omega,\mathcal{U},P') gives P(ψ1/n)nE[ψ]=0P'(\psi\ge1/n)\le n\,\mathbb{E}'[\psi]=0 for every nNn\in\mathbb{N}. Since {ϕy>0}=nN{ψ1/n}\{\phi_y>0\}=\bigcup_{n\in\mathbb{N}}\{\psi\ge1/n\} (if ϕy(ω)>0\phi_y(\omega)>0 then ψ(ω)>0\psi(\omega)>0, so ψ(ω)1/n\psi(\omega)\ge1/n for some nn; conversely ψ1/n\psi\ge1/n forces ϕy>0\phi_y>0), countable subadditivity gives P(ϕy>0)=0P'(\phi_y>0)=0, hence P(Ωy)=1P'(\Omega_y)=1 by claim 3 of Basic Properties of a Measure; as ΩyU\Omega_y\in\mathcal{U}, this says P(Ωy)=1P(\Omega_y)=1.

The set N0L\mathbb{N}_0^{\mathsf{L}} is countable: yy/Ny\mapsto y/\sqrt{N} is a bijection of it onto the parameter lattice S\mathsf{S}, which is countable by claim 5 of The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record, in the sense of Assembly of Measure Spaces: Restriction, Transport, One-Point Spaces, and Countable Disjoint Unions: finite or the set of values of a sequence, and in either case (padding a finite list by repeating its last term; S\mathsf{S} is nonempty as 0S0\in\mathsf{S}) the set of values of a sequence, which composed with the inverse bijection exhibits N0L\mathbb{N}_0^{\mathsf{L}} as the set of values of a sequence (yn)nN(y_n)_{n\in\mathbb{N}}. Hence Ω=nNΩyn\Omega'=\bigcap_{n\in\mathbb{N}}\Omega_{y_n} is a countable intersection of members of U\mathcal{U}, so ΩU\Omega'\in\mathcal{U}, and P(ΩΩ)=P(nN(ΩΩyn))nNP(ΩΩyn)=0P(\Omega\setminus\Omega')=P\bigl(\bigcup_{n\in\mathbb{N}}(\Omega\setminus\Omega_{y_n})\bigr)\le\sum_{n\in\mathbb{N}}P(\Omega\setminus\Omega_{y_n})=0, so P(Ω)=1P(\Omega')=1.

Finally let ωΩ\omega\in\Omega', put y0=K(ω)y_0=\mathsf{K}(\omega) and let Y(ω)Y(\omega) be the finite set consisting of y0y_0 and of the vectors y0mec,jy_0-\mathsf{m}e_{c,j} for the (c,j)L(c,j)\in\mathsf{L} with Kc,j(ω)m\mathsf{K}_{c,j}(\omega)\ge\mathsf{m}; each member of Y(ω)Y(\omega) lies in N0L\mathbb{N}_0^{\mathsf{L}}, the (c,j)(c,j)-coordinate of y0mec,jy_0-\mathsf{m}e_{c,j} being Kc,j(ω)m0\mathsf{K}_{c,j}(\omega)-\mathsf{m}\ge0 and the others unchanged. By claim 3 of The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record, (r,ω)G(r,\omega)\in\mathsf{G}^{\sharp} if and only if (r,ω)G(y0)(r,\omega)\in\mathsf{G}^{(y_0)}; so by the definition of Tω\mathsf{T}_\omega, RTω=yY(ω)Bω(y),\mathbf{R}\setminus\mathsf{T}_\omega=\bigcup_{y\in Y(\omega)}B^{(y)}_\omega , a finite union of members of R\mathcal{R} (Step 2), hence a member of R\mathcal{R}, and ρ(RTω)yY(ω)ρ(Bω(y))=0\rho(\mathbf{R}\setminus\mathsf{T}_\omega)\le\sum_{y\in Y(\omega)}\rho(B^{(y)}_\omega)=0 because ωΩy\omega\in\Omega_y for every yY(ω)y\in Y(\omega). This proves claim 3.

Step 8 (claim 4). Let G0FG_0\in\mathcal{F} and G=G0ΩG=G_0\cap\Omega'. Since ΩUF\Omega'\in\mathcal{U}\subseteq\mathcal{F}, GFG\in\mathcal{F}, and ρ(RTω)=0\rho(\mathbf{R}\setminus\mathsf{T}_\omega)=0 for ωGΩ\omega\in G\subseteq\Omega' by claim 3. As ΩG=(ΩG0)(ΩΩ)\Omega\setminus G=(\Omega\setminus G_0)\cup(\Omega\setminus\Omega'), monotonicity gives P(ΩG)P(ΩG0)P(\Omega\setminus G)\ge P(\Omega\setminus G_0) and subadditivity gives P(ΩG)P(ΩG0)+P(ΩΩ)=P(ΩG0)P(\Omega\setminus G)\le P(\Omega\setminus G_0)+P(\Omega\setminus\Omega')=P(\Omega\setminus G_0).

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…