0% found this document useful (0 votes)
4 views3 pages

Relations and Functions

Uploaded by

patelshlok240
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
0% found this document useful (0 votes)
4 views3 pages

Relations and Functions

Uploaded by

patelshlok240
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
You are on page 1/ 3

1.

Relations and Cartesian Product


Cartesian Product of Sets
If A and B are two non-empty sets, their Cartesian product is defined as:

A × B = {(a, b) ∣ a ∈ A, b ∈ B}

Example: If A = {1, 2} and B = {a, b}, then

A × B = {(1, a), (1, b), (2, a), (2, b)}

Number of Elements in Cartesian Product


If ∣A∣ = m and ∣B∣ = n, then

∣A × B∣ = m × n

2. Relation
A relation from set A to set B is a subset of A × B . It is represented as R ⊆ A × B.

Types of Relations
1. Empty Relation: No element of A is related to any element of B .
Example: R = ∅.
2. Universal Relation: Every element of A is related to every element of B .
Example: R = A × B.
3. Identity Relation: Each element is related to itself.
Example: R = {(a, a) ∣ a ∈ A}.
4. Inverse Relation: If R is a relation from A to B , then its inverse R−1 is a relation from B to A
given by:

R−1 = {(b, a) ∣ (a, b) ∈ R}


5. Reflexive Relation: If (a, a) ∈ R for every a ∈ A.
Example: R = {(1, 1), (2, 2), (3, 3)}.
6. Symmetric Relation: If (a, b) ∈ R ⇒ (b, a) ∈ R.
Example: R = {(1, 2), (2, 1)}.
7. Transitive Relation: If (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R.
Example: R = {(1, 2), (2, 3), (1, 3)}.
8. Equivalence Relation: A relation that is reflexive, symmetric, and transitive.

3. Functions (Mappings)
A function (or mapping) from set A to set B is a relation in which each element of A has a unique
image in B . It is written as:

f :A→B

Types of Functions
1. One-One Function (Injective): A function f : A → B is one-one if different elements of A
have different images in B .
Example: f (x) = 2x is one-one.
2. Onto Function (Surjective): A function is onto if every element of B has at least one pre-image
in A.
Example: f (x) = x2 from R to [0, ∞) is onto.
3. One-One and Onto (Bijective) Function: A function that is both one-one and onto.
Example: f (x) = x + 1 from R to R is bijective.
4. Constant Function: A function that gives the same output for every input.
Example: f (x) = 5.

4. Important Function Types


1. Identity Function

f (x) = x

Graph: A straight line passing through the origin.

2. Modulus Function

f (x) = ∣x∣
Graph: V-shaped curve.

3. Greatest Integer Function (Floor Function)

f (x) = ⌊x⌋

Graph: Step-wise.

4. Smallest Integer Function (Ceiling Function)

f (x) = ⌈x⌉

5. Signum Function

⎧ 1, x>0
f (x) = ⎨ 0,
​ ​
x=0 ​


−1, x<0

5. Composition of Functions
If f : A → B and g : B → C , then the composition of f and g is defined as:

(g ∘ f )(x) = g(f (x))

You might also like