# total

The Greek capital sigma is often used to add up sequences of numbers. It is then called the "sum symbol".

In mathematics, a sum describes the result of an addition as well as the representation of the addition. In the simplest case, a sum is a number that is created by adding two or more numbers. There are many generalizations to this term. In the past, for example, one spoke of summable functions and meant integrable functions .

## Word history and meanings

The word sum was borrowed in Middle High German from the Latin summa . Summa was used next to sum up to the 19th century and goes back to summus , one of the Latin superlatives of superus "above, the / the / the higher / upper", which consequently means "the / the / the highest / supreme" mean. "The top one" because the Romans used to write the total in the top line, ie above the summands, and not, as is common today, "the bottom line".

In everyday language, sum denotes an amount of money , regardless of whether it has come about through addition or not.

## Sum as a result and representation of an addition

In the mathematical term

${\ displaystyle 2 + 3}$

the numbers 2 and 3 are called summands . The entire term , like the result 5, is referred to as the “sum of 2 and 3”. ${\ displaystyle 2 + 3}$

You can form a sum with more than two summands, for example . A common convention is to simply leave out the brackets when using left parentheses, i.e. simply abbreviate them with . Due to the associativity of the addition of natural numbers, the order in which the additions are carried out does not matter for the result. The following applies: ${\ displaystyle (4 + 7) +1}$${\ displaystyle (4 + 7) +1}$${\ displaystyle 4 + 7 + 1}$

${\ displaystyle (4 + 7) + 1 = 4 + (7 + 1)}$

The equals sign expresses the equality of the results of the two different terms.

Due to the commutative law of addition of natural numbers, the order of the summands is also irrelevant, for example:

${\ displaystyle 4 + 7 + 1 = 7 + 4 + 1}$

If the same number is added twice, the sum can also be written as a product . For example: ${\ displaystyle n}$${\ displaystyle a}$ ${\ displaystyle n \ cdot a}$

${\ displaystyle a + a + a = 3 \ cdot a}$

## Weighted sum

In some cases, the individual summands are not simply added, but rather multiplied by a weight beforehand:

${\ displaystyle 2 \ cdot {\ text {Weight}} _ {1} +3 \ cdot {\ text {Weight}} _ {2}}$

For example:

${\ displaystyle 2 \ times 3 + 3 \ times}$

In this case one speaks of a weighted sum. If you divide the weighted sum by the sum of the weights, you get the weighted arithmetic mean .

## Sum of a sequence, series

If a sum has a large number of summands, it is advisable to agree on an abbreviated form. For example, the sum of the first 100 natural numbers can be used as

${\ displaystyle 1 + 2 + 3 + \ dotsb +100}$

because it is easy to guess which summands have been replaced by the ellipsis .

Just as in elementary arithmetic one moves from numerical calculations to letter calculations such as , one can e.g. B. also generalize the sum of a hundred very specific numbers to the sum of any number of arbitrary numbers. To do this, a variable is first selected, for example , which describes the number of summands. In the above case, the sum of the first hundred natural numbers would be . Since arbitrarily large numbers should be allowed, it is not possible to designate all summands with different letters. Instead, a single letter, e.g. B. , selected and supplemented by an index . This index takes on the values ​​one after the other . The summands are called accordingly . They form thus figures follow . ${\ displaystyle 2 + 3 = 5}$${\ displaystyle 2 + x = y}$${\ displaystyle n}$${\ displaystyle n = 100}$${\ displaystyle n}$${\ displaystyle n}$${\ displaystyle n}$${\ displaystyle a}$${\ displaystyle 1,2, \ dotsc}$${\ displaystyle a_ {1}, a_ {2}, \ dotsc}$

We can now use the sum of the first terms of the number sequence for any natural numbers as ${\ displaystyle n}$${\ displaystyle n}$

${\ displaystyle s_ {n} = a_ {1} + a_ {2} + \ dotsb + a_ {n}}$

write. If you use different values , they in turn also form a sequence. Such a sequence of partial sums over the initial terms of a sequence is called a series . ${\ displaystyle n}$${\ displaystyle 1,2, \ dotsc}$${\ displaystyle s_ {1}, s_ {2}, \ dotsc}$

Example: For the sequence of square numbers , , . In general: ${\ displaystyle a_ {1} = 1}$${\ displaystyle a_ {2} = 4}$${\ displaystyle a_ {3} = 9}$

${\ displaystyle a_ {n} = n ^ {2}}$

The series of partial sums this episode begins with , , . A summation formula says for any : ${\ displaystyle s_ {1} = 1}$${\ displaystyle s_ {2} = 5}$${\ displaystyle s_ {3} = 14}$${\ displaystyle n}$

${\ displaystyle s_ {n} = {\ frac {n (n + 1) (2n + 1)} {6}}}$

