Thursday, December 8, 2016

functions - Images and preimages of sets

This is probably very basic indeed, but I've just ran into a proof that seems to imply that letting $f:X\to Y$, $C\subseteq X$ and $P\subseteq Y$, $Q\subseteq Y$,



$$ f(C)=P\cup Q\iff C=f^{-1}(P\cup Q),$$



which I can only understand to be true if f is bijective. Am I having a mental blackout?



Thanks,



Miguel

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...