Discrete Mathematics Section 1.2
A set is an unordered collection of distinct objects, called elements.
There are two primary ways to describe a set:
You will see these LaTeX symbols constantly. Memorize them!
\(A\) is a subset of \(B\) if every element of \(A\) is also in \(B\). * Formal Logic: \(\forall x, (x \in A \implies x \in B)\)
\(A\) is a subset of \(B\), but \(A \neq B\) (at least one element in \(B\) is not in \(A\)).
The Empty Set (or null set) contains no elements. * Notation: \(\emptyset\) or \(\{ \}\) * Warning: \(\{\emptyset\}\) is NOT empty. It is a set containing one element (which happens to be an empty set).
Crucial Fact: The empty set is a subset of every set. \(\forall \text{ sets } A, \emptyset \subseteq A\).
Two sets \(A\) and \(B\) are equal if and only if they have the exact same elements.
In proofs, we show \(A = B\) by proving two things: 1. \(A \subseteq B\) 2. \(B \subseteq A\)
If both are true, the sets are identical.
Cardinality refers to the size of the set. * Notation: \(|A|\) (the number of elements in \(A\)).
Examples: * If \(A = \{2, 4, 6, 8\}\), then \(|A| = 4\). * If \(B = \emptyset\), then \(|B| = 0\). * If \(C = \{ \{1, 2\}, \{3, 4\} \}\), then \(|C| = 2\). (Sets can contain other sets!)
Determine if the following are True or False:
Answers: 1. True (2 is an item in the list) 2. False (The set \(\{2\}\) is not an item in the list) 3. True (Every item in the left set is in the right set) 4. False (The empty set is a subset, but not an element here)
\in \(\to \in\) (is an element of)\notin \(\to \notin\) (is not an element of)\subseteq \(\to \subseteq\) (subset)\emptyset \(\to \emptyset\) (empty set)\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R} \(\to \mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R}\)\mid \(\to \mid\) (used in set-builder for “such that”)