THE WHOLE UNIT · ONE REFERENCE
Functions Review
Cheat sheet.
The key rules, formulas and reminders from all 27 topics, gathered into reference cards.
Key formulas, conditions and traps · Read down each column.
Defining a Function
Key method
The notation specifies the domain and codomain . The rule tells how to assign outputs. The actual outputs form the range, which is a subset of .
Evaluating a Function
Key method
For , input gives . If is an expression, expand only after substitution. Check domain restrictions first.
Domain, Codomain and Range
Key method
For , the range is . Restricting the domain can shrink the range. Enlarging the codomain alone does not change any computed value.
What Makes a Rule a Function
Key method
A vertical line may meet the graph at at most one point. A formula that fails at an input can define a function on a smaller domain, but cannot silently retain the forbidden input.
Properties of the Range
Key method
Useful methods include completing the square, monotonicity on the stated domain, and solving for an allowed . Endpoint inclusion follows from whether an input actually attains the candidate output.
Reading Domain and Range off a Graph
Key method
Use brackets for included endpoints and parentheses for excluded endpoints. A missing point removes an output from the range only if no other point on the graph has that same height.
Domain and Range of a Rational Function
Key method
To find the range, solve for , then check for impossible targets and forbidden solutions. Removable holes can exclude an otherwise attainable output.
Linear Functions
Key method
For distinct inputs,
Positive means increasing, negative decreasing, and zero constant. A vertical line is not the graph of a function .
Piecewise Functions
Key method
To evaluate, first decide which condition the input satisfies, then use only that formula. At a boundary, inspect strict and non-strict inequality signs to determine endpoint inclusion.
Writing an Absolute Value Piecewise
Key method
For an expression , solve to locate the breakpoints before splitting into intervals.
Even Functions
Key method
Test the whole formula, not merely its visible exponents. Absolute value and cosine are even; many expressions containing odd powers are neither even nor odd.
Odd Functions
Key method
If zero belongs to the domain, oddness forces . That necessary condition alone does not prove a function is odd.
Arithmetic on Even and Odd Functions
Key method
Even + even is even; odd + odd is odd. Products obey: even × even is even, odd × odd is even, and even × odd is odd. A sum of a nonzero even part and a nonzero odd part is generally neither.
Symmetry of a Graph
Key method
reflects across the horizontal axis. reflects across the vertical axis. reflects through the origin. Reflection across exchanges coordinates and describes an inverse relation.
Translating a Graph
Key method
A point becomes . Positive shifts right, while positive shifts up.
Stretching and Compressing a Graph
Key method
For with nonzero , becomes . Thus stretches vertically, while compresses horizontally. Negative factors also reflect.
Defining Composition
Key method
Its domain contains exactly the inputs in the domain of whose outputs lie in the domain of . Both stages must be legal.
Properties of Composition
Key method
Both sides mean . With the identity function , on the appropriate domain.
One-to-One Functions
Key method
Strictly increasing or strictly decreasing functions on an interval are injective there. Restricting the domain can make a noninjective rule injective.
Functions That Are Not Onto
Key method
To disprove onto behavior, exhibit a single element of the codomain with no preimage. You must know the codomain before making this judgment.
Onto Functions
Key method
For , surjectivity means: for every , there exists with . Verify both that the constructed input belongs to and that substitution returns .
Why One-to-One and Onto Matter
Key method
If is bijective, then satisfies
Surjectivity guarantees existence of the reverse assignment; injectivity guarantees uniqueness.
Finding the Inverse of a Function
Key method
Write , solve for in terms of , then rename the input of the inverse. Domain and range exchange roles. Verify by composition on the appropriate domains.
A Shortcut for the Inverse
Key method
If and both maps are bijective between their specified sets, then
The last operation performed is the first operation undone.
A Function and Its Inverse on the Graph
Key method
If lies on a bijective function's graph, lies on its inverse graph. Vertical and horizontal features exchange: domain becomes range, and a vertical asymptote becomes a horizontal one where applicable.
Increasing and Decreasing Intervals
Key method
Strict increase means for every pair in the interval. Strict decrease reverses the output inequality. Later, derivative signs provide an efficient test.
Local and Absolute Maxima and Minima
Key method
An absolute minimum at satisfies for every allowed . A local minimum needs this only in a neighborhood of within the domain. Maximum reverses the inequality.
Defining a Function
3 reference blocks
Key method
The notation specifies the domain and codomain . The rule tells how to assign outputs. The actual outputs form the range, which is a subset of .
Example
Let have rule . Then and . These equal outputs do not violate the function definition: each input still has only one square. The equation describes a relation with two possible values for positive , unless a branch is selected.
Avoid this mistake
is the output, not multiplication of by . The input symbol is a placeholder: describes the same rule.
Evaluating a Function
3 reference blocks
Key method
For , input gives . If is an expression, expand only after substitution. Check domain restrictions first.
Example
Compute :
Subtracting leaves . If , dividing by gives , the difference quotient used in differentiation.
Avoid this mistake
is usually not . A nonlinear function does not distribute over addition.
Domain, Codomain and Range
3 reference blocks
Key method
For , the range is . Restricting the domain can shrink the range. Enlarging the codomain alone does not change any computed value.
Example
For , , the minimum is at and the maximum is at . The range is , not : squaring only the endpoints misses the interior minimum. With domain , the same rule has range .
Avoid this mistake
The codomain cannot be inferred uniquely from the formula. State it explicitly when asking whether a function is onto.
What Makes a Rule a Function
3 reference blocks
Key method
A vertical line may meet the graph at at most one point. A formula that fails at an input can define a function on a smaller domain, but cannot silently retain the forbidden input.
Example
The circle fails the vertical-line test: at it has and . Its upper half is a function on . The rule is a function on , but not on all of .
Avoid this mistake
The horizontal-line test checks one-to-one behavior, not whether the relation is a function in the first place.
Properties of the Range
3 reference blocks
Key method
Useful methods include completing the square, monotonicity on the stated domain, and solving for an allowed . Endpoint inclusion follows from whether an input actually attains the candidate output.
Example
For on , the square gives . Conversely, for any , choose , which produces . The range is exactly . For , output zero is impossible, while every nonzero is attained by .
Avoid this mistake
A graph window can suggest a range but cannot prove behavior outside its visible portion.
Reading Domain and Range off a Graph
3 reference blocks
Key method
Use brackets for included endpoints and parentheses for excluded endpoints. A missing point removes an output from the range only if no other point on the graph has that same height.
Example
Consider the line segment for . Its horizontal projection is . Since the line increases, its vertical projection is . If a graph has a hole at but also passes through , the output still belongs to its range.
Avoid this mistake
Do not interpret the edge of a plotted window as a mathematical endpoint. Look for an explicit domain, endpoint marker or continuation arrow.
Domain and Range of a Rational Function
3 reference blocks
Key method
To find the range, solve for , then check for impossible targets and forbidden solutions. Removable holes can exclude an otherwise attainable output.
Example
For , the domain excludes . Solve :
This expression never equals , so every is attained. At , the equation would say , impossible. The range excludes .
Avoid this mistake
For , canceling gives only when . The hole means the range also excludes .
Linear Functions
3 reference blocks
Key method
For distinct inputs,
Positive means increasing, negative decreasing, and zero constant. A vertical line is not the graph of a function .
Example
A line through and has slope . Substituting into gives . Hence and increasing by increases the output by .
Avoid this mistake
The intercept is the output at , not the input at which the graph crosses the horizontal axis.
Piecewise Functions
3 reference blocks
Key method
To evaluate, first decide which condition the input satisfies, then use only that formula. At a boundary, inspect strict and non-strict inequality signs to determine endpoint inclusion.
Example
Let for and for . Then , , and . The left branch approaches near zero, while the value at zero is determined by the second branch. This is a jump, despite both formulas being individually continuous.
Avoid this mistake
Using both formulas at a boundary without checking the case conditions can assign two incompatible outputs.
Writing an Absolute Value Piecewise
3 reference blocks
Key method
For an expression , solve to locate the breakpoints before splitting into intervals.
Example
For , the breakpoint is . If , then and the value is . If , the value is . Both branches meet at zero when , producing a corner rather than a discontinuity.
Avoid this mistake
is not generally . For , the two sides are and .
Even Functions
3 reference blocks
Key method
Test the whole formula, not merely its visible exponents. Absolute value and cosine are even; many expressions containing odd powers are neither even nor odd.
Example
For , substitution gives . For , is generally different. Restricting to removes the symmetric domain, so the restricted function is not even under the standard definition.
Avoid this mistake
Matching and alone does not prove evenness; the equality must hold throughout the domain.
Odd Functions
3 reference blocks
Key method
If zero belongs to the domain, oddness forces . That necessary condition alone does not prove a function is odd.
Example
For , . The reciprocal is also odd on its symmetric domain excluding zero. In contrast, fails because the constant does not change sign.
Avoid this mistake
The zero function is both even and odd on any symmetric domain. Most functions are neither.
Arithmetic on Even and Odd Functions
3 reference blocks
Key method
Even + even is even; odd + odd is odd. Products obey: even × even is even, odd × odd is even, and even × odd is odd. A sum of a nonzero even part and a nonzero odd part is generally neither.
Example
The function is even: both and are odd, so their sign changes cancel. The function is odd. For , its even part is and its odd part is .
Avoid this mistake
An odd power in a numerator does not determine the parity of an entire rational expression; inspect the denominator too.
Symmetry of a Graph
3 reference blocks
Key method
reflects across the horizontal axis. reflects across the vertical axis. reflects through the origin. Reflection across exchanges coordinates and describes an inverse relation.
Example
If lies on , then lies on , lies on , and lies on . For the even function , horizontal input reflection leaves the graph unchanged, but output reflection gives a downward-opening parabola.
Avoid this mistake
The graph is not a right-to-left reflection of ; it is an up-to-down reflection.
Translating a Graph
3 reference blocks
Key method
A point becomes . Positive shifts right, while positive shifts up.
Example
The vertex of is . For , that vertex moves to . The original points and move to and , preserving symmetry about the new vertical line .
Avoid this mistake
The sign inside looks reversed because the old input now occurs at . Derive the shift from that equation instead of memorizing a slogan.
Stretching and Compressing a Graph
3 reference blocks
Key method
For with nonzero , becomes . Thus stretches vertically, while compresses horizontally. Negative factors also reflect.
Example
For , triples every output. The point becomes . For , the same old input is reached at , so its point becomes . Although here, horizontal and vertical scaling are different constructions.
Avoid this mistake
A multiplier of zero collapses a graph and is not an invertible stretch. Track this as its own case.
Defining Composition
3 reference blocks
Key method
Its domain contains exactly the inputs in the domain of whose outputs lie in the domain of . Both stages must be legal.
Example
Let and . Then with domain . Reversing the order gives with domain . The different order changes both the rule and its domain.
Avoid this mistake
Composition is not multiplication. generally differs from .
Properties of Composition
3 reference blocks
Key method
Both sides mean . With the identity function , on the appropriate domain.
Example
For and , , while . At , the outputs are and . Thus associativity does not imply commutativity. An inverse is special: composing it with the original function returns the identity on the corresponding set.
Avoid this mistake
Canceling from requires injectivity. It is not a general algebraic cancellation rule.
One-to-One Functions
3 reference blocks
Key method
Strictly increasing or strictly decreasing functions on an interval are injective there. Restricting the domain can make a noninjective rule injective.
Example
For , equality forces . For on , , so it is not injective. On , and nonnegativity force , making the restriction injective.
Avoid this mistake
A graph passing the vertical-line test can still fail the horizontal-line test. It is a function, but may not have an inverse function on the full domain.
Functions That Are Not Onto
3 reference blocks
Key method
To disprove onto behavior, exhibit a single element of the codomain with no preimage. You must know the codomain before making this judgment.
Example
For with , the target cannot be reached by a real input. Thus is not onto. If instead the declared codomain is , every target has preimage , so the same formula and domain become onto that codomain.
Avoid this mistake
A function can be one-to-one without being onto, or onto without being one-to-one. These are independent properties.
Onto Functions
3 reference blocks
Key method
For , surjectivity means: for every , there exists with . Verify both that the constructed input belongs to and that substitution returns .
Example
Take , . Given any real , set . This is real and . Therefore the function is onto. On domain with the same codomain, it is not onto: its range starts at .
Avoid this mistake
Checking a few targets is evidence, not a proof for every target. Use a symbolic arbitrary .
Why One-to-One and Onto Matter
3 reference blocks
Key method
If is bijective, then satisfies
Surjectivity guarantees existence of the reverse assignment; injectivity guarantees uniqueness.
Example
The function , , is bijective. Its inverse is . If its domain expands to all real numbers, uniqueness is lost. If its codomain expands to all real numbers, some targets have no preimage.
Avoid this mistake
An inverse is not a reciprocal: usually differs from .
Finding the Inverse of a Function
3 reference blocks
Key method
Write , solve for in terms of , then rename the input of the inverse. Domain and range exchange roles. Verify by composition on the appropriate domains.
Example
For , solve to get . Hence . For on , take the nonnegative branch: , also defined for .
Avoid this mistake
Writing both does not define a single inverse function; the original domain decides which branch to use.
A Shortcut for the Inverse
3 reference blocks
Key method
If and both maps are bijective between their specified sets, then
The last operation performed is the first operation undone.
Example
For , first subtract , cube, multiply by , then add . Reverse these operations: subtract , divide by , take a cube root, add .
Cube roots are single-valued over the reals, so no branch restriction is needed.
Avoid this mistake
Undoing in the same order is wrong. Squaring also requires a domain restriction before a square root can undo it.
A Function and Its Inverse on the Graph
3 reference blocks
Key method
If lies on a bijective function's graph, lies on its inverse graph. Vertical and horizontal features exchange: domain becomes range, and a vertical asymptote becomes a horizontal one where applicable.
Example
The exponential passes through and . Its inverse passes through and . The exponential's horizontal asymptote corresponds to the logarithm's vertical asymptote .
Avoid this mistake
A graph and its inverse need not meet on the displayed window. Reflection does not mean reflection across the vertical axis.
Increasing and Decreasing Intervals
3 reference blocks
Key method
Strict increase means for every pair in the interval. Strict decrease reverses the output inequality. Later, derivative signs provide an efficient test.
Example
For , the graph decreases toward its vertex on and increases away from it on . The values on both intervals are nonnegative, illustrating why positive output does not mean increasing.
Avoid this mistake
A flat tangent at one point does not automatically mean a change in monotonicity. For example, increases through zero.
Local and Absolute Maxima and Minima
3 reference blocks
Key method
An absolute minimum at satisfies for every allowed . A local minimum needs this only in a neighborhood of within the domain. Maximum reverses the inequality.
Example
For on , the absolute minimum is at . Endpoint values are and , so the absolute maximum is at . On the open interval , values approach but never attain it, so no absolute maximum exists.
Avoid this mistake
A bound need not be attained. The words “maximum” and “minimum” require actual inputs that produce those values.