TheoremBase

Proof

Throughout, (σ,γ)(\sigma,\gamma) denotes an ordered pair of distinct elements of {1,…,l}\{1,\dots,l\}; when such a pair is fixed we abbreviate β0(Σ)=β0(σ,γ,Σ)\beta_0(\Sigma)=\beta_0(\sigma,\gamma,\Sigma), β1(Σ)=β1(σ,γ,Σ)\beta_1(\Sigma)=\beta_1(\sigma,\gamma,\Sigma) and β(Σ,α)=β(σ,γ,Σ,α)\beta(\Sigma,\alpha)=\beta(\sigma,\gamma,\Sigma,\alpha). We write ∣⋅∣|\cdot| for the Euclidean norm and use without further comment the norm properties: clause 1 (the square of the norm is the sum of the squares of the coordinates), clause 4 (each coordinate satisfies ∣xi∣≤∣x∣|x_i|\le|x|) and clause 6 (the triangle inequality). By the definition of an affine-controlled transition-rate family, the control set A\mathcal{A} is nonempty, convex and compact, the maps β0(σ,γ,⋅)\beta_0(\sigma,\gamma,\cdot) and β1(σ,γ,⋅)\beta_1(\sigma,\gamma,\cdot) are Lipschitz with constant Λ\Lambda on Δl\Delta^l, and β(Σ,α)≥0\beta(\Sigma,\alpha)\ge0 for Σ∈Δl\Sigma\in\Delta^l and α∈A\alpha\in\mathcal{A}.

Step 0. Two elementary bounds.

(0a) Let n≥1n\ge1 be a natural number, let x∈Rnx\in\mathbb{R}^n and let CC be a real number with C≥0C\ge0 and ∣xi∣≤C|x_i|\le C for every i∈{1,…,n}i\in\{1,\dots,n\}. Then ∣x∣≤n C|x|\le\sqrt{n}\,C, where n\sqrt{n} denotes the nonnegative square root of nn. Indeed, applying monotonicity of squaring (clause 2) to the nonnegative reals ∣xi∣|x_i| and CC gives xi2=∣xi∣2≤C2x_i^2=|x_i|^2\le C^2 for every ii, whence

∣x∣2=∑i=1nxi2≤nC2=(n C)2.|x|^2=\sum_{i=1}^nx_i^2\le nC^2=(\sqrt{n}\,C)^2 .

Since ∣x∣≥0|x|\ge0 and n C≥0\sqrt{n}\,C\ge0, clause 2 of the same lemma, read in the other direction, gives ∣x∣≤n C|x|\le\sqrt{n}\,C.

(0b) By compactness of the simplex and the control set (clause 1), Δl\Delta^l is nonempty and closed and satisfies ∣Σ∣≤1|\Sigma|\le1 for every Σ∈Δl\Sigma\in\Delta^l; consequently ∣Σ−Σ′∣≤∣Σ∣+∣Σ′∣≤2|\Sigma-\Sigma'|\le|\Sigma|+|\Sigma'|\le2 for all Σ,Σ′∈Δl\Sigma,\Sigma'\in\Delta^l. Moreover Δl\Delta^l is convex: if Σ,Σ′∈Δl\Sigma,\Sigma'\in\Delta^l and tt is a real number with 0≤t≤10\le t\le1, then the point tΣ+(1−t)Σ′t\Sigma+(1-t)\Sigma' has nonnegative coordinates, and those coordinates sum to t⋅1+(1−t)⋅1=1t\cdot1+(1-t)\cdot1=1, so it lies in the probability simplex. Being nonempty, closed and convex, Δl\Delta^l admits the nearest-point projection πΔl\pi_{\Delta^l} by clause 1 of that lemma. This proves the second assertion of clause 1 of the statement.

Step 1. Finiteness of RR, K1K_1 and BB (clause 1).

