Difference between revisions of "Two-sided inverse"
From CS2800 wiki
(Created page with "{{Def|1=Two-sided inverse|2= If <math>f : A → B</math> is a function, then <math>g : B → A</math> is a two-sided inverse of <math>f</math> (written <math>g...") |
|||
Line 1: | Line 1: | ||
{{Def|1=Two-sided inverse|2= | {{Def|1=Two-sided inverse|2= | ||
− | If <math>f : A [[→]] B</math> is a [[function]], then <math>g : B [[→]] A</math> | + | If <math>f : A [[→]] B</math> is a [[function]], then <math>g : B [[→]] A</math> is a [[two-sided inverse]] of <math>f</math> if <math>f [[\circ]] g [[Equality (functions)|=]] [[id]]_B</math> and <math>g [[\circ]] f [[Equality (functions)|=]] [[id]]_A</math>. |
− | is a [[two-sided inverse]] of <math>f</math> | ||
− | if <math>f [[\circ]] g [[Equality (functions)|=]] [[id]]_B</math> and | ||
− | <math>g [[\circ]] f [[Equality (functions)|=]] [[id]]_A</math>. | ||
}} | }} | ||
+ | |||
+ | If <math>f</math> has a [[two-sided inverse]], [[Claim:two-sided inverses are unique|it must be unique]], so we are justified in writing ''the'' [[two-sided inverse]] of <math>f</math>. We also write <math>f^{[[-1]]}</math> to denote the inverse of <math>f</math> if it [[exists]]. | ||
<noinclude>{{:Example:inverses}}</noinclude> | <noinclude>{{:Example:inverses}}</noinclude> |
Revision as of 17:52, 18 February 2018
Definition: Two-sided inverse
If function, then is a two-sided inverse of if and .
is a If two-sided inverse, it must be unique, so we are justified in writing the two-sided inverse of . We also write to denote the inverse of if it exists.
has a
If
and
then is a left inverse of , because
For the same reason, right inverse of .
is aHowever, not a right inverse of (nor is a left inverse of ) because
isFinally, if and
, then and are two-sided inverses of each other, because