Mathematics · Ch 1 — Sets
Introduction
Introduction
The Genesis of Set Theory
The concept of a set is the bedrock upon which modern mathematics is built. It is so fundamental that nearly every branch of mathematics — including geometry, sequences, and probability — relies on it. When you study relations and functions later in this book, you will be working with sets at every step.
The theory of sets was pioneered by the German mathematician Georg Cantor (1845–1918). Cantor first encountered sets while investigating problems related to trigonometric series. His work was revolutionary: he showed that the idea of a "collection of objects" could be studied with the same rigour as numbers or shapes, and that this study could resolve deep questions about infinity itself.
Before Cantor, mathematicians treated collections of objects informally. Cantor gave sets a precise logical foundation, which allowed mathematics to handle infinite collections without paradox.
What This Chapter Covers
This chapter introduces the basic definitions and operations that involve sets. You will learn:
- What a set is, and how to write one in roster form or set-builder form
- Special sets: the empty set, and the distinction between finite and infinite sets
- How sets relate to one another: equal sets and subsets
- The universal set, and how Venn diagrams help you visualise sets and their relationships
- How to combine sets: union, intersection, difference, and complement
The entire chapter builds from this single opening idea: a set is a well-defined collection of objects. Every result that follows — every property, every operation — is a logical consequence of that definition.
The word well-defined is crucial. A collection is a set only if you can unambiguously decide whether any given object belongs to it. "The collection of tall students" is not a set (tall is subjective). "The collection of students whose height is greater than 180 cm" is a set.
What to Watch For
The introduction does not contain any properties, theorems, or derivations. It is a short opening that sets the stage. The first named sets — the empty set and finite/infinite sets — appear once you reach Sections 1.3 and 1.4. The first genuinely formal laws you will meet are the Complement Laws and De Morgan's Laws, which appear later, once sets are actually combined and compared.
Do not skip the introduction. Many students jump straight to definitions and formulas, but the historical context and the emphasis on "well-defined" will save you from common mistakes later. When you encounter a question like "Is the collection of all honest people a set?" — the answer is no, because honesty is not well-defined. That distinction comes directly from this opening section.
Recap
- Sets are the foundation of modern mathematics, used in relations, functions, geometry, sequences, probability, and more.
- Set theory was developed by Georg Cantor (1845–1918) while working on trigonometric series.
- This chapter covers basic definitions and operations involving sets.
- The defining characteristic of a set is that it must be well-defined — you must be able to tell, without ambiguity, whether any given object belongs to it.