SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 1 Q3

Let A, B, and C be the sets such that \(A \cup B = A \cup C\) and \(A \cap B = A \cap C.\) Show that \(B = C.\)

CBSE Class 11 Maths · Sets

Solution

👶 Simple Explanation

Simple Explanation

Imagine two bags, B and C, that share the same mixing rules with bag A. If you always get the same result when you combine or overlap either bag with A, the bags must hold identical items. We use a clever trick: rewrite bag B using only those shared mixing results. After swapping in what we know about bag A, bag B looks exactly like bag C. Same contents, same bag — so B and C are equal!

Answer: By using \( B = B \cap (A \cup B) \), then replacing with the given equalities and applying the distributive law, we obtain \( B = C \). Hence proved.

📖 Proving B = C from Union and Intersection Conditions

Detailed Explanation

To show two sets are equal, we prove that each element approach works, or we use known set identities. Two sets \( B \) and \( C \) are equal when \( B = C \), meaning they contain exactly the same elements. A very useful tool here is the distributive law of sets, which connects unions and intersections. The key idea is to express \( B \) purely in terms of operations involving \( A \), \( A \cup B \), and \( A \cap B \). Since we are given that \( A \cup B = A \cup C \) and \( A \cap B = A \cap C \), if we can rewrite \( B \) using only these expressions, then \( B \) must equal the same expression written for \( C \), giving \( B = C \). A handy identity is \( B = (B \cap A) \cup (B \setminus A) \), but the cleanest route uses the distributive law after intersecting with \( (A \cup C) \).

Formula Used

Distributive law: \( X \cap (Y \cup Z) = (X \cap Y) \cup (X \cap Z) \). Also \( B \cap (A \cup B) = B \) since \( B \subseteq A \cup B \).

Solution

  1. Step 1: Start with set \( B \). Since \( B \subseteq A \cup B \), intersecting \( B \) with \( A \cup B \) gives back \( B \) itself: \[ B = B \cap (A \cup B). \]
  2. Step 2: Use the given condition \( A \cup B = A \cup C \) to replace \( A \cup B \): \[ B = B \cap (A \cup C). \]
  3. Step 3: Apply the distributive law \( B \cap (A \cup C) = (B \cap A) \cup (B \cap C) \): \[ B = (B \cap A) \cup (B \cap C). \]
  4. Step 4: Use the given condition \( A \cap B = A \cap C \), that is \( B \cap A = C \cap A \), to replace \( B \cap A \): \[ B = (C \cap A) \cup (B \cap C). \]
  5. Step 5: Now rewrite \( C \cap A \) as \( A \cap C \) and \( B \cap C \) as \( C \cap B \), and apply the distributive law in reverse: \[ B = (C \cap A) \cup (C \cap B) = C \cap (A \cup B). \]
  6. Step 6: Again use \( A \cup B = A \cup C \): \[ B = C \cap (A \cup C). \] Since \( C \subseteq A \cup C \), we have \( C \cap (A \cup C) = C \). Therefore \[ B = C. \]

Final Answer

By using \( B = B \cap (A \cup B) \), then replacing with the given equalities and applying the distributive law, we obtain \( B = C \). Hence proved.

Common Mistake

A common mistake is assuming that either \( A \cup B = A \cup C \) alone or \( A \cap B = A \cap C \) alone is enough to conclude \( B = C \). Both conditions must be used together; using only one leads to an incomplete and incorrect proof.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Start with the set \( B \) and write it as an intersection with \( A \cup B \): \[ B = B \cap (A \cup B). \] Reason: Because \( B \subseteq A \cup B \), every element of \( B \) is already in \( A \cup B \), so intersecting \( B \) with \( A \cup B \) does not remove any elements and leaves \( B \) unchanged.
  2. Step 2: Use the first given condition \( A \cup B = A \cup C \) to substitute inside the intersection: \[ B = B \cap (A \cup C). \] Reason: We are simply replacing \( A \cup B \) with the equal expression \( A \cup C \) — since two equal sets are interchangeable in any expression.
  3. Step 3: Apply the distributive law \( B \cap (A \cup C) = (B \cap A) \cup (B \cap C) \) to expand: \[ B = (B \cap A) \cup (B \cap C). \] Reason: The distributive law lets us split the union inside the intersection into two separate intersections, making the expression easier to work with using the second given condition.
  4. Step 4: Use the second given condition \( A \cap B = A \cap C \), which is the same as \( B \cap A = C \cap A \), to replace \( B \cap A \): \[ B = (C \cap A) \cup (B \cap C). \] Reason: The given condition tells us \( B \cap A \) and \( C \cap A \) are identical sets, so we substitute one for the other.
  5. Step 5: Notice that \( C \cap A \subseteq C \) and \( B \cap C \subseteq C \), so the right-hand side is a union of two subsets of \( C \), which means it is itself a subset of \( C \). Also write the same chain starting from \( C \) instead of \( B \): \[ C = C \cap (A \cup C). \] Then substitute \( A \cup C = A \cup B \) (the given condition used in the other direction): \[ C = C \cap (A \cup B) = (C \cap A) \cup (C \cap B). \] Reason: Applying the same argument symmetrically shows that \( C \) can also be expressed as \( (C \cap A) \cup (C \cap B) \).
  6. Step 6: Compare the two results: from Step 4 we have \[ B = (C \cap A) \cup (B \cap C), \] and from Step 5 we have \[ C = (C \cap A) \cup (C \cap B). \] Since \( B \cap C = C \cap B \) (intersection is commutative), both right-hand sides are identical, so \( B = C \). Reason: Two expressions that are built from exactly the same sets using the same operations must be equal, completing the proof.

Final Answer

By using \( B = B \cap (A \cup B) \), then replacing with the given equalities and applying the distributive law, we obtain \( B = C \). Hence proved.

Common Mistake

One common mistake: Students forget to apply the argument symmetrically for \( C \), and instead only show one direction of the substitution, which is not enough to conclude \( B = C \) rigorously.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Since \( B \subseteq A \cup B \): \[ B = B \cap (A \cup B) \]
  2. Step 2: Using \( A \cup B = A \cup C \): \[ B = B \cap (A \cup C) \]
  3. Step 3: Applying distributive law: \[ B = (B \cap A) \cup (B \cap C) \]
  4. Step 4: Using \( A \cap B = A \cap C \), i.e., \( B \cap A = C \cap A \): \[ B = (C \cap A) \cup (B \cap C) \] Similarly, starting with \( C = C \cap (A \cup C) = C \cap (A \cup B) = (C \cap A) \cup (C \cap B) \), so \( B = C \).

Answer: By using \( B = B \cap (A \cup B) \), then replacing with the given equalities and applying the distributive law, we obtain \( B = C \). Hence proved.

➕ More Examples

More Examples

Example 1

Question: Let P, Q, and R be sets such that \( P \cup Q = P \cup R \) and \( P \cap Q = P \cap R \). Show that \( Q = R \).

Solution: We will show \( Q \subseteq R \) and \( R \subseteq Q \), which together imply \( Q = R \). Showing \( Q \subseteq R \): Let \( x \in Q \). We consider two cases. Case 1: \( x \in P \). Since \( x \in P \) and \( x \in Q \), we have \( x \in P \cap Q \). Since \( P \cap Q = P \cap R \), we get \( x \in P \cap R \), so \( x \in R \). Case 2: \( x \notin P \). Since \( x \in Q \) and \( Q \subseteq P \cup Q \), we have \( x \in P \cup Q \). Since \( P \cup Q = P \cup R \), we get \( x \in P \cup R \), meaning \( x \in P \) or \( x \in R \). But \( x \notin P \), so \( x \in R \). In both cases \( x \in R \), so \( Q \subseteq R \). Showing \( R \subseteq Q \): Let \( y \in R \). Again, two cases. Case 1: \( y \in P \). Since \( y \in P \) and \( y \in R \), we have \( y \in P \cap R \). Since \( P \cap R = P \cap Q \), we get \( y \in P \cap Q \), so \( y \in Q \). Case 2: \( y \notin P \). Since \( y \in R \) and \( R \subseteq P \cup R \), we have \( y \in P \cup R \). Since \( P \cup R = P \cup Q \), we get \( y \in P \cup Q \), meaning \( y \in P \) or \( y \in Q \). But \( y \notin P \), so \( y \in Q \). In both cases \( y \in Q \), so \( R \subseteq Q \). Since \( Q \subseteq R \) and \( R \subseteq Q \), we conclude \( Q = R \).

Answer: Q = R (proved using double inclusion)

Example 2

Question: Let X, Y, and Z be sets such that \( X \cup Y = X \cup Z \) and \( X \cap Y = X \cap Z \). Prove that \( Y = Z \) using the property that \( Y = (Y \cap X) \cup (Y \setminus X) \).

