𝑺𝑬𝑻𝑺 𝑨𝑵𝑫 𝑭𝑼𝑵𝑪𝑻𝑰𝑶𝑵𝑺

𝑺𝑬𝑻: 𝐴 𝑤𝑒𝑙𝑙 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑐𝑜𝑙𝑙𝑒𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝑑𝑖𝑠𝑡𝑖𝑛𝑐𝑡 𝑜𝑏𝑗𝑒𝑐𝑡𝑠 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑠𝑒𝑡.

𝑵𝑶𝑻𝑬: 𝐺𝑒𝑜𝑟𝑔𝑒 𝑐𝑎𝑛𝑡𝑜𝑟 𝑔𝑎𝑣𝑒 𝑡ℎ𝑒 𝑐𝑜𝑛𝑐𝑒𝑝𝑡 𝑜𝑓 𝑠𝑒𝑡.
𝑷𝑶𝑰𝑵𝑻𝑺:
 𝑆𝑒𝑡𝑠 𝑎𝑟𝑒 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑏𝑦 𝑐𝑎𝑝𝑖𝑡𝑎𝑙 𝑙𝑒𝑡𝑡𝑒𝑟𝑠 𝑖. 𝑒 𝐴, 𝐵, 𝐶, … 𝑋, 𝑌, 𝑍
 𝑀𝑒𝑚𝑏𝑒𝑟𝑠 𝑜𝑓 𝑠𝑒𝑡 𝑎𝑟𝑒 𝑐𝑎𝑙𝑙𝑒𝑑 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠.
 𝐸𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝑠𝑒𝑡 𝑠ℎ𝑜𝑢𝑙𝑑 𝑏𝑒 𝑤𝑟𝑖𝑡𝑡𝑒𝑛 𝑖𝑛 𝑐𝑢𝑟𝑙𝑦 𝑏𝑟𝑎𝑐𝑘𝑒𝑡𝑠 𝑖. 𝑒 𝐴 = {1,2,3}
 𝐸𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝑠𝑒𝑡 𝑠ℎ𝑜𝑢𝑙𝑑 𝑏𝑒 𝑠𝑒𝑝𝑎𝑟𝑎𝑡𝑒𝑑 𝑏𝑦 𝑐𝑜𝑚𝑚𝑎𝑠 𝑖𝑛 𝑟𝑜𝑠𝑡𝑒𝑟 𝑓𝑜𝑟𝑚 .
 𝑅𝑒𝑝𝑒𝑡𝑖𝑡𝑖𝑜𝑛 𝑜𝑓 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝑠𝑒𝑡 𝑖𝑠 𝑛𝑜𝑡 𝑎𝑙𝑙𝑜𝑤𝑒𝑑 𝑖𝑛 𝑡𝑎𝑏𝑢𝑙𝑎𝑟 𝑓𝑜𝑟𝑚.
𝑴𝑬𝑻𝑯𝑶𝑫𝑺 𝑶𝑭 𝑾𝑹𝑰𝑻𝑰𝑵𝑮 𝑨 𝑺𝑬𝑻:
 𝑇ℎ𝑒𝑟𝑒 𝑎𝑟𝑒 𝑡ℎ𝑟𝑒𝑒 𝑚𝑒𝑡ℎ𝑜𝑑𝑠 𝑜𝑓 𝑤𝑟𝑖𝑡𝑖𝑛𝑔 𝑎 𝑠𝑒𝑡.
i) 𝑫𝒆𝒔𝒄𝒓𝒊𝒑𝒕𝒊𝒗𝒆 𝒇𝒐𝒓𝒎: 𝑊ℎ𝑒𝑛 𝑤𝑒 𝑑𝑒𝑠𝑐𝑟𝑖𝑏𝑒 𝑎 𝑠𝑒𝑡 𝑏𝑦 𝑠𝑡𝑎𝑡𝑒𝑚𝑒𝑛𝑡 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑑𝑒𝑠𝑐𝑟𝑖𝑝𝑡𝑖𝑣𝑒 𝑓𝑜𝑟𝑚
𝐸𝑥: 𝐴 = 𝑆𝑒𝑡 𝑜𝑓 𝑠𝑡𝑢𝑑𝑒𝑛𝑡𝑠 𝑜𝑓 𝑚𝑎𝑡𝑟𝑖𝑐 𝑐𝑙𝑎𝑠𝑠 , 𝐵 = 𝑆𝑒𝑡 𝑜𝑓 𝑛𝑎𝑡𝑢𝑟𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟𝑠 𝑒𝑡𝑐
ii) 𝑻𝒂𝒃𝒖𝒍𝒂𝒓 𝒇𝒐𝒓𝒎: 𝑊ℎ𝑒𝑛 𝑤𝑒 𝑑𝑒𝑠𝑐𝑟𝑖𝑏𝑒 𝑎 𝑠𝑒𝑡 𝑢𝑠𝑖𝑛𝑔 𝑐𝑢𝑟𝑙𝑦 𝑏𝑟𝑎𝑐𝑘𝑒𝑡𝑠 𝑎𝑛𝑑 𝑠𝑒𝑝𝑎𝑟𝑎𝑡𝑖𝑛𝑔 𝑡ℎ𝑒 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑏𝑦 𝑐𝑜𝑚𝑚𝑎𝑠 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑡𝑎𝑏𝑢𝑙𝑎𝑟 𝑓𝑜𝑟𝑚.
𝑬𝒙: 𝐴 = {1,2,3,4} , 𝐵 = {2,4,6,8} 𝑒𝑡𝑐
iii) 𝑺𝒆𝒕 − 𝑩𝒖𝒊𝒍𝒅𝒆𝒓 𝑵𝒐𝒕𝒂𝒕𝒊𝒐𝒏: 𝑊ℎ𝑒𝑛 𝑤𝑒 𝑑𝑒𝑠𝑐𝑟𝑖𝑏𝑒 𝑎 𝑠𝑒𝑡 𝑏𝑦 𝑠𝑦𝑚𝑏𝑜𝑙𝑠 𝑖𝑠 𝑘𝑛𝑜𝑤𝑛 𝑎𝑠 𝑏𝑢𝑖𝑙𝑑𝑒𝑟 𝑛𝑜𝑡𝑎𝑡𝑖𝑜𝑛.
𝑬𝒙 ∶ 𝑋 = {𝑥/𝑥 ∈ 𝐸 ∧ 2 ≤ 𝑥 ≤ 8} , 𝐻 = {𝑟/𝑟 ∈ 𝑃 ∧ 2 < 𝑟 < 13} 𝑒𝑡𝑐
𝑰𝑴𝑷𝑶𝑹𝑻𝑨𝑵𝑻 𝑺𝑬𝑻𝑺
 𝑵𝒂𝒕𝒖𝒓𝒂𝒍 𝒏𝒖𝒎𝒃𝒆𝒓𝒔 ; 𝑵 = {𝟏, 𝟐, 𝟑, 𝟒 … }
 𝑾𝒉𝒐𝒍𝒆 𝒏𝒖𝒎𝒃𝒆𝒓𝒔 ; 𝑾 = {𝟎, 𝟏, 𝟐, 𝟑 … }
 𝑬𝒗𝒆𝒏 𝒏𝒖𝒎𝒃𝒆𝒓𝒔 ; 𝑬 = {𝟐, 𝟒, 𝟔, 𝟖 … }
 𝑶𝒅𝒅 𝒏𝒖𝒎𝒃𝒆𝒓𝒔 ; 𝑶 = {𝟏, 𝟑, 𝟓, 𝟕 … }
 𝑷𝒓𝒊𝒎𝒆 𝒏𝒖𝒎𝒃𝒆𝒓𝒔 ∶ 𝑷 = {𝟐, 𝟑, 𝟓, 𝟕 … }
 𝑪𝒐𝒎𝒑𝒐𝒔𝒊𝒕𝒆 𝒏𝒖𝒎𝒃𝒆𝒓𝒔 ; 𝑪 = {𝟒, 𝟔, 𝟖, 𝟗 … }
 𝑰𝒏𝒕𝒆𝒈𝒆𝒓𝒔 ; 𝒁 = {𝟎, ±𝟏, ±𝟐, ±𝟑, ±𝟒 … }
