Scribd
Upload
11 views6 pages

Chapter 2 - Notes

The document covers the concepts of relations and functions in mathematics, including ordered pairs, Cartesian products, and the definition of relations and functions. It explains the number of relations and functions between sets, as well as various types of functions such as real-valued, identity, constant, and polynomial functions. Additionally, it discusses the algebra of functions and provides definitions for specific functions like exponential and logarithmic functions.

Uploaded by

Maths Club
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
11 views6 pages

Chapter 2 - Notes

The document covers the concepts of relations and functions in mathematics, including ordered pairs, Cartesian products, and the definition of relations and functions. It explains the number of relations and functions between sets, as well as various types of functions such as real-valued, identity, constant, and polynomial functions. Additionally, it discusses the algebra of functions and provides definitions for specific functions like exponential and logarithmic functions.

Uploaded by

Maths Club
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/ 6

THE STUDY L'ECOLE INTERNATIONALE

CLASS 11 - MATHEMATICS
CHAPTER – 2
RELATIONS AND FUNCTIONS
Ordered Pair: An ordered pair consists of two objects or
elements in a given fixed order.
Remarks: An ordered pair is not a set consisting of two
elements. The ordering of two elements in on ordered pair is
important and the two elements need not be distinct.

Equality of Ordered Pair: Two ordered pairs (x1, y1) & (x2, y2)
are equal if x1 = x2 and y1 = y2.
i.e. (x1, y1) = (x2, y2)  x1 = x2 and y1 = y2

Cartesian product of two sets: Cartesian product of two non-


empty sets A and B is given by A × B and A × B = {(x, y) : x  A
and y  B}.

Cartesian product of three sets: Let A, B and C be three sets,


then A × B × C is the set of all ordered triplet having first
element from set A, 2nd element from set B and 3rd element
from set C.
i.e., A × B × C = {(x, y, z) : x  A, y  B and z  c }.

Number of elements in the Cartesian product of two sets: If


n(A) = p and n(B) = q, then n(A × B) = pq.

Relation: Let A and B be two non-empty sets. Then a relation


from set A to set B is a subset of A × B.

No. of relations: If n(A) = p, n(B) = q then no. of relations from


set A to set B is given by 2pq.
Domain of a relation: Domain of R = {a : (a, b)  R}
Range of a relation: Range of R = { b : (a, b)  R}
Co-domain of R from set A to set B = set B.
Range  Co-domain
Relation an a set: Let A be non-empty set. Then a relation from
A to B itself. i.e., a subset of A × A, is called a relation on a set.
Inverse of a relation: Let A, B be two sets and Let R be a
relations from set A to set B.
Then the inverse of R denoted R–1 is a relation from set B to A
and is defined by R–1 = {(b, a) : (a, b)  R}
Function: Let A and B be two non-empty sets. A relation from
set A to set B is called a function (or a mapping or a map). If
each element of set A has a unique image in set B.
Remark: If (a, b)  f then ‘b’ is called the image of ‘a’ under f and
‘a’ is called reimage of ‘b’.
Domain of range of a function: If a function ‘f’ is expressed as
the set of ordered pairs, the domain of ‘f’ is the set of all the first
components of members of f and range of ‘f’ is the set of second
components of member of ‘f’.
i.e., Df = {a : (a, b)  f} and Rf = {b : (a, b)  Df}

No. of functions: Let A and B be two non-empty finite sets such


that n(A) = p and n(B) = q then number of functions from A to B
= qp.

Types of functions

Real valued function: A function f : A  B is called a real


valued function if B is a subset of R (real numbers).

Identity function: f : R  R given by f(x) = x  x  R (real


number)
Here, Df = R and Rf = R

Constant function: f : R  R given by f(x) = c for all x  R


where c is any constant
Here, Df = R and Rf = {c}
Modulus function: f : R  R given by f(x) = |x|  x  R
Here, Df = R and Rf = [0, )
Remarks :


 
Signum function: f : R  R defined by 




or 


Greatest Integer function: f : R  R defined by f(x) = [x], x  R
assumes the value of the greatest integer, less than or equal to x.
Here, Df = R and Rf = Z

Polynomial function:
Graph for f : R  R, defined by f(x) = x2
Here, Df = R and Rf = [0, 

Graph for f : R  R, defined by f(x) = x3


Exponential function: f : R  R, defined by f(x) = ax, a > 0, a  1

0<a<1 When a > 1

 
 
 
 
 

Natural exponential function, f(x) = e x

Natural logarithm function: f(x) = logex or ln(x).

Logarithmic function: f : (0, )  R ; f(x) logax, a > 0, a  1

f(x) = logax, 0 < a < 1 f(x) = logax, for a > 1


Df = (0, ) Df = (0, )
Rf = R Rf = R
Case I When 0 < a < 1 Case II When a > 1
Algebra of function:

Let f : X  R and g : X  R be any two real functions where x  R


then

 (f ± g) (x) = f(x) ± g(x)  x  X

 (fg) (x) = f(x) g(x)  x  X

   
       
   

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy