Proof of Conditional Restart of the Record Channel at an Intermediate Time
lemmalem:record-restart-bridge-2026aThroughout, an observation clock index is a pair , listed once and for all as a sequence of length ; and denote the corresponding observation clock and residual observation clock, and for records . 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 and , summing the rates over all indices gives , and summing over for fixed gives , 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 and . The concatenated tuple in the display lies in the tuple set of Observation-Driven Control Policy with horizon : its entries are strictly increasing, since , and at most . The map 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 -algebra generated by the relatively open subsets with the trace of the generated -algebra of the ambient space, the composition of this map with has the measurability required by Observation-Driven Control Policy, and its values lie in . Hence is an observation-driven control policy with horizon . For : by claim (iv) of Existence, Uniqueness, and Regularity for the Controlled N-Agent Dynamics, and the times and channels with are -measurable; on , is the record with count , times , and marks , since (an event time is counted at exactly when the right-continuous count does); off it is the empty record. Decomposing the preimage of a member of over the cells and using that contains all events of probability zero, for every by claim 4(b) of Assembly of Measure Spaces: Restriction, Transport, One-Point Spaces, and Countable Disjoint Unions. The horizon- restricted solution of claim 4 of Bayes Disintegration and Filtering Formula for the Observation Record has, at each , observation-event count 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 on .
Claim 2. Fix a transition clock with consumed times , counters , and residual clock . Let be a real. On the event where : put ; the set is nonempty and closed, being continuous and nondecreasing with , so the infimum is attained, , and for , whence by continuity (for , ). Then . Measurability: for the event where is the event where , which lies in by claim (iv) of Existence, Uniqueness, and Regularity for the Controlled N-Agent Dynamics; and is the pointwise limit of the variables with the upper dyadic staircase approximations of capped at , by right-continuity of (a right-continuous clock path composed with a continuous nondecreasing time change), each being a finite sum of products of indicators of dyadic events of with the variables , dyadic in , which are -measurable by claim (iv). On the complementary event where : by the definition of the residual clocks, and is measurable with respect to the -algebra generated by and the variables of , again by the dyadic staircase argument, the paths of being counting paths by claim (a) of Fresh-Start Property of the Controlled N-Agent Dynamics, hence right-continuous, and , being -measurable. Both events lie in , so is -measurable. The initial states are -measurable (claim (iv) with ). Hence every generator of is -measurable and .
For the independence: by claim (b) of Fresh-Start Property of the Controlled N-Agent Dynamics, the finite family consisting of and the -algebras of the individual residual clocks is independent. Group it into the block consisting of and the residual transition clocks and the block of the residual observation clocks: the finite intersections of members of a block form a -system generating the block -algebra, the product rule holds on these -systems by the family independence, and it extends to the generated -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 , proving claim 2.
Claim 3. First, let be the union over the finitely many counters of the intersections, over the naturals with , of the events where the counter increment from time to time is at least ; each such increment is a random variable by claim (iv) of Existence, Uniqueness, and Regularity for the Controlled N-Agent Dynamics, so ; contains every at which some counter jumps at time exactly , and off every counter is continuous at , a nondecreasing right-continuous map being continuous at exactly when some increment from to vanishes. The event is null: for and a transition counter, , where is the corresponding residual clock at time (Fresh-Start Property of the Controlled N-Agent Dynamics applied at ), using 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 . A jump at implies for every , and the probability of the latter is at most its expectation, at most , by monotonicity; letting along a sequence gives probability zero, and likewise for observation counters with . Summing over the finitely many counters, . Put ; this proves (i).
(ii) Fix . Condition 1: , the restarted initial state; is the shift of the restriction to 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 would force a counter jump at by condition 6 for the original solution, which is excluded on . Condition 2: the segment rate fields are the compositions of the original fields with , which is measurable (its components are), multiplied by the indicator of , so they are jointly measurable with the required bounds; the resulting consumed times are, on , the increments and , by additivity of the integral over and (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 , by the definition of the residual clocks, and likewise for observation clocks; each map coincides on with the restriction of a counting path: taking a counting path agreeing with on (condition 3 for the original solution), the shifted path is nondecreasing, right-continuous, integer-valued, starts at , and has jumps of size one at strictly increasing, strictly positive times, since does not jump at on ; the same argument applies to the observation counters, the observation total, and the grand total. Condition 4: by condition 4 for the original solution. Condition 6: subtract the state identity at from the one at .
(iii) On the jump times of the segment observation total in are exactly the (no jump occurs at ), with channels , and the segment count is . By condition 5 for the original solution at time , and the argument tuple splits into the first events, which are exactly the events of by claim 1, followed by the times with channels for ; by the definition of the prefix-frozen policy this value is , as asserted. For fixed , on the set of with this is the control identity for the fixed policy , and conditions 1--4 and 6 hold at every point of , so all pathwise requirements hold there with policy .
(iv) The segment count at horizon is , with the times strictly increasing and channels ; comparing with the definition of and gives that the record formed from the segment events is .
Claim 4. Measurability: the map is measurable from to : its first component is the composition of the pairing (measurable since is -measurable, , and rectangles generate the product) with , measurable by claim 2 of Splitting of the Observation Record Space at an Intermediate Time; its second component is the identity, measurable into since by claim 2. The set lies in , so its pullback lies in . Decompose over the cells and the events where : on each piece, the event-position evaluations (the -th event-time evaluations of ) 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 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, , and the case split over the pullback of preserve measurability (Sequentially Continuous Functions of Measurable Euclidean Maps are Measurable). The bound on cells holds since each event factor is at most (the aggregate drift is bounded by ) and the exponential factor is at most .
Factorization: let be an event of probability one with and let be the probability-one event of claim (f) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records on which and the reconstruction at reproduces the occupation indicators and consumed times of the solution on . Fix and , and put . The records and have and identical first events (both prefixes are , claim 1 of Splitting of the Observation Record Space at an Intermediate Time), and both and lie in ; by causality (claim (e) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records) the reconstructed occupation fields at and at agree on , and by claim (f) the latter agree with the solution's on . Hence for , and the paths being piecewise constant, the left limits agree at every point of , in particular at the prefix event times. Splitting the product in the definition of at index and the integral over into and (additivity; the point is immaterial), and using that the exponential of a sum is the product of the exponentials (The Real Exponential Function), gives , the prefix block reducing to by the identities just established. This holds simultaneously for every on the displayed probability-one event.
Claim 5. Let 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 is a homogeneous Poisson process of rate with counting paths by claim (a) of Fresh-Start Property of the Controlled N-Agent Dynamics; let be its interarrival times as in part (b) there, set to off , each measurable over the -algebra generated by the variables of and the null events.
Step 1: the threshold vector. Fix and let be the -valued map with components , . 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 is the product of its marginals, each the exponential law with density ; 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 , and Image Measures, Measures with Densities, and Change of Variables, this distribution is the measure with density with respect to . Moreover is independent of , the enlargement of by the null events, by claim 2.
Step 2: the segment recursion. For , , and an index , define the segment consumed fields . 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 is measurable for the product of with ; for , is continuous and nondecreasing by claim (c) there and claim 1 of Cumulative-Rate Time Change: Regularity, Substitution, and Crossing Times. Fix , a mark vector with entries, and an -measurable . Define for by the following recursion: unless all ; start from the empty record of horizon , time , and zero fired counts; at stage , the threshold of clock is the sum of its first (fired count ) coordinates, its crossing time is the least with at least the threshold if such exists and 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 if the recursion stops after exactly nondegenerate events with mark vector , and otherwise. Measurability of with respect to follows by induction over the finitely many stages: the pairing of the stage record and time with , composed with the jointly measurable segment consumed fields, makes the crossing comparisons measurable via the characterization that a crossing time is at most exactly when the consumed field at has reached the threshold and the stage time is at most , valid by continuity; finitely many minima and comparisons then produce the next stage data, and enters through its cell restriction under the transport.
Step 3: identification. Let be the intersection of , , , and the factorization event of claim 4 (which contains the claim (f) event); . Fix . By claim (f) and causality (claim (e)), applied to the pairs of records and , which share their first events whenever is the record of the first segment events, the actual consumed observation increments coincide with for all up to and including the -th segment event time, the consumed times being continuous. By claim 3, the segment counters are evaluated along the actual consumed increments, and on the clock 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 (the horizon- cell) if and only if the recursion at stops after exactly nondegenerate events with marks , 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 on . For -measurable , the map is -measurable, is independent of , 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 from Step 1, gives
Step 4: evaluation. Fix and abbreviate . We claim We evaluate the threshold integral directly: decompose over the firing assignments of clocks to the events with the prescribed channels, the assignment events being disjoint up to -null ties; for each assignment, integrate the unconstrained coordinates to ; integrate each survival coordinate, obtaining for clock the factor evaluated at with 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 of all exponential factors telescopes to 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 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 by the agent-grouping identity and linearity; and convert the resulting time-ordered iterated integral into the -integral over by the Tonelli theorem as in The Ordered Time Simplex: Borel Measurability and Volume. The result is the displayed identity, the case being the survival computation alone.
Conclusion. Combining Steps 3 and 4 (the evaluation holding on the probability-one event ), unwinding into the -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 : then for every -measurable , where is -measurable by claim 4 and the Tonelli theorem, both measures being finite. With the indicator that , the nonnegative variable has expectation , hence vanishes almost surely; with the indicator that , the truncations and the Monotone Convergence Theorem give the reverse, so almost surely.
Loading…
Prerequisites
16c9799a-bd72-4b02-a9d3-691e464351eb