Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
2 views

Module 3 - Relations and Functions

Uploaded by

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

Module 3 - Relations and Functions

Uploaded by

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

Relations and

Functions
Exploring one of many fundamentals
of Mathematics
Learning Objectives
• define and give examples of relations
• define a function between sets and the image and inverse image of
subsets of the domain and codomain, resp.
• determine domain and range of a relation/function
• prove statements combining the concepts of the image and inverse
image of subsets of the domain and codomain, and composition of, or
injective, surjective, or bijective functions.
Introduction

Relations and functions are key topics in algebra. A


relation represents a connection between input and
output, while a function is a special type of relation
where each input has exactly one output.
Function
A function is a specific type of relation where each
input has exactly one corresponding output. In other
words, it is a set of ordered pairs that follows the rule
that every x-value is associated with only one y-value.
Types of Functions
In terms of relations, we can define the types of
functions as:
1. One to one function or Injective function
2. Many to one function
3. Onto Function or Surjective function
4. One-one correspondence or Bijective function
Types of Functions
1. One to one function or Injective
function
- A function f: P → Q is said to be
one to one if for each element of P
there is a distinct element of Q.
Types of Functions
2. Many to One Function
- A function which maps two or
more elements of P to the same
element of set Q.
Types of Functions
3. Onto Function or Surjective
Function
- A function for which every element
of set Q there is pre-image in set P.
Types of Functions
4. One to One Correspondence
or Bijective Function
- The function f matches with
each element of P with a
discrete element of Q and
every element of Q has a pre-
image in P.
Types of Functions
Identify whether each function is an injective, many
to one, surjective, or bijective function.

