Bifalgorithm post · Brisk · Chapter 1
What are proper subsets and why is the empty set a subset of every set?
What are proper subsets and why is the empty set a subset of every set? (Brisk · Chapter 1) — "Notice that by the definition, every set is a subset of itself.…
Ideas in this flowchart
- Subsets, proper subsets, and their basic consequences
- Every set is a subset of itself.
- A proper subset is a subset that is not equal to the other set; its symbol is ⊂.
- The symbols ⊆ and ⊂ parallel the numerical relations ≤ and <.
- The domain of discourse Ω contains everything under discussion.
- Therefore, every set is a subset of Ω, though it may not be a proper subset.
- The empty set is a subset of every set.
- For example, ∅ ⊆ Q even when Q contains several elements.
- This holds because every member of ∅ is also a member of Q, and ∅ has no members.
