{
  "id": "multiplicative-inverse",
  "title": "Multiplicative Inverse",
  "lang": "en",
  "source_lang": "en",
  "summary": "A multiplicative inverse is an element that, when multiplied by a given element in either order, produces the multiplicative identity.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Reciprocal",
    "Multiplicative reciprocal"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/multiplicative-inverse/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/multiplicative-inverse/",
      "json": "https://aiwiki.page/zh/multiplicative-inverse.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A multiplicative inverse of an element \\(a\\) is an element \\(b\\) such that \\(ab=ba=1\\), where \\(1\\) denotes the multiplicative identity of the system under consideration. It is written \\(a^{-1}\\). For ordinary numbers, the multiplicative inverse is also called the reciprocal and is written \\(1/a\\). For example, the reciprocal of \\(5\\) is \\(1/5\\), since \\(5(1/5)=1\\). 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."
    },
    {
      "heading": "Definition and basic properties",
      "text": "In abstract algebra, multiplicative inverses are usually considered in a system with an associative multiplication and an identity element. An identity satisfies\n\n\\[1a=a1=a\\]\n\nfor every element \\(a\\). An element is invertible if it has a two-sided multiplicative inverse.\n\nAssociativity ensures that a two-sided inverse is unique. If \\(b\\) and \\(c\\) are both inverses of \\(a\\), then\n\n\\[b=b(ac)=(ba)c=c.\\]\n\nThis justifies referring to the inverse and using the notation \\(a^{-1}\\).\n\nSeveral identities follow whenever the relevant inverses exist:\n\n\\[(a^{-1})^{-1}=a,\\qquad 1^{-1}=1,\\]\n\nand\n\n\\[(ab)^{-1}=b^{-1}a^{-1}.\\]\n\nThe reversal of order in the last formula is essential when multiplication is not commutative. Indeed,\n\n\\[(ab)(b^{-1}a^{-1}) =a(bb^{-1})a^{-1}=1.\\]\n\nFor an invertible element \\(a\\), negative integer powers are defined by\n\n\\[a^{-n}=(a^{-1})^n,\\qquad n\\geq 1.\\]\n\nA multiplicative inverse differs from an additive inverse: the additive inverse of \\(a\\) is \\(-a\\), characterized by \\(a+(-a)=0\\), rather than by a product equal to \\(1\\)."
    },
    {
      "heading": "Reciprocals of numbers",
      "text": "Every nonzero rational number, real number, and complex number has a reciprocal within its respective number system.\n\nFor a nonzero fraction,\n\n\\[\\left(\\frac{p}{q}\\right)^{-1}=\\frac{q}{p}, \\qquad p\\neq 0,\\quad q\\neq 0.\\]\n\nFor example,\n\n\\[\\left(\\frac{3}{7}\\right)^{-1}=\\frac{7}{3}, \\qquad (-4)^{-1}=-\\frac14.\\]\n\nFor a complex number \\(z=a+bi\\neq 0\\), multiplying numerator and denominator by its complex conjugate gives\n\n\\[z^{-1} =\\frac{a-bi}{a^2+b^2}.\\]\n\nFor instance,\n\n\\[(1+i)^{-1}=\\frac{1-i}{2}.\\]\n\nExistence depends on the ambient system. The integer \\(2\\) has no multiplicative inverse among the integers, although it has the inverse \\(1/2\\) among the rationals. The only integers with integer multiplicative inverses are \\(1\\) and \\(-1\\).\n\nWhy zero has no reciprocal\n\nIn the usual number systems, zero has no multiplicative inverse because\n\n\\[0b=0\\]\n\nfor every \\(b\\), so the product cannot equal \\(1\\). Consequently, division by zero is undefined in ordinary arithmetic.\n\nThe same reasoning applies in any ring with \\(0\\neq 1\\). The exceptional zero ring has \\(0=1\\); its sole element satisfies the inverse equation, but it is not a field under the usual definition.\n\nDivision as multiplication by an inverse\n\nFor numbers, division by a nonzero number is defined through its reciprocal:\n\n\\[\\frac{a}{b}=ab^{-1},\\qquad b\\neq 0.\\]\n\nThus,\n\n\\[\\frac{a}{p/q}=a\\frac{q}{p}\\]\n\nwhen \\(p\\) and \\(q\\) are nonzero. This is the algebraic basis of the rule for dividing by a fraction."
    },
    {
      "heading": "Inverses in algebraic structures",
      "text": "Groups, rings, and fields\n\nIn 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.\n\nIn 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.\n\nA field is a commutative ring with \\(0\\neq 1\\) in which every nonzero element is a unit. The rational, real, and complex numbers are fields. The integers are not.\n\nThe distinction between a nonzero element and an invertible element is important. For example, \\(2\\) is nonzero in the integer ring but is not a unit there.\n\nLeft and right inverses\n\nWhen multiplication is noncommutative, the equations\n\n\\[ba=1 \\quad\\text{and}\\quad ac=1\\]\n\nmust initially be distinguished. In the first equation, \\(b\\) is a left inverse of \\(a\\); in the second, \\(c\\) is a right inverse.\n\nIf both a left inverse and a right inverse exist in an associative system, they are equal:\n\n\\[b=b(ac)=(ba)c=c.\\]\n\nHowever, the existence of a one-sided inverse alone need not imply that it is two-sided in an arbitrary algebraic system.\n\nThis distinction also makes division ambiguous in noncommutative settings: \\(ab^{-1}\\) and \\(b^{-1}a\\) need not be equal."
    },
    {
      "heading": "Modular multiplicative inverses",
      "text": "In modular arithmetic, an inverse of an integer \\(a\\) modulo \\(n\\), with \\(n\\geq 2\\), is a residue class represented by an integer \\(b\\) satisfying\n\n\\[ab\\equiv 1\\pmod n.\\]\n\nSuch an inverse exists exactly when the greatest common divisor satisfies\n\n\\[\\gcd(a,n)=1.\\]\n\nIf it exists, it is unique modulo \\(n\\), although infinitely many integers represent that residue class.\n\nFor example,\n\n\\[3\\cdot 5=15\\equiv 1\\pmod 7,\\]\n\nso the inverse of \\(3\\) modulo \\(7\\) is \\(5\\). By contrast, \\(2\\) has no inverse modulo \\(6\\), since \\(\\gcd(2,6)=2\\).\n\nThe extended Euclidean algorithm computes integers \\(x,y\\) such that\n\n\\[ax+ny=\\gcd(a,n).\\]\n\nWhen the greatest common divisor is \\(1\\), reduction modulo \\(n\\) gives\n\n\\[ax\\equiv 1\\pmod n,\\]\n\nso \\(x\\) represents the inverse.\n\nFor a prime \\(p\\), every nonzero residue class modulo \\(p\\) is invertible, and these residue classes together with zero form a finite field. By Fermat’s little theorem,\n\n\\[a^{-1}\\equiv a^{p-2}\\pmod p\\]\n\nwhen \\(p\\) does not divide \\(a\\). Modular inverses are used to solve congruences and perform division in finite-field computations."
    },
    {
      "heading": "Matrix inverses",
      "text": "For a square matrix \\(A\\), a multiplicative inverse is a matrix \\(A^{-1}\\) satisfying\n\n\\[AA^{-1}=A^{-1}A=I,\\]\n\nwhere \\(I\\) is the identity matrix. This is the matrix inverse.\n\nA square matrix over a field is invertible exactly when its determinant is nonzero. For a \\(2\\times 2\\) matrix,\n\n\\[A= \\begin{pmatrix} a&b\\\\ c&d \\end{pmatrix},\\]\n\nthe inverse is\n\n\\[A^{-1} =\\frac{1}{ad-bc} \\begin{pmatrix} d&-b\\\\ -c&a \\end{pmatrix}, \\qquad ad-bc\\neq 0.\\]\n\nA nonzero matrix need not be invertible. For example,\n\n\\[\\begin{pmatrix} 1&0\\\\ 0&0 \\end{pmatrix}\\]\n\nis nonzero but has determinant zero.\n\nTaking the reciprocal of each entry generally does not produce the matrix inverse. Matrix inversion is defined using matrix multiplication, not entrywise multiplication.\n\nIn linear algebra, an invertible matrix represents a reversible linear transformation. If \\(A\\) is invertible, the system of linear equations\n\n\\[Ax=b\\]\n\nhas the unique solution \\(x=A^{-1}b\\). Computational methods often obtain this solution without explicitly forming \\(A^{-1}\\)."
    },
    {
      "heading": "Reciprocal functions and inverse functions",
      "text": "For a numerical function \\(f\\), its reciprocal function is defined pointwise by\n\n\\[\\left(\\frac1f\\right)(x)=\\frac{1}{f(x)}\\]\n\nwherever \\(f(x)\\neq 0\\).\n\nThis is different from an inverse function, which reverses a function under composition. If\n\n\\[f(x)=2x,\\]\n\nthen\n\n\\[\\frac1{f(x)}=\\frac1{2x},\\]\n\nwhereas\n\n\\[f^{-1}(x)=\\frac{x}{2}.\\]\n\nFor functions, the notation \\(f^{-1}\\) conventionally denotes the compositional inverse, not the pointwise reciprocal.\n\nIf \\(f\\) is differentiable and nonzero, the derivative of its reciprocal is\n\n\\[\\left(\\frac1f\\right)'(x) =-\\frac{f'(x)}{[f(x)]^2}.\\]\n\nIn particular,\n\n\\[\\frac{d}{dx}\\left(\\frac1x\\right)=-\\frac1{x^2}, \\qquad x\\neq 0.\\]\n\nThe real reciprocal function \\(x\\mapsto 1/x\\) is continuous on its domain but is undefined at zero and unbounded near it."
    },
    {
      "heading": "Numerical computation",
      "text": "In floating-point arithmetic, a computed reciprocal is generally an approximation because the exact result may not be representable. For example, \\(1/3\\) has no finite binary expansion.\n\nAn approximate reciprocal can be refined using Newton’s method:\n\n\\[x_{k+1}=x_k(2-ax_k).\\]\n\nIf \\(e_k=1-ax_k\\), exact arithmetic gives\n\n\\[e_{k+1}=e_k^2.\\]\n\nThus, a sufficiently accurate initial approximation can improve rapidly, though rounding and the representable number range limit the computation.\n\nSmall 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 \\(f(a)=1/a\\), the relative condition number is\n\n\\[\\left|\\frac{af'(a)}{f(a)}\\right|=1 \\qquad(a\\neq 0).\\]\n\nThus 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."
    }
  ],
  "links": [
    "abstract-algebra",
    "integer",
    "rational-number",
    "real-number",
    "complex-number",
    "fraction",
    "zero",
    "group-theory",
    "ring-mathematics",
    "field-mathematics",
    "modular-arithmetic",
    "greatest-common-divisor",
    "euclidean-algorithm",
    "finite-field",
    "fermats-little-theorem",
    "matrix",
    "identity-matrix",
    "inverse-matrix",
    "determinant",
    "matrix-multiplication",
    "linear-algebra",
    "system-of-linear-equations",
    "inverse-function",
    "derivative",
    "floating-point-arithmetic",
    "newtons-method",
    "condition-number"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}