LESSON 3

Language of Relations, Functions and Binary

Operations

Learning outcomes:
• Introduce the concept of relation and the formal language
associated with.
• Describe the concept of function and the language used on it.
• Identify relations which are functions.
• Determine the domain and range of a relation and function.
• Present the language of binary operations and groups.
• Evaluate binary operations for groups.
 Introduction
In many real-life activities, we are encountering problems that require as
to clarify items, make connections between persons or things, or make an informed
choice on the basis of a situational analysis.
 y

(x,y)
D Find the graphs of the following.

E II I 1. A-
2. B-
x 3. C-
A B 4. D-
F 5. E-
III IV G 6. F-
C 7. G-
 Relations and Functions
Definition 1: If the elements of two sets A and B are combined to form set of
ordered pairs (x,y) where x is an element of set A and y elements of set B,
then this set is called a relation.

Example 1: Suppose M is a relation from a set A to set B. So M is a set of ordered

pairs (x,y) which can be written in symbolic form as: M= {(x,y|x A and y B)}
It is read as “M is the set of ordered pairs (x,y)such that x is an element of A and
y is an element of B”.

Definition 2: The domain of a relation is the set composed of the first components of all
the ordered pairs in the relation. Likewise, the range of a relation is set containing
all the second components of all the ordered pairs in the relation.

Example 2: Suppose a relation is defined as A={(a,a), (a,c), (a,d)}. Then domain of A is

= {a} and range A is = {a,c,d}.
 Definition 3: A relation can be described by:
a. A verbal statement as in “set of PBA players such that the coach of the first
person is the second person/component.
b. A list of ordered pairs like {(-1,-2), (0,0), (6,12), (4,8)}.
c. An equation like {(x,y)/y=2x}
d. An inequality such as {(x,y)/y>x-1}
e. A table of numbers like
Registration Fee P 30.00 P 50.00 P 100.00 P 150.00
No. of participants attending 500 170 110 120

1
f. A diagram as in
A
2
B
3
C
1
g. A graph like

Example 3: Express the relation A using:

a. a list of ordered pairs
 {(0,0), (-1,2), (2,-4), (-2,4)}
b. an equation
 {(x,y)/y=-2x}
c. a table of values
x .0 -1 2 -2
y 0 2 -4 4
d. Determine the domain and range of relation A
 ={0,-1,-2,2} and = {0, 2, 4, -4}
Definition 4: A function from a set A to a set B is:
 A relation in which no two ordered pairs have the same first component.
 A rule or correspondence that assigns to each element x A unique or one and
only one element y of B.

Take Note!
1. A function is a special relation, a relation which stresses that no two ordered
pairs should have the same first component. Remember therefore that NOT ALL
Relations are functions.
2. Each or every element x of the first set must have assigned to exactly one or
one and only one element y of the second set. That means all elements of the first
set must have unique partners in the second set.
Example 4: Determine which of the ff. is/are the function(s).
1. A = {(1, R), (1, S), (2, R), (2, S)}
sol’n:
2. P = {(-1, 1), (-1, -3), (-1, 5)}
sol’n:
3. S = {(-3, 4), (1, -2), (-4, 5)} (1, 1)
sol’n:
4. 5.
1
A
2
3 (1, -1)
B
4
 Functions are represented by means of the following:
1. Table of values (tabular values)
2. By an equation/formula
3. By diagram/graph
4. Functional notation
Let f be the function and (x, y) € f, then, f:x→y or y= f(x)

 Functions defined by an equation

Let X and Y be two sets of real numbers. A function from X to Y can be defined by an
equation by giving a method of determining the variable y € Y when the first variable
x € X is given. Here we say that “y is a function of x”.
Notation: y = f(x)
 Read as “y equals f of x” or “y equals f at x”
 DO Not interpret f(x) as f times x
 f is the symbol we use as name of the function or the symbol for the rule that defines
the function (some could be F, h, g, G, etc.)
 x is the argument or input value or independent variable.
 y is the output value or the dependent variable.
 f(x) is the value of the function f at the number x or the image of x.
 If f is a function such that y = f(x), then
y: is the image of x under f
x: is the pre image of y under f
 It is permissible to use the symbol f(x) in place of y in the notation for a function

