Reason: New lemma: deterministic shared-clock analysis of inserting m points into one aggregate transition clock. Exact response identity, a Gronwall crude bound obtained by a bootstrap on the window length, and the linearisation defect against the drift Jacobian, all under an explicit discrepancy hypothesis on the clocks. Internally reviewed twice.
Write #S for the number of elements of a finite set S. Let (U,V,βˉ) be a twice continuously differentiable extension of β with derivative bound K (the letter K is used here only for this bound, never for the stopping index of the aggregate recursion); adopt its identification of Rl×Rm with Rl+m, its coordinates x1,…,xl+m of a point x=(Σ,α), and its partial derivatives∂i. For a label c=(σ,γ) define the label rateψc:U×V→R by
ψc(Σ,α)=Σσβˉ(σ,γ,Σ,α),
and, where the partial derivatives exist, its state gradientgc(Σ,α)=(∂1ψc,…,∂lψc)(Σ,α)∈Rl and the drift JacobianE(Σ,α), the real matrix with l rows and l columns and entries
Data. Fix a clock family p, a control path a, a point x0∈GN, a label c0=(σ0,γ0), a natural number m≥1 (unrelated to the control dimension m), and real numbers 0<u1<u2<⋯<um none of which is a jump time of pc0. The perturbed clock familyp+ has p+,c=pc for c=c0 and
p+,c0(u)=pc0(u)+#{k∈{1,…,m}:uk≤u}(u≥0);
p+,c0 is a counting path (claim 1 below), so p+ is a clock family. Fix real numbers R≥NBT, L≥0 and D≥0 and assume the discrepancy hypothesis
(D)pc(u′)−pc(u)−(u′−u)≤Dfor every c∈L and all 0≤u≤u′≤R with u′−u≤L.
Assume that both (p,a,x0) and (p+,a,x0) are conflict-free, and let Σ and Σ+ be the open-loop aggregate solutions for these data, with consumed clock times Cc, C+,c and counters Nc, N+,c. Define the responseYt=N(Σt+−Σt)∈Rl and the insertion countιt=#{k∈{1,…,m}:uk≤Ct+,c0} for t∈[0,T], and put
A0=2(m+l(l−1)D)exp(2l(l−1)Λ1T).
1. (Label rates and the exact response identity.)p+ is a clock family. For every label c the label rate ψc is of class C2 on U×V, and at every point of Δl×A its partial derivatives satisfy ∣∂iψc∣≤B+K and ∣∂j∂iψc∣≤3K for all i,j∈{1,…,l+m}; moreover ψc(Σ,α)=Σσβ(σ,γ,Σ,α) on Δl×A, so that Ctc=∫[0,t]Nψc(Σs,as)ds and likewise for Σ+. The maps s↦Ys, s↦gc(Σs,as) and s↦E(Σs,as)Ys are bounded on [0,T] with components measurable with respect to the trace Borel σ-algebra. 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.