Lecture 1 - Introduction - Sets
Lecture 1 - Introduction - Sets
http://www.thefreedictionary.com/statistics
(i) ∅ ⊆ S and
(ii) S ⊆ S
ഥ = {b, c, d, j, g, h , j, k, I , m , n , p , q , r, S , t , v , w , x
𝐀
, y , z} .
A ∪ 𝑩 𝒊𝒔 𝒔𝒉𝒂𝒅𝒆𝒅 A ∩ 𝑩 𝒊𝒔 𝒔𝒉𝒂𝒅𝒆𝒅
A ∖ B 𝒊𝒔 𝒔𝒉𝒂𝒅𝒆𝒅 𝑨𝒄 𝒊𝒔 𝒔𝒉𝒂𝒅𝒆𝒅
Dr. Faisal Bukhari, PUCIT, PU, Lahore 32
De Morgan’s law
I. (A U B)𝐂 = 𝐀𝐜 ∩ 𝐁 𝐜
II. (A ∩ B)𝐂 = 𝐀𝐜 U 𝐁𝐜
𝐁𝐜 = U – B
= {1, 3, 5, 7, 9, 2, 6, 4, 8, 10} - {2, 5, 4, 8, 10}
= {1, 3, 6, 7, 9}
RHS = LHS
Hence,
P ({0, 1 , 2 }) = {{∅}, {0}, {1}, {2 }, {0, 1}, {0, 2}, { 1 , 2},
{0, 1 , 2}} .
The set {∅} has exactly two subsets, namely, ∅ and the
set {∅} itself. Therefore,
P ({∅}) = {∅, {∅}}
Note:
No of elements in a power set: If a set has n elements,
then its power set has 2n elements.
Solution:
The Cartesian product A × B is
A x B = {( 1 , a), ( 1 , b) , ( 1 , c), (2, a), (2, b) , (2, c)} .
R = {(a , 0), (a , 1 ), (a , 3), (b, 1 ), (b, 2), (c, 0), (c, 3)} is
a relation from the set {a , b , c} to the set to
{ 1 , 2, 3 }