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.
Properties of Binary Operation:
- Closure Property: A binary operation * on a non-empty set P has closure property, if a ∈ P, b ∈ P ⇒ a * b ∈ P.
- 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. 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.
- 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).
- 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.
Read More: Truth Table
Types of Binary Operation:
There are four main types of binary operations which are: