SOLVER7 Study. Nothing Else.
Exercise 1.5 Q7(i)

Fill in the blanks to make each of the following a true statement : \(A \cup A'= . . .\)

CBSE Class 11 Maths · Sets

Solution

👶 Simple Explanation

Simple Explanation

Imagine a big bag called the universal set \( U \) that holds every single thing we care about. Now split those things into two groups: things inside set \( A \), and things outside set \( A \) (called \( A' \)). Every item in the bag must belong to one of these two groups. There is no item left out. So when you combine both groups, you get back the whole big bag. That combined collection is exactly \( U \).

Answer: \( A \cup A' = U \), the universal set.

📖 Union of a Set and Its Complement

Detailed Explanation

In set theory, we always work within a fixed universal set \( U \), which contains every element under consideration. For any set \( A \subseteq U \), the complement \( A' \) is the set of all elements of \( U \) that are NOT in \( A \). So every element of \( U \) is either inside \( A \) or inside \( A' \) — there is no third option. When we take the union \( A \cup A' \), we collect all elements that are in \( A \) together with all elements that are not in \( A \). Together these cover the whole universal set. This is called the Complement Law of union.

Formula Used

\( A \cup A' = U \) and \( A \cap A' = \emptyset \)

Solution

  1. Step 1: Recall the definition of complement. If \( U \) is the universal set and \( A \subseteq U \), then \( A' = \{ x : x \in U \text{ and } x \notin A \} \).
  2. Step 2: Take any element \( x \) of the universal set \( U \). By definition, either \( x \in A \) or \( x \notin A \). If \( x \notin A \), then \( x \in A' \). So every element of \( U \) belongs to \( A \) or to \( A' \).
  3. Step 3: The union \( A \cup A' \) contains all elements that lie in \( A \) or in \( A' \). From Step 2, this includes every element of \( U \), so \( U \subseteq A \cup A' \).
  4. Step 4: Since both \( A \) and \( A' \) are subsets of \( U \), their union is also a subset of \( U \), giving \( A \cup A' \subseteq U \).
  5. Step 5: Combining both inclusions from Step 3 and Step 4, we conclude \( A \cup A' = U \).

Final Answer

\( A \cup A' = U \), the universal set.

Common Mistake

A common mistake is writing \( A \cup A' = \emptyset \). The empty set is the result of the intersection \( A \cap A' \), not the union. The union of a set with its complement fills up the whole universal set \( U \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down the definition of the complement. For a universal set \( U \) and any set \( A \subseteq U \), the complement is defined as \( A' = \\{ x : x \in U \text{ and } x \notin A \\} \) — Reason: Knowing what \( A' \) means precisely is the foundation for everything that follows.
  2. Step 2: Pick any arbitrary element, say \( x \), from the universal set \( U \). By the law of excluded middle, either \( x \in A \) or \( x \notin A \) — these are the only two options — Reason: Every element of \( U \) must fall into exactly one of these two cases, with no grey area.
  3. Step 3: Examine both cases from Step 2. Case 1: if \( x \in A \), then \( x \in A \cup A' \). Case 2: if \( x \notin A \), then by definition \( x \in A' \), so again \( x \in A \cup A' \). Since both cases lead to \( x \in A \cup A' \), every element of \( U \) is in \( A \cup A' \), which means \( U \subseteq A \cup A' \) — Reason: This direction of the proof shows the union is at least as large as \( U \).
  4. Step 4: Now show the reverse inclusion. Both \( A \) and \( A' \) are subsets of \( U \), so any element belonging to either \( A \) or \( A' \) must belong to \( U \). Therefore \( A \cup A' \subseteq U \) — Reason: The union cannot contain elements outside \( U \) because neither \( A \) nor \( A' \) does.
  5. Step 5: Combine the two inclusions established above: \( U \subseteq A \cup A' \) (from Step 3) and \( A \cup A' \subseteq U \) (from Step 4). Two sets that are each subsets of the other must be equal, so \( A \cup A' = U \) — Reason: This is the standard double-inclusion technique used in set theory to prove equality of two sets.

Final Answer

\( A \cup A' = U \), the universal set.

Common Mistake

One common mistake: Students sometimes confuse \( A \cup A' = U \) with \( A \cup A' = \emptyset \). Remember, it is the intersection \( A \cap A' = \emptyset \) (not the union) that equals the empty set, because no element can simultaneously belong to both \( A \) and its complement.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Definition of complement: \( A' = \\{ x : x \in U \text{ and } x \notin A \\} \)
  2. Step 2: For any \( x \in U \): either \( x \in A \) or \( x \notin A \), so \( x \in A' \). Thus \( U \subseteq A \cup A' \).
  3. Step 3: Since \( A \subseteq U \) and \( A' \subseteq U \), we have \( A \cup A' \subseteq U \).
  4. Step 4: From both inclusions: \( A \cup A' = U \).

Answer: \( A \cup A' = U \), the universal set.

➕ More Examples

More Examples

Example 1

Question: Let \( U = \{1, 2, 3, 4, 5, 6, 7, 8\} \) be the universal set and \( B = \{2, 4, 6, 8\} \). Find \( B \cap B' \) and verify by listing all elements.

Solution: Step 1: Identify B and the universal set U. We have \( U = \{1, 2, 3, 4, 5, 6, 7, 8\} \) and \( B = \{2, 4, 6, 8\} \). Step 2: Find the complement of B. The complement \( B' \) consists of all elements in U that are NOT in B. Therefore \[ B' = \{1, 3, 5, 7\} \] Step 3: Find \( B \cap B' \). The intersection \( B \cap B' \) consists of elements that are in BOTH B and B'. Since B contains only even numbers \(\{2, 4, 6, 8\}\) and B' contains only odd numbers \(\{1, 3, 5, 7\}\), there are no common elements. Therefore \[ B \cap B' = \emptyset \] Step 4: Verify using the complement law. By the complement law, for any set B and its complement B' with respect to a universal set, \[ B \cap B' = \emptyset \] This confirms our answer, since a set and its complement share no elements — every element either belongs to B or to B', never both.

Answer: \( B \cap B' = \emptyset \)

Example 2

Question: If \( U = \{x \mid x \in \mathbb{N},\, x \le 10\} \) and \( C = \{1, 3, 5, 7, 9\} \), fill in the blank to make a true statement: \( C \cup C' = \) ___. Justify your answer.

Solution: Step 1: Write out the universal set U in roster form. Since U consists of all natural numbers less than or equal to 10, \[ U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} \] Step 2: Write out C and find C'. We are given \( C = \{1, 3, 5, 7, 9\} \) (the odd natural numbers up to 10). The complement C' contains all elements of U not in C. Therefore \[ C' = \{2, 4, 6, 8, 10\} \] Step 3: Find \( C \cup C' \). The union \( C \cup C' \) contains every element that is in C OR in C' (or both). Combining the two sets: \[ C \cup C' = \{1, 3, 5, 7, 9\} \cup \{2, 4, 6, 8, 10\} = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} \] Step 4: Compare with U. We see that \( C \cup C' = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} = U \). Justification: By the complement law, the union of any set and its complement always equals the universal set U, because every element of U must belong either to C or to C' (the two sets partition U completely). Therefore \[ C \cup C' = U \]

Answer: \( C \cup C' = U \)

🎯 Try a Similar Question

Try a Similar Question

Question: Fill in the blank to make the following a true statement: \( A \cap A' = \underline{\hspace{1.5cm}} \)

Solution

  1. Step 1: Recall the definition of complement: The complement of a set A with respect to a universal set U is defined as the set of all elements that belong to U but do NOT belong to A. In set-builder notation: \( A' = \{ x : x \in U \text{ and } x \notin A \} \)
  2. Step 2: Understand what the intersection means here: The intersection \( A \cap A' \) consists of all elements that belong to BOTH A and A' simultaneously.
  3. Step 3: Check whether any element can belong to both A and A': By definition, if an element \( x \in A \), then \( x \notin A' \). Conversely, if \( x \in A' \), then \( x \notin A \). Therefore, no element can belong to both A and A' at the same time.
  4. Step 4: Conclude the result: Since no element belongs to both A and A', the intersection is the empty set: \[ A \cap A' = \emptyset \]

Answer: \( A \cap A' = \emptyset \) (the empty set)

Everything you get with Solver7

More questions in Sets