30 Relations and Function Foundations
Relations and Function Foundations explore how mathematical relationships and mappings form the basis for understanding algebraic structures and operations.
Relations and Function Foundations is the study of how pairs of related quantities are organized into mathematical objects called relations, and the specific structural criterion that distinguishes a special, especially useful subset of relations called functions. This topic establishes the conceptual vocabulary needed before function notation, graphing, and modeling can be developed.
The Structure of a Relation
A relation is any set of ordered pairs, each pairing an input value with an output value. A relation can be given as an explicit list of ordered pairs, such as {(1, 2), (2, 4), (3, 6)}, as a table matching input values to output values, as a set of points on a graph, or as a rule connecting inputs to outputs. The set of all input values appearing in a relation is called its domain, and the set of all output values appearing in a relation is called its range. Every relation, regardless of how it is represented, can be described in terms of these two sets and the pairing between them.
The Function Criterion
A function is a relation in which every input value is paired with exactly one output value — no input is ever associated with two or more different outputs. This single requirement, often called the function criterion, is the defining property that separates functions from relations in general: a relation that pairs some input with more than one distinct output fails to be a function, even if every other input in that relation behaves properly. The relation {(1, 2), (2, 4), (2, 5)} is not a function, because the input 2 is paired with two different outputs, 4 and 5, while {(1, 2), (2, 4), (3, 4)} is a function, since each input has exactly one output, even though two different inputs happen to share the same output.
Recognizing Input and Output Patterns
Distinguishing inputs from outputs correctly is essential before the function criterion can be checked. In a set of ordered pairs, the first coordinate of each pair is conventionally treated as the input and the second as the output. In a table of values, inputs are typically listed in one row or column and outputs in the corresponding row or column. Checking the function criterion means scanning specifically for repeated input values and, whenever one is found, comparing the outputs paired with that repeated input to see whether they match or differ.
Recognizing Functions Across Representations
A relation given as a set of ordered pairs or a table is checked for the function criterion by scanning the input values for any repetition; if the same input value appears more than once with two different output values, the relation is not a function. A relation given as a mapping diagram, which draws arrows from each input in one column to its corresponding output in another column, is checked by confirming that no input has more than one arrow leaving it; an input with two or more outgoing arrows to different outputs violates the function criterion.
Recognizing Functions from a Graph
A relation given as a graph is checked for the function criterion using the vertical line test: if any vertical line drawn through the graph would intersect the graph at more than one point, the relation is not a function, since that would indicate a single x-value (input) is paired with two or more different y-values (outputs). If every possible vertical line intersects the graph at most once, the graph represents a function. A circle graphed on the coordinate plane fails the vertical line test, since a vertical line through its interior crosses the circle at two points, while a straight, non-vertical line graphed on the coordinate plane always passes the vertical line test.
Verifying a Function Classification
A claimed classification of a relation as a function, or not a function, is verified by systematically checking every input value present for repetition and comparing associated outputs, rather than checking only a few pairs and assuming the pattern holds. For a graph, verification means testing several vertical lines across the width of the graph, particularly at any location where the graph appears to curve back on itself, since a single missed intersection is enough to overturn a function classification.
Diagnosing Relation and Function Errors
Common errors in this area include confusing which coordinate or column represents the input and which represents the output, concluding a relation is not a function because two different inputs share the same output (a situation that is fully allowed, since the function criterion restricts only what a single input may map to), applying the vertical line test using a horizontal line by mistake, and checking the function criterion on only part of a relation's listed pairs rather than scanning the entire set for a repeated input value.