Difference between revisions of "Functions:Forward Image"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
 
(22 intermediate revisions by one other user not shown)
Line 21: Line 21:
  
 
===Image of a function===
 
===Image of a function===
The image of a function is the image of its entire domain, also known as the range of the function.[3] This usage should be avoided because the word "range" is also commonly used to mean the codomain of {\displaystyle f.}f.
+
The image of a function is the image of its entire domain, also known as the range of the function. This usage should be avoided because the word "range" is also commonly used to mean the codomain of {\displaystyle f.}f.
  
 
===Generalization to binary relations===
 
===Generalization to binary relations===
If <math>R</math> is an arbitrary binary relation on <math>X\times Y</math>, then the set <math>\{y\in Y:xRy{\text{ for some }}x\in X\}}</math> is called the image, or the range, of <math>R</math>. Dually, the set <math>\{x\in X:xRy{\text{ for some }}y\in Y\}</math> is called the domain of <math>R</math>.
+
If <math>R</math> is an arbitrary binary relation on <math>X\times Y</math>, then the set <math>\{y\in Y:xRy \text{ for some } x\in X\}</math> is called the image, or the range, of <math>R</math>. Dually, the set <math>\{x\in X:xRy{\text{ for some }}y\in Y\}</math> is called the domain of <math>R</math>.
 +
 
 +
==Inverse image of a function==
 +
Let <math>f</math> be a function from <math>X</math> to <math>Y.</math> The '''preimage''' or '''inverse image''' of a set <math>B \subseteq Y</math> under <math>f,</math> denoted by <math>f^{-1}[B],</math> is the subset of <math>X</math> defined by <math>f^{-1}[ B ] = \{ x \in X \,|\, f(x) \in B \}.</math>
 +
 
 +
Other notations include <math>f^{-1}(B)</math> and <math>f^{-}(B).</math>
 +
The inverse image of a singleton set, denoted by <math>f^{-1}[\{ y \}]</math> or by <math>f^{-1}[y],</math> is also called the fiber or fiber over <math>y</math> or the level set of <math>y.</math> The set of all the fibers over the elements of <math>Y</math> is a family of sets indexed by <math>Y.</math>
 +
 
 +
For example, for the function <math>f(x) = x^2,</math> the inverse image of <math>\{ 4 \}</math> would be <math>\{ -2, 2 \}.</math> Again, if there is no risk of confusion, <math>f^{-1}[B]</math> can be denoted by <math>f^{-1}(B),</math> and <math>f^{-1}</math> can also be thought of as a function from the power set of <math>Y</math> to the power set of <math>X.</math> The notation <math>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>B</math> under <math>f</math> is the image of <math>B</math> under <math>f^{-1}.</math>
 +
 
 +
==Examples==
 +
 
 +
1. <math>f : \{ 1, 2, 3 \} \to \{ a, b, c, d \}</math> defined by <math>
 +
    f(x) = \left\{\begin{matrix}
 +
      a, & \mbox{if }x=1 \\
 +
      a, & \mbox{if }x=2 \\
 +
      c, & \mbox{if }x=3.
 +
    \end{matrix}\right.
 +
  </math>
 +
: The ''image'' of the set <math>\{ 2, 3 \}</math> under <math>f</math> is <math>f(\{ 2, 3 \}) = \{ a, c \}.</math>  The ''image'' of the function <math>f</math> is <math>\{ a, c \}.</math> The ''preimage'' of <math>a</math> is <math>f^{-1}(\{ a \}) = \{ 1, 2 \}.</math> The ''preimage'' of <math>\{ a, b \}</math> is also <math>f^{-1}(\{ 1, 2 \}) = \{ 1, 2 \}.</math>  The preimage of <math>\{ b, d \},</math> is the empty set <math>\{ \, \} = \varnothing.</math>
 +
 
 +
2. <math>f : \R \to \R</math> defined by <math>f(x) = x^2.</math>
 +
: The ''image'' of <math>\{ -2, 3 \}</math> under <math>f</math> is <math>f^{-1}(\{ -2, 3 \}) = \{ 4, 9 \},</math> and the ''image'' of <math>f</math> is <math>\R^+</math> (the set of all positive real numbers and zero). The ''preimage'' of <math>\{ 4, 9 \}</math> under <math>f</math> is <math>f^{-1}(\{ 4, 9 \}) = \{ -3, -2, 2, 3 \}.</math> The preimage of set <math>N = \{ n \in \R : n < 0 \}</math> under <math>f</math> is the empty set, because the negative numbers do not have square roots in the set of reals.
 +
 
 +
3. <math>f : \R^2 \to \R</math> defined by <math>f(x, y) = x^2 + y^2.</math>
 +
: The ''fiber'' <math>f^{-1}(\{ a \})</math> are concentric circles]] about the origin, the origin itself, and the empty set, depending on whether <math>a > 0, a = 0, \text{ or } a < 0,</math> respectively. (if <math>a > 0,</math> then the fiber <math>f^{-1}(\{ a \})</math> is the set of all <math>(x, y) \in \R^2</math> satisfying the equation of the origin-concentric ring <math>x^2 + y^2 = a.</math>)
 +
 
 +
