Scribd
Upload
29 views5 pages

Example:: The Set of All Natural Number Is

Uploaded by

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

Example:: The Set of All Natural Number Is

Uploaded by

moyazcallback4
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Set:

 A set is a well-defined collection of objects. The objects in a set are called its members or
elements.
 Example: The set of all natural number is N={1,2,3,…}

Representation of Sets:

 Tabular Form: Listing the elements within braces { }, {1,2,3,4,5}


 Set Builder Form: Using a rule to describe the elements,
{x:x∈N and x≤10 and x is odd}

Subset:

Denoted by A ⊆ B.
 If every element of set A is also an element of set B, then A is a subset of B.

Example: Example: Let 𝑍 be the set of all integers and 𝑀 be the set of all even integers,

then 𝑀 is a subset of 𝑍 (𝑀 ⊆ 𝑍 ).

Complement of a set:

 The complement of a set A is the set of elements that do not belong to A.


 Denoted by A'.
 Example: If A={a,b,c} and the universal set U={a,b,c,d,e,f} then A′=U−A={d,e,f}

Cartesian product:

ordered pairs (a, b) where a ∈ 𝐴 and b ∈ B.


 Let A and B too sets. The Cartesian product of sets A and B consists of all possible

Ex: If 𝐴 = { 1 , 2 , 3 } and 𝐵 = { 𝑎 , 𝑏 } , then 𝐴 × 𝐵 = { ( 1 , 𝑎 ) , ( 1 , 𝑏 ) , ( 2 , 𝑎 ) ,


 Denoted by A x B.

(2,𝑏),(3,𝑎),(3,𝑏)}.

De Morgan's Law:

If A and B are any two sets, then,

1. (A U B)' = A' ∩ B'


2. (A ∩ B)' = A' U B'

Sol^n:

Proof of (1):
Let x ∈ (A U B)'

⇒ x ∉ (A U B)

⇒ x ∉ A and x ∉ B

⇒ x ∈ A' and x ∈ B'

⇒ x ∈ A' ∩ B'

Thus, we have shown that x ∈ (A U B)' ⇒ x ∈ A' ∩ B'

Again, let x ∈ A' ∩ B'

⇒ x ∈ A' and x ∈ B'

⇒ x ∉ A and x ∉ B

⇒ x ∉ (A U B)

⇒ x ∈ (A U B)'

Thus, we have shown that x ∈ A' ∩ B'

⇒ x ∈ (A U B)'

Therefore, by the definition of equality of two sets, we have (A U B)' = A' ∩ B' (Proved)

Proof of (2):

Let x ∈ (A ∩ B)'

⇒ x ∉ (A ∩ B)

⇒ x ∉ A or x ∉ B

⇒ x ∈ A' or x ∈ B'

⇒ x ∈ A' U B'

Thus, we have shown that x ∈ (A ∩ B)' ⇒ x ∈ A' U B'


Again, let x ∈ A' U B'

⇒ x ∈ A' or x ∈ B'

⇒ x ∉ A or x ∉ B

⇒ x ∉ (A ∩ B)

⇒ x ∈ (A ∩ B)'

Thus, we have shown that x ∈ A' U B' ⇒ x ∈ (A ∩ B)'

Therefore, by the definition of equality of two sets, we have (A ∩ B)' = A' U B' (Proved)

Relation
◦ Definition: If A and B are two non-empty sets, then a relation from A to B is a subset of A
X B.
◦ Example: Let A = {1, 2, 3} and B = {3, 5}. The relation R from A to B with condition x<y
is
R = {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5)}

2. Equivalence Relation:

 Reflexive: if for each 𝑥 ∈ 𝐴; ( 𝑥 , 𝑥 ) ∈ 𝑅


A relation R on a set A is called

 Symmetric: if ( 𝑥 , 𝑦 ) ∈ 𝑅 ⇒ ( 𝑦 , 𝑥 ) ∈ 𝑅 ∀ 𝑥 , 𝑦 ∈ 𝐴
 Transitive: if ( 𝑥 , 𝑦 ) ∈ 𝑅 and ( 𝑦 , 𝑧 ) ∈ 𝑅 ⇒ ( 𝑥 , 𝑧 ) ∈ 𝑅 ∀ 𝑥 , 𝑦 , 𝑧 ∈ 𝐴
 Antisymmetric: if ( 𝑥 , 𝑦 ) ∈ 𝑅 and ( 𝑦 , 𝑥 ) ∈ 𝑅 ⇒ 𝑥 = 𝑦 ∀ 𝑥 , 𝑦 ∈ 𝐴

A relation which is reflexive, symmetric, and transitive is called an Equivalence Relation.

∀ ------- for all

Problem: Let 𝑅 = { ( 𝑎 , 𝑏 ) ∈ 𝑅 × 𝑅 : 𝑎2 + 𝑏2 = 1 } It is an equivalence relation or not?

(i) Since, 𝑎2 + 𝑏2 = 1
Sol^n:

⇒ 𝑏2 + 𝑎2 = 1
𝑅 is symmetric.

(ii) Since, 1² + 1² ≠ 1. So, (1,1) ∉ R


∴ R is not reflexive.

(iii) Since,

1² + 0² = 1

02 + 12=1.

∴ (1,0) ∈ R & (0,1) ∈ R. but (1,1) ∉ R [in (ii)] ∴ R is not transitive.

Therefore, R is not equivalence relation.

Function

Def^n: Let X and Y be two non-empty sets. Then a rule f which assigns to each element x of X, a
unique element of f(x) of Y is called a function from X to Y and we write f: X → Y

The element f(x) ∈ f associated with the element x ∈ X is called the image of x, while x is
called the pre-image of f(x).

The sets X and Y are known as the domain & codomain of f, while the set f(x) = {f(x): x ∈ X}
consisting of all possible images of elements of X is called the range of the function.

B f Y

1 A
2 B
3 C
4

distinct images in Y. i.e., f is one-one if f(x1) = f(x2) => x1 = x2 where, x1, x2∈ X.
One-one function: A function f: X ---> Y is said to be one-one if distinct elements in X have

Onto function: A function f: X ---> Y is said to be an onto function if every element in Y has at
least one pre-image in X.

Bijective function: A one-one and onto function is said to be a bijective function.

its inverse function. 𝑓-1 : 𝑌 → 𝑋 is defined as 𝑓-1 ( 𝑦 ) = { 𝑥 : 𝑥 ∈ 𝑋 , 𝑓 ( 𝑥 ) = 𝑦 }


Inverse function: Let f be a function which is both one-one and onto defined by f: X -> Y. Then

You might also like