TheoremBase

Each entry series is dominated by the real exponential series at the norm of M; the entries of the partial sums are the partial sums of the entry series, so entrywise convergence gives convergence in the operator-norm distance; the norm bound passes from the partial sums to the limit.

Proof

Computations with real numbers use The Real Numbers as a Type. Let K=∥M∥K=\lVert M\rVert; then K≥0K\ge0 by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (i). Let (bk)k∈N(b_{k})_{k\in\mathbb{N}} be the sequence of The Exponential Series Converges Absolutely, and Its Sum Is a Map on ℝ (i) for u=Ku=K, so bk=Kk−1/(k−1)!b_{k}=K^{k-1}/(k-1)!; then bk≥0b_{k}\ge0 for every k∈Nk\in\mathbb{N}, by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (vi) and Natural Numbers and Factorials Read in the Reals: the Order Carries Over, One Is Least, and Factorials Are Positive, Recursive and Nondecreasing (iii). By The Exponential Series Converges Absolutely, and Its Sum Is a Map on ℝ (ii), ∑k=1∞bk\sum_{k=1}^{\infty}b_{k} converges, and its sum is exp⁡(K)\exp(K) by The Real Exponential Function (i) and The Real Exponential Function (ii). (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).

Proof of (i). The matrix product is a binary operation on Mn(R)\mathcal{M}_{n}(\mathbb{R}) with neutral element InI_{n}, and MmM^{m} is the power for it, as in Powers of a Square Matrix; so, by Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set (iii), there is a map P:N0→Mn(R)P:\mathbb{N}_{0}\to\mathcal{M}_{n}(\mathbb{R}) with P(m)=MmP(m)=M^{m} for every m∈N0m\in\mathbb{N}_{0}, and by The Factorial as a Map on the Natural Numbers with Zero (i) there is a map N0→N0\mathbb{N}_{0}\to\mathbb{N}_{0}, m↦m!m\mapsto m!. For k∈Nk\in\mathbb{N}, 1≤k1\le k 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), so k−1∈N0k-1\in\mathbb{N}_{0} is the difference, (k−1)!>0(k-1)!>0 in R\mathbb{R} by Natural Numbers and Factorials Read in the Reals: the Order Carries Over, One Is Least, and Factorials Are Positive, Recursive and Nondecreasing (iii), and 1(k−1)!P(k−1)∈Mn(R)\frac{1}{(k-1)!}P(k-1)\in\mathcal{M}_{n}(\mathbb{R}) by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iv). So the map T:N→Mn(R)T:\mathbb{N}\to\mathcal{M}_{n}(\mathbb{R}), k↦1(k−1)!P(k−1)=1(k−1)!Mk−1k\mapsto\frac{1}{(k-1)!}P(k-1)=\frac{1}{(k-1)!}M^{k-1}, given by this expression in PP, the factorial and the difference, exists (Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (v)), and so, for N∈NN\in\mathbb{N}, does the map [N]→Mn(R)[N]\to\mathcal{M}_{n}(\mathbb{R}) given by the same expression on [N]⊆N[N]\subseteq\mathbb{N} (Intervals of Natural Numbers (ii)); the latter is the restriction T∣[N]T|_{[N]}, as both have the same values, and it is the only map [N]→Mn(R)[N]\to\mathcal{M}_{n}(\mathbb{R}) with these values, by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv). Hence SN(M)=∑k=1NTkS_{N}(M)=\sum_{k=1}^{N}T_{k}, the sum of T∣[N]T|_{[N]} (Iterated Operations: Finite Sums and Finite Products (i) and Iterated Operations: Finite Sums and Finite Products (ii)).

