Reason: Proof of the multiplier identities and interval estimates: L^2 extension of the averaged identities by truncation and dominated convergence, moments of every order via the event count bound and the Poisson factorial-moments lemma, and third/fourth-order compensated estimates by the frozen-consumption device adapted (with attribution) from the published proof of lem:n-agent-compensated-martingales-2026a. Internally reviewed; every constant re-derived by the reviewer.
Proof
Fix a solution and adopt the notation of the statement; in particular nc is the number of clock labels, βˉ=max(B,B~), and we set θ=1+βˉT≥1. Throughout, Ω0 is the regular event of the solution; it has probability 1, so expectations are unchanged when integrands are modified off Ω0, and we use this silently. Several pathwise comparisons and the frozen-consumption device below are adapted from Steps 1 and 3 of the published proof of the compensated-counters lemma (version with that label), extended here from indicator multipliers 1D to general multipliers Z.
Step 0: Poisson moment inequalities. Let W be a random variable with the Poisson distribution with parameter μ∈[0,βˉT], and let j≥1 be a natural number with j≤4. By part (a) of the Poisson factorial-moments lemma, E[∏q=0j−1(W−q)]=μj; in particular E[W]=μ and E[W(W−1)]=μ2. A Poisson variable takes values in the nonnegative integers almost surely, so the pointwise inequalities for nonnegative integers below may be taken in expectation. We also record, from the value P(W=0)=e−μ of the Poisson distribution: P(W≥1)=1−e−μ≤μ, where the inequality holds for μ≤1 by the alternating series of the exponential and for μ>1 trivially, since 1−e−μ<1<μ. We use four consequences.
(P1) For every nonnegative integer x,
xj≤(2j)j1{x≥1}+2jq=0∏j−1(x−q).
Indeed, the product vanishes for integer 0≤x≤j−1 (the factor x−x occurs) and is positive for x≥j, hence is nonnegative for every nonnegative integer x; for x=0 both sides are 0; for 1≤x≤2j−1 the first term alone suffices; and for x≥2j each factor satisfies x−q≥x−j+1>x/2, so 2j∏q=0j−1(x−q)≥2j(x/2)j=xj.
(P2)E[Wj]≤mjμ with mj=(2j)j+2jθj−1: take expectations in (P1), use P(W≥1)≤μ, the factorial moment μj≤θj−1μ, and monotonicity of the expectation. Explicitly m1=4, m2=16+4θ, m3=216+8θ2, m4=4096+16θ3, and also E[W]=μ exactly.
(P3)P(W≥2)≤μ2/2: for nonnegative integers, 1{x≥2}≤x(x−1)/2, and E[W(W−1)]=μ2.
(P4) For 2≤j≤4, E[Wj1{W≥2}]≤mj′μ2 with mj′=(2j)j/2+2jθj−2: as in (P1), for nonnegative integers x and j≥2, xj1{x≥2}≤(2j)j1{x≥2}+2j∏q=0j−1(x−q) (the product also vanishes at x=1 since j≥2); take expectations and use (P3) and μj≤θj−2μ2.
Step 1: part (c). By the event count bound (part (iii) of the existence theorem), almost surelyΞt≤Ξt♯ for all t∈[0,T], where Ξt♯ is the sum, over all nc clock labels, of the variables YBti,σγ and Y~B~ti,υ, each of which has the Poisson distribution with parameter at most βˉt, as recorded there. For nonnegative real numbers x1,…,xn one has (x1+⋯+xn)p≤npmaxqxqp≤np∑qxqp, since the sum is at most n times the maximum and the p-th power is nondecreasing on [0,∞). Hence, by monotonicity of the expectation and part (b) of the Poisson factorial-moments lemma,
which is the display of (c). For the products: every counter is nonnegative and nondecreasing in t (off Ω0 the counters vanish, and on Ω0 each agrees with the restriction of a counting path by condition 3 of the solution definition), and every consumed clock time lies in [0,βˉT] by condition 2, so ∣Msa∣≤Nsa+βˉT≤ΞT+βˉT for every label a and s∈[0,T], almost surely. Hence ∣Mt1a1⋯Mtkak∣≤(ΞT+βˉT)k≤2k(ΞTk+(βˉT)k) (the two-term case of the sum-power inequality above), which is integrable by the display with p=k. This proves (c).
Step 2: part (a). Fix a clock label a and t∈[r,T]. The increment Mta−Mra is square-integrable by part (a) of the compensated-counters lemma, so Z(Mta−Mra) is integrable by the Cauchy--Schwarz inequality for the mean-square norm. By that lemma and the averaged form of the martingale property in the definition of a square-integrable martingale, E[(Mta−Mra)1D]=0 for every event D∈Frsys, where 1D is the function equal to 1 on D and 0 off D; by linearity the same holds with 1D replaced by any simple Frsys-measurable random variable (a finite linear combination of such indicators). Truncating Z at level n and discretizing the truncation's values on a dyadic grid produces simple Frsys-measurable variables Zn with ∣Zn∣≤∣Z∣+1 and Zn→Z pointwise (the device of Step 3 of the published proof cited above). Then E[(Mta−Mra)Z]=E[(Mta−Mra)(Z−Zn)] for every n, and by the Cauchy--Schwarz inequality this is bounded in absolute value by the mean-square norm of Mta−Mra times that of Z−Zn, which tends to 0 by dominated convergence applied to ∣Z−Zn∣2≤(2∣Z∣+1)2. Hence E[Z(Mta−Mra)]=0.
Step 3: part (b). All products of at most four compensated counters at times in [0,T] are integrable, and squares of products of two of them are integrable, by part (c); in particular MtaMtb and (Mta−Mra)(Mtb−Mrb) are square-integrable, so all products below involving the square-integrable multipliers Z, ZMra, ZMrb are integrable by the Cauchy--Schwarz inequality, and Z(Ata−Ara) is integrable since 0≤Ata−Ara≤βˉT everywhere by condition 2 of the solution definition together with the additivity and monotonicity of the Lebesgue integral on a compact interval. Part (b) of the compensated-counters lemma gives, for every D∈Frsys,
by linearity the identity holds with 1D replaced by any simple Frsys-measurable variable, and passing to the limit along the approximating sequence Zn of Step 2 extends it to the square-integrable Z: on the left, ∣E[(MtaMtb−MraMrb)(Z−Zn)]∣ tends to 0 by the Cauchy--Schwarz inequality and dominated convergence as in Step 2, using square-integrability of MtaMtb and MraMrb; on the right, E[(Z−Zn)(Ata−Ara)]→0 by dominated convergence with dominating function (2∣Z∣+1)βˉT. Now the algebraic identity
holds pointwise (expand the right-hand side). Multiplying by Z and taking expectations termwise (each term integrable as noted), the last two terms vanish by part (a) applied with the square-integrable multipliers ZMra and ZMrb, which are Frsys-measurable since Mra and Mrb are (adaptedness, part (iv) of the existence theorem). This proves (b).
Step 4: the fresh-start frame for (d), (e), (f). Fix r∈[0,T) and 0<δ≤T−r, write μ=βˉδ≤βˉT≤θ, and for clock labels b write ΔNb=Nr+δb−Nrb, ΔAb=Ar+δb−Arb, ΔMb=ΔNb−ΔAb. (For r=T there is no admissible δ and parts (d), (e), (f) are vacuous.) Let Y^b be the residual clocks of the fresh-start property at time r: rate-1Poisson processes with counting paths, mutually independent and jointly independent of Frsys. Since the paths of Y^b are counting paths, Y^0b=0, so Y^ub=Y^ub−Y^0b is an increment and has the Poisson distribution with parameter u by the increment law of the Poisson process definition; thus Step 0 applies to Y^μb. Three pathwise facts: (i) 0≤ΔAb≤μ at every outcome, by condition 2 of the solution definition (integrand in [0,βˉ]) and the integral toolkit; (ii) on Ω0, 0≤ΔNb≤Y^μb, since by condition 3 the increments of Nb over (r,r+δ] are increments of the clock path Yb over (Arb,Ar+δb]⊆(Arb,Arb+μ]; (iii) hence ∣ΔMb∣≤Y^μb+μ on Ω0.
Step 5: part (d). Fix the label a and suppose ∣Z∣≤ζ. Write ΔN=ΔNa, ΔA=ΔAa, ΔM=ΔMa, Y^=Y^a, and let k∈{3,4}. Integrability of Z((ΔM)k−ΔA) holds by part (c), boundedness of Z and ΔA, and the Cauchy--Schwarz inequality.
(d1) From (ΔM)k to 1{ΔN≥1}. Expand (ΔN−ΔA)k by the binomial theorem. For 0≤j≤k−1, the term with j factors ΔN consists of (jk) equal monomials, each bounded in absolute value on Ω0 by μk−jY^μj (with Y^μ0=1), whose expectation is at most mjθk−j−1μ2 by (P2) and μ≤θ (for j=0, with m0=1, since μk≤θk−2μ2≤θk−1μ2); so the whole term contributes at most (jk)mjθk−j−1μ2. For the term j=k: for nonnegative integers x, 0≤xk−1{x≥1}≤xk1{x≥2} (equality holds at x=0,1), and on Ω0, (ΔN)k1{ΔN≥2}≤Y^μk1{Y^μ≥2} since ΔN≤Y^μ are integers; so by (P4) the replacement of (ΔN)k by 1{ΔN≥1} costs at most mk′μ2 in expectation. Altogether
Numerically, c3(1)≤θ2+12θ+3(16+4θ)+108+8θ≤29θ2 and c4(1)≤θ3+16θ2+6(16+4θ)θ+4(216+8θ2)+2048+16θ2≤212θ3.
(d2) Freezing. Let ca∈[0,μ] be the frozen consumption: the integral over (r,r+δ] of the rate obtained by freezing the time-r states and observation record. As in Step 1 of the published proof cited above, ca is Frsys-measurable: the time-r states are Frsys-measurable and the observation-event count, event times, and channels up to r are measurable for the observation filtration, which is contained in Frsys, by part (iv) of the existence theorem; the frozen rate path is a measurable function of these data by composition measurability and the policy definition, and its integral is measurable by Tonelli. Let Rb={Y^μb≥1}, so P(Rb)=1−e−μ≤μ (Step 0), and R=⋃b=aRb. The pathwise claim of that proof applies verbatim:
{ΔN≥1}△{Y^caa≥1}⊆R∩Ra.
Indeed, off R no clock b=a rings in (r,r+δ]; then up to the first ring of a in the interval (or up to r+δ if there is none) no counter jumps, the states and record stay at their time-r values, and the consumed time of a follows the frozen schedule, so a rings in the interval if and only if Y^caa≥1; thus on either difference set the outcome lies in R, and in both cases Y^μa≥1 (once because a rings within budget μ, once because ca≤μ). By the pairwise independence of the residual clocks, P(R∩Ra)≤∑b=aP(Rb)P(Ra)≤ncμ2. Hence ∣E[Z1{ΔN≥1}]−E[Z1{Y^caa≥1}]∣≤ζncμ2.
(d3) Exponential formula. Splitting Z=Z+−Z− into positive and negative parts, the joint measurability of (c,ω^)↦Y^ca (right-continuity and grid limits), the independence of Y^a from Frsys, and the Tonelli theorem on the product of the two laws give, as in the published Step 1, E[Z1{Y^caa≥1}]=E[Z(1−e−ca)]. Moreover ∣1−e−c−c∣=c−(1−e−c)≤c2/2 for every c≥0: for 0≤c≤2 by the alternating series of the exponential (from the quadratic term on, the term magnitudes cn/n! are nonincreasing when c≤3), and for c>2 trivially, since then 0≤c−(1−e−c)≤c≤c2/2; the nonnegativity of c−(1−e−c) is the bound 1−e−c≤c of Step 0. Hence ∣E[Z1{Y^caa≥1}]−E[Zca]∣≤ζμ2/2, using ca∈[0,μ].
(d4) Unfreezing the compensator. On the complement of R∪Ra no clock rings in (r,r+δ], so the states and record stay at their time-r values there and ΔA=ca; always ∣ca−ΔA∣≤2μ, both lying in [0,μ]. Hence ∣E[Z(ca−ΔA)]∣≤ζ⋅2μP(R∪Ra)≤2ζncμ2.
using ck(1)+3nc+1≤212θ3(nc+1)+4(nc+1)≤213(nc+1)θ3, βˉ2≤(1+βˉ)2, and θ3≤(1+βˉT)4.
Step 6: part (e). Let Z be square-integrable and let κ=1/δ. The truncation Z(κ)=max(−κ,min(κ,Z)) is Frsys-measurable with ∣Z(κ)∣≤κ, so part (d) gives ∣E[Z(κ)((ΔM)k−ΔA)]∣≤C⋆κδ2=C⋆δ3/2. For the remainder, ∣Z−Z(κ)∣≤Z2/κ pointwise (the left side vanishes when ∣Z∣≤κ and is at most ∣Z∣≤Z2/κ otherwise), and ∣(ΔM)k−ΔA∣≤(Y^μ+μ)k+μ on Ω0 by Step 4(iii). By the independence of Y^=Y^a from Frsys (fresh-start property) and the Tonelli theorem on the product of the laws (both factors nonnegative, Z2 being Frsys-measurable),
E[∣Z−Z(κ)∣(ΔM)k−ΔA]≤κ1E[Z2]E[(Y^μ+μ)k+μ].
By the two-term sum-power inequality of Step 1 and (P2), E[(Y^μ+μ)k]≤2k(mk+θk−1)μ, so E[(Y^μ+μ)k+μ]≤(2k(mk+θk−1)+1)μ≤217θ3μ (for k=4: 16(4096+17θ3)+1≤217θ3; the case k=3 is smaller). With κ=1/δ and μ=βˉδ the remainder is at most 217θ3βˉE[Z2]δ3/2≤C⋆E[Z2]δ3/2. Adding the truncated part proves (e). (All splittings are legitimate: Z(ΔM)k and ZΔA are integrable by (c) and the Cauchy--Schwarz inequality.)
Step 7: part (f). Let a1,…,aj be clock labels, 2≤j≤4, not all equal, and let b1,…,bd be the distinct labels among them, with multiplicities j1+⋯+jd=j; then d≥2, each ji≤3, and at most two of the ji exceed 1. On Ω0, by Step 4(iii),
∣Z∣q=1∏jΔMaq≤∣Z∣i=1∏d(Y^μbi+μ)ji.
The family consisting of Frsys and the σ-algebras of the individual residual clocks is independent (fresh-start property, part (b)), so by the Tonelli theorem on the product of the laws the expectation of the right-hand side factorizes as E[∣Z∣]⋅∏i=1dE[(Y^μbi+μ)ji]; in particular the left-hand side is integrable. By (P2) and the sum-power inequality, the factors satisfy: E[Y^μ+μ]=2μ; E[(Y^μ+μ)2]≤4(16+5θ)μ≤27θμ; E[(Y^μ+μ)3]≤8(216+9θ2)μ≤211θ2μ. Running over the possible multiplicity patterns (j1,…,jd) --- namely (1,1), (2,1), (1,1,1), (3,1), (2,2), (2,1,1), (1,1,1,1) --- and using μd≤θd−2μ2, the product of the factors is in every case at most 214θ2μ2 (the largest case being (2,2) with (27θμ)2). Hence