Science  People  Locations  Timeline
Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Binary operation


In mathematics, a binary operation, or binary operator, is a calculation involving two input quantities and one kind of a specific operation. It is sometimes called a dyadic operation as well. Examples include the familiar arithmetic operations of addition, subtraction, multiplication and division.

More precisely, a binary operation on a set S is a binary function from S and S to S, in other words a function f from the Cartesian product S × S to 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 magmaIn abstract algebra, a magma (also called a groupoid is a particularly basic kind of algebraic structure. Specifically, a magma consists of a set M equipped with a single binary operation M × M → M''. A binary operation is closed by definition, but n is a set together with any binary operation defined on it.

Many binary operations of interest are commutative or associative. Many also have identity elementIn mathematics, an identity element (or neutral element is a special type of element of a set with respect to a binary operation on that set. It leaves other elements unchanged when combined with them. The term identity element is often shortened to idents and inverse elementIn mathematics, the idea of inverse element generalises both of the concepts of negation, in relation to addition (see additive inverse), and reciprocal, in relation to multiplication. The intuition is of an element that can 'undo' the effect of combinatis. Typical examples of binary operations are the addition (+) and multiplication (*) of numbers and matrices as well as composition of functions on a single set.

Examples of operations that are not commutative are subtraction (-), division (/), exponentiation(^), and super-exponentiation(@).

Binary operations are often written using infix notation such as a * b, a + b, or a · b rather than by functional notation of the form f(a,b). Sometimes they are even written just by juxtaposition: ab. They can also be expressed using prefix or postfix notations. A prefix notation, Polish notation, dispenses with parentheses; it is probably more often encountered now in its postfix form, reverse Polish notation.



Read more »

Non User