The addition of Mn(R)\mathcal{M}_{n}(\mathbb{R}) is a binary operation on Mn(R)\mathcal{M}_{n}(\mathbb{R}) by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iv). By Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set (i), with TT for aa, there is exactly one map N→Mn(R)\mathbb{N}\to\mathcal{M}_{n}(\mathbb{R}) whose value at every N∈NN\in\mathbb{N} is ∑k=1NTk=SN(M)\sum_{k=1}^{N}T_{k}=S_{N}(M), that is, by Sequences (i), exactly one sequence in Mn(R)\mathcal{M}_{n}(\mathbb{R}) with NN-th term SN(M)S_{N}(M).

Let N∈NN\in\mathbb{N}. For every X∈Mn(R)X\in\mathcal{M}_{n}(\mathbb{R}), what was shown for MM applies to XX: the summand map [N]→Mn(R)[N]\to\mathcal{M}_{n}(\mathbb{R}), k↦1(k−1)!Xk−1k\mapsto\frac{1}{(k-1)!}X^{k-1}, exists, and SN(X)S_{N}(X), its finite sum, lies in Mn(R)\mathcal{M}_{n}(\mathbb{R}). So SN(X)S_{N}(X) is an expression in XX built from defined set symbols (the finite sum, the summand map, powers, factorials and the difference), and the map Mn(R)→Mn(R)\mathcal{M}_{n}(\mathbb{R})\to\mathcal{M}_{n}(\mathbb{R}), X↦SN(X)X\mapsto S_{N}(X), exists (Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (v)); it is the only map with these values by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv). This proves (i).

Proof of (ii). Let i,j∈[n]i,j\in[n], and let (ak)k∈N(a_{k})_{k\in\mathbb{N}} be the sequence with ak=(Mk−1)ij/(k−1)!a_{k}=(M^{k-1})_{ij}/(k-1)! (a sequence by Sequences of Real Numbers Built from Given Ones: Partial Sums, Index Shifts, Predecessor Reindexing, Absolute Values and Termwise Operations (iii), with the map q:N0→Rq:\mathbb{N}_{0}\to\mathbb{R}, m↦(Mm)ij/m!m\mapsto(M^{m})_{ij}/m!, given by an expression in the map m↦Mmm\mapsto M^{m} of Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set (iii) and the factorial map of The Factorial as a Map on the Natural Numbers with Zero (i) (Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (v))). It is the only sequence in R\mathbb{R} with these terms, by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv), a sequence in R\mathbb{R} being a map N→R\mathbb{N}\to\mathbb{R} (Sequences (i)). For k∈Nk\in\mathbb{N}, The Operator Norm of Entries, Transposes, Multiples of the Identity, Orthogonal Factors and Diagonal Matrices (ii) and Powers of a Square Matrix (vi) give ∣(Mk−1)ij∣≤∥Mk−1∥≤Kk−1|(M^{k-1})_{ij}|\le\lVert M^{k-1}\rVert\le K^{k-1}, and dividing by (k−1)!>0(k-1)!>0 gives ∣ak∣≤bk|a_{k}|\le b_{k}. By Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series (iv), ∑k=1∞ak\sum_{k=1}^{\infty}a_{k} converges absolutely, and by Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series (iii) it converges. This proves (ii).

Proof of (iii). Let (Tk)k∈N(T_{k})_{k\in\mathbb{N}} be the sequence TT of the proof of (i), with Tk=1(k−1)!Mk−1T_{k}=\frac{1}{(k-1)!}M^{k-1}, so that SN(M)=∑k=1NTkS_{N}(M)=\sum_{k=1}^{N}T_{k} for N∈NN\in\mathbb{N}. As 1+0=11+0=1 by Arithmetic of Addition on Omega: Recursion Rules, Associativity, Commutativity, Cancellation and Compatibility with the Order (i), 1−1=01-1=0 by The Difference of Two Natural Numbers with Zero (i); and for N∈NN\in\mathbb{N}, N+1∈NN+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≤N+11\le N+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 1+N=N+11+N=N+1 by Arithmetic of Addition on Omega: Recursion Rules, Associativity, Commutativity, Cancellation and Compatibility with the Order (iv), so (N+1)−1=N(N+1)-1=N. Hence, by Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (i), S1(M)=T1=10!M0=1 In=InS_{1}(M)=T_{1}=\frac{1}{0!}M^{0}=1\,I_{n}=I_{n}, using 0!=10!=1 by The Factorial as a Map on the Natural Numbers with Zero (ii) and Powers of a Square Matrix (i), and 1 In=In1\,I_{n}=I_{n} by Rules for Pointwise Operations on Real-Valued Maps: a Commutative Ring, Scalar Multiples and Evaluation (iii), with [n]×[n][n]\times[n] for its II (matrices being 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) and Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iv)), and

