Throughout, fix ω ∈ Ω \omega\in\Omega ω ∈ Ω and abbreviate K = K ( ω ) \mathsf{K}=\mathsf{K}(\omega) K = K ( ω ) ; for ( c , j ) ∈ L (c,j)\in\mathsf{L} ( c , j ) ∈ L with K c , j ≥ m \mathsf{K}_{c,j}\ge\mathsf{m} K c , j ≥ m write y ( c , j ) = K − m e c , j ∈ N 0 L y^{(c,j)}=\mathsf{K}-\mathsf{m}e_{c,j}\in\mathbb{N}_0^{\mathsf{L}} y ( c , j ) = K − m e c , j ∈ N 0 L . Recall from 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 that λ ♯ , ω \lambda^{\sharp,\omega} λ ♯ , ω , λ ( y ) , ω \lambda^{(y),\omega} λ ( y ) , ω and their likelihoods are the objects 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 for the clock families P ♯ ( ω ) \mathsf{P}^{\sharp}(\omega) P ♯ ( ω ) and P ( y ) ( ω ) \mathsf{P}^{(y)}(\omega) P ( y ) ( ω ) respectively, and that ℓ ♯ , ω = ℓ λ ♯ , ω \ell^{\sharp,\omega}=\ell_{\lambda^{\sharp,\omega}} ℓ ♯ , ω = ℓ λ ♯ , ω , ℓ ( y ) , ω = ℓ λ ( y ) , ω \ell^{(y),\omega}=\ell_{\lambda^{(y),\omega}} ℓ ( y ) , ω = ℓ λ ( y ) , ω .
Step 0 (measurability of G L , D G_{L,D} G L , D and T ω \mathsf{T}_\omega T ω ). Let Q = ( Q ∩ [ 0 , R ] ) ∪ { R } \mathsf{Q}=(\mathbb{Q}\cap[0,R])\cup\{R\} Q = ( Q ∩ [ 0 , R ]) ∪ { R } , a countable set. We claim that a counting path p p p satisfying ∣ p ( u ′ ) − p ( u ) − ( u ′ − u ) ∣ ≤ D |p(u')-p(u)-(u'-u)|\le D ∣ p ( u ′ ) − p ( u ) − ( u ′ − u ) ∣ ≤ D for all u ≤ u ′ u\le u' u ≤ u ′ in Q \mathsf{Q} Q with u ′ − u ≤ L u'-u\le L u ′ − u ≤ L satisfies the same bound for all real 0 ≤ u ≤ u ′ ≤ R 0\le u\le u'\le R 0 ≤ u ≤ u ′ ≤ R with u ′ − u ≤ L u'-u\le L u ′ − u ≤ L . Given such real u ≤ u ′ u\le u' u ≤ u ′ , choose for each natural number n n n points u n , u n ′ ∈ Q u_n,u'_n\in\mathsf{Q} u n , u n ′ ∈ Q with u ≤ u n < u + 1 / n u\le u_n<u+1/n u ≤ u n < u + 1/ n , u ′ ≤ u n ′ < u ′ + 1 / n u'\le u'_n<u'+1/n u ′ ≤ u n ′ < u ′ + 1/ n and u n ′ − u n ≤ u ′ − u u'_n-u_n\le u'-u u n ′ − u n ≤ u ′ − u : if u = u ′ u=u' u = u ′ take u n = u n ′ u_n=u'_n u n = u n ′ (the bound is then trivial), so assume u < u ′ u<u' u < u ′ ; if u ′ < R u'<R u ′ < R take u n ′ u'_n u n ′ rational in [ u ′ , min ( u ′ + 1 / n , R ) ) [u',\min(u'+1/n,R)) [ u ′ , min ( u ′ + 1/ n , R )) and then u n u_n u n rational in [ u + ( u n ′ − u ′ ) , min ( u + 1 / n , u n ′ ) ) [u+(u'_n-u'),\min(u+1/n,u'_n)) [ u + ( u n ′ − u ′ ) , min ( u + 1/ n , u n ′ )) , an interval which is nondegenerate for n n n large because u + ( u n ′ − u ′ ) < u n ′ u+(u'_n-u')<u'_n u + ( u n ′ − u ′ ) < u n ′ and u n ′ − u ′ < 1 / n u'_n-u'<1/n u n ′ − u ′ < 1/ n (rationals being dense); if u ′ = R u'=R u ′ = R take u n ′ = R u'_n=R u n ′ = R and u n u_n u n rational in [ u , min ( u + 1 / n , R ) ) [u,\min(u+1/n,R)) [ u , min ( u + 1/ n , R )) . In all cases u ≤ u n ≤ u n ′ u\le u_n\le u'_n u ≤ u n ≤ u n ′ , u n < u + 1 / n u_n<u+1/n u n < u + 1/ n , u ′ ≤ u n ′ < u ′ + 1 / n u'\le u'_n<u'+1/n u ′ ≤ u n ′ < u ′ + 1/ n and u n ′ − u n ≤ u ′ − u u'_n-u_n\le u'-u u n ′ − u n ≤ u ′ − u . By right-continuity and monotonicity of counting paths (clauses 2 and 3 of Counting Path and Its Jump Times ), p ( u n ) → p ( u ) p(u_n)\to p(u) p ( u n ) → p ( u ) and p ( u n ′ ) → p ( u ′ ) p(u'_n)\to p(u') p ( u n ′ ) → p ( u ′ ) : p ( u ) ≤ p ( u n ) ≤ p ( s ) p(u)\le p(u_n)\le p(s) p ( u ) ≤ p ( u n ) ≤ p ( s ) for every s > u s>u s > u once u n < s u_n<s u n < s , and p ( u ) p(u) p ( u ) is the greatest lower bound of the p ( s ) p(s) p ( s ) , s > u s>u s > u , the values being integers. Since also u n ′ − u n → u ′ − u u'_n-u_n\to u'-u u n ′ − u n → u ′ − u , the bound passes to the limit by Order Properties of Limits of Real Sequences . Consequently
G L , D = Ω 0 U ∩ ⋂ c ∈ L ⋂ u ≤ u ′ ∈ Q , u ′ − u ≤ L { ω : ∣ P u ′ ♯ , c ( ω ) − P u ♯ , c ( ω ) − ( u ′ − u ) ∣ ≤ D } , G_{L,D}=\Omega^{U}_0\cap\bigcap_{c\in\mathcal{L}}\ \bigcap_{u\le u'\in\mathsf{Q},\ u'-u\le L}\bigl\{\omega:\ |\mathsf{P}^{\sharp,c}_{u'}(\omega)-\mathsf{P}^{\sharp,c}_{u}(\omega)-(u'-u)|\le D\bigr\}, G L , D = Ω 0 U ∩ ⋂ c ∈ L ⋂ u ≤ u ′ ∈ Q , u ′ − u ≤ L { ω : ∣ P u ′ ♯ , c ( ω ) − P u ♯ , c ( ω ) − ( u ′ − u ) ∣ ≤ D } ,
a countable intersection of events (Ω 0 U ∈ U ⊆ F \Omega^{U}_0\in\mathcal{U}\subseteq\mathcal{F} Ω 0 U ∈ U ⊆ F and each P u ♯ , c \mathsf{P}^{\sharp,c}_u P u ♯ , c is F \mathcal{F} F -measurable by claims 1 and 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 G L , D ∈ F G_{L,D}\in\mathcal{F} G L , D ∈ F . Next, G ♯ ∈ R ⊗ F \mathsf{G}^{\sharp}\in\mathcal{R}\otimes\mathcal{F} G ♯ ∈ R ⊗ F and G ( y ) ∈ R ⊗ U ⊆ R ⊗ F \mathsf{G}^{(y)}\in\mathcal{R}\otimes\mathcal{U}\subseteq\mathcal{R}\otimes\mathcal{F} G ( y ) ∈ R ⊗ U ⊆ R ⊗ F 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 (applied as in 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 ), and sections at ω \omega ω of members of R ⊗ F \mathcal{R}\otimes\mathcal{F} R ⊗ F lie in R \mathcal{R} R (the sets whose section at ω \omega ω lies in R \mathcal{R} R form a σ \sigma σ -algebra containing the measurable rectangles, hence the product σ \sigma σ -algebra by Intersections of Sigma-Algebras and Minimality of the Generated Sigma-Algebra ); T ω \mathsf{T}_\omega T ω is a finite intersection of such sections, so T ω ∈ R \mathsf{T}_\omega\in\mathcal{R} T ω ∈ R .
Step 1 (claim 1). By claim 3 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 , λ ♯ , ω \lambda^{\sharp,\omega} λ ♯ , ω and every λ ( y ) , ω \lambda^{(y),\omega} λ ( y ) , ω are causal intensities with bound N B ~ N\tilde{B} N B ~ , and by its last assertion together with (OC), λ ♯ , ω , υ ≥ N b ‾ \lambda^{\sharp,\omega,\upsilon}\ge N\underline{b} λ ♯ , ω , υ ≥ N b everywhere. Hence each λ − ( c , j ) , ω \lambda^{-(c,j),\omega} λ − ( c , j ) , ω is a causal intensity with bound N B ~ N\tilde{B} N B ~ . If K c , j ≥ m \mathsf{K}_{c,j}\ge\mathsf{m} K c , j ≥ m , then ℓ − ( c , j ) , ω = ℓ ( y ( c , j ) ) , ω = ℓ λ − ( c , j ) , ω \ell^{-(c,j),\omega}=\ell^{(y^{(c,j)}),\omega}=\ell_{\lambda^{-(c,j),\omega}} ℓ − ( c , j ) , ω = ℓ ( y ( c , j ) ) , ω = ℓ λ − ( c , j ) , ω by the definition of the removed-clock likelihood in Pathwise Reduction of the Symmetrised Move Information on the Synthetic Copy: Removed-Clock Likelihoods, the Shifted Family, and the Averaging Bound ; if K c , j < m \mathsf{K}_{c,j}<\mathsf{m} K c , j < m , then ϱ c , j ( K c , j ) = 0 \varrho_{c,j}(\mathsf{K}_{c,j})=0 ϱ c , j ( K c , j ) = 0 by The Poisson Removal Ratio for Moves of Several Points: Move Score, Mean, Exact Second Moment, Move Information, and Pointwise Bounds , so both sides of the asserted identity vanish. The hypotheses of Pair Expansion of the Weighted Likelihood-Ratio Square: Pair Covariances of Causal-Intensity Likelihoods, the Exact Expansion, and Its First-Order Form hold with μ ‾ = N b ‾ > 0 \underline\mu=N\underline{b}>0 μ = N b > 0 , μ ˉ = μ ˉ q = N B ~ \bar\mu=\bar\mu_q=N\tilde{B} μ ˉ = μ ˉ q = N B ~ and n = d n=d n = d . For Good-Bad Splitting of the Integrated Symmetrised Score Functional: Chebyshev Bound for the Under-Likelihood Set, Transfer of Mass Between Densities, and the Split Bound : ℓ ♯ , ω > 0 \ell^{\sharp,\omega}>0 ℓ ♯ , ω > 0 by claim 1 of Pair Expansion of the Weighted Likelihood-Ratio Square: Pair Covariances of Causal-Intensity Likelihoods, the Exact Expansion, and Its First-Order Form , the likelihoods are nonnegative and R \mathcal{R} R -measurable with ∫ ℓ ♯ , ω d ρ = ∫ ℓ λ − ( c , j ) , ω d ρ = 1 \int\ell^{\sharp,\omega}\,d\rho=\int\ell_{\lambda^{-(c,j),\omega}}\,d\rho=1 ∫ ℓ ♯ , ω d ρ = ∫ ℓ λ − ( c , j ) , ω d ρ = 1 by claim 4 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 , and the ratio factors ϱ c , j ( K c , j ) \varrho_{c,j}(\mathsf{K}_{c,j}) ϱ c , j ( K c , j ) are nonnegative reals. Its integrand Φ w ( ℓ , ( r q ℓ q ) q ) \Phi_w(\ell,(\mathsf{r}_q\ell_q)_q) Φ w ( ℓ , ( r q ℓ q ) q ) then equals Φ w ( ℓ ♯ , ω ( r ) , ( ϱ c , j ( K c , j ) ℓ − ( c , j ) , ω ( r ) ) ( c , j ) ) = Ψ ( r , ω ) \Phi_w(\ell^{\sharp,\omega}(r),(\varrho_{c,j}(\mathsf{K}_{c,j})\ell^{-(c,j),\omega}(r))_{(c,j)})=\Psi(r,\omega) Φ w ( ℓ ♯ , ω ( r ) , ( ϱ c , j ( K c , j ) ℓ − ( c , j ) , ω ( r ) ) ( c , j ) ) = Ψ ( r , ω ) by the identity just proved.
Step 2 (claim 2). Let ω ∈ G L , D \omega\in G_{L,D} ω ∈ G L , D , ( c , j ) (c,j) ( c , j ) with K c , j ≥ m \mathsf{K}_{c,j}\ge\mathsf{m} K c , j ≥ m , r ∈ T ω r\in\mathsf{T}_\omega r ∈ T ω , and y = y ( c , j ) y=y^{(c,j)} y = y ( c , j ) . We apply Shared-Clock Point Insertion into the Open-Loop Aggregate Solution: Exact Response Identity, Crude Bound, and Linearisation Defect with the clock family p = P ( y ) ( ω ) p=\mathsf{P}^{(y)}(\omega) p = P ( y ) ( ω ) (a family of counting paths by 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 ), the control path a r a^r a r (a control path with values in A \mathcal{A} A 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 and the hypothesis on h h h ), the point x 0 x_0 x 0 , the label c 0 = c c_0=c c 0 = c , the move size m \mathsf{m} m , the extension ( U , W β , β ˉ ) (U,W_\beta,\bar\beta) ( U , W β , β ˉ ) , the real numbers R R R , L L L and the tolerance D + m D+\mathsf{m} D + m , and the inserted points u 1 < ⋯ < u m u_1<\dots<u_{\mathsf{m}} u 1 < ⋯ < u m , the increasing arrangement of the points U i c , j ( ω ) U^{c,j}_i(\omega) U i c , j ( ω ) with K c , j − m < i ≤ K c , j \mathsf{K}_{c,j}-\mathsf{m}<i\le\mathsf{K}_{c,j} K c , j − m < i ≤ K c , j . We check its hypotheses.
The inserted points. Since ω ∈ Ω 0 U \omega\in\Omega^{U}_0 ω ∈ Ω 0 U , claim 1 of Pathwise Reduction of the Symmetrised Move Information on the Synthetic Copy: Removed-Clock Likelihoods, the Shifted Family, and the Averaging Bound shows that these m \mathsf{m} m points are pairwise distinct, lie in I c , j ⊆ ( 0 , R ] I_{c,j}\subseteq(0,R] I c , j ⊆ ( 0 , R ] (so 0 < u 1 < ⋯ < u m 0<u_1<\dots<u_{\mathsf{m}} 0 < u 1 < ⋯ < u m ), and differ from every point U i ′ c , j ′ ( ω ) U^{c,j'}_{i'}(\omega) U i ′ c , j ′ ( ω ) with 1 ≤ j ′ ≤ J c 1\le j'\le J_c 1 ≤ j ′ ≤ J c , 1 ≤ i ′ ≤ y c , j ′ 1\le i'\le y_{c,j'} 1 ≤ i ′ ≤ y c , j ′ . The path p c = P ( y ) , c ( ω ) p^{c}=\mathsf{P}^{(y),c}(\omega) p c = P ( y ) , c ( ω ) is u ↦ ∑ j ′ ∑ i ′ ≤ y c , j ′ 1 { U i ′ c , j ′ ( ω ) ≤ u } u\mapsto\sum_{j'}\sum_{i'\le y_{c,j'}}\mathbf{1}\{U^{c,j'}_{i'}(\omega)\le u\} u ↦ ∑ j ′ ∑ i ′ ≤ y c , j ′ 1 { U i ′ c , j ′ ( ω ) ≤ u } (the factor 1 Ω 0 U \mathbf{1}_{\Omega^{U}_0} 1 Ω 0 U in its definition being 1 1 1 at ω \omega ω ), a finite sum of indicators of distinct points; by clause 4 of Counting Path and Its Jump Times , u > 0 u>0 u > 0 is a jump time when p c ( u ) p^{c}(u) p c ( u ) exceeds the least upper bound p c ( u − ) p^{c}(u-) p c ( u − ) of the values on [ 0 , u ) [0,u) [ 0 , u ) , which happens exactly when u u u is one of these points, so its jump times are exactly the points U i ′ c , j ′ ( ω ) U^{c,j'}_{i'}(\omega) U i ′ c , j ′ ( ω ) (i ′ ≤ y c , j ′ i'\le y_{c,j'} i ′ ≤ y c , j ′ ), and none of the u k u_k u k is a jump time of p c p^{c} p c . By the same claim 1, p + = P ♯ ( ω ) p^{+}=\mathsf{P}^{\sharp}(\omega) p + = P ♯ ( ω ) : indeed P ♯ , c ′ ( ω ) = p c ′ \mathsf{P}^{\sharp,c'}(\omega)=p^{c'} P ♯ , c ′ ( ω ) = p c ′ for c ′ ≠ c c'\neq c c ′ = c and P u ♯ , c ( ω ) = p c ( u ) + # { k : u k ≤ u } \mathsf{P}^{\sharp,c}_u(\omega)=p^{c}(u)+\#\{k:u_k\le u\} P u ♯ , c ( ω ) = p c ( u ) + # { k : u k ≤ u } for all u ≥ 0 u\ge0 u ≥ 0 .
The discrepancy hypothesis. Let c ′ ∈ L c'\in\mathcal{L} c ′ ∈ L and 0 ≤ u ≤ u ′ ≤ R 0\le u\le u'\le R 0 ≤ u ≤ u ′ ≤ R with u ′ − u ≤ L u'-u\le L u ′ − u ≤ L . If c ′ ≠ c c'\neq c c ′ = c , then p c ′ = P ♯ , c ′ ( ω ) p^{c'}=\mathsf{P}^{\sharp,c'}(\omega) p c ′ = P ♯ , c ′ ( ω ) and the definition of G L , D G_{L,D} G L , D gives ∣ p c ′ ( u ′ ) − p c ′ ( u ) − ( u ′ − u ) ∣ ≤ D ≤ D + m |p^{c'}(u')-p^{c'}(u)-(u'-u)|\le D\le D+\mathsf{m} ∣ p c ′ ( u ′ ) − p c ′ ( u ) − ( u ′ − u ) ∣ ≤ D ≤ D + m . If c ′ = c c'=c c ′ = c , then p c ( u ′ ) − p c ( u ) = P u ′ ♯ , c ( ω ) − P u ♯ , c ( ω ) − # { k : u < u k ≤ u ′ } p^{c}(u')-p^{c}(u)=\mathsf{P}^{\sharp,c}_{u'}(\omega)-\mathsf{P}^{\sharp,c}_{u}(\omega)-\#\{k:u<u_k\le u'\} p c ( u ′ ) − p c ( u ) = P u ′ ♯ , c ( ω ) − P u ♯ , c ( ω ) − # { k : u < u k ≤ u ′ } , and the last count lies in { 0 , … , m } \{0,\dots,\mathsf{m}\} { 0 , … , m } , so ∣ p c ( u ′ ) − p c ( u ) − ( u ′ − u ) ∣ ≤ D + m |p^{c}(u')-p^{c}(u)-(u'-u)|\le D+\mathsf{m} ∣ p c ( u ′ ) − p c ( u ) − ( u ′ − u ) ∣ ≤ D + m . Thus (D) holds with tolerance D + m D+\mathsf{m} D + m , and A 0 A_0 A 0 of the statement is the constant of the insertion lemma for this tolerance.
Conflict-freeness. Since r ∈ T ω r\in\mathsf{T}_\omega r ∈ T ω , ( r , ω ) ∈ G ( y ) (r,\omega)\in\mathsf{G}^{(y)} ( r , ω ) ∈ G ( y ) and ( r , ω ) ∈ G ♯ (r,\omega)\in\mathsf{G}^{\sharp} ( r , ω ) ∈ G ♯ , i.e. the data ( p , a r , x 0 ) (p,a^r,x_0) ( p , a r , x 0 ) and ( p + , a r , x 0 ) (p^{+},a^r,x_0) ( p + , a r , x 0 ) are conflict-free; by claim 2(c) 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 the open-loop aggregate solutions for these data are Σ = Σ ˉ ( y ) , r ( ω ) \Sigma=\bar\Sigma^{(y),r}(\omega) Σ = Σ ˉ ( y ) , r ( ω ) and Σ + = Σ ˉ ♯ , r ( ω ) \Sigma^{+}=\bar\Sigma^{\sharp,r}(\omega) Σ + = Σ ˉ ♯ , r ( ω ) .
Conclusion. By (W), Λ 1 T A 0 < L \Lambda_1TA_0<L Λ 1 T A 0 < L , so claim 2 of Shared-Clock Point Insertion into the Open-Loop Aggregate Solution: Exact Response Identity, Crude Bound, and Linearisation Defect gives ∣ N ( Σ t + − Σ t ) ∣ ≤ A 0 |N(\Sigma^{+}_t-\Sigma_t)|\le A_0 ∣ N ( Σ t + − Σ t ) ∣ ≤ A 0 for every t ∈ [ 0 , T ] t\in[0,T] t ∈ [ 0 , T ] , which is the first bound. For the left limits at t ∈ ( 0 , T ] t\in(0,T] t ∈ ( 0 , T ] : by claim 2(b) 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 there are δ , δ ′ > 0 \delta,\delta'>0 δ , δ ′ > 0 such that Σ ˉ ♯ , r ( ω ) \bar\Sigma^{\sharp,r}(\omega) Σ ˉ ♯ , r ( ω ) is constant equal to Σ ˉ t − ♯ , r ( ω ) \bar\Sigma^{\sharp,r}_{t-}(\omega) Σ ˉ t − ♯ , r ( ω ) on [ t − δ , t ) ∩ [ 0 , T ] [t-\delta,t)\cap[0,T] [ t − δ , t ) ∩ [ 0 , T ] and Σ ˉ ( y ) , r ( ω ) \bar\Sigma^{(y),r}(\omega) Σ ˉ ( y ) , r ( ω ) is constant equal to Σ ˉ t − ( y ) , r ( ω ) \bar\Sigma^{(y),r}_{t-}(\omega) Σ ˉ t − ( y ) , r ( ω ) on [ t − δ ′ , t ) ∩ [ 0 , T ] [t-\delta',t)\cap[0,T] [ t − δ ′ , t ) ∩ [ 0 , T ] ; evaluating the first bound at any s s s in the nonempty intersection of these intervals gives the second bound; at t = 0 t=0 t = 0 both left limits equal x 0 x_0 x 0 . Finally, both left limits lie in G N ⊆ Δ l \mathbb{G}_N\subseteq\Delta^l G N ⊆ Δ l , where b ~ υ \tilde{b}^\upsilon b ~ υ agrees with b ~ ˉ υ \bar{\tilde{b}}^\upsilon b ~ ˉ υ (claim (i) of Regularity and Derivative Bounds of the Extended Aggregate Observation Drift ) and the latter satisfies ∣ b ~ ˉ υ ( Σ ) − b ~ ˉ υ ( Σ ′ ) ∣ ≤ Γ ∣ Σ − Σ ′ ∣ |\bar{\tilde{b}}^\upsilon(\Sigma)-\bar{\tilde{b}}^\upsilon(\Sigma')|\le\Gamma\,|\Sigma-\Sigma'| ∣ b ~ ˉ υ ( Σ ) − b ~ ˉ υ ( Σ ′ ) ∣ ≤ Γ ∣Σ − Σ ′ ∣ (claim (ii) there, the Euclidean distance of Σ \Sigma Σ and Σ ′ \Sigma' Σ ′ being ∣ Σ − Σ ′ ∣ |\Sigma-\Sigma'| ∣Σ − Σ ′ ∣ ); hence
∣ λ t − ( c , j ) , ω , υ ( r ) − λ t ♯ , ω , υ ( r ) ∣ = N ∣ b ~ υ ( Σ ˉ t − ( y ) , r ( ω ) ) − b ~ υ ( Σ ˉ t − ♯ , r ( ω ) ) ∣ ≤ N Γ A 0 N = Γ A 0 . |\lambda^{-(c,j),\omega,\upsilon}_t(r)-\lambda^{\sharp,\omega,\upsilon}_t(r)|=N\,\bigl|\tilde{b}^\upsilon(\bar\Sigma^{(y),r}_{t-}(\omega))-\tilde{b}^\upsilon(\bar\Sigma^{\sharp,r}_{t-}(\omega))\bigr|\le N\Gamma\frac{A_0}{N}=\Gamma A_0 . ∣ λ t − ( c , j ) , ω , υ ( r ) − λ t ♯ , ω , υ ( r ) ∣ = N b ~ υ ( Σ ˉ t − ( y ) , r ( ω )) − b ~ υ ( Σ ˉ t − ♯ , r ( ω )) ≤ N Γ N A 0 = Γ A 0 .
If K c , j < m \mathsf{K}_{c,j}<\mathsf{m} K c , j < m , then λ − ( c , j ) , ω = λ ♯ , ω \lambda^{-(c,j),\omega}=\lambda^{\sharp,\omega} λ − ( c , j ) , ω = λ ♯ , ω by definition.
Step 3 (claim 3). Let ω ∈ G L , D \omega\in G_{L,D} ω ∈ G L , D , q = ( c , j ) q=(c,j) q = ( c , j ) , q ′ = ( c ′ , j ′ ) q'=(c',j') q ′ = ( c ′ , j ′ ) and r ∈ T ω r\in\mathsf{T}_\omega r ∈ T ω . By claim 3 of Integer Power Products of Causal-Intensity Likelihoods: Pathwise Identity, Integral Bounds, and the Pair Identity (as recalled in Pair Expansion of the Weighted Likelihood-Ratio Square: Pair Covariances of Causal-Intensity Likelihoods, the Exact Expansion, and Its First-Order Form ),
E q q ′ ω ( r ) = ∫ [ 0 , T ] ∑ υ ∈ V ( λ s − q , ω , υ ( r ) − λ s ♯ , ω , υ ( r ) ) ( λ s − q ′ , ω , υ ( r ) − λ s ♯ , ω , υ ( r ) ) λ s ♯ , ω , υ ( r ) d s . E^{\omega}_{qq'}(r)=\int_{[0,T]}\sum_{\upsilon\in V}\frac{\bigl(\lambda^{-q,\omega,\upsilon}_s(r)-\lambda^{\sharp,\omega,\upsilon}_s(r)\bigr)\bigl(\lambda^{-q',\omega,\upsilon}_s(r)-\lambda^{\sharp,\omega,\upsilon}_s(r)\bigr)}{\lambda^{\sharp,\omega,\upsilon}_s(r)}\,ds . E q q ′ ω ( r ) = ∫ [ 0 , T ] ∑ υ ∈ V λ s ♯ , ω , υ ( r ) ( λ s − q , ω , υ ( r ) − λ s ♯ , ω , υ ( r ) ) ( λ s − q ′ , ω , υ ( r ) − λ s ♯ , ω , υ ( r ) ) d s .
By claim 2 (in both cases K c , j ≥ m \mathsf{K}_{c,j}\ge\mathsf{m} K c , j ≥ m and K c , j < m \mathsf{K}_{c,j}<\mathsf{m} K c , j < m , the difference being 0 0 0 in the latter) and Step 1, each summand has absolute value at most ( Γ A 0 ) 2 / ( N b ‾ ) (\Gamma A_0)^{2}/(N\underline{b}) ( Γ A 0 ) 2 / ( N b ) for every s ∈ [ 0 , T ] s\in[0,T] s ∈ [ 0 , T ] , so the integrand f ( s ) f(s) f ( s ) satisfies ∣ f ( s ) ∣ ≤ l ~ Γ 2 A 0 2 / ( N b ‾ ) = : f ˉ |f(s)|\le\tilde{l}\Gamma^{2}A_0^{2}/(N\underline{b})=:\bar{f} ∣ f ( s ) ∣ ≤ l ~ Γ 2 A 0 2 / ( N b ) =: f ˉ for all s ∈ [ 0 , T ] s\in[0,T] s ∈ [ 0 , T ] ; it is measurable on [ 0 , T ] [0,T] [ 0 , T ] because each intensity is B [ 0 , T ] ⊗ R \mathcal{B}_{[0,T]}\otimes\mathcal{R} B [ 0 , T ] ⊗ R -measurable (condition (i) of Causal Intensity on the Observation Record Space ), so its section at r r r is measurable in s s s (the section argument of Step 0, with the roles of the two factors exchanged), and sums, products and quotients by the positive denominator are measurable (claims 2 and 3 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions and Sequentially Continuous Functions of Measurable Euclidean Maps are Measurable for the reciprocal); the integral defining E q q ′ ω ( r ) E^{\omega}_{qq'}(r) E q q ′ ω ( r ) is well defined by claim 1 of Pair Expansion of the Weighted Likelihood-Ratio Square: Pair Covariances of Causal-Intensity Likelihoods, the Exact Expansion, and Its First-Order Form . Applying the monotonicity of claim 2 of Linearity and Monotonicity of the Lebesgue Integral to f ≤ f ˉ f\le\bar f f ≤ f ˉ and to − f ≤ f ˉ -f\le\bar f − f ≤ f ˉ gives ∣ E q q ′ ω ( r ) ∣ ≤ ∫ [ 0 , T ] f ˉ d s = T f ˉ = E ˉ N |E^{\omega}_{qq'}(r)|\le\int_{[0,T]}\bar f\,ds=T\bar f=\bar{E}_N ∣ E q q ′ ω ( r ) ∣ ≤ ∫ [ 0 , T ] f ˉ d s = T f ˉ = E ˉ N .
Step 4 (claim 4). Let ω ∈ G L , D \omega\in G_{L,D} ω ∈ G L , D with ρ ( R ∖ T ω ) = 0 \rho(\mathbf{R}\setminus\mathsf{T}_\omega)=0 ρ ( R ∖ T ω ) = 0 . By Step 0, Z = R ∖ T ω ∈ R \mathsf{Z}=\mathbf{R}\setminus\mathsf{T}_\omega\in\mathcal{R} Z = R ∖ T ω ∈ R , and ρ ( Z ) = 0 \rho(\mathsf{Z})=0 ρ ( Z ) = 0 . By Step 3, ∣ E q q ′ ω ∣ ≤ E ˉ N |E^{\omega}_{qq'}|\le\bar{E}_N ∣ E q q ′ ω ∣ ≤ E ˉ N off Z \mathsf{Z} Z , and claim 3 of Pair Expansion of the Weighted Likelihood-Ratio Square: Pair Covariances of Causal-Intensity Likelihoods, the Exact Expansion, and Its First-Order Form with E ˉ = E ˉ N \bar{E}=\bar{E}_N E ˉ = E ˉ N gives the first and third bounds; the second follows from the first with q ′ = q q'=q q ′ = q and from V a r q ω = C q q ω ≥ 0 \mathrm{Var}^{\omega}_{q}=C^{\omega}_{qq}\ge0 Var q ω = C qq ω ≥ 0 (claim 1 of that lemma). ■ \blacksquare ■