Graph of a Function¶

Represent a function by the set of ordered input–output pairs selected by its evaluation rule, preserving every domain element with exactly one associated value while separating the graph from a plotted picture or graph-theoretic network.

Version: v3 · 2026-09-19 · History
Domain-specific #: 1955
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Foundations and Analysis → Mathematics
Aliases: Function graph, Graph of f

Core Idea¶

For a function f: X -> Y, its graph is the set Graph(f) = {(x,f(x)) : x in X}, viewed as a subset of the Cartesian product X x Y. The graph turns an evaluation rule into a relational extension: every domain element appears as a first coordinate, and functionality requires exactly one second coordinate for it. MIT's introductory analysis text uses this input–output understanding to connect functions with their graphical representation, while standard set-theoretic treatments identify a function with a special relation. The abstraction is the ordered-pair set, not merely ink on coordinate axes.

How would you explain it like I'm…

In-and-Out Pair List

A function is like a machine: you put something in and one thing comes out. Its graph is a list of every pair: what went in, and what came out. Every thing you can put in shows up in the list, and each one has exactly one partner.

The Input–Output Pair List

A function takes an input and gives exactly one output, like 'double the number.' Its graph is the collection of all input–output pairs, like (1,2), (2,4), (3,6). For numbers, you can draw those pairs as points on a grid, but the graph is really the set of pairs, not the drawing. Each input has to appear with exactly one output. If some input had two different outputs, it wouldn't be a function.

Function as Ordered-Pair Set

For a function f from X to Y, its graph is the set of ordered pairs (x, f(x)) for every x in X, sitting inside the set of all pairs X × Y. A set of pairs is the graph of a function exactly when every input appears with exactly one output: existence makes it total, uniqueness makes it single-valued. For real-number functions you can plot this set, and the vertical-line test is just the uniqueness rule in picture form. But functions on matrices, words, or groups have graphs too, even with no picture. One subtlety: the pairs show which outputs actually happen, but not extra unused values in the codomain, so you must say whether the codomain is part of the function's definition.

Given f: X → Y, Graph(f) = {(x, f(x)) : x ∈ X} ⊆ X × Y. This turns an evaluation rule into a relation. A relation G ⊆ X × Y is the graph of a total function exactly when every x ∈ X has a unique y with (x, y) ∈ G; requiring existence only for some inputs gives a partial function, and failure of uniqueness means no single-valued function in that orientation. The graph records the domain and the image but not unused codomain elements, so the same pair set can represent functions into different codomains; this is why some foundations define a function as a triple (domain, codomain, graph) while others identify it with the graph. For real functions the graph is a planar set and the vertical-line test expresses uniqueness, but this is a special case. Graphs enable structural reasoning: equal functions (with fixed domain and codomain) have equal graphs, composition is defined via an intermediate value, and transposing a bijection's graph gives the inverse. Properties like closed graphs or measurability turn facts about maps into facts about subsets of product spaces. This is distinct from graphs in the network sense.

Scope of Application¶

The graph-of-a-function abstraction is literal whenever a mapping is represented by its complete set of ordered evaluation pairs in a declared product.

Set-theoretic foundations. Defining functions as special binary relations.
Elementary analysis. Plotting real functions and testing single-valuedness.
Topology. Studying closed graphs and embeddings into product spaces.
Functional analysis. Representing operators through graph subspaces and domains.
Algebra. Encoding homomorphisms as subsets of product structures.
Category theory. Comparing graph relations with morphisms under extra structure.
Databases. Storing finite function tables as key–value relations.
Formal verification. Reducing evaluation and extensional equality to pair membership.

Clarity¶

A clear statement writes f: X -> Y, defines Graph(f) as a subset of X x Y, and distinguishes domain, image, and codomain. If a relation is offered first, it checks both existence and uniqueness. It declares whether the foundational convention identifies a function with the pair set or retains domain and codomain as extra data. In a real plot, it identifies axes and excludes inputs outside the domain; a curve segment or sampled plot is not silently equated with the exact graph.

Manages Complexity¶

The graph externalizes a mapping's behavior as a static object. Evaluation becomes pair lookup, equality becomes extensional pair equality, domain and image become coordinate projections, restriction becomes intersection with a smaller input product, and inversion becomes coordinate exchange plus a functionality test. This lets set, topological, algebraic, and analytical tools act on mappings. The compression has a cost: a finite picture may omit resolution, the pair set may omit declared but unused codomain values, and a high-dimensional graph can be less intuitive than an evaluation rule.

Abstract Reasoning¶

Declare the domain, codomain, and evaluation rule of the function.
Form an ordered pair from every input and its unique output.
Collect the pairs as a subset of the Cartesian product.
Project first coordinates to verify total domain coverage.
Test uniqueness of second coordinates at each fixed first coordinate.
Project second coordinates to recover the realized image.
Restrict or extend the domain by changing which first coordinates are represented.

Knowledge Transfer¶

The graph transfers the general move from an operation to its extension: replace a rule by the relation containing every input–output instance. The move supports database key constraints, state-transition relations, operator graphs, and relational semantics. Functionality is the transferable diagnostic: one output per declared input. The domain accent is ordered pairs in a Cartesian product and the exact mathematical mapping convention. Network terminology does not transfer, and a graph-theoretic edge set should not be imported merely because the same English word appears.

Relationships to Other Abstractions¶

Current abstraction Graph of a Function Domain-specific

Parents (1) — outgoing typed relations

Graph of a Function is a kind of Function (Mapping) Prime

Function Mapping is the strict parent by composition.

Hierarchy path (1) — routes to 1 parentless root

Graph of a Function → is a kind of Function (Mapping)

Neighborhood in Abstraction Space¶

Graph of a Function sits in a sparse region of the domain-specific corpus (83^rd 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