Sequences, series, summability Definition
Hausdorff summation
Builds on Matrix summability methodSequenceBinomial coefficient
Definition
Let be a sequence of real numbers. Define its iterated differences by and , so that The Hausdorff matrix of is the lower triangular matrix with A sequence of complex numbers is Hausdorff summable by to if as . A series is Hausdorff summable if the sequence of its partial sums is.
Remarks
Example: for one gets . So , and is the Cesàro mean. Similarly, gives , the Euler means.
Non-example of regularity: for and for , one has for and . So for all , and the method sends every sequence to its first term.
Hausdorff showed that is regular if and only if for a function of bounded variation on with , and continuous at . In the non-example, jumps from to at , which violates the last condition.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Binomial coefficient definition
- Matrix summability method concept
- Sequence definition
- Hausdorff summation definition
Further reading
About this page
| Tag | HEGTKZ640Y |
|---|---|
| URI | m2://HEGTKZ640Y |
| Kind | definition |
| Writing | W0 stub |
| MSC | 40G05, 40C05 |
| Defines | Hausdorff summation |
| Uses | Matrix summability method, Sequence, Binomial coefficient |
| Changed | 2 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.