TheoremBase

The Copy Clocks Are Independent Poisson Clocks with Horizon R, and Every Record Is Almost Surely Conflict-Free for Them

Statement

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, as recalled in The Copy Clocks Have Independent Poisson Increments on the Clock Interval: Law Identity with the Uniform Poisson Path and Applicability of the Window Discrepancy Bound: the natural numbers N≥1N\ge1, l≥2l\ge2, m≥1m\ge1, l~≥1\tilde{l}\ge1, the real numbers B≥0B\ge0, T>0T>0 and R>0R>0 with R≥NBTR\ge NBT, the natural numbers Jc≥1J_c\ge1 and the finite index set L\mathsf{L} of pairs (c,j)(c,j) with cc a transition label and 1≤j≤Jc1\le j\le J_c, the countable set N0L\mathbb{N}_0^{\mathsf{L}} of cell-count vectors, the probability space (Ω,F,P)(\Omega,\mathcal{F},P) carrying the independent family of driving variables KcK^{c}, VicV^{c}_i, Uic,jU^{c,j}_i (cc ranging over the transition labels, i∈Ni\in\mathbb{N}, (c,j)∈L(c,j)\in\mathsf{L}), the cells Ic,j⊆(0,R]I_{c,j}\subseteq(0,R], the event Ω0U\Omega^{U}_0, the cell-count vector K\mathsf{K} with coordinates Kc,j\mathsf{K}_{c,j}, the deterministic-count clocks P(y)=(P(y),c)c\mathsf{P}^{(y)}=(\mathsf{P}^{(y),c})_c (y∈N0Ly\in\mathbb{N}_0^{\mathsf{L}}) with Pu(y),c=1Ω0U∑j=1Jc∑i=1yc,j1{Uic,j≤u}\mathsf{P}^{(y),c}_u=\mathbf{1}_{\Omega^{U}_0}\sum_{j=1}^{J_c}\sum_{i=1}^{y_{c,j}}\mathbf{1}\{U^{c,j}_i\le u\}, and the copy clocks P♯=(P♯,c)c\mathsf{P}^{\sharp}=(\mathsf{P}^{\sharp,c})_c, Pu♯,c(ω)=Pu(K(ω)),c(ω)\mathsf{P}^{\sharp,c}_u(\omega)=\mathsf{P}^{(\mathsf{K}(\omega)),c}_u(\omega), that is, Pu♯,c=1Ω0U∑j=1Jc∑i=1Kc,j1{Uic,j≤u}\mathsf{P}^{\sharp,c}_u=\mathbf{1}_{\Omega^{U}_0}\sum_{j=1}^{J_c}\sum_{i=1}^{\mathsf{K}_{c,j}}\mathbf{1}\{U^{c,j}_i\le u\} for u≥0u\ge0; together with the observation-record objects of that setting, namely the record space R\mathbf{R}, the record-frozen control paths ara^{r} (r∈Rr\in\mathbf{R}), the initial point x0x_0 in the aggregate lattice GN\mathbb{G}_N, and the conflict-free sets G(y)\mathsf{G}^{(y)} and G♯\mathsf{G}^{\sharp} of 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, recalled in 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 (a pair (r,ω)(r,\omega) lies in G♯\mathsf{G}^{\sharp} if and only if the data (P♯(ω),ar,x0)(\mathsf{P}^{\sharp}(\omega),a^{r},x_0) are conflict-free in the sense of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution, and similarly for G(y)\mathsf{G}^{(y)} with P(y)(ω)\mathsf{P}^{(y)}(\omega)). Then:

1. (Counting paths, constant beyond RR.) For every label cc and every ω∈Ω\omega\in\Omega the path u↦Pu♯,c(ω)u\mapsto\mathsf{P}^{\sharp,c}_u(\omega) is a counting path on [0,∞)[0,\infty) which is constant on [R,∞)[R,\infty).

2. (Poisson clocks with horizon RR.) For every label cc, the process P♯,c=(Pu♯,c)u≥0\mathsf{P}^{\sharp,c}=(\mathsf{P}^{\sharp,c}_u)_{u\ge0} is a Poisson clock with horizon RR on (Ω,F,P)(\Omega,\mathcal{F},P).

3. (Independence across labels.) The family of σ\sigma-algebras σ(Pu♯,c:u≥0)\sigma(\mathsf{P}^{\sharp,c}_u:u\ge0), indexed by the transition labels cc, is independent.

4. (Every record is almost surely conflict-free for the copy clocks.) For every r∈Rr\in\mathbf{R} the set Ωr,♯={ω∈Ω:(r,ω)∉G♯}\Omega^{r,\sharp}=\{\omega\in\Omega:(r,\omega)\notin\mathsf{G}^{\sharp}\} is an event with P(Ωr,♯)=0P(\Omega^{r,\sharp})=0.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…