A multiplicative inverse of an element is an element such that , where denotes the multiplicative identity of the system under consideration. It is written . For ordinary numbers, the multiplicative inverse is also called the reciprocal and is written . For example, the reciprocal of is , since . The concept extends beyond numbers to matrices and other algebraic objects, but whether an inverse exists depends on both the element and the system in which multiplication takes place.
Definition and basic properties
In abstract algebra, multiplicative inverses are usually considered in a system with an associative multiplication and an identity element. An identity satisfies
for every element . An element is invertible if it has a two-sided multiplicative inverse.
Associativity ensures that a two-sided inverse is unique. If and are both inverses of , then
This justifies referring to the inverse and using the notation .
Several identities follow whenever the relevant inverses exist:
and
The reversal of order in the last formula is essential when multiplication is not commutative. Indeed,
For an invertible element , negative integer powers are defined by
A multiplicative inverse differs from an additive inverse: the additive inverse of is , characterized by , rather than by a product equal to .
Reciprocals of numbers
Every nonzero rational number, real number, and complex number has a reciprocal within its respective number system.
For a nonzero fraction,
For example,
For a complex number , multiplying numerator and denominator by its complex conjugate gives
For instance,
Existence depends on the ambient system. The integer has no multiplicative inverse among the integers, although it has the inverse among the rationals. The only integers with integer multiplicative inverses are and .
Why zero has no reciprocal
In the usual number systems, zero has no multiplicative inverse because
for every , so the product cannot equal . Consequently, division by zero is undefined in ordinary arithmetic.
The same reasoning applies in any ring with . The exceptional zero ring has ; its sole element satisfies the inverse equation, but it is not a field under the usual definition.
Division as multiplication by an inverse
For numbers, division by a nonzero number is defined through its reciprocal:
Thus,
when and are nonzero. This is the algebraic basis of the rule for dividing by a fraction.
Inverses in algebraic structures
Groups, rings, and fields
In group theory, every element of a group has an inverse relative to the group operation. When that operation is written as multiplication, these are multiplicative inverses. Under ordinary multiplication, the nonzero real numbers form a group; all real numbers together do not, because zero is not invertible.
In a ring with identity, an element with a multiplicative inverse inside the ring is called a unit. The units form a group under multiplication, called the group of units.
A field is a commutative ring with in which every nonzero element is a unit. The rational, real, and complex numbers are fields. The integers are not.
The distinction between a nonzero element and an invertible element is important. For example, is nonzero in the integer ring but is not a unit there.
Left and right inverses
When multiplication is noncommutative, the equations
must initially be distinguished. In the first equation, is a left inverse of ; in the second, is a right inverse.
If both a left inverse and a right inverse exist in an associative system, they are equal:
However, the existence of a one-sided inverse alone need not imply that it is two-sided in an arbitrary algebraic system.
This distinction also makes division ambiguous in noncommutative settings: and need not be equal.
Modular multiplicative inverses
In modular arithmetic, an inverse of an integer modulo , with , is a residue class represented by an integer satisfying
Such an inverse exists exactly when the greatest common divisor satisfies
If it exists, it is unique modulo , although infinitely many integers represent that residue class.
For example,
so the inverse of modulo is . By contrast, has no inverse modulo , since .
The extended Euclidean algorithm computes integers such that
When the greatest common divisor is , reduction modulo gives
so represents the inverse.
For a prime , every nonzero residue class modulo is invertible, and these residue classes together with zero form a finite field. By Fermat’s little theorem,
when does not divide . Modular inverses are used to solve congruences and perform division in finite-field computations.
Matrix inverses
For a square matrix , a multiplicative inverse is a matrix satisfying
where is the identity matrix. This is the matrix inverse.
A square matrix over a field is invertible exactly when its determinant is nonzero. For a matrix,
the inverse is
A nonzero matrix need not be invertible. For example,
is nonzero but has determinant zero.
Taking the reciprocal of each entry generally does not produce the matrix inverse. Matrix inversion is defined using matrix multiplication, not entrywise multiplication.
In linear algebra, an invertible matrix represents a reversible linear transformation. If is invertible, the system of linear equations
has the unique solution . Computational methods often obtain this solution without explicitly forming .
Reciprocal functions and inverse functions
For a numerical function , its reciprocal function is defined pointwise by
wherever .
This is different from an inverse function, which reverses a function under composition. If
then
whereas
For functions, the notation conventionally denotes the compositional inverse, not the pointwise reciprocal.
If is differentiable and nonzero, the derivative of its reciprocal is
In particular,
The real reciprocal function is continuous on its domain but is undefined at zero and unbounded near it.
Numerical computation
In floating-point arithmetic, a computed reciprocal is generally an approximation because the exact result may not be representable. For example, has no finite binary expansion.
An approximate reciprocal can be refined using Newton’s method:
If , exact arithmetic gives
Thus, a sufficiently accurate initial approximation can improve rapidly, though rounding and the representable number range limit the computation.
Small denominators require care in numerical interpretation. A small absolute perturbation in a number near zero can cause a large absolute change in its reciprocal. Nevertheless, for the scalar function , the relative condition number is
Thus scalar reciprocation is well-conditioned in relative terms away from representational limits; matrix inversion, by contrast, can be highly sensitive to perturbations when a matrix is close to singular.