Functions, inverse branches and composition
Introduced| English | Meaning |
|---|---|
| injective/ɪnˈdʒektɪv/ | A map in which equal outputs force equal inputs within the stated domain. |
| surjective/sɜːˈdʒektɪv/ | A map whose image is its entire stated codomain. |
| involution/ɪnvəˈluːʃn/ | A self-map whose composition with itself is the identity. |
One output can have two possible inputs
- The formula $f(x)=(x-2)^2-5$ sends both $-1$ and $5$ to $4$. Asking for an inverse-function value at $4$ requires a domain on which only one of those inputs is allowed.
- We will distinguish injective 单射 and surjective 满射 maps, choose inverse branches, and trace involutions 对合 and longer composition cycles. A formula, its domain and its codomain together determine the function.
The codomain is not automatically the image
- A map $f:A\to B$ assigns each input in $A$ exactly one output in $B$. Its image $f(A)$ is the set of outputs actually reached, which may be smaller than the stated codomain $B$. Before classifying a map, check that every allowed input really produces an output in $B$.
- The formula $x^2$ does not define a map from all real numbers to $[-1,1]$, because $2$ would be sent to $4$ outside the proposed codomain. This is a failure to define the stated map, not merely a failure of surjectivity.
Injectivity rules out collisions
- A map is injective if $f(a)=f(b)$ forces $a=b$ for inputs in its domain. One unequal pair with the same output disproves it. Squaring on all of $\mathbb R$ fails because $1$ and $-1$ collide; restricting the domain to $[0,\infty)$ removes these collisions.
- The cube map on $\mathbb R$ and the exponential map on $\mathbb R$ are injective because they are strictly increasing. The sine map on $\mathbb R$ is not: $0$ and $\pi$ both map to zero. Injectivity compares inputs; changing only the codomain cannot remove a collision.
Surjectivity depends on the target set
- Surjectivity means every element of the codomain is reached. Squaring from $\mathbb R$ to $[0,\infty)$ is surjective but not injective. From $[0,\infty)$ to $\mathbb R$ it is injective but not surjective. From $[0,\infty)$ to $[0,\infty)$ it is both, hence bijective; from $\mathbb R$ to $\mathbb R$ it is neither.
- The cube map $\mathbb R\to\mathbb R$ is bijective: every $y$ has exactly one real cube root. The exponential map $\mathbb R\to\mathbb R$ misses all $y\le0$, so it is injective only. The map $n\mapsto2n$ on $\mathbb Z$ also is injective only, since odd integers are missed. Sine onto $[-1,1]$ is surjective only.
What kind of map?
Test injectivity and surjectivity against the stated sets.
Which map is a bijection?
Difficulty 1/5 · 100 coins + a small bonus on first completion today
e^x misses negatives; x² fails injectivity or surjectivity.
How is $x\mapsto x^2$ classified as a map $\mathbb R\to\mathbb R$?
Difficulty 1/5 · 100 coins + a small bonus on first completion today
Inputs 1 and -1 collide, so it is not injective. Negative codomain values are missed, so it is not surjective.
A two-sided inverse checks both sets
- A bijection $f:A\to B$ has an inverse function $h:B\to A$ satisfying $h(f(x))=x$ for every $x\in A$ and $f(h(y))=y$ for every $y\in B$. The inverse's domain is $B=f(A)$ and its image is $A$. Both identities include their domain restrictions.
- One composition alone is insufficient. For squaring $f:\mathbb R\to[0,\infty)$ and $h(y)=\sqrt y$, $f(h(y))=y$ holds on the codomain, but $h(f(x))=|x|$ fails to equal negative $x$. The inverse image of a set is different notation: even without an inverse function, the preimage of $\{4\}$ under squaring is $\{-2,2\}$.
If $f:A\to B$ and $h:B\to A$ satisfy $f\circ h=\mathrm{id}_B$, then $f$ must be bijective.
Difficulty 1/5 · 100 coins + a small bonus on first completion today
Squaring from ℝ to [0,∞) and h(y)=√y satisfy this identity. But squaring is not injective, and the reverse composition is |x|, not x on all ℝ.
The right quadratic branch chooses the plus sign
- Restrict $f(x)=(x-2)^2-5$ to $[2,\infty)$ with codomain $[-5,\infty)$. Solving $y=f(x)$ gives $x=2\pm\sqrt{y+5}$, and the original domain selects $h(y)=2+\sqrt{y+5}$. Thus $h(4)=5$.
- For $y\ge-5$, $f(h(y))=y$. For $x\ge2$, $h(f(x))=2+|x-2|=x$. The absolute value is essential before applying the domain restriction. The original diagram reflects the permitted branch and its inverse across $y=x$.
The left branch answers the same output differently
- On $(-\infty,2]$ with the same codomain $[-5,\infty)$, the inverse instead is $k(y)=2-\sqrt{y+5}$. Now $k(4)=-1$. For $x\le2$, $k(f(x))=2-|x-2|=x$; the other composition also gives $f(k(y))=y$.
- On the unrestricted real domain, the preimage of $\{4\}$ is the two-element set $\{-1,5\}$, so no inverse function exists for this quadratic on all of $\mathbb R$. Also, an inverse is not a reciprocal: on the right branch $f^{-1}(4)=5$, whereas $1/f(4)=-1$.
For a bijective function $f$, the graph of $f^{-1}$ is the reflection of its graph in the line $y=x$.
Difficulty 1/5 · 100 coins + a small bonus on first completion today
True. Each point $(a, b)$ on $f$ becomes $(b, a)$ on $f^{-1}$. Replacing $y$ by $1/y$ gives the reciprocal, a different function.
For $f(x)=(x-2)^2-5$ restricted to $x\le2$, find $f^{-1}(4)$.
Difficulty 2/5 · 140 coins + a small bonus on first completion today
The allowed branch is 2 - √(y+5). At y=4 this gives -1; the other root 5 is not in the original domain.
Complete the square in the original exercise
- For $q(x)=x^2+4x=(x+2)^2-4$ on $[-2,\infty)$, the image is $[-4,\infty)$. The inverse on that image is $q^{-1}(y)=-2+\sqrt{y+4}$. Therefore $q^{-1}(5)=1$; the other algebraic root $-5$ lies outside the original domain.
- Writing this inverse as $h$, check both ways: $q(h(y))=y$ for $y\ge-4$, and $h(q(x))=-2+|x+2|=x$ for $x\ge-2$. Swapping coordinates proves reflection of the graph; taking reciprocal output values produces a different graph.
$f(x) = x^2 + 4x$ on $x \ge -2$. Find $f^{-1}(5)$.
Difficulty 2/5 · 140 coins + a small bonus on first completion today
$x^2 + 4x - 5 = 0$ gives 1 or −5; only 1 is allowed.
Let $q(x)=x^2+4x$ on $(-\infty,-2]$, with codomain $[-4,\infty)$. Find its inverse, verify both compositions and evaluate the inverse at 5. Explain why the answer differs from the right-branch exercise.
Compare your argument with the model and checklist.
Composition order and intermediate domains matter
- The composition $(a\circ b)(x)$ means $a(b(x))$: apply $b$ first. With $a(x)=x+1$ and $b(x)=x^2$, $a\circ b=x^2+1$, while $b\circ a=(x+1)^2$. At $x=2$, the outputs are $5$ and $9$, so composition need not commute.
- The domain requires both $x\in\operatorname{dom}b$ and $b(x)\in\operatorname{dom}a$. For $a(x)=\sqrt x$ and $b(x)=x-1$, $a\circ b=\sqrt{x-1}$ needs $x\ge1$; $b\circ a=\sqrt x-1$ needs only $x\ge0$. Check the intermediate value before simplifying.
Let $a(x)=x+1$ and $b(x)=x^2$. Evaluate $(a\circ b)(2)$.
Difficulty 2/5 · 140 coins + a small bonus on first completion today
Apply b first: b(2)=4, then a(4)=5. The opposite composition gives 9.
A bijective composition need not have bijective factors
- For $f:A\to B$ and $g:B\to C$, if $g\circ f$ is injective, then $f$ is injective: equal $f$ outputs would give equal composite outputs. If $g\circ f$ is surjective, then $g$ is surjective, because every element of $C$ is reached through some $f(x)$. If both factors are injective, their composition is injective; the analogous statement holds for surjections.
- The other factor need not have the same property. Let $f:[0,\infty)\to\mathbb R$ be inclusion, and $g:\mathbb R\to[0,\infty)$ be squaring. Their composition is a bijection on $[0,\infty)$, although $f$ misses negative reals and $g$ has collisions on its full domain. The middle set cannot be ignored.
Let $f:[0,\infty)\to\mathbb R$ be $f(x)=x$, and $g:\mathbb R\to[0,\infty)$ be $g(x)=x^2$. Show that $g\circ f$ is bijective although neither factor is bijective. State which factor must be injective and which must be surjective whenever a composition is bijective.
Compare your argument with the model and checklist.
An involution is a self-map that undoes itself
- An involution is a map $f:A\to A$ with $f(f(x))=x$ for all $x\in A$. It is bijective: applying $f$ to a collision recovers equal inputs, and every $y\in A$ is the image of $f(y)$. Thus $f$ is its own inverse, with the same domain and codomain.
- Examples are $f(x)=-x$ and $f(x)=c-x$ on $\mathbb R$, and $f(x)=1/x$ on $\mathbb R\setminus\{0\}$. The reciprocal example cannot include zero. An involution's iterates alternate between the identity and $f$; fixed points may have a shorter orbit of length one.
A self-map $f:A\to A$ with $f(f(x))=x$ for all $x\in A$ is called an ____.
Difficulty 1/5 · 100 coins + a small bonus on first completion today
It is its own inverse.
An increasing involution on an interval is the identity
- Suppose $f:I\to I$ is strictly increasing and $f(f(x))=x$. If $f(x)>x$, applying the increasing function gives $f(f(x))>f(x)$, hence $x>f(x)$, a contradiction. If $f(x)<x$, applying $f$ gives the reverse contradiction. Therefore $f(x)=x$ everywhere on $I$.
- Strict increase matters: decreasing involutions can move points. For $f(x)=c-x$, the fixed point is $c/2$ and other points come in exchanged pairs. The condition $f:I\to I$ ensures the second application is defined; an arbitrary formula on an arbitrary restricted interval may fail that requirement.
A strictly increasing self-map of an interval satisfying $f\circ f=\mathrm{id}$ must be the identity.
Difficulty 1/5 · 100 coins + a small bonus on first completion today
If f(x)>x, monotonicity gives f(f(x))>f(x), contradicting f(f(x))=x. The case f(x)<x gives the reverse contradiction.
Suppose $f:I\to I$ is strictly increasing on a real interval and $f^3(x)=x$ for every $x\in I$. Prove that $f$ is the identity. Does your proof require continuity?
Compare your argument with the model and checklist.
Iterates count applications, not powers of values
- In this lesson $f^n$ denotes the $n$-fold iterate, also written $f^{\circ n}$. Define $f^0$ as the identity and $f^{n+1}=f\circ f^n$. For $f(x)=x+1$, $f^3(x)=x+3$, whereas $(f(x))^3=(x+1)^3$. State the convention because superscript notation can have other meanings elsewhere.
- On a self-map $f:A\to A$, every nonnegative iterate is defined for every input in $A$. With a partially defined formula, follow the intermediate inputs instead. If an iterate enters an excluded input, later iterates stop; an algebraic cancellation cannot restart them.
Derive the three-step map with its true domain
- For $g(x)=1/(1-x)$ on its maximal real domain, the first application excludes $1$. The second also excludes $0$, since $g(0)=1$. Where it is defined, $g^2(x)=(x-1)/x$; its simplified formula does not restore $x=1$, which was already forbidden at the first step.
- The third application gives $g^3(x)=x$ on $D=\mathbb R\setminus\{0,1\}$. No further inputs are lost: $g^2(x)=1$ has no solution there, and $g$ maps $D$ into itself because it takes neither value $0$ nor $1$ on $D$. Thus every iterate exists on $D$, but $g^3(0)$ is still undefined.
For $g(x)=1/(1-x)$ on its maximal real domain, what happens starting from zero?
Difficulty 1/5 · 100 coins + a small bonus on first completion today
The first value is g(0)=1, which is excluded as the next input. Thus g²(0) and all later iterates are undefined; simplification of g³ cannot restore zero.
Use the orbit only after checking it stays defined
- The orbit $3\to-1/2\to2/3\to3$ stays in $D$. Hence $g^8(3)=g^2(3)=2/3$. For the original exercise, $2\to-1\to1/2\to2$, so $g^{10}(2)=g(2)=-1$. Reduce the application count modulo three only on the valid invariant domain.
- Since $g^3$ is the identity on $D$, every orbit length divides three. In fact each length is exactly three: a fixed point would require $x^2-x+1=0$, but this is $(x-1/2)^2+3/4>0$. By contrast, starting from $0$ gives $0\to1$, then the next application is undefined; the identity formula for the third iterate cannot be used there.
Which function conclusions follow?
Check inverse identities and composition domains.
$g(x) = \frac{1}{1-x}$. Find $g^{10}(2)$, the tenth iterate.
Difficulty 2/5 · 140 coins + a small bonus on first completion today
Period 3, 10 ≡ 1: $g(2) = -1$.
For $g(x)=1/(1-x)$, find $g^8(3)$. Give a decimal to three places.
Difficulty 2/5 · 140 coins + a small bonus on first completion today
The valid cycle is 3 → -1/2 → 2/3 → 3. Since 8 has remainder 2 on division by 3, the result is 2/3 ≈ 0.667.
Let $h(x)=2+1/(3-x)$. Find the largest real domain on which every iterate is defined, compute $h^{11}(4)$, and explain what happens if the starting input is 2.
Compare your argument with the model and checklist.
Recap
- injective: A map in which equal outputs force equal inputs within the stated domain.
- surjective: A map whose image is its entire stated codomain.
- involution: A self-map whose composition with itself is the identity.
- State domain and codomain, verify both inverse identities, apply compositions in the correct order, and preserve every excluded intermediate input during iteration.