𝒑
 𝑹𝒂𝒕𝒊𝒐𝒏𝒂𝒍 𝒏𝒖𝒎𝒃𝒆𝒓𝒔; 𝑸 = {𝒙⁄𝒙 = 𝒒 𝒑, 𝒒 ∈ 𝒁 ∧ 𝒒 ≠ 𝟎}
𝒑
 𝑰𝒓𝒓𝒂𝒕𝒊𝒐𝒏𝒂𝒍 𝒏𝒖𝒎𝒃𝒆𝒓𝒔 ; 𝑸’ = {𝒙⁄𝒙 ≠ 𝒒 𝒑, 𝒒 ∈ 𝒁 ∧ 𝒒 ≠ 𝟎}
 𝑹𝒆𝒂𝒍 𝒏𝒖𝒎𝒃𝒆𝒓𝒔 ; 𝑹 = 𝑸 ∪ 𝑸’

MUMTAZ ALI KAHERI (B.S MATHEMATICS QUEST NAWABSHAH) # 0306-3451873

 𝑻𝒀𝑷𝑬𝑺 𝑶𝑭 𝑺𝑬𝑻
 𝑭𝑰𝑵𝑰𝑻𝑬 𝑺𝑬𝑻: 𝐴 𝑠𝑒𝑡 ℎ𝑎𝑣𝑖𝑛𝑔 𝑙𝑖𝑚𝑖𝑡𝑒𝑑 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑓𝑖𝑛𝑖𝑡𝑒 𝑠𝑒𝑡.
𝐸𝑥: 𝐴 = {1,2,3,4,5} , 𝐵 = 𝑆𝑒𝑡𝑠 𝑜𝑓 𝑛𝑎𝑚𝑒𝑠 𝑜𝑓 𝑑𝑎𝑦𝑠 𝑜𝑓 𝑤𝑒𝑒𝑘
 𝑰𝑵𝑭𝑰𝑵𝑰𝑻𝑬 𝑺𝑬𝑻: 𝐴 𝑠𝑒𝑡 ℎ𝑎𝑣𝑖𝑛𝑔 𝑢𝑛𝑙𝑖𝑚𝑖𝑡𝑒𝑑 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑖𝑛𝑓𝑖𝑛𝑖𝑡𝑒 𝑠𝑒𝑡.
𝐸𝑥: 𝐴 = {1,2,3,4 … } , 𝐵 = {2,4,6,8 … }
 𝑵𝑼𝑳𝑳 / 𝑬𝑴𝑷𝑻𝒀/𝑽𝑶𝑰𝑫 𝑺𝑬𝑻: 𝐴 𝑠𝑒𝑡 ℎ𝑎𝑣𝑖𝑛𝑔 𝑛𝑜 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑛𝑢𝑙𝑙 𝑠𝑒𝑡 .
𝐸𝑥: 𝐴 = 𝑆𝑒𝑡 𝑜𝑓 𝑒𝑛𝑔𝑙𝑖𝑠ℎ 𝑎𝑙𝑝ℎ𝑎𝑏𝑒𝑡𝑠 𝑏𝑒𝑓𝑜𝑟𝑒 𝑎 , 𝐵 = {}
 𝐼𝑡 𝑖𝑠 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑏𝑦 { } , ∅
 𝑺𝑰𝑵𝑮𝑳𝑬𝑻𝑶𝑵 𝑺𝑬𝑻: 𝐴 𝑠𝑒𝑡 ℎ𝑎𝑣𝑖𝑛𝑔 𝑜𝑛𝑙𝑦 𝑜𝑛𝑒 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑠𝑖𝑛𝑔𝑙𝑒𝑡𝑜𝑛 𝑠𝑒𝑡.
𝐸𝑥: 𝐵 = {2} , 𝑉 = {∅} , 𝑀 = 𝑆𝑒𝑡 𝑜𝑓 𝑒𝑣𝑒𝑛 𝑝𝑟𝑖𝑚𝑒 𝑛𝑢𝑚𝑏𝑒𝑟𝑠
 𝑬𝑸𝑼𝑨𝑳 𝑺𝑬𝑻𝑺: 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑠𝑎𝑖𝑑 𝑡𝑜 𝑏𝑒 𝑒𝑞𝑢𝑎𝑙 𝑠𝑒𝑡𝑠 𝑖𝑓 𝑏𝑜𝑡ℎ ℎ𝑎𝑣𝑒 𝑠𝑎𝑚𝑒 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 .
𝐸𝑥: 𝐴 = {1,3,5,7} 𝑎𝑛𝑑 𝐵 = {7,5,3,1} 𝑆𝑜 𝐴 = 𝐵
 𝑬𝑸𝑼𝑰𝑽𝑨𝑳𝑬𝑵𝑻 𝑺𝑬𝑻𝑺 ∶ 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑠𝑎𝑖𝑑 𝑡𝑜 𝑏𝑒 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑡 𝑠𝑒𝑡𝑠 𝑖𝑓 𝑏𝑜𝑡ℎ ℎ𝑎𝑣𝑒 𝑠𝑎𝑚𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 .