SN+1(M)=SN(M)+TN+1=SN(M)+1N!MN(N∈N).S_{N+1}(M)=S_{N}(M)+T_{N+1}=S_{N}(M)+\frac{1}{N!}M^{N}\qquad(N\in\mathbb{N}).

This proves (iii).

Proof of (iv). Let i,j∈[n]i,j\in[n] and let (ak)(a_{k}) be as in the proof of (ii), with partial sums sN=∑k=1Naks_{N}=\sum_{k=1}^{N}a_{k}. The map Mn(R)→R\mathcal{M}_{n}(\mathbb{R})\to\mathbb{R}, X↦XijX\mapsto X_{ij}, satisfies (X+Y)ij=Xij+Yij(X+Y)_{ij}=X_{ij}+Y_{ij} and (cX)ij=c Xij(cX)_{ij}=c\,X_{ij} by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iv); so (Tk)ij=ak(T_{k})_{ij}=a_{k}, and by Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (ii)

(SN(M))ij=∑k=1N(Tk)ij=∑k=1Nak=sN(N∈N).\bigl(S_{N}(M)\bigr)_{ij}=\sum_{k=1}^{N}(T_{k})_{ij}=\sum_{k=1}^{N}a_{k}=s_{N}\qquad(N\in\mathbb{N}).

By (ii) and Series of Real Numbers: Partial Sums, Convergence, the Sum and Absolute Convergence (ii), (sN)(s_{N}) converges to the sum σij=∑k=1∞ak\sigma_{ij}=\sum_{k=1}^{\infty}a_{k}, as in Convergent Sequences of Real Numbers (i), that is, in (R,dR)(\mathbb{R},d_{\mathbb{R}}), by Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (iv). The map [n]×[n]→R[n]\times[n]\to\mathbb{R}, (i,j)↦σij(i,j)\mapsto\sigma_{ij} (a map given by limits, Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (v)), is a matrix E∈Mn(R)E\in\mathcal{M}_{n}(\mathbb{R}) with Eij=σijE_{ij}=\sigma_{ij} by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (i) and Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (ii), and it is the only matrix with these entries by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iii). Since the entry sequences ((SN(M))ij)N∈N=(sN)\bigl((S_{N}(M))_{ij}\bigr)_{N\in\mathbb{N}}=(s_{N}) converge to EijE_{ij} in (R,dR)(\mathbb{R},d_{\mathbb{R}}) for all i,j∈[n]i,j\in[n], the sequence (SN(M))(S_{N}(M)) converges to EE in (Mn(R),dn)(\mathcal{M}_{n}(\mathbb{R}),d_{n}) by The Real Matrices with the Operator-Norm Distance Form a Complete Metric Space with Entrywise Convergence (v). This proves (iv).

