Math 2.0

Sequences, series, summability General summability methods Theorem

Kojima–Schur theorem

Builds on Matrix summability methodConvergent sequence

Statement

Let A=(ank)n,k≥0A = (a_{nk})_{n, k \ge 0} be an infinite complex matrix. Every convergent sequence ss is AA-summable, that is, (As)n=∑kanksk(As)_n = \sum_k a_{nk} s_k is defined for all nn and converges as n→∞n \to \infty, if and only if:

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

In that case ∑k∣αk∣<∞\sum_k \abs{\alpha_k} < \infty, and for every convergent ss with limit LL, lim⁡n→∞(As)n=αL+∑k=0∞αk(sk−L).\lim_{n \to \infty} (As)_n = \alpha L + \sum_{k=0}^{\infty} \alpha_k (s_k - L).

Remarks

Such matrices are called conservative. Conditions 2 and 3 are needed because the unit sequences eke_k and the constant sequence 11 are convergent; condition 1 follows from the uniform boundedness principle. The limit formula comes from writing s=L⋅𝟏+(s−L⋅𝟏)s = L \cdot \mathbf{1} + (s - L \cdot \mathbf{1}), where the second sequence tends to 00. Example: let ank=1a_{nk} = 1 if k=0k = 0, ank=1n+1a_{nk} = \frac{1}{n+1} if 1≤k≤n1 \le k \le n, and ank=0a_{nk} = 0 otherwise. Then α0=1\alpha_0 = 1, αk=0\alpha_k = 0 for k≥1k \ge 1 and α=2\alpha = 2. The formula gives lim⁡(As)n=2L+(s0−L)=s0+L\lim (As)_n = 2L + (s_0 - L) = s_0 + L, which one can also check directly. With αk=0\alpha_k = 0 for all kk and α=1\alpha = 1 the limit formula gives LL, and one recovers the Silverman–Toeplitz theorem.

Going deeper

For a student

Conservative matrices are exactly the bounded linear maps from the space of convergent sequences to itself that are given by matrices. The new limit is a continuous linear functional of ss, and the formula above is its general form. Regular matrices are the conservative ones for which this functional is the ordinary limit.

Reading path

To understand this page from the ground up, read these 9 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. Matrix summability method definition
  9. Kojima–Schur theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Silverman–Toeplitz_theorem
About this page
TagJB8GQBVW6Q
URIm2://JB8GQBVW6Q
Kindstatement, theorem
WritingW0 stub
MSC40C05, 40D05
StatusThis copy of the site has no build data. Run m2 status JB8GQBVW6Q.
AboutMatrix summability method
UsesMatrix summability method, Convergent sequence
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.