Mathematical-Reasoning Β· Unit 23 Β· Video 1 Β· Interactive Practice

Following Two Arrows: How g(f(x)) Builds a Function

IKey Formulas

FormulaNameMeaning
f ⁣:Aβ†’Bf\colon A \to B and g ⁣:Bβ†’Cg\colon B \to C β‡’\Rightarrow x↦g(f(x))x \mapsto g(f(x)) is a function Aβ†’CA \to CFollowing two arrowsEach x∈Ax \in A gets exactly one value g(f(x))g(f(x)) in CC
x∈Aβ‡’f(x)∈Bβ‡’g(f(x))∈Cx \in A \Rightarrow f(x) \in B \Rightarrow g(f(x)) \in CThe hand-offEvery output of ff lies in BB, the set of inputs of gg
x→×33x→+23x+2→cube(3x+2)3x \xrightarrow{\times 3} 3x \xrightarrow{+2} 3x + 2 \xrightarrow{\text{cube}} (3x + 2)^3A formula as a chain of stepsThree simpler functions applied in turn
3x2+2β‰₯2>03x^2 + 2 \ge 2 > 0 for every x∈Rx \in \mathbb{R}A valid hand-offThe square root in 3x2+2\sqrt{3x^2 + 2} always receives a nonnegative input

Key Insight: A function must give every input exactly one output, but it need not reach every element of its codomain, so x↦g(f(x))x \mapsto g(f(x)) may send two inputs to one output and may leave elements of CC unreached. Building a function by applying one function to the outputs of another is called composition.

IIVisualization 1 β€” Following Two Arrows

For each x∈Ax \in A, f(x)f(x) lies in BB, so g(f(x))g(f(x)) is exactly one element of CC.

πŸ’‘ Challenge: redirect arrows so that x↦g(f(x))x \mapsto g(f(x)) reaches uu. No choice of ff and gg lets it reach all four elements of CC, because every value g(f(x))g(f(x)) is gg of one of the three elements of BB.

IIIVisualization 2 β€” A Formula as a Chain of Steps

Each step feeds its output to the next, and three different functions can share every step but the last.

IVVisualization 3 β€” Two Pieces, Then Combined

In k(x)=sin⁑(4x+3)x2+13k(x) = \sqrt[3]{\frac{\sin(4x + 3)}{x^2 + 1}}, a step may restart from xx or use two earlier results.

VQuiz Questions

Problem 1 Β· Follow the Arrows

Given: A={1,2,3,4}A = \{1, 2, 3, 4\}, B={p,q,r}B = \{p, q, r\}, C={s,t,u}C = \{s, t, u\}, the function f ⁣:Aβ†’Bf\colon A \to B with f(1)=qf(1) = q, f(2)=rf(2) = r, f(3)=pf(3) = p, f(4)=qf(4) = q, and the function g ⁣:Bβ†’Cg\colon B \to C with g(p)=ug(p) = u, g(q)=sg(q) = s, g(r)=sg(r) = s. Which list describes the function x↦g(f(x))x \mapsto g(f(x)) from AA to CC?

βœ… Correct! Each input follows one arrow of ff and then one arrow of gg. Three inputs share the output ss and tt is never reached, both of which a function allows.
❌ Not quite. This list is ff alone: its outputs are in BB, not CC. Follow the second arrow too, for example g(f(1))=g(q)=sg(f(1)) = g(q) = s.
❌ Not quite. f(2)=rf(2) = r and g(r)=sg(r) = s, so g(f(2))=sg(f(2)) = s. No arrow of gg lands on tt, and the new function does not have to reach every element of CC.
❌ Not quite. Trace each input separately: first find f(x)f(x) in BB, then apply gg to that element. Here f(2)=rf(2) = r, g(r)=sg(r) = s, and f(3)=pf(3) = p, g(p)=ug(p) = u.
Show solution

Follow the arrows two at a time:

