# Binary operation

 related topics {math, number, function}
 In mathematics, a binary operation is a calculation involving two operands, in other words, an operation whose arity is two. Examples include the familiar arithmetic operations of addition, subtraction, multiplication and division. More precisely, a binary operation on a set S is a binary relation that maps elements of the Cartesian product S × S to S: If f is not a function, but is instead a partial function, it is called a partial operation. For instance, division of real numbers is a partial function, because one can't divide by zero: a/0 is not defined for any real a. Note however that both in algebra and model theory the binary operations considered are defined on the whole of $S \times S$. Sometimes, especially in computer science, the term is used for any binary function. That f takes values in the same set S that provides its arguments is the property of closure. Binary operations are the keystone of algebraic structures studied in abstract algebra: they form part of groups, monoids, semigroups, rings, and more. Most generally, a magma is a set together with any binary operation defined on it. Many binary operations of interest in both algebra and formal logic are commutative or associative. Many also have identity elements and inverse elements. Typical examples of binary operations are the addition (+) and multiplication (×) of numbers and matrices as well as composition of functions on a single set. An example of an operation that is not commutative is subtraction (−). Examples of partial operations that are not commutative include division (/), exponentiation(^), and super-exponentiation(↑↑). Binary operations are often written using infix notation such as a ∗ b, a + b, a · b or (by juxtaposition with no symbol) ab rather than by functional notation of the form f(a, b). Powers are usually also written without operator, but with the second argument as superscript. Binary operations sometimes use prefix or postfix notation; this dispenses with parentheses. Prefix notation is also called Polish notation; postfix notation, also called reverse Polish notation, is probably more often encountered. Full article ▸
 related documents Currying General number field sieve Domain (mathematics) Quadratic programming Graph of a function Alexandroff extension Heap (data structure) Fibonacci coding Waring's problem Hamming distance Sharp-P-complete Alternating group Pseudometric space Concatenation Degenerate distribution Bernoulli process Unique factorization domain Geometric mean Static code analysis Equality (mathematics) Zeta distribution Iteration Snake lemma Bogosort Haar wavelet Differential cryptanalysis Boundary (topology) Data integrity Hilbert's fifth problem Bucket sort