Summation Notation and Generalizations

We have dealt with relatively straightforward notation so far. However, as situations involving sets become more complex, a more compact notation is needed. Here presented is an introduction to that notation.

1.5 Summation Notation and Generalizations

1.5.1 Sums

Most operations such as addition of numbers are introduced as binary operations. That is, we are taught that two numbers may be added together to give us a single number. Before long, we run into situations where more than two numbers are to be added. For example, if four numbers, a1 , a2 , a3 , and a4 are to be added, their sum may be written down in several ways, such as ((a1 + a2 ) + a3) + a4 or (a1 + a2 ) + (a3 + a4). In the first expression, the first two numbers are added, the result is added to the third number, and that result is added to the fourth number. In the second expression the first two numbers and the last two numbers are added and the results of these additions are added. Of course, we know that the final results will be the same. This is due to the fact that addition of numbers is an associative operation. For such operations, there is no need to describe how more than two objects will be operated on. A sum of numbers such as a1 + a2 + a3 + a4 is called a series and is often written \sum_{k=1}^{4} a_k in what is called summation notation .

We first recall some basic facts about series that you probably have seen before. A more formal treatment of sequences and series is covered in Chapter 8. The purpose here is to give the reader a working knowledge of summation notation and to carry this notation through to intersection and union of sets and other mathematical operations.

A finite series is an expression such as a_1 + a_2 + a_3 + ... + a_n = \sum_{k=1}^{n} a_k. In the expression \sum_{k=1}^{n} a_k :

  • The variable k is referred to as the index , or the index of summation.
  • The expression ak is the general term of the series. It defines the numbers that are being added together in the series.
  • The value of k below the summation symbol is the initial index and the value above the summation symbol is the terminal index.
  • It is understood that the series is a sum of the general terms where the index start with the initial index and increases by one up to and including the terminal index.


Example 1.5.1: Some finite series.

(a) \sum_{i=1}^{4} a_i = a_1 + a_2 + a_3 + a_4

(b) \sum_{k=0}^{5} b_k = b_0 + b_1 + b_2 + b_3 + b_4 + b_5

(a) \sum_{i=-2}^{2} c_i = c_{-2} + c_{-1} + c_0 + c_1 + c_2


Example 1.5.2: More finite series. If the general terms in a series are more specific, the sum can often be simplified. For example,

(a) \sum_{i=1}^{4} i^2 = 1^2 + 2^2 + 3^2 + 4^2 = 30

(b) \sum_{i=1}^{5} (2i-1) = (2 \cdot 1-1) +(2 \cdot 2-1) + (2 \cdot 3-1) + (2 \cdot 4-1) + (2 \cdot 5-1) = 1+3+5+7+9 = 25


1.5.2 Generalizations

Summation notation can be generalized to many mathematical operations, for example, A_1 \cap A_2 \cap A_3 \cap A_4 = \cap_{i=1}^{4}A_i


Definition 1.5.3: Generalized Set Operations. Let A1 , A2 , . . . , An be sets. Then:

(a) A_1 \cap A_2 \cap ... \cap A_n = \cap_{i=1}^{n}A_i

(b) A_1 \cup A_2 \cup ... \cup A_n = \cup_{i=1}^{n}A_i

(c) A_1 \times A_2 \times ... \times A_n = \times_{i=1}^{n}A_i

(d) A_1 \oplus A_2 \oplus ... \oplus A_n = \oplus_{i=1}^{n}A_i


Example 1.5.4: Some generalized operations. If A1 = {0, 2, 3 }, A2 =

{1, 2, 3, 6}, and A3 = {−1, 0, 3, 9}, then

 \cap_{i=1}^{3} A_i = A_1 \cap A_2 \cap A_3 = \left \{ 3 \right \}

and

\cup_{i=1}^{3} A_i = A_1 \cup A_2 \cup A_3 = \left \{ -1, 0, 1, 2, 3, 6, 9 \right \}

With this notation it is quite easy to write lengthy expressions in a fairly compact form. For example, the statement

A ∩ (B1 ∪ B2 ∪ · · · ∪ Bn ) = (A ∩ B1 ) ∪ (A ∩ B2 ) ∪ · · · ∪ (A ∩ Bn)

becomes

A \cap (\cup_{i=1}^{n}B_i) = \cup_{i=1}^{n}(A \cap B_i)


Source: Al Doerr and Ken Levasseur, http://faculty.uml.edu/klevasseur/ads-latex/ads.pdf
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License.
Last modified: Monday, August 10, 2020, 2:32 PM