Image (mathematics)

Short description: Set of all values of a function

[math]\displaystyle{ f }[/math] is a function from domain [math]\displaystyle{ X }[/math] to codomain [math]\displaystyle{ Y. }[/math] The yellow oval inside [math]\displaystyle{ Y }[/math] is the image of [math]\displaystyle{ f. }[/math]

In mathematics, the image of a function is the set of all output values it may produce.

More generally, evaluating a given function [math]\displaystyle{ f }[/math] at each element of a given subset [math]\displaystyle{ A }[/math] of its domain produces a set, called the "image of [math]\displaystyle{ A }[/math] under (or through) [math]\displaystyle{ f }[/math]". Similarly, the inverse image (or preimage) of a given subset [math]\displaystyle{ B }[/math] of the codomain of [math]\displaystyle{ f }[/math] is the set of all elements of the domain that map to the members of [math]\displaystyle{ B. }[/math]

Image and inverse image may also be defined for general binary relations, not just functions.

Definition

The word "image" is used in three related ways. In these definitions, [math]\displaystyle{ f : X \to Y }[/math] is a function from the set [math]\displaystyle{ X }[/math] to the set [math]\displaystyle{ Y. }[/math]

Image of an element

If [math]\displaystyle{ x }[/math] is a member of [math]\displaystyle{ X, }[/math] then the image of [math]\displaystyle{ x }[/math] under [math]\displaystyle{ f, }[/math] denoted [math]\displaystyle{ f(x), }[/math] is the value of [math]\displaystyle{ f }[/math] when applied to [math]\displaystyle{ x. }[/math] [math]\displaystyle{ f(x) }[/math] is alternatively known as the output of [math]\displaystyle{ f }[/math] for argument [math]\displaystyle{ x. }[/math]

Given [math]\displaystyle{ y, }[/math] the function [math]\displaystyle{ f }[/math] is said to "take the value [math]\displaystyle{ y }[/math]" or "take [math]\displaystyle{ y }[/math] as a value" if there exists some [math]\displaystyle{ x }[/math] in the function's domain such that [math]\displaystyle{ f(x) = y. }[/math] Similarly, given a set [math]\displaystyle{ S, }[/math] [math]\displaystyle{ f }[/math] is said to "take a value in [math]\displaystyle{ S }[/math]" if there exists some [math]\displaystyle{ x }[/math] in the function's domain such that [math]\displaystyle{ f(x) \in S. }[/math] However, "[math]\displaystyle{ f }[/math] takes [all] values in [math]\displaystyle{ S }[/math]" and "[math]\displaystyle{ f }[/math] is valued in [math]\displaystyle{ S }[/math]" means that [math]\displaystyle{ f(x) \in S }[/math] for every point [math]\displaystyle{ x }[/math] in [math]\displaystyle{ f }[/math]'s domain.

Image of a subset

Throughout, let [math]\displaystyle{ f : X \to Y }[/math] be a function. The image under [math]\displaystyle{ f }[/math] of a subset [math]\displaystyle{ A }[/math] of [math]\displaystyle{ X }[/math] is the set of all [math]\displaystyle{ f(a) }[/math] for [math]\displaystyle{ a\in A. }[/math] It is denoted by [math]\displaystyle{ f[A], }[/math] or by [math]\displaystyle{ f(A), }[/math] when there is no risk of confusion. Using set-builder notation, this definition can be written as [math]\displaystyle{ f[A] = \{f(a) : a \in A\}. }[/math]

This induces a function [math]\displaystyle{ f[\,\cdot\,] : \mathcal P(X) \to \mathcal P(Y), }[/math] where [math]\displaystyle{ \mathcal P(S) }[/math] denotes the power set of a set [math]\displaystyle{ S; }[/math] that is the set of all subsets of [math]\displaystyle{ S. }[/math] See § Notation below for more.

Image of a function

The image of a function is the image of its entire domain, also known as the range of the function. This last usage should be avoided because the word "range" is also commonly used to mean the codomain of [math]\displaystyle{ f. }[/math]

Generalization to binary relations

