Function Notation and Terminology
Functions are the core building blocks of Algebra II. A function connects each input to exactly one output, and function notation gives you a compact way to express that relationship. Understanding how to read, evaluate, and classify functions is essential for nearly everything else in this course.

Functions and Function Notation
A function is a relation that assigns each element in a set to exactly one element, called , in a set . The key word is exactly one: every input gets one and only one output.
Function notation is written as , where names the function and is the input variable. You read as "f of x." It does not mean times .
To evaluate a function, substitute the input value wherever you see :
- If , then
- If , then
You can also evaluate functions at expressions, not just numbers. For instance, .
Domain, Codomain, and Range
- The domain is set , the set of all allowable inputs.
- The codomain is set , the set of all potential outputs.
- The range is the set of outputs the function actually produces. The range is always a subset of the codomain (it can equal the codomain, but it doesn't have to).
The vertical line test determines whether a graph represents a function:
- If any vertical line intersects the graph more than once, the relation is not a function, because that would mean one input maps to multiple outputs.
- A circle fails the vertical line test because a vertical line through its interior hits the curve at two points.
Domain and Range of Functions
Determining Domain and Range
The domain is the set of all -values for which the function is defined. The range is the set of all -values the function actually outputs.
You can find domain and range from different representations:
- From a graph: The domain is the set of all -values that have a point on the graph. The range is the set of all -values that appear on the graph. Look at how far left/right and up/down the graph extends.
- From an equation: Think about what inputs could cause problems (more on this below).
- From a table: The domain is the set of -values listed; the range is the set of corresponding -values.
_%3D_2x_%2B_1_and_input-output_relationships.%22-CNX_Precalc_Figure_01_01_008.jpg)
Domain Restrictions
Certain operations create values of that you must exclude from the domain:
- Division by zero: The denominator of a rational function cannot equal zero. For , set to find that must be excluded. The domain is all real numbers except .
- Square roots of negatives: The expression under an even-index radical must be greater than or equal to zero. For , set to get . The domain is .
To find domain restrictions systematically:
- Identify any denominators and set each one . Solve to find excluded values.
- Identify any even-index radicals and set each radicand . Solve to find the allowed interval.
- If both types appear in the same function, apply both restrictions and take the intersection.
Function Classifications
One-to-One Functions (Injective)
A function is one-to-one (injective) if no two different inputs produce the same output. Formally, whenever , then .
The horizontal line test checks this graphically:
- If any horizontal line intersects the graph more than once, the function is not one-to-one.
- fails because the horizontal line hits the graph at both and .
- passes because every horizontal line crosses the graph at most once.
One-to-one functions matter because only one-to-one functions have inverses that are also functions.
Onto Functions (Surjective)
A function is onto (surjective) if every element in the codomain is actually hit by some input. In other words, the range equals the codomain with nothing left over.
To check whether a function is onto, you need to know what the codomain is. For example, with codomain (all real numbers) is not onto because negative numbers in the codomain are never produced. But if you restrict the codomain to , then is onto.
_%3D_2x_%2B_1_and_input-output_relationships.%22-CNX_Precalc_Figure_01_01_006.jpg)
Bijective Functions
A function is bijective if it is both one-to-one and onto. Every element in the codomain is paired with exactly one element in the domain. Bijective functions are the only functions that have inverses which are themselves bijective. You'll rely on this concept heavily when you study inverse functions later in the course.
Functions vs Relations
Defining Relations
A relation is any set of ordered pairs that connects elements from one set to another. Every function is a relation, but not every relation is a function. Relations can be represented as graphs, equations, tables, or mapping diagrams.
Determining if a Relation is a Function
For a relation to qualify as a function, each -value must pair with exactly one -value. Here's how to check:
- From a graph: Apply the vertical line test. If every vertical line crosses the graph at most once, it's a function.
- From a set of ordered pairs: Check that no -value appears more than once with a different -value. The relation is not a function because maps to both and .
- From a table: Same idea as ordered pairs. Scan the input column for repeated -values with different outputs.
Note that two different -values can map to the same -value and still be a function. The set is a valid function; it just isn't one-to-one.