Function (Mapping)¶

Prime #: 2
Origin domain: Mathematics
Also from: Computer Science & Software Engineering, Philosophy
Aliases: Function, Map, Mapping, Morphism Informal
Related primes: Set and Membership, Relation, Composition, Stochasticity vs. Determinism, Inversion

Core Idea¶

Relating inputs to outputs through a rule or process.

How would you explain it like I'm…

Same answer machine

Think of a vending machine. You press B4 and you always get the same snack. Press B4 again — same snack. A function is just a rule like that: put something in, get one exact thing out, every single time. No surprises. That 'always the same answer' is what makes a function a function.

Same input, same output

A function is a rule that takes an input and gives you exactly one output, every time, no matter when or who asks. 'Double the number' is a function: give it 3, you get 6 — always 6. The 'same input, same output' rule is the whole point. It separates functions from things like 'pick your favorite color,' which depends on mood. Functions are the building blocks of math and computer programs because you can trust them to behave the same way.

A deterministic input-output rule

A function is a rule that assigns to each input from one set (the domain) exactly one output from another set (the codomain). The defining commitment is determinism: same input, same output, no matter the context or the asker. That single-valued rule is what separates a function from a general relation (which can give many outputs), from a correlation (which is just statistical co-variation), and from a process (which has internal state and timing). Functions matter because they compose cleanly: feeding one function's output into another always gives you another function — which is why they're the building blocks of math, programming, and engineering.

A function is a rule that assigns to each element of one set (the domain, the set of allowable inputs) exactly one element of another set (the codomain, the set of possible outputs); the defining structural commitment is determinism — same input, same output, without reference to context, time, or evaluator state. This is what distinguishes a function from an arbitrary relation (which permits one-to-many links), from a correlation (statistical co-variation rather than deterministic assignment), from a causal relationship (which explains why rather than what), from an algorithm (which computes the function rather than being it), and from a process (which has internal state and timing). A function is specified by a domain of admissible inputs, a codomain of possible outputs, and the mapping itself — either extensionally (a table of input-output pairs) or intensionally (a formula, predicate, or algorithm). The deeper abstraction: moving from a mere association pattern to a single-valued rule is the foundational commitment that makes compositional reasoning possible. Functions compose cleanly because the single-valued guarantee ensures the composition is itself a function. This closure under composition is why function-mapping is load-bearing in analysis, programming, control theory, and category theory. Violations (hidden state, unacknowledged stochasticity, silent partiality) are the most common source of bugs in systems informally described as 'functional.'

Broad Use¶

Models dependencies and cause-effect relationships in systems, such as inputs/outputs in engineering, economics, or software.

Clarity¶

Models input-output relationships, such as understanding how rain (input) affects crop yield (output), simplifying causal reasoning in agriculture.

Manages Complexity¶

Encapsulates dependencies into manageable units, avoiding repeated manual reasoning for every input-output pair.

Abstract Reasoning¶

Frames relationships as abstract rules, allowing generalizations like "if , then " across contexts.

Knowledge Transfer¶

Enables application of dependency reasoning across fields like economics (supply-demand), biology (genetic inheritance), and engineering (force-displacement).

Example¶

A recipe maps ingredients (inputs) to a finished dish (output), providing a clear dependency relationship.

Relationships to Other Abstractions¶

Current abstraction Function (Mapping) Prime

Foundational — no parent edges in the catalog.

Children (27) — more specific cases that build on this

Engel curve Domain-specific is a kind of Function (Mapping)

An Engel Curve is a function specialized to map household income to one good's demanded quantity or budget share while the price vector is held fixed.
Norm Domain-specific is a kind of Function (Mapping)

A Norm is a Function Mapping specialized to assign every vector one non-negative real magnitude under three compatibility axioms.
Probability Weighting Function Domain-specific is a kind of Function (Mapping)

A probability-weighting function is a function mapping specialized to probability inputs and subjective decision-weight outputs.
Random Variable Domain-specific is a kind of Function (Mapping)

A Random Variable is a Function Mapping specialized to a measurable map from a probability space into a numerical measurable space.
Wavelet Domain-specific is a kind of Function (Mapping)

A Wavelet is a Function Mapping specialized to a localized, mean-zero, finite-energy oscillatory template whose dilations and translations analyze signals.

