Sets

1.1 Introduction

The concept of a set is fundamental in modern mathematics and serves as the foundational building block for many mathematical topics. Sets are used extensively in defining relations, functions, geometry, sequences, probability, and various other branches. The theory of sets was developed by the German mathematician Georg Cantor (1845-1918), who first encountered sets while working on problems related to trigonometric series. This chapter introduces the basic definitions and operations involving sets, laying the groundwork for further study in mathematics.

• Sets form the basis of modern mathematical concepts.
• Used to define relations, functions, and other mathematical structures.
• Developed by Georg Cantor in the late 19th century.
• Sets are collections of well-defined objects.
• The chapter covers definitions, representations, and operations on sets.
• 📌 Set: A well-defined collection of distinct objects.
• 📌 Georg Cantor: Mathematician who developed set theory.

1.2 Sets and their Representations

In everyday life, collections of objects such as a pack of cards or a cricket team are familiar. In mathematics, sets are similar collections but must be well-defined, meaning it is possible to determine definitively whether an object belongs to the set or not. Examples include odd natural numbers less than 10, vowels in the English alphabet, prime factors of a number, or solutions to an equation. Special sets like natural numbers (N), integers (Z), rational numbers (Q), and real numbers (R) are frequently used. Sets are denoted by capital letters (A, B, C, etc.), and their elements by small letters (a, b, c, x, y, z). The membership of an element in a set is denoted by the symbol ∈, and non-membership by ∉. Sets can be represented in two main ways: roster (tabular) form and set-builder form. In roster form, all elements are listed within curly braces, separated by commas. In set-builder form, a property common to all elements is used to define the set, written as {x : property of x}. This section includes examples illustrating these representations and explains that order and repetition of elements in roster form are immaterial.

• Sets must be well-defined collections where membership is clear.
• Special sets like N, Z, Q, R are commonly used.
• Membership is denoted by ∈; non-membership by ∉.
• Roster form lists elements explicitly within braces.
• Set-builder form defines sets by a property of elements.
• Order and repetition of elements do not affect the set.
• 📌 Roster form: Listing all elements explicitly.
• 📌 Set-builder form: Defining set by a property of elements.
• 📌 Element: An object belonging to a set.