More on Sets

Skip to main content

\(\newcommand{\identity}{\mathrm{id}} \newcommand{\notdivide}{{\not{\mid}}} \newcommand{\notsubset}{\not\subset} \newcommand{\lcm}{\operatorname{lcm}} \newcommand{\gf}{\operatorname{GF}} \newcommand{\inn}{\operatorname{Inn}} \newcommand{\aut}{\operatorname{Aut}} \newcommand{\Hom}{\operatorname{Hom}} \newcommand{\cis}{\operatorname{cis}} \newcommand{\chr}{\operatorname{char}} \newcommand{\Null}{\operatorname{Null}} \renewcommand{\vec}[1]{\mathbf{#1}} \newcommand{\N}{{\mathbb N}} \newcommand{\Z}{{\mathbb Z}} \newcommand{\Q}{{\mathbb Q}} \newcommand{\R}{{\mathbb R}} \newcommand{\Zpos}{{{\mathbb Z}^+}} \newcommand{\SUB}{\subseteq} \newcommand{\SUP}{\supseteq} \newcommand{\PSUB}{\varsubsetneq} \newcommand{\PSUP}{\varsupsetneq} \newcommand{\SETDIFF}{\smallsetminus} \newcommand{\st}{\,|\,} \newcommand{\ab}{\mbox{$\{a,b\}$}} \newcommand{\aetc}[2]{\mbox{{${#1}_1{#1}_2\ldots {#1}_{#2}$}}} \newcommand{\varep}{\varepsilon} \newcommand{\fsafig}[1]{\medskip\centerline{\eps{fsa#1}}\medskip} \newcommand{\REOR}{\hbox{$\,|\,$}} \newcommand{\POW}{{\mathscr P}} \newcommand{\EMPTYSTRING}{\varepsilon} \newcommand{\PRODUCES}{\longrightarrow} \newcommand{\YIELDS}{\Longrightarrow} \newcommand{\YIELDSTAR}{{\Longrightarrow}^*} \newcommand{\NT}[1]{\hbox{$\langle$\textit{#1}$\rangle$}} \newcommand{\BNFPRODUCES}{\hbox{\texttt{::=}}} \newcommand{\BNFALT}{\hbox{$|$}} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \definecolor{fillinmathshade}{gray}{0.9} \newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}} \)

Chapter 6 More on Sets

In this chapter we shall look more closely at some basic facts about sets. One question we could ask ourselves is: Can we manipulate sets similarly to the way we manipulated expressions in basic algebra, or to the way we manipulated propositions in logic? In basic algebra we are aware that \(a \cdot (b + c) = a\cdot b + a \cdot c \) for all real numbers \(a\text{,}\) \(b\text{,}\) and \(c\text{.}\) In logic we verified an analogue of this statement, namely, \(p \land ( q \lor r) \Leftrightarrow (p \land q)\lor (p \land r))\text{,}\) where \(p, q, \textrm{ and } r\) were arbitrary propositions. If \(A\text{,}\) \(B\text{,}\) and \(C\) are arbitrary sets, is \(A \cap (B \cup C) = (A \cap B) \cup (A \cap C)\text{?}\) How do we convince ourselves of it is truth, or discover that it is false? Let us consider some approaches to this problem, look at their pros and cons, and determine their validity. Later in this chapter, we introduce partitions of sets and minsets.