1.
Prove each of the set operation rules in Proposition 9.4.11. Use the provided proof of the first of DeMorgan’s Laws as a model for your proofs.
Exercises 9.9 Exercises
Expressing relationships using the symbols of set theory.
In each of Exercises 2–4, you are given a collection of sets (and possibly some elements of those sets), a collection of symbols, and a collection of statements about those sets and their elements. Use the given symbols to express the given statements in symbolic language.
Note that there may be more than one correct answer for each statement.
2.
Sets:
\begin{align*}
A \amp = \text{ the set of all Augustana students } \\
R \amp = \text{ the set of Augustana students who attend class regularly } \\
S \amp = \text{ the set of Augustana students who study diligently } \\
P \amp = \text{ the set of Augustana students who will pass all their courses }
\end{align*}
Symbols:
\begin{equation*}
A, \quad
R, \quad
S, \quad
P, \quad
\cmplmnt{R}, \quad
\cmplmnt{S}, \quad
\cmplmnt{P}, \quad
\intersection, \quad
\union, \quad
=, \quad
\ne, \quad
\subseteq, \quad
\subsetneqq, \quad
\emptyset
\end{equation*}
(a)
All Augustana students who attend class regularly and study diligently will pass all their courses.
(b)
Some Augustana students attend class regularly but do not study diligently.
(c)
Some Augustana students who study diligently will still fail a course.
3.
Recall that a square number is an integer which is equal to the square of some integer. (See the introduction preceding Exercise 6.12.17 in Exercises 6.12.)
Sets:
\begin{align*}
P \amp = \text{ the set of prime numbers } \\
E \amp = \text{ the set of even numbers } \\
S \amp = \text{ the set of square numbers }
\end{align*}
Symbols:
\begin{equation*}
2, \;\;\,
\N, \;\;\,
P, \;\;\,
E, \;\;\,
S, \;\;\,
\cmplmnt{\N}, \;\;\,
\cmplmnt{P}, \;\;\,
\cmplmnt{E}, \;\;\,
\cmplmnt{S}, \;\;\,
\in, \;\;\,
\intersection, \;\;\,
\union, \;\;\,
=, \;\;\,
\ne, \;\;\,
\subseteq, \;\;\,
\subsetneqq, \;\;\,
\emptyset
\end{equation*}
(a)
\(2 \) is the only even, prime number.
(b)
There exist odd square numbers.
(c)
No prime number is square.
(d)
No square number is prime.
(e)
It is not true that every natural number is either even or prime.
4.
Sets:
\begin{align*}
\mathscr{F} \amp = \text{ the set of all functions in a single real variable } \\
\mathscr{C} \amp = \text{ the set of continuous functions } \\
\mathscr{D} \amp = \text{ the set of differentiable functions } \\
\mathscr{P} \amp = \text{ nonnegative functions } \\
\amp = \setdef{f(x)}{ f(x) \ge 0 \text{ for all } x \text{ in the domain of } f }
\end{align*}
Elements:
\begin{align*}
f_1(x) \amp = x^2 \amp
f_2(x) \amp = \abs{x} \amp
f_3(x) \amp = \tan x
\end{align*}
Symbols:
\begin{equation*}
\mathscr{F}, \:
\mathscr{C}, \:
\mathscr{D}, \:
\mathscr{P}, \:
\cmplmnt{\mathscr{F}}, \:
\cmplmnt{\mathscr{C}}, \:
\cmplmnt{\mathscr{D}}, \:
\cmplmnt{\mathscr{P}}, \:
f_1(x), \:
f_2(x), \:
f_3(x), \:
\in, \:
\intersection, \:
\union, \:
=, \:
\ne, \:
\subseteq, \:
\subsetneqq, \:
\emptyset
\end{equation*}
(a)
The function \(f_1(x) \) is differentiable and nonnegative.
(b)
The function \(f_2(x) \) is continuous and nonnegative, but not differentiable.
(c)
The function \(f_3(x) \) is neither continuous nor nonnegative.
(d)
Every differentiable function is continuous.
(e)
Some continuous functions are not differentiable.
(f)
Not every function is continuous.
Testing set equality.
For each of Exercises 5–8, either formally prove the given equivalence of sets (using the Test for Set Equality) or demonstrate that it is false by providing a specific counterexample.
5.
\(A = (A \relcmplmnt B) \disjunion (A \intersection B) \)
6.
\(A \relcmplmnt (A \relcmplmnt B) = B \)
7.
\((A \cartprod B) \union (C \cartprod D) = (A \union C) \cartprod (B \union D) \)
8.
\(A \cartprod (B \relcmplmnt C) = (A \cartprod B) \relcmplmnt (A \cartprod C) \)
9.
Suppose \(\Sigma \) is an alphabet. Prove that \(\words{\Sigma} \) is the disjoint union of the subsets
\begin{equation*}
\words{\Sigma}_0, \quad \words{\Sigma}_1, \quad \words{\Sigma}_2, \quad \dotsc, \quad \words{\Sigma}_n, \quad \dotsc \text{.}
\end{equation*}
10.
Write out the elements of each of the sets
\begin{equation*}
\powset{ \emptyset }, \quad
\powset{ \, \powset{ \emptyset } \, }, \quad
\powset{ \, \powset{ \, \powset{ \emptyset } \, } \, }, \quad
\powset{ \, \powset{ \, \powset{ \, \powset{ \emptyset } \, } \, } \, }\text{.}
\end{equation*}
Make sure you have all the pairs of braces \(\{\phantom{x}\} \) you should have.
Without computing it, make a conjecture about the number of elements in the set
\begin{equation*}
\powset{ \, \powset{ \, \powset{ \, \powset{ \, \powset{ \emptyset } \, } \, } \, } \, }.
\end{equation*}
Properties of power sets.
For each of Exercises 11–14, either formally prove the given statement about power sets or demonstrate that it is false by providing a specific counterexample.
11.
\(\powset{A \union B} = \powset{A} \union \powset{B} \)
12.
\(\powset{A \intersection B} = \powset{A} \intersection \powset{B} \)
13.
If \(A \subseteq B \text{,}\) then \(\powset{A} \subseteq \powset{B} \text{.}\)
14.
If \(A \subseteq B \text{,}\) then \(\powset{B \relcmplmnt A} = \powset{B} \relcmplmnt \powset{A} \text{.}\)
