Set Theory: Empty Sets, Set Types, Power Sets, and Fundamental Set Operations
The Empty Set and Its Essential Properties
In set theory, the empty set (also referred to as the null set) is defined as a set that contains no elements. It is formally represented by the symbol or by empty curly braces .
Disjoint Sets
When two sets share no common elements, they are described as disjoint sets. Formally, two sets and are disjoint if their intersection yields the empty set:
If two sets possess common elements, they are not disjoint and instead share a non-empty intersection.
Fundamental Properties of the Empty Set
1. Subset Property
The empty set is considered a subset of every given set :
2. Set Operation of Union
The union of any set with the empty set always results in the set itself:
The union operation combines all distinct elements from both sets without repetition.
For example, let set . Combining the elements of with the empty set gives:
3. Set Operation of Intersection
The intersection of any set with the empty set always yields the empty set:
The intersection operation identifies elements that are present in both sets. Since the empty set contains no elements, there can be no elements in common between set and .
For example, given set , searching for common elements between and produces:
4. Cardinality
Cardinality refers to the size of a set, defined as the total number of elements contained within that set. Cardinality is denoted either by enclosement within vertical bars or by the notation .
Because the empty set contains zero elements, the cardinality of an empty set is strictly zero:
For example, if , then
5. Cartesian Product
The Cartesian product of any set and the empty set yields the empty set:
Definition of Cartesian Product
The Cartesian product is a set operation that generates the set of all ordered pairs , where the first component originates from set () and the second component originates from set ():
For example, given set and set , the Cartesian product pairs each element of with each element of :
Application to Empty Set
When attempting to compute , an ordered pair requires a second component . Because the empty set contains no elements to serve as a second component, no ordered pairs can be formed. Consequently, the resulting set contains no elements:
Finite and Infinite Sets
Sets are categorized based on whether their elements can be completely counted.
Definitions
Finite Set: A set containing a countable number of elements, possessing a distinct beginning and end.
Infinite Set: A set containing an uncountable or endless number of elements.
Classifications and Examples
A set with a fixed, explicitly listed list of items has a countable ending and is finite.
A set that extends indefinitely without an ending point is infinite.
A set consisting of all integers strictly greater than is represented in listing notation as:
The presence of the trailing ellipsis () indicates that the sequence continues indefinitely. Therefore, this set is infinite.
Any set whose elements are listed with an ellipsis showing non-ending continuation is classified as an infinite set.
Cardinality Analysis Across Number Domains
For finite sets, cardinality is expressed as a non-negative integer. For infinite sets, cardinality is infinite ().
Example 1: Standard Finite Set
Let be the set of letters in the English alphabet. The cardinality is:
Example 2: Continuous Real Number Sets
Consider set defined in set-builder notation as:
Because is defined over the set of real numbers , this range includes all rational numbers, irrational numbers, and intermediate decimals (e.g., , , ). Between any two real numbers, infinitely many real numbers exist. Consequently, the cardinality of set is infinite:
Example 3: Discrete Integer Sets
Consider set defined over the domain of integers within the same open interval:
Converting set from set-builder notation to the listing method yields:
Counting these individual discrete integer elements gives a cardinality of:
Example 4: Half-Open Interval Analysis
Consider set defined as:
Because is defined over the real numbers , the half-open interval contains infinitely many values. Thus:
However, if the domain of set is redefined to be the set of integers :
Converting from set-builder notation to the listing method requires selecting integers strictly greater than (excluding ) up to and including (due to the inequality):
Counting the listed elements yields a cardinality of:
Converting set-builder notation into the listing method provides a clear step-by-step verification technique for determining set cardinality.
Equal, Equivalent, Universal Sets, and Subsets
Equal vs. Equivalent Sets
Equal Sets: Two sets and are equal () if and only if they contain exactly the same elements, regardless of order.
Equivalent Sets: Two sets and are equivalent ( or ) if and only if they have the exact same number of elements—that is, equal cardinality:
All equal sets are inherently equivalent, but equivalent sets are not necessarily equal.
Universal Set
The universal set (denoted ) is the totality of all elements under consideration for a given context or problem. It acts as the overarching parent set from which subsets are drawn.
Example of a Universal Set
Given the following individual sets:
The universal set comprising the totality of all elements present in , , and is:
Each individual set (, , and ) is a subset of
Subsets and Supersets
Given two sets and , is a subset of (written ) if and only if every element contained in is also an element of .
When , set is termed the superset of set (written ).
For example, if and , every element of is present inside . Thus, and
Proper Subsets vs. Improper Subsets
Subsets are partitioned into two distinct categories: proper subsets and improper subsets.
1. Proper Subsets
A proper subset of a set is a subset such that and . That is, contains elements of , but excludes at least one element of . Proper subsets are denoted by:
For any non-empty given set, the empty set is strictly included as a proper subset.
2. Improper Subsets
An improper subset is a subset that contains all the original elements of the given set; it is identical to the set itself:
Every set has exactly one improper subset—itself.
Exceptional Case: Subsets of the Empty Set
If the original given set is itself the empty set :
The empty set as a subset contains all elements of the original set .
Consequently, for an empty original set, is classified as an improper subset (the set itself) and is not counted as a proper subset.
Power Sets and Subset Enumeration
Definition and Formula
The power set of a set , denoted , is defined as the set of all possible subsets of .
The total number of subsets (the cardinality of the power set) for a set containing elements is calculated using the formula:
Where is the number of elements in the given set.
Comprehensive Step-by-Step Power Set Construction
Consider the set .
Determine Element Count ():
Calculate Total Subsets:
Systematically List All Subsets:
Subsets with 0 elements (Empty Set):
Subsets with 1 element (Singletons):
Subsets with 2 elements (Pairs):
Subsets with 3 elements (Full Set):
Combine into the Power Set :
Categorize Subsets:
Proper Subsets (7 total):
Improper Subset (1 total):
Fundamental Set Operations
1. Union of Sets
The union of two sets and (denoted ) is the set of all elements that belong to set , to set , or to both sets. Elements are combined without repetition.
Key Logical Associative Word: OR
Set-Builder Form:
Example of Union
Let set and set . The union combining all unique elements from both sets is:
2. Intersection of Sets
The intersection of two sets and (denoted ) is the set containing only the elements that are simultaneously present in both set and set
Key Logical Associative Word: AND
Set-Builder Form:
Example of Intersection
Given set and set , identifying elements shared by both sets yields: