Equal sets and subsets
If two sets describe the same collection, we want to say so. If one set sits inside another, we want a clean notation for that too. This subtopic introduces equality, subset, proper subset, and the intervals of R , the most important examples of subsets you will use this year.
Definitions
Two sets A and B are equal, written A=B, if they have exactly the same elements:
A=B⟺(∀x)(x∈A⟺x∈B).
A is a subset of B, written A⊆B, if every element of A is also an element of B:
A⊆B⟺(∀x)(x∈A⇒x∈B).
A is a proper subset of B, written A⊊B (or A⊂B in some texts), if A⊆B but A=B.
If A⊆B we say B is a superset of A, written B⊇A.
The antisymmetry of ⊆ gives the standard recipe for proving equality:
A=B⟺A⊆B and B⊆A.
Basic facts you must know
- ∅⊆A for every set A. (Vacuously: there is no x∈∅ to check.)
- A⊆A for every set A (reflexivity).
- If A⊆B and B⊆C then A⊆C (transitivity).
- A=B iff A⊆B and B⊆A (antisymmetry).
For finite sets, A⊆B implies ∣A∣≤∣B∣, with equality iff A=B.
Two-way containment in practice
To prove A=B you almost always do it in two steps:
- Take a typical x∈A and show x∈B. This proves A⊆B.
- Take a typical x∈B and show x∈A. This proves B⊆A.
- Conclude A=B.
This double inclusion technique is universal , you will use it in every later chapter from inequalities to probability.
Intervals as subsets of R
The real line is so important that we have a special notation for its subsets:
| Notation | Set-builder | Endpoints |
|---|
| (a,b) | {x:a<x<b} | open–open |
| [a,b] | {x:a≤x≤b} | closed–closed |
| [a,b) | {x:a≤x<b} | closed–open |
| (a,b] | {x:a<x≤b} | open–closed |
| (a,∞) | {x:x>a} | open ray |
| [a,∞) | {x:x≥a} | closed ray |
| (−∞,b) | {x:x<b} | open ray |
| (−∞,b] | {x:x≤b} | closed ray |
| (−∞,∞) | R | the whole line |
Note that ∞ never gets a square bracket , it is not a real number.
Length of a bounded interval (a,b),[a,b],[a,b),(a,b] is b−a in every case.
Worked examples
Example 1. Are A={x∈R:x2=1} and B={−1,1} equal?
The real solutions of x2=1 are exactly ±1. So A={−1,1}=B.
Example 2. Decide A⊆B or not, where A={1,2,3}, B={x∈N:x≤5}.
B={1,2,3,4,5}. Every element of A is in B, so A⊆B. Since 4∈B∖A, the inclusion is proper.
Example 3. Show {x∈R:x2−3x+2=0}={1,2}.
Factor: x2−3x+2=(x−1)(x−2)=0 gives x=1 or x=2. Both are real, so the solution set is {1,2}.
Example 4. Write the set {x∈R:−2≤x<5} as an interval.
This is [−2,5).
Example 5 (harder). Prove that the set of multiples of 6 is a subset of the set of multiples of 3.
Let A={6k:k∈Z} and B={3m:m∈Z}. Take any x∈A. Then x=6k for some k∈Z, so x=3(2k). Since 2k∈Z, we have x∈B. Hence A⊆B. The inclusion is proper because 3∈B∖A.
Try it yourself
- Decide equal or not: A={x∈Z:x2≤4} and B={−2,−1,0,1,2}.
- Decide A⊆B: A={2,4,6} and B={x∈N:x≤10, x even}.
- Write as interval: {x∈R:0<x≤7}.
- Write in set-builder form: (−3,5].
- Show that N⊊Z⊊Q⊊R.
- Find all subsets of {a,b}.
- Is {1,2}⊆{{1,2},3,4}? Explain.
- Decide whether each is true: (a) ∅∈∅; (b) ∅⊆∅; (c) ∅∈{∅}; (d) ∅⊆{∅}.
- Show {x∈R:x=qp, p,q∈Z,q=0}=Q.
- If A⊆B and B⊆A, what can you conclude?
- List all subsets of {1,2,3}. How many are there?
- The set of perfect squares in N is a subset of which familiar sets?
Pitfalls / Tricks
- ∈ vs ⊆. "1∈{1,2}" is true. "{1}∈{1,2}" is false. "{1}⊆{1,2}" is true. Membership and containment are not the same.
- ∅⊆A always , even if you cannot picture it. Use the implication-with-no-instance argument.
- To prove A=B, the double inclusion is the cleanest tool: prove A⊆B and B⊆A separately.
- Insight. Subset is the mathematician's less-than-or-equal-to for sets. It is reflexive, transitive and antisymmetric , exactly the three properties that make ≤ an order on numbers.