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.
Step 0 (finite point configurations). Let M∈N0 and let u1,…,uM>0 be pairwise distinct real numbers; put q(t)=∑a=1M1{ua≤t}=#{a:ua≤t} for t≥0 (the zero function when M=0). We show: (a) q is a counting path and q(t−)=#{a:ua<t} for every t>0; (b) the jump times of q are exactly u1,…,uM; (c) if n≥1 is a natural number with τn(q)<+∞, then τn(q) is a jump time of q, hence equals one of the ua.
The values of q lie in {0,…,M} and q(0)=0 since every ua>0; q is nondecreasing since {a:ua≤s}⊆{a:ua≤t} for s≤t. Fix t≥0 and choose ϵ>0 smaller than every ua−t with ua>t (ϵ=1 if there is no such a); for s∈(t,t+ϵ) we have {a:ua≤s}={a:ua≤t}, so q(s)=q(t), and together with q(s)≥q(t) for all s>t this shows that q(t) is the greatest lower bound of {q(s):s>t}: condition 3 of Counting Path and Its Jump Times. Now let t>0 and q−=#{a:ua<t}. For 0≤s<t, {a:ua≤s}⊆{a:ua<t}, so q(s)≤q−; and taking s=0 if no ua satisfies ua<t, and otherwise s the largest ua with ua<t (in both cases s∈[0,t)), we get q(s)=q−. Hence the least upper bound q(t−) of {q(s):0≤s<t} equals q−, and q(t)−q(t−)=#{a:ua=t}≤1 by distinctness; also q(0)−q(0−)=0. So q is a counting path, (a) holds, and q(t)>q(t−) holds exactly when t=ua for some a, which is (b). For (c), let t0=τn(q)<+∞, the greatest lower bound of the nonempty set S={t≥0:q(t)≥n}. If s>t0, then s is not a lower bound of S, so some t∈S satisfies t<s, and q(s)≥q(t)≥n; by condition 3, q(t0) is the greatest lower bound of {q(s):s>t0}, so q(t0)≥n. Since q(0)=0<n we have t0=0, so t0>0. For 0≤s<t0 we have s∈/S, so q(s)≤n−1 (q(s) being an integer below n), whence q(t0−)≤n−1<n≤q(t0): t0 is a jump time, and by (b) it is one of the ua.
Step 3 (the deleted clocks and the hitting functional). Fix y∈N0L and r∈R. Call a pair (ι,ι′) of triples ι=(c0,j,i), ι′=(c′,j′,i′)admissible if c0 and c′ are distinct labels, 1≤j≤Jc0, 1≤i≤yc0,j, 1≤j′≤Jc′ and 1≤i′≤yc′,j′; there are finitely many admissible pairs. Fix one. Every object introduced in this step depends on (y,r,ι,ι′); this dependence is suppressed in the notation except where it is displayed. Let Gι be the σ-algebra generated by the family of all driving variables other than Uic0,j (a sub-σ-algebra of F). Let Ω~ι be the complement of the union of the countably many events {Ua1c,j1=Ua2c,j2}, with c a label, j1,j2∈{1,…,Jc}, a1,a2∈N, (j1,a1)=(j2,a2) and neither (c,j1,a1) nor (c,j2,a2) equal to ι, and {Ua1c,j1∈/Ic,j1} with c a label, j1∈{1,…,Jc}, a1∈N and (c,j1,a1)=ι. Each of these events lies in Gι: the first kind is the preimage of the Borel set {0} under the Gι-measurable difference of two Gι-measurable variables, the second is the preimage of the Borel set R∖Ic,j1. Hence Ω~ι∈Gι; and Ω0U⊆Ω~ι, since the conditions defining Ω~ι are among those defining Ω0U. For every label c and u≥0 put
Quc=1Ω~ι∑j′′=1Jc∑a=1yc,j′′1{(c,j′′,a)=ι}1{Uac,j′′≤u},
where 1{(c,j′′,a)=ι} is the constant 0 or 1. Each Quc is Gι-measurable (the event {Uac,j′′≤u} is the preimage of a Borel set under a variable generating Gι whenever (c,j′′,a)=ι; then use claims 1 to 3 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions). Every path u↦Quc(ω) is a counting path: for ω∈/Ω~ι 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 0); for ω∈Ω~ι it is the path q of Step 0 for the finitely many points Uac,j′′(ω) with 1≤j′′≤Jc, 1≤a≤yc,j′′ and (c,j′′,a)=ι, which are pairwise distinct and lie in Ic,j′′⊆(0,R] by the definition of Ω~ι. Thus Q=(Qc)c is a family of stochastic processes on the probability space (Ω,Gι,P∣Gι) all of whose paths are counting paths, and we write Q(ω) for the clock family (u↦Quc(ω))c. Moreover, for ω∈Ω0U (so that 1Ω0U(ω)=1Ω~ι(ω)=1) the definition of P(y) gives
Quc(ω)=Pu(y),c(ω)(c=c0),Quc0(ω)=Pu(y),c0(ω)−1{u≥Uic0,j(ω)}(u≥0):Q(ω) is the family obtained from P(y)(ω) by deleting the jump of P(y),c0(ω) at Uic0,j(ω), 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.
Put W=Ui′c′,j′ (a symbol coined here; it is not one of the driving variables Vic), which is Gι-measurable because ι′=ι (as c′=c0). For ω∈Ω let t∗(ω) be the greatest lower bound of Sω={t∈[0,T]:Ctc′(ω)≥W(ω)} (+∞ if Sω is empty), let tˉ(ω)=min(t∗(ω),T)∈[0,T], and let
F(ω)=Ctˉ(ω)c0(ω).
(a) For every s∈[0,T], {ω:t∗(ω)≤s}={ω:Csc′(ω)≥W(ω)}. Indeed, if Csc′(ω)≥W(ω) then s∈Sω and t∗(ω)≤s. Conversely let t∗(ω)≤s; then Sω is nonempty and t∗(ω)∈[0,T]. For every ϵ>0 there is t∈Sω with t<t∗(ω)+ϵ (otherwise t∗(ω)+ϵ would be a lower bound of Sω exceeding its greatest lower bound), and t≥t∗(ω), so the Lipschitz bound gives Ct∗(ω)c′(ω)≥Ctc′(ω)−NBϵ≥W(ω)−NBϵ; as ϵ>0 is arbitrary, Ct∗(ω)c′(ω)≥W(ω), and by monotonicity Csc′(ω)≥W(ω). Consequently {t∗≤s}={Csc′−W≥0}∈Gι (preimage of the Borel set [0,∞) under a Gι-measurable difference), and {tˉ≤s}∈Gι for every s∈[0,T], this set being {t∗≤s} for s<T and Ω for s=T.
(b) F is Gι-measurable. For n∈N and 1≤k≤n put An,k={tˉ≤kT/n}∖{tˉ≤(k−1)T/n}={tˉ∈((k−1)T/n,kT/n]}∈Gι and Fn=∑k=1n1An,kCkT/nc0, a Gι-measurable map. Let ω∈Ω. If tˉ(ω)=0, then F(ω)=C0c0(ω)=0 and ω∈/An,k for all k, so Fn(ω)=0=F(ω). Otherwise tˉ(ω)∈(0,T] lies in exactly one of the intervals ((k−1)T/n,kT/n], 1≤k≤n, so Fn(ω)=CkT/nc0(ω) for that k and, by the Lipschitz bound, ∣Fn(ω)−F(ω)∣≤NB(kT/n−tˉ(ω))≤NBT/n. Hence Fn(ω) converges to F(ω) for every ω, and F is Gι-measurable by claim 5 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions. We write Fι,ι′ for F when the admissible pair needs to be displayed.
Step 4 (the bad set is covered by tie events). Keep y and r fixed and put, for each admissible pair, Eι,ι′={ω∈Ω:Uic0,j(ω)=Fι,ι′(ω)}. We show
Ωr,y⊆(Ω∖Ω0U)∪⋃(ι,ι′) admissibleEι,ι′.
Let ω∈Ωr,y∩Ω0U and run the recursion for the data (p,a,x0) with p=P(y)(ω) and a=ar. 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<K is a tie: Jk contains two distinct labels c0 and c′. By the definition of Jk, Cθk+1c0,(k)≥λkc0 with a real left side, so λkc0=τn0(pc0) (with n0=pc0(κkc0)+1) is finite; by claim 1 of the present lemma (Step 1), u:=λkc0 is a jump time of pc0 and u=Uic0,j(ω) for some 1≤j≤Jc0 and 1≤i≤yc0,j. In the same way v:=λkc′=Ui′c′,j′(ω) for some 1≤j′≤Jc′ and 1≤i′≤yc′,j′. Then ι=(c0,j,i), ι′=(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 p, the label c0, the jump time u, the step k and the label c′ (so that its v is our v): the deleted family p− there is exactly Q(ω) for this ι 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), that is, Ct−,rec,c=Ctc(ω) in the notation of Step 3 for this admissible pair (ι,ι′) (which also fixes W=Ui′c′,j′, t∗ and tˉ there). Its conclusion gives θk+1=inf{t∈[0,T]:Ctc′(ω)≥v}, which is t∗(ω) because v=W(ω); thus t∗(ω)=θk+1∈(0,T], tˉ(ω)=θk+1, and the conclusion u=Cθk+1−,rec,c0 reads Uic0,j(ω)=Ctˉ(ω)c0(ω)=Fι,ι′(ω), i.e. ω∈Eι,ι′.
Define Ψ:Ω×R→[0,∞] by Ψ(ω,u)=1{u=F(ω)}. It is Gι⊗B(R)-measurable: the maps (ω,u)↦u and (ω,u)↦F(ω) are measurable with respect to Gι⊗B(R), since for a Borel set B′ their preimages Ω×B′ and F−1(B′)×R are measurable rectangles; hence their difference is measurable, the set Z={(ω,u):u−F(ω)=0} is the preimage of the Borel set {0}, and Ψ=1Z. By claim 3 of Independence Fubini: Integration in an Independent Random Vector Given a Sub-Sigma-Algebra (with n=1, G=Gι and this X),
E[Ψ(⋅,X(⋅))]=E[∫RΨ(⋅,u)dμX(u)].
The left side is P(Eι,ι′), because Ψ(ω,X(ω))=1Eι,ι′(ω), and this map is F-measurable by claim 1 of the same lemma, so that Eι,ι′, the preimage of the Borel set {1} under it, lies in F. On the right, for every ω the section u↦Ψ(ω,u) is the indicator of the Borel set {F(ω)}, so the inner integral equals μX({F(ω)})=λ(I∩{F(ω)})/λ(I)≤λ({F(ω)})/λ(I)=0, since the interval {F(ω)}=[F(ω),F(ω)] has Lebesgue measure 0 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 0, and P(Eι,ι′)=0.
Step 7 (claim 3). Fix y and let fy be as in Step 2. In this paragraph we work on the probability space (Ω,U,P∣U), writing P′=P∣U and E′ for the expectation with respect to P′. By Tonelli and Fubini Theorems on (R,R,ρ) and (Ω,U,P′), the map ϕy(ω)=∫Rfy(r,ω)dρ(r) is U-measurable with values in [0,∞], and
∫ΩϕydP′=∫R(∫Ωfy(r,ω)dP′(ω))dρ(r).
For fixed r the inner integrand is 1Ωr,y with Ωr,y∈U, whose integral is P′(Ωr,y)=P(Ωr,y)=0 by claim 2; so the inner integrals vanish identically and ∫ΩϕydP′=0. Also, for fixed ω, fy(r,ω)=1Bω(y)(r) with Bω(y)∈R (Step 2), so ϕy(ω)=ρ(Bω(y)) and Ωy={ϕy=0}=Ω∖{ϕy>0}∈U. Put ψ=min(ϕy,1); then {ψ>α}={ϕy>α} for real α<1 and {ψ>α}=∅ for α≥1, so ψ is a U-measurable map with values in [0,1], a nonnegative random variable on (Ω,U,P′), with ψ≤ϕy and therefore E′[ψ]≤∫ΩϕydP′=0 by claim 1 of Linearity and Monotonicity of the Lebesgue Integral. Markov's inequality (Markov's and Chebyshev's Inequalities) on (Ω,U,P′) gives P′(ψ≥1/n)≤nE′[ψ]=0 for every n∈N. Since {ϕy>0}=⋃n∈N{ψ≥1/n} (if ϕy(ω)>0 then ψ(ω)>0, so ψ(ω)≥1/n for some n; conversely ψ≥1/n forces ϕy>0), countable subadditivity gives P′(ϕy>0)=0, hence P′(Ωy)=1 by claim 3 of Basic Properties of a Measure; as Ωy∈U, this says P(Ωy)=1.
Finally let ω∈Ω′, put y0=K(ω) and let Y(ω) be the finite set consisting of y0 and of the vectors y0−mec,j for the (c,j)∈L with Kc,j(ω)≥m; each member of Y(ω) lies in N0L, the (c,j)-coordinate of y0−mec,j being Kc,j(ω)−m≥0 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♯ if and only if (r,ω)∈G(y0); so by the definition of Tω,
R∖Tω=⋃y∈Y(ω)Bω(y),
a finite union of members of R (Step 2), hence a member of R, and ρ(R∖Tω)≤∑y∈Y(ω)ρ(Bω(y))=0 because ω∈Ωy for every y∈Y(ω). This proves claim 3.
Step 8 (claim 4). Let G0∈F and G=G0∩Ω′. Since Ω′∈U⊆F, G∈F, and ρ(R∖Tω)=0 for ω∈G⊆Ω′ by claim 3. As Ω∖G=(Ω∖G0)∪(Ω∖Ω′), monotonicity gives P(Ω∖G)≥P(Ω∖G0) and subadditivity gives P(Ω∖G)≤P(Ω∖G0)+P(Ω∖Ω′)=P(Ω∖G0).