Reason: Re-version: references moved to the current (2026b/2026c) model layer after redaction of the 2026a versions, clock notation aligned (A -> T), compensator bound derived precisely, measurability steps grounded in the new measurable-arithmetic lemma, forward-reference aside removed. · 3,964 chars · 13 deps · depth 18
Statement
Adopt the setting of the compensated counters of the controlled N-agent dynamics with N agents, l states, l~ observation channels, and control dimension m: a transition-rate familyβ with rate bound B, an observation-rate familyβ~ with rate bound B~, a horizon T>0, an N-agent driving system(Ω,F,P), an observation-driven control policyh, a solution on [0,T] with regular event Ω0, counters Nti,σγ, consumed clock times Tti,σγ, and system filtration (Ftsys)t∈[0,T], and the compensated counters Mti,σγ=Nti,σγ−Tti,σγ of that lemma. Write E for the expectation. For each ordered pair (σ,γ) of distinct states define the aggregate counter, the aggregate consumed clock time, and the aggregate compensated counter
the fraktur Aσγ, a sum of consumed clock times, is unrelated to the calligraphic control-energy symbol A used in companion results of this series. Then, for every ordered pair (σ,γ) of distinct states:
(a) (Martingale, counting-path, and compensator properties.)(Mtσγ)t∈[0,T] is a square-integrable martingale with respect to (Ftsys)t∈[0,T] with M0σγ=0; almost surely, t↦Ntσγ agrees on [0,T] with a counting path; and at every ω∈Ω and all 0≤r≤t≤T,
0≤Atσγ−Arσγ≤NB(t−r).
(b) (Second and fourth moments.) For every t∈[0,T], the powers (Mtσγ)2 and (Mtσγ)4 are integrable, and
(c) (Aggregate state martingale.) Let Mt=(Mtγ)γ∈{1,…,l} be as in the martingale decomposition (the superscript shapes distinguish the per-clock compensated counters Mi,σγ, the aggregate compensated counters Mσγ, and the state martingales Mγ), and write ∣⋅∣ for the Euclidean norm (Euclidean distance to the origin) and N for the nonnegative square root. Then, almost surely, for every γ∈{1,…,l} and every t∈[0,T],
NMtγ=σ:σ=γ∑(Mtσγ−Mtγσ),
the sum running over σ∈{1,…,l} with σ=γ; and consequently, for every t∈[0,T],
Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.