𝐸𝑥: 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑} , 𝐵 = {1,2,3,4} 𝑠𝑜 𝐴~𝐵
𝑵𝑶𝑻𝑬: 𝐸𝑞𝑢𝑎𝑙 𝑠𝑒𝑡𝑠 𝑎𝑟𝑒 𝑎𝑙𝑤𝑎𝑦𝑠 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑡 𝑏𝑢𝑡 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑡 𝑠𝑒𝑡𝑠 𝑚𝑎𝑦 𝑛𝑜𝑡 𝑏𝑒 𝑒𝑞𝑢𝑎𝑙. 𝑎
 𝑫𝑰𝑺𝑱𝑶𝑰𝑵𝑻 𝑺𝑬𝑻𝑺: 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑠𝑎𝑖𝑑 𝑡𝑜 𝑏𝑒 𝑑𝑖𝑠𝑗𝑜𝑖𝑛𝑡 𝑠𝑒𝑡𝑠 𝑖𝑓 𝑏𝑜𝑡ℎ ℎ𝑎𝑣𝑒 𝑑𝑖𝑠𝑡𝑖𝑛𝑐𝑡 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠.
𝐸𝑥: 𝐴 = {1,2,3,4} , 𝐵 = {5,6,7,8} 𝑆𝑜 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑑𝑖𝑠𝑗𝑜𝑖𝑛𝑡 𝑠𝑒𝑡𝑠
 𝑶𝑽𝑬𝑹𝑳𝑨𝑷𝑷𝑰𝑵𝑮 𝑺𝑬𝑻𝑺: 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑠𝑎𝑖𝑑 𝑡𝑜 𝑏𝑒 𝑜𝑣𝑒𝑟𝑙𝑎𝑝𝑝𝑖𝑛𝑔 𝑠𝑒𝑡𝑠 𝑖𝑓 𝑏𝑜𝑡ℎ ℎ𝑎𝑣𝑒 𝑎𝑡 𝑙𝑒𝑎𝑠𝑡 𝑜𝑛𝑒 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑚𝑢𝑠𝑡 𝑏𝑒 𝑠𝑎𝑚𝑒.
𝐸𝑥: 𝐴 = {2,4,6,8} , 𝐵 = {8,10,12,14} 𝑠𝑜 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑜𝑣𝑒𝑟𝑙𝑎𝑝𝑝𝑖𝑛𝑔 𝑠𝑒𝑡𝑠 .
 𝑺𝑼𝑷𝑬𝑹 𝑺𝑬𝑻: 𝐴 𝑠𝑒𝑡 𝐴 𝑖𝑠 𝑠𝑎𝑖𝑑 𝑡𝑜 𝑏𝑒 𝑠𝑢𝑝𝑒𝑟 𝑠𝑒𝑡 𝑜𝑓 𝑠𝑒𝑡 𝐵 𝑖𝑓 𝑎𝑙𝑙 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝑠𝑒𝑡 𝐵 𝑎𝑟𝑒 𝑡ℎ𝑒 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝑠𝑒𝑡 𝐴 . 𝑖𝑡 𝑖𝑠 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑏𝑦 ⊇
 𝑺𝑼𝑩𝑺𝑬𝑻: 𝐼𝑓 𝐴 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑢𝑝𝑒𝑟 𝑠𝑒𝑡 𝑜𝑓 𝑠𝑒𝑡 𝐵 𝑡ℎ𝑒𝑛 𝐵 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑢𝑏𝑠𝑒𝑡 𝑜𝑓 𝑠𝑒𝑡 𝐴
 𝐼𝑡 𝑖𝑠 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑏𝑦 ⊆
 𝑁𝑢𝑙𝑙 𝑠𝑒𝑡 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑢𝑏𝑠𝑒𝑡 𝑜𝑓 𝑒𝑣𝑒𝑟𝑦 𝑠𝑒𝑡.
 𝐸𝑣𝑒𝑟𝑦 𝑠𝑒𝑡 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑢𝑏𝑠𝑒𝑡 𝑜𝑓 𝑖𝑡𝑠𝑒𝑙𝑓.
 𝐹𝑜𝑟𝑚𝑢𝑙𝑎 𝑓𝑜𝑟 𝑓𝑖𝑛𝑑𝑖𝑛𝑔 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 𝑖𝑠 2𝑛
𝑬𝒙: 𝐴 = {1,2,3,4} , 𝐵 = {1,2,3} 𝑠𝑜 𝐴 ⊇ 𝐵 𝑎𝑛𝑑 𝐵 ⊆ 𝐴
 𝑷𝑹𝑶𝑷𝑬𝑹 𝑺𝑼𝑩𝑺𝑬𝑻: 𝐴 𝑖𝑠 𝑠𝑎𝑖𝑑 𝑡𝑜 𝑏𝑒 𝑝𝑟𝑜𝑝𝑒𝑟 𝑠𝑢𝑏𝑠𝑒𝑡 𝑜𝑓 𝑠𝑒𝑡 𝐵 𝑖𝑓 𝑎𝑙𝑙 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝑠𝑒𝑡 𝐴 𝑏𝑒𝑙𝑜𝑛𝑔𝑠 𝑡𝑜 𝐵
 𝐼𝑡 𝑖𝑠 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑏𝑦 ⊂
𝐸𝑥: 𝐴 = {1,2,3} , 𝐵 = {1,2,3,4,5} 𝑠𝑜 𝐴 ⊂ 𝐵
 𝑰𝑴𝑷𝑹𝑶𝑷𝑬𝑹 𝑺𝑼𝑩𝑺𝑬𝑻: 𝐼𝑓 𝐴 𝑖𝑠 𝑒𝑞𝑢𝑎𝑙 𝑡𝑜 𝐵 𝑡ℎ𝑒𝑛 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑝𝑟𝑜𝑝𝑒𝑟 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 𝑜𝑓 𝑒𝑎𝑐ℎ 𝑜𝑡ℎ𝑒𝑟 .
