The Copy Clocks Are Independent Poisson Clocks with Horizon R, and Every Record Is Almost Surely Conflict-Free for Them
lemmaProbabilitylem:copy-clocks-independent-poisson-horizon-2026aAdopt 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 , , , , the real numbers , and with , the natural numbers and the finite index set of pairs with a transition label and , the countable set of cell-count vectors, the probability space carrying the independent family of driving variables , , ( ranging over the transition labels, , ), the cells , the event , the cell-count vector with coordinates , the deterministic-count clocks () with , and the copy clocks , , that is, for ; together with the observation-record objects of that setting, namely the record space , the record-frozen control paths (), the initial point in the aggregate lattice , and the conflict-free sets and 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 lies in if and only if the data are conflict-free in the sense of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution, and similarly for with ). Then:
1. (Counting paths, constant beyond .) For every label and every the path is a counting path on which is constant on .
2. (Poisson clocks with horizon .) For every label , the process is a Poisson clock with horizon on .
3. (Independence across labels.) The family of -algebras , indexed by the transition labels , is independent.
4. (Every record is almost surely conflict-free for the copy clocks.) For every the set is an event with .
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.