invertibles

In mathematics, an invertible element is one that has a multiplicative inverse with respect to a given binary operation that includes an identity element. More concretely, in a structure such as a ring, a monoid, or an algebra, an element a is invertible if there exists another element b such that ab = ba = 1, where 1 denotes the identity for the operation. The set of all invertible elements of a structure forms a group under the same operation and is often called the group of units of the structure.

Examples help illustrate the concept. In the integers under multiplication, the only invertible elements are 1 and −1. In a polynomial ring over a field, the invertible (unit) polynomials are precisely the nonzero constants. In the ring of n-by-n matrices over a field F, invertible matrices are those with nonzero determinant; they form the group GL(n, F). A linear transformation is invertible exactly when it is bijective, and its inverse transformation serves as the inverse.

Key properties include the uniqueness of inverses: if a has an inverse a^{-1}, then a^{-1} is itself invertible and (a^{-1})^{-1} = a. The product of invertible elements is invertible, and the set of all invertibles is closed under multiplication and contains the identity. In many contexts, invertibility is preserved by structure-preserving maps such as isomorphisms: units map to units and retain their inverses.

In practice, invertibles are central to solving equations and constructing algebraic structures. In linear algebra, invertible matrices enable solving systems and defining many transformations; in ring theory, units allow the formation of fractions and localization. Overall, invertibles distinguish elements that can be “undone” from those that cannot.