g(f(1))=g(q)=s,g(f(2))=g(r)=s,g(f(1)) = g(q) = s, \qquad g(f(2)) = g(r) = s, g(f(3))=g(p)=u,g(f(4))=g(q)=s.g(f(3)) = g(p) = u, \qquad g(f(4)) = g(q) = s.

So x↦g(f(x))x \mapsto g(f(x)) sends 11, 22 and 44 to ss and sends 33 to uu. Each element of AA has exactly one output in CC, so this is a function from AA to CC, even though tt is never an output.

Problem 2 Β· Is Every Hand-Off Valid?

Given: each formula below is computed step by step from an input x∈Rx \in \mathbb{R}. Which one defines a function from R\mathbb{R} to R\mathbb{R}, so that every value handed to the next step lies where that step accepts it, for every real xx?

βœ… Correct! x2βˆ’2x+2=(xβˆ’1)2+1β‰₯1x^2 - 2x + 2 = (x - 1)^2 + 1 \ge 1, so the square root always receives a positive input.
❌ Not quite. At x=2x = 2 the value handed to the square root is 2βˆ’4=βˆ’22 - 4 = -2, which it does not accept.
❌ Not quite. x2βˆ’4x+4=(xβˆ’2)2x^2 - 4x + 4 = (x - 2)^2, which is 00 at x=2x = 2, so the division step fails there.
❌ Not quite. At x=0x = 0 the value handed to the square root is βˆ’1-1, which it does not accept.
Show solution

Check the value handed to the last step in each formula.

  • (a) 2βˆ’x2<02 - x^2 < 0 when ∣x∣>2|x| > \sqrt{2}; for example x=2x = 2 gives βˆ’2-2.
  • (b) x2βˆ’4x+4=(xβˆ’2)2=0x^2 - 4x + 4 = (x - 2)^2 = 0 at x=2x = 2, and division by 00 is undefined.
  • (c) Completing the square, x2βˆ’2x+2=(xβˆ’1)2+1β‰₯1>0x^2 - 2x + 2 = (x - 1)^2 + 1 \ge 1 > 0 for every real xx, so every hand-off is valid.
  • (d) x2βˆ’1<0x^2 - 1 < 0 when βˆ’1<x<1-1 < x < 1; for example x=0x = 0 gives βˆ’1-1.

Only (c) gives every real input exactly one real output, so only (c) defines a function Rβ†’R\mathbb{R} \to \mathbb{R}. The term βˆ’2x-2x looks dangerous, but it cannot make the value negative, just as 3x2+2β‰₯23x^2 + 2 \ge 2 protects 3x2+2\sqrt{3x^2 + 2}.

Problem 3 Β· From Steps to a Formula

Given: a function h ⁣:Rβ†’Rh\colon \mathbb{R} \to \mathbb{R} is computed by the steps below. Find the formula for h(x)h(x) and the value h(2)h(2).

StepVerbal Description
1Choose an input, xx.
2Add 1.
3Square the result.
4Go back to the original input and multiply it by 5.
5Subtract the result of step 4 from the result of step 3.
6Take the cube root of the result.

What is h(x)?

What is h(2)?

βœ… Correct! h(x)=(x+1)2βˆ’5x3h(x) = \sqrt[3]{(x + 1)^2 - 5x}, and h(2)=9βˆ’103=βˆ’13=βˆ’1h(2) = \sqrt[3]{9 - 10} = \sqrt[3]{-1} = -1.
❌ Not quite. Step 4 goes back to the original input xx, not to the result of step 3, so it produces 5x5x.
❌ Not quite. Step 3 squares the result of step 2, which is x+1x + 1, so it produces (x+1)2(x + 1)^2, not x2+1x^2 + 1.
❌ Not quite. Step 5 subtracts the result of step 4 from the result of step 3, so it produces (x+1)2βˆ’5x(x + 1)^2 - 5x.
❌ Not quite. βˆ’363\sqrt[3]{-36} comes from multiplying the result of step 3 by 55. Step 4 multiplies the original input, giving 5β‹…2=105 \cdot 2 = 10.
❌ Not quite. A cube root accepts every real number: (βˆ’1)3=βˆ’1(-1)^3 = -1, so βˆ’13=βˆ’1\sqrt[3]{-1} = -1.
❌ Not quite. That is 5β‹…2βˆ’93\sqrt[3]{5 \cdot 2 - 9}, the subtraction in the wrong order. Step 5 computes 9βˆ’10=βˆ’19 - 10 = -1.
Show solution

