1 + 2 + 3 + 4 + ⋯

From Wikipedia, the free encyclopedia
(Redirected from 1+2+3+4..)
Jump to navigation Jump to search

Template:Short description

A graph depicting the series with layered boxes and a parabola that dips just below the y-axis
The first four partial sums of the series 1 + 2 + 3 + 4 + ⋯. The parabola is their smoothed asymptote; its y-intercept is −1/12.[1]

The infinite series whose terms are the positive integers 1 + 2 + 3 + 4 + ⋯ is a divergent series. The nth partial sum of the series is the triangular number

k=1nk=n(n+1)2,

which increases without bound as n goes to infinity. Because the sequence of partial sums fails to converge to a finite limit, the series does not have a sum.

Although the series seems at first sight not to have any meaningful value at all, it can be manipulated to yield a number of different mathematical results. For example, many summation methods are used in mathematics to assign numerical values even to a divergent series. In particular, the methods of zeta function regularization and Ramanujan summation assign the series a value of Template:Sfrac, which is expressed by a famous formula:[2]

1+2+3+4+=112,

where the left-hand side has to be interpreted as being the value obtained by using one of the aforementioned summation methods and not as the sum of an infinite series in its usual meaning. These methods have applications in other fields such as complex analysis, quantum field theory, and string theory.[3]

In a monograph on moonshine theory, University of Alberta mathematician Terry Gannon calls this equation "one of the most remarkable formulae in science".[4]

Partial sums

Script error: No such module "Labelled list hatnote".

File:First six triangular numbers.svg
The first six triangular numbers

The partial sums of the series 1 + 2 + 3 + 4 + 5 + 6 + ⋯ are 1, 3, 6, 10, 15, etc. The nth partial sum is given by a simple formula:

k=1nk=n(n+1)2.

This equation was known to the Pythagoreans as early as the sixth century BCE.[5] Numbers of this form are called triangular numbers, because they can be arranged as an equilateral triangle.

The infinite sequence of triangular numbers diverges to +∞, so by definition, the infinite series 1 + 2 + 3 + 4 + ⋯ also diverges to +∞. The divergence is a simple consequence of the form of the series: the terms do not approach zero, so the series diverges by the term test.

Summability

Among the classical divergent series, 1 + 2 + 3 + 4 + ⋯ is relatively difficult to manipulate into a finite value. Many summation methods are used to assign numerical values to divergent series, some more powerful than others. For example, Cesàro summation is a well-known method that sums Grandi's series, the mildly divergent series 1 − 1 + 1 − 1 + ⋯, to Template:Sfrac. Abel summation is a more powerful method that not only sums Grandi's series to Template:Sfrac, but also sums the trickier series 1 − 2 + 3 − 4 + ⋯ to Template:Sfrac.

Unlike the above series, 1 + 2 + 3 + 4 + ⋯ is not Cesàro summable nor Abel summable. Those methods work on oscillating divergent series, but they cannot produce a finite answer for a series that diverges to +∞.Template:Sfn Most of the more elementary definitions of the sum of a divergent series are stable and linear, and any method that is both stable and linear cannot sum 1 + 2 + 3 + ⋯ to a finite value Template:Xref. More advanced methods are required, such as zeta function regularization or Ramanujan summation. It is also possible to argue for the value of Template:Sfrac using some rough heuristics related to these methods.

Heuristics

File:Ramanujan Notebook 1 Chapter 8 on 1234 series.jpg
Passage from Ramanujan's first notebook describing the "constant" of the series

Srinivasa Ramanujan presented two derivations of "1 + 2 + 3 + 4 + ⋯ = Template:Sfrac" in chapter 8 of his first notebook.[6][7][8] The simpler, less rigorous derivation proceeds in two steps, as follows.

The first key insight is that the series of positive numbers 1 + 2 + 3 + 4 + ⋯ closely resembles the alternating series 1 − 2 + 3 − 4 + ⋯. The latter series is also divergent, but it is much easier to work with; there are several classical methods that assign it a value, which have been explored since the 18th century.[9]