The control set A\mathcal{A} is compact, hence bounded, so by the definition of a bounded subset there are a point α∗∈Rm\alpha_*\in\mathbb{R}^m and a real number r≥0r\ge0 with ∣α−α∗∣≤r|\alpha-\alpha_*|\le r for every α∈A\alpha\in\mathcal{A}; the triangle inequality then gives ∣α∣≤∣α∗∣+r|\alpha|\le|\alpha_*|+r for every α∈A\alpha\in\mathcal{A}. The set {∣α∣:α∈A}\{|\alpha|:\alpha\in\mathcal{A}\} is therefore nonempty and bounded above, so its supremum RR exists by the least upper bound property, and 0≤R0\le R because A\mathcal{A} is nonempty and norms are nonnegative.

Fix an ordered pair (σ,γ)(\sigma,\gamma) and a point Σ∗∈Δl\Sigma_*\in\Delta^l. For every Σ∈Δl\Sigma\in\Delta^l the Lipschitz property and (0b) give

∣β0(Σ)∣≤∣β0(Σ∗)∣+Λ∣Σ−Σ∗∣≤∣β0(Σ∗)∣+2Λ,∣β1(Σ)∣≤∣β1(Σ∗)∣+2Λ.|\beta_0(\Sigma)|\le|\beta_0(\Sigma_*)|+\Lambda|\Sigma-\Sigma_*|\le|\beta_0(\Sigma_*)|+2\Lambda,\qquad |\beta_1(\Sigma)|\le|\beta_1(\Sigma_*)|+2\Lambda .

Since there are only finitely many ordered pairs (σ,γ)(\sigma,\gamma), the set of all values ∣β1(σ,γ,Σ)∣|\beta_1(\sigma,\gamma,\Sigma)|, taken over all such pairs and all Σ∈Δl\Sigma\in\Delta^l, is nonempty and bounded above, so K1K_1 exists by the least upper bound property and K1≥0K_1\ge0. Writing M0M_0 for the supremum of the values ∣β0(σ,γ,Σ)∣|\beta_0(\sigma,\gamma,\Sigma)| over the same index set, which exists and is nonnegative for the same reason, we obtain from the Cauchy-Schwarz inequality that

0≤β(Σ,α)≤∣β0(Σ)∣+∣β1(Σ)⋅α∣≤M0+K1R0\le\beta(\Sigma,\alpha)\le|\beta_0(\Sigma)|+|\beta_1(\Sigma)\cdot\alpha|\le M_0+K_1R

for all Σ∈Δl\Sigma\in\Delta^l and α∈A\alpha\in\mathcal{A}, the first inequality being the nonnegativity requirement. Hence the set of values of β\beta is nonempty and bounded above, BB exists, and 0≤B≤M0+K1R0\le B\le M_0+K_1R. This proves clause 1.

Step 2. β\beta is a transition-rate family (clause 2).

Bounds. For all Σ∈Δl\Sigma\in\Delta^l and α∈A\alpha\in\mathcal{A} we have 0≤β(Σ,α)0\le\beta(\Sigma,\alpha) as above, and β(Σ,α)≤B\beta(\Sigma,\alpha)\le B because BB is an upper bound for the set of values of β\beta.

Lipschitz dependence on the state. Let Σ,Σ′∈Δl\Sigma,\Sigma'\in\Delta^l and α∈A\alpha\in\mathcal{A}. Using the triangle inequality, then Cauchy-Schwarz and ∣α∣≤R|\alpha|\le R,

