Math 2.0

Sequences, series, summability General summability methods Theorem

Silverman–Toeplitz theorem

Builds on Matrix summability methodRegular summability method

Statement

Let A=(ank)n,k≥0A = (a_{nk})_{n, k \ge 0} be an infinite complex matrix. The matrix method given by AA is regular, that is, every convergent sequence ss is AA-summable to lim⁡sk\lim s_k, if and only if:

  1. sup⁡n∑k=0∞∣ank∣<∞\sup_{n} \sum_{k=0}^{\infty} \abs{a_{nk}} < \infty;
  2. lim⁡n→∞ank=0\lim_{n \to \infty} a_{nk} = 0 for every kk;
  3. lim⁡n→∞∑k=0∞ank=1\lim_{n \to \infty} \sum_{k=0}^{\infty} a_{nk} = 1.

Remarks

Necessity of conditions 2 and 3: apply AA to the constant sequence 11 and to the unit sequence eke_k. Here eke_k has 11 in place kk and 00 elsewhere, so it tends to 00. Necessity of condition 1 uses the uniform boundedness principle, or a direct "gliding hump" construction of a null sequence with unbounded transform. Sufficiency: write sk=L+rks_k = L + r_k with rk→0r_k \to 0; condition 3 handles LL, and for rr one splits ∑kankrk\sum_k a_{nk} r_k into finitely many terms, small by condition 2, and a tail, small by condition 1. Example: the Cesàro matrix ank=1n+1a_{nk} = \frac{1}{n+1} for k≤nk \le n has row sums of absolute values equal to 11, entries tending to 00 and row sums 11, so Cesàro summation is regular. Non-example: the matrix with ank=1a_{nk} = 1 for k≤nk \le n and 00 otherwise violates condition 1, and indeed it sends the convergent sequence sk=1k+1s_k = \frac{1}{k+1} to the divergent harmonic partial sums.

Going deeper

For a student

The theorem reduces regularity, a statement about all convergent sequences, to three checks on the matrix. It is the standard tool for showing that Cesàro, Nörlund, Riesz and Euler methods are regular. The Kojima–Schur theorem characterizes the wider class of matrices that only send convergent sequences to convergent sequences, and the Silverman–Toeplitz theorem is its special case with limits 00 and 11. The Steinhaus theorem shows that no regular matrix sums every bounded sequence.

Reading path

To understand this page from the ground up, read these 10 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Sequence definition
  2. Real sequence definition
  3. Limit of a sequence definition
  4. Series definition
  5. Convergent sequence definition
  6. Partial sum definition
  7. Summability method definition
  8. Regular summability method definition
  9. Matrix summability method definition
  10. Silverman–Toeplitz theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Silverman–Toeplitz_theorem
About this page
TagS4J7SRPXMZ
URIm2://S4J7SRPXMZ
Kindstatement, theorem
WritingW0 stub
MSC40C05, 40D05
StatusThis copy of the site has no build data. Run m2 status S4J7SRPXMZ.
AboutMatrix summability method, Regular summability method
UsesMatrix summability method, Regular summability method
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.