𝑬𝒙: 𝐴 = {2,3,5} , 𝐵 = {2,3,5} 𝑠𝑜 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑖𝑚𝑝𝑟𝑜𝑝𝑒𝑟 𝑠𝑢𝑏𝑠𝑒𝑡 𝑜𝑓 𝑒𝑎𝑐ℎ 𝑜𝑡ℎ𝑒𝑟.
 𝑷𝑶𝑾𝑬𝑹 𝑺𝑬𝑻: 𝐴 𝑠𝑒𝑡 𝑜𝑓 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 𝑜𝑓 𝑎 𝑠𝑒𝑡 𝑖𝑠 𝑡ℎ𝑒 𝑝𝑜𝑤𝑒𝑟 𝑠𝑒𝑡
𝑃𝑜𝑤𝑒𝑟 𝑠𝑒𝑡 𝑜𝑓 𝑠𝑒𝑡 𝐴 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑎𝑠 ∶ 𝑃(𝐴)

MUMTAZ ALI KAHERI (B.S MATHEMATICS QUEST NAWABSHAH) # 0306-3451873

  𝑼𝑵𝑰𝑽𝑬𝑹𝑺𝑨𝑳 𝑺𝑬𝑻: 𝐴 𝑠𝑒𝑡 𝑖𝑛 𝑤ℎ𝑖𝑐ℎ 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑎𝑟𝑒 𝑢𝑛𝑑𝑒𝑟 𝑐𝑜𝑛𝑠𝑖𝑑𝑒𝑟𝑎𝑡𝑖𝑜𝑛 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑢𝑛𝑖𝑣𝑒𝑟𝑠𝑎𝑙 𝑠𝑒𝑡.
𝐼𝑡 𝑖𝑠 𝑠𝑢𝑝𝑒𝑟 𝑠𝑒𝑡 𝑜𝑓 𝑒𝑣𝑒𝑟𝑦 𝑠𝑒𝑡 , 𝑎𝑛𝑑 𝑎𝑙𝑙 𝑜𝑡ℎ𝑒𝑟 𝑠𝑒𝑡𝑠 𝑎𝑟𝑒 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 𝑜𝑓 𝑢𝑛𝑖𝑣𝑒𝑟𝑠𝑎𝑙 𝑠𝑒𝑡.

 𝑬𝑿𝑯𝑨𝑼𝑺𝑻𝑰𝑽𝑬 𝑺𝑬𝑻𝑺: 𝐼𝑓 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑡ℎ𝑒 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 𝑜𝑓 𝑈 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝐴 ∪ 𝐵 = 𝑈 𝑡ℎ𝑒𝑛 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑒𝑥ℎ𝑎𝑢𝑠𝑡𝑖𝑣𝑒 𝑠𝑒𝑡𝑠 .
 𝑬𝒙𝒂𝒎𝒑𝒍𝒆: 𝐴 = {1,2,3,4} , 𝐵 = {4,5,6,7} 𝑎𝑛𝑑 𝑈 = {1,2,3,4,5,6,7} 𝑡ℎ𝑒𝑛 𝐴 ∪ 𝐵 = {1,2,3,4} ∪ {4,5,6,7} = {1,2,3,4,5,6,7}
 𝑪𝑬𝑳𝑳𝑺: 𝐼𝑓 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑡ℎ𝑒 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 𝑜𝑓 𝑈 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝐴 ∪ 𝐵 = 𝑈 𝑎𝑛𝑑 𝐴 ∩ 𝐵 = ∅ 𝑡ℎ𝑒𝑛 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑐𝑒𝑙𝑙𝑠 .
 𝑬𝒙𝒂𝒎𝒑𝒍𝒆: 𝐴 = {1,2,3,4} , 𝐵 = {5,6,7} 𝑎𝑛𝑑 𝑈 = {1,2,3,4,5,6,7} 𝑡ℎ𝑒𝑛 𝐴 ∪ 𝐵 = {1,2,3,4} ∪ {5,6,7} = {1,2,3,4,5,6,7}
𝐴 ∩ 𝐵 = {1,2,3,4} ∩ {5,6,7} = { }.

𝑶𝑷𝑬𝑹𝑨𝑻𝑰𝑶𝑵𝑺 𝑶𝑵 𝑺𝑬𝑻𝑺

 𝑼𝑵𝑰𝑶𝑵 ∶ 𝑈𝑛𝑖𝑜𝑛 𝑜𝑓 𝑡𝑤𝑜 𝑠𝑒𝑡𝑠 𝐴 𝑎𝑛𝑑 𝐵 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑏𝑦 𝐴⋃𝐵 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑒𝑡 𝑐𝑜𝑛𝑡𝑎𝑖𝑛𝑖𝑛𝑔 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑤ℎ𝑖𝑐ℎ 𝑒𝑖𝑡ℎ𝑒𝑟 𝑏𝑒𝑙𝑜𝑛𝑔 𝑡𝑜 𝐴 𝑜𝑟 𝐵 𝑜𝑟 𝐵𝑜𝑡ℎ.
 𝑩𝒖𝒊𝒍𝒅𝒆𝒓 𝑵𝒐𝒕𝒂𝒕𝒊𝒐𝒏: {𝑥 ∕ 𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵}
 𝑰𝒇 𝑨 = {𝟏, 𝟐, 𝟑} 𝒂𝒏𝒅 𝑩 = {𝟑, 𝟒, 𝟓} 𝒕𝒉𝒆𝒏 𝒇𝒊𝒏𝒅 𝑨𝑼𝑩.
𝑆𝑜𝑙𝑢𝑡𝑖𝑜𝑛
𝐴𝑈𝐵 = {1,2,3}𝑈{3,4,5}
= {1,2,3,4,5}
𝐴𝑈𝐵 = {1,2,3,4,5}
 𝑰𝑵𝑻𝑬𝑹𝑺𝑬𝑪𝑻𝑰𝑶𝑵 ∶ 𝐼𝑛𝑡𝑒𝑟𝑠𝑒𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝑡𝑤𝑜 𝑠𝑒𝑡𝑠 𝐴 𝑎𝑛𝑑 𝐵 𝑤𝑟𝑖𝑡𝑡𝑒𝑛 𝑎𝑠 𝐴 ∩ 𝐵 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑒𝑡 𝑐𝑜𝑛𝑡𝑎𝑖𝑛𝑖𝑛𝑔 𝑎𝑙𝑙 𝑐𝑜𝑚𝑚𝑜𝑛 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝐴 𝑎𝑛𝑑 𝐵 .
 𝑩𝒖𝒊𝒍𝒅𝒆𝒓 𝑵𝒐𝒕𝒂𝒕𝒊𝒐𝒏: {𝑥 ∕ 𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵}
 𝑰𝒇 𝑨 = {𝟏, 𝟐, 𝟑} 𝒂𝒏𝒅 𝑩 = {𝟑, 𝟒, 𝟓} 𝒕𝒉𝒆𝒏 𝒇𝒊𝒏𝒅 𝑨 ∩ 𝑩.
