Scribd
Upload
13 views9 pages

Discrete Mathematics-2

The document discusses different types of sets in discrete mathematics including: 1. Unequal sets which have at least one differing element, overlapping sets which share at least one common element, and disjoint sets which have no common elements. 2. Subsets where all elements of one set are contained within another including proper subsets which are not equal and improper subsets which are equal. 3. Power sets which are the set of all subsets for a given set, including the empty set and the set itself.

Uploaded by

Muhammad Qumar Nazeer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
13 views9 pages

Discrete Mathematics-2

The document discusses different types of sets in discrete mathematics including: 1. Unequal sets which have at least one differing element, overlapping sets which share at least one common element, and disjoint sets which have no common elements. 2. Subsets where all elements of one set are contained within another including proper subsets which are not equal and improper subsets which are equal. 3. Power sets which are the set of all subsets for a given set, including the empty set and the set itself.

Uploaded by

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

Discrete Mathematics (Set Theory)

Type of Sets
• Unequal Sets
If at least any one element of one set differs from the elements of
another set then the two sets are said to be unequal sets.
For Example, if set A = {2, 4, 6, 8} and B = {4, 6, 8, 10}
then set A and B are unequal sets as 2 is present in set A but not in B and
10 is present in set B but not in A.
Hence, one element differs between them thus making them unequal.
However, the cardinal number is the same therefore they are equivalent
sets.

1
Discrete Mathematics (Set Theory)
Type of Sets
• Overlapping Sets
If at least any one element of the two sets are the same then the two
sets are said to be overlapping sets.
For Example, if set A = {1, 2, 3} and set B = {3, 4, 5}
then we see that 3 is the common element between set A and set B
hence, set A and set B are Overlapping Sets.

2
Discrete Mathematics (Set Theory)
Type of Sets
• Disjoint Sets
If none of the elements between two sets are common then they are
called the Disjoint Sets i.e., for two sets A and B if A.
For Example, set A = {1, 2, 3} and set B = {4, 5, 6}
then we observe that there is no common element between set A and
set B hence, set A and B are Disjoint Sets.

3
Discrete Mathematics (Set Theory)
Type of Sets
• Subsets
If A and B are two sets such that every element of set A is present in set
B then A is called the subset of B.
It is represented as A ⊆ B and read as ‘A is a subset of B’.
For Example, if A = {1, 2} and B = {1, 2, 3} then we see that all the
elements of A are present in B, hence A ⊆ B.
There are two kinds of subset Proper Subset and Improper Subset.

4
Discrete Mathematics (Set Theory)
Type of Sets
• Proper Subset
If a subset doesn’t contain all the elements of the set or has fewer
elements than the original set then it is called the proper subset.
For example, in set A = {1, 2} and B = {1, 2, 3},
the subset A doesn’t contain all the elements of the original set B, hence
A is a proper subset of B.
It is represented as A ⊂ B.
Empty set is a proper subset of a given set as it has no elements.

5
Discrete Mathematics (Set Theory)
Type of Sets
• Improper Subset
If a subset contains all the elements that are present in the original set
then it is called an Improper Subset.
For Example, if set A = {1, 2, 3, 4} and set B = {1, 2, 3, 4}
then A is the improper subset of set B. It is mathematically expressed as
A ⊆ B. Thus we deduce that two sets are equal iff A ⊆ B and B ⊆ A.
It should be noted that an empty set is an improper subset of itself.
Every set is a subset of itself
An empty Set is a subset of every set.

6
Discrete Mathematics (Set Theory)
Type of Sets
• Power Set
The power set of a Set A is defined as the set of all subsets of the Set
including the Set itself and the null or empty set.
It is denoted by P(A).
Basically, this set is the combination of all subsets including null set, of a
given set.
The number of possible subsets for a given finite set with ‘n’ number of elements is
equal to 2n.
For Example Set A = { a, b, c } Number of elements: 3
{ } , { a }, { b }, { c }, { a, b }, { b, c }, { c, a }, { a, b, c }
P(A) = { { } , { a }, { b }, { c }, { a, b }, { b, c }, { c, a }, { a, b, c } }
7
Discrete Mathematics (Set Theory)
• Venn Diagram
If A and B are disjoint, i.e., have no elements in common, then the disk
representing A will be separated from the disk representing B, as in
Fig.(b).

8
Discrete Mathematics (Set Theory)
• Relation
Let A and B be sets. A binary relation or, simply, relation from A to B is a
subset of A × B.
Suppose R is a relation from A to B. Then R is a set of ordered pairs
where each first element comes from A and each second element comes from
B. That is, for each pair a ∈ A and b ∈ B, exactly one of the following is true:

If R is a relation from a set A to itself, that is, if R is a subset of A2 = A × A,


then we say that R is a relation on A. The domain of a relation R is the
set of all first elements of the ordered pairs which belong to R, and the
range is the set of second elements.
9

You might also like