UNIVERSITY FOR ANDEAN DEVELOPMENT

FACULTY OF HUMANITIES AND SOCIAL SCIENCES

PROFESSIONAL SCHOOL OF INITIAL EDUCATION AND

BILINGUAL.

University for the

Andean Development

ISSUE
RELATIONSHIPS AND FUNCTIONS

Name : Mariana Elena, Contreras Vargas : Carlos Cantiotti Ordoñez.

teacher Cycle

LIRCAY-HUANCAVELICA

2021
 DEDICATION
First of all, to dedicate to God for the health that he
gives me, that despite these difficult times we continue
to battle day by day.
Secondly, to my family who are always
supporting me and instilling in me to move forward, and
train me with good values professionally.
INDEX

ISSUE........................................................................................................................................1
CAPITULO I..............................................................................................................4
1.1. DOMAIN AND RANK OF A RELATIONSHIP...........................................4
CAPITULO II.............................................................................................................6
2.1. TYPES OF RELATIONSHIPS, INVERSE RELATIONSHIPS.
COMPOSITION OF RELATIONSHIPS ..................................................................6
 2.1.6. NON-SYMMETRIC RELATIONSHIP...................................................8
(ExyeA)(xRynyRx)...................................................................................................8
(VXEAN(VyeA) (VZeA) (XRyAyRZ-XRz).................................................................................................9
R-1={(6,6),(12,12),(18,18),(24,24),(12,6),(18,6), (24,6),(24, 12)}.............................11
CAPITULO III.........................................................................................................12
If f(xa) = f (xb) then x a = Xb...........................................................................................16
Surjective function..................................................................................................18
Vy e Codom f, ax E Dom f = y....................................................................................18
Rec f(or Im f ) = Codom f............................................................................................18
Rec f = / x is real] = {x + 1 I x is real} = R...................................................................19
with R being the real numbers.........................................................................................19
Rec f = {f(x) / T is real] = {'2x / x is real] = R....................................................................20
with R being the real numbers......................................................................................20
CONCLUSIONS......................................................................................................20
 INTRODUCTION

As we know today, mathematics plays an important role in every area such as in our daily

lives, at work, in the execution of a project and others, which is why it is important to

have prior knowledge of mathematics, whether it concerns our new topic of research in

the present work whose title bears relationships and functions.

The study of the topic of functions is basic to understand many other topics that will be

seen later in the mathematics course, it is also important because it can be used for many

purposes in “daily life” since it is generally used real functions, (even when the human

being does not realize it), in the handling of numerical figures in correspondence with

another, because subsets of the real numbers are being used. The functions are very

valuable and useful for solving problems of daily life, problems of finance, economics,

statistics, engineering, medicine, chemistry and physics, astronomy, geology, and any

social area where there is than relating variables.

In the content of the research we will talk about the following topics, Domain and Range

of a relationship, Types of relationships. Inverse relationship. Composition of

relationships, Functions. Definition, Difference between relations and functions, Domain

and Range of a function, Types of functions: Injective, Subjective and Bijective. Inverse

function and finally Composition of functions

CAPITULO I

1.1. DOMAIN AND RANK OF A RELATIONSHIP.

1.2. CONCEPTUAL DEFINITION. The domain of a function or relation is the set of

all possible independent values that a relation can have. It is the collection of all

possible entries-

The range of a function or relation is the set of all possible dependent values that the

relation can produce. It is the collection of all possible outputs.

 The domain of a relation is the set of preimages; that is, the set formed by the elements

of the starting set that are related. The set of images, that is, elements of the arrival set

that are related, is called a path or range.

1.3. TO UNDERSTAND BETTER WE WILL DO SOME.

EXERCISES.

EXAMPLE 01: find the domain and range of the following relationship

F(X)= (3, 7), (4, 8), (5, 4), (6, 5), (7, 6), (8, 7), (9, 8)}

SOLUTION

DOMAIN F(X)= {3, 4, 5, 6, 7, 8, 9}

RANGE F(X)= {4, 5, 6, 7, 8,}

EXAMPLE 02

Let A = {1, 2, 3, 4} and B = {4, 5, 6, 7, 8} and R be the definite relation of A to B

determined by the rule “y is twice x” or “y = 2x”, find domain and range of the