Example 5:
Given a function f(x) = + 1
a. What is the image of 2 or f(2)?
sol’n: f(2) = + 1 = 2
b. Find the number x whose image is 5.
sol’n: We solve for the value of x when f(x) = 5. That is, substitute y = 5.
since f(x) = y
f(x) = + 1
5= +1
5–1=
4=
x=8
 Properties of Functions
If y = f(x), then
 The set of all values of x that can be submitted in the function to yield a real value
for y is called the domain of the function f.
 The set of all values of y that resulted from this substitution for x is called the range
of the function f.

Example 6: Determine the domain and the range of the following functions.
a. T = {(-2, -4), (-1, -2), (4, 8)}
sol’n:
let = domain of T and = range of T
= {-2, -1, 4} and the = {-4, -2, 8}

b. f(x) = x + 1
sol’n:
In the function f(x), you can put any value for x. notice that this an equation of a line.
Any value of x will make the function defined. So the domain of this function is the set of
real numbers. In symbols, = {x|x € R}.
Moreover, by substituting all values defined at f (or the permissible values of x), then you
can generate all real values for f(x). But y = f(x), so the range of f or the range f is = y/y € R}
Graphs of Functions

Definition 5: If f is a function, then the graph of f is the set of all points (x, y) in the
rectangular coordinate plane for which (x, y) is an ordered pair of f.

 To graph a function y = f(x) means to locate all points in a rectangular coordinate

System whose coordinates satisfy the equation of the function.
 So the graph of the function f is the set of all points in the x-y plane whose
coordinates satisfy the equation of f.

Remarks: Does any graph in the xy-plane represent a function? NO. Why?
The Vertical Line Test:
 The graph of a function can be intersected by a vertical line in at most one
point. The graph is not a function if there is at least one vertical line that can
be drawn and that intersects the graph in more than one point.
 The graph of the function f cannot contain two points with the same x-coordinate.

a. Y = b. + = 1 c. = x + 2
B. Language of Binary Operations

Binary operation is a special type of a function on a set. A binary operation on a set

of real numbers is a rule which combines any two real numbers a and b to produce
another real number. Just like our basic operations addition and multiplication, during
our drills we automatically say with confidence that 3 + 7 = 10, 4 x 5 = 20 etc. As we
analyze how are these being done, we are thus led to the idea that the addition is
basically just a rule that people learn, enabling them to associate with two numbers
Given in an order, some number is an answer. Multiplication is also such a rule, but a
different rule from addition. Students then should be careful with these rules so as not to
be confused. The rule is only defined for pairs of things from specified set just like the
Binary operation.
Definition 6: A binary operation* on a set S is a function mapping S x S into S. For each
(a, b) € S x S, we will denote the element of *[(a, b)] of S by a*b.

Keep this in mind: Intuitively, we may regard a binary operation * on S as assigning to

each ordered pair (a, b) of element S, an element a*b of S. The sign * for binary
operation is called “asterisk” or “star”. Binary operation * is evaluated with the given
rule and also includes the operations of addition, subtraction, multiplication and
division on the set of real numbers.

Rules to follow in Defining a Binary Operation *

I. Exactly one element is assigned to each possible ordered pair of element S.
II. For each ordered pair of elements of S, the element assigned to it is again on S.
Example 7. On the set of real numbers R, define * as the usual addition on R by
a*b = a + b. Is *a binary operation on R?

sol’n: for any a, b € R,

i. exactly one element is assigned to an ordered pair a*b = a + b. That is, there
is only one answer or a unique real number given when we add two real
numbers;
ii. For each ordered pair a * b = a + b, the sum of two real number is always a
real number R.

Hence, * defined as a*b = a+b is binary operation on R.

Example 8: on (the set of positive integers), define * as a*b = a – b(subtraction).
is * a binary operation define on ?

sol’n. If we take any a, b € like a = 2 and b = 3, then

a*b=a–b
a*b=2–3
a * b = -1
With this, a * b is assigned to -1 for a = 2, and b = 3. But -1 is a negative integer
and hence not an element of (-1 € ). Hence, we violated the rule ii. Therefore
* As defined by a * b = a – bis not a binary operation on the set
Definition 7: Closure, induced Operation
A set S is said to be closed under a binary operation * if for any two members
from the set, the result returns to any member of the set S. That is, the set S is
closed under * if for all a , b € S, we also have a * b € S.

