Data Structures and Algorithms with Object-Oriented Design Patterns in Python
next up previous index

Sets, Multisets, and Partitions

 

In mathematics a set  is a collection of elements, especially a collection having some feature or features in common. The set may have a finite number of elements, e.g., the set of prime numbers less than 100; or it may have an infinite number of elements, e.g., the set of right triangles. The elements  of a set may be anything at all--from simple integers to arbitrarily complex objects. However, all the elements of a set are distinct--a set may contain only one instance of a given element.

For example, tex2html_wrap_inline66491, tex2html_wrap_inline66493, tex2html_wrap_inline66495, and tex2html_wrap_inline66497 are all sets the elements of which are drawn from tex2html_wrap_inline66499. The set of all possible elements, U, is called the universal set . Note also that the elements comprising a given set are not ordered. Thus, tex2html_wrap_inline66503 and tex2html_wrap_inline66505 are the same set.

There are many possible operations on sets. In this chapter we consider the most common operations for combining sets--union, intersection, difference:

union
The union  (or conjunction ) of sets S and T, written tex2html_wrap_inline66511, is the set comprised of all the elements of S together with all the elements of T. Since a set cannot contain duplicates, if the same item is an element of both S and T, only one instance of that item appears in tex2html_wrap_inline66511. If tex2html_wrap_inline66523 and tex2html_wrap_inline66525, then tex2html_wrap_inline66527.
intersection
The intersection  (or disjunction ) of sets S and T is written tex2html_wrap_inline66533. The elements of tex2html_wrap_inline66533 are those items which are elements of both S and T. If tex2html_wrap_inline66523 and tex2html_wrap_inline66525, then tex2html_wrap_inline66545.
difference
The difference  (or subtraction ) of sets S and T, written S-T, contains those elements of S which are not also elements of T. That is, the result S-T is obtained by taking the set S and removing from it those elements which are also found in T. If tex2html_wrap_inline66523 and tex2html_wrap_inline66525, then tex2html_wrap_inline66567.

Figure gif illustrates the basic set operations using a Venn diagram . A Venn diagram represents the membership of sets by regions of the plane. In Figure gif the two sets S and T divide the plane into the four regions labeled I-IV. The following table illustrates the basic set operations by enumerating the regions that comprise each set.

   figure27556
Figure: Venn diagram illustrating the basic set operations.

set region(s) of Figure gif
U I, II, III, IV
S I, II
S' III, IV
T II, III
tex2html_wrap_inline66511 I, II, III
tex2html_wrap_inline66533 II
S-T I
T-S III




next up previous index

Bruno Copyright © 2003, 2004 by Bruno R. Preiss, P.Eng. All rights reserved.