relationship.

Solution

The total number of ordered pairs that we can form, or Cartesian product, is:

A x B = {(1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8), (3, 4), (3,

5), (3, 6), (3, 7), (3, 8), (4, 4) , (4, 5), (4, 6), (4, 7), (4, 8)}

But the pairs that belong to the relation R (y = 2x) are only:

R = {(2, 4), (3, 6), (4, 8)}

In this relationship we see that: “4 is double 2”; that is, “4 is the image of 2 under R”,

in other words, “2 is the pre-image of 4”.

Thus, the domain and range are:

D = {2, 3, 4}

Rg = {4, 6, 8}
 CAPITULO II

2.1.TYPES OF RELATIONSHIPS, INVERSE RELATIONSHIPS.

COMPOSITION OF RELATIONSHIPS .
A relationship can be considered as a correspondence between the elements of one or more sets.

In the types of relationships we can vary as we will mention in the following.

2.1.1. REFLECTIVE RELATIONSHIP .

A relation R defined on A is said to be “reflexive” if all elements of A are related to itself; that

is, if all the elements of A form ordered pairs in R with equal components. Symbolically,

Example 01 : If A={2,4,5,6,7} and R:A → A is a relation defined by R={(2,2),(4,4),(5,5),( 6,6),

(7,7)}, then it is “reflexive”, because all the elements of A are related to itself.

Observing the relationship matrix M of R (figure 01) you can see that this is verified if ones

appear on the main diagonal of the matrix.

2 4 5 6 7

1 d 0 0 0 2
0 1 0 0 0 4
M= 0 0 1 0 0 5
0 0 0 1 0 6
0 d 0 0 1 7

2.1.2. ANTI-REFLEXIVE RELATIONSHIP .

A relation R defined on A is “anti-reflexive” if none of the elements of A are related to itself;

That is, if there are no elements of A, they form ordered pairs in R with equal components.

Symbolically.

Example 8.15: If A={2,4,5,6,7} and R:A → A is a relation defined by R={(4,5),(2,4),(5,2),

( 6,7),(7,6)}, then R is Anti-reflexive, because all the elements of A are related to itself.

Notice that in the relation matrix M of R, at least one one does not appear in its

main diagonal.
2.1.3. NON-REFLECTIVE RELATIONSHIP .
A relation R defined on A is said to be “non-reflexive” whenever some elements of A are not

related to itself; that is, if not all the elements of A form ordered pairs in R with equal

components. Symbolically,

Example: Yeah A={2,4,5,6,7}and R:A → A is a relationship

defined by

R={(2,2),(4,4),(5,6),(6,5),(7,7)}, then R is “non-reflexive”, because not all elements from A

are related to self and others No.

Notice that in the relation matrix M of R. some elements of its main diagonal have a 1, which

verifies this property.

2.1.4. SYMMETRIC RELATIONSHIP.

A relation R defined in A is “symmetric” when all partners in the relation have their reciprocal;

That is, for elements x, y of A it is true that if xRy, then yRx. Symbolically,

Example 8.17: if A={2,4,5,6,7} and R:A→A is a relation defined by

R={(2,2),(6,4),(5,6),(6,5),(4,6)},
 then R is symmetric, because all pairs of R have their reciprocal. Intuitively observe the matrix

in figure 8.13 that, if it were folded along the main diagonal, the 1's would coincide.

2.1.5. ANTI-SYMMETRIC RELATIONSHIP.

A relation R defined in A is "antisymmetric" when no pair of the relation has its reciprocal, that is, for elements x, y of A it holds that if
(x,y)eR, then (y,x)eR, but , if (x,y)eR and (y,x)eR, then x=y. Symbolically,

(VxyeA)(xRy — -yR x)

or also,
(VxyeA)óxRy AyRx — -x=y)

Example 8.18: if A={2,4,5,6,7} and R:A → A is a

Cx, e aGx-y— -oxRynyRx*CLEACx-y oxRy yR x)* CxEAxRynyR* X- y»
relation defined by R={(2,2),(6,4),(5,6),(6,2),(4,5),(7,7)}, then R is “antisymmetric”, because None
of their partners have their reciprocal and if they did, then the couple would be reflective.
Intuitively observe the matrix that, if folded along the main diagonal, none of the 1's coincide.

