Multiplicative inverse

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Distinguish-redirect Template:More citations needed

Graph showing the diagrammatic representation of limits approaching infinity
The reciprocal function, y=1x. For every non-zero Template:Mvar coordinate, the corresponding Template:Mvar coordinate on the graph represents its multiplicative inverse. The graph forms a rectangular hyperbola.

In mathematics, a multiplicative inverse or reciprocal for a number Template:Mvar, denoted by 1x or Template:Math, is a number which when multiplied by Template:Mvar yields the multiplicative identity, 1. The multiplicative inverse of a fraction ab is ba. Dividing 1 by a real number yields its multiplicative inverse. For example, the reciprocal of 5 is one fifth (1/5 or 0.2), and the reciprocal of 0.25 is 1 divided by 0.25, or 4. The reciprocal function, the function Template:Math that maps Template:Mvar to 1x, is one of the simplest examples of a function which is its own inverse (an involution).

Multiplying by a number is the same as dividing by its reciprocal and vice versa. For example, multiplication by 4/5 (or 0.8) will give the same result as division by 5/4 (or 1.25). Therefore, multiplication by a number followed by multiplication by its reciprocal yields the original number (since the product of the number and its reciprocal is 1).

The term reciprocal was in common use at least as far back as the third edition of Encyclopædia Britannica (1797) to describe two numbers whose product is 1; geometrical quantities in inverse proportion are described as Template:Lang in a 1570 translation of Euclid's Elements.[1]

In the phrase multiplicative inverse, the qualifier multiplicative is often omitted and then tacitly understood (in contrast to the additive inverse). Multiplicative inverses can be defined over many mathematical domains as well as numbers. In these cases it can happen that Template:Math; then "inverse" typically implies that an element is both a left and right inverse.

The notation Template:Math is sometimes also used for the inverse function of the function Template:Mvar, which is for most functions not equal to the multiplicative inverse. For example, the multiplicative inverse 1sin⁡x=(sin⁡x)−1 is the cosecant of Template:Mvar, and not the [[Inverse trigonometric functions|inverse sine of Template:Mvar]] denoted by Template:Math or Template:Math. The terminology difference reciprocal versus inverse is not sufficient to make this distinction, since many authors prefer the opposite naming convention, probably for historical reasons (for example in French, the inverse function is preferably called the Template:Langx).

Examples and counterexamples

In the real numbers, zero does not have a reciprocal (division by zero is undefined) because no real number multiplied by 0 produces 1 (the product of any number with zero is zero). With the exception of zero, reciprocals of every real number are real, reciprocals of every rational number are rational, and reciprocals of every complex number are complex. The property that every element other than zero has a multiplicative inverse is part of the definition of a field, of which these are all examples. On the other hand, no integer other than 1 and −1 has an integer reciprocal, and so the integers are not a field.

In modular arithmetic, the modular multiplicative inverse of Template:Mvar is also defined: it is the number Template:Mvar such that Template:Math. This multiplicative inverse exists if and only if Template:Mvar and Template:Mvar are coprime. For example, the inverse of Template:Math is four because Template:Math. The extended Euclidean algorithm may be used to compute it.

The sedenions are an algebra in which every nonzero element has a multiplicative inverse, but which nonetheless has divisors of zero, that is, nonzero elements Template:Mvar, Template:Mvar such that Template:Math.

A square matrix has an inverse if and only if its determinant has an inverse in the coefficient ring. The linear map that has the matrix Template:Mvar with respect to some base is then the inverse function of the map having Template:Mvar as matrix in the same base. Thus, the two distinct notions of the inverse of a function are strongly related in this case, but they still do not coincide, since the multiplicative inverse of Template:Mvar would be Template:Math, not Template:Math.

These two notions of an inverse function do sometimes coincide, for example for the function f(x)=xi=eiln⁡(x) where Template:Math is the principal branch of the complex logarithm and e−π<|x|<eπ: (1f∘f)(x)=1f(f(x))=1f(f(x))=1eiln⁡(eiln⁡(x))=1eiiln⁡(x)=1e−ln⁡(x)=x.

The trigonometric functions are related by the reciprocal identity: the cotangent is the reciprocal of the tangent; the secant is the reciprocal of the cosine; the cosecant is the reciprocal of the sine.

A ring in which every nonzero element has a multiplicative inverse is a division ring; likewise an algebra in which this holds is a division algebra.

Complex numbers

The inverses Template:Mvar, Template:Mvar, Template:Mvar, and Template:Mvar of the complex numbers Template:Mvar, Template:Mvar, Template:Mvar and Template:Mvar are constructed by a composition of an inversion in the unit circle and a reflection over the real axis.

As mentioned above, the reciprocal of every nonzero complex number Template:Math is complex. It can be found by multiplying both top and bottom of 1z by its complex conjugate z¯=a−bi and using the property that zz¯=‖z‖2, the absolute value of Template:Mvar squared, which is the real number Template:Math:

1z=z¯zz¯=z¯‖z‖2=a−bia2+b2=aa2+b2−ba2+b2i.

The intuition is that z¯‖z‖ gives us the complex conjugate with a magnitude reduced to a value of 1, so dividing again by Template:Mvar ensures that the magnitude is now equal to the reciprocal of the original magnitude as well, hence: 1z=z¯‖z‖2 In particular, if Template:Math (Template:Mvar has unit magnitude), then 1z=z¯. Consequently, the imaginary units, Template:Math, have additive inverse equal to multiplicative inverse, and are the only complex numbers with this property. For example, additive and multiplicative inverses of Template:Math are Template:Math and Template:Math, respectively.

For a complex number in polar form Template:Math, the reciprocal simply takes the reciprocal of the magnitude and the negative of the angle:

1z=1r(cos⁡(−φ)+isin⁡(−φ)).

Geometric intuition for the integral of 1x. The three integrals from 1 to 2, from 2 to 4, and from 4 to 8 are all equal. Each region is the previous region halved vertically and doubled horizontally. Extending this, the integral from 1 to Template:Math is Template:Mvar times the integral from 1 to 2, just as Template:Math.

Geometrically in the complex plane the inverse of a complex number can be found by performing an inversion in the unit circle followed by a reflection over the real axis (see drawing).

Calculus

In real calculus, the derivative of 1x=x−1 is given by the power rule with the power −1: ddxx−1=(−1)x(−1)−1=−x−2=−1x2.

The power rule for integrals (Cavalieri's quadrature formula) cannot be used to compute the integral of 1x, because doing so would result in division by zero: ∫dxx=x00+C Instead the integral is given by: ∫1adxx=ln⁡a,∫dxx=ln⁡x+C. where Template:Math is the natural logarithm. To show this, note that ddyey=ey, so if x=ey and y=ln⁡x, we have:[2] dxdy=x⇒dxx=dy⇒∫dxx=∫dy=y+C=ln⁡x+C.

Algorithms

The reciprocal may be computed by hand with the use of long division.

Computing the reciprocal is important in many division algorithms, since the quotient ab can be computed by first computing 1b and then multiplying it by Template:Mvar. Noting that f(x)=1x−b has a zero at x=1b, Newton's method can find that zero, starting with a guess Template:Math and iterating using the rule:

xn+1=xn−f(xn)f′(xn)=xn−1xn−b−1xn2=2xn−bxn2=xn(2−bxn).

This continues until the desired precision is reached. For example, suppose we wish to compute Template:Math with three digits of precision. Taking Template:Math, the following sequence is produced:

x1=0.1(2−17×0.1)=0.03x2=0.03(2−17×0.03)=0.0447x3=0.0447(2−17×0.0447)≈0.0554x4=0.0554(2−17×0.0554)≈0.0586x5=0.0586(2−17×0.0586)≈0.0588

A typical initial guess can be found by rounding Template:Mvar to a nearby power of 2, then using bit shifts to compute its reciprocal.

In constructive mathematics, for a real number Template:Mvar to have a reciprocal, it is not sufficient that Template:Math. There must instead be given a rational number Template:Mvar such that Template:Math. In terms of the approximation algorithm described above, this is needed to prove that the change in Template:Mvar will eventually become arbitrarily small.

Graph of Template:Math showing the minimum at (1e, e−1/e).

This iteration can also be generalized to a wider sort of inverses; for example, matrix inverses.

Reciprocals of irrational numbers

Every real or complex number excluding zero has a reciprocal, and reciprocals of certain irrational numbers can have important special properties. Examples include the reciprocal of Template:Mvar (≈ 0.367879) and the golden ratio's reciprocal (≈ 0.618034). The first reciprocal is special because no other positive number can produce a lower number when put to the power of itself; f(1e) is the global minimum of Template:Math. The second number is the only positive number that is equal to its reciprocal plus one: φ=1φ+1. Its additive inverse is the only negative number that is equal to its reciprocal minus one: −φ=−1φ−1.

The function

f(n)=12n+(12n)2+1

can be used to find the irrational number which differs from its reciprocal by an integer Template:Mvar, because in general Template:Math. For example:

f(4)=2+5;f−1(4)=12+5=−2+5;∴f(4)−f−1(4)=4.

Such irrational numbers share an evident property: they have the same fractional part as their reciprocal, since these numbers differ by an integer.

The reciprocal function plays an important role in simple continued fractions, which have a number of remarkable properties relating to the representation of (both rational and) irrational numbers.

Further remarks

If the multiplication is associative, an element Template:Mvar with a multiplicative inverse cannot be a zero divisor (Template:Mvar is a zero divisor if some nonzero Template:Mvar, Template:Math). To see this, it is sufficient to multiply the equation Template:Math by the inverse of Template:Mvar (on the left), and then simplify using associativity. In the absence of associativity, the sedenions provide a counterexample.

The converse does not hold: an element which is not a zero divisor is not guaranteed to have a multiplicative inverse. Within Template:Tmath all integers except Template:Math provide examples; they are not zero divisors nor do they have inverses in Template:Tmath If the ring or algebra is finite, however, then all elements Template:Mvar which are not zero divisors do have a (left and right) inverse. For, first observe that the map Template:Math must be injective: Template:Math implies Template:Math: ax=ay⇒ax−ay=0⇒a(x−y)=0⇒x−y=0⇒x=y. Distinct elements map to distinct elements, so the image consists of the same finite number of elements, and the map is necessarily surjective. Specifically, Template:Mvar (namely multiplication by Template:Mvar) must map some element Template:Mvar to Template:Math, Template:Math, so that Template:Mvar is an inverse for Template:Mvar.

Applications

The expansion of the reciprocal 1q in any base can also act[3] as a source of pseudo-random numbers, if Template:Mvar is a "suitable" safe prime, a prime of the form Template:Math where Template:Mvar is also a prime. A sequence of pseudo-random numbers of length Template:Math will be produced by the expansion.

See also

Notes

  1. ↑ Template:Not a typo. OED "Reciprocal" §3a. Sir Henry Billingsley translation of Elements XI, 34.
  2. ↑ Template:Cite web
  3. ↑ Mitchell, Douglas W., "A nonlinear random number generator with known, long cycle length", Cryptologia 17, January 1993, 55–62.

References

  • Maximally Periodic Reciprocals, Matthews R.A.J. Bulletin of the Institute of Mathematics and its Applications vol 28 pp 147–148 1992