100% found this document useful (1 vote)
47 views

Relations and Functions

This is an ISC project of class 12, (Section A) on the topic Relations and Functions.

Uploaded by

aditya
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
47 views

Relations and Functions

This is an ISC project of class 12, (Section A) on the topic Relations and Functions.

Uploaded by

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

Relations and Functions:

A Comprehensive Study
Table of Contents
1. Introduction
2. Basic Concepts of Relations
3. Types of Relations
4. Equivalence Relations
5. Functions: Definition and Concept
6. Types of Functions
7. One-to-One and Onto Functions
8. Inverse Functions
9. Inverse Trigonometric Functions
10. Composition of Functions
11. Graphical Representation of Functions
12. Real-World Applications
13. Conclusion
14. References
Introduction

Detailed Introduction:
Relations and functions are foundational concepts in mathematics that explore how
elements from one set relate to elements of another set. These concepts are
essential across multiple disciplines, including computer science, physics, and
economics, providing the framework for modelling processes, understanding
algorithms, and solving real-world problems.

Relation
A relation from set A to set B is a subset of the Cartesian product A × B. It pairs
elements from A with elements from B. For example, consider a relation where set A
is people, and set B is cars. The relation defines which person owns which car.

Function
A special type of relation where each element of the domain (A) is associated with
exactly one element of the range (B). This association forms a rule, making functions
predictable and systematic. Functions appear in areas such as calculus, algebra,
and beyond, where they are used to describe everything from linear relationships to
more complex dynamic systems.
Basic Concepts of Relations

What is a Relation?
A relation R from set A to set B is a rule that assigns elements of A to
elements of B. Mathematically, R ⊆ A × B, meaning that R is a subset of
the Cartesian product of A and B. The Cartesian product, A × B, is the set
of all ordered pairs (a, b), where a ∈ A and b ∈ B. Thus, a relation is a set
of such ordered pairs.

- Domain: The domain of a relation is the set of all first elements of the ordered pairs.
- Range: The range is the set of all second elements.

Example:
Let A = {1, 2, 3} and B = {a, b}. Then a possible relation R between A and B is R =
{(1, a), (2, b)}. Here, the domain of R is {1, 2}, and the range is {a, b}.

Graphical Representation:
Relations can also be represented graphically using coordinate systems, where
points on the graph represent ordered pairs. The horizontal axis (x-axis) represents
elements from A, and the vertical axis (y-axis) represents elements from B. A point
plotted at coordinates (x, y) represents the ordered pair (x, y) in the relation.

Types of Relations

Reflexive Relation:
A relation R on a set A is said to be reflexive if every element in A is related to itself.
That is, (a ,a)∈ R for all a ∈ A . Reflexivity is a key property in many mathematical
structures, such as equivalence relations and matrix operations.

Example:
Consider the set A={1 , 2, 3 }. The relation R={(1, 1),(2, 2),(3 ,3)} is reflexive because
every element is related to itself.
Symmetric Relation:
A relation R on set A is symmetric if for every pair (a ,b)∈ R , the reverse pair
(b , a)is also∈R . Symmetry often appears in situations of mutual connections, such as
friendships or partnerships.

Example:
In the relation "is a sibling of," if John is a sibling of Mary, then Mary is a sibling of
John, so the relation is symmetric.

Transitive Relation:
A relation R on set A is transitive if whenever (a ,b)∈ R and (b , c )∈ R, then (a ,c )∈ R.
Transitivity is important in mathematical proofs and logical sequences.

Example:
In the relation "is greater than" on numbers, if a > b and b > c, then a > c, making the
relation transitive.

Equivalence Relations

Equivalence Relation:
A relation is called an equivalence relation if it satisfies the properties of reflexivity,
symmetry, and transitivity. Equivalence relations naturally partition sets into distinct
classes of elements that are all related to each other.

Example:
The relation "has the same remainder when divided by 3" on the set of integers is an
equivalence relation. For example, 5 and 8 are related because both leave a
remainder of 2 when divided by 3.

- Equivalence Class: Each equivalence relation on a set defines a partition of the set
into equivalence classes. An equivalence class is the set of elements related to a
particular element. All elements in the same class are equivalent under the relation.

Functions: Definition and Concept


Definition of a Function:
A function is a special type of relation where each element in the domain is related to
exactly one element in the range. If f is a function from A to B, we write f : A → B . For
each element a ∈ A , there is a unique element b ∈ B such that (a ,b)∈ f .

Example:
Consider the function f (x)=2 x , which maps real numbers to their doubles. For
example, if x=3 , then f (3)=6 .

