\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Lists
Natural Sums
Family Operations
Needed by:
Multisets
Natural Number Notation
Real Summation
Links:
Sheet PDF
Graph PDF
Wikipedia

Natural Summation

Why

We want a notation for expressing the sum of several natural numbers.

Definition

Let $s = (m_1, \dots , m_n)$ be a sequence of natural numbers. The sequence sum of $s$ is the result of first summing the first two numbers, then summing the result with the third number, and so on, until we have summed all the numbers

Notation

We denote the sum of a sequence using by using the $\sum$ symbol. $\sum$ is the capital greek letter “sigma” and is a mnemonic for “sum.”

Let $(m_1, \dots , m_n)$ be a sequence of natural numbers. Let us denote by $m_i$ an element of the sequence, where $i = 1, \dots , n$.

We denote that the sum ranges over an (ordered) index set $\set{1, \dots , n}$ by writing $\sum_{i = 1}^{n}$. We denote the sequence sum

\[ \sum_{i = 1}^{n} m_i. \]

Summing over finite sets

Suppose $A$ is a finite set and $f: A \to \N $ is a function. Then we the notation

\[ \sum_{a \in A} f(a) \]

is notation for $\sum_{i = 1}^{n} f(\sigma (i))$ where $\sigma : \set{1, \dots , \num{A}} \to A$ is any numbering of $A$. The numbering is inconsequential because addition is commutative.

Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view