Binary Operations

students, welcome to one of the most important starting points in abstract algebra ✨. Before we can talk about groups, symmetry, or algebraic structures, we need a clear idea of what it means to combine two things in a consistent way. That idea is called a binary operation. In this lesson, you will learn what a binary operation is, how to tell whether a rule really counts as one, and why this concept matters for arithmetic, symmetry, and groups.

What is a binary operation?

A binary operation is a rule that takes two inputs from a set and gives one output from the same set. The word binary means “two,” and the word operation means a rule that combines things.

If $S$ is a set, then a binary operation on $S$ is a function

$$\ast : S \times S \to S.$$

This notation means that the operation takes an ordered pair of elements from $S$ and returns another element of $S$.

For example, if $a$ and $b$ are in $S$, then $a \ast b$ is also in $S$.

That “stays inside the set” part is very important. If the output leaves the set, then the rule is not a binary operation on that set.

Everyday idea

Think about combining two ingredients in a recipe 🍞. If the result is still a valid part of the recipe system, the rule is behaving like a binary operation. In math, the idea is more precise: the output must always remain inside the set.

How to tell whether a rule is a binary operation

To check whether a rule is a binary operation on a set $S$, ask two questions:

1. Does it take exactly two elements of $S$ as input?
2. Is the output always an element of $S$?

If the answer to both is yes, then the rule is a binary operation on $S$.

Example 1: Addition on integers

Let $\mathbb{Z}$ be the set of integers. The rule $a + b$ is a binary operation on $\mathbb{Z}$ because if $a$ and $b$ are integers, then $a + b$ is also an integer.

For instance,

$$3 + (-5) = -2,$$

and $-2$ is still in $\mathbb{Z}$.

So addition is a binary operation on $\mathbb{Z}$.

Example 2: Subtraction on natural numbers

Let $\mathbb{N}$ be the set of natural numbers. Subtraction is not a binary operation on $\mathbb{N}$ if we use the usual definition, because the result may not stay in the set.

For example,

$$2 - 5 = -3,$$

and $-3$ is not a natural number.

So subtraction fails the closure requirement on $\mathbb{N}$.

Example 3: Multiplication on real numbers

On the set $\mathbb{R}$ of real numbers, multiplication is a binary operation because if $a,b \in \mathbb{R}$, then $ab \in \mathbb{R}$.

For example,

$$\frac{1}{2} \cdot 8 = 4.$$

The result stays in $\mathbb{R}$.

Closure: the key property behind binary operations

The most important idea connected to binary operations is closure. A set is closed under an operation if applying the operation to elements of the set always gives an element of the same set.

Closure does not mean the set contains every possible answer in the universe. It only means the answers stay inside the chosen set.

Example with integers

The integers are closed under addition because adding any two integers always gives another integer.

But the integers are not closed under division. For example,

$$1 \div 2 = \frac{1}{2},$$

and $\frac{1}{2}$ is not an integer.

So division is not a binary operation on $\mathbb{Z}$.

Why closure matters

Without closure, the rule does not stay inside the system you are studying. Abstract algebra is about systems where operations behave consistently inside a set. That consistency lets mathematicians build bigger ideas such as groups, rings, and fields.

Binary operations in arithmetic

Many familiar arithmetic rules are binary operations on certain sets.

Addition

Addition is a binary operation on sets like $\mathbb{Z}$, $\mathbb{Q}$, $\mathbb{R}$, and $\mathbb{C}$.

Example:

$$7 + 9 = 16.$$

Multiplication

Multiplication is also a binary operation on those same sets.

Example:

$$6 \cdot 4 = 24.$$

Subtraction and division

These are more limited.

• Subtraction is not a binary operation on $\mathbb{N}$.
• Division is not a binary operation on $\mathbb{Z}$.

But subtraction is a binary operation on $\mathbb{Z}$ because the result of subtracting two integers is always an integer:

$$5 - 12 = -7.$$

So whether a rule is a binary operation depends not only on the formula, but also on the set.

Binary operations in symmetry

Binary operations are not only about numbers. They also appear in symmetry, which is a major reason abstract algebra was developed 🧩.

Imagine rotating a square. You can rotate it by $90^\circ$, $180^\circ$, $270^\circ$, or $360^\circ$. If you perform one rotation and then another, the combined result is still a symmetry of the square.

