Scribd
Upload
16 views2 pages

Understanding Set Theory Basics

Set theory defines a set as a collection of distinct objects, represented in roster or set-builder form. There are various types of sets including finite, infinite, null, singleton, universal, equal, equivalent, and subsets. The cardinality of a set refers to the number of elements it contains.

Uploaded by

dibyadarsanmishra45
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views2 pages

Understanding Set Theory Basics

Set theory defines a set as a collection of distinct objects, represented in roster or set-builder form. There are various types of sets including finite, infinite, null, singleton, universal, equal, equivalent, and subsets. The cardinality of a set refers to the number of elements it contains.

Uploaded by

dibyadarsanmishra45
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Set Theory

1. Definition of Set
A set is a well-defined collection of distinct objects or elements. These objects can be
numbers, letters, or even other sets. Sets are usually written using curly brackets { }.

Example: A = {1, 2, 3, 4, 5}

2. Representation of Set
There are mainly two ways to represent a set:

1. Roster or Tabular Form – The elements are listed within curly brackets.
Example: A = {2, 4, 6, 8}

2. Set-builder Form – The property of the elements is described.


Example: A = {x | x is an even number less than 10}

3. Types of Sets
a) Finite Set: A set that has a limited number of elements.

Example: A = {1, 2, 3, 4, 5}

b) Infinite Set: A set that has an unlimited or endless number of elements.

Example: N = {1, 2, 3, 4, 5, ...}

c) Null or Empty Set: A set that has no elements. It is denoted by { } or Ø.

Example: A = {x | x is a natural number less than 1}

d) Singleton Set: A set that has only one element.

Example: A = {5}

e) Universal Set: A set that contains all the elements under consideration.

Example: U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}

f) Equal Sets: Two sets are equal if they have exactly the same elements.

Example: A = {1, 2, 3}, B = {3, 2, 1} → A = B

g) Equivalent Sets: Two sets are equivalent if they have the same number of elements,
even if the elements are different.

Example: A = {1, 2, 3}, B = {a, b, c} → A and B are equivalent sets


h) Subset: A set A is a subset of set B if every element of A is also an element of B. It is
written as A ⊆ B.

Example: A = {1, 2}, B = {1, 2, 3, 4} → A ⊆ B

i) Proper Subset: A set A is a proper subset of B if all elements of A are in B and A ≠ B. It is


written as A ⊂ B.

Example: A = {1, 2}, B = {1, 2, 3} → A ⊂ B

j) Cardinality of a Set: The number of elements in a set is called its cardinality.

Example: A = {2, 4, 6, 8}, then n(A) =|𝐴| = 4

You might also like