Operation (mathematics)

In mathematics, an operation is formally defined as a function from a set to itself, or more generally, from a Cartesian product of sets to a single set. For instance, a binary operation on a set S is a function f: S × S → S. This means it takes two elements from the set S and produces a single element that is also in S.

The most common operations studied are binary operations, such as addition (+) and multiplication (×) on the set of real numbers (ℝ), where a + b ∈ ℝ and a × b ∈ ℝ for all a, b ∈ ℝ. Unary operations, like the additive inverse (-a) or multiplicative inverse (1/a), are functions from S to S. Nullary operations, or constants, can be viewed as functions from the empty set to S, effectively yielding a fixed element of S.

The concept of arity, the number of arguments an operation takes, is fundamental to classifying these functions.

The development of mathematical operations is a story of increasing abstraction and formalization. Initially, operations emerged from practical needs: counting, measuring, and trading. Early arithmetic systems focused on concrete procedures for addition, subtraction, multiplication, and division.

The development of symbolic notation, particularly during the Renaissance and Enlightenment, allowed for the representation of general operations independent of specific numbers. This led to the birth of algebra, where operations could be applied to variables and abstract quantities. Later, mathematicians like Emmy Noether and others in the 20th century generalized these concepts further, leading to abstract algebra, where operations are studied as fundamental properties of algebraic structures like groups, rings, and fields, often without reference to numbers at all.

Mathematical operations are the bedrock upon which modern science, engineering, and computer science are built. In physics, operations describe interactions and transformations of physical quantities. In computer science, operations are the fundamental instructions executed by processors; algorithms are essentially sequences of operations. Cryptography relies heavily on complex operations to secure data, while machine learning and artificial intelligence use vast arrays of operations to process information and make predictions.

From the simple arithmetic operations in a calculator to the sophisticated matrix operations in graphics rendering or the logical operations in digital circuits, their ubiquitous presence underscores their critical importance in understanding and manipulating the world.

While most commonly encountered operations are finitary (taking a finite number of operands), the mathematical landscape also includes infinitary operations. These are functions that take an infinite sequence or set of inputs to produce an output. For example, in some areas of logic and set theory, operations like infinite sums or products are considered.

Conversely, partial operations are extensions of the concept where the function is not defined for all possible inputs. For instance, division by zero is an operation that is not defined for real numbers. These partial operations are crucial in areas like computability theory and the study of formal languages, where certain inputs might not yield a valid output or might lead to undefined states.