Image (mathematics) explained

In mathematics, for a function

f:X\toY

, the image of an input value

x

is the single output value produced by

f

when passed

x

. The preimage of an output value

y

is the set of input values that produce

y

.

More generally, evaluating

f

at each element of a given subset

A

of its domain

X

produces a set, called the "image of

A

under (or through)

f

". Similarly, the inverse image (or preimage) of a given subset

B

of the codomain

Y

is the set of all elements of

X

that map to a member of

B.

The image of the function

f

is the set of all output values it may produce, that is, the image of

X

. The preimage of

f

, that is, the preimage of

Y

under

f

, always equals

X

(the domain of

f

); therefore, the former notion is rarely used.

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,

f:X\toY

is a function from the set

X

to the set

Y.

Image of an element

If

x

is a member of

X,

then the image of

x

under

f,

denoted

f(x),

is the value of

f

when applied to

x.

f(x)

is alternatively known as the output of

f

for argument

x.

Given

y,

the function

f

is said to or if there exists some

x

in the function's domain such that

f(x)=y.

Similarly, given a set

S,

f

is said to if there exists

x

in the function's domain such that

f(x)\inS.

However, and means that

f(x)\inS

for point

x

in the domain of

f

.

Image of a subset

Throughout, let

f:X\toY

be a function. The under

f

of a subset

A

of

X

is the set of all

f(a)

for

a\inA.

It is denoted by

f[A],

or by

f(A),

when there is no risk of confusion. Using set-builder notation, this definition can be written as[1] [2] f[A] = \.

This induces a function

f[ ⋅ ]:lP(X)\tolP(Y),

where

lP(S)

denotes the power set of a set

S;

that is the set of all subsets of

S.

See 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.[3] This last usage should be avoided because the word "range" is also commonly used to mean the codomain of

f.

Generalization to binary relations

If

R

is an arbitrary binary relation on

X x Y,

then the set

\{y\inY:xRyforsomex\inX\}

is called the image, or the range, of

R.

Dually, the set

\{x\inX:xRyforsomey\inY\}

is called the domain of

R.

Inverse image

Let

f

be a function from

X

to

Y.

The preimage or inverse image of a set

B\subseteqY

under

f,

denoted by

f-1[B],

is the subset of

X

defined byf^[B ] = \.

Other notations include

f-1(B)

and

f-(B).

The inverse image of a singleton set, denoted by

f-1[\{y\}]

or by

f-1[y],

is also called the fiber or fiber over

y

or the level set of

y.

The set of all the fibers over the elements of

Y

is a family of sets indexed by

Y.

For example, for the function

f(x)=x2,

the inverse image of

\{4\}

would be

\{-2,2\}.

Again, if there is no risk of confusion,

f-1[B]

can be denoted by

f-1(B),

and

f-1

can also be thought of as a function from the power set of

Y

to the power set of

X.

The notation

f-1

should not be confused with that for inverse function, although it coincides with the usual one for bijections in that the inverse image of

B

under

f

is the image of

B

under

f-1.

Notation for image and inverse image

The traditional notations used in the previous section do not distinguish the original function

f:X\toY

from the image-of-sets function

f:l{P}(X)\tol{P}(Y)

; 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

f → :l{P}(X)\tol{P}(Y)

with

f → (A)=\{f(a) | a\inA\}

f\leftarrow:l{P}(Y)\tol{P}(X)

with

f\leftarrow(B)=\{a\inX | f(a)\inB\}

Star notation

f\star:l{P}(X)\tol{P}(Y)

instead of

f →

f\star:l{P}(Y)\tol{P}(X)

instead of

f\leftarrow

Other terminology

f[A]

used in mathematical logic and set theory is

f''A.

[4] [5]

f

as the range of

f,

[6] but this usage should be avoided because the word "range" is also commonly used to mean the codomain of

f.

Examples

f:\{1,2,3\}\to\{a,b,c,d\}

defined by