2 4 5 6 7
1 d 0 0 0 2
0 0 1 0 0 4
0 0 0 1 0 5
1 1 0 0 0 6
0 d 0 0 1 7

Now, the relation R:A→A satisfies the property defined by R={(2,2),(4,4),(5,5)}

Is it symmetric or antisymmetric?

2.1.6. NON-SYMMETRIC RELATIONSHIP.

A relation R defined in A is "non-symmetric" when some pairs are symmetric or have their
reciprocal and others do not; that is, not all pairs of R satisfy that if (x,y)eR, then (y,x )eR; that
is, some pairs of R satisfy that (x,y)e R and (y,). Symbolically,
(ExyeA)(xRynyRx)

Example 8.19: if A={2,4,5,6,7} and R:A → A is a relation defined by R={(2,2),(5,4),(5,6),

( 6,5),(7,7)}, then R is “non-symmetric”, because some of its pairs have his

 reciprocal and others No.

Intuitively observe the matrix that, if it were folded along the main diagonal, some coincide and

others do not.

Note: Please note that there are differences between anti-reflective and non-reflective relations,

and between antisymmetric and non-symmetric relations.

2.1.7. TRANSITIVE RELATIONSHIP .

A relation R defined on A is “transitive” whenever an element is related

with a second and this with a third, then the first is related to the

third. That is, whenever x, y, z are elements of A, it holds that if (x,y) ER

and (y,z) ER, then (x,z) E R. Symbolically,