4. If <math>M</math> is a manifold and <math>\pi : TM \to M</math> is the canonical projection from the tangent bundle <math>TM</math> to <math>M,</math> then the ''fibers'' of <math>\pi</math> are the tangent spaces <math>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 ==
 +
 
 +
[[File:Image preimage conterexample bf.gif|thumb|center|upright=1.7|<math>f\left(f^{-1}\left(B_3\right)\right) \subsetneq B_3.</math>]]
 +
 
 +
[[File:Image preimage conterexample fb.gif|thumb|center|upright=1.7|<math>f^{-1}\left(f\left(A_4\right)\right) \supsetneq A_4.</math>]]
 +
 
 +
=== General ===
 +
 
 +
For every function <math>f : X \to Y</math> and all subsets <math>A \subseteq X</math> and <math>B \subseteq Y,</math> the following properties hold:
 +
 
 +
{| class="wikitable"
 +
|-
 +
! Image
 +
! Preimage
 +
|-
 +
|<math>f(X) \subseteq Y</math>
 +
|<math>f^{-1}(Y) = X</math>
 +
|-
 +
|<math>f\left(f^{-1}(Y)\right) = f(X)</math>
 +
|<math>f^{-1}(f(X)) = X</math>
 +
|-
 +
|<math>f\left(f^{-1}(B)\right) \subseteq B</math><br>(equal if <math>B \subseteq f(X);</math> for instance, if <math>f</math> is surjective)
 +
|-
 +
|<math>f(f^{-1}(B)) = B \cap f(X)</math>
 +
|<math>\left(f \vert_A\right)^{-1}(B) = A \cap f^{-1}(B)</math>
 +
|-
 +
|<math>f\left(f^{-1}(f(A))\right) = f(A)</math>
 +
|<math>f^{-1}\left(f\left(f^{-1}(B)\right)\right) = f^{-1}(B)</math>
 +
|-
 +
|<math>f(A) = \varnothing \,\text{ if and only if }\, A = \varnothing</math>
 +
|<math>f^{-1}(B) = \varnothing \,\text{ if and only if }\, B \subseteq Y \setminus f(X)</math>
 +
|-
 +
|<math>f(A) \supseteq B \,\text{ if and only if } \text{ there exists } C \subseteq A \text{ such that } f(C) = B</math>
 +
|<math>f^{-1}(B) \supseteq A \,\text{ if and only if }\, f(A) \subseteq B</math>
 +
|-
 +
|<math>f(A) \supseteq f(X \setminus A) \,\text{ if and only if }\, f(A) = f(X)</math>
 +
|<math>f^{-1}(B) \supseteq f^{-1}(Y \setminus B) \,\text{ if and only if }\, f^{-1}(B) = X</math>
 +
|-
 +
|<math>f(X \setminus A) \supseteq f(X) \setminus f(A)</math>
 +
|<math>f^{-1}(Y \setminus B) = X \setminus f^{-1}(B)</math>
 +
|-
 +
|<math>f\left(A \cup f^{-1}(B)\right) \subseteq f(A) \cup B</math>
 +
|<math>f^{-1}(f(A) \cup B) \supseteq A \cup f^{-1}(B)</math>
 +
|-
 +
|<math>f\left(A \cap f^{-1}(B)\right) = f(A) \cap B</math>
 +
|<math>f^{-1}(f(A) \cap B) \supseteq A \cap f^{-1}(B)</math>
 +
|}
 +
 
 +
Also:
 +
 
 +
* <math>f(A) \cap B = \varnothing \,\text{ if and only if }\, A \cap f^{-1}(B) = \varnothing</math>
 +
 
 +
=== Multiple functions ===
 +
 
 +
For functions <math>f : X \to Y</math> and <math>g : Y \to Z</math> with subsets <math>A \subseteq X</math> and <math>C \subseteq Z,</math> the following properties hold:
 +
 
 +
* <math>(g \circ f)(A) = g(f(A))</math>
 +
* <math>(g \circ f)^{-1}(C) = f^{-1}(g^{-1}(C))</math>
 +
 
 +
=== Multiple subsets of domain or codomain ===
 +
 
 +