In order to transform the series 1 + 2 + 3 + 4 + ⋯ into 1 − 2 + 3 − 4 + ⋯, one can subtract 4 from the second term, 8 from the fourth term, 12 from the sixth term, and so on. The total amount to be subtracted is 4 + 8 + 12 + 16 + ⋯, which is 4 times the original series. These relationships can be expressed using algebra. Whatever the "sum" of the series might be, call it c = 1 + 2 + 3 + 4 + ⋯. Then multiply this equation by 4 and subtract the second equation from the first: c=1+2+3+4+5+6+4c=4+8+12+c4c=12+34+56+

The second key insight is that the alternating series 1 − 2 + 3 − 4 + ⋯ is the formal power series expansion (for x at point 0) of the function Template:Sfrac which is 1 − 2x + 3x2 − 4x3 + ⋯ evaluated with x defined as 1. Accordingly, Ramanujan writes 3c=12+34+=1(1+1)2=14.

Dividing both sides by −3, one gets c = Template:Sfrac.

Generally speaking, it is incorrect to manipulate infinite series as if they were finite sums. For example, if zeroes are inserted into arbitrary positions of a divergent series, it is possible to arrive at results that are not self-consistent, let alone consistent with other methods. In particular, the step 4c = 0 + 4 + 0 + 8 + ⋯ is not justified by the additive identity law alone. For an extreme example, prepending a single zero to the front of the series can lead to a different result.[1]

One way to remedy this situation, and to constrain the places where zeroes may be inserted, is to keep track of each term in the series by attaching a dependence on some function.[10] In the series 1 + 2 + 3 + 4 + ⋯, each term n is just a number. If the term n is promoted to a function n−s, where s is a complex variable, then one can ensure that only like terms are added. The resulting series may be manipulated in a more rigorous fashion, and the variable s can be set to −1 later. The implementation of this strategy is called zeta function regularization.

Zeta function regularization

File:Zeta plot.gif
Plot of ζ(s)Script error: No such module "Check for unknown parameters".. For s > 1Script error: No such module "Check for unknown parameters"., the series converges and ζ(s) > 1Script error: No such module "Check for unknown parameters".. Analytic continuation around the pole at s = 1Script error: No such module "Check for unknown parameters". leads to a region of negative values, including ζ(−1) = Template:SfracScript error: No such module "Check for unknown parameters"..

In zeta function regularization, the series n=1n is replaced by the series n=1ns. The latter series is an example of a Dirichlet series. When the real part of Template:Mvar is greater than 1, the Dirichlet series converges, and its sum is the Riemann zeta function ζ(s)Script error: No such module "Check for unknown parameters".. On the other hand, the Dirichlet series diverges when the real part of Template:Mvar is less than or equal to 1, so, in particular, the series 1 + 2 + 3 + 4 + ⋯ that results from setting s = −1Script error: No such module "Check for unknown parameters". does not converge. The benefit of introducing the Riemann zeta function is that it can be defined for other values of Template:Mvar by analytic continuation. One can then define the zeta-regularized sum of 1 + 2 + 3 + 4 + ⋯ to be ζ(−1)Script error: No such module "Check for unknown parameters"..

From this point, there are a few ways to prove that ζ(−1) = Template:SfracScript error: No such module "Check for unknown parameters".. One method, along the lines of Euler's reasoning,[11] uses the relationship between the Riemann zeta function and the Dirichlet eta function η(s)Script error: No such module "Check for unknown parameters".. The eta function is defined by an alternating Dirichlet series, so this method parallels the earlier heuristics. Where both Dirichlet series converge, one has the identities:

ζ(s)=1s+2s+3s+4s+5s+6s+2×2sζ(s)=2×2s+2×4s+2×6s+(121s)ζ(s)=1s2s+3s4s+5s6s+=η(s).

The identity (121s)ζ(s)=η(s) continues to hold when both functions are extended by analytic continuation to include values of Template:Mvar for which the above series diverge. Substituting s = −1Script error: No such module "Check for unknown parameters"., one gets −3ζ(−1) = η(−1)Script error: No such module "Check for unknown parameters".. Now, computing η(−1)Script error: No such module "Check for unknown parameters". is an easier task, as the eta function is equal to the Abel sum of its defining series,[12] which is a one-sided limit:

