Math 2.0

Sequences, series, summability Definition

Lindelöf summation

Builds on Summability methodSeriesOne-sided limit

Definition

Let ∑n≥0an\sum_{n \ge 0} a_n be a series of complex numbers. For h>0h > 0 put L(h)=a0+∑n≥1n−hnanL(h) = a_0 + \sum_{n \ge 1} n^{-hn} a_n whenever this series converges. The series ∑an\sum a_n is Lindelöf summable to ss if L(h)L(h) is defined for every h>0h > 0 and the one-sided limit lim⁡h→0+L(h)\lim_{h \to 0^+} L(h) equals ss.

Remarks

Example: let ∑an\sum a_n converge to ss. For fixed h>0h > 0 the factors n−hn=e−hnln⁡nn^{-hn} = e^{-hn \ln n} decrease in n≥1n \ge 1 and lie in (0,1](0, 1]. By Abel's partial summation, L(h)L(h) converges, and the tails of L(h)L(h) are bounded by the tails of ∑an\sum a_n uniformly in hh. Since each factor tends to 11 as h→0+h \to 0^+, one gets L(h)→sL(h) \to s, so the series is Lindelöf summable to its sum.

Non-example: for 1+1+1+⋯1 + 1 + 1 + \cdots, L(h)=1+∑n≥1n−hnL(h) = 1 + \sum_{n \ge 1} n^{-hn} is defined for every h>0h > 0. For each NN, L(h)≥1+∑n=1Nn−hn→N+1L(h) \ge 1 + \sum_{n=1}^{N} n^{-hn} \to N + 1 as h→0+h \to 0^+. So L(h)→+∞L(h) \to +\infty, and the second condition fails.

Reading path

To understand this page from the ground up, read these 8 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. Limit point of a set definition
  2. Sequence definition
  3. Summability method concept
  4. Limit of a function definition
  5. Real sequence definition
  6. One-sided limit definition
  7. Series definition
  8. Lindelöf summation definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Divergent_series
About this page
TagND7KXXEDJ1
URIm2://ND7KXXEDJ1
Kinddefinition
WritingW0 stub
MSC40G10
DefinesLindelöf summation
UsesSummability method, Series, One-sided limit
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.