Summation

:"For evaluation of sums in closed form see evaluating sums.":"Summation is also a term used to describe a process in synapse biology."

Summation is the addition of a set of numbers; the result is their "sum" or "total". The "numbers" to be summed may be natural numbers, complex numbers, matrices, or still more complicated objects. An infinite sum is a subtle procedure known as a series. Note that the term summation has a special meaning in the context of divergent series related to extrapolation.

Notation

The summation of 1, 2, and 4 is 1 + 2 + 4 = 7. The sum is 7. Since addition is associative, it does not matter whether we interpret "1 + 2 + 4" as (1 + 2) + 4 or as 1 + (2 + 4); the result is the same, so parentheses are usually omitted in a sum. Finite addition is also commutative, so the order in which the numbers are written does not affect its sum. (For issues with infinite summation, see absolute convergence.)

If a sum has too many terms to be written out individually, the sum may be written with an ellipsis to mark out the missing terms.Thus, the sum of all the natural numbers from 1 to 100 is 1 + 2 + … + 99 + 100 = 5050.

Capital-sigma notation

Mathematical notation has a special representation for compactly representing summation of many similar terms: the "summation symbol", a large upright capital Sigma. This is defined thus::$sum\_\{i=m\}^n\; x\_i\; =\; x\_m\; +\; x\_\{m+1\}\; +\; x\_\{m+2\}\; +dots+\; x\_\{n-1\}\; +\; x\_n.$

The subscript gives the symbol for an index variable, "i". Here, "i" represents the index of summation; "m" is the lower bound of summation, and "n" is the upper bound of summation. Here "i" = "m" under the summation symbol means that the index "i" starts out equal to "m". Successive values of "i" are found by adding 1 to the previous value of "i", stopping when "i" = "n". We could as well have used "k" instead of "i", as in:$sum\_\{k=2\}^6\; k^2\; =\; 2^2+3^2+4^2+5^2+6^2\; =\; 90$.

Informal writing sometimes omits the definition of the index and bounds of summation when these are clear from context, as in:$sum\; x\_i^2$which is informally equivalent to:$sum\_\{i=1\}^n\; x\_i^2$.

One often sees generalizations of this notation in which an arbitrary logical condition is supplied, and the sum is intended to be taken over all values satisfying the condition. For example::is the sum of "f"("k") over all (integer) "k" in the specified range,:$sum\_\{xin\; S\}\; f(x)$is the sum of "f"("x") over all elements "x" in the set "S", and:$sum\_\{d|n\};mu(d)$is the sum of μ("d") over all integers "d" dividing "n".

:(Remark: Although the name of the dummy variable does not matter (by definition), one usually uses letters from the middle of the alphabet ("i" through "q") to denote integers, if there is a risk of confusion. For example, even if there should be no doubt about the interpretation, it could look slightly confusing to many mathematicians to see "x" instead of "k" in the above formulae involving "k". See also typographical conventions in mathematical formulae.)

There are also ways to generalize the use of many sigma signs. For example,:$sum\_\{ell,ell\text{'}\}$is the same as:$sum\_ellsum\_\{ell\text{'}\}.$

Programming language notation

Summations can also be represented in a programming language.$sum\_\{i=m\}^\{n\}\; x\_\{i\}$Some languages use a notation for summation similar to the mathematical one. For example, this is Python:sum(x [m:n+1] )and this is Fortran (or Matlab):sum(x(m:n))

and this is J : +/x

In other languages loops are used, as in the following Visual Basic/VBScript program: Sum = 0 For I = M To N Sum = Sum + X(I) Next Ior the following C/C++/C#/Java code, which assumes that the variables m and n are defined as integer types no wider than int, such that m ≥ n, and that the variable x is defined as an array of values of integer type no wider than int, containing at least m − n + 1 defined elements:int i;int sum = 0;for (i = m; i <= n; i++) sum += x [i] ;

In some cases a loop can be written more concisely, as in this Perl code:$sum = 0;$sum += $x [$_] for ($m..$n);or these alternative Ruby expressions:x [m..n] .inject{|a,b| a+b}x [m..n] .inject(0){|a,b| a+b}or in C++, using its standard library:std::accumulate(&x [m] , &x [n] + 1, 0)when x is an built-in array or a std::vector.

Note that most of these examples begin by initializing the sum variable to 0, the identity element for addition. (See "special cases" below).

Also note that the traditional $sum$ notation allows for the upper bound to be less than the lower bound. In this case, the index variable is initialized with the upper bound instead of the lower bound, and it is decremented instead of incremented. Since addition is commutative, this might also be accomplished by swapping the upper and lower bound and incrementing in a positive direction as usual.

Also note that the $sum$ notation evaluates to a definite value, while most of the loop constructs used above are only valid in an imperative programming language's statement context, requiring the use of an extra variable to hold the final value. It is the variable which would then be used in a larger expression.

The exact meaning of $sum$, and therefore its translation into a programming language, changes depending on the data type of the subscript and upper bound. In other words, $sum$ is an overloaded symbol.

