Reason: Proof of the aggregate counter moment bounds by the hand-rolled partition route: telescoped binomial expansion against the multiplier identities and interval estimates (cubic term exact, quadratic term the exact compensator identity, cubic/quartic remainders via the third/fourth-order and mixed-product estimates), closing to NBt+3(NBt)^2+4(NBt)^{3/2} <= 6(NBt+(NBt)^2); part (c) identity adapted with attribution from Step 2 of the published proof of thm:n-agent-martingale-decomposition-2026a. Internally reviewed.
Proof
Fix a solution and an ordered pair (σ,γ) of distinct states, and write ai=(i,σγ) for the corresponding transition clock labels, i∈{1,…,N}, so that Ntσγ=∑iNtai, Atσγ=∑iAtai, and Mtσγ=∑iMtai in the notation of the compensated-counters lemma. We abbreviate M=Mσγ, A=Aσγ while the pair is fixed (Steps 1--3); Step 4 releases it. Throughout we use the multiplier identities and interval estimates for this solution, with their constant C⋆ and βˉ=max(B,B~); by part (c) of that lemma every finite product of compensated counters at times in [0,T] is integrable, so in particular Mt2, Mt4, Mt6, and Mt8 have finite expectations (each expands into a finite sum of such products), and all expectations split termwise below. Ω0 denotes the regular event; it has probability 1, so expectations are unchanged by modifications off Ω0.
Counting path. Work at an outcome in Ω0. Condition 3 of the solution definition requires that each individual counter, and also the grand total of all counters, coincide on [0,T] with restrictions of counting paths; let c1,…,cN be counting paths agreeing on [0,T] with t↦Nta1,…,t↦NtaN, and cg one agreeing with the grand total. (The aggregate Nσγ itself is not among the maps covered by condition 3; that is what we now prove.) Define c(t)=∑i=1Nci(min(t,T)) for t≥0. Then c(0)=0, c takes values that are 0 or natural numbers (finite sums of such), and c is nondecreasing. Right-continuity: each t↦ci(min(t,T)) is nondecreasing, and for nondecreasing functions the greatest lower bound over s>t is the limit along any sequence decreasing to t, so the greatest lower bound of a finite sum is the sum of the greatest lower bounds; each summand is right-continuous (for t≥T it is constant, and for t<T this is right-continuity of ci at min(t,T)=t), hence so is c. Unit jumps: for 0<t≤T, the least upper bounds over [0,t) likewise add for finite sums of nondecreasing functions, so c(t)−c(t−)=∑i(ci(t)−ci(t−)); on [0,T] the grand total is the pointwise sum of all counter paths, so cg(t)−cg(t−) equals the sum of the jumps at t of all the counting paths agreeing with the individual counters, each such jump is nonnegative, and cg(t)−cg(t−)≤1 by the unit-jump property; hence c(t)−c(t−)≤1. For t>T, c is constant on [T,∞), so c(t)−c(t−)=0 there. Thus c is a counting path agreeing with t↦Ntσγ on [0,T]; since Ω0 has probability 1, the counting-path claim holds almost surely.
Compensator bound. By condition 2 of the solution definition, each Atai is, at every outcome, the Lebesgue integral over [0,t] of a function with values in [0,B]; by the additivity and monotonicity of the integral from that toolkit, 0≤Atai−Arai≤B(t−r) for all 0≤r≤t≤T at every outcome. Summing over i gives 0≤At−Ar≤NB(t−r), as claimed; in particular A0=0 and 0≤At≤NBt everywhere.
Step 2: the second moment. Integrability of Mt2 and Mt4 was noted above. By part (b) of the compensated-counters lemma with r=0 and D=Ω, together with M0ai=0 and A0ai=0,
E[MtaiMtaj]={E[Atai]0if i=j,if i=j.
Expanding Mt2=∑i,jMtaiMtaj and summing,
E[Mt2]=i=1∑NE[Atai]=E[At]≤NBt,
using the pathwise bound of Step 1. This proves the second-moment display of (b). By the Cauchy--Schwarz inequality (against the constant 1), also E[∣Ms∣]≤NBs for every s∈[0,T], with ⋅ the nonnegative square root.
Step 3: the fourth moment. Fix t∈(0,T] (for t=0 both sides of the claimed bound vanish). For a natural number n≥1 set δ=t/n and rq=qδ for q∈{0,…,n}, and write ΔqM=Mrq+1−Mrq, ΔqMai=Mrq+1ai−Mrqai, ΔqA=Arq+1−Arq, ΔqAai=Arq+1ai−Arqai. The counters at times up to rq generate the system filtration by the solution definition and the consumed clock times are adapted by part (iv) of the existence theorem, so Mrq is Frqsys-measurable, and so are its powers Mrq2, Mrq3 and the constants (measurability is preserved by products), as the multiplier hypotheses below require. Telescoping Mt4=∑q=0n−1(Mrq+14−Mrq4) (with M0=0) and expanding Mrq+14=(Mrq+ΔqM)4 by the binomial theorem,
all terms being integrable as noted. We treat the four terms with the multiplier lemma, whose square-integrability hypotheses hold in each case because the required expectations (E[Mrq6], E[Mrq8], E[Mrq4(Mrqai)2], and so on) are finite by its part (c), and whose measurability hypotheses were checked above.
Cubic multiplier term.E[Mrq3ΔqMai]=0 for each i by part (a) of the multiplier lemma with the square-integrable Frqsys-measurable multiplier Z=Mrq3; summing over i, the first term vanishes.
Quadratic multiplier term. With Z=Mrq2, part (b) of the multiplier lemma gives, for all i,j, E[ZΔqMaiΔqMaj]=1{i=j}E[ZΔqAai] (we write 1{⋅} for the indicator equal to 1 when the subscripted condition holds and 0 otherwise). Summing over i,j and using the pathwise bounds 0≤ΔqA≤NBδ of Step 1, Z≥0, monotonicity of the expectation, and Step 2,
Linear multiplier term. Expand (ΔqM)3=∑i1,i2,i3ΔqMai1ΔqMai2ΔqMai3, the indices running over {1,…,N}. For the N3−N triples with indices not all equal, part (f) of the multiplier lemma with the integrable multiplier Mrq bounds each expectation in absolute value by C⋆E[∣Mrq∣]δ2≤C⋆NBTδ2. For the N diagonal triples, write E[Mrq(ΔqMai)3]=E[Mrq((ΔqMai)3−ΔqAai)]+E[MrqΔqAai]; the first expectation is bounded in absolute value by C⋆(1+NBT)δ3/2 by part (e) of the multiplier lemma with power k=3 and E[Mrq2]≤NBT, and the second by BδE[∣Mrq∣]≤BδNBrq using 0≤ΔqAai≤Bδ pathwise (Step 1) and Step 2. Altogether
Constant multiplier term. Expand (ΔqM)4=∑i1,i2,i3,i4ΔqMai1ΔqMai2ΔqMai3ΔqMai4. For the N4−N quadruples with indices not all equal, part (f) with Z=1 bounds each expectation in absolute value by C⋆δ2. For the N diagonal quadruples, part (d) with Z=1 and power k=4 gives E[(ΔqMai)4]≤E[ΔqAai]+C⋆δ2. Hence
E[(ΔqM)4]≤E[ΔqA]+(N+N4)C⋆δ2.
Summation. Sum the four contributions over q∈{0,…,n−1}. The quadratic term contributes at most 6(NB)2δ∑q=0n−1rq=6(NB)2δ2n(n−1)/2≤3(NBt)2, since nδ=t. Using rq≤t, the linear term's leading part contributes at most 4NBδ⋅nNBt=4(NBt)3/2; its remainder parts contribute at most 4NC⋆(1+NBT)tδ+4N3C⋆NBTtδ. The constant term contributes ∑qE[ΔqA]=E[At]≤NBt plus at most (N+N4)C⋆tδ. Hence, for every n,
and εn→0 as n→∞ (recall δ=t/n). Since the left-hand side does not depend on n, E[Mt4]≤NBt+3(NBt)2+4(NBt)3/2. Finally, with x=NBt≥0, 4x3/2=4x⋅x2≤2(x+x2), since 2uv≤u+v for nonnegative u,v (expand (u−v)2≥0). Therefore
E[Mt4]≤3NBt+5(NBt)2≤6(NBt+(NBt)2),
proving (b).
Step 4: part (c). Parts (a) and (b) are now established for every ordered pair of distinct states, so the pair (σ,γ) fixed at the outset is released; from here on, fix γ∈{1,…,l}, and σ denotes a summation variable. The derivation of the identity is adapted from Step 2 of the published proof of the martingale decomposition theorem. Work on Ω0. By part (b) of that theorem, Mtγ=Σtγ−Σ0γ−∫[0,t]bγ(Σs,αs)ds, the pathwise integrals existing almost surely by its part (a). Summing condition 6 of the solution definition over i,
NΣtγ−NΣ0γ=σ:σ=γ∑Ntσγ−σ:σ=γ∑Ntγσ.
For any ordered pair (σ′,γ′) of distinct states, the identity ∑iηsi,σ′β(σ′,γ′,Σs,αs)=NΣsσ′β(σ′,γ′,Σs,αs) holds pointwise in s on Ω0 (derived notation of the solution definition), so by the definition of the consumed clock times in condition 2 and the linearity of the Lebesgue integral,
Subtracting the last display from the preceding one and using Mσγ=Nσγ−Aσγ,
NMtγ=σ:σ=γ∑(Mtσγ−Mtγσ)on Ω0,
which is the claimed almost sure identity, Ω0 having probability 1.
For the moment bound, first note the elementary inequality (x1+⋯+xn)4≤n3∑jxj4 for real x1,…,xn: indeed (x1+⋯+xn)2≤n∑jxj2 (expand and use 2xpxq≤xp2+xq2), so (x1+⋯+xn)4≤n2(∑jxj2)2≤n2⋅n∑jxj4. Applying it with the 2(l−1) summands of the identity and taking expectations (part (b) applies to every ordered pair of distinct states),