Reason: First published proof of toolkit lemma D: hitting-time argument for below-frontier evaluations, monotone-series derivation of the tilted product-window identities from the frontier-window identities, tilted Poisson moment-function estimates, and the backward induction with frontier-splitting for the multi-base window bound. Depends only on published items; strict validation clean (only the known-benign empty_inline_math warning); coauthored with Aaron.
Proof
We record the standing facts, all valid at every point of Ω. Each clock Ya is a homogeneous Poisson process with rate 1 whose paths are counting paths, by conditions 2 and 3 of N-Agent Driving System; in particular every path is nondecreasing, right-continuous, integer-valued, and finite at every level. Evaluations of the clock paths at nonnegative random levels, and increments of a clock between two ordered random levels, are random variables with values in the natural numbers, by claim 1 of Predictable-Window Moment Identities for the Homogeneous Poisson Process; this applies to every window count below. By condition 2 of Solution of the Controlled N-Agent Dynamics, the consumed clock times Aja of each of the J given solutions are defined on all of Ω with 0≤Aja(t)≤Bat, vanish identically off the regular event, and at points of the regular event are integrals over time intervals of integrands bounded by Ba; there, splitting the interval of integration and using linearity and monotonicity of the integral, the increments satisfy 0≤Aja(t′)−Aja(t)≤Ba(t′−t) for t≤t′, while off the regular event the paths vanish; so every path of Aja is nondecreasing and continuous. The counters Nja(t)=YAja(t)a, the evaluations of the clock paths at the consumed levels, as well as the consumed times themselves, are adapted to the j-th system filtration by the adaptedness assertion of part (iv) of Existence, Uniqueness, and Regularity for the Controlled N-Agent Dynamics, hence Ft-measurable at each t; and Fs⊆Ft for s≤t, each system filtration being a filtration, which is used below whenever a variable measurable at an earlier base time is employed at a later one. Consequently A∨,a has continuous nondecreasing paths with A0∨,a=0 and At∨,a≤BaT, each At∨,a is Ft-measurable, and, the clock path being nondecreasing, the frontier countYt∨,a:=YAt∨,aa=max(N1a(t),…,NJa(t)) is Ft-measurable with right-continuous nondecreasing paths, a right-continuous path composed with a continuous nondecreasing one.
Claim 1. Define τ:=inf{s∈[0,t]:As∨,a≥W}. The set is nonempty, containing t; by continuity of the path s↦As∨,a it is closed, so the infimum is a minimum and Aτ∨,a≥W; and for s<τ one has As∨,a<W, so by continuity from the left Aτ∨,a≤W when τ>0, while for τ=0 the value A0∨,a=0≤W gives the same; hence Aτ∨,a=W and YWa=YAτ∨,aa=Yτ∨,a. For every s∈[0,t], {τ≤s}={As∨,a≥W} (if As∨,a≥W then s lies in the set, and conversely τ≤s gives As∨,a≥Aτ∨,a≥W by monotonicity), a member of Ft, both entries being Ft-measurable. Let τi:=min(t,2−i⌈2iτ⌉) for natural i≥1: each τi takes finitely many values in the dyadic grid of [0,t] together with t, each value-set {τi=q} lies in Ft, and τi↓τ with τi≥τ (for τ=t every τi=t). Hence Yτi∨,a=∑q1{τi=q}Yq∨,a is Ft-measurable, the values q being at most t and the filtrations nested, and by right-continuity of the frontier-count path Yτi∨,a→Yτ∨,a pointwise; the values being natural numbers, the sequence is eventually constant at every ω, so for every real c the set where YWa≥c equals ⋃i0≥1⋂i≥i0{Yτi∨,a≥c}, a member of Ft; thus YWa=Yτ∨,a is Ft-measurable.
Claim 2. Every path of Yai is finite at every level, so each Vi is a finite natural number everywhere, and by the series form of the real exponential function, pointwise,
Vipiexp(κiVi)=∑j≥0j!κijVipi+j,
a series of nonnegative terms. Multiplying the k series and expanding, the product ∏i=1k(Vipiexp(κiVi)) is the least upper bound of the partial sums of the countable family indexed by (j1,…,jk) with terms ∏i(κiji/ji!)Vipi+ji, by the Tonelli theorem applied to the counting measures on the index sets. By the monotone convergence theorem applied along an exhausting nondecreasing sequence of finite index sets, and by linearity of the integral of nonnegative functions over each finite partial sum,
E[Z∏i=1k(Vipiexp(κiVi))]=∑(j1,…,jk)∏iji!κijiE[Z∏iVipi+ji].
For a fixed index (j1,…,jk): dropping the factors with pi+ji=0, which equal 1 (the convention 00=1 of the statement), claim 3 of Frontier-Window and Crossing-Compensation Identities for Jointly Driven Solutions of the Controlled N-Agent Dynamics applied at the base time t to the labels with pi+ji≥1 --- a product-window identity with the multiplier Z, the anchors vi, and the widths λi --- gives E[Z∏iVipi+ji]=E[Z∏iμpi+ji(λi)], with the convention μ0:=1 for the dropped factors, and with the value E[Z] when every exponent vanishes. Summing back, again by monotone convergence and linearity,
E[Z∏i=1k(Vipiexp(κiVi))]=E[Z∑(j1,…,jk)∏i(ji!κijiμpi+ji(λi))]=E[Z∏i=1k(∑j≥0j!κijμpi+j(λi))],
the multi-indexed sum of the products factorizing into the product of the single-index sums by the Tonelli theorem once more. It remains to identify, for every natural number p≥0, real κ≥0, and x≥0,
∑j≥0j!κjμp+j(x)=μp,κ(x).
By claim 4 of Predictable-Window Moment Identities for the Homogeneous Poisson Process, μq(x)=exp(−x)∑k≥0kqxk/k! for q≥1, the term k=0 vanishing; and the same expression at q=0 evaluates, with the convention 00=1, to exp(−x)exp(x)=1=μ0, by the series form of the exponential and its functional equation. Interchanging the two summations of nonnegative terms (the Tonelli theorem again),
∑j≥0j!κjexp(−x)∑k≥0k!kp+jxk=exp(−x)∑k≥0k!kpxk∑j≥0j!(κk)j=exp(−x)∑k≥0k!kpexp(κk)xk=μp,κ(x).
This proves claim 2.
Claim 3. The identity μp,0=μp for p≥1 is the series form just quoted. For p=0: μ0,κ(x)=exp(−x)∑k≥0(xexp(κ))k/k!=exp(−x)exp(xexp(κ))=exp(x(exp(κ)−1)), by the series form of the exponential and its functional equation. For p≥1 and 0≤x≤Λˉ: since exp(−x)≤1 (for x≥0 the series gives exp(x)≥1, and exp(−x)exp(x)=1 by the functional equation, so exp(−x)≤1),
μp,κ(x)≤∑k≥1k!kpexp(κk)xk=x∑k≥1k!kpexp(κk)xk−1≤xcp,κ(Λˉ).
Finiteness of cp,κ(Λˉ): for k≥2p each of the p factors of k(k−1)⋯(k−p+1) is at least k/2, so kp≤2pk(k−1)⋯(k−p+1) and, reindexing by r=k−p,
∑k≥2pk!kpexp(κk)Λˉk−1≤2pexp(κp)∑r≥pr!exp(κr)Λˉr+p−1≤2pexp(κp)max(1,Λˉp−1)exp(Λˉexp(κ)),
using Λˉr+p−1≤max(1,Λˉp−1)Λˉr and the series of the exponential once more; the finitely many terms with k<2p are finite. Finiteness of μp,κ(x) for p≥1 follows from the linear bound with Λˉ:=x; for p=0 it is immediate from the closed form just established.
Claim 4. We induct on n. Throughout, for a label a∈A, write Ξa:=λˉa(exp(κa)−1), ea:=exp(Ξa), and, when pa≥1, γa:=cpa,κa(Λˉ)λˉa; set δa:=γa if pa≥1 and δa:=ea if pa=0, so that ca=2(pa+1)nexp(nΞa) for pa=0 and =2(pa+1)nexp(nΞa)γa for pa≥1. By claim 3 and the monotonicity of the exponential, pathwise μpa,κa(λa)≤γa for pa≥1 and μ0,κa(λa)=exp(λa(exp(κa)−1))≤ea; in either case μpa,κa(λa)≤δa.
Base case n=1. All windows share the base t1, and Z is Ft1-measurable; claim 2 and the pathwise bounds just recorded give E[Z∏a(Vapaexp(κaVa))]=E[Z∏aμpa,κa(λa)]≤∏aδaE[Z]≤∏acaE[Z]. (For A=∅ the claim is trivial.)
Inductive step. Let n≥2 and assume the claim for n−1 (with the same Vˉ, Λˉ, and caps). If no label is based at index n, the claim follows from the induction hypothesis for the chain t1≤⋯≤tn−1, the constants being nondecreasing in n. Otherwise write An:={a:b(a)=n} and A−:=A∖An. For a∈A− define
v~a:=max(va,Atn∨,a),λ~a:=(va+λa−v~a)+,
and the split Va−:=Y(va+λa)∧Atn∨,aa−Yva∧Atn∨,aa and V~a:=Yv~a+λ~aa−Yv~aa, both random variables by the standing facts. Then, at every ω, Va=Va−+V~a: if Atn∨,a≤va then Va−=0, v~a=va, λ~a=λa, V~a=Va; if va<Atn∨,a<va+λa then Va− counts the levels in the part of the window up to Atn∨,a and V~a the rest; and if Atn∨,a≥va+λa then Va−=Va and λ~a=0, V~a=0. Moreover Va− is Ftn-measurable by claim 1, both evaluation levels being Ftn-measurable and bounded by Atn∨,a everywhere; and V~a is a window on the clock a with base time tn: its anchor v~a is Ftn-measurable with Atn∨,a≤v~a≤max(Vˉ,BaT) everywhere, and its width λ~a is Ftn-measurable with 0≤λ~a≤λa≤λˉa.
Pathwise, for a∈A− with pa≥1, using (x+y)p≤2p(xp+yp) for nonnegative reals (x+y≤2max(x,y), and the p-th power is nondecreasing on the nonnegative reals) and the exact factorization exp(κaVa)=exp(κaVa−)exp(κaV~a), from the functional equation of the exponential:
Vapaexp(κaVa)≤2pa[exp(κaVa−)⋅V~apaexp(κaV~a)+(Va−)paexp(κaVa−)⋅exp(κaV~a)],
while for pa=0 the factorization is exact with a single term. Expanding the product over a∈A− distributively, the left side of the claim is at most the sum, over the subsets S of {a∈A−:pa≥1}, of ∏a∈A−2pa times
E[the multiplierZa∈S∏exp(κaVa−)a∈A−∖S∏((Va−)paexp(κaVa−))⋅∏a∈An(Vapaexp(κaVa))⋅∏a∈S(V~apaexp(κaV~a))⋅∏a∈A−∖Sexp(κaV~a)],
with the convention that for a∈A− with pa=0 the label lies in A−∖S always. The multiplier is Ftn-measurable and nonnegative, and the remaining factors are tilted windows at the common base tn on distinct clocks --- the labels of An with their original data, the labels of S with powers pa and widths λ~a, and the labels of A−∖S with powers 0 and widths λ~a --- all anchors bounded by max(Vˉ,maxaBaT) and all widths by Λˉ. Claim 2 (with that anchor bound in place of Vˉ) and the pathwise bounds on the μ-values give for this expectation the upper bound
∏a∈Anδa⋅∏a∈Sγa⋅∏a∈A−∖Sea⋅E[Z∏a∈Sexp(κaVa−)∏a∈A−∖S((Va−)paexp(κaVa−))],
using for the widths λ~a≤λˉa. Since 0≤Va−≤Va pointwise and κa≥0, the last expectation is at most E[Z∏a∈Sexp(κaVa)∏a∈A−∖S(Vapaexp(κaVa))], which is an instance of the claim for the chain t1≤⋯≤tn−1 with the original windows of A−, the powers replaced by 0 on S, and the same multiplier Z; the induction hypothesis bounds it by ∏a∈S2(0+1)(n−1)exp((n−1)Ξa)⋅∏a∈A−∖Sca(n−1)⋅E[Z], with ca(n−1) the claim's constant for n−1 bases.
Collecting, and recombining the sum over S into a product over a∈A− of the two branch values, the left side of the claim is at most ∏a∈Anδa⋅∏a∈A−σa⋅E[Z], where for pa≥1σa=2pa[γa2n−1exp((n−1)Ξa)+ea2(pa+1)(n−1)exp((n−1)Ξa)γa]≤γaexp(nΞa)2pa[2n−1+2(pa+1)(n−1)]≤γaexp(nΞa)2pa+1+(pa+1)(n−1)=ca,
using eaexp((n−1)Ξa)=exp(nΞa), exp((n−1)Ξa)≤exp(nΞa), 2n−1≤2(pa+1)(n−1), and pa+1+(pa+1)(n−1)=(pa+1)n; while for pa=0 there is a single branch and σa=ea⋅2n−1exp((n−1)Ξa)=2n−1exp(nΞa)≤ca. Finally, for a∈An with pa≥1, γa≤2(pa+1)nexp(nΞa)γa=ca, and for a∈An with pa=0, ea=exp(Ξa)≤2nexp(nΞa)=ca. This closes the induction and proves claim 4.