GetWiki
binary operation
ARTICLE SUBJECTS
being →
database →
ethics →
fiction →
history →
internet →
language →
linux →
logic →
method →
news →
policy →
purpose →
religion →
science →
software →
truth →
unix →
wiki →
ARTICLE TYPES
essay →
feed →
help →
system →
wiki →
ARTICLE ORIGINS
critical →
forked →
imported →
original →
binary operation
please note:
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
{{Short description|Mathematical operation with two operands}}{{Distinguish|Bitwise operation}}(File:Binary operations as black box.svg|thumb|A binary operation circ is a rule for combining the arguments x and y to produce xcirc y)In mathematics, a binary operation or dyadic operation is a rule for combining two elements (called operands) to produce another element. More formally, a binary operation is an operation of arity two.More specifically, a binary operation on a set is a binary operation whose two domains and the codomain are the same set. Examples include the familiar arithmetic operations of addition, subtraction, and multiplication. Other examples are readily found in different areas of mathematics, such as vector addition, matrix multiplication, and conjugation in groups.An operation of arity two that involves several sets is sometimes also called a binary operation. For example, scalar multiplication of vector spaces takes a scalar and a vector to produce a vector, and scalar product takes two vectors to produce a scalar. Such binary operations may also be called binary functions.Binary operations are the keystone of most structures that are studied in algebra, in particular in semigroups, monoids, groups, rings, fields, and vector spaces.- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
Terminology
More precisely, a binary operation on a set S is a mapping of the elements of the Cartesian product S times S to S:{{harvnb|Rotman|1973|loc=pg. 1}}{{harvnb|Hardy|Walker|2002|loc=pg. 176, Definition 67}}{{harvnb|Fraleigh|1976|loc= pg. 10}}
,f colon S times S rightarrow S.
The closure property of a binary operation expresses the existence of a result for the operation given any pair of operands.{{harvnb|Hall|1959|loc=pg. 1}}If f is not a function but a partial function, then f is called a partial binary operation. For instance, division of real numbers is a partial binary operation, because one can not divide by zero: frac{a}{0} is undefined for every real number a. In both model theory and classical universal algebra, binary operations are required to be defined on all elements of S times S. However, partial algebrasBOOK, George A. Grätzer, Universal Algebra,archive.org/details/isbn_9780387774862, registration, 2008, Springer Science & Business Media, 978-0-387-77487-9, Chapter 2. Partial algebras, 2nd, generalize universal algebras to allow partial operations.Sometimes, especially in computer science, the term binary operation is used for any binary function.Properties and examples
Typical examples of binary operations are the addition (+) and multiplication (times) of numbers and matrices as well as composition of functions on a single set.For instance,- On the set of real numbers mathbb R, f(a,b)=a+b is a binary operation since the sum of two real numbers is a real number.
- On the set of natural numbers mathbb N, f(a,b)=a+b is a binary operation since the sum of two natural numbers is a natural number. This is a different binary operation than the previous one since the sets are different.
- On the set M(2,mathbb R) of 2 times 2 matrices with real entries, f(A,B)=A+B is a binary operation since the sum of two such matrices is a 2 times 2 matrix.
- On the set M(2,mathbb R) of 2 times 2 matrices with real entries, f(A,B)=AB is a binary operation since the product of two such matrices is a 2 times 2 matrix.
- For a given set C, let S be the set of all functions h colon C rightarrow C. Define f colon S times S rightarrow S by f(h_1,h_2)(c)=(h_1 circ h_2)(c)=h_1(h_2(c)) for all c in C, the composition of the two functions h_1 and h_2 in S. Then f is a binary operation since the composition of the two functions is again a function on the set C (that is, a member of S).
Notation
Binary operations are often written using infix notation such as a ast b, a+b, a cdot 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 are sometimes written using prefix or (more frequently) postfix notation, both of which dispense with parentheses. They are also called, respectively, Polish notation ast a b and reverse Polish notation a b ast.Binary operations as ternary relations
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.Other binary operations
For example, scalar multiplication in linear algebra. Here K is a field and S is a vector space over that field.Also the dot product of two vectors maps S times S to K, where K is a field and S is a vector space over K. It depends on authors whether it is considered as a binary operation.See also
- (:Category:Properties of binary operations)
- {{annotated link|Iterated binary operation}}
- {{annotated link|Magma (algebra)}}
- {{annotated link|Operator (programming)}}
- {{annotated link|Ternary operation}}
- {{slink|Truth tableBinary operations}}
- {{annotated link|Unary operation}}
Notes
{{Reflist}}References
- {{citation|last=Fraleigh|first=John B.|title=A First Course in Abstract Algebra|edition=2nd|publisher=Addison-Wesley|place=Reading|year=1976|isbn=0-201-01984-1}}
- {{citation|last=Hall|first= Marshall Jr.|title=The Theory of Groups|publisher=Macmillan|place=New York|year=1959}}
- {{citation|last1=Hardy|first1=Darel W.|last2=Walker|first2=Carol L.|author2-link=Carol Walker|title=Applied Algebra: Codes, Ciphers and Discrete Algorithms|publisher=Prentice-Hall|place=Upper Saddle River, NJ|year=2002|isbn=0-13-067464-8}}
- {{citation|last=Rotman|first=Joseph J.|title=The Theory of Groups: An Introduction|publisher=Allyn and Bacon|place=Boston|year=1973|edition=2nd}}
External links
- {{MathWorld|title=Binary Operation|urlname=BinaryOperation}}
- content above as imported from Wikipedia
- "binary operation" does not exist on GetWiki (yet)
- time: 4:00am EDT - Wed, May 22 2024
- "binary operation" does not exist on GetWiki (yet)
- time: 4:00am EDT - Wed, May 22 2024
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 21 MAY 2024
The Illusion of Choice
Culture
Culture
GETWIKI 09 JUL 2019
Eastern Philosophy
History of Philosophy
History of Philosophy
GETWIKI 09 MAY 2016
GetMeta:About
GetWiki
GetWiki
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
Biographies
GETWIKI 20 AUG 2014
GetMeta:News
GetWiki
GetWiki
© 2024 M.R.M. PARROTT | ALL RIGHTS RESERVED