Using properties of sets, show that \( A \cup ( A \cap B ) =A\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine you have a bag of your favourite toys. Now someone hands you a smaller bag that only contains some of those same toys. Adding those toys to your big bag changes nothing — you already had them! That is exactly what this rule says. The set \( A \cap B \) is just a smaller collection taken from inside \( A \). Joining it back to \( A \) gives you \( A \) again. Nothing new enters the picture.
Answer: Combining all steps: \[ A \cup (A \cap B) = (A \cap U) \cup (A \cap B) = A \cap (U \cup B) = A \cap U = A. \] Hence \( A \cup (A \cap B) = A \), which is proved.
This identity is one of the two Absorption Laws in set theory. It says that when you take the union of a set \( A \) with a smaller part of itself \( (A \cap B) \), you get nothing new — you just get \( A \) back. This makes intuitive sense: \( A \cap B \) is the overlap between \( A \) and \( B \), so it is always a subset of \( A \). Adding a subset of \( A \) back to \( A \) through union cannot make it bigger. To prove it formally, we use standard properties like the Distributive Law, the fact that \( A = A \cap U \) (where \( U \) is the universal set), and the Identity Law.
Distributive Law: \( A \cup (B \cap C) = (A \cup B) \cap (A \cup C) \); Identity Laws: \( A \cap U = A \) and \( A \cup A = A \)
Combining all steps: \[ A \cup (A \cap B) = (A \cap U) \cup (A \cap B) = A \cap (U \cup B) = A \cap U = A. \] Hence \( A \cup (A \cap B) = A \), which is proved.
A common mistake is trying to 'cancel' \( A \) or wrongly writing \( A \cup (A \cap B) = A \cup B \). Remember \( A \cap B \subseteq A \), so its union with \( A \) adds nothing; it does not bring in the extra elements of \( B \).
Combining all steps: \[ A \cup (A \cap B) = (A \cap U) \cup (A \cap B) = A \cap (U \cup B) = A \cap U = A. \] Hence \( A \cup (A \cap B) = A \), which is proved.
One common mistake: Students often try to prove this by checking individual elements without linking the steps through recognised laws. Instead, each equality must be justified by a named set-theory law (Identity Law, Distributive Law, Domination Law), otherwise the proof is incomplete.
Answer: Combining all steps: \[ A \cup (A \cap B) = (A \cap U) \cup (A \cap B) = A \cap (U \cup B) = A \cap U = A. \] Hence \( A \cup (A \cap B) = A \), which is proved.
Question: Using properties of sets, show that \( A \cap (A \cup B) = A \).
Solution: We need to show that \( A \cap (A \cup B) = A \). We will use set identities to simplify the left-hand side (LHS) step by step. Step 1: Write the LHS. \[ A \cap (A \cup B) \] Step 2: Apply the Distributive Law, which states \( A \cap (A \cup B) = (A \cap A) \cup (A \cap B) \). \[ = (A \cap A) \cup (A \cap B) \] Step 3: Use the Idempotent Law \( A \cap A = A \). \[ = A \cup (A \cap B) \] Step 4: Now observe that \( A \cap B \subseteq A \) always (since the intersection of A with any set is contained in A). Therefore, every element of \( A \cap B \) is already in A. Formally, use the fact that for any set X, if \( X \subseteq A \), then \( A \cup X = A \). Since \( A \cap B \subseteq A \): \[ A \cup (A \cap B) = A \] Step 5: Alternatively, verify directly: if \( x \in A \cup (A \cap B) \), then \( x \in A \) or \( x \in A \cap B \). If \( x \in A \cap B \), then certainly \( x \in A \). So in either case, \( x \in A \), giving \( A \cup (A \cap B) \subseteq A \). Conversely, if \( x \in A \), then \( x \in A \cup (A \cap B) \), so \( A \subseteq A \cup (A \cap B) \). Hence: \[ A \cup (A \cap B) = A \] Therefore: \[ A \cap (A \cup B) = A \]
Answer: \( A \cap (A \cup B) = A \) is proved using the Distributive Law, Idempotent Law, and the fact that \( A \cap B \subseteq A \).
Question: Using properties of sets, show that \( (A \cup B) \cap (A \cup B') = A \), where \( B' \) denotes the complement of B.
Solution: We need to show that \( (A \cup B) \cap (A \cup B') = A \). We will simplify the left-hand side (LHS) using standard set identities. Step 1: Write the LHS. \[ (A \cup B) \cap (A \cup B') \] Step 2: Apply the Distributive Law: \( X \cap (Y \cup Z) = (X \cap Y) \cup (X \cap Z) \). Here, think of the whole expression as \( A \cup (B \cap B') \) using the other form of the distributive law: \( (A \cup B) \cap (A \cup B') = A \cup (B \cap B') \). \[ = A \cup (B \cap B') \] Step 3: Apply the Complement Law: \( B \cap B' = \emptyset \). \[ = A \cup \emptyset \] Step 4: Apply the Identity Law: \( A \cup \emptyset = A \). \[ = A \] Therefore: \[ (A \cup B) \cap (A \cup B') = A \]
Answer: \( (A \cup B) \cap (A \cup B') = A \) is proved using the Distributive Law, the Complement Law \( B \cap B' = \emptyset \), and the Identity Law \( A \cup \emptyset = A \).
Question: Using properties of sets, show that \( A \cap (A \cup B) = A \) for any two sets \( A \) and \( B \) that are subsets of a universal set \( U \).
Answer: Combining all steps: \[ A \cap (A \cup B) = (A \cap A) \cup (A \cap B) = A \cup (A \cap B) = (A \cap U) \cup (A \cap B) = A \cap (U \cup B) = A \cap U = A. \] Hence \( A \cap (A \cup B) = A \), which is proved.