\left\{\begin{matrix} 1\mapstoa,\\ 2\mapstoa,\\ 3\mapstoc. \end{matrix}\right.

The image of the set

\{2,3\}

under

f

is

f(\{2,3\})=\{a,c\}.

The image of the function

f

is

\{a,c\}.

The preimage of

a

is

f-1(\{a\})=\{1,2\}.

The preimage of

\{a,b\}

is also

f-1(\{a,b\})=\{1,2\}.

The preimage of

\{b,d\}

under

f

is the empty set

\{ \}=\emptyset.

f:\R\to\R

defined by

f(x)=x2.

The image of

\{-2,3\}

under

f

is

f(\{-2,3\})=\{4,9\},

and the image of

f

is

\R+

(the set of all positive real numbers and zero). The preimage of

\{4,9\}

under

f

is

f-1(\{4,9\})=\{-3,-2,2,3\}.

The preimage of set

N=\{n\in\R:n<0\}

under

f

is the empty set, because the negative numbers do not have square roots in the set of reals.

f:\R2\to\R

defined by

f(x,y)=x2+y2.

The fibers

f-1(\{a\})

are concentric circles about the origin, the origin itself, and the empty set (respectively), depending on whether

a>0, a=0,or a<0

(respectively). (If

a\ge0,

then the fiber

f-1(\{a\})

is the set of all

(x,y)\in\R2

satisfying the equation

x2+y2=a,

that is, the origin-centered circle with radius

\sqrt{a}.

)
  1. If

M

is a manifold and

\pi:TM\toM

is the canonical projection from the tangent bundle

TM

to

M,

then the fibers of

\pi

are the tangent spaces

Tx(M)forx\inM.

This is also an example of a fiber bundle.
  1. A quotient group is a homomorphic image.

Properties

General

For every function

f:X\toY

and all subsets

A\subseteqX

and

B\subseteqY,

the following properties hold:
ImagePreimage

f(X)\subseteqY

f-1(Y)=X

f\left(f-1(Y)\right)=f(X)

f-1(f(X))=X

f\left(f-1(B)\right)\subseteqB


(equal if

B\subseteqf(X);

for instance, if

f

is surjective)[7] [8]

f-1(f(A))\supseteqA


(equal if

f

is injective)

f(f-1(B))=B\capf(X)

\left(f

-1
\vert
A\right)

(B)=A\capf-1(B)

f\left(f-1(f(A))\right)=f(A)

f-1\left(f\left(f-1(B)\right)\right)=f-1(B)

f(A)=\varnothingifandonlyifA=\varnothing

f-1(B)=\varnothingifandonlyifB\subseteqY\setminusf(X)

f(A)\supseteqBifandonlyifthereexistsC\subseteqAsuchthatf(C)=B

f-1(B)\supseteqAifandonlyiff(A)\subseteqB

f(A)\supseteqf(X\setminusA)ifandonlyiff(A)=f(X)

f-1(B)\supseteqf-1(Y\setminusB)ifandonlyiff-1(B)=X

f(X\setminusA)\supseteqf(X)\setminusf(A)

f-1(Y\setminusB)=X\setminusf-1(B)

f\left(A\cupf-1(B)\right)\subseteqf(A)\cupB

[9]

f-1(f(A)\cupB)\supseteqA\cupf-1(B)

f\left(A\capf-1(B)\right)=f(A)\capB

f-1(f(A)\capB)\supseteqA\capf-1(B)

Also:

f(A)\capB=\varnothingifandonlyifA\capf-1(B)=\varnothing

Multiple functions

For functions

f:X\toY

and

g:Y\toZ

with subsets

A\subseteqX

and

C\subseteqZ,

the following properties hold:

(g\circf)(A)=g(f(A))

(g\circf)-1(C)=f-1(g-1(C))

Multiple subsets of domain or codomain

For function

f:X\toY

and subsets

A,B\subseteqX

and

S,T\subseteqY,

the following properties hold:
ImagePreimage

A\subseteqBimpliesf(A)\subseteqf(B)

S\subseteqTimpliesf-1(S)\subseteqf-1(T)

f(A\cupB)=f(A)\cupf(B)

f-1(S\cupT)=f-1(S)\cupf-1(T)

f(A\capB)\subseteqf(A)\capf(B)


(equal if

f

is injective[10])

f-1(S\capT)=f-1(S)\capf-1(T)

f(A\setminusB)\supseteqf(A)\setminusf(B)


(equal if

f

is injective)

f-1(S\setminusT)=f-1(S)\setminusf-1(T)

f\left(A\triangleB\right)\supseteqf(A)\trianglef(B)


(equal if

f

is injective)

f-1\left(S\triangleT\right)=f-1(S)\trianglef-1(T)

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:

f\left(cups\inAs\right)=cups\inf\left(As\right)

f\left(caps\inAs\right)\subseteqcaps\inf\left(As\right)

f-1\left(cups\inBs\right)=cups\inf-1\left(Bs\right)

f-1\left(caps\inBs\right)=caps\inf-1\left(Bs\right)

(Here,

S

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).

References

Notes and References

  1. Web site: 2019-11-05. 5.4: Onto Functions and Images/Preimages of Sets. 2020-08-28. Mathematics LibreTexts. en.
  2. Book: Paul R. Halmos. Naive Set Theory. Princeton. Nostrand. 1968 . Here: Sect.8
  3. Web site: Weisstein. Eric W.. Image. 2020-08-28. mathworld.wolfram.com. en.
  4. Book: Set Theory for the Mathematician. registration. Jean E. Rubin . Jean E. Rubin . xix. 1967 . Holden-Day . B0006BQH7S.
  5. M. Randall Holmes: Inhomogeneity of the urelements in the usual models of NFU, December 29, 2005, on: Semantic Scholar, p. 2
  6. Book: Hoffman, Kenneth . Linear Algebra . Prentice-Hall . 1971 . 2nd . 388 . en.
  7. See
  8. See
  9. See p.388 of Lee, John M. (2010). Introduction to Topological Manifolds, 2nd Ed.
  10. See

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Image (mathematics)".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.