Chapter 2 — Functions
2.11 — Closing: Review Problems
The problems below do not repeat the examples solved in the chapter: each one requires, at some point, a decision the reader must make alone, whether which technique to apply, in what order, or why a tool is not enough. They are organized in the three levels of the competency checklist of §2.10. The reference in brackets indicates the section where the necessary tools are found; several problems require combining more than one.
We use the chapter’s notation: is the domain of , its image and its graph. When a function is given only by its formula, its domain is the implicit one and its codomain is , following the convention of §2.2.
Level 1 — Mechanical and technical
Section titled “Level 1 — Mechanical and technical”1. [§2.2] Determine the implicit domain of .
2. [§2.1, §2.3] Let , with explicit domain . Using that is increasing, find .
3. [§2.3] Determine whether is even, odd, or neither.
4. [§2.4] Without recomputing from scratch, state the domain, image and monotonicity of , relying on the catalog.
5. [§2.5] Describe in words the transformation that takes to , identifying , , and .
6. [§2.6] Given and , find , and the domain of each.
7. [§2.6] With the same and as in the previous problem, find and its domain.
8. [§2.7] Determine whether , with domain , is injective, and if so find .
9. [§2.8] Find the vertex of and classify it as an absolute maximum or minimum.
Level 2 — Integration and proof
Section titled “Level 2 — Integration and proof”1. [§2.2, §2.6] Let . Compute directly, and check the result by writing as a quotient of two known functions and applying the rule of §2.6 for the domain of a quotient.
2. [§2.3] Prove, with the definition of monotonicity and without appealing to the graph, that is decreasing on .
3. [§2.3, §2.5] Let and let . Check, by computing , that , and therefore . Explain which result of §2.5 guarantees this in advance.
4. [§2.6] Let and . Compute and explain, with the definition of composition of §2.6, why considering alone is not enough.
5. [§2.7] Prove that is injective on its domain, find its image, find and verify the identity .
6. [§2.8] Among all pairs of positive reals whose product is , find the pair that minimizes the sum, using the AM-GM inequality. Check the result by evaluating the sum for at least two different pairs that satisfy the constraint.
7. [§2.1, §2.3] Let . Determine whether is a function from to . If it is not, propose a subset of that is a function from to , and find its image.
Level 3 — Challenge, application and frontier
Section titled “Level 3 — Challenge, application and frontier”1. [§2.4] Formalize and prove, with the same and scheme of §2.4, that grows without bound as .
2. [§2.8] The function is, according to the frontier note of §2.8, a case that none of the tools of that section fully settles. By evaluating on a grid of points of , determine as precisely as possible on which subintervals it appears to increase and on which it appears to decrease. Discuss why this method, though informative, cannot guarantee the exact location of any relative extremum.
3. [§2.6, §2.7] Let and be bijective functions. Prove that is bijective and that .
4. [§1.6, §2.8] A farmer has meters of wire to fence a rectangular pen, using a straight wall as one of the four sides, so that the wire covers only the other three. Set up the area as a function of a single side, following the problem-solving method of §1.6; find the dimensions that maximize the area with the tools of §2.8, and check the result in the context of the problem.
5. [§2.1, §2.2] An equivalence relation on a set is a relation between elements of that is reflexive ( for every ), symmetric (if , then ) and transitive (if and , then ). Prove that the equality of functions defined in §2.2, according to which and are equal when , and for every , is an equivalence relation on any set of functions.
Answer key
Section titled “Answer key”The answers for levels 1 and 2 are given in full when the result is a value or a closed expression; when the problem asks for a proof, the central step is indicated. The answers for level 3 are hints rather than solutions, so as not to empty each problem of its challenge.
Level 1
- We need and , that is, and : .
- Since is increasing, for ; and every is attained at . Hence .
- Even: for every .
- , ; decreasing on and increasing on .
- , , , : vertical stretch by a factor of with reflection across the -axis, shift units to the left and unit down.
- and , both with domain .
- , with domain .
- Injective, since it is increasing on ; its image is and , with domain .
- Vertex at , with ; absolute maximum, since .
Level 2
- . With and , the rule gives minus the zeros of : .
- For : , because numerator and denominator are positive; hence .
- , with the same domain . Section 2.5 shows that is the reflection of across the -axis, and an even function coincides with its reflection.
- , and , strictly contained in : the definition also requires .
- If , cross-multiplying gives , which reduces to . Solving gives , possible if and only if ; hence and, as a function from to , .
- By AM-GM, , with equality if and only if . For example, and .
- No: and are in , and uniqueness fails. The subset is a function, with image ; so is , with image .
Level 3 — hints
- Given , choose : if , then .
- At we get . The values suggest growth up to near , decrease up to near and growth afterwards. A finite number of evaluations says nothing about what happens between two grid points: it only bounds where the extremum can be.
- Injectivity: if , the injectivity of gives , and that of gives . Surjectivity: given , there is with and there is with . For the inverse, use the associativity of §2.6 and check that and ; the characterization of §2.7 concludes.
- With the side perpendicular to the wall, the parallel side is and the area is , with . The vertex is at : the parallel side measures m and the maximum area is m². Both sides are positive and exactly m of wire are used.
- Reflexivity and symmetry follow directly from the properties of equality of sets and of numbers. For transitivity, if and , chain the equalities of domains, those of codomains and, for each of the common domain, .
With these problems solved, or at least seriously attempted, including those of level 3 that do not always yield on the first try, the reader is ready to take the chapter exam, which assesses, under time pressure, a sample of these same three levels.
Copyright © 2026 Carlos Dagorret — Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)