This “do one after the other” rule is a binary operation.

Composition of motions

Suppose $r$ means rotate the square by $90^\circ$. Then doing $r$ followed by $r$ gives a $180^\circ$ rotation, which we can write as

$$r \ast r = r^2.$$

This is an example of a binary operation called composition.

Composition is common in symmetry groups, where the set consists of transformations like rotations or flips, and the operation is doing one transformation after another.

Why symmetry is useful

Symmetry shows that binary operations can combine actions, not just numbers. This helps algebra describe patterns in objects like squares, triangles, and molecules.

Properties you may notice later

Binary operations themselves only require two inputs and closure, but many important operations also have extra properties. These properties help define algebraic structures.

Commutative property

An operation is commutative if changing the order does not change the result:

$$a \ast b = b \ast a.$$

Addition on integers is commutative:

$$3 + 5 = 5 + 3.$$

But composition of symmetries is often not commutative. Doing one rotation and then a flip may give a different result from doing the flip first.

Associative property

An operation is associative if grouping does not change the result:

$$\left(a \ast b\right) \ast c = a \ast \left(b \ast c\right).$$

Addition is associative:

$$\left(2 + 3\right) + 4 = 2 + \left(3 + 4\right).$$

Associativity is very important in group theory because it allows us to combine multiple operations without ambiguity.

Binary operations and groups

A group is one of the central objects in abstract algebra. To understand groups, students, you first need binary operations.

A group is a set with a binary operation that satisfies four conditions:

1. Closure: the operation stays inside the set.
2. Associativity: grouping does not matter.
3. Identity element: there is an element that changes nothing.
4. Inverse element: every element has a partner that reverses it.

So binary operations are the foundation of group theory. Without a binary operation, a group cannot even be defined.

Example: integers under addition

The set $\mathbb{Z}$ with addition is a group.

• Closure: $a + b \in \mathbb{Z}$ for all $a,b \in \mathbb{Z}$.
• Associativity: $\left(a+b\right)+c = a+\left(b+c\right)$.
• Identity: $0$ since $a + 0 = a$.
• Inverse: each $a$ has inverse $-a$ since $a + (-a) = 0$.

This example is one of the clearest ways to see how binary operations support larger algebraic ideas.

A quick way to test examples

When you are given a rule and asked whether it is a binary operation, use this checklist ✅:

• Identify the set $S$.
• Check that the rule uses exactly two elements from $S$.
• Test whether the output always stays in $S$.
• If needed, try a few examples with numbers or objects.

Example with a custom rule

Suppose a rule on the integers is defined by

$$a \star b = a + b + 1.$$

Is $\star$ a binary operation on $\mathbb{Z}$?

Yes, because if $a,b \in \mathbb{Z}$, then $a+b+1 \in \mathbb{Z}$. The rule takes two integers and always returns an integer.

So $\star$ is a binary operation on $\mathbb{Z}$.

Conclusion

Binary operations are the basic tools that let abstract algebra study how elements combine. students, you have seen that a binary operation is a rule taking two elements from a set and returning one element of the same set. The most important first test is closure. You also saw that binary operations appear in arithmetic, where addition and multiplication work on many number sets, and in symmetry, where combining motions gives another symmetry.

This idea matters because groups and many other algebraic structures are built on binary operations. Understanding binary operations gives you the language to study more advanced algebraic systems with confidence 🚀.

Study Notes

• A binary operation on a set $S$ is a function $\ast : S \times S \to S$.
• A binary operation uses exactly two inputs and gives one output.
• The output must stay in the same set; this is called closure.
• Addition is a binary operation on sets like $\mathbb{Z}$, $\mathbb{Q}$, $\mathbb{R}$, and $\mathbb{C}$.
• Subtraction is not a binary operation on $\mathbb{N}$ because results may leave the set.
• Division is not a binary operation on $\mathbb{Z}$ because results may not be integers.
• Binary operations also appear in symmetry, especially through composition of transformations.
• Commutative means $a \ast b = b \ast a$.
• Associative means $\left(a \ast b\right) \ast c = a \ast \left(b \ast c\right)$.
• Groups are built from a set plus a binary operation that is closed and associative, with an identity and inverses.
• Understanding binary operations is the first step toward studying groups and other algebraic structures.