In the above examples, the subscript of $sum$ was translated into an assignment statement to an index variable at the beginning of a for loop. But the subscript is not always an assignment statement. Sometimes the subscript sets up the iterator for a foreach loop, and sometimes the subscript is itself an array, with no index variable or iterator provided. Other times, the subscript is merely a Boolean expression that contains an embedded variable, implying to an intelligent human, but not to a dumb computer, that every value of the value should be used where the Boolean expression evaluates to true.

In the example below:

:$sum\_\{xin\; S\}\; f(x)$

$x$ is an iterator, which implies a foreach loop, but $S$ is a set, which is an array-like data structure that can store values of mixed type. The summation routine for a set would have to account for the fact that it is possible to store non-numerical data in a set.

The return value of $sum$ is a scalar in all examples given above.

pecial cases

It is possible to sum fewer than 2 numbers:
*If one sums the single term "x", then the sum is "x".
*If one sums zero terms, then the sum is zero, because zero is the identity for addition. This is known as the "empty sum".

These degenerate cases are usually only used when the summation notation gives a degenerate result in a special case.For example, if "m" = "n" in the definition above, then there is only one term in the sum; if "m" = "n" + 1, then there is none.

Approximation by definite integrals

Many such approximations can be obtained by the following connection between sums and integrals, which holds for any:

increasing function "f":

:$int\_\{s=a-1\}^\{b\}\; f(s),\; ds\; le\; sum\_\{i=a\}^\{b\}\; f(i)\; le\; int\_\{s=a\}^\{b+1\}\; f(s),\; ds.$

decreasing function "f":

:$int\_\{s=a\}^\{b+1\}\; f(s),\; ds\; le\; sum\_\{i=a\}^\{b\}\; f(i)\; le\; int\_\{s=a-1\}^\{b\}\; f(s),\; ds.$

For more general approximations, see the Euler–Maclaurin formula.

For functions that are integrable on the interval ["a", "b"] , the Riemann sum can be used as an approximation of the definite integral. For example, the following formula is the left Riemann sum with equal partitioning of the interval:

:$frac\{b-a\}\{n\}sum\_\{i=0\}^\{n-1\}\; fleft(a+ifrac\{b-a\}n\; ight)approx\; int\_a^b\; f(x),dx.$

The accuracy of such an approximation increases with the number "n" of subintervals, such that:

:$lim\_\{n\; ightarrow\; infty\}\; frac\{b-a\}\{n\}sum\_\{i=0\}^\{n-1\}\; fleft(a+ifrac\{b-a\}n\; ight)\; =\; int\_a^b\; f(x),dx.$

Identities