Track the symbolic result of each step:

  • Step 2: x+1x + 1. Step 3: (x+1)2(x + 1)^2.
  • Step 4 restarts from the input: 5x5x.
  • Step 5 uses two earlier results: (x+1)2βˆ’5x(x + 1)^2 - 5x.
  • Step 6: (x+1)2βˆ’5x3\sqrt[3]{(x + 1)^2 - 5x}.
h(x)=(x+1)2βˆ’5x3.h(x) = \sqrt[3]{(x + 1)^2 - 5x}.

At x=2x = 2: step 2 gives 33, step 3 gives 99, step 4 gives 1010, step 5 gives 9βˆ’10=βˆ’19 - 10 = -1, and step 6 gives βˆ’13=βˆ’1\sqrt[3]{-1} = -1, since (βˆ’1)3=βˆ’1(-1)^3 = -1.

h(2)=βˆ’1.h(2) = -1.

Every hand-off is valid for all real xx, because a cube root accepts negative inputs, so hh really is a function from R\mathbb{R} to R\mathbb{R}.

Problem 4 Β· When the Hand-Off Fails

Given: N={1,2,3,… }\mathbb{N} = \{1, 2, 3, \dots\}, the function f ⁣:{1,2,3}β†’Zf\colon \{1, 2, 3\} \to \mathbb{Z} with f(n)=nβˆ’2f(n) = n - 2, and the function g ⁣:Nβ†’Ng\colon \mathbb{N} \to \mathbb{N} with g(m)=2mg(m) = 2m. Does n↦g(f(n))n \mapsto g(f(n)) define a function from {1,2,3}\{1, 2, 3\} to N\mathbb{N}?

βœ… Correct! The chain needs every output of ff to be an input that gg accepts. Here f(1)=βˆ’1f(1) = -1 and f(2)=0f(2) = 0 lie outside N\mathbb{N}, the domain of gg.
❌ Not quite. The formula 2m2m can be evaluated at βˆ’1-1 and 00, but gg is defined only on N\mathbb{N}, so g(βˆ’1)g(-1) and g(0)g(0) do not exist. The values βˆ’2-2 and 00 are not in N\mathbb{N} either.
❌ Not quite. Two functions chain only when the outputs of the first lie in the set of inputs of the second. The outputs βˆ’1-1 and 00 of ff are not in N\mathbb{N}.
❌ Not quite. A function does not have to reach every element of its codomain, so missing the odd numbers is allowed. The real failure is the hand-off from ff to gg.
Show solution

Compute the outputs of ff: f(1)=βˆ’1f(1) = -1, f(2)=0f(2) = 0, f(3)=1f(3) = 1.

The function gg accepts only inputs in N={1,2,3,… }\mathbb{N} = \{1, 2, 3, \dots\}. Since βˆ’1βˆ‰N-1 \notin \mathbb{N} and 0βˆ‰N0 \notin \mathbb{N}, the values g(f(1))g(f(1)) and g(f(2))g(f(2)) are not defined. Only g(f(3))=g(1)=2g(f(3)) = g(1) = 2 exists.

A function from {1,2,3}\{1, 2, 3\} to N\mathbb{N} must give every input an output, so n↦g(f(n))n \mapsto g(f(n)) is not such a function. The construction works when f ⁣:Aβ†’Bf\colon A \to B and g ⁣:Bβ†’Cg\colon B \to C, that is, when every output of ff lies where gg accepts it.

Solved: 0 / 4