For function <math>f : X \to Y</math> and subsets <math>A, B \subseteq X</math> and <math>S, T \subseteq Y,</math> the following properties hold:
 +
 
 +
{| class="wikitable"
 +
|-
 +
! Image
 +
! Preimage
 +
|-
 +
|<math>A \subseteq B \,\text{ implies }\, f(A) \subseteq f(B)</math>
 +
|<math>S \subseteq T \,\text{ implies }\, f^{-1}(S) \subseteq f^{-1}(T)</math>
 +
|-
 +
|<math>f(A \cup B) = f(A) \cup f(B)</math>
 +
|<math>f^{-1}(S \cup T) = f^{-1}(S) \cup f^{-1}(T)</math>
 +
|-
 +
|<math>f(A \cap B) \subseteq f(A) \cap f(B)</math>
 +
|<math>f^{-1}(S \cap T) = f^{-1}(S) \cap f^{-1}(T)</math>
 +
|-
 +
|<math>f(A \setminus B) \supseteq f(A) \setminus f(B)</math>
 +
|<math>f^{-1}(S \setminus T) = f^{-1}(S) \setminus f^{-1}(T)</math>
 +
|-
 +
|<math>f\left(A \triangle B\right) \supseteq f(A) \triangle f(B)</math><br>(equal if <math>f</math> is injective)
 +
|<math>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>f\left(\bigcup_{s\in S}A_s\right) = \bigcup_{s\in S} f\left(A_s\right)</math>
 +
* <math>f\left(\bigcap_{s\in S}A_s\right) \subseteq \bigcap_{s\in S} f\left(A_s\right)</math>
 +
* <math>f^{-1}\left(\bigcup_{s\in S}B_s\right) = \bigcup_{s\in S} f^{-1}\left(B_s\right)</math>
 +
* <math>f^{-1}\left(\bigcap_{s\in S}B_s\right) = \bigcap_{s\in S} f^{-1}\left(B_s\right)</math>
 +
(Here, <math>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).
 +
 
 +
== Licensing ==
 +
Content obtained and/or adapted from:
 +
* [https://en.wikipedia.org/wiki/Image_(mathematics) Image (mathematics), Wikipedia] under a CC BY-SA license

Latest revision as of 15:11, 6 November 2021

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

More generally, evaluating a given function at each element of a given subset of its domain produces a set, called the "image of under (or through) ". Similarly, the inverse image (or preimage) of a given subset of the codomain of , is the set of all elements of the domain that map to the members of .

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, is a function from the set to the set .

Image of an element

If is a member of , then the image of under , denoted , is the value of when applied to . is alternatively known as the output of for argument .

Given , the function is said to "take the value " or "take as a value" if there exists some in the function's domain such that . Similarly, given a set , is said to "take a value in " if there exists some in the function's domain such that . However, " takes all values in " and " is valued in " means that for every point in 's domain.

Image of a subset

The image of a subset under , denoted , is the subset of which can be defined using set-builder notation as follows:

When there is no risk of confusion, is simply written as . This convention is a common one; the intended meaning must be inferred from the context. This makes a function whose domain is the power set of (the set of all subsets of ), and whose codomain is the power set of .

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 usage should be avoided because the word "range" is also commonly used to mean the codomain of {\displaystyle f.}f.

Generalization to binary relations

If is an arbitrary binary relation on , then the set is called the image, or the range, of . Dually, the set is called the domain of .

Inverse image of a function

Let be a function from to The preimage or inverse image of a set under denoted by is the subset of defined by

Other notations include and The inverse image of a singleton set, denoted by or by is also called the fiber or fiber over or the level set of The set of all the fibers over the elements of is a family of sets indexed by

For example, for the function the inverse image of would be Again, if there is no risk of confusion, can be denoted by and can also be thought of as a function from the power set of to the power set of The notation should not be confused with that for inverse function, although it coincides with the usual one for bijections in that the inverse image of under is the image of under

Examples

1. defined by

The image of the set under is The image of the function is The preimage of is The preimage of is also The preimage of is the empty set

2. defined by

The image of under is and the image of is (the set of all positive real numbers and zero). The preimage of under is The preimage of set under is the empty set, because the negative numbers do not have square roots in the set of reals.

3. defined by

The fiber are concentric circles]] about the origin, the origin itself, and the empty set, depending on whether respectively. (if then the fiber is the set of all satisfying the equation of the origin-concentric ring )

4. If is a manifold and is the canonical projection from the tangent bundle to then the fibers of are the tangent spaces This is also an example of a fiber bundle.

5. A quotient group is a homomorphic image.

Properties

General

For every function and all subsets and the following properties hold:

Image Preimage

(equal if for instance, if is surjective)

Also:

Multiple functions

For functions and with subsets and the following properties hold:

Multiple subsets of domain or codomain

For function and subsets and the following properties hold:

Image Preimage

(equal if is injective)

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:

(Here, 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).

Licensing

Content obtained and/or adapted from: