If A, B and C are subsets of a given set, then which one of the following relations is not correct?
A∪ (A∩B) = A∪B
This question asks us to identify which of the given set relations is incorrect. We are given four relations involving sets A, B, and C, which are subsets of a universal set. To solve this, we will analyze each relation using the definitions of set union ($\cup$) and intersection ($\cap$).
Let's analyze the left side of the equation: $A \cup (A \cap B)$.
Now, let's look at the right side of the equation: $A \cup B$.
The relation becomes $A = A \cup B$. This equality holds true only if set B is a subset of set A ($B \subseteq A$). However, this is not true for all possible sets A and B. For example, if B has elements not in A, then $A \cup B$ will contain elements that are not in A, making $A \neq A \cup B$.
Since the relation $A \cup (A \cap B) = A \cup B$ is equivalent to $A = A \cup B$, which is not universally true for all subsets A and B, this relation is incorrect.
Let's analyze the left side of the equation: $A \cap (A \cup B)$.
The right side is A. The relation $A = A$ is always correct. This relation is a correct set identity.
This relation represents one of the distributive laws of set theory: the union is distributive over the intersection. This is a standard and correct set identity.
It states that taking the intersection of A and B first, then uniting the result with C, is equivalent to uniting A with C and uniting B with C separately, and then taking the intersection of those two results.
This relation is correct.
This relation represents the other distributive law of set theory: the intersection is distributive over the union. This is also a standard and correct set identity.
It states that taking the union of A and B first, then intersecting the result with C, is equivalent to intersecting A with C and intersecting B with C separately, and then taking the union of those two results.
This relation is correct.
Based on our analysis, the relation that is not correct is $A \cup (A \cap B) = A \cup B$. The correct identity is $A \cup (A \cap B) = A$.
| Relation | Analysis | Correctness |
|---|---|---|
| $A \cup (A \cap B) = A \cup B$ | LHS simplifies to $A$. RHS is $A \cup B$. $A = A \cup B$ is not always true. | Not Correct |
| $A \cap (A \cup B) = A$ | LHS simplifies to $A$. RHS is $A$. $A = A$ is always true. | Correct |
| $(A \cap B) \cup C = (A \cup C) \cap (B \cup C)$ | Distributive Law of Union over Intersection. | Correct |
| $(A \cup B) \cap C = (A \cap C) \cup (B \cap C)$ | Distributive Law of Intersection over Union. | Correct |
| Identity Name | Relation |
|---|---|
| Idempotent Laws | $A \cup A = A$ $A \cap A = A$ |
| Commutative Laws | $A \cup B = B \cup A$ $A \cap B = B \cap A$ |
| Associative Laws | $(A \cup B) \cup C = A \cup (B \cup C)$ $(A \cap B) \cap C = A \cap (B \cap C)$ |
| Distributive Laws | $A \cup (B \cap C) = (A \cup B) \cap (A \cup C)$ $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$ |
| Identity Laws | $A \cup \emptyset = A$ $A \cap U = A$ $A \cup U = U$ $A \cap \emptyset = \emptyset$ |
| Complement Laws | $A \cup A' = U$ $A \cap A' = \emptyset$ $(A')' = A$ $\emptyset' = U$ $U' = \emptyset$ |
| De Morgan's Laws | $(A \cup B)' = A' \cap B'$ $(A \cap B)' = A' \cup B'$ |
| Absorption Laws | $A \cup (A \cap B) = A$ $A \cap (A \cup B) = A$ |
The first two options in the question relate to what are known as the Absorption Laws in set theory. These laws describe how union and intersection operations interact when one set is a subset of the result of the operation involving the other set.
Understanding these fundamental identities and laws is crucial for working with sets and simplifying set expressions in discrete mathematics and logic.
A set S contains (2n + 1) elements. There are 4096 subsets of S which contain at most n elements. What is n equal to?
Let A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. Then the number of subsets of A containing exactly two elements is
If A = { x : x is a multiple of 3} and B = (x : x is a multiple of 4} and C = {x : x is a multiple of 12}, then which one of the following is a null set?
Let S be a set of all distinct numbers of the form \(\frac{{\rm{p}}}{{\rm{q}}}\) , where p, q ∈ {1, 2, 3, 4, 5, 6}. What is the the cardinality of the set S?
If A and B are two sets containing 2 elements and 4 elements respectively, then number of subsets of A × B having 3 or more elements is :