- Domain: The set of all possible input values (A) for which the function is defined.
- Range: The set of all possible output values (B) that the function can produce.

Graphical Representation:
Functions can be represented using graphs, where the x-axis represents elements
from the domain, and the y-axis represents elements from the range. A curve or line
on the graph indicates the relationship between the two sets. In a function, no two
points in the graph will share the same x-coordinate.
Types of Functions

Injective (One-to-One) Function:


A function f : A → B is injective if different elements in A map to different elements in
B. In other words, if f (a1 )=f (a 2) implies that a 1=a2, the function is injective. One-to-
one functions are important in understanding data structures where uniqueness is
crucial.

Example:
The function f (x)=2 x is injective because for every different value of x , the function
outputs a different value of f (x).

Surjective (Onto) Function:


A function is surjective if every element in the range B has at least one preimage in
the domain A. Surjectivity ensures that the entire range is "covered" by the function.

Example:
The function f (x)=x2 is not surjective on the set of real numbers because no real
number squared gives a negative output, meaning some numbers in the range are
not mapped by any element in the domain.

Bijective Function:
A function is bijective if it is both injective and surjective. Bijective functions establish
a one-to-one correspondence between the domain and range, making them
invertible.
One-to-One and Onto Functions

One-to-One Function (Injective):


An injective function ensures that each element in the domain maps to a unique
element in the range. This means no two different elements in the domain have the
same image. One-to-one functions are significant because they maintain the
distinction between different inputs when transforming data.

- Mathematical Definition:
A function f : A → B is injective if for every a 1 , a2 ∈ A , f (a1 )=f (a 2)implies a1=a2.

Onto Function (Surjective):


A function is surjective if every element of the codomain is mapped to by at least one
element of the domain. This guarantees that the entire codomain is "covered" by the
function, making surjectivity an essential concept in many real-world applications,
such as ensuring complete data transmission in communication networks.

- Mathematical Definition: A function f : A → B is surjective if for every b ∈ B , there


exists at least one a ∈ A such that f (a)=b.

Bijective Function:
A bijective function is both injective and surjective. Such functions establish a perfect
one-to-one correspondence between the domain and codomain, making them
invertible, which is useful in solving equations and modelling reversible processes.

- Mathematical Definition: A function f : A → B is bijective if it is both injective and


surjective.

Inverse Functions

Inverse Function Definition:


The inverse of a function f , denoted as f −1, is a function that reverses the operation
of f . If f : A → B is a bijection, then its inverse f −1 : B → A will map elements from B
back to A. This reversibility is particularly important in solving equations and in areas
such as calculus and cryptography.

- Condition for Inverse Function: A function has an inverse if and only if it is bijective.
If f (a)=b, then f −1 (b)=a.
Example:
Consider the function f (x)=2 x +3. To find its inverse, we solve for x in terms of y :

y−3
y=2 x +3 implies x=
2
−1 y−3
Thus , f ( y )=
2

Graphical Representation:
The graph of a function and its inverse are reflections of each other across the line
y=x . This symmetry shows how the roles of inputs and outputs are reversed
between the function and its inverse.
Inverse Trigonometric Functions

Definition of Inverse Trigonometric Functions:


The inverse trigonometric functions are the inverses of the basic trigonometric
functions (sine, cosine, tangent, etc.). They are used to find angles when the values
of the trigonometric ratios are known. These functions are widely used in calculus,
engineering, and physics for solving integrals and modelling periodic phenomena.

- Common Inverse Trigonometric Functions:


- sin−1 (x)(arcsine)
- cos−1 (x)(arccosine)
- tan−1 (x) (arctangent)

Domains and Ranges:


Each inverse trigonometric function has a restricted domain to ensure that it is a
proper function (bijective). For example, the domain of sin−1 (x) [−1 ,1], and its range
π π
is -[ ],[ ].
2 2

Graphical Representation:
Graphs of inverse trigonometric functions display the gradual rise or fall of angles as
the ratio values change. These graphs are crucial for visualising the behaviour of
these functions within their restricted domains.

Composition of Functions

Composition of Functions Definition:


The composition of two functions f and g, denoted as f ∘ g(x) , is defined by applying
g first and then applying f to the result. This operation is fundamental in
understanding how complex transformations can be built from simpler ones.

- Mathematical Definition: If f : B →C and g : A → B , then the composition f ∘ g is a


function from A →C , defined by f ∘ g(x)=f (g (x))
Example:
Let f (x)=2 x +1 & g(x )=x 2.
The composition f ∘ g(x) is: f ∘ g( x)=f (g ( x))=f ( x 2)=2 x 2 +1

