Scribd
Upload
87 views

Discrete Structure L#1

A set is a collection of unique elements. There are several types of relationships between sets including equal sets which have the same elements, subsets which are sets contained within other sets, and supersets which contain all elements of another set. The cardinality of a set refers to the total number of unique elements it contains. The power set of a set includes all possible subsets of that set.

Uploaded by

Hassan Bhutta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
87 views

Discrete Structure L#1

A set is a collection of unique elements. There are several types of relationships between sets including equal sets which have the same elements, subsets which are sets contained within other sets, and supersets which contain all elements of another set. The cardinality of a set refers to the total number of unique elements it contains. The power set of a set includes all possible subsets of that set.

Uploaded by

Hassan Bhutta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

{SETS}

A set is a collection of objects or elements.

1. Equal Sets:
Two sets A and B can be equal only if each element of set A is also the
element of the set B.
Also, if two sets are the subsets of each other, they contain the same
elements and they are said to be equal.
Example:
When two sets have the same elements, we say they are equal. The
order of the elements does not matter, only that the same elements
are present. For example: {2, 4, 6, 8} and {8, 4, 6, 2}.

2. Subset: Set A is said to be a subset of set B if all the elements of set A


are also present in set B.
In other words, set A is contained inside Set B.
Example:
If set A = {X, Y} and set B = {X, Y, Z}, then A is the subset of B because
elements of A are also present in set B.

3. Superset
In set theory, set A is considered as the superset of B, if all the elements
of set B are the elements of set A.
Example:
If set A = {1, 2, 3, 4} and set B = {1, 3, 4}, we can say that set A is the
superset of B. As the elements of B [1, 3, 4] are in set A.
Superset Symbol:
The superset is represented by using the symbol “⊃”. For example, the
set A is the superset of set B, then it is symbolically it is represented as
A ⊃ B.
4. Proper subset: (The symbol "⊂" means "is a proper subset)
A proper subset of a set A is a subset of A that is not equal to A.
In other words, if B is a proper subset of A, then all elements of B are in
A but A contains at least one element that is not in B.
Example:
If A= {1,3,5} then B= {1,5} is a proper subset of A.

5. Improper subset: (The symbol "⊆" means "is an improper subset)


A subset which contains all the elements of the original set is called an
improper subset.
Example:
Set A = {2,4,6} Then, the subsets of A are: {}, {2}, {4}, {6}, {2,4}, {4,6},
{2,6} and {2,4,6}.
Example:
If B= {2,4,6} (original set)
A= {6,4,2}
Then B is the improper subset of A.

6. Empty/Null Set:
An empty set is a set that contains no elements or no member. It is
denoted as ∅ or {}.
Empty set is also known as null or set void set.
Empty set is a finite set.
Example:
Let A = {x: 9 < x < 10, x is a natural number} then answer will be a null
set because there is NO natural number between numbers 9 and 10.

7. Singleton set:
If a set contains only one element, then it is called a singleton set.
Singleton set is also known as a unit set or one-point set.
The cardinality of a singleton set is one. The singleton set has two
subsets. Null set is a subset of every singleton set. The two subsets of a
singleton set are the null set, and the singleton set itself.
Examples:
A = {x : x ϵ N and x3 = 27} is a singleton set with a single element {3}
{1},{5},{9}.

8. Cardinality of a set: (cardinality is represented as |A| or n(A) or #A)


The cardinality of a set is the total number of unique elements in a set.
Example:
If A has only a finite number of elements, its cardinality is simply a
number of elements in A.
Example: if A = {2,4,6,8,10}, then |A|=5.
D= ∅ then cardinality of D = 0.

9. Power set: (Power set is represented as P(A) )


A set containing all the subsets of a set, the set itself and the empty set
is called power set.
Formula of power set is 2n. (where ‘n’ is the cardinality of a set)
Example:
A = {1, 2} then power set of A is P(A) = {∅, {1}, {2}, {1, 2}}.
B = ∅ then the power set of B is 1 [(2n) where n = 0 then 20 =1]
C = {∅} then power set of C = 2 [(2n) where n = 1 then 21 =2] {∅, {∅}}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy