Adopt the setting and notation of The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record: the natural numbers N≥1, l≥2, m≥1, l~≥1, the real numbers B≥0, T>0 and R>0 with R≥NBT, the probability space (Ω,F,P) carrying the independent family of driving variables Kc, Vic, Uic,j (with c ranging over the transition labels), the cells Ic,j=(bj−1c,bjc]⊆(0,R] (with 0=b0c<b1c<⋯<bJcc=R and natural numbers Jc≥1) indexed by the finite set L of pairs (c,j) with 1≤j≤Jc, the σ-algebras U and V, the event Ω0U, the set N0L, the cell-count vector K=(Kc,j)(c,j)∈L, and, for each transition label c, the uniform Poisson path pc=(puc)u∈[0,R], the deterministic-count paths pc,(z) (z∈N0Jc) 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 and the cell-count block Kc,⋅=(Kc,1,…,Kc,Jc) (a notation coined here; it is the vector of cell counts 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 for the data of the label c, written C there, a symbol otherwise reserved in the present setting for the record cells), all formed from Kc, (Vic)i, (Uic,j)j,i and the cells Ic,1,…,Ic,Jc, together with the deterministic-count clocks P(y)=(P(y),c)c (y∈N0L) and the copy clocks P♯=(P♯,c)c, Pu♯,c(ω)=Pu(K(ω)),c(ω) (u≥0). For a real number μ≥0 write Pμ for the Poisson distribution with parameter μ, a probability measure on the Borel σ-algebra B(R); independence of random variables and their distributions are as in those definitions.
1. (Law identity for the increments) Let c be a transition label, let r≥1 be a natural number, let 0≤u0<u1<⋯<ur≤R be real numbers and let B1′,…,Br′∈B(R). Then
P(⋂k=1r{Puk♯,c−Puk−1♯,c∈Bk′})=P(⋂k=1r{pukc−puk−1c∈Bk′})=∏k=1rPuk−uk−1(Bk′).
2. (Independent Poisson increments on the clock interval) For every transition label c: P0♯,c(ω)=0 for every ω∈Ω; for all real 0≤u<u′≤R the increment Pu′♯,c−Pu♯,c has the Poisson distribution with parameter u′−u; and for every natural number r≥1 and all real 0≤u0<u1<⋯<ur≤R the increments Pu1♯,c−Pu0♯,c,…,Pur♯,c−Pur−1♯,c are independent.
3. (Applicability of the window discrepancy bound) For every transition label c and every natural number n with n≤R (such n exist exactly when R≥1), the process P♯,c=(Pu♯,c)u≥0 on (Ω,F,P) satisfies the hypotheses of Uniform Window Discrepancy Bound for a Counting Process with Poisson Increments on the Integer Grid with this n, with any natural number in the role of the window length called m there, and with any real x>0: all its paths are counting paths, and for all integers 0≤i<i′≤n the increment Pi′♯,c−Pi♯,c has the Poisson distribution with parameter i′−i.