0% found this document useful (0 votes)
2 views

function

Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

function

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

WELCOME TO

OUR
PRESENTATION
CALCULUS
• Presentation on - FUNCTION
•Course code : MATH-143
OUR TEAM

MD.Minnatul Islam Nur-E-Jannat Tanni MD.Tawheduzzaman Safayat Razzak Ridom


What is cartesian product??
The Cartesian product X×Y between two sets X and Y is the set of all
possible ordered pairs with first element from X and second element
from Y:

X×Y={(x,y):x∈X and y∈Y}.


SOME EXAMPLE….

• Example 1: • Example 2:
• If A = {1, 2, 3} and B = {3, 4}, find the • If P = {5, 6}, form the set P × P × P.
Cartesian product of A and B.
• Solution:
• Solution: • P × P × P = {5, 6} × {5, 6} × {5, 6}
• Given, • = {(5, 5, 5), (5, 5, 6), (5, 6, 5), (5, 6, 6),
• A = {1, 2, 3} (6, 5, 5), (6, 5, 6), (6, 6, 5), (6, 6, 6)}
• B = {3, 4}
• The Cartesian product of A and B = A ×
B
• = {1, 2, 3} × {3, 4}
• = {(1, 3), (1, 4), (2, 3), (2, 4), (3, 3), (3, 4)}
Properties of cartesian product..
• Some of the important properties of Cartesian products of sets are given below.
(i) Two ordered pairs are equal, if and only if the corresponding first elements are equal and the second elements are also equal.
(ii) If there are m elements in A and n elements in B, then there will be mn elements in A × B. That means if n(A) = m and n(B) = n, then n(A × B) = mn.
(iii) If A and B are non-empty sets and either A or B is an infinite set, then A × B is also an infinite set.
(iv) A × A × A = {(a, b, c) : a, b, c ∈ A}. Here (a, b, c) is called an ordered triplet.
(v) The Cartesian product of sets is not commutative, i.e. A × B ≠ B × A
(vi) The Cartesian product of sets is not associative, i.e. A × (B × C) ≠ (A × B) × C
(vii) If A is a set, then A × ∅ = ∅ and ∅ × A = ∅.
(viii) If A and B are two sets, A × B = B × A if and only if A = B, or A = ∅, or B = ∅.
(ix) Let A, B and C be three non-empty sets, then,
A × (B ∩ C) = (A × B) ∩ (A × C)
A × (B ∪ C) = (A × B) ∪ (A × C)
(A ∩ B) × C = (A × C) ∩ (B × C)
(A ∪ B) × C = (A × C) ∪ (B × C)
What is relation ??
the relation is the relationship between two or more set of values.

Suppose, x and y are two sets of ordered pairs. And set x has relation
with set y, then the values of set x are called domain whereas the values
of set y are called range.

Example: For ordered pairs={(1,2),(-3,4),(5,6),(-7,8),(9,2)}


The domain is = {-7,-3,1,5,9}
And range is = {2,4,6,8}
Diagram Of Relation ..
A set of ordered pairs is defined as a relation

This mapping depicts a relation from set A into set B. A relation from A to B is a subset
of A x B. The ordered pairs are (1,c),(2,n),(5,a),(7,n). For defining a relation, we use the
notation where,
set {1, 2, 5, 7} represents the domain.
set {a, c, n} represents the range
What is open sentence ??
An open sentence in Mathematics is neither true nor false until the variables have been
substituted by specific values. The method of finding the values of variables that result in a true
sentence is known as solving the open sentence.

Example : 1 - y = 8 is an open sentence because the value of ‘y’ is unknown and as a result, we
can state if it is true or false.

The uncertainty that we have about 1- y = 8 is what makes 1- y = 8 an open statement.


Write down the types of relation ??
There are 8 main types of relations which include:

• Empty Relation
• Universal Relation
• Identity Relation
• Inverse Relation
• Reflexive Relation
• Symmetric Relation
• Transitive Relation
• Equivalence Relatio
1.Empty Relation
An empty relation (or void relation) is one in which there is no relation
between any elements of a set.

Example : if set A = {1, 2, 3} then, one of the void relations can be


R = {x, y} where, |x – y| = 8. For empty relation,
R = φ ⊂A×A
2.Universal Relation
A universal (or full relation) is a type of relation in which every element
of a set is related to each other.

