Inverse of Inverse of Bijection

From ProofWiki
Jump to: navigation, search

Contents

Theorem

Let $f: S \to T$ be a bijection.


Then:

$\left({f^{-1}}\right)^{-1} = f$


Proof 1

Let $f: S \to T$ be a bijection.

From Bijection Composite with Inverse we have:

where $I_S$ and $I_T$ are the identity mappings on $S$ and $T$ respectively.

The result follows from Left and Right Inverses of Mapping are Inverse Mapping.

$\blacksquare$


Proof 2

A mapping is a relation.

Thus it follows that Inverse of Inverse Relation can be applied directly.

$\blacksquare$


Sources

Personal tools
Namespaces
Variants
Actions
Navigation
ProofWiki.org
ToDo
Toolbox
Google AdSense