TheoremBase

The partial sums SN(t)S_N(t) of the exponential series of (t-s)M satisfy S_{N+1}' = M SNS_N and SN(s)S_N(s) = I; the remainders DND_N = Phi - SNS_N then satisfy D_{N+1}' = M DND_N and DN(s)D_N(s) = 0, which by the fundamental theorem of calculus gives ||D_{N+1}(t)|| <= C KNK^N |t-s|^N / N!, a null sequence; so SN(t)S_N(t) converges both to Phi(t,s) and to e(t−s)Me^{(t-s)M}.

Proof

Computations with real numbers use The Real Numbers as a Type. By Basic Facts about Intervals of the Real Line (v), [a,b][a,b] is an interval containing the two distinct points aa and bb; derivatives of maps on [a,b][a,b] are taken relative to [a,b][a,b], as in Derivative of a Real Function on an Interval (ii) and Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (ii), and continuity on [a,b][a,b] is as in Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations. (Mn(R),dn)(\mathcal{M}_{n}(\mathbb{R}),d_{n}) is a metric space by The Real Matrices with the Operator-Norm Distance Form a Complete Metric Space with Entrywise Convergence (i), with dn(X,Y)=∥X−Y∥d_{n}(X,Y)=\lVert X-Y\rVert (Euclidean Space and Real Matrices: Standing Notation (vi)).

Fix s∈[a,b]s\in[a,b]. Let K=∥M∥K=\lVert M\rVert, so K≥0K\ge0 by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (i), and let Φ:[a,b]→Mn(R)\Phi:[a,b]\to\mathcal{M}_{n}(\mathbb{R}) be the map t↦ΦA(t,s)t\mapsto\Phi_{A}(t,s). By The State-Transition Matrix of a Linear System (ii) and The State-Transition Matrix of a Linear System (iii), Φ\Phi is differentiable, Φ′(t)=A(t)Φ(t)=MΦ(t)\Phi'(t)=A(t)\Phi(t)=M\Phi(t) for every t∈[a,b]t\in[a,b], and Φ(s)=In\Phi(s)=I_{n}.

Step 1: the maps TNT_{N}. For N∈N0N\in\mathbb{N}_{0} let ψN:[a,b]→R\psi_{N}:[a,b]\to\mathbb{R} be the map r↦(r−s)N/N!r\mapsto(r-s)^{N}/N! of Shifted Power Maps, and Integrating a Power Bound on the Derivative of a Matrix-Valued Map. By Shifted Power Maps, and Integrating a Power Bound on the Derivative of a Matrix-Valued Map (i), ψ0(r)=1\psi_{0}(r)=1 for every r∈[a,b]r\in[a,b], ψN(s)=0\psi_{N}(s)=0 for every N∈NN\in\mathbb{N}, and every ψN\psi_{N} is differentiable on [a,b][a,b], with ψN+1′(r)=ψN(r)\psi_{N+1}'(r)=\psi_{N}(r) for every r∈[a,b]r\in[a,b].

For t∈[a,b]t\in[a,b] and N∈NN\in\mathbb{N} let TN(t)=SN((t−s)M)T_{N}(t)=S_{N}\bigl((t-s)M\bigr) be the matrix of The Exponential Series of a Real Square Matrix: Convergence, a Norm Bound and the Exponential Map with (t−s)M(t-s)M in place of MM, and regard TNT_{N} as the map [a,b]→Mn(R)[a,b]\to\mathcal{M}_{n}(\mathbb{R}), t↦TN(t)t\mapsto T_{N}(t): the composite (Maps Formed Pointwise: Constant Maps, Pairs of Values, Maps Applied to Values, and Families of Maps (iii)) of the map [a,b]→Mn(R)[a,b]\to\mathcal{M}_{n}(\mathbb{R}), t↦(t−s)Mt\mapsto(t-s)M (Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (v)), with the map X↦SN(X)X\mapsto S_{N}(X) of The Exponential Series of a Real Square Matrix: Convergence, a Norm Bound and the Exponential Map (i). For every t∈[a,b]t\in[a,b], (TN(t))N∈N(T_{N}(t))_{N\in\mathbb{N}} is the sequence of The Exponential Series of a Real Square Matrix: Convergence, a Norm Bound and the Exponential Map (i) with (t−s)M(t-s)M in place of MM, and, by The Exponential of a Real Square Matrix (ii),