3ζ(1)=η(1)=limx1(12x+3x24x3+)=limx11(1+x)2=14.

Dividing both sides by −3, one gets ζ(−1) = Template:SfracScript error: No such module "Check for unknown parameters"..

Cutoff regularization

Script error: No such module "Multiple image".

A graph showing a parabola that dips just below the y-axis
Asymptotic behavior of the smoothing. The y-intercept of the parabola is Template:Sfrac.[1]

The method of regularization using a cutoff function can "smooth" the series to arrive at Template:Sfrac. Smoothing is a conceptual bridge between zeta function regularization, with its reliance on complex analysis, and Ramanujan summation, with its shortcut to the Euler–Maclaurin formula. Instead, the method operates directly on conservative transformations of the series, using methods from real analysis.

The idea is to replace the ill-behaved discrete series n=0Nn with a smoothed version

n=0nf(nN),

where f is a cutoff function with appropriate properties. The cutoff function must be normalized to f(0) = 1Script error: No such module "Check for unknown parameters".; this is a different normalization from the one used in differential equations. The cutoff function should have enough bounded derivatives to smooth out the wrinkles in the series, and it should decay to 0 faster than the series grows. For convenience, one may require that Template:Mvar is smooth, bounded, and compactly supported. One can then prove that this smoothed sum is asymptotic to Template:Sfrac + CN2Script error: No such module "Check for unknown parameters"., where Template:Mvar is a constant that depends on Template:Mvar. The constant term of the asymptotic expansion does not depend on Template:Mvar: it is necessarily the same value given by analytic continuation, Template:SfracScript error: No such module "Check for unknown parameters"..[1]

Ramanujan summation

The Ramanujan sum of 1 + 2 + 3 + 4 + ⋯Script error: No such module "Check for unknown parameters". is also Template:SfracScript error: No such module "Check for unknown parameters".. Ramanujan wrote in his second letter to G. H. Hardy, dated 27 February 1913:

Template:Quote

Ramanujan summation is a method to isolate the constant term in the Euler–Maclaurin formula for the partial sums of a series. For a function Template:Mvar, the classical Ramanujan sum of the series k=1f(k) is defined as

c=12f(0)k=1B2k(2k)!f(2k1)(0),

where f(2k−1)Script error: No such module "Check for unknown parameters". is the (2k − 1)th derivative of Template:Mvar and B2kScript error: No such module "Check for unknown parameters". is the (2k)th Bernoulli number: B2 = Template:SfracScript error: No such module "Check for unknown parameters"., B4 = Template:SfracScript error: No such module "Check for unknown parameters"., and so on. Setting f(x) = xScript error: No such module "Check for unknown parameters"., the first derivative of Template:Mvar is 1, and every other term vanishes, so[13]

c=16×12!=112.

To avoid inconsistencies, the modern theory of Ramanujan summation requires that Template:Mvar is "regular" in the sense that the higher-order derivatives of Template:Mvar decay quickly enough for the remainder terms in the Euler–Maclaurin formula to tend to 0. Ramanujan tacitly assumed this property.[13] The regularity requirement prevents the use of Ramanujan summation upon spaced-out series like 0 + 2 + 0 + 4 + ⋯, because no regular function takes those values. Instead, such a series must be interpreted by zeta function regularization. For this reason, Hardy recommends "great caution" when applying the Ramanujan sums of known series to find the sums of related series.Template:Sfn

Failure of stable linear summation methods

Script error: No such module "Labelled list hatnote". A summation method that is linear and stable cannot sum the series 1 + 2 + 3 + ⋯Script error: No such module "Check for unknown parameters". to any finite value. (Stable means that adding a term at the beginning of the series increases the sum by the value of the added term.) This can be seen as follows. If

1+2+3+=x,

then adding 0 to both sides gives

0+1+2+3+=0+x=x

