# Show that if $f$ is injective, then $f^{-1}(f(C))=C$ [duplicate]

Once again I am stuck on a question from Lay's Introduction to Analysis with Proof:

Suppose that $f : A \rightarrow B$ and let C $\subseteq$ A and $D \subseteq B$. Show that if $f$ is injective, then $f^{-1}(f(C))=C$

I just need to show that $f^{-1}(f(C) \subseteq C$ and $C \subseteq f^{-1}(f(C))$.

I have started with this but am unsure of where to go next;

Let $x \in f^{-1}(f(C))$. Then, $x \in \{f^{-1}(a) \mid a \in f(C)\}$.

## marked as duplicate by Claude Leibovici, William, drhab, Davide Giraudo real-analysis StackExchange.ready(function() { if (StackExchange.options.isMobile) return; $('.dupe-hammer-message-hover:not(.hover-bound)').each(function() { var$hover = $(this).addClass('hover-bound'),$msg = $hover.siblings('.dupe-hammer-message');$hover.hover( function() { $hover.showInfoMessage('', { messageElement:$msg.clone().show(), transient: false, position: { my: 'bottom left', at: 'top center', offsetTop: -7 }, dismissable: false, relativeToBody: true }); }, function() { StackExchange.helpers.removeMessages(); } ); }); }); Sep 15 '14 at 8:13

• Note that $x\in f^{-1}(A)$ just means that $f(x)\in A$. More details in my answer below. – Kim Jong Un Sep 15 '14 at 5:44

Let $f$ be a one-to-one function. If $x\in C$, then $f^{-1}(f(x))=\{x\}\Rightarrow f^{-1}({f(C)})=C$.

To prove the last implication, this about this. If $g(x)=x$ what is $g(C)$? $C$!

• You have assumed the proof was true in your proof it seems ... – MathMajor Sep 15 '14 at 5:31
• To use this proof don't we first need to prove that $f^{-1}(f(x))=x$ for injective $f$? – MathMajor Sep 15 '14 at 5:34
• I think that is clear, since $f(x)$ maps to a unique element $f^{-1}(f(x))=x$. – d80d2729a352b1366139fc119d3345 Sep 15 '14 at 5:35
• Yes but $f^{-1}(x)$ only exists if $f$ is one-to-one does it not? – MathMajor Sep 15 '14 at 5:36
• For $f^{-1}(x)$ to properly exist over the codomain, we need additional conditions. Here we are talking about $f^{-1}(f(x))$. – d80d2729a352b1366139fc119d3345 Sep 15 '14 at 5:39

If $x\in f^{-1}(f(C))$ then $f(x)\in f(C)$. If $x$ is not in $C$, then there is some element $y\in C$ such that $x\neq y$ and $f(x)=f(y)$ but this violates injectiveness, so it must be that $x\in C$. Therefore, you have one direction of inclusion.

The reverse direction is always true regardless of injectiveness: suppose that $x\in C$, then $f(x)\in f(C)$ so that $x\in f^{-1}(f(C))$.

Let $f^{-1}(f(C))=B$. Then there exists $x_b\in B$ and $x_c\in C$, such that, $f(x_b)=f(x_c)$. But $f$ is injective so, $x_b=x_c$. Hence $B=C$.