(TN(t))N∈N converges to e(t−s)M in (Mn(R),dn).(T_{N}(t))_{N\in\mathbb{N}}\ \text{converges to}\ e^{(t-s)M}\ \text{in}\ (\mathcal{M}_{n}(\mathbb{R}),d_{n}).

For N∈NN\in\mathbb{N}, N+1∈NN+1\in\mathbb{N} and (N+1)+1∈N(N+1)+1\in\mathbb{N} by Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication (ii) and Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication (vi), so TN+1T_{N+1} and T(N+1)+1T_{(N+1)+1} are among these maps. By The Exponential Series of a Real Square Matrix: Convergence, a Norm Bound and the Exponential Map (iii) and Powers of a Square Matrix (iv), T1(t)=InT_{1}(t)=I_{n} and, for N∈NN\in\mathbb{N},

TN+1(t)=TN(t)+1N!((t−s)M)N=TN(t)+1N!((t−s)NMN)=TN(t)+ψN(t) MN,T_{N+1}(t)=T_{N}(t)+\frac{1}{N!}\bigl((t-s)M\bigr)^{N}=T_{N}(t)+\frac{1}{N!}\bigl((t-s)^{N}M^{N}\bigr)=T_{N}(t)+\psi_{N}(t)\,M^{N},

the last equality entrywise by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iv). As ψN(s)=0\psi_{N}(s)=0 for N∈NN\in\mathbb{N} and 0 X=0n0\,X=0_{n} for X∈Mn(R)X\in\mathcal{M}_{n}(\mathbb{R}), induction on NN (Arithmetic and Order of the Natural Numbers (xiii), and Additive Laws for Vectors in Rq\mathbb{R}^q and for Real p×qp\times q Matrices: Group Laws and Rules for Differences (i)) gives TN(s)=InT_{N}(s)=I_{n} for every N∈NN\in\mathbb{N}.

We show by induction on N∈NN\in\mathbb{N} (Arithmetic and Order of the Natural Numbers (xiii)) that TNT_{N} and TN+1T_{N+1} are differentiable and TN+1′(t)=MTN(t)T_{N+1}'(t)=MT_{N}(t) for every t∈[a,b]t\in[a,b]. First, for every N∈NN\in\mathbb{N} such that TNT_{N} is differentiable at t∈[a,b]t\in[a,b], the map TN+1T_{N+1} is the pointwise sum of TNT_{N} and the product of ψN\psi_{N} with the constant map with value MNM^{N}; by Rules for Derivatives of Vector- and Matrix-Valued Maps (ix), Rules for Derivatives of Vector- and Matrix-Valued Maps (iii) and Rules for Derivatives of Vector- and Matrix-Valued Maps (ii), with [a,b][a,b] in place of II (and Additive Laws for Vectors in Rq\mathbb{R}^q and for Real p×qp\times q Matrices: Group Laws and Rules for Differences (i)), TN+1T_{N+1} is differentiable at tt and

TN+1′(t)=TN′(t)+ψN′(t)MN+ψN(t) 0n=TN′(t)+ψN′(t)MN.(∗)T_{N+1}'(t)=T_{N}'(t)+\psi_{N}'(t)M^{N}+\psi_{N}(t)\,0_{n}=T_{N}'(t)+\psi_{N}'(t)M^{N}.\tag{$\ast$}

