Let \(U=\{1, 2, 3, 4, 5, 6\},\ A=\{2, 3\}\) and \(B=\{3, 4, 5\}\) . Find \(A',B',A'\cap B', A\cup B\) and hence show that \((A\cup B)'=A'\cap B'.\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine you have a box of toys numbered 1 to 6. Set A has toys 2 and 3, and set B has toys 3, 4, and 5. The complement of a set just means all the toys NOT in that set. De Morgan's law says that if you put A and B together, the toys left out are exactly the same as the toys left out of A AND left out of B at the same time. Both ways of checking give you toys 1 and 6, so the law works perfectly.
Answer: \( A' = \{1, 4, 5, 6\} \), \( B' = \{1, 2, 6\} \), \( A' \cap B' = \{1, 6\} \), \( A \cup B = \{2, 3, 4, 5\} \), and \( (A \cup B)' = \{1, 6\} \). Since \( (A \cup B)' = A' \cap B' = \{1, 6\} \), De Morgan's law is verified.
The complement of a set \( A \) with respect to a universal set \( U \) is the set of all elements of \( U \) that are NOT in \( A \). We write it as \( A' = U \setminus A \). The union \( A \cup B \) collects all elements in \( A \) or \( B \) (or both), while the intersection \( A \cap B \) collects only the common elements. One of the important results connecting these ideas is De Morgan's law, which states that the complement of a union equals the intersection of the complements. Verifying it here means computing both sides separately and checking that they give the same set.
\[ A' = U \setminus A \] \[ (A \cup B)' = A' \cap B' \]
\( A' = \{1, 4, 5, 6\} \), \( B' = \{1, 2, 6\} \), \( A' \cap B' = \{1, 6\} \), \( A \cup B = \{2, 3, 4, 5\} \), and \( (A \cup B)' = \{1, 6\} \). Since \( (A \cup B)' = A' \cap B' = \{1, 6\} \), De Morgan's law is verified.
A common mistake is to forget the universal set while taking complements, or to think \( (A \cup B)' = A' \cup B' \). The complement of a union is the intersection (not the union) of the complements.
\( A' = \{1, 4, 5, 6\} \), \( B' = \{1, 2, 6\} \), \( A' \cap B' = \{1, 6\} \), \( A \cup B = \{2, 3, 4, 5\} \), and \( (A \cup B)' = \{1, 6\} \). Since \( (A \cup B)' = A' \cap B' = \{1, 6\} \), De Morgan's law is verified.
One common mistake: students sometimes forget that the complement is always taken with respect to the universal set \( U \), and instead try to find elements 'outside' \( A \) or \( B \) without reference to \( U \), leading to an undefined or incorrect result.
Answer: \( A' = \{1, 4, 5, 6\} \), \( B' = \{1, 2, 6\} \), \( A' \cap B' = \{1, 6\} \), \( A \cup B = \{2, 3, 4, 5\} \), and \( (A \cup B)' = \{1, 6\} \). Since \( (A \cup B)' = A' \cap B' = \{1, 6\} \), De Morgan's law is verified.
Question: Let \( U = \{1, 2, 3, 4, 5, 6, 7, 8\} \), \( A = \{1, 3, 5, 7\} \) and \( B = \{2, 3, 4, 5\} \). Find \( A' \), \( B' \), \( A' \cap B' \), and \( A \cup B \), and hence verify that \( (A \cup B)' = A' \cap B' \).
Solution: Step 1: Find \( A' \). The complement of A contains all elements in U that are not in A. Since \( A = \{1, 3, 5, 7\} \), we get \[ A' = U \setminus A = \{2, 4, 6, 8\}. \] Step 2: Find \( B' \). Since \( B = \{2, 3, 4, 5\} \), we get \[ B' = U \setminus B = \{1, 6, 7, 8\}. \] Step 3: Find \( A' \cap B' \). The intersection contains elements common to both \( A' \) and \( B' \). \( A' = \{2, 4, 6, 8\} \) and \( B' = \{1, 6, 7, 8\} \), so \[ A' \cap B' = \{6, 8\}. \] Step 4: Find \( A \cup B \). \( A \cup B \) contains all elements that belong to A or B or both. \[ A \cup B = \{1, 2, 3, 4, 5, 7\}. \] Step 5: Find \( (A \cup B)' \). \[ (A \cup B)' = U \setminus (A \cup B) = \{6, 8\}. \] Step 6: Compare. We have \( (A \cup B)' = \{6, 8\} \) and \( A' \cap B' = \{6, 8\} \). Since both sides are equal, De Morgan's Law is verified: \[ (A \cup B)' = A' \cap B'. \]
Answer: \( A' = \{2, 4, 6, 8\} \), \( B' = \{1, 6, 7, 8\} \), \( A' \cap B' = \{6, 8\} \), \( A \cup B = \{1, 2, 3, 4, 5, 7\} \), and \( (A \cup B)' = \{6, 8\} = A' \cap B' \). Hence verified.
Question: Let \( U = \{a, b, c, d, e, f, g\} \), \( P = \{a, c, e, g\} \) and \( Q = \{b, c, d, e\} \). Find \( P' \), \( Q' \), \( P \cup Q \), \( (P \cup Q)' \), and \( P' \cap Q' \), and hence verify De Morgan's Law.
Solution: Step 1: Find \( P' \). Elements of U not in P. Since \( P = \{a, c, e, g\} \), \[ P' = \{b, d, f\}. \] Step 2: Find \( Q' \). Elements of U not in Q. Since \( Q = \{b, c, d, e\} \), \[ Q' = \{a, f, g\}. \] Step 3: Find \( P \cup Q \). Union contains all elements in P or Q or both. \[ P \cup Q = \{a, b, c, d, e, g\}. \] Step 4: Find \( (P \cup Q)' \). Elements of U not in \( P \cup Q \). \[ (P \cup Q)' = U \setminus \{a, b, c, d, e, g\} = \{f\}. \] Step 5: Find \( P' \cap Q' \). Elements common to \( P' = \{b, d, f\} \) and \( Q' = \{a, f, g\} \). \[ P' \cap Q' = \{f\}. \] Step 6: Compare. We see \( (P \cup Q)' = \{f\} \) and \( P' \cap Q' = \{f\} \). Both sides are equal, hence \[ (P \cup Q)' = P' \cap Q'. \] De Morgan's Law is verified.
Answer: \( P' = \{b, d, f\} \), \( Q' = \{a, f, g\} \), \( P \cup Q = \{a, b, c, d, e, g\} \), \( (P \cup Q)' = \{f\} \), and \( P' \cap Q' = \{f\} \). Hence \( (P \cup Q)' = P' \cap Q' \) is verified.
Question: Let \( U = \{1, 2, 3, 4, 5, 6, 7, 8\} \), \( A = \{1, 3, 5, 7\} \) and \( B = \{2, 3, 4, 5\} \). Find \( A' \), \( B' \), \( A' \cap B' \), \( A \cup B \), and \( (A \cup B)' \). Hence verify that \( (A \cup B)' = A' \cap B' \).
Answer: \( A' = \{2, 4, 6, 8\} \), \( B' = \{1, 6, 7, 8\} \), \( A' \cap B' = \{6, 8\} \), \( A \cup B = \{1, 2, 3, 4, 5, 7\} \), and \( (A \cup B)' = \{6, 8\} \). Since \( (A \cup B)' = A' \cap B' = \{6, 8\} \), De Morgan's Law is verified.