by stability. By linearity, one may subtract the second equation from the first (subtracting each component of the second line from the first line in columns) to give

1+1+1+=xx=0.

Adding 0 to both sides again gives

0+1+1+1+=0,

and subtracting the last two series gives

1+0+0+0+=0,

contradicting stability.

Therefore, every method that gives a finite value to the sum 1 + 2 + 3 + ⋯Script error: No such module "Check for unknown parameters". is not stable or not linear.[14]

Physics

In bosonic string theory, the attempt is to compute the possible energy levels of a string, in particular, the lowest energy level. Speaking informally, each harmonic of the string can be viewed as a collection of D − 2Script error: No such module "Check for unknown parameters". independent quantum harmonic oscillators, one for each transverse direction, where Template:Mvar is the dimension of spacetime. If the fundamental oscillation frequency is Template:Mvar, then the energy in an oscillator contributing to the Template:Mvarth harmonic is nħω/2Script error: No such module "Check for unknown parameters".. So using the divergent series, the sum over all harmonics is ħω(D − 2)/24Script error: No such module "Check for unknown parameters".. Ultimately it is this fact, combined with the Goddard–Thorn theorem, which leads to bosonic string theory failing to be consistent in dimensions other than 26.[15]

The regularization of 1 + 2 + 3 + 4 + ⋯Script error: No such module "Check for unknown parameters". is also involved in computing the Casimir force for a scalar field in one dimension.[16] An exponential cutoff function suffices to smooth the series, representing the fact that arbitrarily high-energy modes are not blocked by the conducting plates. The spatial symmetry of the problem is responsible for canceling the quadratic term of the expansion. All that is left is the constant term −1/12, and the negative sign of this result reflects the fact that the Casimir force is attractive.Template:Sfn

A similar calculation is involved in three dimensions, using the Epstein zeta-function in place of the Riemann zeta function.[17]

History

It is unclear whether Leonhard Euler summed the series to Template:Sfrac. According to Morris Kline, Euler's early work on divergent series relied on function expansions, from which he concluded 1 + 2 + 3 + 4 + ⋯ = ∞Script error: No such module "Check for unknown parameters"..[18] According to Raymond Ayoub, the fact that the divergent zeta series is not Abel-summable prevented Euler from using the zeta function as freely as the eta function, and he "could not have attached a meaning" to the series.[19] Other authors have credited Euler with the sum, suggesting that Euler would have extended the relationship between the zeta and eta functions to negative integers.[20][21][22] In the primary literature, the series 1 + 2 + 3 + 4 + ⋯Script error: No such module "Check for unknown parameters". is mentioned in Euler's 1760 publication Script error: No such module "Lang". alongside the divergent geometric series 1 + 2 + 4 + 8 + ⋯Script error: No such module "Check for unknown parameters".. Euler hints that series of this type have finite, negative sums, and he explains what this means for geometric series, but he does not return to discuss 1 + 2 + 3 + 4 + ⋯Script error: No such module "Check for unknown parameters".. In the same publication, Euler writes that the sum of 1 + 1 + 1 + 1 + ⋯Script error: No such module "Check for unknown parameters". is infinite.[23]

In popular media

David Leavitt's 2007 novel The Indian Clerk includes a scene where Hardy and Littlewood discuss the meaning of this series. They conclude that Ramanujan has rediscovered ζ(−1)Script error: No such module "Check for unknown parameters"., and they take the "lunatic asylum" line in his second letter as a sign that Ramanujan is toying with them.[24]

Simon McBurney's 2007 play A Disappearing Number focuses on the series in the opening scene. The main character, Ruth, walks into a lecture hall and introduces the idea of a divergent series before proclaiming, "I'm going to show you something really thrilling", namely 1 + 2 + 3 + 4 + ⋯ = Template:SfracScript error: No such module "Check for unknown parameters".. As Ruth launches into a derivation of the functional equation of the zeta function, another actor addresses the audience, admitting that they are actors: "But the mathematics is real. It's terrifying, but it's real."[25][26]