For N=1N=1: T1T_{1} is the constant map with value InI_{n}, differentiable with T1′(t)=0nT_{1}'(t)=0_{n} by Rules for Derivatives of Vector- and Matrix-Valued Maps (ix). By Powers of a Square Matrix (i) with k=0k=0, as 0+1=10+1=1 by Arithmetic of Addition on Omega: Recursion Rules, Associativity, Commutativity, Cancellation and Compatibility with the Order (i), M1=M0M=InM=MM^{1}=M^{0}M=I_{n}M=M, using Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (iv). As ψ1=ψ0+1\psi_{1}=\psi_{0+1}, ψ1′(t)=ψ0(t)\psi_{1}'(t)=\psi_{0}(t) by Shifted Power Maps, and Integrating a Power Bound on the Derivative of a Matrix-Valued Map (i) with N=0N=0. So, by (∗)(\ast), T1+1′(t)=0n+ψ0(t)M1=M=MIn=MT1(t)T_{1+1}'(t)=0_{n}+\psi_{0}(t)M^{1}=M=MI_{n}=MT_{1}(t). If the claim holds for NN, then TN+1T_{N+1} is differentiable, and by (∗)(\ast) for N+1N+1, Shifted Power Maps, and Integrating a Power Bound on the Derivative of a Matrix-Valued Map (i), Powers of a Square Matrix (i), Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (iii) and Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (ii),

T(N+1)+1′(t)=MTN(t)+ψN(t) (MMN)=MTN(t)+M(ψN(t)MN)=M(TN(t)+ψN(t)MN)=MTN+1(t).T_{(N+1)+1}'(t)=MT_{N}(t)+\psi_{N}(t)\,(MM^{N})=MT_{N}(t)+M\bigl(\psi_{N}(t)M^{N}\bigr)=M\bigl(T_{N}(t)+\psi_{N}(t)M^{N}\bigr)=MT_{N+1}(t).

This proves the claim for N+1N+1, and so for every N∈NN\in\mathbb{N}.

Step 2: the remainders. For N∈NN\in\mathbb{N} let DN=Φ−TN:[a,b]→Mn(R)D_{N}=\Phi-T_{N}:[a,b]\to\mathcal{M}_{n}(\mathbb{R}), the pointwise difference. Then DN(s)=In−In=0nD_{N}(s)=I_{n}-I_{n}=0_{n} (Additive Laws for Vectors in Rq\mathbb{R}^q and for Real p×qp\times q Matrices: Group Laws and Rules for Differences (ii)). By Step 1 and Rules for Derivatives of Vector- and Matrix-Valued Maps (iv), DND_{N} is differentiable, and, by Products of Real Matrices with Zero Matrices, Negatives and Differences (iii),

DN+1′(t)=MΦ(t)−MTN(t)=M(Φ(t)−TN(t))=MDN(t)(t∈[a,b]).D_{N+1}'(t)=M\Phi(t)-MT_{N}(t)=M\bigl(\Phi(t)-T_{N}(t)\bigr)=MD_{N}(t)\qquad(t\in[a,b]).

By Rules for Derivatives of Vector- and Matrix-Valued Maps (i), DND_{N} is continuous at every point of [a,b][a,b]; so the map t↦MDN(t)t\mapsto MD_{N}(t) is continuous on [a,b][a,b], by Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (iv) (the constant map with value MM and a product) and Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (v).

