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 ∅\emptyset or by empty curly braces {}\{\}.

Disjoint Sets

When two sets share no common elements, they are described as disjoint sets. Formally, two sets AA and BB are disjoint if their intersection yields the empty set:

A∩B=∅A \cap B = \emptyset

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 AA:

∅⊆A\emptyset \subseteq A

2. Set Operation of Union

The union of any set AA with the empty set always results in the set AA itself:

A∪∅=AA \cup \emptyset = A

The union operation combines all distinct elements from both sets without repetition.

For example, let set A={1,2,3}A = \{1, 2, 3\}. Combining the elements of AA with the empty set ∅\emptyset gives:

{1,2,3}∪∅={1,2,3}=A\{1, 2, 3\} \cup \emptyset = \{1, 2, 3\} = A

3. Set Operation of Intersection

The intersection of any set AA with the empty set always yields the empty set:

A∩∅=∅A \cap \emptyset = \emptyset

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 AA and ∅\emptyset.

For example, given set A={1,2,3}A = \{1, 2, 3\}, searching for common elements between AA and ∅\emptyset produces:

{1,2,3}∩∅=∅\{1, 2, 3\} \cap \emptyset = \emptyset

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 ∣A∣|A| or by the notation n(A)n(A).

Because the empty set contains zero elements, the cardinality of an empty set is strictly zero:

∣∅∣=0|\emptyset| = 0

n(∅)=0n(\emptyset) = 0

For example, if A=∅A = \emptyset, then n(A)=0n(A) = 0

5. Cartesian Product

The Cartesian product of any set AA and the empty set ∅\emptyset yields the empty set:

A×∅=∅A \times \emptyset = \emptyset

Definition of Cartesian Product

The Cartesian product A×BA \times B is a set operation that generates the set of all ordered pairs (x,y)(x, y), where the first component xx originates from set AA (x∈Ax \in A) and the second component yy originates from set BB (y∈By \in B):

A×B={(x,y)∣x∈A and y∈B}A \times B = \{(x, y) \mid x \in A \text{ and } y \in B\}

For example, given set A={1,2}A = \{1, 2\} and set B={a,b}B = \{a, b\}, the Cartesian product A×BA \times B pairs each element of AA with each element of BB:

A×B={(1,a),(1,b),(2,a),(2,b)}A \times B = \{(1, a), (1, b), (2, a), (2, b)\}

Application to Empty Set

When attempting to compute A×∅A \times \emptyset, an ordered pair (x,y)(x, y) requires a second component y∈∅y \in \emptyset. 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:

A×∅=∅A \times \emptyset = \emptyset

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

  1. A set with a fixed, explicitly listed list of items has a countable ending and is finite.

  2. A set that extends indefinitely without an ending point is infinite.

  3. A set consisting of all integers strictly greater than 1010 is represented in listing notation as:

{11,12,13,14,… }\{11, 12, 13, 14, \dots\}

The presence of the trailing ellipsis (…\dots) indicates that the sequence continues indefinitely. Therefore, this set is infinite.

  1. 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 (∞\infty).

Example 1: Standard Finite Set

Let AA be the set of letters in the English alphabet. The cardinality is:

n(A)=26n(A) = 26

Example 2: Continuous Real Number Sets

Consider set CC defined in set-builder notation as:

C={x∣x∈R and −10<x<10}C = \{x \mid x \in \mathbb{R} \text{ and } -10 < x < 10\}

Because xx is defined over the set of real numbers R\mathbb{R}, this range includes all rational numbers, irrational numbers, and intermediate decimals (e.g., 0.10.1, 0.0010.001, 0.000010.00001). Between any two real numbers, infinitely many real numbers exist. Consequently, the cardinality of set CC is infinite:

n(C)=∞n(C) = \infty

Example 3: Discrete Integer Sets

Consider set PP defined over the domain of integers Z\mathbb{Z} within the same open interval:

P={x∣x∈Z and −10<x<10}P = \{x \mid x \in \mathbb{Z} \text{ and } -10 < x < 10\}

Converting set PP from set-builder notation to the listing method yields:

P={−9,−8,−7,−6,−5,−4,−3,−2,−1,0,1,2,3,4,5,6,7,8,9}P = \{-9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}

Counting these individual discrete integer elements gives a cardinality of:

n(P)=19n(P) = 19

Example 4: Half-Open Interval Analysis

Consider set DD defined as:

D={x∣x∈R and 3<x≤5}D = \{x \mid x \in \mathbb{R} \text{ and } 3 < x \le 5\}

Because DD is defined over the real numbers R\mathbb{R}, the half-open interval (3,5](3, 5] contains infinitely many values. Thus:

n(D)=∞n(D) = \infty

However, if the domain of set DD is redefined to be the set of integers Z\mathbb{Z}:

D={x∣x∈Z and 3<x≤5}D = \{x \mid x \in \mathbb{Z} \text{ and } 3 < x \le 5\}