Proof of (v). Let tN=∑k=1Nbkt_{N}=\sum_{k=1}^{N}b_{k} for N∈NN\in\mathbb{N}, so t1=b1t_{1}=b_{1} and tN+1=tN+bN+1t_{N+1}=t_{N}+b_{N+1} by Sequences of Real Numbers Built from Given Ones: Partial Sums, Index Shifts, Predecessor Reindexing, Absolute Values and Termwise Operations (i), with b1=K0/0!=1b_{1}=K^{0}/0!=1, as K0=1K^{0}=1 by Powers with Exponents in the Natural Numbers with Zero (ii) and 0!=10!=1 by The Factorial as a Map on the Natural Numbers with Zero (ii), and bN+1=KN/N!b_{N+1}=K^{N}/N! as (N+1)−1=N(N+1)-1=N (shown in the proof of (iii)). We show ∥SN(M)∥≤tN\lVert S_{N}(M)\rVert\le t_{N} for every N∈NN\in\mathbb{N}, by induction on NN (Arithmetic and Order of the Natural Numbers (xiii)). For N=1N=1, ∥S1(M)∥=∥In∥=∥1 In∥=1=t1\lVert S_{1}(M)\rVert=\lVert I_{n}\rVert=\lVert1\,I_{n}\rVert=1=t_{1} by The Operator Norm of Entries, Transposes, Multiples of the Identity, Orthogonal Factors and Diagonal Matrices (vi) with t=1t=1. If ∥SN(M)∥≤tN\lVert S_{N}(M)\rVert\le t_{N}, then by (iii), Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (vi), Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (v) and Powers of a Square Matrix (vi),

∥SN+1(M)∥≤∥SN(M)∥+1N!∥MN∥≤tN+KNN!=tN+1.\lVert S_{N+1}(M)\rVert\le\lVert S_{N}(M)\rVert+\frac{1}{N!}\lVert M^{N}\rVert\le t_{N}+\frac{K^{N}}{N!}=t_{N+1}.

By Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series (i), tN≤∑k=1∞bk=exp⁡(K)t_{N}\le\sum_{k=1}^{\infty}b_{k}=\exp(K), so ∥SN(M)∥≤exp⁡(K)\lVert S_{N}(M)\rVert\le\exp(K) for every N∈NN\in\mathbb{N}.

Let ε>0\varepsilon>0 be real. As (SN(M))(S_{N}(M)) converges to EE in (Mn(R),dn)(\mathcal{M}_{n}(\mathbb{R}),d_{n}) by (iv), Convergent Sequence in a Metric Space (i) gives N∈NN\in\mathbb{N} with dn(SN(M),E)<εd_{n}(S_{N}(M),E)<\varepsilon. By The Real Matrices with the Operator-Norm Distance Form a Complete Metric Space with Entrywise Convergence (iii), ∥E∥−∥SN(M)∥≤dn(SN(M),E)\lVert E\rVert-\lVert S_{N}(M)\rVert\le d_{n}(S_{N}(M),E), so ∥E∥<exp⁡(K)+ε\lVert E\rVert<\exp(K)+\varepsilon. As ε\varepsilon was arbitrary, ∥E∥≤exp⁡(K)=exp⁡(∥M∥)\lVert E\rVert\le\exp(K)=\exp(\lVert M\rVert) by Arbitrary Positive Slack, and Approximation of Suprema and Infima, in the Real Numbers (i). This proves (v).

Proof of (vi). By (iv), for every X∈Mn(R)X\in\mathcal{M}_{n}(\mathbb{R}) the sequence (SN(X))N∈N(S_{N}(X))_{N\in\mathbb{N}} (the sequence of (i) with XX for MM) is convergent in (Mn(R),dn)(\mathcal{M}_{n}(\mathbb{R}),d_{n}), and its limit is the matrix EE of (iv) for XX, by Uniqueness of Limits in a Metric Space (i). By Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (v), with Mn(R)\mathcal{M}_{n}(\mathbb{R}) for its aa and (Mn(R),dn)(\mathcal{M}_{n}(\mathbb{R}),d_{n}) for (X,d)(X,d), there is exactly one map f:Mn(R)→Mn(R)f:\mathcal{M}_{n}(\mathbb{R})\to\mathcal{M}_{n}(\mathbb{R}) with f(X)=lim⁡N→∞SN(X)f(X)=\lim_{N\to\infty}S_{N}(X) for every XX, that is, with f(X)f(X) the matrix EE for XX. This proves (vi).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…