Open-Loop Aggregate Solution Driven by Aggregate Transition Clocks
definitionProbabilitydef:open-loop-aggregate-solution-2026aLet , and be natural numbers with , and , let be a nonempty subset of Euclidean space , let and be real numbers, and let be a transition-rate family on states with control set and rate bound . Write for the set consisting of and the natural numbers, for the probability simplex with its standard basis vectors , and, for a point , for its -th coordinate. The aggregate lattice with agents is the set
Throughout, ranges over the transition labels on states, and , with sums and scalar multiples in .
A control path is a map , written , each of whose components is measurable with respect to the trace Borel -algebra on and the Borel -algebra of the real line. A clock family on states is a family of counting paths, one for each transition label .
Let be a clock family, let be a control path, and let . An open-loop aggregate solution on for the data is a map , written , satisfying condition 1 below and, the following quantities being then well defined, condition 2. The consumed clock times and transition counters of are
the first being the Lebesgue integral over the compact interval of a map which, under condition 1, is measurable with respect to the trace Borel -algebra on and the Borel -algebra of the real line and takes values in : under condition 1 it is a finite sum of products of indicators of intervals with maps , ; each of these maps is measurable by Sequentially Continuous Functions of Measurable Euclidean Maps are Measurable (the map being sequentially continuous on by condition 2 of Transition-Rate Family with constant first argument) and claim 2 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions, the indicators, products and finite sum are measurable by claims 1, 3 and 2 of the latter, and the values lie in because for and by condition 1 of Transition-Rate Family; the integral over is .
1. (Regularity.) for every , and there are a count , either zero or a natural number, and times such that is constant on , constant on for each , and constant on , with the convention that for the map is constant on all of .
2. (State identity.) For every ,
the sum running over all transition labels.
Let moreover be a family of aggregate transition clocks on states over a probability space . A family of maps is an open-loop aggregate solution driven by for the control path and the initial point if for every the map is an open-loop aggregate solution on for the data .
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.