Example 9: On R define * to be a * b = ab(usual multiplication)

sol’n. let any a, b € R like a = 1 and b = -1 (the values of a and b are arbitrary)
a * b = ab
a * b = (1)(-1)
a * b = -1 € R, therefore R is closed under the binary operation *
Note: This will hold true to all values a, b of the set of real numbers.
Definition 8: Commutative Operation
A binary operation * on a set S is commutative if (and only if) a * b = b * a for all a,
b € S.

Example 10: On R, define * to be a * b = a + b (addition). Show that a * b = b * a

sol’n: Let a, b €, like a = 3 and b = 5 (values of a, b are arbitrary)
a*b=a+b a*b=b+a
a*b=3+5 a*b=5+3
a*b=8 a*b=8

Now, since the order of the elements of the set S doesn’t affect the value for a * b,
Particularly the order in which the numbers are added does not affect the sum of these
Numbers. Therefore, a * b = b * a and * is commutative in R where * (usual addition).

Note: it holds true to all values a, b of the set of real numbers.

Definition 9: Associative Composition
A binary operation * on a set S is associative if (a * b)* c = a * (b * c) for any
a, b, c € S.

Example 11. On , define * to be a * b = c where c is the smallest integer greater

than both a and b. Determine if * is associative.
sol’n. let a, b, c € where a = 1, b = 2 and c = 3 (values of a, b, c are arbitrary)
Show that (a * b) * c = a * (b * c)
a * (b * c) = (a * b) * c (a * b) * c = a * (b * c)
= (1 * 2) * 3 = 1 * (2 * 3)
=3*3 =1*4
=4 =4

Therefore, (a * b) * c = a * (b * c) and * is associative on .

Definition 10. Groups
A group <G, *> is a set G together with a binary operation * on G, such that the
following axioms are satisfied:
i. The binary operation * is associative.
ii. There is an element e in G such that e * a = a *e = a for all a in G. The element
e is called identity element with respect to *.
iii. For each a in G, there is an element a’ in G with property that a’ * a = a * a’ =
e. The element a’ is an inverse of a with respect to *.

Example 12. On R, define * to be a * b = a + b (usual addition). Show if the <R, * > or <R,
+ > is a group.
sol’n. Let us satisfy all conditions of the definition of a group.
i. Show that * is associative
For any a, b in R, show that (a * b)* c = a * (b * c)
(a * b)* c ? a * (b * c)
(a + b)* c ? a * (b + c)
Since a * b = a + b
(1 + 2) + 3 ? 1 + (2 + 3)
Where a = 1, b = 2, and c = 3
3 + 3 ?1 + 5
6=6
Therefore, binary operation * is associative
Note: We all know that addition is associative under R, thus it holds true to all values in R.
ii. Find the identity element e for *.
Ǝ e  R s.t. a * e = e * a = a, a  R (read as: “there exist an e in R such that * e =
e * a = a for all a element of R”.)
Sol’n. Ǝ e  R s.t. a * e = e * a = a, a  R
a*e=a or e * a = a
a+e=a e+a=a
e=a–a e=a–a
e =0 e=0

Therefore, the identity element e for * defined as a * b = a + b is e = 0  R.

Note that the identity element e = 0 is unique which means that for all a  R, that
Is any value from R, the identity element is always 0 such that a + 0 = 0 + a = a.
Take for example if a = 6, then a + e = a implies 6 + 0 = 6.
iii. Determine the inverse a’ of a in R.
Ǝ a’  R s.t. a’ * a = a * a’ = e, a  R (read as: “There exist an a’ in R such that
a’ * a = a * a’ = e for all a element of R”.)
sol’n. Ǝ a’  R s.t. a’ * a = a * a’ = e, a  R. That is, a’ + a = a + a’ = 0 for a  R.
a’ + a = e or a * a’ = e
a’ + a = e a + a’ = e
a’ = e – a a’ = e – a
a’ = 0 – a a’ = 0 – a
a’ = -a a’ = -a

Hence, the inverse a’ = -a which is the negative of a, a  R. This inverse should be

defined in all elements of the set of real numbers R. Take for example a = 1, then a’ = -1,
That is the negative of 1. It holds true to all elements a of the set of real numbers R.
And all of these inverses are also in R.

Since all conditions are met, Therefore <R, * > or <R, + > is a group.
QUESTIONS??