Binary Operations
Binary Operations
Date:
03/26/25
Course&Year: BSEd-MATH 3
Binary Operation
A binary operation can be understood as a function f (x, y) that applies to two
elements of the same set S, such that the result will also be an element of the
set S. Examples of binary operations are the addition of integers,
multiplication of whole numbers, etc. A binary operation is a rule that is
applied on two elements of a set and the resultant element also belongs to the
same set.
The definition of binary operations states that "If S is a non-empty set, and * is
said to be a binary operation on S, then it should satisfy the condition which
says, if a ∈ S and b ∈ S, then a * b ∈ S, ∀ a, b ∈ S. In other words, * is a rule
for any two elements in the set S where both the input values and the output
value should belong to the set S. It is known as binary operations as it is
performed on two elements of a set and binary means two.
Properties of Binary Operation
Let us learn about the properties of binary operation in this section. The binary
operation properties are given below:
Closure Property: A binary operation * on a non-empty set P has
closure property, if a ∈ P, b ∈ P ⇒ a * b ∈ P. For example, addition
is a binary operation that is closed on natural numbers, integers,
and rational numbers.
Associative Property: The 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 '-'.
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.
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.
Identity Element: A non-empty set P with a binary operation * is said
to have an identity e ∈ P, if e*a = a*e= a, ∀ a ∈ P. Here, e is the
identity element.
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.
EXAMPLES: