CSC 607 - Fuzzy Logic Systems Chapter 1. Classical Set Theory
CSC 607 - Fuzzy Logic Systems Chapter 1. Classical Set Theory
• The classical set (CRISP) is defined in such a way that the Universe of
Discourse is split into 2 groups: members and Nonmembers.
5 CSC 607 - Fuzzy logic Systems
2. Classical set theory
• The classical set is a container that wholly includes or wholly excludes any
given element. For example, the set of days of the week unquestionably
includes Tuesday, Wednesday, and Saturday. It just as unquestionably,
excludes butter, liberty, shoe polish, and so on.
• It was Aristotle who first formulated the law of the Excluded Middle, which says
X must either be in set A or in set not-A, i.e., of any subject, one thing must be
either asserted or denied.
❖ A={2, 4, 6, 8, 10}
❖ A={x l x is the number < 20 }
𝑋𝑖 +1
❖ A={Xi+1= ,𝑖 = 1 𝑡𝑜 10, where 𝑋1 = 1}
5
1 𝑖𝑓 𝑥 ∈ 𝐴
❖ 𝜇𝐴 (𝑥) = ቊ where 𝜇𝐴 (𝑥) is the membership function for set A.
0 𝑖𝑓 𝑥 𝑑𝑜𝑒𝑠 𝑛𝑜𝑡 ∈ 𝐴
b) Set-builder form.
• M={x | x>3}: This last notation means "all real numbers x such that x is
greater than 3." So, for example, 3.1 is in the set M, but 2 is not. The
vertical bar | means "such that".
• Therefore, using the sets defined above M={x | x>3}: −862 ∈ Z, since −862
is an integer, and 2.9∉M, since 2.9 is not greater than 3.
Examples
▪ |{1,4,3,5}| = 4,
▪ |{1,2,3,4,5,…}| = ∞
15 CSC 607 - Fuzzy logic Systems
3. Mathematical representation of a set
• If there are two sets X and Y, |X| = |Y| denotes two sets X and Y having same
cardinality. It occurs when the number of elements in X is exactly equal to the
number of elements in Y. In this case, there exists a bijective function ‘f’ from X
to Y.
• To formulate this notion of size without reference to the natural numbers, one
might declare two finite sets A and B to have the same cardinality if and only if
there exists a bijection A→B. For finite sets, these two definitions are
equivalent. A bijection will exist between A and B only when elements of A can
be paired in one-to-one correspondence with elements of B, which necessarily
requires A and B have the same number of elements.
Two sets A and B are said to have the same cardinality if there exists a
bijection A→B.
16 CSC 607 - Fuzzy logic Systems
3. Mathematical representation of a set
• |X| ≤ |Y| denotes that set X’s cardinality is less than or equal to set Y’s
cardinality. It occurs when the number of elements in X is less than or equal to
that of Y. Here, there exists an injective function ‘f’ from X to Y.
• |X| < |Y| denotes that set X’s cardinality is less than set Y’s cardinality. It occurs
when the number of elements in X is less than that of Y. Here, the function ‘f’
from X to Y is injective function but not bijective.
If |X| ≤ |Y| and |X| ≥|Y| then |X| = |Y|. The sets X and Y are commonly
referred as equivalent sets.
Examples
• S = {x|x ∈ N and 70 > x > 50}.
• A = {x | x is a month in a year}; Set A will have 12 elements.
• B={y | y is the zero of a polynomial (x4 − 6x2 + x + 2)}; Set B will have 4 zeros.
• Definition: If a set X contains elements which are all the elements of set Y as well,
then X is known as the subset of Y.
Examples
• If Y={-9,13,6}, then, Subsets of Y= ϕ, {-9}, {13}, {6}, {-9,13}, {13,6}, {6,-9}, {-9,13,6}
• Let, X = {1, 2, 3} and Y = {1, 2, 3}. Here set Y is a subset (not a proper subset)
of set X as all the elements of set Y is in set X. Hence, we can write Y⊆X.
• The term “proper subset” can be defined as “subset of but not equal to”. A Set X
is a proper subset of set Y (Written as X ⊂ Y) if every element of X is an element
of set Y and |X| < |Y|.
Example
• Let, X = {1, 2, 3, 4, 5, 6} and Y = {1, 2}. Here set Y ⊂ X, since all elements in Y
are contained in X too and X has at least one element, which is more than set Y.
Example
• We may define U as the set of all animals on earth. In this case, a set of all
mammals is a subset of U, a set of all fishes is a subset of U, a set of all
insects is a subset of U, and so on.
✓ P = {x : x is a leap year between 1904 and 1908}. Between 1904 and 1908,
there is no leap year. So, P = Φ. Similarly,
• A Singleton set or Unit set contains only one element. A singleton set is
denoted by {s}.
Example
• If two sets contain the same elements, they are said to be equal.
Example
• If the cardinalities of two sets are same, they are called equivalent sets.
Example
Venn Diagram
29 CSC 607 - Fuzzy logic Systems
4. Types of sets
4.11. Disjoint Set
• Two sets A and B are called disjoint sets if they do not have even one element
in common. Therefore, disjoint sets have the following properties.
✓ n(A∩B)= Φ.
✓ n(A∪B)=n(A)+n(B).
Example
• Let, A = {1, 2, 6} and B = {7, 9, 14}, there is not a single common element,
hence these sets are Disjoint sets.
Exercise 1
Let, the Universe: .
Class Find:
Work #1 1. The cardinal number of X.
2. The power set of X.
3. The cardinality of the power.
Note:
The power set of consists of all possible sets of X.
Exercise 2
Class Let : , ,
2. A∩ (B∩C)= (A∩B) ∩C
1. Introduction
2.1. Union
Assume that we have the two fuzzy sets A and B defined by:
𝐴 = {0.4, 0.3, 0.6, 0.5}
Lab 1 #1 𝐵 = {0.6, 0.6, 0.4, 0.2}
Assume that we have the two fuzzy sets A and B defined by:
𝐴 = {0.4, 0.3, 0.6, 0.5}
Lab 1 #1 𝐵 = {0.6, 0.6, 0.4, 0.2}
Lab 1 #1
Memb(Y)= 1 - Memb(A)
Exercise 3