Silverman–Toeplitz theorem

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 <math>(a_{i,j})_{i,j \in \mathbb{N</math> with complex-valued entries defines a regular matrix summability method if and only if it satisfies all of the following properties:

: <math>

\begin{align}

& \lim_{i \to \infty} a_{i,j} = 0 \quad j \in \mathbb{N} & & \text{(Every column sequence converges to 0.)} \\[3pt]

& \lim_{i \to \infty} \sum_{j=0}^{\infty} a_{i,j} = 1 & & \text{(The row sums converge to 1.)} \\[3pt]

& \sup_i \sum_{j=0}^{\infty} \vert a_{i,j} \vert < \infty & & \text{(The absolute row sums are bounded.)}

\end{align}

</math>

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

:<math>a_{mn}=\begin{cases}\frac{1}{m} & n\le m\\ 0 & n>m\end{cases} = \begin{pmatrix}

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 \\

\vdots & \vdots & \vdots & \vdots & \vdots & \ddots \\

\end{pmatrix}.</math>

Formal statement

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

<math>

\lim_{i \to \infty} a_{i,j} = 0

</math> for every fixed <math>

j \in \mathbb{N}

</math>.

<math>\sup_{i \in \mathbb{N \sum_{j=1}^{i} \vert a_{i,j} \vert < \infty</math>;

and <math>

z_{n}

</math> be a sequence of complex numbers that converges to <math>

\lim_{n \to \infty} z_{n} = z_{\infty}

</math>. We denote <math>

S_{n}

</math> as the weighted sum sequence: <math>

S_{n} = \sum_{m = 1}^{n} a_{n, m} z_{m}

</math>.

Then the following results hold:

If <math>

\lim_{n \to \infty} z_{n} = z_{\infty} = 0

</math>, then <math>

\lim_{n \to \infty} {S_{n = 0

</math>.

If <math>

\lim_{n \to \infty} z_{n} = z_{\infty} \ne 0

</math> and <math>\lim_{i \to \infty} \sum_{j=1}^{i} a_{i,j} = 1

</math>, then <math>

\lim_{n \to \infty} {S_{n = z_{\infty}

</math>.

Proof

Proving 1.

For the fixed <math>j \in \mathbb{N} </math> the complex sequences <math>

z_{n}

</math>, <math>

S_{n}

</math> and <math>

a_{i, j}

</math> approach zero if and only if the real-values sequences <math>

\left| z_{n} \right|

</math>, <math>

\left| S_{n} \right|

</math> and <math>

\left| a_{i, j} \right|

</math> approach zero respectively. We also introduce <math>M = 1 + \sup_{i \in \mathbb{N \sum_{j=1}^{i} \vert a_{i,j} \vert > 0</math>.

Since <math>

\left| z_{n} \right| \to 0

</math>, for prematurely chosen <math>

\varepsilon > 0

</math> there exists <math>N_{\varepsilon} \in \mathbb{N}</math>, so for every <math>

n > N_{\varepsilon}

</math> we have <math>

\left| z_{n} \right| < \frac {\varepsilon} {2M}

</math>. Next, for some <math>

N_{a} = N_{a}\left( \varepsilon \right ) > N_{\varepsilon}

</math> it's true, that <math>\sum_{m=1}^n |a_{n, m} |< \frac {\varepsilon} {2\left(\max_{m\leq N_\varepsilon} |z_m| +1 \right)}</math> for every <math>

n > N_{a}\left( \varepsilon \right )

</math>. Therefore, for every <math>

n > N_{a}\left( \varepsilon \right )

</math>

<math>\begin{align}

& \left| S_{n} \right|

= \left| \sum_{m = 1}^{n} \left( a_{n, m} z_{m} \right) \right| \leqslant \sum_{m = 1}^{n} \left( \left| a_{n, m} \right| \cdot \left| z_{m} \right| \right)

= \sum_{m = 1}^{N_{\varepsilon \left( \left| a_{n, m} \right| \cdot \left| z_{m} \right| \right) + \sum_{m = N_{\varepsilon}+1}^{n} \left( \left| a_{n, m} \right| \cdot \left| z_{m} \right| \right) < \\

& < \max_{1 \leq m \leq N_\varepsilon} (|z_m| ) \cdot \sum_{m=1}^{N_\varepsilon} |a_{n,m} | + \frac {\varepsilon} {2M} \sum_{m = N_{\varepsilon}+1}^{n} \left| a_{n, m} \right|

\leqslant \frac {\varepsilon} {2} + \frac {\varepsilon} {2M} \sum_{m = 1}^{n} \left| a_{n, m} \right|

\leqslant \frac {\varepsilon} {2} + \frac {\varepsilon} {2M} \cdot M

= \varepsilon

\end{align}</math>

which means, that both sequences <math>

\left| S_{n} \right|

</math> and <math>

S_{n}

</math> converge zero.

Proving 2.

<math>

\lim_{n \to \infty} \left( z_{m} - z_{\infty} \right) = 0

</math>. Applying the already proven statement yields . Finally,<math>\lim_{n \to \infty} \sum_{m=1}^{n} \big( a_{n,m} \left( z_{m} - z_{\infty} \right) \big) = 0

</math>

<math>\lim_{n \to \infty} S_{n}

= \lim_{n \to \infty} \sum_{m=1}^{n} \big( a_{n,m} z_{m} \big)

= \lim_{n \to \infty} \sum_{m=1}^{n} \big( a_{n,m} \left( z_{m} - z_{\infty} \right) \big) + z_{\infty} \lim_{n \to \infty} \sum_{m=1}^{n} \big( a_{n,m} \big)

= 0 + z_{\infty} \cdot 1 = z_{\infty}

</math>, which completes the proof.

Silverman–Toeplitz theorem

Formal statement

Proof

Proving 1.

Proving 2.

References

Citations

Further reading