𝑆𝑜𝑙𝑢𝑡𝑖𝑜𝑛
𝐴 ∩ 𝐵 = {1,2,3} ∩ {3,4,5}
= {3}
𝐴 ∩ 𝐵 = {3}
 𝑫𝑰𝑭𝑭𝑬𝑹𝑬𝑵𝑪𝑬: 𝑇ℎ𝑒 𝑑𝑖𝑓𝑓𝑒𝑟𝑒𝑛𝑐𝑒 𝑜𝑓 𝐴 𝑎𝑛𝑑 𝐵 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑏𝑦 𝐴 − 𝐵 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑒𝑡 𝑜𝑓 𝑎𝑙𝑙 𝑡ℎ𝑜𝑠𝑒 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝐴 𝑤ℎ𝑖𝑐ℎ 𝑑𝑜 𝑛𝑜𝑡 𝑏𝑒𝑙𝑜𝑛𝑔 𝑡𝑜 𝐵.
 𝑩𝒖𝒊𝒍𝒅𝒆𝒓 𝒏𝒐𝒕𝒂𝒕𝒊𝒐𝒏: {𝑥 ∕ 𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵}
 𝑰𝒇 𝑨 = {𝟏, 𝟐, 𝟑} 𝒂𝒏𝒅 𝑩 = {𝟑, 𝟒, 𝟓} 𝒕𝒉𝒆𝒏 𝒇𝒊𝒏𝒅 𝑨 − 𝑩.
𝑆𝑜𝑙𝑢𝑡𝑖𝑜𝑛
𝐴 − 𝐵 = {1,2,3} − {3,4,5}
= {1,2}
𝐴 − 𝐵 = {1,2}
 𝑪𝑶𝑴𝑷𝑳𝑬𝑴𝑬𝑵𝑻: 𝐼𝑓 𝑈 𝑖𝑠 𝑡ℎ𝑒 𝑢𝑛𝑖𝑣𝑒𝑟𝑠𝑎𝑙 𝑠𝑒𝑡 𝑎𝑛𝑑 𝐴 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑢𝑏𝑠𝑒𝑡 𝑜𝑓 𝑈 𝑡ℎ𝑒𝑛 𝑡ℎ𝑒 𝑐𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 𝐴 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑒𝑡 𝑜𝑓 𝑡ℎ𝑜𝑠𝑒 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓
MUMTAZ ALI KAHERI (B.S MATHEMATICS QUEST NAWABSHAH) # 0306-3451873
 𝑈 𝑤ℎ𝑖𝑐ℎ 𝑎𝑟𝑒 𝑛𝑜𝑡 𝑐𝑜𝑛𝑡𝑎𝑖𝑛𝑒𝑑 𝑖𝑛 𝐴
 𝐼𝑡 𝑖𝑠 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑎𝑠 𝐴’ 𝑂𝑅 𝐴𝐶
 𝑰𝒇 𝑼 = {𝟏, 𝟐, 𝟑, 𝟒, 𝟓} 𝒂𝒏𝒅 𝑨 = {𝟑, 𝟒, 𝟓} 𝒕𝒉𝒆𝒏 𝒇𝒊𝒏𝒅 𝑨’.
𝑆𝑜𝑙𝑢𝑡𝑖𝑜𝑛
𝐴’ = 𝑈 − 𝐴 = {1,2,3,4,5} − {3,4,5}
= {1,2}
𝐴 ’ = {1,2}
 𝑫𝒆 − 𝑴𝒐𝒓𝒈𝒂𝒏’𝒔 𝑳𝒂𝒘:
 (𝑨 ∪ 𝑩)′ = 𝑨′ ∩ 𝑩′
 (𝑨 ∩ 𝑩)′ = 𝑨′ ∪ 𝑩′
𝑷𝑹𝑶𝑷𝑬𝑹𝑻𝑰𝑬𝑺 𝑶𝑭 𝑼𝑵𝑰𝑶𝑵 𝑨𝑵𝑫 𝑰𝑵𝑻𝑬𝑹𝑺𝑬𝑪𝑻𝑰𝑶𝑵
 𝑪𝒐𝒎𝒎𝒖𝒕𝒂𝒕𝒊𝒗𝒆 𝒑𝒓𝒐𝒑𝒆𝒓𝒕𝒚 𝒘. 𝒓. 𝒕 𝒖𝒏𝒊𝒐𝒏 ∶ 𝐴 ∪ 𝐵 = 𝐵 ∪ 𝐴
 𝑪𝒐𝒎𝒎𝒖𝒕𝒂𝒕𝒊𝒗𝒆 𝒑𝒓𝒐𝒑𝒆𝒓𝒕𝒚 𝒘. 𝒓. 𝒕 𝒊𝒏𝒕𝒆𝒓𝒔𝒆𝒄𝒕𝒊𝒐𝒏: ∶ 𝐴 ∩ 𝐵 = 𝐵 ∩ 𝐴
 𝑨𝒔𝒔𝒐𝒄𝒊𝒂𝒕𝒊𝒗𝒆 𝒑𝒓𝒐𝒑𝒆𝒓𝒕𝒚 𝒘. 𝒓. 𝒕 𝒖𝒏𝒊𝒐𝒏: 𝐴 ∪ (𝐵 ∪ 𝐶) = (𝐴 ∪ 𝐵) ∪ 𝐶
 𝑨𝒔𝒔𝒐𝒄𝒊𝒂𝒕𝒊𝒗𝒆 𝒑𝒓𝒐𝒑𝒆𝒓𝒕𝒚 𝒘. 𝒓. 𝒕 𝑰𝒏𝒕𝒆𝒓𝒔𝒆𝒄𝒕𝒊𝒐𝒏: 𝐴 ∩ (𝐵 ∩ 𝐶) = (𝐴 ∩ 𝐵) ∩ 𝐶
 𝑫𝒊𝒔𝒕𝒓𝒊𝒃𝒖𝒕𝒊𝒗𝒆 𝒑𝒓𝒐𝒑𝒆𝒓𝒕𝒚 𝒘. 𝒓. 𝒕 𝒖𝒏𝒊𝒐𝒏 𝒐𝒗𝒆𝒓 𝒊𝒏𝒕𝒆𝒓𝒔𝒆𝒄𝒕𝒊𝒐𝒏: 𝑨 ∪ (𝑩 ∩ 𝑪) = (𝑨 ∪ 𝑩) ∩ (𝑨 ∪ 𝑪)
 𝑫𝒊𝒔𝒕𝒓𝒊𝒃𝒖𝒕𝒊𝒗𝒆 𝒑𝒓𝒐𝒑𝒆𝒓𝒕𝒚 𝒘. 𝒓. 𝒕 𝑰𝒏𝒕𝒆𝒓𝒔𝒆𝒄𝒕𝒊𝒐𝒏 𝒐𝒗𝒆𝒓 𝒖𝒏𝒊𝒐𝒏: 𝑨 ∩ (𝑩 ∪ 𝑪) = (𝑨 ∩ 𝑩) ∪ (𝑨 ∩ 𝑪)