If [math]\displaystyle{ R }[/math] is an arbitrary binary relation on [math]\displaystyle{ X \times Y, }[/math] then the set [math]\displaystyle{ \{ y \in Y : x R y \text{ for some } x \in X \} }[/math] is called the image, or the range, of [math]\displaystyle{ R. }[/math] Dually, the set [math]\displaystyle{ \{ x \in X : x R y \text{ for some } y \in Y \} }[/math] is called the domain of [math]\displaystyle{ R. }[/math]

Inverse image

Let [math]\displaystyle{ f }[/math] be a function from [math]\displaystyle{ X }[/math] to [math]\displaystyle{ Y. }[/math] The preimage or inverse image of a set [math]\displaystyle{ B \subseteq Y }[/math] under [math]\displaystyle{ f, }[/math] denoted by [math]\displaystyle{ f^{-1}[B], }[/math] is the subset of [math]\displaystyle{ X }[/math] defined by [math]\displaystyle{ f^{-1}[ B ] = \{ x \in X \,:\, f(x) \in B \}. }[/math]

Other notations include [math]\displaystyle{ f^{-1}(B) }[/math] and [math]\displaystyle{ f^{-}(B). }[/math] The inverse image of a singleton set, denoted by [math]\displaystyle{ f^{-1}[\{ y \}] }[/math] or by [math]\displaystyle{ f^{-1}[y], }[/math] is also called the fiber or fiber over [math]\displaystyle{ y }[/math] or the level set of [math]\displaystyle{ y. }[/math] The set of all the fibers over the elements of [math]\displaystyle{ Y }[/math] is a family of sets indexed by [math]\displaystyle{ Y. }[/math]

For example, for the function [math]\displaystyle{ f(x) = x^2, }[/math] the inverse image of [math]\displaystyle{ \{ 4 \} }[/math] would be [math]\displaystyle{ \{ -2, 2 \}. }[/math] Again, if there is no risk of confusion, [math]\displaystyle{ f^{-1}[B] }[/math] can be denoted by [math]\displaystyle{ f^{-1}(B), }[/math] and [math]\displaystyle{ f^{-1} }[/math] can also be thought of as a function from the power set of [math]\displaystyle{ Y }[/math] to the power set of [math]\displaystyle{ X. }[/math] The notation [math]\displaystyle{ f^{-1} }[/math] should not be confused with that for inverse function, although it coincides with the usual one for bijections in that the inverse image of [math]\displaystyle{ B }[/math] under [math]\displaystyle{ f }[/math] is the image of [math]\displaystyle{ B }[/math] under [math]\displaystyle{ f^{-1}. }[/math]

Notation for image and inverse image

The traditional notations used in the previous section do not distinguish the original function [math]\displaystyle{ f : X \to Y }[/math] from the image-of-sets function [math]\displaystyle{ f : \mathcal{P}(X) \to \mathcal{P}(Y) }[/math]; likewise they do not distinguish the inverse function (assuming one exists) from the inverse image function (which again relates the powersets). Given the right context, this keeps the notation light and usually does not cause confusion. But if needed, an alternative is to give explicit names for the image and preimage as functions between power sets:

Arrow notation

• [math]\displaystyle{ f^\rightarrow : \mathcal{P}(X) \to \mathcal{P}(Y) }[/math] with [math]\displaystyle{ f^\rightarrow(A) = \{ f(a)\;|\; a \in A\} }[/math]
• [math]\displaystyle{ f^\leftarrow  : \mathcal{P}(Y) \to \mathcal{P}(X) }[/math] with [math]\displaystyle{ f^\leftarrow(B) = \{ a \in X \;|\; f(a) \in B\} }[/math]

Star notation

• [math]\displaystyle{ f_\star : \mathcal{P}(X) \to \mathcal{P}(Y) }[/math] instead of [math]\displaystyle{ f^\rightarrow }[/math]
• [math]\displaystyle{ f^\star : \mathcal{P}(Y) \to \mathcal{P}(X) }[/math] instead of [math]\displaystyle{ f^\leftarrow }[/math]

Other terminology

• An alternative notation for [math]\displaystyle{ f[A] }[/math] used in mathematical logic and set theory is [math]\displaystyle{ f\,''A. }[/math]
• Some texts refer to the image of [math]\displaystyle{ f }[/math] as the range of [math]\displaystyle{ f, }[/math] but this usage should be avoided because the word "range" is also commonly used to mean the codomain of [math]\displaystyle{ f. }[/math]

