THE WHOLE UNIT · ONE REFERENCE

Functions Review
Cheat sheet.

The key rules, formulas and reminders from all 27 topics, gathered into reference cards.

Choose “Save as PDF” in the print dialog.

Key formulas, conditions and traps · Read down each column.

Defining a Function

Key method

The notation f:A→Bf:A\to B specifies the domain AA and codomain BB. The rule f(x)f(x) tells how to assign outputs. The actual outputs form the range, which is a subset of BB.

Evaluating a Function

Key method

For f(x)=x2−3xf(x)=x^2-3x, input uu gives f(u)=u2−3uf(u)=u^2-3u. If uu is an expression, expand only after substitution. Check domain restrictions first.

Domain, Codomain and Range

Key method

For f:A→Bf:A\to B, the range is f(A)={f(x):x∈A}⊆Bf(A)=\{f(x):x\in A\}\subseteq B. 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 x=ax=a 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 y=f(x)y=f(x) for an allowed xx. 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 y=p(x)/q(x)y=p(x)/q(x) for xx, then check for impossible targets and forbidden solutions. Removable holes can exclude an otherwise attainable output.

Linear Functions

Key method

For distinct inputs,

m=f(x2)−f(x1)x2−x1.m=\frac{f(x_2)-f(x_1)}{x_2-x_1}.

Positive mm means increasing, negative mm decreasing, and zero mm constant. A vertical line is not the graph of a function y=f(x)y=f(x).

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

