Scribd
Upload
50 views

Relations, Functions, Equivalence Relation and Binary Operation

Functions and relations are different mathematical concepts. A function links each input to a single output, while a relation is a set of ordered pairs that may have multiple outputs for a single input. More specifically, a function is defined as an ordered triple consisting of a domain, co-domain, and set of ordered input-output pairs, with each input mapped to only one output. A relation instead defines certain properties or links between elements of two sets. Binary operations take two elements from a set and produce a third element in the same set. Examples include addition, subtraction, and matrix multiplication. Binary operations can have properties like associativity, commutativity, and distributivity.

Uploaded by

Angelika Sericon
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
50 views

Relations, Functions, Equivalence Relation and Binary Operation

Functions and relations are different mathematical concepts. A function links each input to a single output, while a relation is a set of ordered pairs that may have multiple outputs for a single input. More specifically, a function is defined as an ordered triple consisting of a domain, co-domain, and set of ordered input-output pairs, with each input mapped to only one output. A relation instead defines certain properties or links between elements of two sets. Binary operations take two elements from a set and produce a third element in the same set. Examples include addition, subtraction, and matrix multiplication. Binary operations can have properties like associativity, commutativity, and distributivity.

Uploaded by

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

Angelika R.

Sericon

BSEd-Math 3

Relations, Functions, Equivalence Relation

and Binary Operation

In mathematics, relations and functions include the relation between two objects in a
certain order. Both are different. Take, for instance, a function. A function is linked with a single
quantity. It is also associated with the argument of the function, input, and value of the
function, or otherwise known as the input. To put it in simple terms, a function is associated to
one specific output for every input. The value could be real numbers or any elements from a
provided set. On the other hand, relations are a group of ordered pairs of elements. It could be
a subset of the Cartesian product. Generally speaking, it is the relation between two sets. It
could be coined as a dyadic relation or a two-place relation. Relations are utilized in different
areas of mathematics just so model concepts are formed. Without relations, there wouldn’t be
“greater than,” “is equal to” or even “divides.”

On a more determined definition, function would pertain to an ordered triple set


consisting of the X,Y,F. “X” would be the domain, “Y” as the co-domain, and the “F” would have
to be the set of ordered pairs in both “a” and “b.” Each of the ordered pairs would contain a
primary element from the “A” set. The second element would come from the co-domain, and it
goes along with the necessary condition. It has to have a condition that each single element
found in the domain will be the primary element in one ordered pair. In the set “B” it would
pertain to the image of the function. It doesn’t have to be the entire co-domain. It can be
clearly known as the range. Do bear in mind that the domain and co-domain are both the set of
real numbers. Relation, on the other hand, will be the certain properties of items. In a way,
there are things that can be linked in some way so that’s why it’s called “relation.” Clearly, it
doesn’t imply that there are no in-betweens. One thing good about it is the binary relation. It
has all three sets. It includes the “X,” “Y” and “G.” “X” and “Y” are arbitrary classes, and the “G”
would just have to be the subset of the Cartesian product, X * Y. They are also coined as the
domain or perhaps the set of departure or even co-domain. “G” would simply be understood as
a graph.

Function would be the mathematical condition that links arguments to an


appropriate output value. The domain has to be finite so that the function “F” can be defined to
their respective function values. Oftentimes, the function could be characterized by a formula
or any algorithm. The concept of a function could be stretched out to an item that takes a
mixture of two argument values that can come up with a single outcome. All the more, the
function should have a domain that results from the Cartesian product of two or more sets.
Since the sets in a function are clearly understood, here’s what relations can do over a set. “X”
is equal to “Y.” The relation would end over “X.” So, in return, the involution would be the
mapping of a relation. So it is safe to say that relations would have to be spontaneous,
congruent, and transitive making it equivalence relation. In mathematics, an equivalence
relation is a binary relation that is reflexive, symmetric and transitive. The relation is equal to is
the canonical example of an equivalence relation.Each equivalence relation provides a partition
of the underlying set into disjoint equivalence classes. Two elements of the given set are
equivalent to each other if and only if they belong to the same equivalence class.

A binary operation takes two elements of a set S and spits out a third element, also from
the set S. Think of a binary operation as a mathematical machine that takes two inputs and
produces one output. The inputs and outputs are always from the same set S. In general, the
order of the input matters: let's look at some examples of binary operations. Consider the
binary operations of addition and subtraction, the first ones we learn in grade school.

When we use the binary operation of addition, we can take two whole numbers, like 1 and
2, and add them, like so: 1 + 2 = 3. In this example, 1 is the first input, 2 the second input, and 3
the output. Similarly, we can subtract: 2 - 1 = 1; in this example, 2 is the first input, 1 the second
input, and 1 the output. Multiplication and division are also binary operations. If you've ever
worked with matrices, matrix addition and multiplication are further examples of binary
operations. Function composition is another example that is studied extensively in abstract
algebra.We can also come up with our own binary operations by combining known operations.

Binary operations had different properties such as associative, commutative, distributive


and inverse. So, first we had associative property of binary operations holds if, for a non-empty
set S, we can write (a * b) *c = a*(b * c), where {a, b, c} ∈ S. Suppose Z be the set of integers
and multiplication be the binary operation. Let, a = -3, b = 5, and c = -16. We can write (a × b) ×
c = 240 = a × (b × c). Please note that all binary operations are not associative, for example,
subtraction denoted by '-'. Second, commutative property a binary operation on a non-empty
set S is commutative, if a * b = b * a, for all (a, b) ∈ S. Suppose addition be the binary operation
and N be the set of natural numbers. Let, a = 4 and b = 5, a + b = 9 = b + a. Third, distributive
property: Let * and # be two binary operations defined on a non-empty set S. The binary
operations are distributive if, a* (b # c) = (a * b) # (a * c), for all {a, b, c} ∈ S. Suppose * is the
multiplication operation and # is the subtraction operation defined on Z (set of integers). Let, a
= 3, b = 4, and c = 7. Then, a*(b # c) = a × (b − c) = 3 × (4 − 7) = -9. And, (a * b) # (a * c) = (a × b) −
(a × c) = (3 × 4) − (3 × 7) = 12 − 21 = -9. Therefore, a* (b # c) = (a * b) # (a * c), for all {a, b, c} ∈ Z.
Lastly, Inverse Property: A non-empty set P with a binary operation * is said to have an inverse
element, if a * b = b * a = e, ∀ {a, b, e} ∈P. Here, a is the inverse of b, b is the inverse of a and e
is the identity element.

You might also like