DSCR MIDTERM REVIEWER Terms Related to Relations and

Functions
Relations & Functions To better understand the concepts related
What are relations and functions? to relations and functions, go through a
● Relations and functions are used few associated terms.
to portray the correspondence
between two sets such that they ● Cartesian Product:
are in the ordered pair form. For two non-empty sets, P and Q,
● Consider an ordered pair (INPUT, the cartesian product is the set of
OUTPUT) to understand the all ordered pairs of elements from
difference between relation and P and Q.
function. Then the relation is all ● Domain:
about the relationship between the A set in which the elements are the
input and output, whereas the first elements of the ordered pair in
function determines one output for a relation R from a set A to B is
every input. known as the domain of the
relation R. It is the set of inputs.
Note: All functions are relations, but ● Range:
not all relations are functions. A set in which the elements are the
second element of the ordered pair
in a relation R from a set A to B is
known as the range of the relation
R. It is the set of outputs.
● Codomain:
A codomain is the whole set Q
related to R from set P to Q

RELATION
It is a subset of the Cartesian product. Or
simply, a bunch of points (ordered pairs).
In other words, the relation between the
two sets is defined as the collection of the
ordered pair, in which the ordered pair is
RELATIONS formed by the object from each set.
Any set of ordered pair numbers in
mathematics is a relation. Relation, in Example: {(-2, 1), (4, 3), (7, -3)}, usually
other words, is a bunch of ordered pairs. written in set notation form with curly
Relations and functions can be brackets
represented in various forms such as set
builder, graphical, roster, and tabular.

FUNCTIONS
A function is defined as a rule that relates
every element of the domain to every
element of the range. Here, the domain
and range both are sets.
FUNCTIONS ● Transitive Relation - A relation R
A function is a relation which describes is transitive if and only if (a, b) ∈ R
that there should be only one output for and (b, c) ∈ R ⇒ (a, c) ∈ R for a,
each input (or) we can say that a special b, c ∈ A
kind of relation (a set of ordered pairs), ● Equivalence Relation - A relation
which follows a rule i.e., every X-value R defined on a set A is said to be
should be associated with only one an equivalence relation if and only
y-value is called a function. if it is reflexive, symmetric and
transitive.

TYPES OF FUNCTION
● One-to-One Function - A function
f: A → B is said to be one-to-one if
each element of A is mapped to a
TYPES OF RELATION distinct element of B. It is also
● Empty Relation - A relation is an known as Injective Function.
empty relation if it has no ● Onto Function - A function f: A →
elements, that is, no element of set B is said to be onto, if every
A is mapped or linked to any element of B is the image of some
element of A. It is denoted by R = element of A under f, i.e, for every
∅. b ∈ B, there exists an element a in
● Universal Relation - A relation R A such that f(a) = b. A function is
in a set A is a universal relation if onto if and only if the range of the
each element of A is related to function = B.
every element of A, i.e., R = A × A. ● Many to One Function - A many
It is called the full relation. to one function is defined by the
● Identity Relation - A relation R on function f: A → B, such that more
A is said to be an identity relation if than one element of the set A are
each element of A is related to connected to the same element in
itself, that is, R = {(a, a) : for all a the set B.
∈ A} ● Bijective Function - A function
● Inverse Relation - Define R to be that is both one-to-one and onto
a relation from set P to set Q i.e., R function is called a bijective
∈ P × Q. The relation R-1 is said function.
to be an Inverse relation if R-1 ● Constant Function - The constant
from set Q to P is denoted by R-1 function is of the form f(x) = K,
= {(q, p): (p, q) ∈ R}. where K is a real number. For the
● Reflexive Relation - A binary different values of the domain(x
relation R defined on a set A is value), the same range value of K
said to be reflexive if, for every is obtained for a constant function.
element a ∈ A, we have aRa, that ● Identity Function - An identity
is, (a, a) ∈ R. function is a function where each
● Symmetric Relation - A binary element in a set B gives the image
relation R defined on a set A is of itself as the same element i.e., g
said to be symmetric if and only if, (b) = b ∀ b ∈ B. Thus, it is of the
for elements a, b ∈ A, we have form g(x) = x.
aRb, that is, (a, b) ∈ R, then we
must have bRa, that is, (b, a) ∈ R
 ● Algebraic functions are based on
the degree of the algebraic Let : 𝑓(𝑥) = x2 + 4x + 3
expression. The important 𝑔(𝑥) = x + 3
algebraic functions are linear Find: (𝑓-𝑔)(1)
function, objective functions,
quadratic function, cubic function,
polynomial function.

Important Notes on Relation and

Function
● Relations and functions define a
mapping between two sets (Inputs
and Outputs) such that they have
ordered pairs of the form (Input,
Output).
● Relations and functions can be Let : 𝑓(𝑥) = x2 + 4x + 3
represented in different forms such 𝑔(𝑥) = x + 3
as arrow representation, algebraic Find: (𝑓• 𝑔)(-1)
form, set-builder form, graphically,
roster form, and tabular form.
● All functions are relations but all
relations are not functions.

ALGEBRA OF FUNCTIONS
If f and g are functions, and x is an
element of the domain of each function,
then
Let : 𝑓(𝑥) = x2 + 4x + 3
𝑔(𝑥) = x + 3

Let : 𝑓(𝑥) = x2 + 4x + 3
𝑔(𝑥) = x + 3
Find: (𝑓+ 𝑔)(2)
 Let : 𝑓(𝑥) = x2 –x
𝑔(𝑥) = x + 5
Find: (𝑔∘ 𝑓)(2)

Let : 𝑓(𝑥) = x2 + 10x -11

𝑔(𝑥) = x2 + 22

Let : 𝑓(𝑥) = x2 –x
𝑔(𝑥) = x + 5
Find: (𝑓∘ 𝑓)(-1)

Composite Function
The output of one function serves as the
input of another function
(𝑓 ∘ 𝑔)(𝑥) = 𝑓[ 𝑔(𝑥) ]

Let : 𝑓(𝑥) = x2 -17

𝑔(𝑥) = x + 3 Let : 𝑓(𝑥) = x2 –x
Find: (𝑓∘ 𝑔)(𝑥) 𝑔(𝑥) = x + 5
Find: (𝑔∘ 𝑔)(0)

Let : 𝑓(𝑥) = x2 –x
𝑔(𝑥) = x + 5
Find: (𝑓∘ 𝑔)(1) COUNTING PRINCIPLES AND
PROBABILITY
Pigeonhole Principle
if n pigeons are put into m pigeonholes
with n>m , then at least one pigeonhole
must contain more than one pigeon

Counting Principle
1. Sum Rule –
Suppose that an event can be performed
by either of two different procedures, with
m possible outcomes for the first
procedure and n possibilities for the
second. If the two sets of possible Sample Space & Probability
outcomes are disjoint, then, the number of A. Sample Space
possible outcomes for the event is m+n. • Outcome
2. Product Rule – • Sample space
In a sequence of n1 events in which the • Venn diagram / tree diagram
first has m possibilities and the second
event has n2, and the third event has n3, B. Simple and Compound Events
and so forth, the total number of • Event
possibilities of the sequence will be • Simple event (Elementary event)
n1(n2)(n3)…(nk). • Compound event (Composite event)
3. Factorial Notation – n!
4. Permutation – C. Probability
is an arrangement of all or part of a • Classical
number of things in a definite order. The • Empirical
number of permutations of n objects taken • Subjective
r at a time is given by:

5. Combination – is a grouping or
selection of all or part of a number of
things (or objects) without reference to the
arrangement of the things selected. The
number of combinations of n objects taken
r at a time is given by:

Counting Technique