∣β(Σ,α)−β(Σ′,α)∣≤∣β0(Σ)−β0(Σ′)∣+∣(β1(Σ)−β1(Σ′))⋅α∣≤Λ∣Σ−Σ′∣+Λ∣Σ−Σ′∣R=Λβ∣Σ−Σ′∣,|\beta(\Sigma,\alpha)-\beta(\Sigma',\alpha)|\le|\beta_0(\Sigma)-\beta_0(\Sigma')|+|(\beta_1(\Sigma)-\beta_1(\Sigma'))\cdot\alpha|\le\Lambda|\Sigma-\Sigma'|+\Lambda|\Sigma-\Sigma'|R=\Lambda_\beta|\Sigma-\Sigma'| ,

which is the asserted Lipschitz bound with constant Λβ=Λ(1+R)\Lambda_\beta=\Lambda(1+R).

Joint continuity. Let (Σn,αn)n∈N(\Sigma_n,\alpha_n)_{n\in\mathbb{N}} be a sequence in Δl×A\Delta^l\times\mathcal{A} such that the Euclidean distances d(Σn,Σ)d(\Sigma_n,\Sigma) and d(αn,α)d(\alpha_n,\alpha) converge to 00, where Σ∈Δl\Sigma\in\Delta^l and α∈A\alpha\in\mathcal{A}. Let ε>0\varepsilon>0 be real. Choose n0n_0 so large that d(Σn,Σ)≤ε/(2Λβ+2)d(\Sigma_n,\Sigma)\le\varepsilon/(2\Lambda_\beta+2) and d(αn,α)≤ε/(2K1+2)d(\alpha_n,\alpha)\le\varepsilon/(2K_1+2) for every n≥n0n\ge n_0; this is possible because both distance sequences converge to 00 and both denominators are positive. For such nn, the triangle inequality, the Lipschitz bound just proved and Cauchy-Schwarz give

∣β(Σn,αn)−β(Σ,α)∣≤∣β(Σn,αn)−β(Σ,αn)∣+∣β1(Σ)⋅(αn−α)∣≤Λβ d(Σn,Σ)+K1 d(αn,α)≤ε2+ε2=ε,|\beta(\Sigma_n,\alpha_n)-\beta(\Sigma,\alpha)|\le|\beta(\Sigma_n,\alpha_n)-\beta(\Sigma,\alpha_n)|+|\beta_1(\Sigma)\cdot(\alpha_n-\alpha)|\le\Lambda_\beta\,d(\Sigma_n,\Sigma)+K_1\,d(\alpha_n,\alpha)\le\tfrac{\varepsilon}{2}+\tfrac{\varepsilon}{2}=\varepsilon ,

where the middle step used β(Σ,αn)−β(Σ,α)=β1(Σ)⋅(αn−α)\beta(\Sigma,\alpha_n)-\beta(\Sigma,\alpha)=\beta_1(\Sigma)\cdot(\alpha_n-\alpha), which is immediate from the defining formula for β\beta. As ε\varepsilon was arbitrary, β(σ,γ,Σn,αn)\beta(\sigma,\gamma,\Sigma_n,\alpha_n) converges to β(σ,γ,Σ,α)\beta(\sigma,\gamma,\Sigma,\alpha). Both requirements of a transition-rate family with control set A\mathcal{A} and rate bound BB are met, proving clause 2.

Step 3. Affine form of the drift (clause 3).

Fix Σ∈Δl\Sigma\in\Delta^l, α∈A\alpha\in\mathcal{A} and γ\gamma. Substituting the defining formula for β\beta into the definition of the aggregate state drift gives

bγ(Σ,α)=∑σ≠γ(Σσβ0(σ,γ,Σ)−Σγβ0(γ,σ,Σ))+∑σ≠γ(Σσ(β1(σ,γ,Σ)⋅α)−Σγ(β1(γ,σ,Σ)⋅α)).b^\gamma(\Sigma,\alpha)=\sum_{\sigma\neq\gamma}\Big(\Sigma^\sigma\beta_0(\sigma,\gamma,\Sigma)-\Sigma^\gamma\beta_0(\gamma,\sigma,\Sigma)\Big)+\sum_{\sigma\neq\gamma}\Big(\Sigma^\sigma\big(\beta_1(\sigma,\gamma,\Sigma)\cdot\alpha\big)-\Sigma^\gamma\big(\beta_1(\gamma,\sigma,\Sigma)\cdot\alpha\big)\Big).

The first sum is b0γ(Σ)b^\gamma_0(\Sigma). In the second sum, the dot product is given coordinatewise by v⋅α=∑k=1mvkαkv\cdot\alpha=\sum_{k=1}^mv^k\alpha^k, so it is linear in vv for fixed α\alpha; rearranging the resulting finite double sum therefore gives

∑σ≠γ(Σσβ1(σ,γ,Σ)−Σγβ1(γ,σ,Σ))⋅α=b1γ(Σ)⋅α.\sum_{\sigma\neq\gamma}\Big(\Sigma^\sigma\beta_1(\sigma,\gamma,\Sigma)-\Sigma^\gamma\beta_1(\gamma,\sigma,\Sigma)\Big)\cdot\alpha=b^\gamma_1(\Sigma)\cdot\alpha .

Adding the two contributions proves clause 3.

Step 4. Bounds on the drift (clause 4).

Throughout this step we use 0≤Σσ≤10\le\Sigma^\sigma\le1, ∑σ≠γΣσ≤∑σ=1lΣσ=1\sum_{\sigma\neq\gamma}\Sigma^\sigma\le\sum_{\sigma=1}^l\Sigma^\sigma=1, and the fact that the index set {σ:σ≠γ}\{\sigma:\sigma\neq\gamma\} has l−1l-1 elements. We also use repeatedly that l≤2(l−1)l\le2(l-1), which holds because l≥2l\ge2.

(a) Norm bound. For every γ\gamma,

∣bγ(Σ,α)∣≤∑σ≠γΣσβ(σ,γ,Σ,α)+∑σ≠γΣγβ(γ,σ,Σ,α)≤B+(l−1)B=lB≤2(l−1)B.|b^\gamma(\Sigma,\alpha)|\le\sum_{\sigma\neq\gamma}\Sigma^\sigma\beta(\sigma,\gamma,\Sigma,\alpha)+\sum_{\sigma\neq\gamma}\Sigma^\gamma\beta(\gamma,\sigma,\Sigma,\alpha)\le B+(l-1)B=lB\le2(l-1)B .

By (0a) applied in Rl\mathbb{R}^l, ∣b(Σ,α)∣≤l⋅2(l−1)B=2l (l−1)B|b(\Sigma,\alpha)|\le\sqrt{l}\cdot2(l-1)B=2\sqrt{l}\,(l-1)B.

(b) Lipschitz dependence on the state. Let Σ,Σ′∈Δl\Sigma,\Sigma'\in\Delta^l and α∈A\alpha\in\mathcal{A}, and write β(⋅)=β(σ,γ,⋅,α)\beta(\cdot)=\beta(\sigma,\gamma,\cdot,\alpha) for the pair under consideration. For each σ≠γ\sigma\neq\gamma,

Σσβ(σ,γ,Σ,α)−Σ′σβ(σ,γ,Σ′,α)=(Σσ−Σ′σ)β(σ,γ,Σ,α)+Σ′σ(β(σ,γ,Σ,α)−β(σ,γ,Σ′,α)),\Sigma^\sigma\beta(\sigma,\gamma,\Sigma,\alpha)-\Sigma'^\sigma\beta(\sigma,\gamma,\Sigma',\alpha)=(\Sigma^\sigma-\Sigma'^\sigma)\beta(\sigma,\gamma,\Sigma,\alpha)+\Sigma'^\sigma\big(\beta(\sigma,\gamma,\Sigma,\alpha)-\beta(\sigma,\gamma,\Sigma',\alpha)\big),

whose absolute value is at most ∣Σσ−Σ′σ∣B+Σ′σΛβ∣Σ−Σ′∣|\Sigma^\sigma-\Sigma'^\sigma|B+\Sigma'^\sigma\Lambda_\beta|\Sigma-\Sigma'| by Step 2; the same estimate with γ\gamma in place of σ\sigma bounds ∣Σγβ(γ,σ,Σ,α)−Σ′γβ(γ,σ,Σ′,α)∣|\Sigma^\gamma\beta(\gamma,\sigma,\Sigma,\alpha)-\Sigma'^\gamma\beta(\gamma,\sigma,\Sigma',\alpha)| by ∣Σγ−Σ′γ∣B+Σ′γΛβ∣Σ−Σ′∣|\Sigma^\gamma-\Sigma'^\gamma|B+\Sigma'^\gamma\Lambda_\beta|\Sigma-\Sigma'|. Summing over the l−1l-1 indices σ≠γ\sigma\neq\gamma and using ∣Σσ−Σ′σ∣≤∣Σ−Σ′∣|\Sigma^\sigma-\Sigma'^\sigma|\le|\Sigma-\Sigma'|, ∣Σγ−Σ′γ∣≤∣Σ−Σ′∣|\Sigma^\gamma-\Sigma'^\gamma|\le|\Sigma-\Sigma'|, ∑σ≠γΣ′σ≤1\sum_{\sigma\neq\gamma}\Sigma'^\sigma\le1 and Σ′γ≤1\Sigma'^\gamma\le1, we obtain

∣bγ(Σ,α)−bγ(Σ′,α)∣≤(2(l−1)B+(1+(l−1))Λβ)∣Σ−Σ′∣=(2(l−1)B+lΛβ)∣Σ−Σ′∣≤2(l−1)(B+Λβ)∣Σ−Σ′∣.|b^\gamma(\Sigma,\alpha)-b^\gamma(\Sigma',\alpha)|\le\Big(2(l-1)B+\big(1+(l-1)\big)\Lambda_\beta\Big)|\Sigma-\Sigma'|=\big(2(l-1)B+l\Lambda_\beta\big)|\Sigma-\Sigma'|\le2(l-1)(B+\Lambda_\beta)|\Sigma-\Sigma'| .

By (0a), ∣b(Σ,α)−b(Σ′,α)∣≤l⋅2(l−1)(B+Λβ)∣Σ−Σ′∣=Λb∣Σ−Σ′∣|b(\Sigma,\alpha)-b(\Sigma',\alpha)|\le\sqrt{l}\cdot2(l-1)(B+\Lambda_\beta)|\Sigma-\Sigma'|=\Lambda_b|\Sigma-\Sigma'|.

(c) Lipschitz dependence on the control. Let α,α′∈A\alpha,\alpha'\in\mathcal{A} and Σ∈Δl\Sigma\in\Delta^l. From the defining formula for β\beta and Cauchy-Schwarz, ∣β(σ,γ,Σ,α)−β(σ,γ,Σ,α′)∣=∣β1(σ,γ,Σ)⋅(α−α′)∣≤K1∣α−α′∣|\beta(\sigma,\gamma,\Sigma,\alpha)-\beta(\sigma,\gamma,\Sigma,\alpha')|=|\beta_1(\sigma,\gamma,\Sigma)\cdot(\alpha-\alpha')|\le K_1|\alpha-\alpha'| for every pair. Hence

∣bγ(Σ,α)−bγ(Σ,α′)∣≤(∑σ≠γΣσ+∑σ≠γΣγ)K1∣α−α′∣≤lK1∣α−α′∣≤2(l−1)K1∣α−α′∣,|b^\gamma(\Sigma,\alpha)-b^\gamma(\Sigma,\alpha')|\le\Big(\sum_{\sigma\neq\gamma}\Sigma^\sigma+\sum_{\sigma\neq\gamma}\Sigma^\gamma\Big)K_1|\alpha-\alpha'|\le lK_1|\alpha-\alpha'|\le2(l-1)K_1|\alpha-\alpha'| ,

and (0a) gives ∣b(Σ,α)−b(Σ,α′)∣≤2l (l−1)K1∣α−α′∣|b(\Sigma,\alpha)-b(\Sigma,\alpha')|\le2\sqrt{l}\,(l-1)K_1|\alpha-\alpha'|. This proves clause 4.

Step 5. Conservation and the inflow bound (clause 5).

Let P={(σ,γ):σ,γ∈{1,…,l}, σ≠γ}P=\{(\sigma,\gamma):\sigma,\gamma\in\{1,\dots,l\},\ \sigma\neq\gamma\}. Summing the definition of bγb^\gamma over γ\gamma and regrouping the resulting finite sum over PP,

∑γ=1lbγ(Σ,α)=∑(σ,γ)∈PΣσβ(σ,γ,Σ,α)−∑(σ,γ)∈PΣγβ(γ,σ,Σ,α).\sum_{\gamma=1}^lb^\gamma(\Sigma,\alpha)=\sum_{(\sigma,\gamma)\in P}\Sigma^\sigma\beta(\sigma,\gamma,\Sigma,\alpha)-\sum_{(\sigma,\gamma)\in P}\Sigma^\gamma\beta(\gamma,\sigma,\Sigma,\alpha).

The map (σ,γ)↦(γ,σ)(\sigma,\gamma)\mapsto(\gamma,\sigma) is a bijection of PP onto itself which carries the summand Σγβ(γ,σ,Σ,α)\Sigma^\gamma\beta(\gamma,\sigma,\Sigma,\alpha) of the second sum to the summand Σσβ(σ,γ,Σ,α)\Sigma^\sigma\beta(\sigma,\gamma,\Sigma,\alpha) of the first, so the two sums are equal and the difference vanishes.

For the inflow bound, the first group of terms in bγ(Σ,α)b^\gamma(\Sigma,\alpha) is nonnegative because Σσ≥0\Sigma^\sigma\ge0 and β≥0\beta\ge0, so

bγ(Σ,α)≥−∑σ≠γΣγβ(γ,σ,Σ,α)≥−(l−1)B Σγ,b^\gamma(\Sigma,\alpha)\ge-\sum_{\sigma\neq\gamma}\Sigma^\gamma\beta(\gamma,\sigma,\Sigma,\alpha)\ge-(l-1)B\,\Sigma^\gamma ,

using β≤B\beta\le B and Σγ≥0\Sigma^\gamma\ge0. This proves clause 5.

Step 6. The projected drift (clause 6).

By Step 0(b) the projection πΔl\pi_{\Delta^l} is defined, so b^\hat{b} is well defined on Rl×A\mathbb{R}^l\times\mathcal{A}, and πΔl(x)∈Δl\pi_{\Delta^l}(x)\in\Delta^l for every x∈Rlx\in\mathbb{R}^l. If x∈Δlx\in\Delta^l then πΔl(x)=x\pi_{\Delta^l}(x)=x by clause 3 of the projection lemma, so b^(x,α)=b(x,α)\hat{b}(x,\alpha)=b(x,\alpha). For arbitrary x∈Rlx\in\mathbb{R}^l and α∈A\alpha\in\mathcal{A}, clause 4(a) applied at the point πΔl(x)∈Δl\pi_{\Delta^l}(x)\in\Delta^l gives ∣b^(x,α)∣≤2l (l−1)B|\hat{b}(x,\alpha)|\le2\sqrt{l}\,(l-1)B. Finally, for x,x′∈Rlx,x'\in\mathbb{R}^l and α∈A\alpha\in\mathcal{A}, clause 4(b) applied at the points πΔl(x),πΔl(x′)∈Δl\pi_{\Delta^l}(x),\pi_{\Delta^l}(x')\in\Delta^l together with the nonexpansiveness of the projection (clause 4 of the projection lemma) gives

∣b^(x,α)−b^(x′,α)∣≤Λb ∣πΔl(x)−πΔl(x′)∣≤Λb ∣x−x′∣.|\hat{b}(x,\alpha)-\hat{b}(x',\alpha)|\le\Lambda_b\,|\pi_{\Delta^l}(x)-\pi_{\Delta^l}(x')|\le\Lambda_b\,|x-x'| .

This proves clause 6 and completes the proof.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…