:"See also List of mathematical series"The following are useful identities:
*$sum\_\{n=s\}^t\; Csdot\; f(n)\; =\; Csdot\; sum\_\{n=s\}^t\; f(n)$, where 'C' is a distributed constant. (See Scalar multiplication)
*$sum\_\{i=s\}^n\; f(C)\; =\; f(C)sdot\; f(n)$, where 'C' is a constant.
*$sum\_\{n=s\}^t\; f(n)\; +\; sum\_\{n=s\}^\{t\}\; g(n)\; =\; sum\_\{n=s\}^t\; left\; [f(n)\; +\; g(n)\; ight]$
*$sum\_\{n=s\}^t\; f(n)\; =\; sum\_\{n=s+p\}^\{t+p\}\; f(n-p)$
*$sum\_\{n=s\}^j\; f(n)\; +\; sum\_\{n=j+1\}^t\; f(n)\; =\; sum\_\{n=s\}^t\; f(n)$
*$sum\_\{i=m\}^n\; x\; =\; (n-m+1)x$
*$sum\_\{i=1\}^n\; x\; =\; nx$, definition of multiplication where n is an integer multiplier to x
*$sum\_\{i=m\}^n\; i\; =\; frac\{(n-m+1)(n+m)\}\{2\}$ (see arithmetic series)
*$sum\_\{i=0\}^n\; i\; =\; sum\_\{i=1\}^n\; i\; =\; frac\{(n)(n+1)\}\{2\}$ (Special case of the arithmetic series)
*$sum\_\{i=1\}^n\; i^2\; =\; frac\{n(n+1)(2n+1)\}\{6\}\; =\; frac\{n^3\}\{3\}\; +\; frac\{n^2\}\{2\}\; +\; frac\{n\}\{6\}$
*$sum\_\{i=1\}^n\; i^3\; =\; left(frac\{n(n+1)\}\{2\}\; ight)^2\; =\; frac\{n^4\}\{4\}\; +\; frac\{n^3\}\{2\}\; +\; frac\{n^2\}\{4\}\; =\; left\; [sum\_\{i=1\}^n\; i\; ight]\; ^2$
*$sum\_\{i=1\}^n\; i^4\; =\; frac\{n(n+1)(2n+1)(3n^2+3n-1)\}\{30\}\; =\; frac\{n^5\}\{5\}\; +\; frac\{n^4\}\{2\}\; +\; frac\{n^3\}\{3\}\; -\; frac\{n\}\{30\}$
*$sum\_\{i=0\}^n\; i^p\; =\; frac\{(n+1)^\{p+1\{p+1\}\; +\; sum\_\{k=1\}^pfrac\{B\_k\}\{p-k+1\}\{pchoose\; k\}(n+1)^\{p-k+1\}$:where $B\_k$ is the "k"th Bernoulli number.
*$sum\_\{i=m\}^n\; x^i\; =\; frac\{x^\{n+1\}-x^\{m\{x-1\}$ (see geometric series)
*$sum\_\{i=0\}^n\; x^i\; =\; frac\{x^\{n+1\}-1\}\{x-1\}$ (special case of the above where "m" = 0)
*$sum\_\{i=0\}^n\; i\; 2^i\; =\; 2+2^\{n+1\}(n-1)$
*$sum\_\{i=0\}^n\; frac\{i\}\{2^i\}\; =\; frac\{2^\{n+1\}-n-2\}\{2^n\}$
*$sum\_\{i=0\}^n\; i\; x^i\; =\; frac\{x\}\{(1-x)^2\}\; (x^n(n(x-1)-1)+1)$
*$sum\_\{i=0\}^n\; i^2\; x^i\; =\; frac\{x\}\{(1-x)^3\}\; (1+x-(n+1)^2x^n+(2n^2+2n-1)x^\{n+1\}-n^2x^\{n+2\})$
*$sum\_\{i=0\}^n\; \{n\; choose\; i\}\; =\; 2^n$ (see binomial coefficient)
*$sum\_\{i=0\}^\{n-1\}\; \{i\; choose\; k\}\; =\; \{n\; choose\; k+1\}$
*$left(sum\_i\; a\_i\; ight)left(sum\_j\; b\_j\; ight)\; =\; sum\_isum\_j\; a\_ib\_j$
*
*$sum\_\{n=a\}^b\; f(n)\; =\; sum\_\{n=b\}^\{a\}\; f(n)$
*$sum\_\{n=s\}^t\; f(n)\; =\; sum\_\{n=-t\}^\{-s\}\; f(-n)$
*$sum\_\{n=0\}^t\; f(2n)\; +\; sum\_\{n=0\}^t\; f(2n+1)\; =\; sum\_\{n=0\}^\{2t+1\}\; f(n)$
*$sum\_\{n=0\}^t\; sum\_\{i=0\}^\{z-1\}\; f(zsdot\; n+i)\; =\; sum\_\{n=0\}^\{zsdot\; t+z-1\}\; f(n)$
*$widehat\{b\}^\{left\; [sum\_\{n=s\}^t\; f(n)\; ight]\; \}\; =\; prod\_\{n=s\}^t\; widehat\{b\}^\{f(n)\}$ (See Product of a series)
*$lim\_\{t\; ightarrow\; infty\}\; sum\_\{n=a\}^t\; f(n)\; =\; sum\_\{n=a\}^infty\; f(n)$ (See Infinite limits)
*$(a\; +\; b)^n\; =\; sum\_\{i=0\}^n\; \{n\; choose\; i\}a^\{(n-i)\}\; b^i$, for binomial expansion
*$sum\_\{n=b+1\}^\{infty\}\; frac\{b\}\{n^2\; -\; b^2\}\; =\; sum\_\{n=1\}^\{2b\}\; frac\{1\}\{2n\}$
*$left(sum\_\{i=1\}^\{n\}\; f\_i(x)\; ight)^prime\; =\; sum\_\{i=1\}^\{n\}\; f\_i^prime(x)$

Growth rates

The following are useful approximations (using theta notation):
*$sum\_\{i=1\}^n\; i^c\; in\; Theta(n^\{c+1\})$ for real "c" greater than -1
*$sum\_\{i=1\}^n\; frac\{1\}\{i\}\; in\; Theta(log\; n)$
*$sum\_\{i=1\}^n\; c^i\; in\; Theta(c^n)$ for real "c" greater than 1
*$sum\_\{i=1\}^n\; log(i)^c\; in\; Theta(n\; cdot\; log(n)^\{c\})$ for nonnegative real "c"
*$sum\_\{i=1\}^n\; log(i)^c\; cdot\; i^d\; in\; Theta(n^\{d+1\}\; cdot\; log(n)^\{c\})$ for nonnegative real "c", "d"
*$sum\_\{i=1\}^n\; log(i)^c\; cdot\; i^d\; cdot\; b^i\; in\; Theta\; (n^d\; cdot\; log(n)^c\; cdot\; b^n)$ for nonnegative real "b" > 1, "c", "d"

ee also

*Einstein notation
*Checksum
*Product (mathematics)
*Kahan summation algorithm
*Method to Derive Polynomial Representations that Sum Natural Numbers with Exponents [http://upload.wikimedia.org/wikipedia/commons/6/62/Sum_of_i.pdf]

Further Reading

* Nicholas J. Higham, " [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.3535 The accuracy of floating point summation] ", "SIAM J. Scientific Computing" 14 (4), 783–799 (1993).

External links

*planetmath reference|id=6361|title=Summation