Applications:
Composition is frequently used in calculus, algebra, and computer science to
construct functions that model more complex systems. For example, in computer
graphics, composition allows combining different transformations (such as rotation
and scaling) into a single operation.

Graphical Representation of Functions

Graphing Functions:
Graphs provide a visual representation of how a function behaves. By plotting points
corresponding to inputs and outputs, one can easily observe trends such as linearity,
curvature, or periodicity. Graphs are especially useful in identifying the domain,
range, and critical points (e.g., maxima, minima, and inflection points).

- Linear Functions: Represented by straight lines, where the slope of the line
indicates the rate of change.
- Quadratic Functions: Produce parabolas that open upwards or downwards, with the
vertex indicating the maximum or minimum value.
- Trigonometric Functions: Sinusoidal graphs that repeat over intervals, useful in
modelling oscillatory systems.
Real-World Applications of Relations and
Functions

Applications in Engineering:
Functions and relations are foundational in fields such as electrical engineering,
where they are used to model the behaviour of circuits. For example, the relationship
between voltage and current in a resistor is a linear function, governed by Ohm's
law.

Applications in Economics:
In economics, functions are used to model supply and demand, price elasticity, and
consumer behaviour. The relationship between price and quantity demanded is
typically modelled as an inverse function.
Applications in Computer Science:
Functions are key in programming, where they define how inputs are transformed
into outputs. In algorithms, functions help in organising code efficiently and
modularly, ensuring that tasks are repeatable and scalable.

Conclusion and References

Conclusion:
Relations and functions are fundamental concepts in mathematics that provide a
structured approach to mapping between sets, understanding transformations, and
analysing interactions between variables. From basic mappings like injective,
surjective, and bijective functions to advanced applications in various fields such as
engineering, economics, and computer science, understanding these concepts helps
in solving complex problems. Mastery of relations and functions not only strengthens
mathematical skills but also supports broader applications in the real world.

References
1. Lang, S. (2002). *Algebra* (3rd Edition). New York: Springer.
- Used on Page 8 (Types of Relations) and Page 9 (One-to-One and Onto Functions).

2. Stewart, J. (2015). *Calculus: Early Transcendentals* (8th Edition). Belmont, CA: Brooks/Cole.
- Used on Page 9 (One-to-One and Onto Functions), Page 10 (Inverse Functions), and Page 15
(Conclusion).

3. Anton, H. (2012). *Calculus* (10th Edition). Hoboken, NJ: Wiley.


- Used on Page 10 (Inverse Functions).

4. Zill, D. G. (2000). *Advanced Engineering Mathematics* (6th Edition). Boston: Jones & Bartlett
Learning.
- Used on Page 11 (Inverse Trigonometric Functions).

5. Spivak, M. (2008). *Calculus* (3rd Edition). Houston, TX: Publish or Perish, Inc.
- Used on Page 12 (Composition of Functions).

6. Larson, R. (2017). *Precalculus* (10th Edition). Boston: Cengage Learning.


- Used on Page 13 (Graphical Representation of Functions).

7. Adams, R. A. (2018). *Calculus: A Complete Course* (9th Edition). Toronto: Pearson.


- Used on Page 14 (Real-World Applications of Relations and Functions).
Images
1. https://image2.slideserve.com/5335506/functions-vs-relations3-l.jpg
2. https://images.javatpoint.com/math/images/difference-between-relation-and-function.png
3. https://www.researchgate.net/profile/David_Chinofunga/publication/362684503/figure/fig1/
AS:11431281079001741@1660471604521/Procedural-flowchart-on-distinguishing-functions-
and-relations.png
4. https://images.slideplayer.com/25/7635411/slides/slide_3.jpg
5. https://d138zd1ktt9iqe.cloudfront.net/media/seo_landing_files/graphing-a-linear-function-
1633018606.png
6. https://media.geeksforgeeks.org/wp-content/uploads/20231003072114/One-to-one-function-
1.png
7. https://media.geeksforgeeks.org/wp-content/uploads/20231016183533/Injective-Function-
5.png
8. https://undergroundmathematics.org/glossary/inverse-function/images/inverse-function.png
9. https://mathsathome.com/wp-content/uploads/2021/12/how-to-find-the-inverse-function-of-a-
linear-function-1024x580.png
10. https://d138zd1ktt9iqe.cloudfront.net/media/seo_landing_files/img-1668663927.png
11. https://mathematicalmysteries.org/wp-content/uploads/2021/11/1280px-
unit_circle_angles_color.svg_.png
12. https://www.onlinemathlearning.com/image-files/parent-functions.png

You might also like