Scribd
Upload
7 views6 pages

Chapter 2: Relations and Functions

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
7 views6 pages

Chapter 2: Relations and Functions

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

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

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

Common questions

Powered by AI

A function from set A to set B is defined as a specific type of relation that is a subset of the Cartesian product A × B. For a function to be well-defined, every element of set A must be associated with exactly one element of set B. The domain of the function is the set of all first elements of these ordered pairs, and the range is the set of second elements. This ensures the mapping from the domain to elements of the range is unique, distinguishing functions from general relations .

In a function, the image refers to the output values (range), and the pre-image includes the input values (domain). Their differential nature affects application significantly; each domain element in a well-defined function must map to a single unique image, while the same image can correspond to different domain elements. This impacts applications in inversibility and bijection determination; an application might leverage the surjective nature of functions to ensure coverage or injective traits to maintain uniqueness .

The Cartesian product of two non-empty sets A and B, denoted A × B, is the set of all ordered pairs (x, y) where x belongs to A and y belongs to B. This concept is significant because it forms the foundation for defining relations and functions between sets. It provides a formal framework to analyze and understand the connections between elements of different sets .

The inverse of a relation R from set A to set B, denoted R–1, is a relation from set B to set A. It consists of pairs (b, a) whenever (a, b) is an element of R. The inverse relation essentially reverses the direction of the associations established by the original relation R, providing insight into bidirectional relationships between elements of the sets .

A real-valued function is characterized by having its co-domain subset of the real numbers R. In the broader category of functions, this means that the "output" or range of the function consists entirely of real numbers, making it applicable in real-world calculations and analysis where real numbers are required. This categorization is essential for functions used in contexts such as calculus and real analysis .

An identity function maps each element in a set to itself (f(x) = x), maintaining the set's original structure, which is crucial for preserving data in transformations. A constant function, however, maps every element of the domain to a single constant value (f(x) = c). In mathematical analysis, identity functions exhibit neutrality, not altering the input, while constant functions demonstrate conditions of uniform output, useful in modeling phenomena that remain unaffected by input variations .

The Cartesian product is foundational in defining both relations and functions; it allows for pairing elements systematically, thus facilitating the construction of sets of ordered pairs. In relations, it enables the formation of subsets that illustrate potential associations. In functions, it limits these associations to mappings that are mathematically valid (each element having a unique image). Its utility in understanding structures lies in its ability to define complex interconnectivity and ordering, which are crucial in graph theory, database relationships, and more .

The number of functions from set A to set B is determined by the product qp, where n(A) = p and n(B) = q. This calculation is based on the idea that each element in set A can be associated with any of the q elements in set B. The total number of functions is therefore dependent on the sizes of both sets, reflecting the multitude of potential mappings that can be constructed .

The order of elements in an ordered pair is important because it determines the identity of the pair. Two ordered pairs are equal if and only if the first elements are equal and the second elements are equal. Unlike sets, where the arrangement of elements does not affect their identity, order in an ordered pair is crucial .

Logarithmic functions are defined by f(x) = loga(x), with a domain of positive real numbers (0, ∞), and they display a slow, increasing growth rate, given their nature of representing the power to which a base must be raised to obtain a number. Exponential functions, f(x) = ax, show rapid growth and are defined for all real numbers, with an exponentially growing range. The contrast in growth rates and valid input ranges make them suitable for very different applications, for example, logarithms in algorithm efficiency and exponentials in population growth modeling .

You might also like