Tests edge cases, boundary conditions, and common misconceptions for functions.
UT-1: Domain Restrictions in Composite Functions
Question:
Given f(x)=2x−1 and g(x)=x−31:
(a) Find the domain of f∘gI.e. f(g(x)).
(b) Find the domain of g∘fI.e. g(f(x)).
(c) Explain why the domains of f∘g and g∘f are different, identifying the
specific restriction that causes the difference.
[Difficulty: hard. Tests the common error of taking the domain of a composite function as the
intersection of individual domains, rather than considering the range of the inner function.]
(c) The domains differ because of the direction of composition:
For f∘g: the input to f is g(x)=x−31And we need g(x)≥1/2 (since f
requires 2⋅g(x)−1≥0I.e. g(x)≥1/2). This constrains x to a finite interval
(3,5].
For g∘f: the input to g is f(x)=2x−1And we need f(x)=3. Since
f(x)≥0 for all x in its domain, we only exclude x=5. The domain is almost the entire
domain of f.
The key difference is that f∘g requires the output of g to fall within the domain of f
(which is [1/2,∞)), while g∘f requires the output of f to avoid the single
excluded value of g (which is 3). The former is much more restrictive because g(x)=1/(x−3)
only achieves values ≥1/2 on a finite interval.
UT-2: Inverse Function Existence and Domain Restriction
Question:
The function f(x)=x2+4x is defined on the domain x≤−2.
(a) Explain why f has an inverse on this domain.
(b) Find f−1(x)Stating its domain and range.
(c) If the domain were instead x≥0Find the range of f−1 in this case.
[Difficulty: hard. Tests understanding that a function must be one-to-one to have an inverse, and
how domain restriction affects the inverse.]
Solution:
(a) To show f is one-to-one on x≤−2We show it is strictly monotonic (strictly
decreasing) on this domain.
f′(x)=2x+4
For x≤−2: 2x+4≤0With equality only at x=−2.
For x<−2: f′(x)<0So f is strictly decreasing on (−∞,−2].
Since f is strictly decreasing, it is one-to-one, and therefore has an inverse.
(b) Let y=x2+4x. Completing the square: y=(x+2)2−4.
Solving for x: (x+2)2=y+4So x+2=±y+4.
Since x≤−2We have x+2≤0So we take the negative root:
x=−2−y+4
Therefore f−1(x)=−2−x+4.
Domain of f−1: We need x+4≥0So x≥−4. Also, the range of f on x≤−2:
since f is decreasing, as x→−∞, f(x)→+∞And f(−2)=0. So the range of f is
[0,∞).
Wait: completing the square gives f(x)=(x+2)2−4. At x=−2: f(−2)=−4. As
x→−∞: f(x)→+∞. Since f is decreasing on (−∞,−2]The range is
[−4,∞).
Therefore domain of f−1 is [−4,∞)Confirming x+4≥0.
Range of f−1 equals domain of f: (−∞,−2].
(c) If the domain were x≥0: f′(x)=2x+4>0 for all x≥0So f is strictly
increasing.
Range of f: f(0)=0 and f(x)→+∞ as x→+∞. So range is [0,∞).
The inverse would be f−1(x)=−2+x+4 (taking the positive root since
x+2≥2>0).
Range of f−1 equals domain of f: [0,∞).
UT-3: Three-Layer Composite Function
Question:
Let f(x)=x+12, g(x)=x2−1And h(x)=x.
(a) Find f∘g∘h in its simplest form, stating its domain.
(b) Solve the equation (f∘g∘h)(x)=1.
(c) Show that (f∘g∘h)(x)=(g∘f∘h)(x) and explain algebraically why
this identity holds.
[Difficulty: hard. Tests multi-layer composition with domain tracking and algebraic identity
verification.]
Solution:
(a) Working from the inside out:
h(x)=x (domain: x≥0)
g(h(x))=(x)2−1=x−1 (domain: x≥0Since we need h(x) defined first)
f(g(h(x)))=f(x−1)=(x−1)+12=x2 (domain:
x−1=−1⟹x=0Combined with x≥0)
(f∘g∘h)(x)=x2,domain: x>0
(b)x2=1⟹x=2.
Check: x=2>0So it is in the domain. Also verify through each layer:
These are not equal. The claim in part (c) is false. The identity
(f∘g∘h)(x)=(g∘f∘h)(x) does not hold . Function composition is not
commutative.
Let me re-examine: (f∘g∘h)(x)=f(g(h(x))) versus
(g∘f∘h)(x)=g(f(h(x))). The inner function h is the same, but f and g are
applied in different orders. Since f and g do not commute, the results differ.
Integration Tests
Tests synthesis of functions with other topics. Requires combining concepts from multiple units.
IT-1: Exponential Function Composition with Logarithmic Inequality (with Exponentials and Logarithms)
Question:
The function f is defined by f(x)=e2x+e−2x for x∈R.
(a) Show that f(x)≥2 for all x∈RAnd find the value of x for which
equality holds.
(b) The function g is defined by g(x)=ln(x+x2+1) for x∈R. Find
f(g(x)) in terms of x and simplify your answer.
Since 32≈4.24>1This is impossible. Therefore sinC=0Giving C=0 or
C=π. Since C=0 gives a degenerate triangle, C=π.
But C=π also gives a degenerate triangle (collinear points). This suggests the original
problem parameters may need adjustment. In a valid triangle, 0<C<π and the area formula
6sinC=sinC(sin(C/2)+cos(C/2)) requires sin(C/2)+cos(C/2)=6Which has no solution
since sin(C/2)+cos(C/2)≤2.
The problem as stated has no solution for a non-degenerate triangle. This itself is a useful
diagnostic insight: recognising when a problem has no valid solution is an important skill.
IT-3: Function Iteration Producing a Sequence (with Sequences)
Question:
The function f is defined by f(x)=21(x+x3) for x>0.
A sequence (an) is defined by a1=1 and an+1=f(an) for n≥1.
(a) Find a2, a3And a4 as exact fractions.
(b) Prove by induction that an>0 for all n≥1.
(c) Prove that if an>3 then an+1<anAnd if an<3 then
an+1>an.
(d) State the limit of the sequence (an) as n→∞ and justify your answer.
[Difficulty: hard. Combines function iteration, proof by induction, and convergence analysis.]
Inductive step: Assume ak>0 for some k≥1. Then ak+1=21(ak+3/ak).
Since ak>0Both ak and 3/ak are positive, so their sum is positive, and ak+1>0.
Since an>0 (by part (b)), the sign of an+1−an is determined by 3−an2:
If an>3: an2>3So 3−an2<0Giving an+1−an<0I.e. an+1<an.
If an<3: an2<3So 3−an2>0Giving an+1−an>0I.e. an+1>an.
(d) The limit L must satisfy L=f(L)=21(L+3/L):
2L=L+L3L=L3L2=3L=3
(We take the positive root since an>0 for all n.)
Justification: By part (c), if an>3 then the sequence decreases, and if
an<3 then the sequence increases. Since a2=2>3≈1.732The sequence
decreases from n=2 onwards. The sequence is bounded below by 3 (since terms above
3 decrease towards it, and terms below 3 increase towards it). By the monotone
convergence theorem, the sequence converges, and the only possible limit is 3.
This function is the Babylonian method (Newton’s method) for computing 3.