Examples

1. [math]\displaystyle{ f : \{ 1, 2, 3 \} \to \{ a, b, c, d \} }[/math] defined by [math]\displaystyle{ \left\{\begin{matrix} 1 \mapsto a, \\ 2 \mapsto a, \\ 3 \mapsto c. \end{matrix}\right. }[/math]
   The image of the set [math]\displaystyle{ \{ 2, 3 \} }[/math] under [math]\displaystyle{ f }[/math] is [math]\displaystyle{ f(\{ 2, 3 \}) = \{ a, c \}. }[/math] The image of the function [math]\displaystyle{ f }[/math] is [math]\displaystyle{ \{ a, c \}. }[/math] The preimage of [math]\displaystyle{ a }[/math] is [math]\displaystyle{ f^{-1}(\{ a \}) = \{ 1, 2 \}. }[/math] The preimage of [math]\displaystyle{ \{ a, b \} }[/math] is also [math]\displaystyle{ f^{-1}(\{ a, b \}) = \{ 1, 2 \}. }[/math] The preimage of [math]\displaystyle{ \{ b, d \} }[/math] under [math]\displaystyle{ f }[/math] is the empty set [math]\displaystyle{ \{ \ \} = \emptyset. }[/math]
2. [math]\displaystyle{ f : \R \to \R }[/math] defined by [math]\displaystyle{ f(x) = x^2. }[/math]
   The image of [math]\displaystyle{ \{ -2, 3 \} }[/math] under [math]\displaystyle{ f }[/math] is [math]\displaystyle{ f(\{ -2, 3 \}) = \{ 4, 9 \}, }[/math] and the image of [math]\displaystyle{ f }[/math] is [math]\displaystyle{ \R^+ }[/math] (the set of all positive real numbers and zero). The preimage of [math]\displaystyle{ \{ 4, 9 \} }[/math] under [math]\displaystyle{ f }[/math] is [math]\displaystyle{ f^{-1}(\{ 4, 9 \}) = \{ -3, -2, 2, 3 \}. }[/math] The preimage of set [math]\displaystyle{ N = \{ n \in \R : n \lt 0 \} }[/math] under [math]\displaystyle{ f }[/math] is the empty set, because the negative numbers do not have square roots in the set of reals.
3. [math]\displaystyle{ f : \R^2 \to \R }[/math] defined by [math]\displaystyle{ f(x, y) = x^2 + y^2. }[/math]
   The fibers [math]\displaystyle{ f^{-1}(\{ a \}) }[/math] are concentric circles about the origin, the origin itself, and the empty set (respectively), depending on whether [math]\displaystyle{ a \gt 0, \ a = 0, \text{ or } \ a \lt 0 }[/math] (respectively). (If [math]\displaystyle{ a \ge 0, }[/math] then the fiber [math]\displaystyle{ f^{-1}(\{ a \}) }[/math] is the set of all [math]\displaystyle{ (x, y) \in \R^2 }[/math] satisfying the equation [math]\displaystyle{ x^2 + y^2 = a, }[/math] that is, the origin-centered circle with radius [math]\displaystyle{ \sqrt{a}. }[/math])
4. If [math]\displaystyle{ M }[/math] is a manifold and [math]\displaystyle{ \pi : TM \to M }[/math] is the canonical projection from the tangent bundle [math]\displaystyle{ TM }[/math] to [math]\displaystyle{ M, }[/math] then the fibers of [math]\displaystyle{ \pi }[/math] are the tangent spaces [math]\displaystyle{ T_x(M) \text{ for } x \in M. }[/math] This is also an example of a fiber bundle.
5. A quotient group is a homomorphic image.

Properties

Counter-examples based on the real numbers [math]\displaystyle{ \R, }[/math] [math]\displaystyle{ f : \R \to \R }[/math] defined by [math]\displaystyle{ x \mapsto x^2, }[/math] showing that equality generally need not hold for some laws:
Image showing non-equal sets: [math]\displaystyle{ f\left(A \cap B\right) \subsetneq f(A) \cap f(B). }[/math] The sets [math]\displaystyle{ A = [-4, 2] }[/math] and [math]\displaystyle{ B = [-2, 4] }[/math] are shown in blue immediately below the [math]\displaystyle{ x }[/math]-axis while their intersection [math]\displaystyle{ A_3 = [-2, 2] }[/math] is shown in green.
[math]\displaystyle{ f\left(f^{-1}\left(B_3\right)\right) \subsetneq B_3. }[/math]
[math]\displaystyle{ f^{-1}\left(f\left(A_4\right)\right) \supsetneq A_4. }[/math]

General

For every function [math]\displaystyle{ f : X \to Y }[/math] and all subsets [math]\displaystyle{ A \subseteq X }[/math] and [math]\displaystyle{ B \subseteq Y, }[/math] the following properties hold:

Image	Preimage
[math]\displaystyle{ f(X) \subseteq Y }[/math]	[math]\displaystyle{ f^{-1}(Y) = X }[/math]
[math]\displaystyle{ f\left(f^{-1}(Y)\right) = f(X) }[/math]	[math]\displaystyle{ f^{-1}(f(X)) = X }[/math]
[math]\displaystyle{ f\left(f^{-1}(B)\right) \subseteq B }[/math] (equal if [math]\displaystyle{ B \subseteq f(X); }[/math] for instance, if [math]\displaystyle{ f }[/math] is surjective)	[math]\displaystyle{ f^{-1}(f(A)) \supseteq A }[/math] (equal if [math]\displaystyle{ f }[/math] is injective)
[math]\displaystyle{ f(f^{-1}(B)) = B \cap f(X) }[/math]	[math]\displaystyle{ \left(f \vert_A\right)^{-1}(B) = A \cap f^{-1}(B) }[/math]
[math]\displaystyle{ f\left(f^{-1}(f(A))\right) = f(A) }[/math]	[math]\displaystyle{ f^{-1}\left(f\left(f^{-1}(B)\right)\right) = f^{-1}(B) }[/math]
[math]\displaystyle{ f(A) = \varnothing \,\text{ if and only if }\, A = \varnothing }[/math]	[math]\displaystyle{ f^{-1}(B) = \varnothing \,\text{ if and only if }\, B \subseteq Y \setminus f(X) }[/math]
[math]\displaystyle{ f(A) \supseteq B \,\text{ if and only if } \text{ there exists } C \subseteq A \text{ such that } f(C) = B }[/math]	[math]\displaystyle{ f^{-1}(B) \supseteq A \,\text{ if and only if }\, f(A) \subseteq B }[/math]
[math]\displaystyle{ f(A) \supseteq f(X \setminus A) \,\text{ if and only if }\, f(A) = f(X) }[/math]	[math]\displaystyle{ f^{-1}(B) \supseteq f^{-1}(Y \setminus B) \,\text{ if and only if }\, f^{-1}(B) = X }[/math]
[math]\displaystyle{ f(X \setminus A) \supseteq f(X) \setminus f(A) }[/math]	[math]\displaystyle{ f^{-1}(Y \setminus B) = X \setminus f^{-1}(B) }[/math]
[math]\displaystyle{ f\left(A \cup f^{-1}(B)\right) \subseteq f(A) \cup B }[/math]	[math]\displaystyle{ f^{-1}(f(A) \cup B) \supseteq A \cup f^{-1}(B) }[/math]
[math]\displaystyle{ f\left(A \cap f^{-1}(B)\right) = f(A) \cap B }[/math]	[math]\displaystyle{ f^{-1}(f(A) \cap B) \supseteq A \cap f^{-1}(B) }[/math]

Also:

• [math]\displaystyle{ f(A) \cap B = \varnothing \,\text{ if and only if }\, A \cap f^{-1}(B) = \varnothing }[/math]

Multiple functions

For functions [math]\displaystyle{ f : X \to Y }[/math] and [math]\displaystyle{ g : Y \to Z }[/math] with subsets [math]\displaystyle{ A \subseteq X }[/math] and [math]\displaystyle{ C \subseteq Z, }[/math] the following properties hold:

• [math]\displaystyle{ (g \circ f)(A) = g(f(A)) }[/math]
• [math]\displaystyle{ (g \circ f)^{-1}(C) = f^{-1}(g^{-1}(C)) }[/math]

Multiple subsets of domain or codomain

For function [math]\displaystyle{ f : X \to Y }[/math] and subsets [math]\displaystyle{ A, B \subseteq X }[/math] and [math]\displaystyle{ S, T \subseteq Y, }[/math] the following properties hold:

Image	Preimage
[math]\displaystyle{ A \subseteq B \,\text{ implies }\, f(A) \subseteq f(B) }[/math]	[math]\displaystyle{ S \subseteq T \,\text{ implies }\, f^{-1}(S) \subseteq f^{-1}(T) }[/math]
[math]\displaystyle{ f(A \cup B) = f(A) \cup f(B) }[/math]	[math]\displaystyle{ f^{-1}(S \cup T) = f^{-1}(S) \cup f^{-1}(T) }[/math]
[math]\displaystyle{ f(A \cap B) \subseteq f(A) \cap f(B) }[/math] (equal if [math]\displaystyle{ f }[/math] is injective)	[math]\displaystyle{ f^{-1}(S \cap T) = f^{-1}(S) \cap f^{-1}(T) }[/math]
[math]\displaystyle{ f(A \setminus B) \supseteq f(A) \setminus f(B) }[/math] (equal if [math]\displaystyle{ f }[/math] is injective)	[math]\displaystyle{ f^{-1}(S \setminus T) = f^{-1}(S) \setminus f^{-1}(T) }[/math]
[math]\displaystyle{ f\left(A \triangle B\right) \supseteq f(A) \triangle f(B) }[/math] (equal if [math]\displaystyle{ f }[/math] is injective)	[math]\displaystyle{ f^{-1}\left(S \triangle T\right) = f^{-1}(S) \triangle f^{-1}(T) }[/math]

The results relating images and preimages to the (Boolean) algebra of intersection and union work for any collection of subsets, not just for pairs of subsets:

• [math]\displaystyle{ f\left(\bigcup_{s\in S}A_s\right) = \bigcup_{s\in S} f\left(A_s\right) }[/math]
• [math]\displaystyle{ f\left(\bigcap_{s\in S}A_s\right) \subseteq \bigcap_{s\in S} f\left(A_s\right) }[/math]
• [math]\displaystyle{ f^{-1}\left(\bigcup_{s\in S}B_s\right) = \bigcup_{s\in S} f^{-1}\left(B_s\right) }[/math]
• [math]\displaystyle{ f^{-1}\left(\bigcap_{s\in S}B_s\right) = \bigcap_{s\in S} f^{-1}\left(B_s\right) }[/math]

(Here, [math]\displaystyle{ S }[/math] can be infinite, even uncountably infinite.)

With respect to the algebra of subsets described above, the inverse image function is a lattice homomorphism, while the image function is only a semilattice homomorphism (that is, it does not always preserve intersections).

See also

• Bijection, injection and surjection – Properties of mathematical functions
• Fiber (mathematics) – Set of all points in a function's domain that all map to some single given point
• Image (category theory)
• Set inversion – Mathematical problem of finding the set mapped by a specified function to a certain range

References

• Artin, Michael (1991). Algebra. Prentice Hall. ISBN 81-203-0871-9. 
• Blyth, T.S. (2005). Lattices and Ordered Algebraic Structures. Springer. ISBN 1-85233-905-5. .
• Dolecki, Szymon; Mynard, Frederic (2016). Convergence Foundations Of Topology. New Jersey: World Scientific Publishing Company. ISBN 978-981-4571-52-4. OCLC 945169917. 
• Halmos, Paul R. (1960). Naive set theory. The University Series in Undergraduate Mathematics. van Nostrand Company. ISBN 9780442030643. https://archive.org/details/naivesettheory0000halm. 
• Kelley, John L. (1985). General Topology. Graduate Texts in Mathematics. 27 (2 ed.). Birkhäuser. ISBN 978-0-387-90125-1. 
• Munkres, James R. (2000). Topology (Second ed.). Upper Saddle River, NJ: Prentice Hall, Inc. ISBN 978-0-13-181629-9. OCLC 42683260.