If $A\subseteq B$ under what conditions is $f^{-1}(A) \subseteq f^{-1}(B)$, where $f^{-1}$ is the preimage, not the inverse.
Asked
Active
Viewed 2,371 times
1 Answers
5
First, we should be clear about the definition of $f$. Suppose $X, Y$ are sets and $f: X \to Y$ is a map. Suppose $A, B \subseteq Y$ with $A \subseteq B$.
It's always true that $f^{-1}(A)$ is contained in $f^{-1}(B)$, and this should be clear by the definition of preimage.
$f^{-1}(A)$ is the stuff in $X$ that is mapped into $A$. But since $A \subseteq B$, if stuff in $X$ is mapped into $A$, then that same stuff is mapped into $B$ because $A$ is a subset of $B$. Then that means the stuff mapped into $A$ is a subset of the stuff mapped into $B$, i.e., $f^{-1}(A) \subseteq f^{-1}(B)$.
Bonus question for you: If $A \subseteq B$, when is $f^{-1}(A) = f^{-1}(B)$?

layman
- 20,191
as long as $f^{-1}(A/B)$ and $ f^{-1}(B/A)$ is the empty set this is true.
– usainlightning Feb 10 '15 at 19:51