Академический Документы
Профессиональный Документы
Культура Документы
Definition
SUBSETS
: The set A is a subsets of the set B, denoted A B if
x x A x B
Definition
Definition
Definition
: The void set, the null set, the Empty set denoted is the set with no members.
: If A B but A B denoted A B
: The set of all subset of a set A , denoted P (A), is called the power set of A
For Example: if A = {a,b} then P (A) = {, {a},{b},{a,b}}
Definition
: The Number of (distinct) elements in A denoted |A| is called the cardinality of A.
If the cardinality of a natural number (in N) then the set is called finite, else infinite.
For Example : A = {a,b} |{a,b}| = 2
|P ({a,b})| = 4
A is finite so is P (A)
|A| = n|P(A)| = 2 n
Sets can be both members and subsets of other sets.
For Example : A = {, {}}
A has two elements and four subsets: , {}, {{}}, {, {}}
is both a member of A and subsets of A.
Definition
: Cartesian Product of A with B , denoted A X B, is the set of ordered pairs
{<a,b>|A a b B}
Notation
: X Ai { a1 , a2 , a3 ,....an ai Ai }
i 1
Page 1 of 6
The difference of A and B , or the complement of B relative to A, denoted A-B, is the set
A
is the set { X|
The complement of A is U A
The symmetric difference of A and B, denoted A B is the set (A-B) U (B-A)
For Example : U = {0,1,2,3,4,5,6,7,8,9,10}
A = {1,2,3,4,5},
B = {,5,6,7,8} Then
B=
B=
A=
B=
AB=
B A=
B=
VENN DIAGRAM
A Useful geometric visualization tool (for 3 or less sets).
The universe
Syandra Sari
Page 2 of 6
SET IDENTITIES
Set identities correspond to the logical equivalences.
For Example : The complement of the union s the intersection of the complements.
A B= A B
=========================
Table Identity
Set Identity
=========================
A
A
=A
Identity Laws
=A
=========================
A
Domination Laws
A
============================================
A
A= A
Idempotent Laws
AA=A
============================================
() = A
Complementation Laws
============================================
A
B=B
Commutative Laws
A B = B A
============================================
A
(B
C) = (A
B)
Associative Laws
A (B C) = (A B) C
=============================================
A
(B
C) = (A B)
(B C) = (A
(A C)
B) (A
Distributive Laws
C)
==================================================
AB=
A
De Morgans Laws
B=B
================================================
Syandra Sari
Page 3 of 6
A x B}
={x|x A
x B }
={x|x A B }= A B
Set identities can also proved using membership tables.
For Example : Use a membership table to show that A (B C) = (AB)
TABLE 2.
B C A(B C)
AB AC (AB) (AC)
1
1
1
1
0
0
0
0
1
1
0
0
1
1
0
0
1
0
1
0
1
0
1
0
1
1
1
0
1
1
1
0
1
1
0
0
0
0
0
0
1
1
1
0
1
0
0
0
1
0
1
0
0
0
0
0
1
1
1
0
0
0
0
0
SAME
It is Proven that the identity is valid.
For Example : let A,B,C be sets show that A U ( B I C ) = ( C U B ) A
Solution
: We have
A U ( B I C ) = ( B I C ) by the first
= (B
C ) by the second
= (B
C )
= (C
De Morgans
De Morgans
Syandra Sari
Page 4 of 6
(AC)
A1A2 A3... An =
Ai
i 1
U Ai
i 1
i 1
Ai
Syandra Sari
Page 5 of 6
Syandra Sari
Page 6 of 6