∣u∣={u,u≥0,−u,u<0.|u|=\begin{cases}u,&u\ge0,\\-u,&u<0.\end{cases}

For an expression u(x)u(x), solve u(x)=0u(x)=0 to locate the breakpoints before splitting into intervals.

Even Functions

Key method

f(−x)=f(x).f(-x)=f(x).

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

f(−x)=−f(x).f(-x)=-f(x).

If zero belongs to the domain, oddness forces f(0)=0f(0)=0. 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

−f(x)-f(x) reflects across the horizontal axis. f(−x)f(-x) reflects across the vertical axis. −f(−x)-f(-x) reflects through the origin. Reflection across y=xy=x exchanges coordinates and describes an inverse relation.

Translating a Graph

Key method

g(x)=f(x−h)+k.g(x)=f(x-h)+k.

A point (u,f(u))(u,f(u)) becomes (u+h,f(u)+k)(u+h,f(u)+k). Positive hh shifts right, while positive kk shifts up.

Stretching and Compressing a Graph

Key method

For g(x)=af(bx)g(x)=a f(bx) with nonzero a,ba,b, (u,v)(u,v) becomes (u/b,av)(u/b,av). Thus ∣a∣>1|a|>1 stretches vertically, while ∣b∣>1|b|>1 compresses horizontally. Negative factors also reflect.

Defining Composition

Key method

(f∘g)(x)=f(g(x)).(f\circ g)(x)=f(g(x)).

Its domain contains exactly the inputs in the domain of gg whose outputs lie in the domain of ff. Both stages must be legal.

Properties of Composition

Key method

(f∘g)∘h=f∘(g∘h).(f\circ g)\circ h=f\circ(g\circ h).

Both sides mean f(g(h(x)))f(g(h(x))). With the identity function I(x)=xI(x)=x, f∘I=I∘f=ff\circ I=I\circ f=f on the appropriate domain.

One-to-One Functions

Key method

f(a)=f(b)⟹a=b.f(a)=f(b)\Longrightarrow a=b.

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 f:A→Bf:A\to B, surjectivity means: for every y∈By\in B, there exists x∈Ax\in A with f(x)=yf(x)=y. Verify both that the constructed input belongs to AA and that substitution returns yy.

Why One-to-One and Onto Matter

Key method

If f:A→Bf:A\to B is bijective, then f−1:B→Af^{-1}:B\to A satisfies

f−1(f(x))=x,f^{-1}(f(x))=x, f(f−1(y))=y.f(f^{-1}(y))=y.

Surjectivity guarantees existence of the reverse assignment; injectivity guarantees uniqueness.

Finding the Inverse of a Function

Key method

Write y=f(x)y=f(x), solve for xx in terms of yy, 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 f=g∘hf=g\circ h and both maps are bijective between their specified sets, then

f−1=h−1∘g−1.f^{-1}=h^{-1}\circ g^{-1}.

The last operation performed is the first operation undone.

A Function and Its Inverse on the Graph

Key method

If (a,b)(a,b) lies on a bijective function's graph, (b,a)(b,a) 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 x1<x2⇒f(x1)<f(x2)x_1<x_2\Rightarrow f(x_1)<f(x_2) 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 aa satisfies f(a)≤f(x)f(a)\le f(x) for every allowed xx. A local minimum needs this only in a neighborhood of aa within the domain. Maximum reverses the inequality.

01

Defining a Function

3 reference blocks

Read lesson ↗

Key method

The notation f:A→Bf:A\to B specifies the domain AA and codomain BB. The rule f(x)f(x) tells how to assign outputs. The actual outputs form the range, which is a subset of BB.

Example

Let f:R→Rf:\mathbb R\to\mathbb R have rule f(x)=x2f(x)=x^2. Then f(−3)=9f(-3)=9 and f(3)=9f(3)=9. These equal outputs do not violate the function definition: each input still has only one square. The equation y2=xy^2=x describes a relation with two possible yy values for positive xx, unless a branch is selected.

Avoid this mistake

f(x)f(x) is the output, not multiplication of ff by xx. The input symbol is a placeholder: f(t)=t2f(t)=t^2 describes the same rule.

02

Evaluating a Function

3 reference blocks

Read lesson ↗

Key method

For f(x)=x2−3xf(x)=x^2-3x, input uu gives f(u)=u2−3uf(u)=u^2-3u. If uu is an expression, expand only after substitution. Check domain restrictions first.

Example

Compute f(a+h)f(a+h):

f(a+h)=(a+h)2−3(a+h)=a2+2ah+h2−3a−3h.f(a+h)=(a+h)^2-3(a+h)=a^2+2ah+h^2-3a-3h.

Subtracting f(a)f(a) leaves 2ah+h2−3h2ah+h^2-3h. If h≠0h\ne0, dividing by hh gives 2a+h−32a+h-3, the difference quotient used in differentiation.

Avoid this mistake

f(a+h)f(a+h) is usually not f(a)+f(h)f(a)+f(h). A nonlinear function does not distribute over addition.

03

Domain, Codomain and Range

3 reference blocks

Read lesson ↗

Key method

For f:A→Bf:A\to B, the range is f(A)={f(x):x∈A}⊆Bf(A)=\{f(x):x\in A\}\subseteq B. Restricting the domain can shrink the range. Enlarging the codomain alone does not change any computed value.

Example

For f:[−2,3]→Rf:[-2,3]\to\mathbb R, f(x)=x2f(x)=x^2, the minimum is 00 at x=0x=0 and the maximum is 99 at x=3x=3. The range is [0,9][0,9], not [4,9][4,9]: squaring only the endpoints misses the interior minimum. With domain [1,3][1,3], the same rule has range [1,9][1,9].

Avoid this mistake

The codomain cannot be inferred uniquely from the formula. State it explicitly when asking whether a function is onto.

04

What Makes a Rule a Function

3 reference blocks

Read lesson ↗

Key method

A vertical line x=ax=a 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 x2+y2=1x^2+y^2=1 fails the vertical-line test: at x=0x=0 it has y=1y=1 and y=−1y=-1. Its upper half y=1−x2y=\sqrt{1-x^2} is a function on [−1,1][-1,1]. The rule 1/x1/x is a function on R∖{0}\mathbb R\setminus\{0\}, but not on all of R\mathbb R.

Avoid this mistake

The horizontal-line test checks one-to-one behavior, not whether the relation is a function in the first place.

05

Properties of the Range

3 reference blocks

Read lesson ↗

Key method

Useful methods include completing the square, monotonicity on the stated domain, and solving y=f(x)y=f(x) for an allowed xx. Endpoint inclusion follows from whether an input actually attains the candidate output.

Example

For f(x)=(x−2)2+3f(x)=(x-2)^2+3 on R\mathbb R, the square gives f(x)≥3f(x)\ge3. Conversely, for any y≥3y\ge3, choose x=2+y−3x=2+\sqrt{y-3}, which produces f(x)=yf(x)=y. The range is exactly [3,∞)[3,\infty). For 1/x1/x, output zero is impossible, while every nonzero yy is attained by x=1/yx=1/y.

Avoid this mistake

A graph window can suggest a range but cannot prove behavior outside its visible portion.

06

Reading Domain and Range off a Graph

3 reference blocks

Read lesson ↗

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 y=2x+1y=2x+1 for −1<x≤2-1<x\le2. Its horizontal projection is (−1,2](-1,2]. Since the line increases, its vertical projection is (−1,5](-1,5]. If a graph has a hole at (0,1)(0,1) but also passes through (2,1)(2,1), the output 11 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.

07

Domain and Range of a Rational Function

3 reference blocks

Read lesson ↗

Key method

To find the range, solve y=p(x)/q(x)y=p(x)/q(x) for xx, then check for impossible targets and forbidden solutions. Removable holes can exclude an otherwise attainable output.

Example

For f(x)=(x+1)/(x−2)f(x)=(x+1)/(x-2), the domain excludes 22. Solve y(x−2)=x+1y(x-2)=x+1:

x=2y+1y−1,x=\frac{2y+1}{y-1}, y≠1.y\ne1.

This expression never equals 22, so every y≠1y\ne1 is attained. At y=1y=1, the equation would say −2=1-2=1, impossible. The range excludes 11.

Avoid this mistake

For (x2−1)/(x−1)(x^2-1)/(x-1), canceling gives x+1x+1 only when x≠1x\ne1. The hole means the range also excludes 22.

08

Linear Functions

3 reference blocks

Read lesson ↗

Key method

For distinct inputs,

m=f(x2)−f(x1)x2−x1.m=\frac{f(x_2)-f(x_1)}{x_2-x_1}.

Positive mm means increasing, negative mm decreasing, and zero mm constant. A vertical line is not the graph of a function y=f(x)y=f(x).

Example

A line through (1,3)(1,3) and (4,9)(4,9) has slope (9−3)/(4−1)=2(9-3)/(4-1)=2. Substituting (1,3)(1,3) into y=2x+by=2x+b gives b=1b=1. Hence f(x)=2x+1f(x)=2x+1 and increasing xx by 0.50.5 increases the output by 11.

Avoid this mistake

The intercept is the output at x=0x=0, not the input at which the graph crosses the horizontal axis.

09

Piecewise Functions

3 reference blocks

Read lesson ↗

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 f(x)=x+2f(x)=x+2 for x<0x<0 and f(x)=x2f(x)=x^2 for x≥0x\ge0. Then f(−1)=1f(-1)=1, f(0)=0f(0)=0, and f(2)=4f(2)=4. The left branch approaches 22 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.

10

Writing an Absolute Value Piecewise

3 reference blocks

Read lesson ↗

Key method

∣u∣={u,u≥0,−u,u<0.|u|=\begin{cases}u,&u\ge0,\\-u,&u<0.\end{cases}

For an expression u(x)u(x), solve u(x)=0u(x)=0 to locate the breakpoints before splitting into intervals.

Example

For ∣2x−6∣|2x-6|, the breakpoint is x=3x=3. If x<3x<3, then 2x−6<02x-6<0 and the value is 6−2x6-2x. If x≥3x\ge3, the value is 2x−62x-6. Both branches meet at zero when x=3x=3, producing a corner rather than a discontinuity.

Avoid this mistake

∣a+b∣|a+b| is not generally ∣a∣+∣b∣|a|+|b|. For a=1,b=−1a=1,b=-1, the two sides are 00 and 22.

11

Even Functions

3 reference blocks

Read lesson ↗

Key method

f(−x)=f(x).f(-x)=f(x).

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 f(x)=x4−3x2+2f(x)=x^4-3x^2+2, substitution gives f(−x)=(−x)4−3(−x)2+2=f(x)f(-x)=(-x)^4-3(-x)^2+2=f(x). For g(x)=x2+xg(x)=x^2+x, g(−x)=x2−xg(-x)=x^2-x is generally different. Restricting x2x^2 to [0,∞)[0,\infty) removes the symmetric domain, so the restricted function is not even under the standard definition.

Avoid this mistake

Matching f(1)f(1) and f(−1)f(-1) alone does not prove evenness; the equality must hold throughout the domain.

12

Odd Functions

3 reference blocks

Read lesson ↗

Key method

f(−x)=−f(x).f(-x)=-f(x).

If zero belongs to the domain, oddness forces f(0)=0f(0)=0. That necessary condition alone does not prove a function is odd.

Example

For f(x)=x3−2xf(x)=x^3-2x, f(−x)=−x3+2x=−(x3−2x)f(-x)=-x^3+2x=-(x^3-2x). The reciprocal 1/x1/x is also odd on its symmetric domain excluding zero. In contrast, x3+1x^3+1 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.

13

Arithmetic on Even and Odd Functions

3 reference blocks

Read lesson ↗

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 xsin⁡xx\sin x is even: both xx and sin⁡x\sin x are odd, so their sign changes cancel. The function xcos⁡xx\cos x is odd. For f(x)=x2+xf(x)=x^2+x, its even part is (f(x)+f(−x))/2=x2(f(x)+f(-x))/2=x^2 and its odd part is (f(x)−f(−x))/2=x(f(x)-f(-x))/2=x.

Avoid this mistake

An odd power in a numerator does not determine the parity of an entire rational expression; inspect the denominator too.

14

Symmetry of a Graph

3 reference blocks

Read lesson ↗

Key method

−f(x)-f(x) reflects across the horizontal axis. f(−x)f(-x) reflects across the vertical axis. −f(−x)-f(-x) reflects through the origin. Reflection across y=xy=x exchanges coordinates and describes an inverse relation.

Example

If (2,5)(2,5) lies on ff, then (2,−5)(2,-5) lies on −f-f, (−2,5)(-2,5) lies on f(−x)f(-x), and (−2,−5)(-2,-5) lies on −f(−x)-f(-x). For the even function x2x^2, horizontal input reflection leaves the graph unchanged, but output reflection gives a downward-opening parabola.

Avoid this mistake

The graph y=−x2y=-x^2 is not a right-to-left reflection of y=x2y=x^2; it is an up-to-down reflection.

15

Translating a Graph

3 reference blocks

Read lesson ↗

Key method

g(x)=f(x−h)+k.g(x)=f(x-h)+k.

A point (u,f(u))(u,f(u)) becomes (u+h,f(u)+k)(u+h,f(u)+k). Positive hh shifts right, while positive kk shifts up.

Example

The vertex of f(x)=x2f(x)=x^2 is (0,0)(0,0). For g(x)=(x−2)2+3g(x)=(x-2)^2+3, that vertex moves to (2,3)(2,3). The original points (1,1)(1,1) and (−1,1)(-1,1) move to (3,4)(3,4) and (1,4)(1,4), preserving symmetry about the new vertical line x=2x=2.

Avoid this mistake

The sign inside looks reversed because the old input 00 now occurs at x=hx=h. Derive the shift from that equation instead of memorizing a slogan.

16

Stretching and Compressing a Graph

3 reference blocks

Read lesson ↗

Key method

For g(x)=af(bx)g(x)=a f(bx) with nonzero a,ba,b, (u,v)(u,v) becomes (u/b,av)(u/b,av). Thus ∣a∣>1|a|>1 stretches vertically, while ∣b∣>1|b|>1 compresses horizontally. Negative factors also reflect.

Example

For f(x)=x2f(x)=x^2, g(x)=3f(x)g(x)=3f(x) triples every output. The point (2,4)(2,4) becomes (2,12)(2,12). For h(x)=f(2x)h(x)=f(2x), the same old input 22 is reached at x=1x=1, so its point becomes (1,4)(1,4). Although f(2x)=4x2f(2x)=4x^2 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.

17

Defining Composition

3 reference blocks

Read lesson ↗

Key method

(f∘g)(x)=f(g(x)).(f\circ g)(x)=f(g(x)).

Its domain contains exactly the inputs in the domain of gg whose outputs lie in the domain of ff. Both stages must be legal.

Example

Let f(u)=uf(u)=\sqrt u and g(x)=x−3g(x)=x-3. Then (f∘g)(x)=x−3(f\circ g)(x)=\sqrt{x-3} with domain x≥3x\ge3. Reversing the order gives (g∘f)(x)=x−3(g\circ f)(x)=\sqrt x-3 with domain x≥0x\ge0. The different order changes both the rule and its domain.

Avoid this mistake

Composition is not multiplication. f(g(x))f(g(x)) generally differs from f(x)g(x)f(x)g(x).

18

Properties of Composition

3 reference blocks

Read lesson ↗

Key method

(f∘g)∘h=f∘(g∘h).(f\circ g)\circ h=f\circ(g\circ h).

Both sides mean f(g(h(x)))f(g(h(x))). With the identity function I(x)=xI(x)=x, f∘I=I∘f=ff\circ I=I\circ f=f on the appropriate domain.

Example

For f(x)=x+1f(x)=x+1 and g(x)=x2g(x)=x^2, (f∘g)(x)=x2+1(f\circ g)(x)=x^2+1, while (g∘f)(x)=(x+1)2(g\circ f)(x)=(x+1)^2. At x=1x=1, the outputs are 22 and 44. 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 ff from f(a)=f(b)f(a)=f(b) requires injectivity. It is not a general algebraic cancellation rule.

19

One-to-One Functions

3 reference blocks

Read lesson ↗

Key method

f(a)=f(b)⟹a=b.f(a)=f(b)\Longrightarrow a=b.

Strictly increasing or strictly decreasing functions on an interval are injective there. Restricting the domain can make a noninjective rule injective.

Example

For f(x)=5x+1f(x)=5x+1, equality 5a+1=5b+15a+1=5b+1 forces a=ba=b. For g(x)=x2g(x)=x^2 on R\mathbb R, g(−2)=g(2)g(-2)=g(2), so it is not injective. On [0,∞)[0,\infty), a2=b2a^2=b^2 and nonnegativity force a=ba=b, 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.

20

Functions That Are Not Onto

3 reference blocks

Read lesson ↗

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 f:R→Rf:\mathbb R\to\mathbb R with f(x)=x2f(x)=x^2, the target −1-1 cannot be reached by a real input. Thus ff is not onto. If instead the declared codomain is [0,∞)[0,\infty), every target yy has preimage y\sqrt y, 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.

21

Onto Functions

3 reference blocks

Read lesson ↗

Key method

For f:A→Bf:A\to B, surjectivity means: for every y∈By\in B, there exists x∈Ax\in A with f(x)=yf(x)=y. Verify both that the constructed input belongs to AA and that substitution returns yy.

Example

Take f:R→Rf:\mathbb R\to\mathbb R, f(x)=3x−2f(x)=3x-2. Given any real yy, set x=(y+2)/3x=(y+2)/3. This is real and f(x)=3(y+2)/3−2=yf(x)=3(y+2)/3-2=y. Therefore the function is onto. On domain [0,∞)[0,\infty) with the same codomain, it is not onto: its range starts at −2-2.

Avoid this mistake

Checking a few targets is evidence, not a proof for every target. Use a symbolic arbitrary yy.

22

Why One-to-One and Onto Matter

3 reference blocks

Read lesson ↗

Key method

If f:A→Bf:A\to B is bijective, then f−1:B→Af^{-1}:B\to A satisfies

f−1(f(x))=x,f^{-1}(f(x))=x, f(f−1(y))=y.f(f^{-1}(y))=y.

Surjectivity guarantees existence of the reverse assignment; injectivity guarantees uniqueness.

Example

The function f:[0,∞)→[0,∞)f:[0,\infty)\to[0,\infty), f(x)=x2f(x)=x^2, is bijective. Its inverse is x\sqrt x. 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: f−1(x)f^{-1}(x) usually differs from 1/f(x)1/f(x).

23

Finding the Inverse of a Function

3 reference blocks

Read lesson ↗

Key method

Write y=f(x)y=f(x), solve for xx in terms of yy, then rename the input of the inverse. Domain and range exchange roles. Verify by composition on the appropriate domains.

Example

For f(x)=3x−5f(x)=3x-5, solve y=3x−5y=3x-5 to get x=(y+5)/3x=(y+5)/3. Hence f−1(x)=(x+5)/3f^{-1}(x)=(x+5)/3. For g(x)=x2g(x)=x^2 on x≥0x\ge0, take the nonnegative branch: g−1(x)=xg^{-1}(x)=\sqrt x, also defined for x≥0x\ge0.

Avoid this mistake

Writing both ±x\pm\sqrt x does not define a single inverse function; the original domain decides which branch to use.

24

A Shortcut for the Inverse

3 reference blocks

Read lesson ↗

Key method

If f=g∘hf=g\circ h and both maps are bijective between their specified sets, then

f−1=h−1∘g−1.f^{-1}=h^{-1}\circ g^{-1}.

The last operation performed is the first operation undone.

Example

For f(x)=2(x−3)3+5f(x)=2(x-3)^3+5, first subtract 33, cube, multiply by 22, then add 55. Reverse these operations: subtract 55, divide by 22, take a cube root, add 33.

f−1(x)=3+(x−5)/23.f^{-1}(x)=3+\sqrt[3]{(x-5)/2}.

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.

25

A Function and Its Inverse on the Graph

3 reference blocks

Read lesson ↗

Key method

If (a,b)(a,b) lies on a bijective function's graph, (b,a)(b,a) 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 y=2xy=2^x passes through (0,1)(0,1) and (1,2)(1,2). Its inverse y=log⁡2xy=\log_2 x passes through (1,0)(1,0) and (2,1)(2,1). The exponential's horizontal asymptote y=0y=0 corresponds to the logarithm's vertical asymptote x=0x=0.

Avoid this mistake

A graph and its inverse need not meet on the displayed window. Reflection does not mean reflection across the vertical axis.

26

Increasing and Decreasing Intervals

3 reference blocks

Read lesson ↗

Key method

Strict increase means x1<x2⇒f(x1)<f(x2)x_1<x_2\Rightarrow f(x_1)<f(x_2) for every pair in the interval. Strict decrease reverses the output inequality. Later, derivative signs provide an efficient test.

Example

For f(x)=(x−1)2f(x)=(x-1)^2, the graph decreases toward its vertex on (−∞,1](-\infty,1] and increases away from it on [1,∞)[1,\infty). 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, x3x^3 increases through zero.

27

Local and Absolute Maxima and Minima

3 reference blocks

Read lesson ↗

Key method

An absolute minimum at aa satisfies f(a)≤f(x)f(a)\le f(x) for every allowed xx. A local minimum needs this only in a neighborhood of aa within the domain. Maximum reverses the inequality.

Example

For f(x)=(x−1)2f(x)=(x-1)^2 on [0,3][0,3], the absolute minimum is 00 at x=1x=1. Endpoint values are 11 and 44, so the absolute maximum is 44 at x=3x=3. On the open interval (0,3)(0,3), values approach 44 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.