TheoremBase

Proof of Conditional Restart of the Record Channel at an Intermediate Time

lemmalem:record-restart-bridge-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Initial publication of the proof of the restart bridge (clock recovery, fresh-start independence with block grouping, segment solution conditions, concatenated-reconstruction factorization, and the residual-clock interarrival recursion with inverse substitution).

Proof

Throughout, an observation clock index is a pair d=(i,υ)d=(i,\upsilon), listed once and for all as a sequence of length n=Nl~n=N\tilde{l}; Y~d\tilde{Y}^d and Y~^d\hat{\tilde{Y}}^d denote the corresponding observation clock and residual observation clock, and A~r,d=A~r,i,υ\tilde{A}^{r,d}=\tilde{A}^{r,i,\upsilon} for records rr. We use the agent-grouping identities of the preamble of the proof-independent statement of Conditional Density of the Observation Record Given the Initial States and Transition Clocks: for (r,ω)G(r,\omega)\in G and u[0,T]u\in[0,T], summing the rates β~(σur,i(ω),υ,Σur(ω))\tilde{\beta}(\sigma^{r,i}_u(\omega),\upsilon,\Sigma^r_u(\omega)) over all indices dd gives Nb~tot(Σur(ω))N\tilde{b}^{\mathrm{tot}}(\Sigma^r_u(\omega)), and summing over ii for fixed υ\upsilon gives Nb~υ(Σur(ω))N\tilde{b}^{\upsilon}(\Sigma^r_u(\omega)), by grouping the agents by their state and using the aggregate observation drift; the same holds for left limits.

