Functional Relationships
A functional relationship is a rule that assigns to each input exactly one output. Key result in words: if you know the input, the function pins down a single, unambiguous output — no input maps to two different values. Where it applies: all of mathematics, physics, economics, computing — wherever one quantity depends predictably on another. Who/when: the modern concept crystallized through Euler (1748), Dirichlet (1837), and the set-theoretic definition of the 20th century.
A function is not an equation and not a formula. It is a correspondence obeying one law: one input, one output. Everything else — graphs, equations, tables, the vertical line test, domain restrictions — is downstream of that single requirement. Master "each input gives exactly one output" and the entire topic unfolds from it.
Formal Statement
A function from a set (the domain) to a set (the codomain) is a rule assigning to each element exactly one element . We write:
Derivation hint: This is a definition, not a derived result; the notation ("x maps to f of x") names the rule that produces the output.
- = domain: the set of all permitted inputs.
- = codomain: a set guaranteed to contain every output.
- = a generic input (the independent variable).
- = the unique output corresponding to (the dependent variable).
- The range (or image) is the set of values actually attained: .
Formally, a function is a set of ordered pairs such that:
Derivation hint: This encodes single-valuedness directly — two pairs sharing the same first coordinate must share the second; it is the formal heart of "one input, one output."
A curve in the Cartesian plane is the graph of a function if and only if every vertical line intersects the curve at most once.
We show the test is equivalent to the single-valued condition [2]. 1. Setup. A vertical line consists of all points for . 2. Intersections. The points where this line meets the graph are exactly the pairs lying on the curve. 3. If a function: by [2], for input there is at most one output . Hence the line meets the curve at most once. 4. If at most one intersection: then for each there is at most one with on the curve — precisely condition [2] — so the curve defines a function. 5. Conclusion. The two statements are logically equivalent.
∎Why It Holds / Derivation
Suppose we relaxed the rule and allowed an input to produce two outputs . 1. Consider evaluating . We would obtain and . 2. Then any computation using — say — would yield and , contradictory values. 3. The notation would denote no definite number, so substitution into other expressions becomes meaningless. 4. Therefore single-valuedness is not a stylistic preference but a logical necessity for the symbol to refer to one thing. 5. Hence condition [2] is forced by the requirement that functions be usable in reasoning.
∎Dirichlet gave the modern, formula-free definition of a function: a correspondence in which "to each there corresponds a single finite ," regardless of whether a single analytic expression exists. To dramatize that a function need not be "nice," he proposed the function equal to one constant on the rationals and another on the irrationals — the Dirichlet function — which has no formula, no graph you can draw, yet is a perfectly legitimate function. His viewpoint liberated mathematics from the assumption that a function must be a tidy algebraic rule.
Building Intuition
Think of a function as a machine or a vending machine. You put in a coin and a code (the input); exactly one snack drops out (the output). A reliable vending machine never gives two different snacks for the same code — that is single-valuedness. It may give the same snack for two different codes (different inputs, same output — perfectly allowed). What it must never do is be unpredictable: same input, different outputs. Three other lenses:
- Table: a lookup column where each input row has one value.
- Map/arrow diagram: arrows leave every domain point; each point shoots out exactly one arrow (but two points may aim at the same target).
- Dependence: " depends on " means fixing fixes .
Worked Examples
Given: .
Find (a) and (b) the domain.
(a) Evaluate at :
(b) Domain. Two restrictions:
- Square root requires .
- Denominator requires .
Combine: and .
Given: A car travels so that its distance from a town is kilometres, where is hours, .
Find (a) the distance at h, and (b) confirm is a function of .
(a) Substitute :
(b) For each time , the expression yields exactly one number — substitution into a polynomial is single-valued — so is a genuine function of .
Common Misconceptions
"A function must have a formula." False. A function can be defined by a table, a graph, a piecewise rule, or a verbal description. The defining property is single-valuedness (condition [2]), not the existence of an algebraic expression.
" means times ." No. denotes the output of at input . The parentheses signal function application, not multiplication.
"Different inputs must give different outputs." Not required. A function may send many inputs to the same output (e.g., sends both and to ). Forbidding this would be the injective property — an extra condition, not part of being a function.
Consider the relation defined by (a circle of radius 5). Is a function of ? At : . One input gives two outputs, violating [2]. The vertical line cuts the circle twice. Therefore a circle is not the graph of a function. (It can, however, be split into two functions: and .)
Connections
Functional relationships sit at the centre of a web of ideas:
- Linear Functions are the simplest case — constant rate of change, straight-line graphs.
- Inverse Functions arise by reversing a function's arrows, possible only when the function is one-to-one.
- Function Composition chains two functions: feed one machine's output into another.
- Coordinate Geometry turns functions into graphs and graphs into functions via the Vertical Line Test.
- Limits and Continuity and Derivatives study how function outputs behave as inputs vary, the foundation of calculus.
Real-World Applications
Historical Development
Subtleties & Limits
The clean definition hides genuine depth.
- Functions of several variables and vector-valued functions generalize the idea: inputs and outputs can be tuples, vectors, even other functions (as in functional analysis).
- Pathological functions — nowhere-continuous, nowhere-differentiable, or measurable-but-not-Riemann-integrable — show that "function" is far larger than the smooth curves of school algebra.
- Definability and computability: there exist functions that no algorithm can compute (a consequence of Turing's work). Most real-number functions cannot even be described in any finite language, since the descriptions are countable but the functions are not.
- The axiom of choice is sometimes needed to guarantee the existence of certain functions (e.g., choice functions selecting one element from each set of an infinite family), linking the humble idea of a function to deep questions in the foundations of mathematics.
See Also
Linear Functions · Inverse Functions · Function Composition · Vertical Line Test · Coordinate Geometry · Limits and Continuity · Sets and Set Notation