What Does It Mean for a Set Not to Contain the Empty Set?
At a glance
- 1. Check membership
Ask whether the empty set is an element of the set: the relevant statement is ∅ ∉ A.
- 2. Distinguish subset
The empty set is still a subset of every set, even when it is not one of that set’s elements.
- 3. Remove it if needed
If A contains the empty set and you want to exclude it, form A \ {∅}.
“A set without the empty set” most commonly means a set that does not have the empty set as one of its elements. In symbols, the condition is . There is no special standard name for such a set; it is simply a set that does not contain as an element.
The wording can be confusing because “is an element of” and “is a subset of” describe different relationships. The empty set is a subset of every set, but it is not necessarily an element of every set.
Element versus subset
The notation says that is an element, or member, of . The notation says that every element of is also an element of . These are not interchangeable.
For example, let
Neither element of is the empty set, so . But : every element of is in , because the empty set has no elements that could violate this condition.
By contrast, if
then . The empty set is an element of , and it is also a subset of .
Not the same as a nonempty set
A set is nonempty if it has at least one element. In symbols, . That condition does not say whether itself is an element of .
| Set | Is it nonempty? | Is an element? |
|---|---|---|
| No | No | |
| Yes | No | |
| Yes | Yes | |
| Yes | Yes |
The set is a particularly useful example. It contains one element—the empty set—so its cardinality is . The empty set itself contains no elements, so its cardinality is . Thus .
Removing the empty set from a set
If a set may contain and you want a set that excludes it, use set difference:
This removes the element from , if it is present, and leaves all other elements unchanged.
For a concrete example, take . Then
If instead , then was not in to begin with, so
The braces matter: is a set whose only element is . Set difference takes away that element if it occurs in .
A proof that the empty set is a subset of every set
To show , use the definition of subset: every element of must also be an element of . Since has no elements, there is no element that could fail this condition. Therefore for every set .
This includes , so as well. It does not follow that ; that is a separate claim about membership.
Common mistakes
- Confusing and . The statement does not contradict .
- Treating as the empty set. The former has one element; the latter has none.
- Assuming “nonempty” means “does not contain .” A set such as is nonempty and does contain the empty set.
- Reading as removing an empty set of elements. It removes the element from ; the set being subtracted has one element.
When you see the phrase “a set without the empty set,” first check whether it refers to membership, , or to the operation of removing that element, . Neither statement changes the general fact that is a subset of every set.
References
- Paul R. Halmos, Naive Set Theory
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.