Scribd
Upload
15 views13 pages

Lecture1 Sets

This document discusses set operations and principles of counting finite sets. It introduces inclusion-exclusion principles for determining the size of unions and intersections of finite sets. An example applies these principles to determine the number of students in different categories based on whether they are taking computer science, business or both. It also presents another example using Venn diagrams to categorize mathematics students based on what languages they are studying.

Uploaded by

nasibumanyenye
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views13 pages

Lecture1 Sets

This document discusses set operations and principles of counting finite sets. It introduces inclusion-exclusion principles for determining the size of unions and intersections of finite sets. An example applies these principles to determine the number of students in different categories based on whether they are taking computer science, business or both. It also presents another example using Venn diagrams to categorize mathematics students based on what languages they are studying.

Uploaded by

nasibumanyenye
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 13

1

2
3
4
1.6 SET OPERATIONS

5
6
Fig 1.3

7
ALGEBRA OF SETS, DUALITY

8
Example

9
FINITE SETS, COUNTING PRINCIPLES

A set is said to be finite if it contains exactly m distinct elements where m denotes some nonnegative
integer. Otherwise a set is said to be infinite.

For example, the empty set ∅ and the set of letters of the English alphabet are finite sets, whereas the
set of even positive integers {2, 4, 6 . . .} is infinite.

The notation n(A) or IAI will denote the number of elements in a finite set A.

Inclusion-Exclusion Principle

Suppose A and B are finite sets. Then A n B and A U B are finite, and n (A U B) = n (A) + n (B) - n (A n B)

Similarly

Suppose A, B, C are finite sets. Then A U B U C is finite and

n (A U BU C) = n(A) + n(B) + n(C) - n(A n B) - n(A n C) - n(B n C) + n(A n B n C)

NB For disjoint sets n (AnB)= 0 or AnB=∅

EXAMPLE Consider the following data among 110 students in a college dormitory:

30 students are on a list A (taking Computer science), 35 students are on a list B (taking Business), 20
students are on both lists.

Find the number of students: (a) on list A or B, (b) on exactly one of the two lists, (c) on neither list.

(a) We seek n(A U B).

n(A U B) = n(A) + n(B) - n(A n B) = 30 + 35 - 20 = 45

In other words, we combine the two lists and then cross out the 20 student names which appear twice.

(b) List A contains 30 names and 20 of them are on list B; hence 30 - 20 = 10 names are only on list A.
That is,

n(A\B) = n(A) - n(A U B) = 30 - 20 = 10

Similarly, list B contains 35 names and 20 of them are on list A; hence 35 - 20 = 15 names are only on list
B.

That is,

n(B\A) = n(B) - n(A U B) = 35 - 20 = 15

Thus there are 10 + 15 = 25 students on exactly one of the two lists.

(c) The students on neither the A list nor the B list form the set A Cn Bc . If By DeMorgan's law, Ac n Bc= (A
U B)c.

Hence

n(A C n Bc) = n((A U B)C) = n(U) - n(A U B) = 110 - 45 = 65

10
EXAMPLE 1.7 Consider the following data for 120 mathematics students:

65 study French, 20 study French and German, 45 study German, 25 study French and Russian, 42 study
Russian, 15 study German and Russian, 8 study all three languages

Let F, G, and R denote the sets of students studying French, German, and Russian, respectively.

(a) Find the number of students studying at least one of the three languages, i.e. find n (F U G U R).

(b) Fill in the correct number of students in each of the eight regions of the Venn diagram of Fig. 1-5(a).

(c) Find the number k of students studying: (1) exactly one language, (2) exactly two languages.

fig 1.5 (a)

11
1.10 ARGUMENTS AND VENN DIAGRAMS

12
Try

Introduction to different kinds of structures on sets (e.g. algebra, topology, and


geometry)

13

You might also like