1. f(x) = x2
2. f(x) = 2x + 3
3. f(x) = x3
4. f(x) = 2x + 3
5. f(x) = x + 5
Relation
It is a subset of the Cartesian product, consisting of a
set of ordered pairs. In simpler terms, a relation
between two sets is a collection of ordered pairs,
where each pair consists of one element from each set.
Example: {(−2,1),(4,3),(7,−3)}
typically represented in set notation using curly
brackets.
Types of Relations
Empty Relations
Universal Relations
Identity Relations
Inverse Relations
Reflexive Relations
Symmetric Relations
Transitive Relations
Types of Relations
Empty Relation
If no element of set X is related or mapped to any
element of Y, the relation R in A is called an empty
relation or void relation, meaning R=∅.
Types of Relations
Empty Relation
Example: Let A={1, 2, 3}.
The relation R on A is empty if: R=∅.
No pairs (x,y) exist in R.
Example in real life: A relation "is a parent of" on a set
of students in the same class (students can't be parents
of each other).
Types of Relations
Universal Relation
If no element of set X is related or mapped to any
element of X, the relation R in A is called an empty
relation or void relation, meaning R=∅.
Types of Relations
Universal Relation
Example: Let A={1,2,3}.
The universal relation is: R={(1,1),(1,2),(1,3),(2,1),(2,2),
(2,3),(3,1),(3,2),(3,3)} Example in real life: The relation
"is less than or equal to" (≤) on the set of all real
numbers.
Types of Relations
Identity Relation
If every element of set A is related to itself only, it is
called Identity relation.
I={(A, A), ∈ a}.
Types of Relations
Identity Relation
Example: If A={1,2,3},
the identity relation is: R={(1,1),(2,2),(3,3)
Example in real life: The relation "is the same person
as" in a group of people.
Types of Relations
Inverse Relation
If R is a relation from set A to set B i.e., R ∈ A X B. The
relation R-1= {(b,a):(a,b) ∈ R}.
Types of Relations
Inverse Relation
Example:Let R={(1,2),(3,4)}, then the inverse is:
R−1={(2,1),(4,3)}
Example in real life: If "is the parent of" is a relation,
the inverse relation is "is the child of."
Types of Relations
Reflexive Relation
A relation is a reflexive relation iIf every element of set
A maps to itself, i.e for every a ∈ A, (a, a) ∈ R.
Types of Relations
Reflexive Relation
Example: Let A={1,2,3}, the reflexive relation must
include: R={(1,1),(2,2),(3,3),(1,2),(2,3)}(at least self-
pairs)
Example in real life: "is equal to" (===) on a set of
numbers.
Types of Relations
Symmetric Relation
A symmetric relation is a relation R on a set A if (a, b) ∈
R then (b, a) ∈ R, for all a & b ∈ A.
Types of Relations
Symmetric Relation
Example: Let R={(1,2),(2,1),(3,3)}, since for every (a,b)
(a,b)(a,b) there is (b,a)(b,a)(b,a), it is symmetric.
Example in real life: "is a sibling of" (if A is a sibling of B,
then B is a sibling of A).
Types of Relations
Transitive Relation
If (a, b) ∈ R, (b, c) ∈ R, then (a, c) ∈ R, for all a,b,c ∈ A
and this relation in set A is transitive.
Types of Relations
Transitive Relation
Example: Let R={(1,2),(2,3),(1,3)}.
Since (1,2)(1,2)(1,2) and (2,3)(2,3)(2,3) lead to (1,3)(1,3)
(1,3), it is transitive.
Example in real life: "is an ancestor of" (if A is an
ancestor of B, and B is an ancestor of C, then A is an
ancestor of C).
Types of Relations
Equivalence Relation
If a relation is reflexive, symmetric and transitive, then
the relation is called an equivalence relation.
Types of Relations
Equivalence Relation
Example: Let A={1,2,3}, and define relation R as: R={(1,1),(2,2),
(3,3),(1,2),(2,1)
Reflexive: (1,1),(2,2),(3,3)(1,1), (2,2), (3,3)(1,1),(2,2),(3,3) are
present.
Symmetric: (1,2)(1,2)(1,2) implies (2,1)(2,1)(2,1), so it is
symmetric.
Transitive: (1,2)(1,2)(1,2) and (2,1)(2,1)(2,1) lead to (1,1)(1,1)
(1,1), maintaining transitivity.
Example in real life: "is congruent to" in geometry, where two
triangles being congruent satisfies all three conditions.
Sample Problem
1. Let A={ 1, 2, 3, 4 }. A relation R is defined on A such that:
R={ ( x, y) ∣ x + y = 10, x, y ∈ A }.
Determine whether R is an empty relation and justify your answer.

2. Let A = { a, b, c }. Define a universal relation R on A and list all its


elements.

3. Let A = { 1, 2, 3, 4, 5 }, and define the relation R such that:


R = { ( x, y) ∣ x = y2, x, y ∈ A }
(a) Write the elements of R.
(b) Is R an identity relation?
Sample Problems
4. A relation R on A = { 1, 2, 3, 4 } is defined as:
R={ ( 1, 2), ( 2, 3), ( 3, 4), ( 4, 1) }
(a) Find R−1.
(b) Show whether R is symmetric by comparing R and R −1.

5. Let A = { 1, 2, 3 } and define a relation R by:


R= { ( x, y ) ∣ x + y is even ,x , y ∈ A }
Is R reflexive?
Sample Problems
6. A relation R on A = { 1, 2, 3 } is given as:
R = { ( 1, 2 ), ( 2, 1 ), ( 2, 3 ) }
Is R symmetric?

7. A relation R on A = { a, b, c } is given as:


R={ ( a, b ), ( b, c ), ( a, c ) }
Is R transitive?

8. A relation R on A = { 1, 2, 3, 4 } is defined by:


R={ ( x, y ) ∣ x ≡ y ( mod2 ) }
(a) Show that R is reflexive, symmetric, and transitive.
Sample Problems
Reflexive: x≡x(mod2), so (x,x) ∈ for all x.
Symmetric: If x≡y(mod2), then y≡x(mod2)
Transitive: If x≡y(mod2), and y≡z(mod2), then x≡z(mod2).
Domain and Range of a function
The domain of a function is the set of values that we
are allowed to plug into our function. This set is the x
values in a function such as f (x).

The range of a function is the set of values that the


function assumes. This set is the values
that the function shoots out after we plug an x value in.
They are the y values
Domain and Range of a function
The domain of a function refers to the set of values of x
that can be used as inputs. Some functions have
restrictions on which values are allowed.

For instance, consider the function:


f (x) = 1/x
Domain and Range of a function
There are two main ways to write domains: interval
notation and set notation.

Interval notation used parenthesis or brackets to imply


where the function is defined. In the
case of our example, we would write our domain using
interval notation in the following way:
D : (−∞, 0) ∪ (0, ∞)
Domain and Range of a function
There are two main ways to write domains: interval
notation and set notation.

Set notation uses sets to say explicitly where the


function is or isn’t defined. For instance, for our
example we would use set notation in the following
way:
D : {x|x ≠ = 0}.
Domain and Range of a function
Example 1:
g(x) = (6x − 2)/(3x – 4). Find the domain and range of
the function.
Domain and Range of a function
Example 1:
g(x) = (6x − 2)/(3x – 4). Find the domain and range of
the function.
We just solved where our function is not defined. If we
plug x = 4/3 into our function, we get a 0 in the
denominator.
D :(−∞, 4/3) ∪ (4/3, ∞)
D : {x|x ≠ 4/3} .
Domain and Range of a function
Example 1:
g(x) = (6x − 2)/(3x – 4). Find the domain and range of the
function.
To find the range of this function we will have to look at the
graph. There is a horizontal asymptote at y = 2. This can be
calculated by dividing the coefficients of the leading terms of
the numerator and
denominator.
R : (−∞, 2) ∪ (2, ∞)
R : {y|y ≠ 2}.
Domain and Range of a function
Example 2:
h(x) = √(x − 4). Find the domain and range of the function.

Example 3
r(x) = x3 − 4. Find the domain and range of the function.
Inverse of a function
An inverse function or an anti function is defined as a
function, which can reverse into another function. In simple
words, if any function “f” takes x to y then, the inverse of “f”
will take y to x.

If f and g are inverse functions, then f(x) = y if and only if g(y) = x


Inverse of a function
Generally, the method of calculating an inverse is swapping of
coordinates x and y. This newly created inverse is a relation
but not necessarily a function.

The original function has to be a one-to-one function to


assure that its inverse will also be a function.
Types of Inverse function
Types of Inverse function
Inverse Trigonometric Functions

The inverse trigonometric functions are also known as arc


function as they produce the length of the arc, which is
required to obtain that particular value. There are six inverse
trigonometric functions.
Types of Inverse function
Inverse Rational Function
A rational function is a function of form f(x) = P(x)/Q(x) where
Q(x) ≠ 0. To find the inverse of a rational function, follow the
following steps. An example is also given below which can
help you to understand the concept better.
Step 1: Replace f(x) = y
Step 2: Interchange x and y
Step 3: Solve for y in terms of x
Step 4: Replace y with f-1(x) and the inverse of the function is
obtained.
Types of Inverse function
Inverse Hyperbolic Functions

Just like inverse trigonometric functions, the inverse


hyperbolic functions are the inverses of the hyperbolic
functions. There are mainly 6 inverse hyperbolic functions
Types of Inverse function
Inverse Logarithmic Functions and Inverse Exponential
Function

The natural log functions are inverse of the exponential


functions.
Inverse of a function
Example 1:
f(x) = 2x + 5 = y. Find the inverse of f(x).

Suppose, f(x) = 2x + 5 is a function.


Let f(x) = 2x + 5 = y
y = 2x + 5
x = (y-5)/2 = f-1(y)
This is the inverse of f(x).
Inverse of a function
Example 2:
Find the inverse of the function f(x) = ln(x – 2).

First, replace f(x) with y


So, y = ln(x – 2)
Replace the equation in exponential way , x – 2 = ey
Now, solving for x,
x = 2 + ey
Now, replace x with y and thus, f-1(x) = y = 2 + ey
Inverse of a function
Example 3:
Solve: f(x) = 2x + 3, at x = 4
Solution:
We have,
f(4) = 2 (4) + 3
f(4) = 11
Apply for reverse on 11.
f-1(11) = (11 – 3) / 2
f-1(11) = 4
We get 4 again. Therefore, f-1(f(4)) = 4
So, when we apply function f and its reverse f-1 gives the original
value back again, i.e, f-1(f(x)) = x.
Inverse of a function
Example 3:
Find the inverse for the function f(x) = (3x+2)/(x-1).
Composition of Functions
In Math, the composition of a function is an operation where
two functions say f and g generate a new function say h in
such a way that h(x) = g(f(x)). It means here function g is
applied to the function of x. So, basically, a function is applied
to the result of another function.
Composition of Functions
Let f : A → B and g : B → C be two functions. Then the
composition of f and g, denoted by g ∘ f, is defined as the
function g ∘ f : A → C given by g ∘ f (x) = g(f (x)), ∀ x ∈ A.
Composition of Functions
Symbol: It is also denoted as (g∘f)(x), where ∘ is a small circle
symbol. We cannot replace ∘ with a dot (.), because it will
show as the product of two functions, such as (g.f)(x).
Domain: f(g(x)) is read as f of g of x. In the composition of (f o
g) (x) the domain of function f becomes g(x). The domain is a
set of all values which go into the function.
Example: If f(x) = 3x+1 and g(x) = x2 , then f of g of x, f(g(x)) =
f(x2) = 3x2+1.

You might also like