Other summation formulas such as The Little Gauss

${\ displaystyle 1 + 2 + \ dotsb + n = {\ frac {n (n + 1)} {2}}}$

can be found in the arithmetic formula collection . The proof of such formulas can often be done by means of complete induction .

## Notation with the sum symbol

The sigma notation

Sums over finite or infinite sequences can also be noted with the sum symbol instead of with an ellipsis :

${\ displaystyle \ sum _ {k = m} ^ {n} a_ {k} = \ sum _ {m \ leq k \ leq n} a_ {k} = a_ {m} + a_ {m + 1} + \ dotsb + a_ {n}}$

The sum symbol consists of the capital Greek letter Σ ( sigma ), followed by a sequence term, which is indicated by an index (here ) that was not previously used . This index is often referred to as a running index or summation variable or running or counting variable . One of the letters is often used for this. If it is not clear which variable is the counter variable, this must be noted in the text. ${\ displaystyle k}$${\ displaystyle i, j, k, l, m, n}$

Simple example: ${\ displaystyle \ sum \ limits _ {k = 1} ^ {10} k = 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 = 55}$

The values ​​that the run variable can assume are displayed on the bottom and, if necessary, on the top of the symbol Σ. There are two ways to do this:

1. Either a start value is specified below and an end value above (here: and ). The running index is usually only written down below; more detailed, but quite uncommon${\ displaystyle m}$${\ displaystyle n}$${\ displaystyle \ textstyle \ sum _ {k = m} ^ {k = n} a_ {k}.}$
2. Or one or more conditions for the counter variable are given below. The above example can also be noted by.${\ displaystyle \ textstyle \ sum _ {m \ leq k \ leq n} a_ {k}}$

This information can be reduced or omitted if it can be assumed that the reader will be able to add it out of the context. This is used extensively in certain contexts: In tensor calculus , Einstein's summation convention is often agreed , according to which even the summation sign can be omitted, as it is clear from the context that all duplicate indices have to be summed up. Here is an animation of the Sigma notation:

### Formal definition

Let be an (index) set, a commutative monoid . For each one is given. Then the following can be defined at least for finite index sets by recursion: One sets ${\ displaystyle I}$${\ displaystyle A}$${\ displaystyle i \ in I}$${\ displaystyle a_ {i} \ in A}$${\ displaystyle \ sum _ {i \ in I} a_ {i} \ in A}$

${\ displaystyle \ sum _ {i \ in \ emptyset} a_ {i}: = 0 \ in A}$

and otherwise

${\ displaystyle \ sum _ {i \ in I} a_ {i}: = a_ {j} + \ sum _ {i \ in I \ setminus \ {j \}} a_ {i} \ in A}$

by choosing any element . Commutativity and associativity of addition in guarantee that this is well defined. ${\ displaystyle j \ in I}$${\ displaystyle A}$

In this sense, the notation with is just an abbreviation for with . ${\ displaystyle \ sum _ {k = m} ^ {n} a_ {k}}$${\ displaystyle m, n \ in \ mathbb {Z}}$${\ displaystyle \ sum _ {k \ in I} a_ {k}}$${\ displaystyle I = \ {i \ in \ mathbb {Z} \ mid m \ leq i \ leq n \}}$

If is infinite, it is generally only defined if holds for almost all . In this case you bet ${\ displaystyle I}$${\ displaystyle \ sum _ {i \ in I} a_ {i}}$${\ displaystyle a_ {i} = 0}$ ${\ displaystyle i}$

${\ displaystyle \ sum _ {i \ in I} a_ {i}: = \ sum _ {i \ in \ {k \ in I \ mid a_ {k} \ neq 0 \}} a_ {i}.}$

According to the assumption, on the right is a finite index set, i.e. a sum as defined above. If an infinite number are not equal to 0, then despite the same spelling, it is no longer a sum, but a series ( see below ). ${\ displaystyle a_ {i}}$

### Bracket conventions and calculation rules

If the following link is reported as a sum (or difference), it must be written in brackets:

${\ displaystyle \ sum _ {k = m} ^ {n} (a_ {k} + b_ {k}) = \ sum _ {k = m} ^ {n} a_ {k} + \ sum _ {k = m} ^ {n} b_ {k}}$

If the following term is communicated as a product (or quotient), the brackets are superfluous:

${\ displaystyle \ sum _ {k = m} ^ {n} \ lambda \ cdot a_ {k} = \ lambda \ cdot \ sum _ {k = m} ^ {n} a_ {k}}$

Caution: In general: ${\ displaystyle \ sum _ {k = m} ^ {n} a_ {k} \ cdot b_ {k} \ neq \ sum _ {k = m} ^ {n} a_ {k} \ cdot \ sum _ {k = m} ^ {n} b_ {k}}$