Consider set A = {a, b, c}. Now one of the universal relations will be R
= {x, y} where, |x – y| ≥ 0. For universal relation,
R=A×A
3.Identity Relation
In an identity relation, every element of a set is related to itself only.
Example : in a set A = {a, b, c}, the identity relation will be I = {a,
a}, {b, b}, {c, c}. For identity relation,
I = {(a, a), a ∈ A}
4.Inverse Relation
Inverse relation is seen when a set has elements which are inverse pairs
of another set.
Example : if set A = {(a, b), (c, d)}, then inverse relation will be R-1 =
{(b, a), (d, c)}. So, for an inverse relation,
R-1 = {(b, a): (a, b) ∈ R}
5. Reflexive Relation
In a reflexive relation, every element maps to itself.
(a, a) ∈ R

Example :Consider a set A = {1,2,3,4}.


1. R1 = {(1, 1), (2, 2), (1, 2), (2, 1)} (1,2,3 are reflexive relation)
2. R2={ (1, 1), (2, 2), (2, 3), (3, 3) }
3. R3={ (1, 1), (1, 3), (2, 3), (3, 3), (2,2) ,(2, 4), (4,4)}
But
(Not reflexive)
4. R4= { (1, 1), (1, 3), (2, 3) , (3, 3), (3, 2), (4, 4), (4,3)}
Because this relation has no (2,2) pair
6. Symmetric Relation

In a symmetric relation, if a=b is true then b=a is also true.


aRb ⇒ bRa, ∀ a, b ∈ A

Example :consider a set A = {1,2,3,4}.


1. R1 = {(1, 2), (2, 3), (3, 2), (2, 1)}
2. R2={ (1, 4), (2, 2), (4, 1), (3, 2) ,(2,2) ,(2,3) }

Here , R1 And R2 are symmetric relation


7. Transitive Relation

For transitive relation, if (x, y) ∈ R, (y, z) ∈


R, then (x, z) ∈ R. For a transitive relation,
aRb and bRc ⇒ aRc ∀ a, b, c ∈ A

Example-1: if for three elements a, b, c in set A, if a = b


and b = c, then a = c.
Example 2: Let A = { 3, 4, 5 } and R be a relation defined on set A
R = {(3, 4), (4, 5), (3, 5)}. Verify that R is transitive in nature.
Solution: From the given set A, let:
a = 3, b = 4, c = 5
Here, we have;
(a, b) = (3, 4) -> this implies 3 is less than 4.
(b, c) = (4, 5) -> this implies 4 is less than 5.
(a, c) = (3, 5) -> this implies 3 is less than 5.
That is, if 3 is less than 4 and 4 is less than 5, then 3 is less than 5.
8. Equivalence Relation

If a relation is reflexive, symmetric and transitive at


the same time, it is known as an equivalence
relation.
Example of equivalence relation : Consider a set A = {1,2,3,4} and
R= { (1, 1), (1, 3), (1, 4), (2, 2), (2,4) ,(3, 1), (3,3) ,(4, 2) ,(4, 4)}
Show that R is an equivalence relation ?

Solution :

▪R is a reflexive relation as { (1,1) ,(2,2) , (3,3) ,(4,4) } ∈ R


When (a,a) ∈ R

▪R is a Symmetric relation as { (1, 3) ,(2, 4) ,(3, 1) ,(4, 2) } ∈ R


When (a , b) ∈ R then (b , a) ∈ R

▪R is a Transitive relation as (1, 3) ∈ R , (3, 4) ∈ R


Then , (1, 4) ∈ R

So , R as reflexive , symmetric and Transitive relation


Hence , R is a equivalence relation .
Representation of Types of Relations

Relation Type Condition


Empty Relation R = φ⊂A×A
Universal Relation R =A×A
Identity Relation I = {(a, a), a ∈ A}
Inverse Relation R-1 = {(b, a): (a, b) ∈ R}
Reflexive Relation (a, a) ∈ R
Symmetric Relation aRb ⇒ bRa, ∀ a, b ∈ A
aRb and bRc ⇒ aRc ∀ a, b, c ∈
Transitive Relation
A
What is function ??
Functions are relations where each input has a
particular output.

Functions are generally represented as f(x).


Let , f(x) = x3.
It is said as f of x is equal to x cube.
Functions can also be represented by g(), t(),… etc.
Example: Find the output of the function g(t) = 6t2 + 5
at
(i) t = 0
(ii) t = 2

Solution:

The given function is g(t) = 6t2 + 5


(i) At t = 0, g(0) = 6(0)2 + 5 = 5
(ii) At t = 2, g(2) = 6(2)2 + 5 = 29
Distinguish between function and relation??

Differentiating
Parameter Relations Functions
Definition A relation is a relationship A function is a relation with
between sets of values. Or, it only one output for each
is a subset of the Cartesian input.
product

