Reason: Proof for the revised lemma: the rate family is built directly on the control set, with no control-side projection. Finiteness of R, K_1, B; the transition-rate-family requirements; the affine form of the drift; the norm, state-Lipschitz and control-Lipschitz bounds with the constants of the superseded version; conservation and the inflow bound; and the state-side projected drift.
Proof
Throughout, (σ,γ) denotes an ordered pair of distinct elements of {1,…,l}; when such a pair is fixed we abbreviate β0(Σ)=β0(σ,γ,Σ), β1(Σ)=β1(σ,γ,Σ) and β(Σ,α)=β(σ,γ,Σ,α). We write ∣⋅∣ 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∣) and clause 6 (the triangle inequality). By the definition of an affine-controlled transition-rate family, the control set A is nonempty, convex and compact, the maps β0(σ,γ,⋅) and β1(σ,γ,⋅) are Lipschitz with constant Λ on Δl, and β(Σ,α)≥0 for Σ∈Δl and α∈A.
Step 0. Two elementary bounds.
(0a) Let n≥1 be a natural number, let x∈Rn and let C be a real number with C≥0 and ∣xi∣≤C for every i∈{1,…,n}. Then ∣x∣≤nC, where n denotes the nonnegative square root of n. Indeed, applying monotonicity of squaring (clause 2) to the nonnegative reals ∣xi∣ and C gives xi2=∣xi∣2≤C2 for every i, whence
∣x∣2=i=1∑nxi2≤nC2=(nC)2.
Since ∣x∣≥0 and nC≥0, clause 2 of the same lemma, read in the other direction, gives ∣x∣≤nC.
(0b) By compactness of the simplex and the control set (clause 1), Δl is nonempty and closed and satisfies ∣Σ∣≤1 for every Σ∈Δl; consequently ∣Σ−Σ′∣≤∣Σ∣+∣Σ′∣≤2 for all Σ,Σ′∈Δl. Moreover Δl is convex: if Σ,Σ′∈Δl and t is a real number with 0≤t≤1, then the point tΣ+(1−t)Σ′ has nonnegative coordinates, and those coordinates sum to t⋅1+(1−t)⋅1=1, so it lies in the probability simplex. Being nonempty, closed and convex, Δl admits the nearest-point projectionπΔl by clause 1 of that lemma. This proves the second assertion of clause 1 of the statement.
Step 1. Finiteness of R, K1 and B (clause 1).
The control set A is compact, hence bounded, so by the definition of a bounded subset there are a point α∗∈Rm and a real number r≥0 with ∣α−α∗∣≤r for every α∈A; the triangle inequality then gives ∣α∣≤∣α∗∣+r for every α∈A. The set {∣α∣:α∈A} is therefore nonempty and bounded above, so its supremum R exists by the least upper bound property, and 0≤R because A is nonempty and norms are nonnegative.
Fix an ordered pair (σ,γ) and a point Σ∗∈Δl. For every Σ∈Δl the Lipschitz property and (0b) give
Since there are only finitely many ordered pairs (σ,γ), the set of all values ∣β1(σ,γ,Σ)∣, taken over all such pairs and all Σ∈Δl, is nonempty and bounded above, so K1 exists by the least upper bound property and K1≥0. Writing M0 for the supremum of the values ∣β0(σ,γ,Σ)∣ 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+K1R
for all Σ∈Δl and α∈A, the first inequality being the nonnegativity requirement. Hence the set of values of β is nonempty and bounded above, B exists, and 0≤B≤M0+K1R. This proves clause 1.
Step 2. β is a transition-rate family (clause 2).
Bounds. For all Σ∈Δl and α∈A we have 0≤β(Σ,α) as above, and β(Σ,α)≤B because B is an upper bound for the set of values of β.
Lipschitz dependence on the state. Let Σ,Σ′∈Δl and α∈A. Using the triangle inequality, then Cauchy-Schwarz and ∣α∣≤R,
which is the asserted Lipschitz bound with constant Λβ=Λ(1+R).
Joint continuity. Let (Σn,αn)n∈N be a sequence in Δl×A such that the Euclidean distancesd(Σn,Σ) and d(αn,α)converge to 0, where Σ∈Δl and α∈A. Let ε>0 be real. Choose n0 so large that d(Σn,Σ)≤ε/(2Λβ+2) and d(αn,α)≤ε/(2K1+2) for every n≥n0; this is possible because both distance sequences converge to 0 and both denominators are positive. For such n, the triangle inequality, the Lipschitz bound just proved and Cauchy-Schwarz give
where the middle step used β(Σ,αn)−β(Σ,α)=β1(Σ)⋅(αn−α), which is immediate from the defining formula for β. As ε was arbitrary, β(σ,γ,Σn,αn) converges to β(σ,γ,Σ,α). Both requirements of a transition-rate family with control set A and rate bound B are met, proving clause 2.
Step 3. Affine form of the drift (clause 3).
Fix Σ∈Δl, α∈A and γ. Substituting the defining formula for β into the definition of the aggregate state drift gives
The first sum is b0γ(Σ). In the second sum, the dot product is given coordinatewise by v⋅α=∑k=1mvkαk, so it is linear in v for fixed α; rearranging the resulting finite double sum therefore gives
σ=γ∑(Σσβ1(σ,γ,Σ)−Σγβ1(γ,σ,Σ))⋅α=b1γ(Σ)⋅α.
Adding the two contributions proves clause 3.
Step 4. Bounds on the drift (clause 4).
Throughout this step we use 0≤Σσ≤1, ∑σ=γΣσ≤∑σ=1lΣσ=1, and the fact that the index set {σ:σ=γ} has l−1 elements. We also use repeatedly that l≤2(l−1), which holds because l≥2.
whose absolute value is at most ∣Σσ−Σ′σ∣B+Σ′σΛβ∣Σ−Σ′∣ by Step 2; the same estimate with γ in place of σ bounds ∣Σγβ(γ,σ,Σ,α)−Σ′γβ(γ,σ,Σ′,α)∣ by ∣Σγ−Σ′γ∣B+Σ′γΛβ∣Σ−Σ′∣. Summing over the l−1 indices σ=γ and using ∣Σσ−Σ′σ∣≤∣Σ−Σ′∣, ∣Σγ−Σ′γ∣≤∣Σ−Σ′∣, ∑σ=γΣ′σ≤1 and Σ′γ≤1, we obtain
By (0a), ∣b(Σ,α)−b(Σ′,α)∣≤l⋅2(l−1)(B+Λβ)∣Σ−Σ′∣=Λb∣Σ−Σ′∣.
(c) Lipschitz dependence on the control. Let α,α′∈A and Σ∈Δl. From the defining formula for β and Cauchy-Schwarz, ∣β(σ,γ,Σ,α)−β(σ,γ,Σ,α′)∣=∣β1(σ,γ,Σ)⋅(α−α′)∣≤K1∣α−α′∣ for every pair. Hence
The map (σ,γ)↦(γ,σ) is a bijection of P onto itself which carries the summand Σγβ(γ,σ,Σ,α) of the second sum to the summand Σσβ(σ,γ,Σ,α) of the first, so the two sums are equal and the difference vanishes.
For the inflow bound, the first group of terms in bγ(Σ,α) is nonnegative because Σσ≥0 and β≥0, so
bγ(Σ,α)≥−σ=γ∑Σγβ(γ,σ,Σ,α)≥−(l−1)BΣγ,
using β≤B and Σγ≥0. This proves clause 5.
Step 6. The projected drift (clause 6).
By Step 0(b) the projection πΔl is defined, so b^ is well defined on Rl×A, and πΔl(x)∈Δl for every x∈Rl. If x∈Δl then πΔl(x)=x by clause 3 of the projection lemma, so b^(x,α)=b(x,α). For arbitrary x∈Rl and α∈A, clause 4(a) applied at the point πΔl(x)∈Δl gives ∣b^(x,α)∣≤2l(l−1)B. Finally, for x,x′∈Rl and α∈A, clause 4(b) applied at the points πΔl(x),πΔl(x′)∈Δl together with the nonexpansiveness of the projection (clause 4 of the projection lemma) gives