The document defines and provides examples of several set operations:
1) Set union combines elements that are in set A, B, or both. Intersection includes elements only in both sets. Difference includes elements only in the first set.
2) The complement of a set includes all elements not in the original set.
3) The Cartesian product of sets creates ordered pairs of elements, with the first element from the first set and the second from the second set.
The document defines and provides examples of several set operations:
1) Set union combines elements that are in set A, B, or both. Intersection includes elements only in both sets. Difference includes elements only in the first set.
2) The complement of a set includes all elements not in the original set.
3) The Cartesian product of sets creates ordered pairs of elements, with the first element from the first set and the second from the second set.
Set Union, Set Intersection, Set Difference, Complement of Set, and Cartesian Product. The union of sets A and B (denoted by A ∪ B) is the set of elements which are in A, in B, or in both A and B. Hence, A ∪ B = {x | x ∈ A OR x ∈ B}. Example − If A = {10, 11, 12, 13} and B = {13, 14, 15}, then A ∪ B = {10, 11, 12, 13, 14, 15}. (The common element occurs only once) The intersection of sets A and B (denoted by A ∩ B) is the set of elements which are in both A and B. Hence, A ∩ B = {x | x ∈ A AND x ∈ B}. Example − If A = {11, 12, 13} and B = {13, 14, 15}, then A ∩ B = {13}. The set difference of sets A and B (denoted by A − B) is the set of elements which are only in A but not in B. Hence, A − B = {x | x ∈ A AND x ∉ B}. Example − If A = {10, 11, 12, 13} and B = {13, 14, 15}, then (A− B) = {10, 11, 12} and (B − A) = {14, 15}. Here, we can see (A − B) ≠ (B − A) Complement of a Set= (U − A) where U is a universal set which contains all objects. Example − If A = {x | x belongs to set of odd integers} then A' = {y | y does not belong to set of odd integers} The complement of a set A (denoted by A’) is the set of elements which are not in set A. Hence, A' = {x | x ∉ A}. More specifically, A The Cartesian product of n number of sets A1, A2 .....An, defined as A1 × A2 ×..... × An, are the ordered pair (x1, x2,....xn) where x1 ∈ A1, x2 ∈ A2, ...... xn ∈ An Example − If we take two sets A = {a, b} and B = {1, 2}, The Cartesian product of A and B is written as − A × B = {(a, 1), (a, 2), (b, 1), (b, 2)} The Cartesian product of B and A is written as − B × A = {(1, a), (1, b), (2, a), (2, b)}