TheoremBase

Shared-Clock Point Insertion into the Open-Loop Aggregate Solution: Exact Response Identity, Crude Bound, and Linearisation Defect

Statement

Adopt the setting and notation of Open-Loop Aggregate Solution Driven by Aggregate Transition Clocks and Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution: natural numbers N≥1N\ge1, l≥2l\ge2, m≥1m\ge1, a nonempty subset A\mathcal{A} of Euclidean space Rm\mathbb{R}^m, real numbers B≥0B\ge0 and T>0T>0, a transition-rate family β\beta on ll states with control set A\mathcal{A} and rate bound BB, the probability simplex Δl\Delta^l with its standard basis vectors δ1,…,δl\delta_1,\dots,\delta_l, the aggregate lattice GN⊆Δl\mathbb{G}_N\subseteq\Delta^l, the set L\mathcal{L} of transition labels c=(σ,γ)c=(\sigma,\gamma), which has l(l−1)l(l-1) elements, their vectors vc=δγ−δσv_c=\delta_\gamma-\delta_\sigma, clock families, control paths s↦ass\mapsto a_s, open-loop aggregate solutions with consumed clock times Cc\mathsf{C}^{c} and counters Nc\mathsf{N}^{c}, and conflict-free data; coordinates of points of Rl\mathbb{R}^l carry superscripts, Σ=(Σ1,…,Σl)\Sigma=(\Sigma^1,\dots,\Sigma^l), the letter Σ\Sigma denoting a generic point of UU in the formulas defining ψc\psi_c, gcg^{c} and E\mathcal{E} below and the solution path elsewhere. Write ∣⋅∣|\cdot| for the Euclidean norm, x⋅yx\cdot y for the dot product, ∫[0,t]⋅ ds\int_{[0,t]}\cdot\,ds for the Lebesgue integral over the compact interval [0,t][0,t] (taken componentwise for maps into Rl\mathbb{R}^l, and equal to 00 for t=0t=0), exp⁡\exp for the exponential function, and ⋅\sqrt{\cdot} for the nonnegative square root; a jump time of a counting path qq is a real number u>0u>0 with q(u)>q(u−)q(u)>q(u-), as in that definition.

Write #S\#S for the number of elements of a finite set SS. Let (U,V,βˉ)(U,V,\bar{\beta}) be a twice continuously differentiable extension of β\beta with derivative bound KK (the letter KK is used here only for this bound, never for the stopping index of the aggregate recursion); adopt its identification of Rl×Rm\mathbb{R}^l\times\mathbb{R}^m with Rl+m\mathbb{R}^{l+m}, its coordinates x1,…,xl+mx_1,\dots,x_{l+m} of a point x=(Σ,α)x=(\Sigma,\alpha), and its partial derivatives ∂i\partial_i. For a label c=(σ,γ)c=(\sigma,\gamma) define the label rate ψc:U×V→R\psi_c:U\times V\to\mathbb{R} by

ψc(Σ,α)=Σσ βˉ(σ,γ,Σ,α),\psi_c(\Sigma,\alpha)=\Sigma^{\sigma}\,\bar{\beta}(\sigma,\gamma,\Sigma,\alpha),

and, where the partial derivatives exist, its state gradient gc(Σ,α)=(∂1ψc,…,∂lψc)(Σ,α)∈Rlg^{c}(\Sigma,\alpha)=(\partial_1\psi_c,\dots,\partial_l\psi_c)(\Sigma,\alpha)\in\mathbb{R}^l and the drift Jacobian E(Σ,α)\mathcal{E}(\Sigma,\alpha), the real matrix with ll rows and ll columns and entries

Eγη(Σ,α)=∑c∈Lvcγ ∂ηψc(Σ,α)(γ,η∈{1,…,l}),\mathcal{E}^{\gamma\eta}(\Sigma,\alpha)=\sum_{c\in\mathcal{L}}v_c^{\gamma}\,\partial_\eta\psi_c(\Sigma,\alpha)\qquad(\gamma,\eta\in\{1,\dots,l\}),

so that E(Σ,α)y=∑cvc (gc(Σ,α)⋅y)\mathcal{E}(\Sigma,\alpha)y=\sum_{c}v_c\,(g^{c}(\Sigma,\alpha)\cdot y) for y∈Rly\in\mathbb{R}^l, with the matrix-vector product. Put

Λ1=l+m (B+K),Λ2=32 (l+m) K.\Lambda_1=\sqrt{l+m}\,(B+K),\qquad \Lambda_2=\tfrac{3}{2}\,(l+m)\,K .

Data. Fix a clock family pp, a control path aa, a point x0∈GNx_0\in\mathbb{G}_N, a label c0=(σ0,γ0)c_0=(\sigma_0,\gamma_0), a natural number m≥1\mathsf{m}\ge1 (unrelated to the control dimension mm), and real numbers 0<u1<u2<⋯<um0<u_1<u_2<\dots<u_{\mathsf{m}} none of which is a jump time of pc0p^{c_0}. The perturbed clock family p+p^{+} has p+,c=pcp^{+,c}=p^{c} for c≠c0c\neq c_0 and