▸ Show 22 more

Bijectivity Prime is a kind of Function (Mapping)
Bijectivity is a Function Mapping specialized by the conjunction of no collisions and no gaps, which yields a unique inverse.
Convolution Prime is a kind of Function (Mapping)
Convolution is 'the UNIQUE linear, translation-invariant' function mapping — one fixed kernel applied identically everywhere.
Dose-Response Relationship Prime is a kind of Function (Mapping)
Dose-response relationship is a specialization of function (mapping) that assigns response magnitudes deterministically to dose levels.
Hashing Prime is a kind of Function (Mapping)
Hashing is a deterministic many-to-one function from an unbounded input space to a short fixed-size token (a bounded codomain), used as the object's handle.
Higher Order Function Prime is a kind of Function (Mapping)
'Not function_mapping — a function-mapping is the FIRST-ORDER layer (data to data); a higher-order function operates on the NEXT layer up, taking or returning functions themselves...
Injectivity Prime is a kind of Function (Mapping)
Injectivity is a Function Mapping specialized by the no-collision requirement that distinct inputs receive distinct outputs.
Metric Prime is a kind of Function (Mapping)
Every Metric is a Function Mapping from ordered pairs of objects to non-negative real distances, with metric axioms added.
Similarity Measure Prime is a kind of Function (Mapping)
A similarity measure is a function mapping specialized to pairs of represented objects and a comparable degree of likeness.
Surjectivity Prime is a kind of Function (Mapping)
Surjectivity is a Function Mapping specialized by the no-gap requirement that every element of the declared codomain is reached by at least one input.
Transformation Prime is a kind of, typical Function (Mapping)
A transformation is a rule-governed single-valued mapping with added invariant-preservation semantics; every transformation is a function.
Derivative Domain-specific presupposes Function (Mapping)
A Derivative requires a Function Mapping whose output response to nearby input changes is evaluated at a base point.
Functor Domain-specific is part of Function (Mapping)
A Functor contains deterministic object and arrow functions whose coordinated images are constrained by the identity and composition laws.
Hamiltonian Mechanics Domain-specific is part of Function (Mapping)
Hamiltonian Mechanics contains a scalar function mapping each phase-space state and time to the Hamiltonian value that generates the system's flow.
Image (of a Function) Domain-specific presupposes Function (Mapping)
An Image requires a Function Mapping whose outputs can be collected and compared with its declared codomain.
Regression Domain-specific is part of Function (Mapping)
Regression contains a function mapping as its systematic component from explanatory-variable inputs to an outcome value or distribution parameter.
Algorithm Prime presupposes Function (Mapping)
An algorithm presupposes function because the procedure it specifies is precisely a mechanical way of realizing a deterministic input-to-output mapping.
Equivariance Prime presupposes Function (Mapping)
Equivariance presupposes Function (Mapping): the equivariance property is asserted of a deterministic map between sets carrying group actions.
Indirection Prime is part of Function (Mapping)
Indirection contains the reference-to-provider mapping that its resolution mechanism evaluates while decoupling consumer from provider.
Preimage Prime presupposes Function (Mapping)
'The preimage RIDES ON a forward mapping but runs its arrow backward...
Teleology Prime presupposes Function (Mapping)
Teleology presupposes function because end-directed explanation operates by assigning each phenomenon to the function it serves.
Supply Domain-specific is a decomposition of Function (Mapping)
Supply decomposes to Function Mapping because its schedule assigns each admissible price and background condition the quantity producers would bring to market.
Game-Theoretic Strategy Prime is a decomposition of Function (Mapping)
A game-theoretic strategy is the specific shape function takes when the mapping is from observed game history to a chosen action at each information set.

Not to Be Confused With¶

Function (Mapping) is not Recurrence because Function Mapping is a static mathematical or logical correspondence between input and output domains, whereas Recurrence defines a sequence where each term depends on previous terms.
Function (Mapping) is not Transformation because Function Mapping explicitly specifies the systematic rule translating inputs to outputs, whereas Transformation is the general process of changing something from one form to another.
Function (Mapping) is not Algorithm because Function Mapping explicitly specifies the systematic rule translating inputs to outputs, whereas Algorithm is a step-by-step procedure for executing a computation or solving a problem.