Definition of Sets

Definition

A set is a well-defined collection of distinct objects, called elements or members, considered as a single entity.

Well-defined

means that it must be clear whether an object belongs to the collection or not.

Distinct

means repeated elements are not counted more than once.
The objects in a set can be anything: numbers, letters, symbols, people, or even other sets.

For example:

$\{1, 2, 3\}$ is a set of numbers.
$\{x, y, z\}$ is a set of letters.
$\{red, blue, green\}$ is a set of colors.

If an object $a$ belongs to a set $A$ , we write: $a \in A$ If $a$ does not belong to $A$ , we write: $a \notin A$

A set must have a clearly defined rule of membership. For example:

The collection of “all even numbers less than 10” is a set because membership is clear.
The collection of “beautiful songs” is not a set in mathematics because “beautiful” is subjective and not well-defined.

Main Content

1. Elements and Membership of a Set

A set is made up of individual objects called elements or members.
Membership tells whether an object belongs to a set or not, using the symbols $\in$ and $\notin$ .

If: $A = \{2, 4, 6, 8\}$ then:

$4 \in A$ because 4 is an element of $A$
$5 \notin A$ because 5 is not an element of $A$

Important points about elements:

An element can appear only once in a set.
The order of elements does not matter: $\{1, 2, 3\} = \{3, 2, 1\}$
Elements may be repeated in writing, but repetition is ignored: $\{1, 1, 2, 2, 3\} = \{1, 2, 3\}$

Example:
Let $B = \{a, e, i, o, u\}$ .
Then $e \in B$ , but $b \notin B$ .

2. Ways of Representing a Set

Sets can be represented in different forms depending on the situation.
The two most common methods are roster form and set-builder form.

Roster Form

In roster form, all elements of the set are listed inside curly braces.

Example: $A = \{1, 3, 5, 7, 9\}$

This form is useful when the set has a small number of elements.

Set-Builder Form

In set-builder form, the rule that describes the elements is given.

Example: $A = \{x \mid x \text{ is an odd natural number less than 10}\}$

This means $A$ contains all odd natural numbers less than 10.

Comparison:

Roster form shows elements directly.
Set-builder form shows the rule or property used to define the set.

Example: The set of even numbers less than 10 can be written as:

Roster form: $\{2, 4, 6, 8\}$
Set-builder form: $\{x \mid x \text{ is an even number and } x < 10\}$

3. Types of Sets

Sets are classified into different types based on the number and nature of elements.
Understanding these types is essential for solving problems in set theory.

Empty Set

A set with no elements is called the empty set or null set, written as: $\emptyset \quad \text{or} \quad \{\}$

Example: $S = \{x \mid x \text{ is a prime number less than 2}\}$ Since no prime number is less than 2, $S = \emptyset$ .

Finite Set

A set with a limited number of elements is called a finite set.

Example: $T = \{2, 4, 6, 8\}$

Infinite Set

A set with unlimited or endless elements is called an infinite set.

Example: $N = \{1, 2, 3, 4, 5, \dots\}$ This set continues without end.

Singleton Set

A set containing exactly one element is called a singleton set.

Example: $P = \{7\}$

Equal Sets

Two sets are equal if they contain exactly the same elements.

Example: $\{1, 2, 3\} = \{3, 2, 1\}$

Equivalent Sets

Two sets are equivalent if they have the same number of elements, even if the elements are different.

Example: $A = \{a, b, c\}, \quad B = \{1, 2, 3\}$ These are equivalent because both have three elements.

Working / Process

1. Identify the collection of objects

First, decide what objects are being grouped.
These may be numbers, letters, or any mathematical entities.

2. Check whether the collection is well-defined

Ask whether it is always clear if an object belongs to the collection.
If membership is subjective, it is not a proper mathematical set.

3. Represent the set clearly

Use either roster form or set-builder form.
Then determine the elements, membership, and type of set.

Advantages / Applications

Sets provide a precise language for describing groups of objects in mathematics.
They are used to define and study relations, functions, probability, and logic.
Sets help in organizing data and solving classification problems in computer science and engineering.
They are essential in theorem proving, where statements about collections must be expressed clearly and logically.

Summary

A set is a well-defined collection of distinct objects called elements. It can be written in roster form or set-builder form, and it may be finite, infinite, empty, or singleton. Set theory gives a structured way to describe and analyze collections in mathematics.