Claim 1. The restarted system is a driving system by the final assertion of Fresh-Start Property of the Controlled N-Agent Dynamics. For the prefix-frozen policy: fix ϱ=(κ,t,w)\varrho=(\kappa,\mathbf{t},w) and j0j\ge0. The concatenated tuple in the display lies in the tuple set of Observation-Driven Control Policy with horizon TT: its entries are strictly increasing, since tκs<s+τ1\mathbf{t}_\kappa\le s<s+\tau'_1, and at most TT. The map (u,τ)(s+u,(τ, s+τ))(u,\tau')\mapsto(s+u,(\tau,\ s+\tau')) is a coordinatewise translation, hence continuous, so preimages of relatively open sets are relatively open; by the identification, used in The Record-Frozen Control Path and Record-Frozen Policy, of the σ\sigma-algebra generated by the relatively open subsets with the trace of the generated σ\sigma-algebra of the ambient space, the composition (hs,ϱ)j(h^{s,\varrho})_j of this map with hκ+jh_{\kappa+j} has the measurability required by Observation-Driven Control Policy, and its values lie in Rm\mathbb{R}^m. Hence hs,ϱh^{s,\varrho} is an observation-driven control policy with horizon TsT-s. For WsW_s: by claim (iv) of Existence, Uniqueness, and Regularity for the Controlled N-Agent Dynamics, KsK_s and the times τj\tau_j and channels υj\upsilon_j with jKsj\le K_s are Gs\mathcal{G}_s-measurable; on Ω0\Omega_0, Ws=πs(W)W_s=\pi_s(W) is the record with count KsK_s, times (τ1,,τKs)(\tau_1,\dots,\tau_{K_s}), and marks (υ1,,υKs)(\upsilon_1,\dots,\upsilon_{K_s}), since kW(s)=Ksk_W(s)=K_s (an event time is counted at ss exactly when the right-continuous count does); off Ω0\Omega_0 it is the empty record. Decomposing the preimage of a member of Rs\mathcal{R}_s over the cells and using that Gs\mathcal{G}_s contains all events of probability zero, Ws1(A)GsW_s^{-1}(A)\in\mathcal{G}_s for every ARsA\in\mathcal{R}_s by claim 4(b) of Assembly of Measure Spaces: Restriction, Transport, One-Point Spaces, and Countable Disjoint Unions. The horizon-ss restricted solution of claim 4 of Bayes Disintegration and Filtering Formula for the Observation Record has, at each ωΩ0\omega\in\Omega_0, observation-event count KsK_s at its horizon with the same event times and channels, its observation total being the restriction of the original; so its observation record agrees with WsW_s on Ω0\Omega_0.

Claim 2. Fix a transition clock Y=Yi,σγY=Y^{i,\sigma\gamma} with consumed times At=Ati,σγA_t=A^{i,\sigma\gamma}_t, counters Nt=Nti,σγN_t=N^{i,\sigma\gamma}_t, and residual clock Y^\hat{Y}. Let a0a\ge0 be a real. On the event where AsaA_s\ge a: put t(a)=inf{t[0,s]:Ata}t(a)=\inf\{t\in[0,s]:A_t\ge a\}; the set is nonempty and closed, tAtt\mapsto A_t being continuous and nondecreasing with A0=0A_0=0, so the infimum is attained, At(a)aA_{t(a)}\ge a, and At<aA_t<a for t<t(a)t<t(a), whence At(a)=aA_{t(a)}=a by continuity (for t(a)=0t(a)=0, a=0a=0). Then Ya=YAt(a)=Nt(a)Y_a=Y_{A_{t(a)}}=N_{t(a)}. Measurability: for c[0,s]c\in[0,s] the event where t(a)ct(a)\le c is the event where AcaA_c\ge a, which lies in Fssys\mathcal{F}^{\mathrm{sys}}_s by claim (iv) of Existence, Uniqueness, and Regularity for the Controlled N-Agent Dynamics; and Nt(a)N_{t(a)} is the pointwise limit of the variables NtkN_{t_k} with tkt_k the upper dyadic staircase approximations of t(a)t(a) capped at ss, by right-continuity of tNtt\mapsto N_t (a right-continuous clock path composed with a continuous nondecreasing time change), each NtkN_{t_k} being a finite sum of products of indicators of dyadic events of Fssys\mathcal{F}^{\mathrm{sys}}_s with the variables NqN_{q}, qq dyadic in [0,s][0,s], which are Fssys\mathcal{F}^{\mathrm{sys}}_s-measurable by claim (iv). On the complementary event where As<aA_s<a: Ya=YAs+Y^aAs=Ns+Y^aAsY_a=Y_{A_s}+\hat{Y}_{a-A_s}=N_s+\hat{Y}_{a-A_s} by the definition of the residual clocks, and Y^aAs\hat{Y}_{a-A_s} is measurable with respect to the σ\sigma-algebra generated by Fssys\mathcal{F}^{\mathrm{sys}}_s and the variables of Y^\hat{Y}, again by the dyadic staircase argument, the paths of Y^\hat{Y} being counting paths by claim (a) of Fresh-Start Property of the Controlled N-Agent Dynamics, hence right-continuous, and AsA_s, NsN_s being Fssys\mathcal{F}^{\mathrm{sys}}_s-measurable. Both events lie in Fssys\mathcal{F}^{\mathrm{sys}}_s, so YaY_a is Ts\mathcal{T}_s-measurable. The initial states are Fssys\mathcal{F}^{\mathrm{sys}}_s-measurable (claim (iv) with σ0i=ς0i\sigma^i_0=\varsigma^i_0). Hence every generator of T\mathcal{T} is Ts\mathcal{T}_s-measurable and TTs\mathcal{T}\subseteq\mathcal{T}_s.

For the independence: by claim (b) of Fresh-Start Property of the Controlled N-Agent Dynamics, the finite family consisting of Fssys\mathcal{F}^{\mathrm{sys}}_s and the σ\sigma-algebras of the individual residual clocks is independent. Group it into the block consisting of Fssys\mathcal{F}^{\mathrm{sys}}_s and the residual transition clocks and the block of the residual observation clocks: the finite intersections of members of a block form a π\pi-system generating the block σ\sigma-algebra, the product rule holds on these π\pi-systems by the family independence, and it extends to the generated σ\sigma-algebras one block at a time by Dynkin's lemma via claim 1 of Uniqueness of Finite Measures on a Generating Pi-System and the Density of the Exponential Law applied to the two finite measures obtained by fixing the other block's event; adjoining the events of probability zero changes no probabilities. The first block generates Ts\mathcal{T}_s, proving claim 2.

Claim 3. First, let EsE_s be the union over the finitely many counters of the intersections, over the naturals kk with 1/k<s1/k<s, of the events where the counter increment from time s1/ks-1/k to time ss is at least 11; each such increment is a random variable by claim (iv) of Existence, Uniqueness, and Regularity for the Controlled N-Agent Dynamics, so EsFE_s\in\mathcal{F}; EsE_s contains every ω\omega at which some counter jumps at time exactly ss, and off EsE_s every counter is continuous at ss, a nondecreasing right-continuous map being continuous at ss exactly when some increment from s1/ks-1/k to ss vanishes. The event EsE_s is null: for u<su<s and a transition counter, NsNu=YAsYAuYAu+B(su)YAu=Y^B(su)(u)N_s-N_u=Y_{A_s}-Y_{A_u}\le Y_{A_u+B(s-u)}-Y_{A_u}=\hat{Y}^{(u)}_{B(s-u)}, where Y^(u)\hat{Y}^{(u)} is the corresponding residual clock at time uu (Fresh-Start Property of the Controlled N-Agent Dynamics applied at uu), using AsAuB(su)A_s-A_u\le B(s-u) from condition 2 of Solution of the Controlled N-Agent Dynamics and monotonicity of the clock path; by claim (a) of Fresh-Start Property of the Controlled N-Agent Dynamics and Moments of the Poisson Distribution the right side has expectation B(su)B(s-u). A jump at ss implies NsNu1N_s-N_u\ge1 for every u<su<s, and the probability of the latter is at most its expectation, at most B(su)B(s-u), by monotonicity; letting usu\uparrow s along a sequence gives probability zero, and likewise for observation counters with B~\tilde{B}. Summing over the finitely many counters, P(Es)=0P(E_s)=0. Put Ωs=Ω0Es\Omega^*_s=\Omega_0\setminus E_s; this proves (i).

(ii) Fix ωΩs\omega\in\Omega^*_s. Condition 1: σ^0i=σsi\hat{\sigma}^i_0=\sigma^i_s, the restarted initial state; uσ^uiu\mapsto\hat{\sigma}^i_u is the shift of the restriction to [s,T][s,T] of a piecewise constant right-continuous path, hence again of that form, and its jump times are strictly positive, since a state change of some agent at time exactly ss would force a counter jump at ss by condition 6 for the original solution, which is excluded on Ωs\Omega^*_s. Condition 2: the segment rate fields are the compositions of the original fields with (u,ω)(s+u,ω)(u,\omega)\mapsto(s+u,\omega), which is measurable (its components are), multiplied by the indicator of ΩsF\Omega^*_s\in\mathcal{F}, so they are jointly measurable with the required bounds; the resulting consumed times are, on Ωs\Omega^*_s, the increments A^ui,σγ=As+ui,σγAsi,σγ\hat{A}^{i,\sigma\gamma}_u=A^{i,\sigma\gamma}_{s+u}-A^{i,\sigma\gamma}_s and A~^ui,υ=A~s+ui,υA~si,υ\hat{\tilde{A}}^{i,\upsilon}_u=\tilde{A}^{i,\upsilon}_{s+u}-\tilde{A}^{i,\upsilon}_s, by additivity of the integral over [0,s][0,s] and [s,s+u][s,s+u] (single points being immaterial, Restricted Lebesgue Measure and Integral Toolkit on a Compact Interval) and Translation Invariance of Lebesgue Measure and the Lebesgue Integral applied to the shifted integrand. Condition 3: on Ωs\Omega^*_s, Y^A^ui,σγi,σγ=YAsi,σγ+A^ui,σγi,σγYAsi,σγi,σγ=Ns+ui,σγNsi,σγ=N^ui,σγ\hat{Y}^{i,\sigma\gamma}_{\hat{A}^{i,\sigma\gamma}_u}=Y^{i,\sigma\gamma}_{A^{i,\sigma\gamma}_s+\hat{A}^{i,\sigma\gamma}_u}-Y^{i,\sigma\gamma}_{A^{i,\sigma\gamma}_s}=N^{i,\sigma\gamma}_{s+u}-N^{i,\sigma\gamma}_s=\hat{N}^{i,\sigma\gamma}_u by the definition of the residual clocks, and likewise for observation clocks; each map uN^ui,σγu\mapsto\hat{N}^{i,\sigma\gamma}_u coincides on [0,Ts][0,T-s] with the restriction of a counting path: taking a counting path Φ\Phi agreeing with tNti,σγt\mapsto N^{i,\sigma\gamma}_t on [0,T][0,T] (condition 3 for the original solution), the shifted path vΦ(s+v)Φ(s)v\mapsto\Phi(s+v)-\Phi(s) is nondecreasing, right-continuous, integer-valued, starts at 00, and has jumps of size one at strictly increasing, strictly positive times, since Φ\Phi does not jump at ss on Ωs\Omega^*_s; the same argument applies to the observation counters, the observation total, and the grand total. Condition 4: Υ^uυ=Υs+uυΥsυ=1NiN~^ui,υ\hat{\Upsilon}^\upsilon_u=\Upsilon^\upsilon_{s+u}-\Upsilon^\upsilon_s=\frac{1}{N}\sum_i\hat{\tilde{N}}^{i,\upsilon}_u by condition 4 for the original solution. Condition 6: subtract the state identity at ss from the one at s+us+u.

(iii) On Ωs\Omega^*_s the jump times of the segment observation total in [0,Ts][0,T-s] are exactly the τ^j=τKs+js\hat{\tau}_j=\tau_{K_s+j}-s (no jump occurs at ss), with channels υ^j=υKs+j\hat{\upsilon}_j=\upsilon_{K_s+j}, and the segment count is K^u=Ks+uKs\hat{K}_u=K_{s+u}-K_s. By condition 5 for the original solution at time s+us+u, α^u=αs+u=hKs+u(s+u, τ1,,τKs+u, υ1,,υKs+u),\hat{\alpha}_u=\alpha_{s+u}=h_{K_{s+u}}\bigl(s+u,\ \tau_1,\dots,\tau_{K_{s+u}},\ \upsilon_1,\dots,\upsilon_{K_{s+u}}\bigr), and the argument tuple splits into the first KsK_s events, which are exactly the events of Ws(ω)W_s(\omega) by claim 1, followed by the times s+τ^js+\hat{\tau}_j with channels υ^j\hat{\upsilon}_j for jK^uj\le\hat{K}_u; by the definition of the prefix-frozen policy this value is (hs,Ws(ω))K^u(u,τ^1,,τ^K^u,υ^1,,υ^K^u)(h^{s,W_s(\omega)})_{\hat{K}_u}(u,\hat{\tau}_1,\dots,\hat{\tau}_{\hat{K}_u},\hat{\upsilon}_1,\dots,\hat{\upsilon}_{\hat{K}_u}), as asserted. For fixed ϱ\varrho, on the set of ωΩs\omega\in\Omega^*_s with Ws(ω)=ϱW_s(\omega)=\varrho this is the control identity for the fixed policy hs,ϱh^{s,\varrho}, and conditions 1--4 and 6 hold at every point of Ωs\Omega^*_s, so all pathwise requirements hold there with policy hs,ϱh^{s,\varrho}.

(iv) The segment count at horizon TsT-s is KTKsK_T-K_s, with the times τ^j(0,Ts]\hat{\tau}_j\in(0,T-s] strictly increasing and channels υ^j\hat{\upsilon}_j; comparing with the definition of ιs\iota_s and kW(s)=Ksk_W(s)=K_s gives that the record formed from the segment events is ιs(W)=W^\iota_s(W)=\hat{W}.

Claim 4. Measurability: the map (r,ω)(Ws(ω)sr,ω)(r',\omega)\mapsto(W_s(\omega)\oplus_s r',\omega) is measurable from RTsTs\mathcal{R}_{T-s}\otimes\mathcal{T}_s to RTT\mathcal{R}_T\otimes\mathcal{T}: its first component is the composition of the pairing (r,ω)(Ws(ω),r)(r',\omega)\mapsto(W_s(\omega),r') (measurable since WsW_s is Gs\mathcal{G}_s-measurable, GsFssysTs\mathcal{G}_s\subseteq\mathcal{F}^{\mathrm{sys}}_s\subseteq\mathcal{T}_s, and rectangles generate the product) with s\oplus_s, measurable by claim 2 of Splitting of the Observation Record Space at an Intermediate Time; its second component is the identity, measurable into T\mathcal{T} since TTs\mathcal{T}\subseteq\mathcal{T}_s by claim 2. The set GG lies in RTT\mathcal{R}_T\otimes\mathcal{T}, so its pullback lies in RTsTs\mathcal{R}_{T-s}\otimes\mathcal{T}_s. Decompose RTs×Ω\mathbf{R}_{T-s}\times\Omega over the cells Ck,vC'_{k',v'} and the events where Ks=κK_s=\kappa: on each piece, the event-position evaluations (r,ω)Σ(s+tj)q,γ(ω)(r',\omega)\mapsto\Sigma^{q,\gamma}_{(s+t'_j)-}(\omega) (the (κ+j)(\kappa+j)-th event-time evaluations of q=Ws(ω)srq=W_s(\omega)\oplus_s r') are compositions of the measurable map above with the fields of claim (b) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records, and (r,ω)[s,T]b~tot(Σuq(ω))du(r',\omega)\mapsto\int_{[s,T]}\tilde{b}^{\mathrm{tot}}(\Sigma^{q}_u(\omega))du is measurable by claim (a) there, the composition arguments of claim 2 of Conditional Density of the Observation Record Given the Initial States and Transition Clocks, and the Tonelli theorem; finite products, exp\exp, and the case split over the pullback of GG preserve measurability (Sequentially Continuous Functions of Measurable Euclidean Maps are Measurable). The bound on cells holds since each event factor is at most NB~N\tilde{B} (the aggregate drift is bounded by B~\tilde{B}) and the exponential factor is at most 11.

Factorization: let ΩG\Omega_G be an event of probability one with RT×ΩGG\mathbf{R}_T\times\Omega_G\subseteq G and let Ωf\Omega_f be the probability-one event of claim (f) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records on which (W(ω),ω)G(W(\omega),\omega)\in G and the reconstruction at W(ω)W(\omega) reproduces the occupation indicators and consumed times of the solution on [0,T][0,T]. Fix ωΩ0ΩGΩf\omega\in\Omega_0\cap\Omega_G\cap\Omega_f and rRTsr'\in\mathbf{R}_{T-s}, and put q=Ws(ω)srq=W_s(\omega)\oplus_s r'. The records W(ω)W(\omega) and qq have kW(ω)(s)=kq(s)=Ks(ω)k_{W(\omega)}(s)=k_q(s)=K_s(\omega) and identical first Ks(ω)K_s(\omega) events (both prefixes are Ws(ω)W_s(\omega), claim 1 of Splitting of the Observation Record Space at an Intermediate Time), and both (W(ω),ω)(W(\omega),\omega) and (q,ω)(q,\omega) lie in GG; by causality (claim (e) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records) the reconstructed occupation fields at qq and at W(ω)W(\omega) agree on [0,s][0,s], and by claim (f) the latter agree with the solution's on [0,T][0,T]. Hence Σuq(ω)=Σu(ω)\Sigma^{q}_u(\omega)=\Sigma_u(\omega) for u[0,s]u\in[0,s], and the paths being piecewise constant, the left limits agree at every point of (0,s](0,s], in particular at the prefix event times. Splitting the product in the definition of f(q,ω)f(q,\omega) at index Ks(ω)K_s(\omega) and the integral over [0,T][0,T] into [0,s][0,s] and [s,T][s,T] (additivity; the point ss is immaterial), and using that the exponential of a sum is the product of the exponentials (The Real Exponential Function), gives f(q,ω)=fs(ω)f^(r,ω)f(q,\omega)=f_s(\omega)\hat{f}(r',\omega), the prefix block reducing to fs(ω)f_s(\omega) by the identities just established. This holds simultaneously for every rr' on the displayed probability-one event.

Claim 5. Let Ω^1\hat{\Omega}_1 be the almost-sure event on which every residual observation clock has finite, strictly increasing, unbounded jump times, provided by part (a) of Jump Times of the Homogeneous Poisson Process: Finiteness and Exponential Interarrival Law, applicable since each Y~^d\hat{\tilde{Y}}^d is a homogeneous Poisson process of rate 11 with counting paths by claim (a) of Fresh-Start Property of the Controlled N-Agent Dynamics; let ξ^1d,ξ^2d,\hat{\xi}^d_1,\hat{\xi}^d_2,\dots be its interarrival times as in part (b) there, set to 00 off Ω^1\hat{\Omega}_1, each measurable over the σ\sigma-algebra generated by the variables of Y~^d\hat{\tilde{Y}}^d and the null events.

Step 1: the threshold vector. Fix k0k\ge0 and let Ξ^\hat{\Xi} be the Rn(k+1)\mathbb{R}^{n(k+1)}-valued map with components ξ^jd\hat{\xi}^d_j, 1jk+11\le j\le k+1. Its components are independent: grouping events by clock, the product rule follows from the independence of the family of claim (b) of Fresh-Start Property of the Controlled N-Agent Dynamics by the block argument of claim 2, and within each clock from part (b) of Jump Times of the Homogeneous Poisson Process: Finiteness and Exponential Interarrival Law. By claim 1 of Joint Distribution, Expectations, and Block Independence for Independent Random Variables, the distribution of Ξ^\hat{\Xi} is the product of its marginals, each the exponential law with density h(u)=eu1(0,)(u)h(u)=e^{-u}\mathbf{1}_{(0,\infty)}(u); as in the identification of product densities via claims 1 and 2 of Uniqueness of Finite Measures on a Generating Pi-System and the Density of the Exponential Law, claim 3 of Finite Products of Lebesgue Measure and Coordinate Integration on Rl\mathbb{R}^l, and Image Measures, Measures with Densities, and Change of Variables, this distribution is the measure with density e(u)=d,jh(ud,j)e(u)=\prod_{d,j}h(u_{d,j}) with respect to λn(k+1)\lambda_{n(k+1)}. Moreover σ(Ξ^)\sigma(\hat{\Xi}) is independent of Ts\mathcal{T}'_s, the enlargement of Ts\mathcal{T}_s by the null events, by claim 2.

Step 2: the segment recursion. For rRTsr'\in\mathbf{R}_{T-s}, u[0,Ts]u\in[0,T-s], and an index dd, define the segment consumed fields A^ur,d(ω)=A~s+uWs(ω)sr,d(ω)A~sWs(ω)sr,d(ω)\hat{A}^{r',d}_u(\omega)=\tilde{A}^{W_s(\omega)\oplus_s r',d}_{s+u}(\omega)-\tilde{A}^{W_s(\omega)\oplus_s r',d}_{s}(\omega). By claim (a) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records, the measurable map of claim 4, and the measurable time shift, the field ((r,u),ω)A^ur,d(ω)((r',u),\omega)\mapsto\hat{A}^{r',d}_u(\omega) is measurable for the product of RTsB[0,Ts]\mathcal{R}_{T-s}\otimes\mathcal{B}_{[0,T-s]} with Ts\mathcal{T}'_s; for (Ws(ω)sr,ω)G(W_s(\omega)\oplus_s r',\omega)\in G, uA^ur,du\mapsto\hat{A}^{r',d}_u is continuous and nondecreasing by claim (c) there and claim 1 of Cumulative-Rate Time Change: Regularity, Substitution, and Crossing Times. Fix k0k\ge0, a mark vector vv with kk entries, and an RTs\mathcal{R}_{T-s}-measurable g0g\ge0. Define F^(ω,u)\hat{F}(\omega,u) for uRn(k+1)u\in\mathbb{R}^{n(k+1)} by the following recursion: F^=0\hat{F}=0 unless all ud,j>0u_{d,j}>0; start from the empty record R^0\hat{R}_0 of horizon TsT-s, time T^0=0\hat{T}_0=0, and zero fired counts; at stage jj, the threshold of clock dd is the sum of its first (fired count +1+1) coordinates, its crossing time is the least x[T^j,Ts]x\in[\hat{T}_j,T-s] with A^xR^j,d(ω)\hat{A}^{\hat{R}_j,d}_x(\omega) at least the threshold if such xx exists and ++\infty otherwise; the next event time is the minimum of the crossing times, fired by the first minimizing clock in the listing, with its channel appended to the record; outcomes with a repeated event time are declared degenerate and stop the recursion; and F^(ω,u)=g(R^k)\hat{F}(\omega,u)=g(\hat{R}_k) if the recursion stops after exactly kk nondegenerate events with mark vector vv, and 00 otherwise. Measurability of F^\hat{F} with respect to TsBn(k+1)\mathcal{T}'_s\otimes\mathcal{B}_{n(k+1)} follows by induction over the finitely many stages: the pairing of the stage record and time with ω\omega, composed with the jointly measurable segment consumed fields, makes the crossing comparisons measurable via the characterization that a crossing time is at most xx exactly when the consumed field at xx has reached the threshold and the stage time is at most xx, valid by continuity; finitely many minima and comparisons then produce the next stage data, and gg enters through its cell restriction under the transport.

Step 3: identification. Let Ω^2\hat{\Omega}_2 be the intersection of Ωs\Omega^*_s, Ω^1\hat{\Omega}_1, ΩG\Omega_G, and the factorization event of claim 4 (which contains the claim (f) event); P(Ω^2)=1P(\hat{\Omega}_2)=1. Fix ωΩ^2\omega\in\hat{\Omega}_2. By claim (f) and causality (claim (e)), applied to the pairs of records W(ω)W(\omega) and Ws(ω)sR^jW_s(\omega)\oplus_s\hat{R}_j, which share their first Ks(ω)+jK_s(\omega)+j events whenever R^j\hat{R}_j is the record of the first jj segment events, the actual consumed observation increments A~s+xdA~sd\tilde{A}^{d}_{s+x}-\tilde{A}^{d}_{s} coincide with A^xR^j,d\hat{A}^{\hat{R}_j,d}_x for all xx up to and including the (j+1)(j+1)-th segment event time, the consumed times being continuous. By claim 3, the segment counters are Y~^d\hat{\tilde{Y}}^d evaluated along the actual consumed increments, and on Ω^1\hat{\Omega}_1 the clock Y~^d\hat{\tilde{Y}}^d jumps exactly when its argument crosses the next partial sum of its interarrivals. It follows by induction over the segment observation events --- at each stage, the identification of the consumed fields up to and including the next event time shows that the next crossing of the recursion is exactly the next segment observation event, with the same firing clock and channel --- that the segment record satisfies W^C^k,v\hat{W}\in\hat{C}_{k,v} (the horizon-(Ts)(T-s) cell) if and only if the recursion at (ω,Ξ^(ω))(\omega,\hat{\Xi}(\omega)) stops after exactly kk nondegenerate events with marks vv, in which case the segment event times are the recursion's event times; the crossing clock at each event is unique, by condition 3 for the segment solution (claim 3: the segment observation total jumps by exactly one), so no degenerate outcome occurs; and the recursion stops, the segment count being finite. Therefore 1C^k,v(W^)g(W^)=F^(,Ξ^())\mathbf{1}_{\hat{C}_{k,v}}(\hat{W})g(\hat{W})=\hat{F}(\cdot,\hat{\Xi}(\cdot)) on Ω^2\hat{\Omega}_2. For Ts\mathcal{T}_s-measurable Z0Z\ge0, the map (ω,u)Z(ω)F^(ω,u)(\omega,u)\mapsto Z(\omega)\hat{F}(\omega,u) is TsBn(k+1)\mathcal{T}'_s\otimes\mathcal{B}_{n(k+1)}-measurable, σ(Ξ^)\sigma(\hat{\Xi}) is independent of Ts\mathcal{T}'_s, and the two nonnegative maps just identified agree off a null event, so Independence Fubini: Integration in an Independent Random Vector Given a Sub-Sigma-Algebra, with the density form of the law of Ξ^\hat{\Xi} from Step 1, gives E[Zg(W^)1C^k,v(W^)]=E[Z()Rn(k+1)F^(,u)e(u)dλn(k+1)(u)].\mathbb{E}\bigl[Z\,g(\hat{W})\,\mathbf{1}_{\hat{C}_{k,v}}(\hat{W})\bigr]=\mathbb{E}\Bigl[Z(\cdot)\int_{\mathbb{R}^{n(k+1)}}\hat{F}(\cdot,u)\,e(u)\,d\lambda_{n(k+1)}(u)\Bigr].

Step 4: evaluation. Fix ωΩG\omega\in\Omega_G and abbreviate q(t)=Ws(ω)s(k,t,v)q(t')=W_s(\omega)\oplus_s(k,t',v). We claim Rn(k+1)F^(ω,u)e(u)dλn(k+1)(u)=Rk1Dk(Ts)(t)g((k,t,v))f^((k,t,v),ω)dλk(t).\int_{\mathbb{R}^{n(k+1)}}\hat{F}(\omega,u)\,e(u)\,d\lambda_{n(k+1)}(u)=\int_{\mathbb{R}^k}\mathbf{1}_{D_k(T-s)}(t')\,g\bigl((k,t',v)\bigr)\,\hat{f}\bigl((k,t',v),\omega\bigr)\,d\lambda_k(t'). We evaluate the threshold integral directly: decompose F^\hat{F} over the firing assignments of clocks to the kk events with the prescribed channels, the assignment events being disjoint up to λ\lambda-null ties; for each assignment, integrate the unconstrained coordinates to 11; integrate each survival coordinate, obtaining for clock dd the factor exe^{-x} evaluated at x=A^Tsr,ddx=\hat{A}^{r',d}_{T-s}-\ell_d with d\ell_d the consumed level at its last firing, by the crossing identity of claim 3 of Cumulative-Rate Time Change: Regularity, Substitution, and Crossing Times; the product over dd of all exponential factors telescopes to exp(dA^Tsr,d)=exp(N[s,T]b~tot(Σuq(t)(ω))du)\exp(-\sum_d\hat{A}^{r',d}_{T-s})=\exp(-N\int_{[s,T]}\tilde{b}^{\mathrm{tot}}(\Sigma^{q(t')}_u(\omega))du) by the agent-grouping identity, additivity, and Translation Invariance of Lebesgue Measure and the Lebesgue Integral; integrate the firing coordinates backwards, converting each by claim 4 of Cumulative-Rate Time Change: Regularity, Substitution, and Crossing Times (with the threshold shift removed by Translation Invariance of Lebesgue Measure and the Lebesgue Integral and the Monotone Convergence Theorem) into a time integral over the interval from the previous event to TsT-s against the firing clock's rate along the stage reconstruction; identify, by causality and piecewise constancy (all but finitely many points), the stage rates with the rates along the final record's reconstruction evaluated at left limits, finitely many points being immaterial (Restricted Lebesgue Measure and Integral Toolkit on a Compact Interval); sum over the assignments with the prescribed channels, turning the per-event factors into jNb~vj(Σ(s+tj)q(t)(ω))\prod_{j}N\tilde{b}^{v_j}(\Sigma^{q(t')}_{(s+t'_j)-}(\omega)) by the agent-grouping identity and linearity; and convert the resulting time-ordered iterated integral into the λk\lambda_k-integral over Dk(Ts)D_k(T-s) by the Tonelli theorem as in The Ordered Time Simplex: Borel Measurability and Volume. The result is the displayed identity, the case k=0k=0 being the survival computation alone.

Conclusion. Combining Steps 3 and 4 (the evaluation holding on the probability-one event ΩG\Omega_G), unwinding C^k,vgf^dρTs\int_{\hat{C}_{k,v}}g\,\hat{f}\,d\rho_{T-s} into the λk\lambda_k-integral by claims 1, 2, and 4(c) of Assembly of Measure Spaces: Restriction, Transport, One-Point Spaces, and Countable Disjoint Unions, and summing over the countably many cells by the Monotone Convergence Theorem and additivity, gives the identity of claim 5. For the normalization, take g=1g=1: then E[Z]=E[ZI^]\mathbb{E}[Z]=\mathbb{E}[Z\hat{I}] for every Ts\mathcal{T}_s-measurable Z0Z\ge0, where I^=RTsf^(r,)ρTs(dr)\hat{I}=\int_{\mathbf{R}_{T-s}}\hat{f}(r',\cdot)\rho_{T-s}(dr') is Ts\mathcal{T}_s-measurable by claim 4 and the Tonelli theorem, both measures being finite. With ZZ the indicator that I^<1\hat{I}<1, the nonnegative variable 1{I^<1}(1I^)\mathbf{1}_{\{\hat{I}<1\}}(1-\hat{I}) has expectation 00, hence vanishes almost surely; with ZZ the indicator that I^>1\hat{I}>1, the truncations min(I^,n)1\min(\hat{I},n)-1 and the Monotone Convergence Theorem give the reverse, so I^=1\hat{I}=1 almost surely.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…