Lesson plan

Binary operation

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: 3 + 4 = 7 . 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 a \star b rather than by functional notation of the form f(a, b) . Multiplication and exponentiation are frequently written without operator, but with exponents as superscript. In abstract algebra, a binary operation on a set S is a mapping of the elements of the Cartesian product S \times S to S : \,f \colon S \times S \rightarrow S. If the mapping is total, (S, f) is a magma. However, if f is a partial mapping, then f is a partial binary operation, which can be one of the operations in a partial algebra on S , such as the partial groupoid (S, f) . A binary operation f on a set S may be viewed as a ternary relation on S , that is, the set of triples (a, b, f(a,b)) in S \times S \times S for all a and b in S . Binary operations are the keystone of most structures that are studied in algebra, in particular in semigroups, monoids, groups, rings, fields, and vector spaces.

Back to article

Article summary

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: 3 + 4 = 7 . 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 a \star b rather than by functional notation of the form f(a, b) . Multiplication and exponentiation are frequently written without operator, but with exponents as superscript. In abstract algebra, a binary operation on a set S is a mapping of the elements of the Cartesian product S \times S to S : \,f \colon S \times S \rightarrow S. If the mapping is total, (S, f) is a magma. However, if f is a partial mapping, then f is a partial binary operation, which can be one of the operations in a partial algebra on S , such as the partial groupoid (S, f) . A binary operation f on a set S may be viewed as a ternary relation on S , that is, the set of triples (a, b, f(a,b)) in S \times S \times S for all a and b in S . Binary operations are the keystone of most structures that are studied in algebra, in particular in semigroups, monoids, groups, rings, fields, and vector spaces.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.