𝑵𝑶𝑻𝑬:

 𝐴∪∅ =𝐴 ∅ 𝑖𝑠 𝑡ℎ𝑒 𝑖𝑑𝑒𝑛𝑡𝑖𝑡𝑦 𝑤. 𝑟. 𝑡 𝑢𝑛𝑖𝑜𝑛 ,

 𝐴∩𝑈 =𝐴 𝑈 𝑖𝑠 𝑡ℎ𝑒 𝑖𝑑𝑒𝑛𝑡𝑖𝑡𝑦 𝑤. 𝑟. 𝑡 𝑖𝑛𝑡𝑒𝑟𝑠𝑒𝑐𝑡𝑖𝑜𝑛
 𝐴 ∪ 𝑈 = 𝑈 𝑎𝑛𝑑 𝐴 ∩ ∅ = ∅ 𝐷𝑜𝑚𝑖𝑛𝑎𝑡𝑖𝑜𝑛 𝑙𝑎𝑤𝑠
 𝐴 ∪ 𝐴 = 𝐴 𝑎𝑛𝑑 𝐴 ∩ 𝐴 = 𝐴 𝐼𝑑𝑒𝑚𝑝𝑜𝑡𝑒𝑛𝑡 𝑙𝑎𝑤𝑠
 𝐴 ∪ (𝐴 ∩ 𝐵) = 𝐴 𝑎𝑛𝑑 𝐴 ∩ (𝐴 ∪ 𝐵) = 𝐴 𝐴𝑏𝑠𝑜𝑟𝑝𝑡𝑖𝑜𝑛 𝑙𝑎𝑤𝑠
 (𝐴′ )′ = 𝐴 𝐷𝑜𝑢𝑏𝑙𝑒 𝑐𝑜𝑚𝑝𝑙𝑖𝑚𝑒𝑛𝑡 𝑙𝑎𝑤
 𝑖𝑓 𝐴 ⊂ 𝐵 𝑡ℎ𝑒𝑛 𝐴 ∪ 𝐵 = 𝐵 , 𝐴 ∩ 𝐵 = 𝐴 , 𝐴 − 𝐵 = ∅
 𝐼𝑓 𝐴 ⊆ 𝐵 𝑡ℎ𝑒𝑛 𝐵′ ⊆ 𝐴′
 𝑽𝒆𝒏𝒏 𝑫𝒊𝒂𝒈𝒓𝒂𝒎: 𝐺𝑟𝑎𝑝ℎ𝑖𝑐𝑎𝑙 𝑟𝑒𝑝𝑟𝑒𝑠𝑒𝑛𝑡𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 𝑜𝑝𝑒𝑟𝑎𝑡𝑖𝑜𝑛𝑠 𝑜𝑓 𝑠𝑒𝑡𝑠 𝑡ℎ𝑟𝑜𝑢𝑔ℎ 𝑟𝑒𝑐𝑡𝑎𝑛𝑔𝑢𝑙𝑎𝑟 𝑠ℎ𝑎𝑝𝑒𝑑 𝑎𝑟𝑟𝑎𝑦 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑣𝑒𝑛𝑛 𝑑𝑖𝑎𝑔𝑟𝑎𝑚 .
 𝐵𝑟𝑖𝑡𝑖𝑠ℎ 𝑚𝑎𝑡ℎ𝑒𝑚𝑎𝑡𝑖𝑐𝑖𝑎𝑛𝑠 𝑗𝑜ℎ𝑛 𝑣𝑒𝑛𝑛 (1834 − 1923) 𝑖𝑛𝑡𝑟𝑜𝑑𝑢𝑐𝑒 𝑟𝑒𝑐𝑡𝑎𝑛𝑔𝑙𝑒 𝑓𝑜𝑟 𝑢𝑛𝑖𝑣𝑒𝑟𝑠𝑎𝑙 𝑠𝑒𝑡 𝑈 𝑎𝑛𝑑 𝑖𝑡𝑠 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑠 𝑐𝑙𝑜𝑠𝑒𝑑 𝑓𝑖𝑔𝑢𝑟𝑒 𝑖𝑛𝑠𝑖𝑑𝑒 𝑟𝑒𝑐𝑡𝑎𝑛𝑔𝑙𝑒.

MUMTAZ ALI KAHERI (B.S MATHEMATICS QUEST NAWABSHAH) # 0306-3451873

  CASE-I: If A is the subset of set B (𝑨 ⊆ 𝑩):

U
B
A

 CASE-II: If A and B are overlapping sets then:

A B

 CASE-III: If A and B are two disjoint sets

