Invertible Mappings

Proposition (Invertible Mappings)    

    (i) A mapping is invertible if and only if it is both one-to-one and onto.
    
    (ii) An inverse of an invertible mapping is invertible.
    
    Proof. (i): Assume that is invertible with inverse Then being the identity mapping on is one-to-one; therefore, must be one-to-one. Also, being the identity mapping on is onto; whence is onto. Therefore, if is invertible it is also one-to-one and onto. Conversely, assume that is onto and one-to-one and Since is onto there exists such that But is also one-to-one, so this element must be unique. Using this , define This can be done for each element in and in this way a mapping is constructed such that and Thus is invertible.
    (ii):  Assume that is invertible with inverse Then being the identity mapping on is onto; therefore, must be onto. Also, being the identity mapping on is one-to-one; whence is one-to-one. Therefore β is invertible by part (i).  

Proposition (Composition-Invertible) Assume and

    (i) If and are invertible, then is invertible.
    
    (ii) If is invertible, then is onto and is one-to-one.
    
    Proof. (i): If and are invertible then and are one-to-one and onto. So is one-to-one and onto; whence is invertible.
    (ii): If is invertible, then is onto and one-to-one. Thus, is onto and is one-to-one.  

• print this page
• pages linking here
• related pages

Cite this as:
Invertible Mappings
Published by Library of Math -- Online math organized by subject into topics.
Written by Smith, David A.
http://www.libraryofmath.com/invertible-mappings.html