4
$\begingroup$

First, I wan't to make clear that we use the same terms:

$X, Y$ are sets with $X \neq \emptyset$ and $Y \neq \emptyset$. $f:X \rightarrow Y$ is a funtion.

$f^{-1}(A)$ is the preimage of $A \subseteq Y$ (and NOT the inverse function).

Image

$f$ is a function from domain $X$ to codomain $Y$. The smaller oval inside $Y$ is the image of $f$.

Source: commons.wikimedia.org

Question:

What is the preimage of the codomain of a function if the function is not surjective?

Example:

$f: \mathbb{R} \rightarrow \mathbb{R}$

$f(x) := x^2$

a) $f^{-1}(\{-1,1,2\}) = \{1, \sqrt{2}, -1, \sqrt{2}\}$ and especially $f^{-1}(\{-1\}) = \emptyset$ or

b) $f^{-1}(\{-1,1,2\})$ is undefined, as $-1$ has no preimage?

Which one is correct? Does it depend on the author?

  • 3
    Your example has nothing to do with your question. The codomain in them is $\mathbb{R}$ and its preimage is $\mathbb{R}$ too. Generally, the preimage of the codomain is the domain.2012-10-20

3 Answers 3

5

Definitely (a). The definition of preimage is $f^{-1}(A) = \{x \in X : f(x) \in A\}$ so it's defined for all subsets $A \subset Y$, regardless of how $A$ relates to the image of $f$.

  • 0
    +1 for the suggestion of taking a look at Tim Gowers's blog post (and his neighbouring ones). Terrific stuff.2012-10-20
1

I definitely go with (a).

Note that Wikipedia says the following:

The inverse image or preimage of a particular subset $S$ of the codomain of a function is the set of all elements of the domain that map to the members of $S$.

Put into set-theoretic notation $f^{-1} ( S ) = \{ x \in X : f(x) \in S \}.$ There is no requirement that everything in $S$ is in the range/image of $f$. (Actually, the attentive reader should note that the same definition could be used even if the set $S$ is not a subset of the codomain. And this makes sense since "codomain" is an indefinite concept (set-theoretically speaking). What is the codomain of $x \mapsto x^2$? Is it $\mathbb{R}$? $\mathbb{R}^{\geq 0}$? $\mathbb{C}$?)

  • 0
    (...inued) In this way _codomain_ becomes a concept related to intent, and _intent_ is something that is hard to put into concise mathematical terms. (One possibility is to use $f : X \to Y$ to denote a triple $(f,X,Y)$ where $f$ is a function with domain $X$ and range/image a subset of $Y$. But now we've just added a lot of extra baggage to what is a relatively simple concept: $f$ associates to each element of $X$ a unique element of $Y$; leaving the possibility that some elements of $Y$ are not associated to an element of $X$.) This is likely a distinction that can be left until later.2012-10-20
0

This emended picture from http://yorkporc.wordpress.com/2011/05/28/transforms-pre-images-and-kernels-and-null-spaces/ should avail.

enter image description here

The pink is the preimage/inverse image of $S \subseteq Y$ (though this picture shows $S \subsetneq Y$) under $T$ $= T^{-1}[S] = \{x \in X : T(x) \in S\}$.

Moreover, it evinces Arthur Fischer's statement: "There is no requirement that everything in $S$ is in the range/image of $f$." In $Y$, the pink is strictly smaller than $S$ thus $T(T^{-1}[S]) \subsetneq S$ here.