Math 2.0

Sequences, series, summability Definition

Hausdorff summation

Builds on Matrix summability methodSequenceBinomial coefficient

Definition

Let (μn)n≥0(\mu_n)_{n \ge 0} be a sequence of real numbers. Define its iterated differences by Δ0μk=μk\Delta^0 \mu_k = \mu_k and Δj+1μk=Δjμk−Δjμk+1\Delta^{j+1} \mu_k = \Delta^j \mu_k - \Delta^j \mu_{k+1}, so that Δjμk=∑i=0j(−1)i(ji)μk+i.\Delta^j \mu_k = \sum_{i=0}^{j} (-1)^i \binom{j}{i} \mu_{k+i}. The Hausdorff matrix of (μn)(\mu_n) is the lower triangular matrix Hμ=(hnk)H_\mu = (h_{nk}) with hnk=(nk)Δn−kμk(0≤k≤n),hnk=0(k>n).h_{nk} = \binom{n}{k} \Delta^{n-k} \mu_k \quad (0 \le k \le n), \qquad h_{nk} = 0 \quad (k > n). A sequence (sk)(s_k) of complex numbers is Hausdorff summable by HμH_\mu to ss if tn=∑k=0nhnksk→st_n = \sum_{k=0}^{n} h_{nk} s_k \to s as n→∞n \to \infty. A series is Hausdorff summable if the sequence of its partial sums is.

Remarks

Example: for μn=1n+1=∫01tn dt\mu_n = \frac{1}{n+1} = \int_0^1 t^n \, dt one gets Δn−kμk=∫01tk(1−t)n−k dt=k! (n−k)!(n+1)!\Delta^{n-k} \mu_k = \int_0^1 t^k (1 - t)^{n-k} \, dt = \frac{k! \, (n-k)!}{(n+1)!}. So hnk=1n+1h_{nk} = \frac{1}{n+1}, and tn=s0+⋯+snn+1t_n = \frac{s_0 + \cdots + s_n}{n+1} is the Cesàro mean. Similarly, μn=2−n\mu_n = 2^{-n} gives hnk=(nk)2−nh_{nk} = \binom{n}{k} 2^{-n}, the Euler (E,1)(E, 1) means.

Non-example of regularity: for μ0=1\mu_0 = 1 and μn=0\mu_n = 0 for n≥1n \ge 1, one has Δn−kμk=0\Delta^{n-k} \mu_k = 0 for k≥1k \ge 1 and Δnμ0=1\Delta^n \mu_0 = 1. So tn=s0t_n = s_0 for all nn, and the method sends every sequence to its first term.

Hausdorff showed that HμH_\mu is regular if and only if μn=∫01tn dχ(t)\mu_n = \int_0^1 t^n \, d\chi(t) for a function χ\chi of bounded variation on [0,1][0, 1] with χ(0)=0\chi(0) = 0, χ(1)=1\chi(1) = 1 and χ\chi continuous at 00. In the non-example, χ\chi jumps from 00 to 11 at 00, 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
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. Binomial coefficient definition
  2. Matrix summability method concept
  3. Sequence definition
  4. Hausdorff summation definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Divergent_series
About this page
TagHEGTKZ640Y
URIm2://HEGTKZ640Y
Kinddefinition
WritingW0 stub
MSC40G05, 40C05
DefinesHausdorff summation
UsesMatrix summability method, Sequence, Binomial coefficient
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.