Empty Set, Finite Sets, and Infinite Sets [ English ]

Languages

• English

1. Introduction

In discrete mathematics, sets are classified based on the number of elements they contain. Three fundamental types are:

• Empty Set
• Finite Set
• Infinite Set

Understanding these categories is essential for analyzing set operations, relations, and functions.

2. Empty Set

Definition

An empty set is a set that contains no elements.

Representation

∅   or   {}

Examples

• Set of natural numbers less than 0
• Set of solutions of equation x² + 1 = 0 (in real numbers)

✔ These sets contain no elements.

Properties of Empty Set

• It is a subset of every set:

  ∅ ⊆ A
  

• Cardinality:

  n(∅) = 0
  

3. Finite Set

Definition

A finite set is a set that contains a limited (countable) number of elements.

Representation

A = {1, 2, 3, 4}

Examples

• {2, 4, 6}
• {a, b, c}
• {10, 20, 30, 40}

Cardinality

If a set has n elements:

n(A) = n

Example:

A = {1, 2, 3} → n(A) = 3

Key Characteristics

• Elements can be counted
• Has a definite size
• Ends after a certain number of elements

4. Infinite Set

Definition

An infinite set is a set that contains an unlimited number of elements.

Representation

N = {1, 2, 3, ...}

Examples

• Natural numbers:

  {1, 2, 3, ...}
  

• Even numbers:

  {2, 4, 6, 8, ...}
  

• Integers:

  {..., -2, -1, 0, 1, 2, ...}
  

Key Characteristics

• Elements cannot be completely listed
• Continues indefinitely
• No final element

5. Difference Between Finite and Infinite Sets

6. Important Observations

• Empty set is a finite set with zero elements
• Infinite sets are common in mathematics
• Finite sets are often used in computation and practical problems

7. Summary

• Empty Set (∅): No elements
• Finite Set: Limited number of elements
• Infinite Set: Unlimited number of elements

These classifications help in understanding the structure and behavior of sets in discrete mathematics.