Definition: A binary operation on a set S is a function from the Cartesian product S × S to S. It takes two elements of S as inputs and produces exactly one element of S as output.
Notation: If * is a binary operation, its value on a and b is written a * b. The symbol * is a placeholder and may represent addition, multiplication, composition or another operation.
Closure requirement: The output must belong to S for every permitted pair of inputs. Thus a * b ∈ S whenever a, b ∈ S.
Ordered inputs: The Cartesian product S × S consists of ordered pairs. Consequently, the operation is defined for ordered inputs, and a * b need not equal b * a.
Operation tables: On finite sets, binary operations can be represented by tables. Each row and column corresponds to an input element, and the cell gives the output.
Different operations on the same set: A set can support many different binary operations. For example, the integers support addition, multiplication and subtraction, all of which are closed on Z. Division is not a binary operation on Z because division by zero is undefined and many quotients are not integers.
Algebraic importance: The properties of a binary operation determine whether the resulting system can form a semigroup, monoid, group or another algebraic structure.
Binary Operations on Sets
A binary operation on a set combines every ordered pair of elements of that set and assigns exactly one resulting element. Binary operations are fundamental to abstract algebra because they define how elements interact in structures such as semigroups, monoids, groups and rings.
* : S × S → S
Explanation
Example or application
A worked example has not yet been added.
Key Properties
Takes exactly two inputs.
Produces exactly one output.
Must be defined for every ordered pair in S × S.
Must return an element of S.
May be commutative or noncommutative.
May or may not be associative.
Examples
| Name | Operation | Set | Explanation |
|---|---|---|---|
Addition on integers | a * b = a + b | Z | The sum of any two integers is an integer, so addition is a binary operation on Z. |
Multiplication on real numbers | a * b = ab | R | The product of any two real numbers is real. |
Subtraction on natural numbers | a * b = a - b | N | This is not a binary operation on N because some differences, such as 2 - 5, are not natural numbers. |
Applications
Defining the operation of a group or monoid.
Constructing operation tables for finite algebraic systems.
Studying arithmetic modulo n.
Defining composition of functions and transformations.
Common Mistakes
Confusing a binary operation with any calculation involving two numbers.
Ignoring closure.
Assuming a binary operation must be commutative.
Assuming the output may lie outside the underlying set.
Related Concepts
Cartesian Product
Closure
Associativity
Commutativity
Algebraic Structures
Learning Outcomes
Define a binary operation formally.
Identify the domain and codomain of an operation.
Check whether a proposed operation is closed.
Distinguish binary operations from partially defined calculations.
Learning Guide
Core Idea
A binary operation on a set combines every ordered pair of elements of that set and assigns exactly one resulting element. Binary operations are fundamental to abstract algebra because they define how elements interact in structures such as semigroups, monoids, groups and rings.
Worked Example
Name: Addition on integers
Operation: a * b = a + b
Set: Z
Explanation: The sum of any two integers is an integer, so addition is a binary operation on Z.
Name: Multiplication on real numbers
Operation: a * b = ab
Set: R
Explanation: The product of any two real numbers is real.
How To Study
Write the formal definition and identify every object, operation, and hypothesis.
Work through the supplied example one step at a time; explain why each step is valid.
Check the listed properties and compare the example with at least one common mistake.
Try the self-check questions without looking at the answers, then explain the reasoning aloud or in writing.
Self Check
| Question | Answer |
|---|---|
In your own words, what is binary operations on sets? | A binary operation on a set combines every ordered pair of elements of that set and assigns exactly one resulting element. Binary operations are fundamental to abstract algebra because they define how elements interact in structures such as semigroups, monoids, groups and rings. |
What definition, condition, or property should you check first when solving a problem about binary operations on sets? | Start by checking the relevant defining properties: Takes exactly two inputs; Produces exactly one output; Must be defined for every ordered pair in S × S; Must return an element of S. Verify every required hypothesis before applying a theorem. |
How is binary operations on sets connected to the wider study of abstract algebra? | It belongs to Sets, operations and basic structures. It connects naturally with Cartesian Product, Closure, Associativity, Commutativity. |
Mastery Checklist
I can state the definition of binary operations on sets accurately.
I can identify the assumptions and notation used in a problem.
I can explain at least one example and justify each important step.
I can recognize a common mistake and explain why it is incorrect.
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Standard introductory abstract-algebra definitions; no specific external reference has been independently verified.