Proof of Conditional Density of the Observation Record Given the Initial States and Transition Clocks
lemmalem:observation-record-conditional-density-2026aThroughout, an observation clock index is a pair , listed once and for all as a sequence of length , with channel ; denotes the corresponding observation clock. For a record and an index we write . We use freely the identity, valid for every and , obtained by grouping the agents by their state and using the aggregate observation drift, since agents occupy state ; the same identities hold with all values replaced by left limits at a fixed time, the left-limit states forming a configuration with empirical vector .
Claim 1. By claim 4(a) and 4(c) of Assembly of Measure Spaces: Restriction, Transport, One-Point Spaces, and Countable Disjoint Unions, is the sum of the cell masses; the cell has mass , and has mass by claims 1 and 2 of Assembly of Measure Spaces: Restriction, Transport, One-Point Spaces, and Countable Disjoint Unions (restriction and transport preserve total mass) and The Ordered Time Simplex: Borel Measurability and Volume. Summing over the mark vectors for each and using that the sum in the sense of Assembly of Measure Spaces: Restriction, Transport, One-Point Spaces, and Countable Disjoint Unions of nonnegative terms over a countable set is the limit of the partial sums along any exhausting sequence, , by the power series defining the real exponential function.
Claim 2. Fix a cell . On : each map is measurable by claim (b) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records; is a finite sum of products of coordinates with the rates , which are sequentially continuous by Observation-Rate Family, so the composition is measurable by Sequentially Continuous Functions of Measurable Euclidean Maps are Measurable. The map is measurable by claim (a) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records and the same composition argument, and is bounded by ; hence is measurable by the Tonelli theorem (sections and partial integrals of bounded jointly measurable maps), and composing with the continuous and multiplying finitely many real-valued measurable factors (Sequentially Continuous Functions of Measurable Euclidean Maps are Measurable) shows that is measurable on ; likewise on . Since the sets form a countable measurable partition of , is -measurable. The final assertion of claim 2 is the Tonelli theorem on the product of the finite measure spaces and , the map being -measurable.
Claim 3. Write for the regular event of the solution and let be the almost sure event on which every 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 applied to each clock. For an observation clock index let be its interarrival times as in part (b) of Jump Times of the Homogeneous Poisson Process: Finiteness and Exponential Interarrival Law (set to off ), so that on the -th jump time of is . Each is measurable with respect to the -algebra generated by the variables of and the null events.
Step 1: the threshold vector. Fix a natural number and let be the -valued map with components , an observation clock index and . The components are independent: for events , grouping by clock, the intersections over are measurable with respect to the independent -algebras generated by the several clocks (by condition 4 of N-Agent Driving System and the following grouping argument: finitely many independent -algebras, partitioned into disjoint blocks, generate independent block -algebras — the finite intersections of members of a block form a -system generating it, the product rule holds on these -systems by the assumed 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 blocks' events; null completions change no probabilities), so the probability of the total intersection factors over clocks, and within each clock over by 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 the marginal distributions, each of which is the exponential law with density with respect to Lebesgue measure, by claim 3 of Uniqueness of Finite Measures on a Generating Pi-System and the Density of the Exponential Law and part (b) of Jump Times of the Homogeneous Poisson Process: Finiteness and Exponential Interarrival Law. Moreover is the measure with density with respect to : both are probability measures on agreeing on the Borel rectangles, the product of the density measures having the rectangle values by claim 3 of Finite Products of Lebesgue Measure and Coordinate Integration on and induction, so they coincide by claims 1 and 2 of Uniqueness of Finite Measures on a Generating Pi-System and the Density of the Exponential Law and the generation of by rectangles.
Step 2: the observation-event recursion. Fix also a mark vector . For set unless all ; when all , define recursively: , , fired counts ; given stage with record-so-far (a record with events), time , and counts with : for each let and let be the least with if one exists ( is continuous and nondecreasing, by claim (c) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records and claim 1 of Cumulative-Rate Time Change: Regularity, Substitution, and Crossing Times), and otherwise. If all , the recursion stops with events; otherwise the next event is at , fired by the first minimizing clock in the listing, with channel ; put (a record when the times are strictly increasing; when , stop and declare the outcome degenerate) and increment . The recursion is run until it stops or until . Let if the recursion stops after exactly nondegenerate events with mark vector , and otherwise. Measurability of with respect to , where is enlarged by the null events, holds by induction on the stages: assuming the stage data and the map measurable into (cellwise, a vector of measurable times with fixed marks), the pairing composed with the jointly measurable field of claim (a) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records makes measurable; the crossing characterization , valid by continuity, finite minima, and finitely many comparisons then make the next stage data measurable, and there are finitely many stages; enters through its cell restriction, a Borel function on under the transport.
Step 3: identification and freezing. On , with the full-probability event of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records with , the record satisfies: if and only if the recursion at stops after exactly nondegenerate events with marks , and in that case the event times of are ; hence there. Indeed, by claim (f) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records the solution's consumed observation clock times equal , and by claim (e) (causality) for before the -th observation event time, and at that time as well by continuity of the consumed times (claim (c) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records and claim 1 of Cumulative-Rate Time Change: Regularity, Substitution, and Crossing Times), where is the record of the first events of ; the observation counter of clock is evaluated along a continuous nondecreasing consumed time, so on it jumps exactly when the consumed time crosses the next partial sum of the interarrivals; the observation events of the solution are therefore exactly the successive crossings of the recursion, the crossing clock at each event being unique on (condition 3 of Solution of the Controlled N-Agent Dynamics: the observation total jumps by exactly one), so no degenerate outcome occurs and the marks agree. By condition 3 of Solution of the Controlled N-Agent Dynamics, the observation total coincides with the restriction of a counting path, so is finite on and the recursion stops.
Let be -measurable and nonnegative. The map is -measurable, and is independent of (the interarrivals are measurable over the observation clocks and null events; independence of from the -algebra of all observation clocks follows from condition 4 of N-Agent Driving System by the grouping argument of Step 1). Since and agree off the null event and integrals of nonnegative measurable maps agreeing almost surely coincide, Independence Fubini: Integration in an Independent Random Vector Given a Sub-Sigma-Algebra, together with claim 3 of Image Measures, Measures with Densities, and Change of Variables to write the -integral as the -integral, gives
Step 4: evaluation of the threshold integral. Fix and abbreviate , . We claim for every ; since , this suffices for the expectations of Step 3, and combined with the cellwise decomposition below it proves claim 3. Decompose over the assignments of firing clocks with channels , the summands corresponding to disjoint events. Fix , and for clock let be the number of firings assigned to it. On the event described by , the coordinates with are unconstrained and integrate to against their density. By the Tonelli theorem and claim 3 of Finite Products of Lebesgue Measure and Coordinate Integration on , integrate the remaining coordinates iteratedly: first, for fixed firing coordinates, the survival coordinates : given that the events occur at times with final record , clock produces no further event on its remaining threshold precisely when , where is the consumed level of at its last assigned firing ( if ), namely the sum of its firing coordinates, by the crossing identity of claim 3 of Cumulative-Rate Time Change: Regularity, Substitution, and Crossing Times applied at each firing; the integral over contributes , and here causality (claim (e) of Measurable Reconstruction of the Controlled N-Agent Dynamics from Observation Records) identifies all record-so-far consumed times with those of the final record at the corresponding times. The product of these contributions with the firing densities telescopes: for each clock , the exponents sum to , so the total exponential factor is , by the agent-grouping identity and additivity of the integral.
Next integrate the firing coordinates backwards, the last event first. For fixed (hence fixed and record prefix ), the -th firing coordinate parameterizes the -th event time as follows. Apply claim 4 of Cumulative-Rate Time Change: Regularity, Substitution, and Crossing Times on to the rate , whose cumulative rate is , vanishing on so that crossings land in ; the firing occurs where reaches shifted by the already-consumed excess , with the consumed level of at its previous firing, and this shift of the integration variable leaves the Lebesgue integral invariant by Translation Invariance of Lebesgue Measure and the Lebesgue Integral (applied to truncations and passed to the limit by the Monotone Convergence Theorem when the integrand is extended-valued); claim 4 then converts the -integral into where collects all factors depending on the -th event time. Degenerate outcomes () and ties between clocks contribute nothing: for fixed values of the other coordinates each such outcome pins one firing coordinate to a single value, a -null set; so the assignment events may be treated as disjoint, with strict crossings, up to null sets. Since the reconstruction paths are piecewise constant, coincides for all but finitely many with evaluated along the record extended by an event at (causality, and left limits at agree with the values at of the shorter record's path off the finitely many transition times), and finitely many points do not affect the integrals (claim 6 of Restricted Lebesgue Measure and Integral Toolkit on a Compact Interval). Summing over the assignments with the prescribed channels and using the agent-grouping identity at each event turns the product of the per-event rate factors into , by finitely many applications of linearity. Finally, the resulting iterated time-ordered integral over of the nonnegative jointly measurable integrand equals its -integral over , by the Tonelli theorem and induction on the coordinates exactly as in the volume computation of The Ordered Time Simplex: Borel Measurability and Volume. This proves the displayed identity; the case is the survival computation alone, giving .
Conclusion of claim 3. Decompose over the cells; by the Monotone Convergence Theorem and additivity applied to the partial sums on both sides, it suffices to prove the identity of claim 3 with replaced by for each cell ; unwinding into the -integral over (claims 1, 2, and 4(c) of Assembly of Measure Spaces: Restriction, Transport, One-Point Spaces, and Countable Disjoint Unions and claim 2 of Image Measures, Measures with Densities, and Change of Variables), this is exactly what Steps 3 and 4 establish.
Claim 4. Taking in claim 3, for every -measurable , where is -measurable by claim 2. With this gives , and the nonnegative random variable has expectation , hence vanishes almost surely (if for some the expectation would exceed ), so almost surely; with , likewise almost surely, using on the truncations and the Monotone Convergence Theorem. Hence almost surely.
Claim 5. The map is -measurable by the Tonelli theorem and finite, on the cell with events. For , claim 3 with and gives by Tonelli; by claim 3 of Image Measures, Measures with Densities, and Change of Variables this identifies the image measure of under as the measure with density with respect to .
Loading…
Prerequisites
ad74f735-0ba0-4b23-96db-e599b52251f0