Reason: Proof that C^2 affine-controlled rate data restrict to an affine-controlled transition-rate family, that the unit neighbourhood V of the control set is open, convex and bounded, that the induced extension is twice continuously differentiable with derivative bound K, and that its second control derivatives vanish.
Proof
Throughout we fix an ordered pair (σ,γ) with σ=γ in {1,…,l} and abbreviate g=βˉ0(σ,γ,⋅) and gk=βˉ1k(σ,γ,⋅) for k∈{1,…,m}; these are real-valued functions on U. All estimates obtained below hold for every such pair, of which there are finitely many. We write
the second equality being the coordinate formula for the dot product. We use throughout the norm properties: clause 1 (the square of the norm is the sum of the squares of the coordinates), clause 4 (∣xi∣≤∣x∣), clause 5 (absolute homogeneity) and clause 6 (the triangle inequality). By the definition of the rate data, U is open, convex and bounded with Δl⊂U, the control set A is nonempty, convex and compact, each of g,g1,…,gm is a C1 map on U whose partial derivatives are again C1 on U, and all of ∣g∣,∣gk∣, their first partial derivatives and their second partial derivatives are bounded by K0 on U.
Step 0. Elementary bounds.
(0a) If n≥1, y∈Rn and C≥0 is a real number with ∣yi∣≤C for every i, then ∣y∣≤nC. Indeed yi2=∣yi∣2≤C2 by monotonicity of squaring (clause 2), so ∣y∣2=∑iyi2≤nC2=(nC)2, and since ∣y∣≥0 and nC≥0 the same clause, read in the other direction, gives ∣y∣≤nC.
(0b)1≤l and 1≤m: since 1≤l and 12=1, (l)2=l, clause 2 of the same lemma applied to the nonnegative reals 1 and l gives 1≤l; likewise for m.
(0c) For x=(Σ,α) and x′=(Σ′,α′) in Rl+m we have ∣Σ−Σ′∣≤∣x−x′∣ and ∣α−α′∣≤∣x−x′∣, because ∣Σ−Σ′∣2≤∣Σ−Σ′∣2+∣α−α′∣2=∣x−x′∣2 and both quantities are nonnegative, so clause 2 of the monotonicity lemma applies; similarly for the second inequality.
(0d)U×V is an open subset of Rl+m once V is known to be open (Step 2): given x=(Σ,α)∈U×V, choose ρ1,ρ2>0 such that every point within distance ρ1 of Σ lies in U and every point within distance ρ2 of α lies in V; if ∣x′−x∣<min(ρ1,ρ2) then by (0c) ∣Σ′−Σ∣<ρ1 and ∣α′−α∣<ρ2, so x′∈U×V.
Step 1. The restriction is an affine-controlled family (clause 1).
For requirement 2, let f be any one of g,g1,…,gm and let Σ,Σ′∈Δl. Since Δl⊂U and U is convex, the segment joining Σ to Σ′ lies in U. The map f is C1 on the open set U with ∣∂if∣≤K0 there, so clause (i) of the multivariate Taylor lemma, applied with n=l and M1=K0, gives
∣f(Σ)−f(Σ′)∣≤lK0∣Σ−Σ′∣.
In particular ∣β0(Σ)−β0(Σ′)∣≤lK0∣Σ−Σ′∣≤Λ∣Σ−Σ′∣, using 1≤m from (0b). Applying the displayed bound to each component gk and then (0a) in Rm gives
∣β1(Σ)−β1(Σ′)∣≤mlK0∣Σ−Σ′∣=Λ∣Σ−Σ′∣.
Thus both maps are Lipschitz with constant Λ on Δl, and since A is nonempty, convex and compact, (β0,β1) is an affine-controlled transition-rate family on l states with control set A and Lipschitz constant Λ. By clause 1 of the lemma on affine-controlled data, R and B are finite nonnegative real numbers, and by its clause 2 the associated β is a transition-rate family on l states with control set A and rate bound B. This proves clause 1.
Step 2. The set V (clause 2).
A⊆V. For α∈A the set whose infimum defines ρ(α) contains the value ∣α−α∣=0 and consists of nonnegative numbers, so ρ(α)=0<1.
Openness. Let α∈V and put s=ρ(α)<1 and ϱ=1−s>0. If ∣α′−α∣<ϱ then clause 3 of the nonexpansiveness lemma gives ρ(α′)≤∣α′−α∣+ρ(α)<ϱ+s=1, so α′∈V. Hence V is open.
The bound ∣α∣≤R+1, and boundedness. Let α∈V, put s=ρ(α)<1 and ε=(1−s)/2>0. By clause 4 of the approximation property of the infimum there is a∈A with ∣α−a∣<s+ε<1. Since ∣a∣≤R by the definition of R as a supremum, the triangle inequality gives ∣α∣≤∣a∣+∣α−a∣≤R+1. In particular every point of V lies within distance R+1 of the origin, so V is a bounded set.
Convexity. Let α,α′∈V and let t be real with 0≤t≤1. Put s=max{ρ(α),ρ(α′)}<1 and ε=(1−s)/2>0, and apply the approximation property of the infimum separately to ρ(α) and to ρ(α′) to obtain a,a′∈A with ∣α−a∣<ρ(α)+ε≤s+ε and ∣α′−a′∣<ρ(α′)+ε≤s+ε. Since A is convex, ta+(1−t)a′∈A, and by absolute homogeneity and the triangle inequality
As ρ(tα+(1−t)α′) is a lower bound for the distances to points of A, it follows that ρ(tα+(1−t)α′)<1, that is, tα+(1−t)α′∈V. This proves clause 2, and with it (0d).
Step 3. The partial derivatives of βˉ (clause 4).
Let x=(Σ,α)∈U×V.
(a) State coordinates. Fix i∈{1,…,l} and hold all coordinates of x except xi fixed. By the slice-function lemma, the slice of g in the coordinate xi is differentiable at Σ with derivative ∂ig(Σ), and likewise for each gk. The slice of F in the coordinate xi is the finite linear combination of these slices with the constant coefficients 1,α1,…,αm, so by the linear-combination rule it is differentiable with derivative ∂ig(Σ)+∑kαk∂igk(Σ). By the slice-function lemma again,
∂iF(x)=∂ig(Σ)+k=1∑mαk∂igk(Σ).
(b) Control coordinates. Fix k∈{1,…,m} and hold all coordinates except xl+k fixed. The slice of F in that coordinate is the map t↦c0+gk(Σ)t, where c0=g(Σ)+∑k′=kgk′(Σ)αk′ does not depend on t. For every real h=0 the corresponding difference quotient is
h(c0+gk(Σ)(t+h))−(c0+gk(Σ)t)=gk(Σ),
a quantity independent of h; hence the slice is differentiable with derivative gk(Σ), and by the slice-function lemma ∂l+kF(x)=gk(Σ). This is the first identity of clause 4.
(c) Second derivatives. The function ∂iF computed in (a) has exactly the form treated in (a) and (b), with g,gk replaced by ∂ig,∂igk, which are again C1 on U. Hence, for i,i′∈{1,…,l} and k∈{1,…,m},
the second identity being the third identity of clause 4. Finally ∂l+kF(x)=gk(Σ) depends only on Σ, so its slice in any control coordinate xl+k′ is constant and every difference quotient vanishes, giving ∂l+k′∂l+kF=0, the second identity of clause 4; and its slice in a state coordinate xi′ gives ∂i′∂l+kF(x)=∂i′gk(Σ). This proves clause 4.
Step 4. Derivative bounds.
By the bounds in the rate-data definition and (0a) in Rm, the vector ∂iβˉ1(σ,γ,Σ) with components ∂igk(Σ) satisfies ∣∂iβˉ1(σ,γ,Σ)∣≤mK0, and similarly for the vectors formed by ∂i′∂igk(Σ) and by gk(Σ). Using clause 2 of the present lemma (∣α∣≤R+1 on V) and the Cauchy-Schwarz inequality, the identities of Step 3 give, at every point of U×V,
Step 5. Uniform continuity of the second derivatives, and regularity.
Let ε>0 be real and put
η=2(1+m(R+1))ε,δ2=2(mK0+lK0+1)ε.
Requirement 4 of the rate-data definition, applied to each of the finitely many functions g,g1,…,gm attached to each of the finitely many ordered pairs (σ,γ), yields a real δ1>0 such that all second partial derivatives of all these functions change by at most η between any two points of U at distance at most δ1. Put δ=min{δ1,δ2}>0 and let x=(Σ,α) and x′=(Σ′,α′) be points of U×V with ∣x−x′∣≤δ; by (0c), ∣Σ−Σ′∣≤δ and ∣α−α′∣≤δ.
For i,i′∈{1,…,l} let c and c′ be the vectors of Rm with components ∂i′∂igk(Σ) and ∂i′∂igk(Σ′) respectively. By (0a), ∣c−c′∣≤mη and ∣c′∣≤mK0. Hence, by Step 3(c), the triangle inequality and Cauchy-Schwarz,
using the choices of η and δ2. For the mixed second derivatives, Step 3(c) and clause (i) of the Taylor lemma applied to gk (whose first partial derivatives are bounded by K0 on the convex set U) give
and the same bound for ∣∂i′∂l+kF(x)−∂i′∂l+kF(x′)∣; here the Taylor lemma is applied to the function ∂igk, which is C1 on U with second partial derivatives of gk as its partial derivatives, all bounded by K0. Finally ∂l+k′∂l+kF vanishes identically, so its increment is 0≤ε. This is requirement 4 of a twice continuously differentiable extension.
The estimates just obtained show in particular that every second partial derivative of F is continuous on U×V, so each first partial derivative of F is a C1 map there. Moreover each first partial derivative of F is itself continuous: by Step 3(a), the triangle inequality, Cauchy-Schwarz and clause (i) of the Taylor lemma applied to g and to each gk (all with first partial derivatives bounded by K0 on the convex set U), together with (0a) and (0c),
and ∣∂l+kF(x)−∂l+kF(x′)∣=∣gk(Σ)−gk(Σ′)∣≤lK0∣x−x′∣. Since all partial derivatives of F exist on the open set U×V and are continuous there, F is a C1 map on U×V; this is requirement 2.
Step 6. Conclusion (clause 3).
The set U is open, convex and bounded with Δl⊂U by the rate-data definition, and V is open, convex and bounded with A⊆V by Step 2. For (Σ,α)∈Δl×A the defining formulas for βˉ and for β agree, since β0,β1 are the restrictions of βˉ0,βˉ1; this is requirement 1. Requirements 2, 3 and 4 were established in Steps 5, 4 and 5 respectively. Hence (U,V,βˉ) is a twice continuously differentiable extension of β with derivative bound K, which is clause 3.