(VXEAN(VyeA) (VZeA) (XRyAyRZ-XRz)

Example 8.20: if A={2,4,5,6,7} and R:A→A is a relation defined by

R={(2,2),(4,4),(5,4),(5,6),(6,5),(4,5),(4,6),(5,5) ,(7,7),(6,6)}, then R is

“transitive”. See the relationship

represented in a matrix M in Figure 8.16.

2.1.8. NON-TRANSITIVE RELATIONSHIP .
A relation R is “non- transitive” if one element is related to a second and this to a third, but the first is not related to the
third. That is, there are elements x, y, z of A, which satisfy some if (x ,y)eR and (y,z)eR, then (x,z) eR. Symbolically,
(3xeA)( 3yeA) (zeA) (xRy AyRz AxRz)

Example 8.21: if A={2,4,5,6,7} and R:A—A is a relation defined by

R={(2,2),(4,4),(5,4),(5,6),(6,5),(4,5),(4,6)}, then R is " non-transitive", because 5R44R5— 5R 5 Represent it in a
relation matrix.

2.1.9. EQUIVALENCE RELATIONSHIP .

A relation R defined on a set A is equivalence if and only if it is reflexive, symmetric and

transitive.

Example: if A={2,4,5,6,7} and R:A→A is a relation defined by

R={(2,2),(4,4),(5,5),(6,6),(7,7),(2,4),(4,2),(2,5) ,(5,2),(2,6),(6,2),(2,7),(7,2),(4,5),(5,4) , (5,6),

( 6,5),(6,7),(7,6),(4,6),(4,7),(6,4),( 7,4),(5,7),(7, 5)}.

2
4
5
6
7

then R is an equivalence relation. Looking at the relationship matrix M of R. You can see that

all the cells in the matrix have ones.

2.1.10. RELATIONSHIP OF STRICT ORDER .

A relation R defined on a set A is of strict order if R is antisymmetric and transitive.

Example: if A={2,4,5,6,7} and R:A→A is a “be less” relation, then R is of strict order. Indeed.

R={(2,4),(2,5),(2,6),(2,7),(4,5),(5,6),(6,7),(5,7) }.

It is antisymmetric and transitive. Check this answer.

2.1.11. PARTIAL ORDER RELATIONSHIP .

A relation R defined on a set A is of partial order if R is reflexive, antisymmetric and transitive,

but there is no relation between some elements of A.

Example: if A={2,4,5,6,7} and R:A→A is a relation defined by

R={(2,2),(4,4),(5,5),(6,6),(7,7),(2,4),(2,5),(2,6) ,(4,5),(5,6),(6,7),(4,6)},

then R is of partial order, because it is reflexive, antisymmetric and transitive, but some

elements of A are not related to each other. Check the answer.

2.1.12. INVERSE RELATIONSHIP .

Let A be any set and R be a relation defined in A by {(x,y) €AxA/xRy}; then, the inverse

relation denoted by R-1 is defined as the set {(x,y) eAxA/yRx}.

Example 8.26: If A={6,12,18,24} and R a relation defined in A by

R={(6,6),(12,12),(18,18),(24,24),(6,12),(6,18),(6,24),(12,24) }

So

R-1={(6,6),(12,12),(18,18),(24,24),(12,6),(18,6), (24,6),(24, 12)}

 CAPITULO III
3.1. DEFINITION OF FUNCTIONS.

A mathematical function is a relationship established between two sets, through which each

element of the first set is assigned a single element of the second set or none. The initial set or

starting set is also called the domain; The final set or arrival set, meanwhile, can be called a

codomain.

Therefore, given a set A and a set B, a function is the association that occurs when each element of

set A (the domain) is assigned a single element of set B (the codomain).

The generic element of the domain is known as the independent variable; to the generic element of

the codomain, as a dependent variable. This means that, within the framework of the mathematical

function, the elements of the codomain depend on the elements of the domain.

3.2. DIFFERENCE BETWEEN RELATIONSHIPS AND FUNCTIONS.

The mathematical relationship is the link that exists between the elements of a subset with

respect to the product of two sets. A function involves the mathematical operation to

determine the value of a dependent variable based on the value of an independent variable.

Every function is a relationship, but not every relationship is a function

Relationship Function

Definition
Mathematical operation that must
Subset of ordered pairs that correspond
be performed with the variable x to
to the Cartesian product of two sets.
obtain the variable y .
Notation x R y ; x is related to y . y =ƒ( x ); y is a function of x .

The sets are not empty. It presents dependent variable and

Characteristics It presents a domain and a range. independent variable.
It presents a domain and a range.

Examples The occupied positions of a train: the Constant function y =ƒ( x )=c
positions of the train are the elements of Linear function y =ƒ( x )=ax+b
set A and the people on the train are the
Function
elements of set B.
polynomial y =ƒ( x )=ax 2 +bx+c
Mathematics students at a university:
university students are the elements of
set A and university majors are the
elements of set B.

3.3. DOMAIN AND RANGE OF A FUNCTION.

Domain of a function: It is the set formed by the elements that have an image. The values

that we give to “X” (independent variable) form the starting set. Graphically we look at it

on the horizontal axis (abscissa), reading as we write from left to right.

Range of a function: It is the set formed by the images. They are the values taken by the

function "Y" (dependent variable), which is why it is called "f(x)", its value depends on the

value we give to "X". Graphically we look at it on the vertical axis (ordinate), reading from

bottom to top
FOR A BETTER UNDERSTANDING WE WILL MAKE THREE

DOMAIN AND RANK EXERCISES

EXERCISE 1: Determine Domain and Range of f(x) = X + 3

As it is a linear function, the domain will be the entire set of real numbers.

The Range will be the entire set of real numbers. We follow the “Y” axis from bottom to

top and we can always read values.

Range = (– ∞, + ∞)

EXERCISE 2: Determine Domain and Range of

As it is a polynomial function of the second degree, the domain will be the entire set of real

numbers.

Dom f(x) = R
 The “Y” axis begins to take values (from bottom to top) from -4.

Range = [– 4, + ∞)

EXERCISE 3: Determine Domain and Range of

As it is a polynomial function of the third degree, the domain will be the entire

set of real numbers.

The Range will be the entire set of real numbers. We follow the “Y” axis

from bottom to top and we can always read values.

Range = (– ∞, + ∞)

3.4. TYPES OF FUNCTIONS: INJECTIVE, SUBECTIVE AND BIJECTIVE. REVERSE

FUNCTION. COMPOSITION OF FUNCTIONS.

 3.4.1. INJECTIVE FUNCTION.

The function f is injective if each element of the final set Y has a unique element of the

initial set X to which it corresponds. That is, there cannot be more than one value of X that

has the same image Y . They are also called “one-to-one” functions.

Not always all the elements of the final set Y must correspond to some of the initial set X.
x AND x AND

Injective function Non-injective function

In mathematical terms, a function f will be injective if given two points xa and xb:
If f(xa) = f (xb) then x a = Xb
In other words: a function is injective if it holds that at values of its domain x0 ≠ x1 ⇒
f(x0) ≠ f(x1).
A graphical check of the injectivity of a function is when any line parallel to the X axis
intersects it, at most, at one point. Example of an injective function
The function f ( x ) = 2 x +1, with the elements of its domain restricted to positive real
numbers, is injective.

Let's see that the injectivity condition is met:

 Indeed, if xa and xb have the same image, they must necessarily be the same element.
Therefore, f is injective.
Let's look at the graph of another function:

This function does not satisfy the injectivity condition, so it is not injective .
A very palpable example of an injective function: let us assign P to the set of
presidents of the United States of America elected in the 21st century and I to the set
of presidential inauguration dates in the USA, also in the 21st century. Let f be the
function that relates each of these presidents to the date of their first inauguration. The
function f is, therefore, injective since each president has a single date of his first
inauguration. Although, for example, Barack Obama, apart from the date of his first
inauguration of 1-20-2009, was re-elected for the second time on 11-6-2012.
Another example of an injective function is that of the volume of the sphere, where r
is its radius. Where the values of volume and radius, codomain and domain, are
positive real numbers. And to each value of the radius there corresponds a single
value of the volume.
1 4
Vol sphere f(x) = - nr 3
3.4.2. SUJECTIVE FUNCTION.
A function f is surjective (or suprajective ) if all the elements of the final set Y have
at least one element of the initial set
corresponds.
x

Surjective function Non-surjective function

That is, a function is surjective if the path of the function is the final set Y. In other
words, a function is surjective when its codomain and its range or range are equal.
Therefore, it will also be surjective:

In mathematical terms, a function f is surjective if:

Vy e Codom f, ax E Dom f = y
Rec f(or Im f ) = Codom f

Surjective function example

The function on real numbers defined by f ( x ) = x +1 is surjective .
This function is indeed surjective. Let's see it by showing that the path of the function is all
real numbers.
Rec f = / x is real] = {x + 1 I x is real} = R

