Empty sum

In mathematics, an empty sum, or nullary sum[1] is a summation where the number of terms is zero. The natural way to extend non-empty sums[2] is to let the empty sum be the additive identity.

Let ${\displaystyle a_{1}}$, ${\displaystyle a_{2}}$, ${\displaystyle a_{3}}$, ... be a sequence of numbers, and let

${\displaystyle s_{m}=\sum _{i=1}^{m}a_{i}=a_{1}+\ldots +a_{m}}$

be the sum of the first m terms of the sequence. This satisfies the recurrence

${\displaystyle s_{m}=s_{m-1}+a_{m}}$

provided that we use the following natural convention: ${\displaystyle s_{0}=0}$. In other words, a "sum" ${\displaystyle s_{1}}$ with only one term evaluates to that one term, while a "sum" ${\displaystyle s_{0}}$ with no terms evaluates to 0. Allowing a "sum" with only 1 or 0 terms reduces the number of cases to be considered in many mathematical formulas. Such "sums" are natural starting points in induction proofs, as well as in algorithms. For these reasons, the "empty sum is zero" extension is standard practice in mathematics and computer programming (assuming the domain has a zero element). For the same reason, the empty product is taken to be the multiplicative identity.

For sums of other objects (such as vectors, matrices, polynomials), the value of an empty summation is taken to be its additive identity.

Example: empty linear combinations

In linear algebra, a basis of a vector space V is a linearly independent subset B such that every element of V is a linear combination of B. The empty sum convention allows the zero-dimensional vector space V={0} to have a basis, namely the empty set.

See also

• Empty product
• Iterated binary operation
• Empty function

References

1. Harper, Robert (2016). Practical Foundations for Programming Languages. Cambridge University Press. p. 86. ISBN 9781107029576.
2. David M. Bloom (1979). Linear Algebra and Geometry. pp. 45. ISBN 0521293243.