Reason: Carried onto lem:affine-c2-extension-2026b and re-grounded on the new Euclidean layer. Step 3 now derives the partial derivatives of the extension directly from def:partial-derivative-euclidean-2026a, replacing the withdrawn slice-function lemma; Step 5 additionally establishes continuity of the extension and of its first partial derivatives, as clause 1 of def:ck-map-euclidean-2026a requires; the ad-hoc openness argument for U x V is replaced by lem:euclidean-open-product-2026a, and the Taylor citation bumped to lem:taylor-second-order-uniform-2026b.
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 of class C2 on U — by clauses 2 and 3 of that definition this means that each is of class C1 on U and that each of its partial derivatives∂i, unambiguous by Uniqueness of the Partial Derivative on a Euclidean Open Set, is again of class 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) Once V is known to be open (Step 2), U×V is an open subset of Rl+m by claim 2 of Products of Euclidean Open Sets are Open, the identification of Rl×Rm with Rl+m being the one fixed in the statement.
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.
Admissible increments. By (0d) the set U×V is open, so there is a real r>0 such that every y∈Rl+m with ∑k=1l+m(yk−xk)2<r2 lies in U×V. For j∈{1,…,l+m} and real h write x(j,h) for the point obtained from x by replacing its jth coordinate xj by xj+h; then ∑k(xk(j,h)−xk)2=h2, so every real h with ∣h∣<r has x(j,h)∈U×V, by clause 2 of monotonicity of squaring.
(a) State coordinates. Fix i∈{1,…,l}, and note that for real h the point x(i,h) is (Σ(h),α), where Σ(h)∈Rl is obtained from Σ by replacing Σi by Σi+h; in particular the control coordinates are unchanged. Since g and each gk are of class C1 on the open set U, their partial derivatives with respect to the ith variable exist at Σ. Put
and, for each k∈{1,…,m}, every real h with 0<∣h∣<δk satisfies Σ(h)∈U and the same inequality with g and ∂ig(Σ) replaced by gk and ∂igk(Σ). Let δ be the least of the finitely many positive reals r,δ0,δ1,…,δm, obtained by repeated application of claim 9 of that lemma, so that δ>0. For real h with 0<∣h∣<δ we then have x(i,h)∈U×V, and, the control coordinates of x(i,h) and x agreeing,
whose modulus is at most ε′+∑k=1m∣αk∣ε′=Cε′=ε⋅2−1<ε, by claim 5 of the properties of the absolute value in an ordered field (the triangle inequality, extended to the m+1 summands by induction on their number) together with claim 4 of that lemma (multiplicativity), and by claim 8 of the order lemma. As ε>0 was arbitrary, the partial derivative of F with respect to the ith variable exists at x with value L, and by Uniqueness of the Partial Derivative on a Euclidean Open Set no other value is possible:
∂iF(x)=∂ig(Σ)+k=1∑mαk∂igk(Σ).
(b) Control coordinates. Fix k∈{1,…,m}. For real h with 0<∣h∣<r the point x(l+k,h) lies in U×V and differs from x only in the control coordinate αk, which is replaced by αk+h; hence
hF(x(l+k,h))−F(x)=hgk(Σ)h=gk(Σ),
so the difference quotient is exactly gk(Σ) and its distance to gk(Σ) is 0<ε for every real ε>0. Therefore the partial derivative of F with respect to the (l+k)th variable exists at x with value gk(Σ), and ∂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 of class C1 on U because g and the gk are of class C2 there. 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 difference quotients in any control coordinate xl+k′ all vanish, giving ∂l+k′∂l+kF=0, the second identity of clause 4; and the argument of (a), applied to the single function gk 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 at every point of U×V: given a real ε>0, the bound just proved, applied with ε⋅2−1 in place of ε, supplies a real δ>0 such that any two points of U×V at distance at most δ have their second partial derivatives of F within ε⋅2−1<ε of each other, by claim 8 of the order arithmetic of an ordered field. Each first partial derivative of F is continuous as well: 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′∣. Each of these two bounds has the form ∣∂jF(x)−∂jF(x′)∣≤C1∣x−x′∣ with a nonnegative real constant C1, so for a real ε>0 the choice δ=ε⋅(2(C1+1))−1 makes the left-hand side smaller than ε whenever ∣x−x′∣<δ; hence every ∂jF is continuous at every point of U×V.
The function F itself is continuous there too. Writing
and bounding the first group by clause (i) of the Taylor lemma, the second by Cauchy-Schwarz together with (0a), that same clause and ∣α∣≤R+1, and the third by Cauchy-Schwarz together with (0a) and ∣gk∣≤K0, we obtain from (0c)
∣F(x)−F(x′)∣≤(lK0(1+m(R+1))+mK0)∣x−x′∣,
and the same choice of δ as above applies.
So F is continuous at every point of the open set U×V and all of its partial derivatives exist and are continuous there, which by clauses 1 and 3 of the definition of a Ck map makes F of class C1 on U×V; and each ∂jF is likewise continuous with all of its own partial derivatives existing and continuous, hence of class C1 on U×V. By clause 2 of that definition, F is of class C2 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.