Reason: First publication. The block cascade of anchored good-set clocks: adapted good sets, matched escape bounds, and the energy ledger under hypothesis (EB).
Statement
Adopt the setting, notation and conventions of the extended good-set stopping-time lemma: the affine-controlled transition-rate family(β0,β1) on l states with compact convex control set A⊆Rm, its transition-rate familyβ with rate bound B, aggregate state drift b, state-Lipschitz constant Λb, control bound R and constant K1, and K2=2l(l−1)K1; the horizon T>0; the solution of the controlled N-agent dynamics with regular event Ω0, observation filtration (Gt)t∈[0,T] and system filtration (Ftsys)t∈[0,T]; the realized control α^ of the realized-control lemma; the point x0 of the probability simplexΔl; the realized mean-field flow Φ; the map S∗:[0,T]→Rl with continuous components and the deviation Yt=∣Φt−St∗∣, ∣⋅∣ being the Euclidean norm; the map A:[0,T]→A with measurable components and the control energy Et(ω)=∫[0,t]∣α^(s,ω)−As∣2ds; the real number δ>0 and the clipped-out time O of that lemma. Stopping times are those of whichever of (Gt)t∈[0,T] and (Ftsys)t∈[0,T] is named; E is the expectation; 1D is the function equal to 1 on a set D and 0 off it; ∫[0,t]⋅ds is the Lebesgue integral over a compact interval; exp is the exponential function and ⋅ the nonnegative square root. Set Ca=lelΛbT, the constant of the anchored good-set clocks lemma.
Block and level data. Let T0 be a real number with 0<T0≤T, let K be the least natural number with KT0≥T (which exists by the Archimedean property), and put tk=min(kT0,T) for k∈{0,1,…,K} and hk=tk+1−tk for k∈{0,…,K−1}. Let ε1>0, λc>0 and λo>0 be real numbers, and for k∈{0,…,K−1} set
The cascade of clocks. For k∈{0,…,K−1} let σ(k) be the anchored good-set clock of the anchored good-set clocks lemma with anchor tk and level Lk, formed for the instance of the setting above in which the energy threshold is cE(k) and the clipped-out threshold is θout(k), all other data — the rate family, the horizon, the solution, the realized control, the point x0, the flow Φ, the map S∗, the deviation Y, the map A, the energy E, the real δ and the clipped-out time O — being those fixed above and independent of the two thresholds. Define the good sets and the leave events by
and the block energy incrementsΔkE=Emin(σ(k),tk+1)−Etk, each a random variable with values in [0,4R2hk] by claim 6 of the anchored clocks lemma.
Then the following hold.
1. (Grid.)K≥1, t0=0, tK=T, and 0<hk≤T0 with tk<tk+1 for every k∈{0,…,K−1}. Moreover 0<Lk≤ε1, LK−1=ε1, and Lk=2CaLk−1 for k∈{1,…,K−1}; and 2Ca>1.
2. (Adaptedness and partition.) Each σ(k) is a stopping time of (Gt)t∈[0,T] and of (Ftsys)t∈[0,T] with values in [tk,T]. For every k∈{0,…,K} the set Gk is an event belonging to Ftksys, and G0⊇G1⊇⋯⊇GK. For every k∈{0,…,K−1} the leave event Dk satisfies Dk⊆Ω0 and Dk∈Fσ(k), the σ-algebra of events prior to σ(k) for (Ftsys)t∈[0,T]. The sets D0,…,DK−1,GK are pairwise disjoint with union Ω0.
(EB) (Tracked energy bound.)C† is a real number with
Nk=0∑K−1E[1GkΔkE]≤C†.
By claim 5 it is sufficient — but not necessary — that NE[1Ω0ET]≤C†; the left-hand side above counts only the energy accrued while the path is still tracked, and is the quantity the applications bound.
where, x1/2 denoting the nonnegative square root, x3/2=(x1/2)3 for x≥0, and, for x>0, x−3/2 and x−1/4 are the reciprocals of x3/2 and of x1/4 respectively.
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.