SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 1 Q7(i)

Using properties of sets, show that \( A \cup ( A \cap B ) =A\)

CBSE Class 11 Maths · Sets

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Proving A ∪ (A ∩ B) = A Using Set Properties

Detailed Explanation

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.

Formula Used

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 \)

Solution

  1. Step 1: Write \( A \) as \( A \cap U \), where \( U \) is the universal set. This is allowed because every set intersected with the universal set gives itself: \( A \cap U = A \). So the left-hand side becomes \[ A \cup (A \cap B) = (A \cap U) \cup (A \cap B). \]
  2. Step 2: Now both terms share the common factor \( A \). Apply the Distributive Law of intersection over union, which lets us take \( A \) common: \[ (A \cap U) \cup (A \cap B) = A \cap (U \cup B). \] This is done to simplify the two separate pieces into one expression involving \( A \).
  3. Step 3: Simplify \( U \cup B \). Since \( U \) is the universal set, it already contains every element, so uniting anything with \( U \) still gives \( U \): \[ U \cup B = U. \] Substituting this back gives \[ A \cap (U \cup B) = A \cap U. \]
  4. Step 4: Finally, apply the Identity Law once more: intersecting \( A \) with the universal set returns \( A \): \[ A \cap U = A. \] This completes the chain of equalities from the left-hand side back to \( A \).

Final 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.

Common Mistake

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 \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Rewrite A using the Universal Set: Replace \( A \) on the left-hand side with the equivalent expression \( A \cap U \), where \( U \) is the universal set. This gives: \[ A \cup (A \cap B) = (A \cap U) \cup (A \cap B). \] Reason: Every set intersected with the universal set returns itself, so \( A \cap U = A \) is always valid. Rewriting \( A \) this way gives both terms a common factor of \( A \), which sets up the next step.
  2. Step 2: Factor Out A Using the Distributive Law: Notice both terms contain \( A \cap (\\ \cdot\\ ) \). Apply the Distributive Law of intersection over union to factor \( A \) out: \[ (A \cap U) \cup (A \cap B) = A \cap (U \cup B). \] Reason: Just like factoring a common term in algebra, we pull \( A \cap \) outside the bracket, combining \( U \) and \( B \) inside. This collapses two terms into a single clean expression.
  3. Step 3: Simplify U ∪ B: Evaluate the expression inside the bracket. Since \( U \) is the universal set containing every element, adding any set \( B \) to it cannot produce anything new: \[ U \cup B = U. \] Reason: The universal set already contains all elements, so \( U \cup B = U \) by the Domination (or Identity) Law for union.
  4. Step 4: Substitute and Apply the Identity Law: Replace \( U \cup B \) with \( U \) in the expression from Step 2: \[ A \cap (U \cup B) = A \cap U. \] Then apply the Identity Law \( A \cap U = A \) to get: \[ A \cap U = A. \] Reason: Intersecting any set with the universal set simply gives the set back, completing the chain of equalities.

Final 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.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Replace \( A \) with \( A \cap U \) on the left-hand side: \[ A \cup (A \cap B) = (A \cap U) \cup (A \cap B). \]
  2. Step 2: Factor out \( A \) using the Distributive Law: \[ (A \cap U) \cup (A \cap B) = A \cap (U \cup B). \]
  3. Step 3: Use \( U \cup B = U \), then \( A \cap U = A \): \[ A \cap (U \cup B) = A \cap U = A. \]

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.

➕ More Examples

More Examples

Example 1

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 \).

Example 2

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 \).

🎯 Try a Similar Question

Try a Similar Question

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 \).

Solution

  1. Step 1: Start with the Left-Hand Side: We begin with the left-hand side (LHS): \[ A \cap (A \cup B) \]
  2. Step 2: Apply the Distributive Law: Using the distributive law, \( A \cap (A \cup B) = (A \cap A) \cup (A \cap B) \), we get: \[ (A \cap A) \cup (A \cap B) \]
  3. Step 3: Apply the Idempotent Law: By the idempotent law of sets, \( A \cap A = A \). Substituting this: \[ A \cup (A \cap B) \]
  4. Step 4: Apply the Absorption Law: We know that \( A \cap B \subseteq A \) for any sets \( A \) and \( B \). Therefore, \( A \cup (A \cap B) = A \). This can also be justified formally: replace \( A \) with \( A \cap U \) (since \( A \cap U = A \)): \[ (A \cap U) \cup (A \cap B) \] Using distributive law in reverse: \[ A \cap (U \cup B) \] Since \( U \cup B = U \) for any set \( B \): \[ A \cap U \] Applying the identity law \( A \cap U = A \): \[ A \]
  5. Step 5: Conclusion: We have shown that \( A \cap (A \cup B) = A \). Hence proved.

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.

Everything you get with Solver7

More questions in Sets