Step 3: the constant CC. Let C=exp⁡(K(b−a))+1C=\exp\bigl(K(b-a)\bigr)+1; then C>0C>0 by Basic Properties of the Exponential Function (iii). Since ∥A(r)∥=K\lVert A(r)\rVert=K for every r∈[a,b]r\in[a,b], Basic Properties of the State-Transition Matrix (vi) gives ∥Φ(r)∥≤exp⁡(K∣r−s∣)\lVert\Phi(r)\rVert\le\exp(K|r-s|) for every r∈[a,b]r\in[a,b]. For r∈[a,b]r\in[a,b], ∣r−s∣≤b−a|r-s|\le b-a, so K∣r−s∣≤K(b−a)K|r-s|\le K(b-a), and exp⁡(K∣r−s∣)≤exp⁡(K(b−a))\exp(K|r-s|)\le\exp(K(b-a)): by Basic Properties of the Exponential Function (ix) if K∣r−s∣<K(b−a)K|r-s|<K(b-a), with equality if K∣r−s∣=K(b−a)K|r-s|=K(b-a). By The Operator Norm of Entries, Transposes, Multiples of the Identity, Orthogonal Factors and Diagonal Matrices (vi) with t=1t=1, ∥In∥=∥1 In∥=1\lVert I_{n}\rVert=\lVert1\,I_{n}\rVert=1. For r∈[a,b]r\in[a,b], D1(r)=Φ(r)−In=Φ(r)+(−In)D_{1}(r)=\Phi(r)-I_{n}=\Phi(r)+(-I_{n}) by Step 1 and Additive Laws for Vectors in Rq\mathbb{R}^q and for Real p×qp\times q Matrices: Group Laws and Rules for Differences (ii), and −In=(−1)In-I_{n}=(-1)I_{n} by Rules for Pointwise Operations on Real-Valued Maps: a Commutative Ring, Scalar Multiples and Evaluation (iv), with [n]×[n][n]\times[n] for its II, as Mn(R)\mathcal{M}_{n}(\mathbb{R}) is the set of maps [n]×[n]→R[n]\times[n]\to\mathbb{R} with the pointwise operations (Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (i), Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iv)). Hence, by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (vi) and Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (v),

∥D1(r)∥=∥Φ(r)+(−1)In∥≤∥Φ(r)∥+∥In∥≤C(r∈[a,b]).\lVert D_{1}(r)\rVert=\lVert\Phi(r)+(-1)I_{n}\rVert\le\lVert\Phi(r)\rVert+\lVert I_{n}\rVert\le C\qquad(r\in[a,b]).

Step 4: the bound. We show, for every k∈Nk\in\mathbb{N},

∥Dk(r)∥≤C Kk−1∣r−s∣k−1(k−1)!for every r∈[a,b],\lVert D_{k}(r)\rVert\le C\,\frac{K^{k-1}|r-s|^{k-1}}{(k-1)!}\qquad\text{for every }r\in[a,b],

by induction on kk (Arithmetic and Order of the Natural Numbers (xiii)). For k=1k=1: 1−1=01-1=0 by The Difference of Two Natural Numbers with Zero (i), as 1+0=11+0=1 by Arithmetic of Addition on Omega: Recursion Rules, Associativity, Commutativity, Cancellation and Compatibility with the Order (i); so the right side is CC, by Powers with Exponents in the Natural Numbers with Zero (ii) and 0!=10!=1 (The Factorial as a Map on the Natural Numbers with Zero (ii)), and the bound is Step 3.

Suppose the bound holds for kk, and let N=k−1∈N0N=k-1\in\mathbb{N}_{0}. Then 1+N=k1+N=k by The Difference of Two Natural Numbers with Zero (i), so N+1=kN+1=k by Arithmetic of Addition on Omega: Recursion Rules, Associativity, Commutativity, Cancellation and Compatibility with the Order (iv); likewise, k+1∈Nk+1\in\mathbb{N} by Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication (ii) and Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication (vi), so 1≤k+11\le k+1 by Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication (ii) and the difference (k+1)−1(k+1)-1 is defined, and (k+1)−1=k(k+1)-1=k, as 1+k=k+11+k=k+1. For r∈[a,b]r\in[a,b], by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (vii), the induction hypothesis and K≥0K\ge0,

∥MDk(r)∥≤K ∥Dk(r)∥≤C Kk ∣r−s∣NN!,\lVert MD_{k}(r)\rVert\le K\,\lVert D_{k}(r)\rVert\le C\,K^{k}\,\frac{|r-s|^{N}}{N!},

