Ramanujan summation

Ramanujan summation is a technique invented by the mathematician Srinivasa Ramanujan for assigning a value to infinite divergent series. Although the Ramanujan summation of a divergent series is not a sum in the traditional sense, it has properties which make it mathematically useful in the study of divergent infinite series, for which conventional summation is undefined.

Summation

Ramanujan summation essentially is a property of the partial sums, rather than a property of the entire sum, as that doesn't exist. If we take the Euler–Maclaurin summation formula together with the correction rule using Bernoulli numbers, we see that:

\begin{align} {} &\frac{1}{2}f\left( 0\right) + f\left( 1\right) + \cdots + f\left( n - 1\right) + \frac{1}{2}f\left( n\right) \\ = &\frac{1}{2}\left[f\left( 0\right) + f\left( n\right)\right] + \sum_{k=1}^{n-1} f \left( k \right) \\ = &\int_0^n f(x)\,dx + \sum_{k=1}^p \frac{B_{k + 1}}{(k + 1)!}\left[f^{(k)}(n) - f^{(k)}(0)\right] + R_p \end{align}

Ramanujan[1] wrote it for the case p going to infinity:

\sum_{k=1}^{x}f(k) = C + \int_0^x f(t)\,dt + \frac{1}{2}f(x) + \sum_{k=1}^{\infty}\frac{B_{2k}}{(2k)!}f^{(2k - 1)}(x)

where C is a constant specific to the series and its analytic continuation and the limits on the integral were not specified by Ramanujan, but presumably they were as given above. Comparing both formulae and assuming that R tends to 0 as x tends to infinity, we see that, in a general case, for functions f(x) with no divergence at x = 0:

C(a)=\int_0^a f(t)\,dt-\frac{1}{2}f(0)-\sum_{k=1}^{\infty}\frac{B_{2k}}{(2k)!}f^{(2k-1)}(0)

where Ramanujan assumed \scriptstyle a \,=\, 0. By taking \scriptstyle a \,=\, \infty we normally recover the usual summation for convergent series. For functions f(x) with no divergence at x = 1, we obtain:

C(a) = \int_1^a f(t)\,dt+ \frac{1}{2}f(1) - \sum_{k=1}^{\infty}\frac{B_{2k}}{(2k)!}f^{(2k-1)}(1)

C(0) was then proposed to use as the sum of the divergent sequence. It is like a bridge between summation and integration.

Sum of divergent series

In the following text, \scriptstyle (\Re) indicates "Ramanujan summation". This formula originally appeared in one of Ramanujan's notebooks, without any notation to indicate that it exemplified a novel method of summation.

For example, the \scriptstyle (\Re) of 1 - 1 + 1 - ⋯ is:

1 - 1 + 1 - \cdots = \frac{1}{2}\ (\Re).

Ramanujan had calculated "sums" of known divergent series. It is important to mention that the Ramanujan sums are not the sums of the series in the usual sense,[2][3] i.e. the partial sums do not converge to this value, which is denoted by the symbol \scriptstyle (\Re). In particular, the \scriptstyle (\Re) sum of 1 + 2 + 3 + 4 + ⋯ was calculated as:

1+2+3+\cdots = -\frac{1}{12}\ (\Re)

Extending to positive even powers, this gave:

1 + 2^{2k} + 3^{2k} + \cdots = 0\ (\Re)

and for odd powers the approach suggested a relation with the Bernoulli numbers:

1+2^{2k-1}+3^{2k-1}+\cdots = -\frac{B_{2k}}{2k}\ (\Re)

It has been proposed to use of C(1) rather than C(0) as the result of Ramanujan's summation, since then it can be assured that one series \scriptstyle \sum_{k=1}^{\infty}f(k) admits one and only one Ramanujan's summation, defined as the value in 1 of the only solution of the difference equation \scriptstyle R(x) \,-\, R(x \,+\, 1) \,=\, f(x) that verifies the condition \scriptstyle \int_1^2 R(t)\,dt \,=\, 0.[4]

This definition of Ramanujan's summation (denoted as \scriptstyle \sum_{n \ge 1}^{\Re} f(n)) does not coincide with the earlier defined Ramanujan's summation, C(0), nor with the summation of convergent series, but it has interesting properties, such as: If R(x) tends to a finite limit when x → +1, then the series \scriptstyle \sum_{n \ge 1}^{\Re} f(n) is convergent, and we have

\sum_{n \ge 1}^{\Re} f(n) = \lim_{N \to \infty}\left[\sum_{n = 1}^{N}f(n) - \int_1^N f(t)\,dt\right]

In particular we have:

\sum_{n \ge 1}^{\Re} \frac{1}{n} = \gamma

where γ is the Euler–Mascheroni constant.

Ramanujan resummation can be extended to integrals; for example, using the Euler-Maclaurin summation formula, one can write

\begin{array}{l} \int\nolimits_{a}^{\infty }x^{m-s} dx =\frac{m-s}{2} \int\nolimits_{a}^{\infty }x^{m-1-s} dx +\zeta (s-m)-\sum\limits_{i=1}^{a}i^{m-s} +a^{m-s} \\ -\sum\limits_{r=1}^{\infty }\frac{B_{2r} \Gamma (m-s+1)}{(2r)!\Gamma (m-2r+2-s)} (m-2r+1-s)\int\nolimits_{a}^{\infty }x^{m-2r-s} dx \end{array}

which is the natural extension to integrals of the Zeta regularization algorithm.

This recurrence equation is finite, since for m-2r < -1,

\qquad \int_{a}^{\infty}dxx^{m-2r}= -\frac{a^{m-2r+1}}{m-2r+1} ,

where

I(n,\, \Lambda) \,=\, \int_{0}^{\Lambda}dxx^{n} (see zeta function regularization).

With \Lambda \rightarrow \infty, the application of this Ramanujan resummation lends to finite results in the renormalization of quantum field theories.

See also

References

  1. ↑ Bruce C. Berndt, Ramanujan's Notebooks, Ramanujan's Theory of Divergent Series, Chapter 6, Springer-Verlag (ed.), (1939), pp. 133-149.
  2. ↑ "The Euler-Maclaurin formula, Bernoulli numbers, the zeta function, and real-variable analytic continuation". Retrieved 20 January 2014.
  3. ↑ "Infinite series are weird". Retrieved 20 January 2014.
  4. ↑ Éric Delabaere, Ramanujan's Summation, Algorithms Seminar 2001–2002, F. Chyzak (ed.), INRIA, (2003), pp. 83–88.