Denotation A relation is denoted by “R” A function is denoted by “F”


or “f”.
Example R = {(2, x), (9, y), (2, z)} F = {(2, x), (9, y), (5, x)}
** It is not a function, as “2”
is input for both x and z.

Note: Every relation is not a Every function is a relation.


function.
Every function are relation but every relation is
not function

All functions are relations, but not all relations are functions. The
difference between a relation and a function is that a relationship can
have many outputs for a single input, but a function has a single input
for a single output.
Example:
R = {(2, x), (9, y), (2, z)}
• It is not a function, as “2” is input for both x and z.
• But it is a relation .
Compare between Relation and Function
Types of function with definition and example ..

1.One-one Function (Injective Function)


A one-to-one function is defined by f: A → B such that every element of
set A is connected to a distinct element in set B. The one-to-one function
is also called an injective function.

(3)

Example-1 : f; R R, given by f(x) = 3x + 5, is one-one.


Example 2:
Let A = {1, 2, 3} and B = {a, b, c, d}. Which of the following
is a one-to-one function?
1.{(1, c), (2, c)(2, c)}
2.{(1, a),(2, b),(3, c)}
3.{(1, b)(1, c)}
The Answer is 2.

Explanation: Here, option number 2 satisfies the one-to-one


condition, as elements of set B(range) are uniquely
mapped with elements of set A(domain).
2. Into function

A many to one function is defined by the function f: A → B, such that


more than one element of the set A are connected to the same element in
the set B.

Example : f : R R, given by f(x) = x2 + 1, is many-one.


3. Onto Function (Surjective Function)
A function defined by f: A → B, such that every element in set B has a
pre-image in set A. The onto function is also called a subjective
function.

Fig -1 ( Range = codomain ) Fig -2 ( Range ≠ codomain )


4. One – One and Onto Function (Bijective)

• A function defined by f: A → B, is one to one function and onto


function if the function F is both one to one and onto function .

(1)
(2)
Compare between Injective , Surjective and
Bijective function …
What is identity function ??
The function f is called the identity function if each element of set A has
an image on itself i.e. f (a) = a
Where a ∈ A. It is denoted by I.

Example -1 : Consider, A = {1, 2, 3, 4, 5} and f: A → A such that. f =


{(1, 1), (2, 2), (3, 3), (4, 4), (5, 5)}.
Example -2 : Prove f(2x) = 2x is an identity
function. Let us draw a table for all values of x.
Solution: Given, f(2x) = 2x
Let us put the values of x in the given function. x -3 -2 -1 0 1 2 3
If x = 1, then; y=f(x) -6 -4 -2 0 2 4 6
f(2(1)) = 2(1) ⇒ f(2) = 2
Let us draw the graph for these values.
If x = 2, then;
f(2(2)) = 2(2) ⇒ f(4) = 4
If x = 3, then;
f(2(3)) = 2(3) ⇒ f(6) = 6
If x = 0, then;
f(2(0)) = 2(0) ⇒ f(0) = 0
Let us try with some negative values of x.
If x =-1, then;
f(2(-1)) = 2(-1) ⇒ f(-2) = -2
If x = -2, then;
f(2(-2)) = 2(-2) ⇒ f(-4) = -4
The function f(2x) = 2x plots a straight line, hence it is an
If x = -3, then; identity function.
f(2(-3)) = 2(-3) ⇒ f(-6) = -6
What is limit ??
A limit tells us the value that a function approaches as that function
inputs get closer and closer to same number .
Let us consider a real-valued function “f” and the real number “c”,
the limit is normally defined as
Properties of Limits …
Sum/Difference Rule: The limit of the sum or difference of two functions is
the sum or difference of their individual limits. In symbols: lim(f(x) ± g(x)) =
lim(f(x)) ± lim(g(x)).
Scalar Multiple Rule: The limit of a constant times a function is the constant
times the limit of the function. In symbols: lim(c * f(x)) = c * lim(f(x)).
Product Rule: The limit of the product of two functions is the product of
their individual limits. In symbols: lim(f(x) * g(x)) = lim(f(x)) * lim(g(x)).
Quotient Rule: The limit of the quotient of two functions is the quotient of
their individual limits, provided the denominator's limit is not zero. In
symbols: lim(f(x) / g(x)) = lim(f(x)) / lim(g(x)), if lim(g(x)) ≠ 0.
Limit of function
If a function f(x) approaches to the fixed number ‘ L ’ as ‘ x’
approaches to a fixed number ‘ c’ then ‘ L’ is called the limit of f(x) ,
and it can be written as

You might also like