A B

 𝑶𝒓𝒅𝒆𝒓𝒆𝒅 𝒑𝒂𝒊𝒓: 𝐴𝑛𝑦 𝑡𝑤𝑜 𝑛𝑢𝑚𝑏𝑒𝑟𝑠 𝑎 𝑎𝑛𝑑 𝑏 , 𝑤𝑟𝑖𝑡𝑡𝑒𝑛 𝑖𝑛 𝑡ℎ𝑒 𝑓𝑜𝑟𝑚 (𝑎, 𝑏) 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑡ℎ𝑒 𝑜𝑟𝑑𝑒𝑟𝑒𝑑 𝑝𝑎𝑖𝑟 ,
 𝐼𝑛 𝑜𝑟𝑑𝑒𝑟𝑒𝑑 𝑝𝑎𝑖𝑟 "𝑎" 𝑖𝑠 𝑡ℎ𝑒 𝑓𝑖𝑟𝑠𝑡 𝑐𝑜𝑚𝑝𝑜𝑛𝑒𝑛𝑡 𝑎𝑛𝑑 "𝑏" 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑒𝑐𝑜𝑛𝑑 𝑐𝑜𝑚𝑝𝑜𝑛𝑒𝑛𝑡.
 "𝑎" 𝑖𝑠 𝑎𝑙𝑠𝑜 𝑐𝑎𝑙𝑙𝑒𝑑 𝑎𝑏𝑠𝑠𝑖𝑐𝑎 𝑎𝑛𝑑 𝑤ℎ𝑒𝑟𝑒 "𝑏" 𝑖𝑠 𝑜𝑟𝑑𝑖𝑛𝑎𝑡𝑒 𝑠𝑜 𝑏𝑜𝑡ℎ 𝑎𝑟𝑒 𝑐𝑜𝑜𝑟𝑑𝑖𝑛𝑎𝑡𝑒𝑠.
 𝐼𝑛 𝑎𝑛 𝑜𝑟𝑑𝑒𝑟𝑒𝑑 𝑠𝑒𝑡 𝑜𝑟𝑑𝑒𝑟 𝑖𝑠 𝑖𝑚𝑝𝑜𝑟𝑡𝑎𝑛𝑡 𝑠𝑜, (𝑎, 𝑏) ≠ (𝑏, 𝑎) 𝑢𝑛𝑙𝑒𝑠𝑠 𝑎 = 𝑏.
 (𝑎, 𝑏) = (𝑐, 𝑑) 𝑖𝑓𝑓 𝑎 = 𝑐 𝑎𝑛𝑑 𝑏 = 𝑑.
 Cartesian product: 𝐿𝑒𝑡 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑡𝑤𝑜 𝑛𝑜𝑛 − 𝑒𝑚𝑡𝑦 𝑠𝑒𝑡𝑠 𝑠𝑜 𝑡ℎ𝑒 𝐶𝑎𝑟𝑡𝑒𝑠𝑖𝑎𝑛 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 𝑜𝑓 𝐴 𝑎𝑛𝑑 𝐵 𝑖𝑠 𝑡ℎ𝑒 𝑎𝑙𝑙 𝑜𝑟𝑑𝑒𝑟𝑒𝑑 𝑝𝑎𝑖𝑟𝑠 (𝑎, 𝑏) 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑎 ∈ 𝐴 𝑎𝑛𝑑 𝑏 ∈ 𝐵.
 𝐼𝑡 𝑖𝑠 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑎𝑠 𝐴 × 𝐵
 𝐵𝑢𝑖𝑙𝑑𝑒𝑟 𝑁𝑜𝑡𝑎𝑡𝑖𝑜𝑛: 𝐴 × 𝐵 = {(𝑎, 𝑏)⁄𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵}
 𝐴 × 𝐵 ≠ 𝐵 × 𝐴 𝑈𝑛𝑙𝑒𝑠𝑠 𝐴 = 𝐵.
 𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑜𝑟𝑒𝑑𝑒𝑟𝑑 𝑝𝑎𝑖𝑟𝑠 𝑖𝑛 𝐴 × 𝐵 𝑤𝑖𝑙𝑙 𝑏𝑒 𝑂(𝐴) × 𝑂(𝐵).
 𝐼𝑓 𝐴 = {1,2} 𝑎𝑛𝑑 𝐵 = {3,4} 𝑡ℎ𝑒𝑛 𝑓𝑖𝑛𝑑 𝐴 × 𝐵

MUMTAZ ALI KAHERI (B.S MATHEMATICS QUEST NAWABSHAH) # 0306-3451873

  𝐴 × 𝐵 = {1,2} × {3,4}
 = {(1,3), (1,4), (2,3), (2,4)}
 𝐴 × 𝐵 = {(1,3), (1,4), (2,3), (2,4)}
 Binary Relation: 𝐵𝑖𝑛𝑎𝑟𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑢𝑏𝑠𝑒𝑡 𝑜𝑓 𝐶𝑎𝑟𝑡𝑒𝑠𝑖𝑎𝑛 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 𝑜𝑓 𝑡𝑤𝑜 𝑠𝑒𝑡𝑠.
 𝐼𝑡 𝑖𝑠 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑏𝑦 𝑅 .
 𝐼𝑓 𝐴 𝑎𝑛𝑑 𝐵 𝑎𝑟𝑒 𝑡𝑤𝑜 𝑛𝑜𝑛 − 𝑒𝑚𝑝𝑡𝑦 𝑠𝑒𝑡𝑠 𝑠𝑜 𝑅 ⊆ 𝐴 × 𝐵.
 2𝑂(𝐴)×𝑂(𝐵) 𝑤𝑖𝑙𝑙 𝑏𝑒 𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑏𝑖𝑛𝑎𝑟𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛𝑠 𝑜𝑓 𝐴 × 𝐵.
 𝐼𝑛 𝑜𝑡ℎ𝑒𝑟 𝑤𝑎𝑦 𝑖𝑓 𝑂(𝐴) = 𝑛 𝑎𝑛𝑑 𝑂(𝐵) = 𝑚 𝑡ℎ𝑒𝑛 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑏𝑖𝑛𝑎𝑟𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛𝑠 𝑤𝑖𝑙𝑙 𝑏𝑒 2𝑛𝑚
 𝐼𝑓 𝐴 = {2,3} 𝑎𝑛𝑑 𝐵 = {4} 𝑡ℎ𝑒𝑛 𝑓𝑖𝑛𝑑 𝑡ℎ𝑒 𝑏𝑖𝑛𝑎𝑟𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛𝑠 𝑜𝑓 𝑨 × 𝑩.
 𝑺𝒐𝒍𝒖𝒕𝒊𝒐𝒏
 𝑨 × 𝑩 = {𝟐, 𝟑} × {𝟒}
 = {(2,4), (3,4)}
