Ramanujan summation explained

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

Summation

Since there are no properties of an entire sum, the Ramanujan summation functions as a property of partial sums. If we take the Euler–Maclaurin summation formula together with the correction rule using Bernoulli numbers, we see that:

\begin{align} (1)/(2) f( 0 ) + f( 1 ) + … + f(n - 1 ) + (1)/(2) f(n) & = (f( 0 ) + f(n))/(2) + \sum ^{n -1} _{k =1} f(k) = \sum ^{n} _{k =0} f(k) - (f( 0 ) + f(n))/(2) \\ & = \int ^{n} _{0} f(x)dx + \sum ^{p} _{k =1} (B _{2k})/(( 2 k)!) \left[f ^{(2k-1)} (n) - f ^{(2k-1)} ( 0 )\right] + R _{p \end{align}}

Ramanujan^[1] wrote this again for different limits of the integral and the corresponding summation for the case in which p goes to infinity:

\sum ^{x} _{k = a} f(k) = C + \int ^{x} _{a} f(t)dt + (1)/(2) f(x) + \sum ^{inf ty} _{k =1} (B _{2k})/(( 2 k)!) 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 ^{a} _{0} f(t)dt - (1)/(2) f( 0 ) - \sum ^{inf ty} _{k =1} (B _{2k})/(( 2 k)!) f ^{(2k-1)} ( 0 )

where Ramanujan assumed

a = 0 . By taking a = inf ty we normally recover the usual summation for convergent series. For functions f(x) with no divergence at x = 1, we obtain:C(a) = \int ^{a} _{1} f(t)dt + (1)/(2) f( 1 ) - \sum ^{inf ty} _{k =1} (B _{2k})/(( 2 k)!) f ^{(2k-1)} ( 1 )

alternatively, applying smoothed sums.

The convergent version of summation for functions with appropriate growth condition is then:

f( 1 ) + f( 2 ) + f( 3 ) + … =- (f( 0 ))/(2) + i\int ^{inf ty} _{0} (f(it) - f( - it))/(e ^{2\pi} -1) dt

Ramanujan summation of divergent series

In the following text,

( ak{R}) 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

( ak{R}) of is:1 - 1 + 1 - … = (1)/(2) ( ak{R}).

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

( ak{R}). In particular, the ( ak{R}) sum of was calculated as:1+2+3+ … =- (1)/(12) ( ak{R})

Extending to positive even powers, this gave:

1 + 2 ^{2k} + 3 ^{2k} + … = 0 ( ak{R})

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

1+2 ^{2k-1} +3 ^{2k-1} + … =- (B _{2k})/(2 k) ( ak{R})

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

style \sum ^{inf ty} _{k =1} f(k) admits one and only one Ramanujan's summation, defined as the value in 1 of the only solution of the difference equation R(x) - R(x + 1 ) = f(x) that verifies the condition style \int ^{2} _{1} R(t)dt = 0 .^[4]

This demonstration of Ramanujan's summation (denoted as

style\sum ^{ak{R} _{n \ge 1} } 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 style\sum ^{ak{R} _{n \ge 1} } f(n) is convergent, and we have\sum ^{ak{R} _{n \ge 1} } f(n) = \lim_ \left[\sum_{n = 1}^{N}f(n) - \int_1^N f(t)\,dt\right]

In particular we have:

\sum ^{ak{R} (1)/(n)} _{n \ge 1} = \gamma

where is the Euler–Mascheroni constant.

Extension to integrals

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

\begin{align} \int ^{inf ty} _{a} x ^{m-s} dx & = (m - s)/(2) \int ^{inf ty} _{a} dx + \zeta (s - m) - \sum ^{a} _{i =1} \left[i ^{m-s} + a ^{m-s} \right]\\ & - \sum ^{inf ty} _{r =1} (B _{2r} \theta (m - s +1 ))/(( 2 r)!\Gamma (m -2 r +2- s)) (m -2 r +1- s) \int ^{inf ty} _{a} x ^{m-2r-s} dx \end{align}

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

This recurrence equation is finite, since for

m -2 r < -1 ,\int ^{inf ty} _{a} dx x ^{m-2r} =- (a ^{m-2r+1})/(m -2 r +1) .

Note that this involves (see zeta function regularization)

I(n, Λ ) = \int ^{Λ} _{0} dx x ^{n} .

With

Λ \to inf ty , the application of this Ramanujan resummation lends to finite results in the renormalization of quantum field theories.

See also

• Borel summation
• Cesàro summation
• Divergent series
• Ramanujan's sum
• Abel–Plana formula

References

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