Binary Operation — Definition, Formula & Examples

A binary operation is a rule that takes exactly two elements from a set and combines them to produce a single element from the same set. Addition on the integers is a familiar example: you put in two integers and get one integer back.

A binary operation on a set $S$ is a function $\ast : S \times S \to S$ that assigns to each ordered pair $(a, b) \in S \times S$ a unique element $a \ast b \in S$ . The requirement that $a \ast b$ always lands back in $S$ is called closure.

Key Formula

\ast : S \times S \to S

Where:

$\ast$ = The binary operation (a general symbol; could also be written as +, ·, ∘, etc.)
$S$ = The underlying set on which the operation is defined
$S \times S$ = The set of all ordered pairs of elements from S

How It Works

To verify that a rule qualifies as a binary operation on a set

S

, check three things: (1) the rule accepts exactly two inputs from

S

, (2) it produces exactly one output, and (3) that output is also in

S

. If any pair of elements from

S

can produce a result outside

S

, the rule is not a binary operation on that set. Once you have a valid binary operation, you can investigate further properties like associativity, commutativity, and the existence of identity or inverse elements.

Worked Example

Problem: Determine whether subtraction is a binary operation on the set of natural numbers

\mathbb{N} = \{1, 2, 3, \dots\}

Step 1: Pick two elements from the set and apply the rule. Let

a = 3

and

b = 7

3 - 7 = -4

Step 2: Check whether the result is in the set. Since

-4 \notin \mathbb{N}

, closure fails.

Step 3: Because at least one pair of natural numbers produces a result outside

\mathbb{N}

, subtraction is not a binary operation on

\mathbb{N}

Answer: Subtraction is not a binary operation on

\mathbb{N}

because it does not satisfy closure.

Why It Matters

Binary operations are the starting point for defining groups, rings, and fields in abstract algebra. Every time you study symmetry in physics, error-correcting codes in computer science, or cryptographic algorithms, you are working with binary operations and the algebraic structures built on them.

Common Mistakes

Mistake: Forgetting to check closure — assuming any familiar arithmetic rule is automatically a binary operation on any set.

Correction: Always verify that the output stays within the specified set. Division on the integers, for instance, fails because

1 \div 2 = 0.5 \notin \mathbb{Z}