Solution: We use the decomposition property: any set Y can be written as the disjoint union of its part inside X and its part outside X. Recall that for any sets Y and X: \[ Y = (Y \cap X) \cup (Y \setminus X) \] Step 1: Express Y using the given conditions. We have: \[ Y = (Y \cap X) \cup (Y \setminus X) \] Since \( X \cap Y = X \cap Z \), we can replace \( Y \cap X \) with \( Z \cap X \): \[ Y = (Z \cap X) \cup (Y \setminus X) \] Now, since \( Y \setminus X \subseteq Y \subseteq X \cup Y \) and \( X \cup Y = X \cup Z \), any element of \( Y \setminus X \) belongs to \( X \cup Z \). But elements of \( Y \setminus X \) do not belong to X, so they must belong to Z. Thus \( Y \setminus X \subseteq Z \setminus X \). So: \[ Y = (Z \cap X) \cup (Y \setminus X) \subseteq (Z \cap X) \cup (Z \setminus X) = Z \] This gives \( Y \subseteq Z \). Step 2: Express Z using the given conditions. Similarly: \[ Z = (Z \cap X) \cup (Z \setminus X) \] Since \( X \cap Z = X \cap Y \), replace \( Z \cap X \) with \( Y \cap X \): \[ Z = (Y \cap X) \cup (Z \setminus X) \] Since \( Z \setminus X \subseteq X \cup Z = X \cup Y \), and elements of \( Z \setminus X \) do not belong to X, they must belong to Y. Thus \( Z \setminus X \subseteq Y \setminus X \). So: \[ Z = (Y \cap X) \cup (Z \setminus X) \subseteq (Y \cap X) \cup (Y \setminus X) = Y \] This gives \( Z \subseteq Y \). Step 3: Conclude. Since \( Y \subseteq Z \) and \( Z \subseteq Y \), we have \( Y = Z \).

Answer: Y = Z (proved using the decomposition Y = (Y ∩ X) ∪ (Y \ X))

🎯 Try a Similar Question

Try a Similar Question

Question: Let P, Q, and R be sets such that \( P \cup Q = P \cup R \) and \( P \cap Q = P \cap R \). Using these conditions, prove that \( Q = R \) by starting with the expression \( Q = Q \cup (P \cap Q) \) and working through the substitution and distributive law.

Solution

  1. Step 1: Start with a known identity for Q: We use the absorption law. For any sets P and Q, we know that \( Q \cup (P \cap Q) = Q \). So we can write: \[ Q = Q \cup (P \cap Q) \]
  2. Step 2: Substitute the given condition: Since \( P \cap Q = P \cap R \) (given), substitute this into the expression: \[ Q = Q \cup (P \cap R) \]
  3. Step 3: Apply the distributive law: Using the distributive law \( A \cup (B \cap C) = (A \cup B) \cap (A \cup C) \), expand the right-hand side: \[ Q = (Q \cup P) \cap (Q \cup R) \]
  4. Step 4: Substitute the other given condition: Since \( P \cup Q = P \cup R \), we also have \( Q \cup P = R \cup P \). Substituting: \[ Q = (R \cup P) \cap (Q \cup R) \]
  5. Step 5: Apply the distributive law again: Expand \( (R \cup P) \cap (Q \cup R) \) using the distributive law \( A \cap (B \cup C) = (A \cap B) \cup (A \cap C) \): \[ Q = (R \cap Q) \cup (R \cap P) \] Rearranging terms using commutativity: \[ Q = (Q \cap R) \cup (P \cap R) \]
  6. Step 6: Apply the distributive law in reverse: Factor out R using the distributive law in reverse: \[ Q = R \cap (Q \cup P) \]
  7. Step 7: Substitute the given condition again: Since \( Q \cup P = R \cup P \), substitute: \[ Q = R \cap (R \cup P) \]
  8. Step 8: Apply the absorption law to conclude: By the absorption law, \( R \cap (R \cup P) = R \). Therefore: \[ Q = R \] Hence proved.

Answer: Starting from \( Q = Q \cup (P \cap Q) \), substituting \( P \cap Q = P \cap R \) and \( P \cup Q = P \cup R \), and applying the distributive and absorption laws, we arrive at \( Q = R \cap (R \cup P) = R \). Hence \( Q = R \).

Everything you get with Solver7

More questions in Sets