Silverman–Toeplitz theorem

Short description: Theorem of summability methods

In mathematics, the Silverman–Toeplitz theorem, first proved by Otto Toeplitz, is a result in series summability theory characterizing matrix summability methods that are regular. A regular matrix summability method is a linear sequence transformation that preserves the limits of convergent sequences. The linear sequence transformation can be applied to the divergent sequences of partial sums of divergent series to give those series generalized sums.

An infinite matrix $(a_{i,j}{)}_{i,j\in \mathbb{\mathbb{N}}}$ with complex-valued entries defines a regular matrix summability method if and only if it satisfies all of the following properties:

$\begin{array}{rlrl}& \underset{i\to \mathrm{\infty }}{\lim }{a}_{i,j}=0j\in \mathbb{\mathbb{N}}& & \text{(Every column sequence converges to 0.)}\\ & \underset{i\to \mathrm{\infty }}{\lim }\sum _{j=0}^{\mathrm{\infty }}{a}_{i,j}=1& & \text{(The row sums converge to 1.)}\\ & \underset{i}{\sup }\sum _{j=0}^{\mathrm{\infty }}|a_{i,j}|<\mathrm{\infty }& & \text{(The absolute row sums are bounded.)}\end{array}$

An example is Cesàro summation, a matrix summability method with

$a_{mn}=\{\begin{array}{ll}\frac{1}{m}& n\le m\\ 0& n>m\end{array}=\left(\begin{array}{cccccc}1& 0& 0& 0& 0& \cdots \\ \frac{1}{2}& \frac{1}{2}& 0& 0& 0& \cdots \\ \frac{1}{3}& \frac{1}{3}& \frac{1}{3}& 0& 0& \cdots \\ \frac{1}{4}& \frac{1}{4}& \frac{1}{4}& \frac{1}{4}& 0& \cdots \\ \frac{1}{5}& \frac{1}{5}& \frac{1}{5}& \frac{1}{5}& \frac{1}{5}& \cdots \\ ⋮& ⋮& ⋮& ⋮& ⋮& \ddots \\ \end{array}\right).$

Formal statement

Let the aforementioned inifinite matrix $(a_{i,j}{)}_{i,j\in \mathbb{\mathbb{N}}}$ of complex elements satisfy the following conditions:

1. $\underset{i\to \mathrm{\infty }}{\lim }{a}_{i,j}=0$ for every fixed $j\in \mathbb{\mathbb{N}}$.
2. $\underset{i\in \mathbb{\mathbb{N}}}{\sup }\sum _{j=1}^i|a_{i,j}|<\mathrm{\infty }$;

and $z_n$ be a sequence of complex numbers that converges to $\underset{n\to \mathrm{\infty }}{\lim }{z}_n=z_{\mathrm{\infty }}$. We denote $S_n$ as the weighted sum sequence: $S_n=\sum _{m=1}^n\left(a_{n,m}{z}_n\right)$.

Then the following results hold:

1. If $\underset{n\to \mathrm{\infty }}{\lim }{z}_n=z_{\mathrm{\infty }}=0$, then $\underset{n\to \mathrm{\infty }}{\lim }{S}_n=0$.
2. If $\underset{n\to \mathrm{\infty }}{\lim }{z}_n=z_{\mathrm{\infty }}\ne 0$ and $\underset{i\to \mathrm{\infty }}{\lim }\sum _{j=1}^i{a}_{i,j}=1$, then $\underset{n\to \mathrm{\infty }}{\lim }{S}_n=z_{\mathrm{\infty }}$.

Proof

Proving 1.

For the fixed $j\in \mathbb{\mathbb{N}}$ the complex sequences $z_n$, $S_n$ and $a_{i,j}$ approach zero if and only if the real-values sequences $\left|z_n\right|$, $\left|S_n\right|$ and $\left|a_{i,j}\right|$ approach zero respectively. We also introduce $M=\underset{i\in \mathbb{\mathbb{N}}}{\sup }\sum _{j=1}^i|a_{i,j}|>0$.

Since $\left|z_n\right|\to 0$, for prematurely chosen $\epsilon >0$ there exists $N_{\epsilon }=N_{\epsilon }\left(\epsilon \right)$, so for every $n>N_{\epsilon }\left(\epsilon \right)$ we have $\left|z_n\right|<\frac{\epsilon }{2M}$. Next, for some $N_a=N_a\left(\epsilon \right)>N_{\epsilon }\left(\epsilon \right)$ it's true, that $\left|a_{n,m}\right|<\frac{M}{N_{\epsilon }}$ for every $n>N_a\left(\epsilon \right)$ and $1⩽m⩽n$. Therefore, for every $n>N_a\left(\epsilon \right)$

$\begin{array}{rl}& \left|S_n\right|=\left|\sum _{m=1}^n\left(a_{n,m}{z}_n\right)\right|⩽\sum _{m=1}^n(\left|a_{n,m}\right|\cdot \left|z_n\right|)=\sum _{m=1}^{N_{\epsilon }}(\left|a_{n,m}\right|\cdot \left|z_n\right|)+\sum _{m=N_{\epsilon }}^n(\left|a_{n,m}\right|\cdot \left|z_n\right|)<\\ & <N_{\epsilon }\cdot \frac{M}{N_{\epsilon }}\cdot \frac{\epsilon }{2M}+\frac{\epsilon }{2M}\sum _{m=N_{\epsilon }}^n\left|a_{n,m}\right|⩽\frac{\epsilon }{2}+\frac{\epsilon }{2M}\sum _{m=1}^n\left|a_{n,m}\right|⩽\frac{\epsilon }{2}+\frac{\epsilon }{2M}\cdot M=\epsilon \end{array}$

which means, that both sequences $\left|S_n\right|$ and $S_n$ converge zero.

Proving 2.

$\underset{n\to \mathrm{\infty }}{\lim }(z_n-z_{\mathrm{\infty }})=0$. Applying the already proven statement yields $\underset{n\to \mathrm{\infty }}{\lim }\sum _{m=1}^n\left(a_{n,m}(z_n-z_{\mathrm{\infty }})\right)=0$. Finally,

$\underset{n\to \mathrm{\infty }}{\lim }{S}_n=\underset{n\to \mathrm{\infty }}{\lim }\sum _{m=1}^n\left(a_{n,m}{z}_n\right)=\underset{n\to \mathrm{\infty }}{\lim }\sum _{m=1}^n\left(a_{n,m}(z_n-z_{\mathrm{\infty }})\right)+z_{\mathrm{\infty }}\underset{n\to \mathrm{\infty }}{\lim }\sum _{m=1}^n\left(a_{n,m}\right)=0+z_{\mathrm{\infty }}\cdot 1=z_{\mathrm{\infty }}$, which completes the proof.

References

Further reading

• Toeplitz, Otto (1911) "Über allgemeine lineare Mittelbildungen." Prace mat.-fiz., 22, 113–118 (the original paper in German)
• Silverman, Louis Lazarus (1913) "On the definition of the sum of a divergent series." University of Missouri Studies, Math. Series I, 1–96
• Hardy, G. H. (1949), Divergent Series, Oxford: Clarendon Press, https://archive.org/details/divergentseries033523mbp , 43-48.
• Boos, Johann (2000). Classical and modern methods in summability. New York: Oxford University Press. ISBN 019850165X. https://books.google.com/books?id=kZ9cy6XyidEC.