Introduction to Sets in Discrete Mathematics

Learn the fundamentals of sets, cardinality, the empty set, and subsets β€” essential foundations of discrete mathematics.

⬅️ Back to Course Overview

πŸ“š What is Discrete Mathematics?

Discrete Mathematics is the study of mathematical structures that are countable or otherwise distinct and separable β€” such as combinations, graphs, and logical statements. These structures can be finite or infinite.

πŸ”  What are Sets?

A set is an unordered collection of distinct objects, called elements. If an object a belongs to a set A, we write a ∈ A. If not, a βˆ‰ A.

Examples:

Vowels = { a, e, i, o, u }
Students = { Fred, Tom, Mary, Jane }

For infinite or large sets, use ellipsis:

A = {1, 2, 3, 4, 5, ...}

πŸ“ Cardinality of a Set

Cardinality refers to the number of elements in a set. It’s denoted as |A|. Finite sets have natural number cardinality; infinite sets are just referred to as infinite.

🚫 The Empty Set

An empty set contains no elements. It’s written as {} or βˆ…. Note: { βˆ… } is a set with one element β€” the empty set.

πŸ“‚ Subsets

If all elements of set A are in set B, then A βŠ† B. If B has extra elements, A is a proper subset: A βŠ‚ B. If both sets contain exactly the same elements: A = B.

πŸ’‘ Tip: Set theory forms the basis for functions, relations, and logic β€” all foundational in computer science.

πŸ“– Read Full Blog Post

🧠 Quick Quiz: Test Your Understanding of Sets

1. What symbol represents the empty set?


2. Which of these is a valid finite set?


3. If A = {1, 2} and B = {1, 2, 3}, what is true?


4. What does |A| represent?


5. Which symbol means "is an element of"?


6. Which of the following is not a correct set representation?


Celestial Ant
β€œNeed guidance?”