𝑂(𝐴)×𝑂(𝐵)
 𝑆𝑜 2 = 22×1 = 22 = 2 × 2 = 4
 𝑅1 = { } , 𝑅2 = {(2,4)} , 𝑅3 = {(3,4)} , 𝑅4 = {(2,4), (3,4)}
 Domain: 𝑠𝑒𝑡 𝑜𝑓 𝑓𝑖𝑟𝑠𝑡 𝑐𝑜𝑚𝑝𝑜𝑛𝑒𝑛𝑡 𝑜𝑓 𝑎 𝑏𝑖𝑛𝑎𝑟𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑖𝑠 𝑡ℎ𝑒 𝑑𝑜𝑚𝑎𝑖𝑛.
 𝐼𝑡 𝑖𝑠 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑎𝑠 ∶ 𝐷𝑜𝑚𝑅 𝑂𝑟 𝐷𝑅
 𝑆𝑜 𝐷𝑜𝑚𝑅4 = {2,3}
 Co-Domain or Range: 𝑆𝑒𝑡 𝑜𝑓 𝑠𝑒𝑐𝑜𝑛𝑑 𝑐𝑜𝑚𝑝𝑜𝑛𝑒𝑛𝑡𝑠 𝑜𝑓 𝑎 𝑏𝑖𝑛𝑎𝑟𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑖𝑠 𝑡ℎ𝑒 𝑐𝑜 − 𝑑𝑜𝑚𝑎𝑖𝑛.
 𝐼𝑡 𝑖𝑠 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑎𝑠: 𝐶𝑜 − 𝐷𝑜𝑚𝑅 𝑂𝑅 𝑅𝑎𝑛𝑔𝑅.
 𝑆𝑜 𝑅𝑎𝑛𝑔 𝑅4 = {4}
 FUNCTION: 𝑙𝑒𝑡 𝐴 𝑎𝑛𝑑 𝐵 𝑏𝑒 𝑎𝑛𝑦 𝑡𝑤𝑜 𝑠𝑒𝑡𝑠 𝑎𝑛𝑑 𝑅 𝑏𝑒 𝑎 𝑏𝑖𝑛𝑎𝑟𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 , 𝑇ℎ𝑒𝑛 𝑅 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑡ℎ𝑒 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝐼𝑓;
o 𝐷𝑜𝑚 𝑅 = 𝐴
o 𝐸𝑣𝑒𝑟𝑦 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 𝐴 𝑖𝑠 𝑎𝑠𝑠𝑜𝑐𝑖𝑎𝑡𝑒𝑑 𝑤𝑖𝑡ℎ 𝑜𝑛𝑙𝑦 𝑜𝑛𝑒 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 𝐵.
 𝐹𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑐𝑎𝑛 𝑏𝑒 𝑑𝑒𝑛𝑜𝑡𝑒𝑑 𝑏𝑦 𝑓 𝑜𝑟 𝑔 𝑜𝑟 ℎ
 𝐹𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝑟𝑒𝑝𝑟𝑒𝑠𝑒𝑛𝑡𝑒𝑑 𝑎𝑠 𝑓: 𝐴 → 𝐵

𝑁𝑂𝑇𝐸: 𝐸𝑣𝑒𝑟𝑦 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑖𝑠 𝑎 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑏𝑢𝑡 𝑒𝑣𝑒𝑟𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑚𝑎𝑦 𝑛𝑜𝑡 𝑏𝑒 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛.

TYPES OF FUNCTION

 ONE-ONE FUNCTION(Injective): 𝐴 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝑖𝑠 𝑠𝑎𝑖𝑑 𝑡𝑜 𝑏𝑒 𝑜𝑛𝑒 − 𝑜𝑛𝑒 𝑖𝑓 𝑑𝑖𝑠𝑡𝑖𝑛𝑐𝑡 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝐴 𝑎𝑟𝑒 𝑎𝑠𝑠𝑜𝑐𝑖𝑎𝑡𝑒𝑑 𝑤𝑖𝑡ℎ 𝑑𝑖𝑠𝑡𝑖𝑛𝑐𝑡 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝐵 .
 𝐼𝑓 𝐴 = {1,2,3} 𝑎𝑛𝑑 𝐵 = {4,5,6} 𝑡ℎ𝑒𝑛 𝑎 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝑖𝑠 𝑑𝑒𝑓𝑖𝑛𝑑: 𝑓: 𝐴 → 𝐵.

MUMTAZ ALI KAHERI (B.S MATHEMATICS QUEST NAWABSHAH) # 0306-3451873

 𝑓 = {(1,4), (2,5), (3,6)}
 By Mapping:

1 4
2 5
2 6

 ONTO FUNCTION(Surjective): 𝐴 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝑖𝑠 𝑠𝑎𝑖𝑑 𝑡𝑜 𝑏𝑒 𝑜𝑛𝑡𝑜 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑖𝑓 𝑅𝑎𝑛𝑔𝑓 = 𝐵.

 𝐼𝑓 𝐴 = {1,2,3,4} 𝑎𝑛𝑑 𝐵 = {4,5,6} 𝑡ℎ𝑒𝑛 𝑎 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝑖𝑠 𝑑𝑒𝑓𝑖𝑛𝑑: 𝑓: 𝐴 → 𝐵.
𝑓 = {(1,4), (2,5), (3,6), (4,6)}
𝑩𝒚 𝒎𝒂𝒑𝒑𝒊𝒏𝒈: 𝒕𝒉𝒆 𝑹𝒂𝒏𝒈𝒇 = 𝑩

1 4
2 5
3 6
4
 ONE-ONE AND ONTO FUNCTION(Bijective): 𝐴 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝑠𝑒𝑡 𝐴 𝑡𝑜 𝐵 𝑖𝑠 𝑠𝑎𝑖𝑑 𝑡𝑜 𝑏𝑒 𝑜𝑛𝑒 − 𝑜𝑛𝑒 𝑎𝑛𝑑 𝑜𝑛𝑡𝑜 𝑖𝑓 𝑖𝑡 𝑖𝑠 𝑏𝑜𝑡ℎ 𝑜𝑛𝑒 – 𝑜𝑛𝑒 𝑎𝑛𝑑 𝑜𝑛𝑡𝑜.
 𝐼𝑓 𝐴 = {1,2,3} 𝑎𝑛𝑑 𝐵 = {4,5,6} 𝑡ℎ𝑒𝑛 𝑎 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝑖𝑠 𝑑𝑒𝑓𝑖𝑛𝑑: 𝑓: 𝐴 → 𝐵.
𝑓 = {(1,4), (2,5), (3,6)}
By mapping: Rang𝒇 = 𝑩

1 4
2 5
3 6

 INTO FUNCTION: 𝐴 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝑖𝑠 𝑠𝑎𝑖𝑑 𝑡𝑜 𝑏𝑒 𝑖𝑛𝑡𝑜 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑖𝑓 𝑅𝑎𝑛𝑔 𝑓 ⊆ 𝐵.

 𝐼𝑓 𝐴 = {1,2,3} 𝑎𝑛𝑑 𝐵 = {4,5} 𝑡ℎ𝑒𝑛 𝑎 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝑖𝑠 𝑑𝑒𝑓𝑖𝑛𝑑: 𝑓: 𝐴 → 𝐵.
𝑓 = {(1,4), (2,5), (3,5)}
𝑩𝒚 𝑴𝒂𝒑𝒑𝒊𝒏𝒈: 𝑅𝑎𝑛𝑔 𝑓 ⊆ 𝐵.

MUMTAZ ALI KAHERI (B.S MATHEMATICS QUEST NAWABSHAH) # 0306-3451873