Operation (mathematics)

Arity and common examples

Operations are classified by arity, the number of inputs they take. Common classes include:

• Nullary (no input): a constant can be seen as a 0-ary operation that always returns the same value.
• Unary (one input): examples are negation or absolute value.
• Binary (two inputs): the most familiar in elementary math.
• n-ary / variadic: operations that accept any finite number of operands, like summation of a list.

Typical named operations include addition, subtraction, multiplication, and division. Others important in higher arithmetic and analysis are exponentiation, root extraction and the logarithm. Beyond numbers, operations appear for sets (union, intersection), logical values (AND, OR), vectors and matrices (addition and various products), and for functions (composition).

Algebraic properties

Many operations satisfy structural properties that determine the behavior of expressions and the algebraic systems they define. Important properties include:

• Commutativity: a ⋆ b = b ⋆ a for all operands.
• Associativity: (a ⋆ b) ⋆ c = a ⋆ (b ⋆ c), enabling omission of extra parentheses.
• Identity element: an element e with e ⋆ a = a ⋆ e = a.
• Inverse element: an element b such that a ⋆ b = identity.
• Distributivity: one operation distributes over another, as multiplication distributes over addition.

These properties are central to defining structures such as groups, rings and fields, where one or more operations and their interaction determine the system's rules.

Operations in algebraic structures and computation

In abstract algebra a set equipped with one or more operations becomes an algebraic structure. For instance, a group is a set with a single associative binary operation that has an identity and inverses. A ring employs two operations (addition and multiplication) with specific distributive relationships. In computation, operations are implemented as operators or functions; languages distinguish infix, prefix and postfix notation and may provide operator overloading so the same symbol denotes different concrete operations in different contexts.

Partial operations, notation and higher-order view

Not every rule is total: a partial operation may be undefined for some inputs (division by zero is the usual example). Notational conventions vary—most textbooks use infix symbols like + and × for binary arithmetic, while functional notation f(x) or prefix operators emphasize the operation-as-function viewpoint. Currying treats n-ary operations as sequences of unary operations and is especially useful in logic and functional programming.

Uses, examples and distinctions

Operations are the building blocks of calculation and structure. They appear in solving equations, defining algorithms, building models in physics and engineering, and designing data transformations in computer science. It is helpful to distinguish an operation from a relation: an operation produces a definite result for given inputs (when defined), whereas a relation merely specifies which tuples satisfy a condition. Also, a single symbol may denote different operations in different contexts (for example, juxtaposition can mean multiplication in algebra or function application in analysis), so context and declared types matter.

For more formal introductions and examples see general references on binary operations and beginner texts on algebraic structures referenced in standard mathematics literature (mathematics, function overview).