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
CBSE Class 11 Maths · Sets
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.
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) \).
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 \).
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.
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.
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.
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.
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.
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)
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))
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.
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 \).