Functions: Chapter Review
A rapid review before the test: the chapter's vocabulary and notation, every formula with the conditions to use it, the standard problem types step by step, and the traps that cost points.
Vocabulary and notation
- Function
- A rule that assigns to each input exactly one output, so one input can never yield two different results.
- Function notation
- names the rule, records the input, and the whole symbol is the output: says the input gave the output .
- Domain
- The set of inputs a function is allowed to take.
- Range
- The set of outputs it actually produces: what comes out, where the domain is what may go in.
- Composition
- Feeding one function's output straight into another, read " after ". The ring is neither multiplication nor the letter o.
- Inner and outer function
- In , is inner and runs first on the raw input; is outer and runs last, so it decides what kind of answer comes out.
- Inverse function
- The function that reverses , sending each output back to the input it came from. It swaps every pair: becomes .
- One-to-one function
- A function whose different inputs always give different outputs, so no two inputs share an output.
- Binary operation
- A rule taking two inputs to one output: ordinary , or an invented symbol such as , , or given a defining formula.
- Commutative operation
- One with for every and , so the two inputs may trade places freely.
- Associative operation
- One where the grouping never matters: always.
Formulas and theorems
-
Vertical line test
A graph represents a function exactly when no vertical line crosses it more than once.
Text description
The curve x equals y squared, with a dashed vertical line at x equals 4 crossing it twice, at the outputs 2 and negative 2.
Use when Input on the horizontal axis. A line that misses the graph is fine, since an input outside the domain has no point above it.
e.g. fails: at both and appear.
-
Arithmetic combinations of two functions
Use when Defined wherever both and are. The quotient also needs , even where is happy.
-
Composition
Text description
A chain: x enters the inner function g first, and the output g of x then enters the outer function f, giving f of g of x.
Use when The inner function runs first on the raw input; runs second on its output, so is read right to left, not left to right.
e.g. , : .
-
Composition is not commutative
In general and are different functions.
Use when "In general" is exact: particular pairs can agree, as a function and its inverse do. Never assume the swap is free.
e.g. , : but .
-
Domain of a composition
An input is in the domain of exactly when it is allowed into AND the output is allowed into .
Use when Both tests, always. The second can bar an input the inner function accepts, so the domain is neither function's by itself.
-
Defining property of an inverse
Text description
Two ovals: an arrow labelled f carries x across to f of x, and a return arrow labelled f inverse carries it back to x.
Use when The first holds on the domain of , the second on the domain of . The raised names the inverse under composition, never a reciprocal.
-
Domain and range trade places
The domain of is the range of , and its range is the domain of .
Use when Whenever exists. It follows from swapping every pair, so the forbidden inputs swap as well.
e.g. bans ; bans .
-
One-to-one, and the horizontal line test
A function has an inverse function exactly when it is one-to-one, which on a graph means no horizontal line crosses it more than once.
Use when Algebraically, set and check that follows. A rule that fails can often be repaired by shrinking the domain to a one-to-one piece, and that restriction travels with the inverse.
e.g. fails ( and both give ); on its inverse is .
-
Evaluating a defined operation
Substitute the first input for every and the second for every in the defining rule, then simplify.
Use when The symbol carries no meaning of its own; only the rule does.
e.g. With : .
-
Identity element of an operation
Use when One fixed number must satisfy both, for EVERY . Both sides, since the operation need not be commutative; some operations have no identity.
e.g. has identity ; has none.
Problem types, step by step
Evaluate a function
- Replace every in the rule with the given input, wrapped in parentheses so signs survive.
- Simplify, squaring and multiplying before adding, and record the pair as .
e.g. : .
Decide whether a relationship is a function
- From pairs or a table, look for one input listed twice with different outputs.
- From a graph, apply the vertical line test.
- From an equation, pick an input, solve for the output, and see whether two values come back.
e.g. fails: the input has both and .
Find a domain and a range
- Set every denominator equal to zero and exclude the inputs you find.
- Require anything under a square root to be ; through this chapter those two are the only exclusions, so otherwise the domain is all numbers.
- For the range, ask what the rule can actually reach: a square is never negative.
e.g. has domain all numbers except ; has range all numbers .
Combine two functions by arithmetic
- Substitute both rules and simplify, bracketing the second rule before a subtraction.
- For a quotient, solve and exclude every solution.
e.g. , : .
Compose two functions
- Read the nesting: the inner function is the one whose parentheses hold the input.
- At a number, evaluate the inner function first, then run the outer on that output.
- For a formula, drop the ENTIRE inner rule into the outer wherever it expects its input.
- Expand and simplify, keeping the middle term of any squared binomial.
e.g. , : .
Find the domain of a composition
- Exclude every input the inner function rejects.
- Set the inner rule equal to each value the outer function rejects, and exclude those solutions too.
- Report what survived both, not what the simplified formula seems to allow.
e.g. , : , so exclude .
Model a two-step process as a composition
- Name each step as its own function and decide which acts on the raw input first.
- Write the model with the second step on the outside, so the first step sits inside its parentheses.
- Substitute, simplify, and evaluate at the value asked for.
e.g. A discount then a fee : .
Find the inverse of a function
- Write .
- Swap and ; a domain restriction described the input, so it moves to .
- Solve for , using that restriction where a square root offers two values.
- Rename it and confirm both compositions collapse to .
e.g. : from , .
Verify that two functions are inverses
- Build by substituting the whole rule for into , and simplify.
- Build the same way.
- Both must reduce to ; if either does not, the pair are not inverses.
Test a defined operation for commutativity or associativity
- For commutativity, compute and on one concrete pair; different values settle it, one counterexample being enough.
- Equal values settle nothing, so argue from the rule: one that treats its two slots identically is commutative always.
- For associativity, compare with , each worked from the inside out; one unequal triple disproves it, while equal values again settle nothing.
e.g. : but .
Find an identity element, or show there is none
- Write with the defining rule substituted in, and solve for .
- If the value of depends on , no single number works and the operation has no identity.
- If is one fixed number, confirm as well before claiming it.
Solve an equation containing a defined operation
- Substitute the definition, placing the unknown in whichever slot it occupies.
- Solve the ordinary equation that remains, keeping both roots when a square gave two.
- Check by running the original operation on your answer.
e.g. with : , so or .
Exam traps
-
Trap Reading as a reciprocal: for , calling the value .
Fix The raised names the inverse under composition, never . Here , so , the input that sends to .
-
Trap Reading as " times ": for , writing .
Fix The parentheses are an instruction to apply the rule, not a multiplication sign. Substitute instead: .
-
Trap Substituting only the variable: for and , writing .
Fix The entire inner rule goes in: . The answer is really , the other order.
-
Trap Answering "which input gives an output of ?" by computing .
Fix evaluates AT the input ; finding the input that yields means solving . For that is , not .
-
Trap Calling not a function because the output repeats, or rejecting because a horizontal line meets its graph twice.
Fix Repeated outputs are legal; only one input with two outputs is banned. Vertical crossings decide whether a graph is a function, horizontal crossings only whether it is one-to-one.
-
Trap Reading the domain of off the simplified formula: with and , looks defined everywhere.
Fix The inner function must accept the input first. Since rejects every negative, the domain is , though the simplified rule shows no trace of the root.
-
Trap Declaring two functions inverses after checking one direction only.
Fix One direction can hold while the other fails. For on all numbers and : , but , not .
-
Trap Letting the invented symbol override the order of operations: reading with as .
Fix Substitution changes nothing about how the expression is read. Only is doubled: .
-
Trap Substituting only part of an expression input: with , writing .
Fix The whole expression drops into the slot as one block: . The middle term is exactly what dropping the parentheses loses.