as K KN=KNK1=KN+1=KkK\,K^{N}=K^{N}K^{1}=K^{N+1}=K^{k} by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (ii) and Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (i). By Step 2, Dk+1D_{k+1} is differentiable, Dk+1(s)=0nD_{k+1}(s)=0_{n}, and its derivative r↦MDk(r)r\mapsto MD_{k}(r) is continuous on [a,b][a,b]; and C Kk≥0C\,K^{k}\ge0 by C>0C>0 and Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (vi). So Shifted Power Maps, and Integrating a Power Bound on the Derivative of a Matrix-Valued Map (ii), with nn and nn in place of pp and qq, C KkC\,K^{k} in place of cc and Dk+1D_{k+1} in place of EE, gives, for every t∈[a,b]t\in[a,b],

∥Dk+1(t)∥≤C Kk ∣t−s∣N+1(N+1)!=C K(k+1)−1∣t−s∣(k+1)−1((k+1)−1)!.\lVert D_{k+1}(t)\rVert\le C\,K^{k}\,\frac{|t-s|^{N+1}}{(N+1)!}=C\,\frac{K^{(k+1)-1}|t-s|^{(k+1)-1}}{((k+1)-1)!}.

This is the bound for k+1k+1, and so the bound holds for every k∈Nk\in\mathbb{N}.

Step 5: the limit. Fix t∈[a,b]t\in[a,b] and let w=K∣t−s∣w=K|t-s|, so w≥0w\ge0. Let (xk)k∈N(x_{k})_{k\in\mathbb{N}} be the sequence of The Exponential Series Converges Absolutely, and Its Sum Is a Map on ℝ (i) with ww in place of its parameter, so xk=wk−1/(k−1)!x_{k}=w^{k-1}/(k-1)!. Its series converges by The Exponential Series Converges Absolutely, and Its Sum Is a Map on ℝ (ii), so (xk)(x_{k}) is a null sequence by Elementary Properties of Series of Real Numbers: Linearity, Null Terms, the Cauchy Criterion, Index Shifts, Tails, Order and Telescoping (ii). For k∈Nk\in\mathbb{N}, Kk−1∣t−s∣k−1=wk−1K^{k-1}|t-s|^{k-1}=w^{k-1} by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (ii), so Step 4 gives ∥Dk(t)∥≤C xk\lVert D_{k}(t)\rVert\le C\,x_{k}.

Let ε>0\varepsilon>0. As (xk)(x_{k}) converges to 00, Convergent Sequences of Real Numbers (i), applied to ε/C>0\varepsilon/C>0, gives N0∈NN_{0}\in\mathbb{N} with ∣xk∣<ε/C|x_{k}|<\varepsilon/C for every k∈Nk\in\mathbb{N} with k≥N0k\ge N_{0}. For such kk, by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (v),

dn(Tk(t),Φ(t))=∥Tk(t)−Φ(t)∥=∥(−1)Dk(t)∥=∥Dk(t)∥≤C xk<ε.d_{n}\bigl(T_{k}(t),\Phi(t)\bigr)=\lVert T_{k}(t)-\Phi(t)\rVert=\lVert(-1)D_{k}(t)\rVert=\lVert D_{k}(t)\rVert\le C\,x_{k}<\varepsilon .

So (Tk(t))k∈N(T_{k}(t))_{k\in\mathbb{N}} converges to Φ(t)\Phi(t) in (Mn(R),dn)(\mathcal{M}_{n}(\mathbb{R}),d_{n}), by Convergent Sequence in a Metric Space (i). By Step 1 it also converges to e(t−s)Me^{(t-s)M}, so ΦA(t,s)=Φ(t)=e(t−s)M\Phi_{A}(t,s)=\Phi(t)=e^{(t-s)M} by Uniqueness of Limits in a Metric Space (i). As s,t∈[a,b]s,t\in[a,b] were arbitrary, this proves (i).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…