Operations on Sets
-
Upload
angelocarlonpo -
Category
Documents
-
view
215 -
download
2
description
Transcript of Operations on Sets
![Page 1: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/1.jpg)
OPERATIONS ON SETS
BY: ANGELO CARLON
![Page 2: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/2.jpg)
Union
If A and B be two sets, then the union (A U B) is defined as a set of all those elements which are either in A or in B or in both.
Symbolically, A U B={x: x A v x E B}
![Page 3: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/3.jpg)
Ex. Let A = {a, b, c, d, e} B = {a, e, I, o, u} (A U B) = {a, b, c, d, e, I, o, u}
![Page 4: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/4.jpg)
Intersection
If A and B be two sets, then the intersection (A ∩ B) is defined as a set of all those elements which are common to both the sets.
Symbolically, (A∩B) = {x:xA Ʌ xB}
![Page 5: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/5.jpg)
Ex. A = {a, b, c, d, e} B= {a, e, I, o, u} (A ∩ B) = {a, e}
![Page 6: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/6.jpg)
Difference
If A and B be two sets, then the difference (A-B) is defined as a set of all those elements of A which are not in B,
Symbolically, (A-B) = {x | x A and xB}
![Page 7: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/7.jpg)
Example A = {a, b, c, d, e, f} B = {a, c, I, o, u, k} (A-B) = {b, d, e, f}
![Page 8: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/8.jpg)
Symmetric Difference
If A and B be two sets, then the symmetric difference (A∆B) or (A +o B) is defined as a set of all those elements which are either in A or in B but not in both.
Symbolically, (A +o B) = (A-B) U (B-A)
![Page 9: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/9.jpg)
Ex: Let A = {a, b, c, k, p, q, r, s} B= {b, k, q, m, n, o, t} So, (A-B)= {a, c, p, r, s} and (B-A)= {m, n, o, t} Therefore (A +o B) = (A-B) U (B-A) ={a, c, p, r, s, m, n,
o, t}
![Page 10: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/10.jpg)
Complement of a Set
If A be a set, then the complement of A is given as Ac , A’ or A and is defined as a set of all those elements of the universal set U which are not in A
Symbolically, Ac = {x|xU and xA}
__
![Page 11: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/11.jpg)
Ex. A = {b, c, k, d, I, p, q, r, s, t} So, we can take the universeal set U
= {a,b,c, …, x, y, z} Therefore, Ac = U-A ={a, e, f, g, h, j, l,
m, n, o, u, v, w, x, y, z}
![Page 12: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/12.jpg)
Theorem
Commutative laws: (A U B)=((b U A) (A ∩ B)=(B ∩ A)
Associative laws: A U (B U C)= (A U B) U C A ∩ (B ∩ C)=(A ∩ B) ∩ C
Idempotent laws: A U A = A A ∩ A = A
![Page 13: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/13.jpg)
Identity laws: A U φ = A A ∩ U = A
Bound laws: A U U = U A ∩ φ = φ
Absorption laws: A U (A ∩ B) = A A ∩ (A U B) = A
![Page 14: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/14.jpg)
Complement laws: A U Ac = U A ∩ Ac = φ
Involution law: (Ac )c = A
Distributive laws: A ∩ (B U C)=(A ∩ B) U (A ∩ C) A U (B ∩ C)=(A U B) ∩ (A U C)
![Page 15: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/15.jpg)
de Morgan’s Law
(A U B)c =(Ac ∩ Bc ) (A ∩ B)c =(Ac U Bc )
![Page 16: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/16.jpg)
Disjoint Sets
Two sets A and b are called disjoint or non-overlapping if both sets have no common element.
Mathematically, (A ∩ B)= φ Venn Diagram:
![Page 17: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/17.jpg)
Product of Sets
The product of two sets A and B is the set of all those order pairs whose first coordinate is an element of A and the second coordinate is an element of B denoted by (A x B)
Ex. A = {1,2,3,5} B={4,9,25} So, (A x B)={(1,4), (1,9), (1,25),
(2.4), (2,9), (2,25), (3,4), (3,9), (3,25), (5,4), (4,9), (5,25)}
![Page 18: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/18.jpg)
Fundamental Products
Ex. Consider 3 sets a,
B and C. The fundamental products of these three sets are as follows, which are 2^3 in number.
A ∩ B ∩ C A’ ∩ B ∩ C A ∩ B’ ∩ C A ∩ B ∩ C’ A’ ∩ B’ ∩ C A ∩ B’ ∩ C’ A’ ∩ B ∩ C’ A’ ∩ B’ ∩ C’
![Page 19: Operations on Sets](https://reader036.fdocuments.us/reader036/viewer/2022081603/5695d13a1a28ab9b0295a935/html5/thumbnails/19.jpg)
End