Converting from set-builder notation to the listing method requires selecting integers strictly greater than 33 (excluding 33) up to and including 55 (due to the ≤\le inequality):

D={4,5}D = \{4, 5\}

Counting the listed elements yields a cardinality of:

n(D)=2n(D) = 2

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 AA and BB are equal (A=BA = B) if and only if they contain exactly the same elements, regardless of order.

  • Equivalent Sets: Two sets AA and BB are equivalent (A≈BA \approx B or A∼BA \sim B) if and only if they have the exact same number of elements—that is, equal cardinality:

n(A)=n(B)n(A) = n(B)

All equal sets are inherently equivalent, but equivalent sets are not necessarily equal.

Universal Set

The universal set (denoted UU) 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:

  • A={1,2,3}A = \{1, 2, 3\}

  • B={1,3,4}B = \{1, 3, 4\}

  • C={5,6}C = \{5, 6\}

The universal set UU comprising the totality of all elements present in AA, BB, and CC is:

U={1,2,3,4,5,6}U = \{1, 2, 3, 4, 5, 6\}

Each individual set (AA, BB, and CC) is a subset of UU

Subsets and Supersets

Given two sets AA and BB, AA is a subset of BB (written A⊆BA \subseteq B) if and only if every element contained in AA is also an element of BB.

When A⊆BA \subseteq B, set BB is termed the superset of set AA (written B⊇AB \supseteq A).

For example, if A={p}A = \{p\} and B={a,b,c,d,p}B = \{a, b, c, d, p\}, every element of AA is present inside BB. Thus, A⊆BA \subseteq B and B⊇AB \supseteq A

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 BB is a subset AA such that A⊆BA \subseteq B and A≠BA \neq B. That is, AA contains elements of BB, but excludes at least one element of BB. Proper subsets are denoted by:

A⊂BA \subset B

For any non-empty given set, the empty set ∅\emptyset 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:

A⊆AA \subseteq A

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 ∅\emptyset:

  • The empty set ∅\emptyset as a subset contains all elements of the original set ∅\emptyset.

  • Consequently, for an empty original set, ∅\emptyset 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 AA, denoted P(A)P(A), is defined as the set of all possible subsets of AA.

The total number of subsets (the cardinality of the power set) for a set containing nn elements is calculated using the formula:

Total Subsets=2n\text{Total Subsets} = 2^n

Where n=n(A)n = n(A) is the number of elements in the given set.

Comprehensive Step-by-Step Power Set Construction

Consider the set J={a,4,b}J = \{a, 4, b\}.

  1. Determine Element Count (nn):

n=3n = 3

  1. Calculate Total Subsets:

Total Subsets=23=8\text{Total Subsets} = 2^3 = 8

  1. Systematically List All Subsets:

    • Subsets with 0 elements (Empty Set):      ∅\emptyset

    • Subsets with 1 element (Singletons):      {a},{4},{b}\{a\}, \{4\}, \{b\}

    • Subsets with 2 elements (Pairs):      {a,4},{a,b},{4,b}\{a, 4\}, \{a, b\}, \{4, b\}

    • Subsets with 3 elements (Full Set):      {a,4,b}\{a, 4, b\}

  2. Combine into the Power Set P(J)P(J):

P(J)={∅,{a},{4},{b},{a,4},{a,b},{4,b},{a,4,b}}P(J) = \left\{ \emptyset, \{a\}, \{4\}, \{b\}, \{a, 4\}, \{a, b\}, \{4, b\}, \{a, 4, b\} \right\}

  1. Categorize Subsets:

    • Proper Subsets (7 total):      ∅,{a},{4},{b},{a,4},{a,b},{4,b}\emptyset, \{a\}, \{4\}, \{b\}, \{a, 4\}, \{a, b\}, \{4, b\}

    • Improper Subset (1 total):      {a,4,b}\{a, 4, b\}

Fundamental Set Operations

1. Union of Sets

The union of two sets AA and BB (denoted A∪BA \cup B) is the set of all elements that belong to set AA, to set BB, or to both sets. Elements are combined without repetition.

  • Key Logical Associative Word: OR

  • Set-Builder Form:

A∪B={x∣x∈A or x∈B}A \cup B = \{x \mid x \in A \text{ or } x \in B\}

Example of Union

Let set A={a,b,c}A = \{a, b, c\} and set B={b,c,d}B = \{b, c, d\}. The union combining all unique elements from both sets is:

A∪B={a,b,c,d}A \cup B = \{a, b, c, d\}

2. Intersection of Sets

The intersection of two sets AA and BB (denoted A∩BA \cap B) is the set containing only the elements that are simultaneously present in both set AA and set BB

  • Key Logical Associative Word: AND

  • Set-Builder Form:

A∩B={x∣x∈A and x∈B}A \cap B = \{x \mid x \in A \text{ and } x \in B\}

Example of Intersection

Given set A={a,b,c}A = \{a, b, c\} and set B={a,c,d}B = \{a, c, d\}, identifying elements shared by both sets yields:

A∩B={a,c}A \cap B = \{a, c\}