Difference between revisions of "Inverse function"

From Wiki @ Karl Jones dot com
Jump to: navigation, search
(Created page with "In mathematics, if a function f(x)=y} f(x)=y is injective, exactly one function g(y) will exist such that g(y)=x, otherwi...")
 
 
Line 1: Line 1:
In [[mathematics]], if a [[Function (mathematics)|function]] f(x)=y} f(x)=y is [[Injective function|injective]], exactly one function g(y) will exist such that g(y)=x, otherwise no such function will exist.
+
In [[mathematics]], if a [[Function (mathematics)|function]] <code>f(x)=y</code> is [[Injective function|injective]], exactly one function <code>g(y)</code> will exist such that <code>g(y)=x</code>, otherwise no such function will exist.
  
The function g(y) is called the inverse function of f(x) because it "reverses" f(x); that is to say g(f(x))=x.
+
The function <code>g(y)</code> is called the inverse function of <code>f(x)</code> because it "reverses" <code>f(x)</code>; that is to say <code>g(f(x))=x</code>.
  
 
== See also ==
 
== See also ==

Latest revision as of 13:24, 8 September 2016

In mathematics, if a function f(x)=y is injective, exactly one function g(y) will exist such that g(y)=x, otherwise no such function will exist.

The function g(y) is called the inverse function of f(x) because it "reverses" f(x); that is to say g(f(x))=x.

See also

External links