Page 149 - Discrete Mathematics and Its Applications
P. 149

128  2 / Basic Structures: Sets, Functions, Sequences, Sums, and Matrices


                                                TheVenn diagram shown in Figure 2 represents the intersection of two sets A and B. The shaded
                                                area that is within both the circles representing the sets A and B is the area that represents the
                                                intersection of A and B.
                                                    We give some examples of the intersection of sets.
                                 EXAMPLE 3      The intersection of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 3}; that is,
                                                {1, 3, 5}∩{1, 2, 3}={1, 3}.                                                    ▲

                                 EXAMPLE 4      The intersection of the set of all computer science majors at your school and the set of all
                                                mathematics majors is the set of all students who are joint majors in mathematics and computer
                                                science.                                                                       ▲



                              DEFINITION 3       Two sets are called disjoint if their intersection is the empty set.


                                 EXAMPLE 5      Let A ={1, 3, 5, 7, 9} and B ={2, 4, 6, 8, 10}. Because A ∩ B =∅, A and B are disjoint.  ▲

                                                    We are often interested in finding the cardinality of a union of two finite sets A and B. Note
                                                that |A|+|B| counts each element that is in A but not in B or in B but not in A exactly once,
                            Be careful not to
                            overcount!          and each element that is in both A and B exactly twice. Thus, if the number of elements that
                                                are in both A and B is subtracted from |A|+|B|, elements in A ∩ B will be counted only once.
                                                Hence,
                                                    |A ∪ B|=|A|+|B|−|A ∩ B|.

                                                The generalization of this result to unions of an arbitrary number of sets is called the principle
                                                of inclusion–exclusion. The principle of inclusion–exclusion is an important technique used in
                                                enumeration. We will discuss this principle and other counting techniques in detail in Chapters 6
                                                and 8.
                                                    There are other important ways to combine sets.


                              DEFINITION 4       Let A and B be sets. The difference of A and B, denoted by A − B, is the set containing those
                                                 elements that are in A but not in B. The difference of A and B is also called the complement
                                                 of B with respect to A.



                                                Remark: The difference of sets A and B is sometimes denoted by A\B.

                                                An element x belongs to the difference of A and B if and only if x ∈ A and x/∈ B. This tells us
                                                that

                                                    A − B ={x | x ∈ A ∧ x/∈ B}.

                                                The Venn diagram shown in Figure 3 represents the difference of the sets A and B. The shaded
                                                area inside the circle that represents A and outside the circle that represents B is the area that
                                                represents A − B.
                                                    We give some examples of differences of sets.
                                 EXAMPLE 6      The difference of {1, 3, 5} and {1, 2, 3} is the set {5}; that is, {1, 3, 5}−{1, 2, 3}={5}. This
                                                is different from the difference of {1, 2, 3} and {1, 3, 5}, which is the set {2}.  ▲

                                 EXAMPLE 7      The difference of the set of computer science majors at your school and the set of mathematics
                                                majors at your school is the set of all computer science majors at your school who are not also
                                                mathematics majors.                                                            ▲
   144   145   146   147   148   149   150   151   152   153   154