In January 2014, Numberphile produced a YouTube video on the series, which gathered over 1.5 million views in its first month.[27] The 8-minute video is narrated by Tony Padilla, a physicist at the University of Nottingham. Padilla begins with 1 − 1 + 1 − 1 + ⋯Script error: No such module "Check for unknown parameters". and 1 − 2 + 3 − 4 + ⋯Script error: No such module "Check for unknown parameters". and relates the latter to 1 + 2 + 3 + 4 + ⋯Script error: No such module "Check for unknown parameters". using a term-by-term subtraction similar to Ramanujan's argument.[28]Template:Fcn Numberphile also released a 21-minute version of the video featuring Nottingham physicist Ed Copeland, who describes in more detail how 1 − 2 + 3 − 4 + ⋯ = Template:SfracScript error: No such module "Check for unknown parameters". as an Abel sum, and 1 + 2 + 3 + 4 + ⋯ = Template:SfracScript error: No such module "Check for unknown parameters". as ζ(−1)Script error: No such module "Check for unknown parameters"..[29]Template:Fcn After receiving complaints about the lack of rigour in the first video, Padilla also wrote an explanation on his webpage relating the manipulations in the video to identities between the analytic continuations of the relevant Dirichlet series.[30]

In The New York Times coverage of the Numberphile video, mathematician Edward Frenkel commented: "This calculation is one of the best-kept secrets in math. No one on the outside knows about it."[27]

Coverage of this topic in Smithsonian magazine describes the Numberphile video as misleading and notes that the interpretation of the sum as Template:Sfrac relies on a specialized meaning for the equals sign, from the techniques of analytic continuation, in which equals means is associated with.[31] The Numberphile video was critiqued on similar grounds by German mathematician Burkard Polster on his Mathologer YouTube channel in 2018, his video receiving 2.7 million views by 2023.[32]

References

<templatestyles src="Reflist/styles.css" />

  1. a b c d Script error: No such module "citation/CS1"..
  2. Script error: No such module "citation/CS1"..
  3. Script error: No such module "citation/CS1".
  4. Script error: No such module "citation/CS1"..
  5. Script error: No such module "citation/CS1".
  6. Script error: No such module "citation/CS1".
  7. Script error: No such module "citation/CS1".
  8. Script error: No such module "citation/CS1".
  9. Script error: No such module "citation/CS1". Originally published as Script error: No such module "Citation/CS1".
  10. Promoting numbers to functions is identified as one of two broad classes of summation methods, including Abel and Borel summation, by Script error: No such module "citation/CS1".
  11. Script error: No such module "citation/CS1"..
  12. Script error: No such module "citation/CS1".
  13. a b Script error: No such module "citation/CS1"..
  14. Script error: No such module "citation/CS1"..
  15. Script error: No such module "citation/CS1"..
  16. See v:Quantum mechanics/Casimir effect in one dimension.Template:Reliable source?
  17. Script error: No such module "citation/CS1"..
  18. Script error: No such module "Citation/CS1"..
  19. Script error: No such module "Citation/CS1"..
  20. Script error: No such module "Citation/CS1".
  21. Script error: No such module "Citation/CS1".
  22. Script error: No such module "Citation/CS1".
  23. Script error: No such module "Citation/CS1".
  24. Script error: No such module "citation/CS1"..
  25. Script error: No such module "citation/CS1"..
  26. Script error: No such module "citation/CS1".
  27. a b Script error: No such module "citation/CS1"..
  28. Template:Replace on YouTubeScript error: No such module "Check for unknown parameters"..
  29. Template:Replace on YouTubeScript error: No such module "Check for unknown parameters"..
  30. Script error: No such module "citation/CS1".
  31. Script error: No such module "citation/CS1".
  32. Script error: No such module "Citation/CS1".

Script error: No such module "Check for unknown parameters".

Bibliography

<templatestyles src="Refbegin/styles.css" />

  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".

Further reading

<templatestyles src="Refbegin/styles.css" />

  • Script error: No such module "citation/CS1". See p. 293.
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".

External links

Template:Sister project

Template:Series (mathematics)