Suppose $A$ and $B$ are sets, and $f$ and $g$ are functions with $f:A\rightarrow B$ and $g:B\rightarrow A$ . Prove: If $g\circ f=\text{id}_A$ and $f\circ g=\text{id}_B$ , then $f$ is invertible and $g=f^{-1}$ . Note: This result is a converse to Proposition 26.9.

Solution

Verified

Step 1

1 of 3

$f : A \rightarrow B$ and $g :B \rightarrow A$ are such that $g \circ f=id_{A}$ and $f \circ g=id_{B}$ .

To show: $f$ is invertible i.e it is bijective.

For $x,y \in A$ if $f(x)=f(y)$ then $g(f(x))=g(f(y))$ which implies $id_{A}(x)=id_{A}(y)$ which implies $x=y$ . Therefore $f$ is one-to-one.

For any $b \in B$ , $id_{B}(b)=b$ which implies $f \circ g(b)=b$ which implies $f(g(b))=b$ which implies that $f$ is onto function.

So, $f$ is a bijective and therefore an invertible function.

Create a free account to view solutions

By signing up, you accept Quizlet's Terms of Service and Privacy Policy

By signing up, you accept Quizlet's Terms of Service and Privacy Policy

7th Edition•ISBN: 9780073383095 (1 more)Kenneth Rosen

4,283 solutions

8th Edition•ISBN: 9781259676512Kenneth Rosen

4,397 solutions

3rd Edition•ISBN: 9781285402062Edward A. Scheinerman

1,133 solutions

5th Edition•ISBN: 9781337694193 (4 more)Susanna S. Epp

2,641 solutions