Image (of a Function)¶

The set of values a function actually produces — im(f) = {f(x) : x in X} — a subset of the declared codomain that records what a map reaches rather than what it could in principle reach.

Version: v4 · 2026-09-28 · History · 3 corrections
Domain-specific #: 524
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Set Theory and Function Theory → Mathematics

Core Idea¶

The image of a function \(f : X \to Y\) is the set of values actually produced, \(\mathrm{im}(f) = \{f(x) : x \in X\}\) — a subset of the codomain \(Y\) recording what the map reaches, as opposed to \(Y\) itself, which records what it could reach. It supplies a three-way partition (domain, image, codomain), and every map factors canonically as a surjection onto its image followed by an inclusion.

How would you explain it like I'm…

What Really Comes Out

Think of a juice machine with a menu showing every flavor it could make. But when you press all the buttons, it only ever makes apple and orange. The flavors it really makes are its image; the whole menu is just what it might have made.

The Outputs You Actually Get

In math, a function is a rule that takes an input and gives back an output. Every function has a list of allowed answers, called the codomain, but it may not actually produce all of them. The image is the set of answers the function really gives when you try every input. For example, squaring whole numbers gives 0, 1, 4, 9, and so on, but never 2 or 3, even though 2 and 3 are whole numbers. So the image is what the function truly reaches, not everything it is allowed to reach.

Image Versus Codomain

For a function f from a set X to a set Y, the image is the set of all values f(x) you get as x runs through X. It sits inside Y, the codomain, which is just the declared type of outputs. The difference matters: a function is called surjective (onto) exactly when its image equals the whole codomain. So a function has three parts to keep apart: the domain (inputs), the image (outputs actually reached), and the codomain (outputs allowed). Every function can be split into two steps: map each input onto the image, then place the image inside the codomain. In linear algebra, the image of a matrix is its column space, and its size is the rank.

The image of f : X → Y is im(f) = {f(x) : x ∈ X}, the subset of the codomain consisting of values actually attained, distinct from Y, which is only the declared target. f is surjective iff im(f) = Y, and the image can be a strict, even thin, subset of Y. This gives a three-way anatomy: domain, image, codomain. Every function factors canonically as a surjection X → im(f) followed by the inclusion im(f) → Y, an epi-mono factorization used throughout algebra, topology, and category theory. For a linear map T : V → W, the image is the column space of its matrix, its dimension is the rank, and rank-nullity states dim im(T) + dim ker(T) = dim V. For group or ring homomorphisms the image is a subgroup or subring, and the first isomorphism theorem gives V/ker(T) ≅ im(T). In topology, continuous images of compact or connected sets are compact or connected. In probability, the range of a random variable is its image, and its support lies inside the closure of that image, though the two can differ.

Scope of Application¶

The construct applies literally wherever its precondition holds: a genuine function for it to act on.

Set theory — the home ground: the three-way partition and surjectivity test \(\mathrm{im}(f)=Y\).
Linear algebra — the column space; its dimension is the rank, paired with the kernel by rank–nullity.
Group and ring theory — the image as subobject, identified by the first isomorphism theorem as \(X/\ker\).
Topology — the deposit locus: continuous maps send compact to compact, connected to connected.
Probability — the range: the image of the probability space under a random variable, whose closure contains the support (the smallest closed set of full probability).

Clarity¶

Naming the image forces apart what a function can in principle produce (the declared codomain \(Y\)) from what it actually produces (\(\mathrm{im}(f)\)), dissolving the confusion of reading the target type as the output set. This gives surjectivity its content: "is this map onto?" becomes the sharp, checkable question \(\mathrm{im}(f) = Y\).

Manages Complexity¶

A tangle of questions — how much of the target a map covers, how big its output set is, where its information lands — compresses into one derived object, the image, from which qualitative facts read off. The canonical epi–mono factorization splits "what does this map do?" into two legible stages, and the first isomorphism theorem makes image and kernel complementary halves of one structure.

Abstract Reasoning¶

The construct licenses diagnostic moves — forcing apart realized from declared outputs, and reducing surjectivity to a checkable equality. It licenses interventionist moves — reading a map's reach off the size of its image (rank) or, in probability, off the support and decomposing any map into surjection then inclusion. It further pairs image with kernel via the first isomorphism theorem and locates deposited structure at the image.

Knowledge Transfer¶

Within mathematics the image transfers as mechanism: because every map has one, the partition, surjectivity test, size measures, epi–mono factorization, and image–kernel pairing carry across every subfield — the column space, the range of a random variable, the attainable set, and the reachable set are all \(\mathrm{im}(f)\) in different clothes. Beyond mathematics only a thinner idea recurs — realized versus possible outputs — carried by the parents Function (Mapping) and Realized vs Possible Outcomes, not by "image," which absent a real function has nothing to act on.

Relationships to Other Abstractions¶

Current abstraction Image (of a Function) Domain-specific

Parents (2) — outgoing typed relations

Image (of a Function) presupposes Function (Mapping) Prime

An Image requires a Function Mapping whose outputs can be collected and compared with its declared codomain.
Image (of a Function) is a decomposition of Realized vs Possible Outcomes Prime

Stripping function-theory vocabulary from Image leaves the realized output set, possible codomain, subset gap, and coverage question intact.

Hierarchy paths (2) — routes to 2 parentless roots

Image (of a Function) → presupposes Function (Mapping)

Show alternative path (1)

Neighborhood in Abstraction Space¶

Image (of a Function) sits in a sparse region of the domain-specific corpus (64^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25