Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 6 - Set Theory - Exercise Set 6.3 - Page 372: 22

Answer

(a) \(\exists S\ \forall T,\ S \cap T \ne \emptyset\) βœ… **Original is true** (b) \(\forall S\ \exists T,\ S \cup T \ne \emptyset\) βœ… **Negation is true**

Work Step by Step

Let’s analyze and **negate** each of the two statements and determine whether the **original** or the **negation** is true. --- ## πŸ”Ή **(a)** Statement: > \(\forall\) sets \(S\), \(\exists\) a set \(T\) such that \(S \cap T = \emptyset\) --- ### βœ… **Negation**: Negating \(\forall S\ \exists T \ (S \cap T = \emptyset)\) gives: > \(\exists\) a set \(S\) such that \(\forall\) sets \(T\), \(S \cap T \neq \emptyset\) In plain English: β€œThere is some set \(S\) that intersects **every** set \(T\) nontrivially.” --- ### ❌ Is the **original** statement true? Yes! For **any** set \(S\), we can always find a set \(T\) that has **no overlap**. For example: - Let \(T = \emptyset\), then \(S \cap T = \emptyset\) - Or let \(T\) be any set that contains elements **not in** \(S\) βœ… So the **original** is **true**. --- ### βœ… Final answer for (a): - **Negation**: \(\exists S\ \forall T,\ S \cap T \neq \emptyset\) - βœ… The **original** is **true**, the negation is **false**. --- ## πŸ”Ή **(b)** Statement: > \(\exists\) a set \(S\) such that \(\forall\) sets \(T\), \(S \cup T = \emptyset\) --- ### βœ… **Negation**: Negating \(\exists S\ \forall T \ (S \cup T = \emptyset)\) gives: > \(\forall\) sets \(S\), \(\exists\) a set \(T\) such that \(S \cup T \ne \emptyset\) In plain English: β€œFor **every** set \(S\), we can find some \(T\) such that their union is **not** empty.” --- ### ❌ Is the **original** statement true? No. Let’s suppose the original is true: > There exists a set \(S\) such that for **every** set \(T\), \(S \cup T = \emptyset\) But the only way \(S \cup T = \emptyset\) is if **both** \(S = \emptyset\) and \(T = \emptyset\) But this fails for any nonempty \(T\). So this **cannot** hold for **every** \(T\) Thus, **no such** \(S\) exists that satisfies the original. βœ… So the **original is false**, and the **negation is true**. --- ### βœ… Final answer for (b): - **Negation**: \(\forall S\ \exists T\ \text{such that } S \cup T \ne \emptyset\) - βœ… The **negation** is **true**, original is **false**.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.