p+,c0(u)=pc0(u)+#{k∈{1,…,m}: uk≤u}(u≥0);p^{+,c_0}(u)=p^{c_0}(u)+\#\{k\in\{1,\dots,\mathsf{m}\}:\ u_k\le u\}\qquad(u\ge0);

p+,c0p^{+,c_0} is a counting path (claim 1 below), so p+p^{+} is a clock family. Fix real numbers R≥NBTR\ge NBT, L≥0L\ge0 and D≥0D\ge0 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.\textbf{(D)}\qquad\bigl|p^{c}(u')-p^{c}(u)-(u'-u)\bigr|\le D\quad\text{for every }c\in\mathcal{L}\text{ and all }0\le u\le u'\le R\text{ with }u'-u\le L .

Assume that both (p,a,x0)(p,a,x_0) and (p+,a,x0)(p^{+},a,x_0) are conflict-free, and let Σ\Sigma and Σ+\Sigma^{+} be the open-loop aggregate solutions for these data, with consumed clock times Cc\mathsf{C}^{c}, C+,c\mathsf{C}^{+,c} and counters Nc\mathsf{N}^{c}, N+,c\mathsf{N}^{+,c}. Define the response Yt=N(Σt+−Σt)∈RlY_t=N(\Sigma^{+}_t-\Sigma_t)\in\mathbb{R}^l and the insertion count ιt=#{k∈{1,…,m}: uk≤Ct+,c0}\iota_t=\#\{k\in\{1,\dots,\mathsf{m}\}:\ u_k\le\mathsf{C}^{+,c_0}_t\} for t∈[0,T]t\in[0,T], and put

A0=2 (m+l(l−1)D)exp⁡(2 l(l−1)Λ1T).A_0=\sqrt{2}\,\bigl(\mathsf{m}+l(l-1)D\bigr)\exp\bigl(\sqrt{2}\,l(l-1)\Lambda_1T\bigr).

1. (Label rates and the exact response identity.) p+p^{+} is a clock family. For every label cc the label rate ψc\psi_c is of class C2C^2 on U×VU\times V, and at every point of Δl×A\Delta^l\times\mathcal{A} its partial derivatives satisfy ∣∂iψc∣≤B+K|\partial_i\psi_c|\le B+K and ∣∂j∂iψc∣≤3K|\partial_j\partial_i\psi_c|\le3K for all i,j∈{1,…,l+m}i,j\in\{1,\dots,l+m\}; moreover ψc(Σ,α)=Σσβ(σ,γ,Σ,α)\psi_c(\Sigma,\alpha)=\Sigma^\sigma\beta(\sigma,\gamma,\Sigma,\alpha) on Δl×A\Delta^l\times\mathcal{A}, so that Ctc=∫[0,t]Nψc(Σs,as) ds\mathsf{C}^{c}_t=\int_{[0,t]}N\psi_c(\Sigma_s,a_s)\,ds and likewise for Σ+\Sigma^{+}. The maps s↦Yss\mapsto Y_s, s↦gc(Σs,as)s\mapsto g^{c}(\Sigma_s,a_s) and s↦E(Σs,as)Yss\mapsto\mathcal{E}(\Sigma_s,a_s)Y_s are bounded on [0,T][0,T] with components measurable with respect to the trace Borel σ\sigma-algebra. For every t∈[0,T]t\in[0,T],

Yt=vc0 ιt+∑c∈Lvc(pc(Ct+,c)−pc(Ctc)),0≤ιt≤m,Y_t=v_{c_0}\,\iota_t+\sum_{c\in\mathcal{L}}v_c\Bigl(p^{c}\bigl(\mathsf{C}^{+,c}_t\bigr)-p^{c}\bigl(\mathsf{C}^{c}_t\bigr)\Bigr),\qquad 0\le\iota_t\le\mathsf{m},

and for every label cc,

∣Ct+,c−Ctc∣≤Λ1∫[0,t]∣Ys∣ ds.\bigl|\mathsf{C}^{+,c}_t-\mathsf{C}^{c}_t\bigr|\le\Lambda_1\int_{[0,t]}|Y_s|\,ds .

2. (Crude bound.) If Λ1TA0<L\Lambda_1TA_0<L, then ∣Yt∣≤A0|Y_t|\le A_0 and ∣Ct+,c−Ctc∣≤Λ1TA0|\mathsf{C}^{+,c}_t-\mathsf{C}^{c}_t|\le\Lambda_1TA_0 for every t∈[0,T]t\in[0,T] and every label cc.

3. (Linearisation defect.) If Λ1TA0<L\Lambda_1TA_0<L, then for every t∈[0,T]t\in[0,T] the defect dt∈Rl\mathsf{d}_t\in\mathbb{R}^l defined by

Yt=vc0 ιt+∫[0,t]E(Σs,as) Ys ds+dtsatisfies∣dt∣≤2 l(l−1)(D+Λ2 T A02N).Y_t=v_{c_0}\,\iota_t+\int_{[0,t]}\mathcal{E}(\Sigma_s,a_s)\,Y_s\,ds+\mathsf{d}_t\qquad\text{satisfies}\qquad |\mathsf{d}_t|\le\sqrt{2}\,l(l-1)\Bigl(D+\frac{\Lambda_2\,T\,A_0^{2}}{N}\Bigr).

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

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.

No relations recorded yet.

Comments

Log in to comment.

Loading…