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.
Feed/

What are proper subsets and why is the empty set a subset of every set?

Channel

Brisk

1 page

"Notice that by the definition, every set is a subset of itself. Sometimes, though, it’s useful to talk about whether a set is really a subset of another, and you don’t want it to “count” if the two sets are actually equal. This is called a proper subset, and the symbol for it is ⊂. You can see the rationale for the choice of symbol, because “⊆” is kind of like “≤” for numbers, and “⊂” is like “<”. Every set is a subset (not necessarily a proper one) of Ω, because our domain of discourse by definition contains everything that can come up in conversation. Somewhat less obviously, the empty set is a subset of every set. It’s weird to think that ∅ ⊆ Q when Q has several things in it, but the definition does hold. “Every” member of ∅ (there are none) is in fact also a member of Q."

Flowchart preview
Series cover
👍
0
0 comments0 shares

Sign in to view and post comments.