In mathematics, the image of a function is the set of values it actually takes. More generally, the image of a subset of the function’s domain consists of the outputs obtained from inputs in that subset. For a function and a subset , the image is
The image of the entire domain, , is also written . It is a subset of the codomain , but need not equal it. Images are used throughout mathematics to describe attainable values, transformed sets, and the outputs of structure-preserving maps.
Definition and terminology
Let be a function with domain and codomain . For every subset ,
Several related expressions must be distinguished:
- Image of an element: , an element of .
- Image of a subset: , a subset of .
- Image of the function: , the set of all outputs attained by .
The notation is also commonly used for the image of a set. Square brackets help distinguish applying a function to an element from taking the image of a collection of elements.
The word range often means the image of the whole domain, but some authors use it for the codomain. Explicitly distinguishing image from codomain avoids this ambiguity. A function is surjective precisely when
An image records which values occur, not how many times they occur. Distinct inputs producing the same output contribute only one element to the image.
Examples
A real-valued square function
For the function
where is the set of real numbers,
Its codomain contains negative numbers, but its image does not.
The image depends on which inputs are allowed:
The second image includes , because belongs to the input interval, but excludes , because neither nor belongs to that interval.
A parametrized curve
Consider
Its image is the unit circle:
The image is a geometric set; it does not retain information about the direction, speed, or repeated traversal specified by the parametrization.
Image versus graph
The graph of a function is
It records input–output pairs. By contrast, the image is a subset of containing only outputs. Thus the graph of is a parabola, whereas its image as a real-valued function is .
Images and inverse images
For a subset , the inverse image, or preimage, is
An image moves a set of inputs forward to outputs; an inverse image collects all inputs whose outputs lie in a specified set.
The notation does not require an inverse function to exist. It is defined for every function, including functions that are neither injective nor surjective.
For example, if , then
The preimage of a singleton, , is called the fiber over . A point belongs to the image exactly when its fiber is nonempty.
Images and inverse images satisfy
and
The first inclusion can be strict because an input outside may share its output with an input inside . It is an equality for every exactly when is injective. The second inclusion is an equality for every exactly when is surjective.
A useful relationship is
It expresses a basic correspondence between direct and inverse images.
Set-theoretic properties
Taking images defines a function between power sets:
Inclusion and unions
Images preserve inclusion:
They also preserve arbitrary unions:
In particular, the image of the empty set is empty.
Intersections
For any nonempty family of subsets of ,
Equality need not hold: the same output may be attained in each set by different inputs, without any input belonging to all the sets.
For example, with , , and ,
If is injective, it preserves all nonempty intersections.
Composition
For functions and , composition satisfies
Consequently,
Unlike direct images, inverse images preserve arbitrary unions, arbitrary intersections, and complements relative to the specified domain and codomain. This distinction is central to their use in topology and measure theory.
Factorization through the image
Every function can be factored as
where is surjective and is the inclusion map, which is injective.
This factorization separates two features of a function: which inputs have the same output, and where the attained outputs sit inside the codomain.
Define an equivalence relation on by
The map
is a bijection. Thus the image can be identified with the set obtained by grouping together inputs that have equal outputs. This is a set-theoretic identification; additional algebraic or topological structure requires further conditions.
Images in algebra
For a linear map , its image is a linear subspace of :
If is represented by a matrix, its image is the span of that matrix’s columns. Its dimension is the rank. In finite dimensions, the rank–nullity theorem states
For a group homomorphism , the image is a subgroup of . The first isomorphism theorem identifies it with the quotient group
This gives an algebraic version of grouping inputs according to their common output.
Images in topology and measure theory
For a continuous function, images preserve some important properties of sets:
- The image of a compact space is compact.
- The image of a connected space is connected.
Continuity alone does not imply that images of open sets are open or that images of closed sets are closed. For example, maps the open interval to , which is not open in .
A function is called an open map if it sends open sets to open sets, and a closed map if it sends closed sets to closed sets. These are properties of direct images, distinct from continuity, which is defined through inverse images of open sets.
A similar distinction occurs in measure theory. A measurable function is defined by requiring inverse images of measurable sets to be measurable. Direct images of measurable sets need not be measurable in the codomain’s specified sigma-algebra. Accordingly, the distribution induced by a random variable is defined using inverse images:
The image of describes its actually attained values, while its distribution assigns probabilities to measurable sets of values.