The document defines and describes different types of sets including empty, finite, infinite, equal, and equivalent sets. It also explains some basic set operations such as union, complement, and Cartesian product. Specifically, an empty set contains no elements, a finite set has a countable number of members, an infinite set cannot be counted or represented in roster form, equal sets have the same elements and number of elements, and equivalent sets have the same cardinality.

1. Welcome
Set Function

2. What is it?
A Set is an unordered
collection of objects,
known as elements or
members of the set.
An element ‘a’ belong to
a set A can be written
as ‘a ∈ A’, ‘a ∉ A’
denotes that a is not an
element of the set A.

3. Empty Set.
Finite Set.
Infinite Set.
Equal Set.
Equivalent Set.

4. Empty Set
An empty set is a
set that does not
contain any
elements. It is
denoted as {0}. An
empty set can be
denoted as {}.

5. Finite Set
Finite sets are
the sets
having a
finite/countabl
e number of
members.

6. Infinite Set
If a set is not finite, it is
called an infinite
set because the number
of elements in that set is
not countable and also we
cannot represent it in
Roster form

7. Equal Set
Two or more sets
are said to be
equal sets if they
have the same
elements and the
same number of
elements

8. Equivalent Set
Two sets A and B are said
to be equivalent if they
have the same cardinality
i.e. n(A) = n(B).
In general, we can say, two
sets are equivalent to each
other if the number of
elements in both the sets is
equal.

9. Operation on Sets
Union of set
Complement of set
Cartesian product of set

10. Union of set
• The union of a
collection of sets is the
set of all elements in
the collection. It is one
of the fundamental
operation through
which sets can be
combined each other.

12. The Cartesian Product of
sets A and B is defined
as the set of all ordered
pairs (x, y) such that x
belongs to A and y
belongs to B.
Cartesian Product