### Special sums

For the sum consists of a single summand : ${\ displaystyle n = m}$${\ displaystyle a_ {m}}$

${\ displaystyle \ sum _ {k = m} ^ {m} a_ {k} = a_ {m}}$.

For one has a so-called empty sum , which is equal to 0, since the index set is empty: ${\ displaystyle n ${\ displaystyle I = \ {k \ in \ mathbb {Z} \ mid m \ leq k \ leq n \}}$

${\ displaystyle \ sum _ {k = m} ^ {n} a_ {k} = 0 \ quad}$for .${\ displaystyle n

If the general sequel is constant (more precisely: independent of the running variable ), the sum can be rewritten as a simple product: ${\ displaystyle k}$

${\ displaystyle \ sum _ {k = m} ^ {n} c = (n-m + 1) \ c \ quad}$for .${\ displaystyle n \ geq m-1}$

### Double sums

You can also add totals again. This is particularly useful if the first, the "inner" sum, contains an index that can be used as a running index for the "outer" sum. For example you write:

${\ displaystyle \ sum _ {i, j = 1} ^ {n} a_ {ij}: = \ sum _ {i = 1} ^ {n} \ left (\ sum _ {j = 1} ^ {n} a_ {ij} \ right)}$

The following rule applies: ${\ displaystyle \ sum _ {i, j = 1} ^ {n} a_ {ij} = \ sum _ {j, i = 1} ^ {n} a_ {ij}}$

In mathematical physics, the following convention also applies to double sums :

An apostrophe at the summation sign means that summands are to be omitted from the summation for which the two running variables match:

${\ displaystyle \ sideset {} {^ {\ prime}} \ sum _ {ij} a_ {ij}: = \ sum _ {i \ neq j} a_ {ij}}$

## line

When an infinite number of expressions are summed up, for example

${\ displaystyle \ sum _ {j = 1} ^ {\ infty} a_ {j} = \ sum _ {j \ geq 1} a_ {j} = a_ {1} + a_ {2} + a_ {3} + \ dotsb}$

with (countable) infinite number of non- zero summands , methods of analysis must be applied to the corresponding limit value

${\ displaystyle \ sum _ {j = 1} ^ {\ infty} a_ {j}: = \ lim _ {n \ to \ infty} \ sum _ {j = 1} ^ {n} a_ {j}}$

to be found, if it exists. Such a sum is called an infinite series . The symbol for infinity is written as the upper limit . ${\ displaystyle \ infty}$

Important differences between series and real sums are, for example:

• ${\ displaystyle \ textstyle \ sum _ {j = 1} ^ {\ infty} a_ {j}}$is not defined for any (i.e., convergent).${\ displaystyle (a_ {i}) _ {i \ in \ mathbb {N}}}$
• Convergence and value can depend on the order of the summands.
• The swapping of double sums cannot always be transferred to (double) rows.
• Lack of isolation: For example, is irrational, although all summands are rational.${\ displaystyle \ textstyle \ sum _ {n = 1} ^ {\ infty} {\ frac {1} {n ^ {2}}} = {\ frac {\ pi ^ {2}} {6}}}$

It should be noted, however, that not every sum that has an upper limit has to be an infinite sum. For example has the sum ${\ displaystyle \ infty}$

${\ displaystyle \ sum _ {k> 0} \ left [{\ frac {n} {p ^ {k}}} \ right] = \ left [{\ frac {n} {p}} \ right] + \ left [{\ frac {n} {p ^ {2}}} \ right] + \ left [{\ frac {n} {p ^ {3}}} \ right] + \ dotsb}$

for prime numbers and with the integer function, there is an infinite number of summands, but only finitely many are not equal to zero. (This sum indicates how often the factor occurs in the prime factorization of .) ${\ displaystyle p}$ ${\ displaystyle x \ mapsto [x]}$ ${\ displaystyle p}$${\ displaystyle n!}$

## Related terms

• The disjoint union of sets has a certain formal similarity to the addition of numbers. For example, if and are finite sets, then the number of elements of is equal to the sum of the element numbers of and . The Cartesian product is distributive over this summation:${\ displaystyle X}$${\ displaystyle Y}$${\ displaystyle X \ sqcup Y}$${\ displaystyle X}$${\ displaystyle Y}$
${\ displaystyle X \ times (Y \ sqcup Z) \ cong (X \ times Y) \ sqcup (X \ times Z)}$
• The construction for vector spaces or Abelian groups , which is analogous from a categorical point of view , is called a direct sum ; in general one speaks of a co-product .
• In mathematics, a telescope sum is a finite sum of differences in which two neighboring terms (apart from the first and the last) cancel each other out.
• The Pythagorean sum is a calculation operation similar to addition, in which the square root is calculated from the sum of the squares of several sizes.