Course contentsShow
← Computer Science
Lesson 60 of 2,8722. Discrete Mathematics for CSFree lesson

Subsets and Proper Subsets

Define subset and proper subset relationships; understand subset notation and basic subset properties.

Subsets and Proper Subsets

What you'll learn: How to determine whether one set is contained within another, and when that containment is "proper."

The Core Idea

A subset relationship exists when every element of one set is also an element of another set. If set A is a subset of set B, we write A ⊆ B.

Think of it like organizing folders on your computer: if every file in folder A also exists in folder B, then A's contents are a "subset" of B's contents.

Formal Definition

Set A is a subset of set B if:

  • For every element x in A, x is also in B
  • Written: A ⊆ B

Examples

  • {1, 2} ⊆ {1, 2, 3} ✓ (every element of the first set is in the second)
  • {a} ⊆ {a, b, c} ✓
  • {5, 6} ⊆ {1, 2, 3} ✗ (5 and 6 aren't in the second set)

Proper Subsets

A proper subset is stricter: A is a proper subset of B if A is a subset of B and B contains at least one element not in A. We write A ⊂ B.

It's like saying "A is inside B, but they're not identical."

Examples

  • {1, 2} ⊂ {1, 2, 3} ✓ (subset AND 3 is extra)
  • {1, 2} ⊂ {1, 2} ✗ (they're equal, so not proper)

Key Properties

  • Every set is a subset of itself: A ⊆ A
  • The empty set ∅ is a subset of every set: ∅ ⊆ A
  • But A ⊄ A (no set is a proper subset of itself)

Key Takeaway: A subset (⊆) allows equality between sets, while a proper subset (⊂) requires the containing set to have strictly more elements.