with R being the real numbers

The path of the function is the same as the final set Y , so f is surjective.
That is, with the function f(x) , every real number will be the image of at least one other real
number (in the case of this function, the image of a single real number).
Likewise, with the same arguments, the function defined on the reals will be surjective :

In this function, all the elements of the image set (which here coincides with the codomain)
have at least one element of the initial set, and the same element of the initial set may have
two or three elements of the image set.

3.4.3. BIJECTIVE FUNCTION

A function f is bijective if it is both injective and surjective. That is , if every element of the
final set Y has at least one element of the initial set injective) .
Let's say that no element in the final set Y can remain alone, without being associated with a
single element in the initial set X.
 Formally, a function f is bijective if:
Vy G Codom f,a!x G Dom f/f{x) = y Rec
f(o Imf)= Codom f

Bijective function example

The function f ( x ) = 2 x defined on the real numbers is bijective .
To check this, let's see that f is injective and surjective. We will start with
the infectivity condition:

The infectivity condition is met, so now we would have to prove surjectivity . To do

this, we have to show that the path of the function is all real numbers.
Rec f = {f(x) / T is real] = {'2x / x is real] = R

with R being the real numbers

The function is also surjective, so f is bijective.

CONCLUSIONS
In conclusion, we determined that the functions and relationships that we develop in the topic

are quite broad, but with the concepts and exercises that we carry out, they are made

understandable, which is why we use the concept of each topic developed, including its

application exercises, Just as we as students have to continue delving deeper into the topic,

because as we know, according to what we understand, the functions and relationships are
always present in our daily lives, sometimes we apply it without realizing it.

As well as in conclusion, we can say that the applications of the exercises are based on the

topic developed, so readers will be able to understand and have concepts prior to the topic of

research developed.
 BIBLIOGRAPHIES

BREUER, J.: Initiation to set theory, Madrid, Paraninfo, 1970.

GARCÍA MERAYO, F.: Discrete Mathematics, Madrid, Thomson,

Paraninfo, SA, 2005. LIPSCHUTZ, S.: Set theory. 530 Problems Solved,

Schaum Compendium Series, New York, McGraw-Hill, 1963.

Eduardo Espinoza Ramos in his book basic mathematics.