Operations on functions

This chapter explores fundamental operations on functions, including composition and iteration, which are essential for manipulating and understanding functional relationships. A thorough grasp of these operations, alongside the conditions for and computation of inverse functions, is crucial for solving advanced problems in algebra and is frequently assessed in CMI examinations.

---

Chapter Contents

| Topic |

|---|-------| | 1 | Composition of functions | | 2 | Function iteration | | 3 | Existence of inverse | | 4 | Inverse of a function |

---

We begin with Composition of functions.

Part 1: Composition of functions

Composition of Functions

Overview

Composition of functions means applying one function and then feeding its output into another. This topic is not just notation. In CMI-style questions, the real test is usually about when a composition is defined, how domain and codomain interact, and what properties such as one-to-one and onto can be inferred from the composition. ---

Learning Objectives

❗ By the End of This Topic

After studying this topic, you will be able to:

define and compute compositions like $g\circ f$ correctly,

determine the domain of a composite function,

simplify algebraic compositions,

analyze injectivity and surjectivity of compositions,

use composition to understand inverse functions and identity maps.

---

Core Definition

📖 Composition of Functions

Let

$\qquad f:S\to T$
and
$\qquad g:T\to U$

Then the composition $g\circ f$ is the function from $S$ to $U$ defined by

$\qquad (g\circ f)(x)=g(f(x))$

This means:

first apply $f$ ,

then apply $g$ to the result.

⚠️ Order Matters

In general,

$\qquad g\circ f \ne f\circ g$

because:

the rules may be different,

the domains may be different,

one composition may be defined while the other is not.

---

When is a Composition Defined?

❗ Domain Condition for Composition

The composition $g\circ f$ makes sense only when the outputs of $f$ lie inside the domain of $g$ .

If
$\qquad f:S\to T$
and
$\qquad g:A\to U$

then $g\circ f$ is defined only for those $x\in S$ such that

$\qquad f(x)\in A$

So the domain of $g\circ f$ is

$\qquad \{x\in S : f(x)\in \text{domain}(g)\}$

---

Algebraic Composition

📐 Basic Evaluation Rule

To find $(g\circ f)(x)$ :

compute $f(x)$ ,

substitute that entire expression into $g$ .

Similarly,

\qquad (f\circ g)(x)=f(g(x))

These are often different.

Example 1 Let

\qquad f(x)=2x+1,\qquad g(x)=x^2

Then

\qquad (g\circ f)(x)=g(2x+1)=(2x+1)^2

but

\qquad (f\circ g)(x)=f(x^2)=2x^2+1

So they are not the same. ---

Domain of a Composite Function

📐 How to Find the Domain

For $(g\circ f)(x)$ :

start with the domain of $f$ ,

then impose the extra condition that $f(x)$ must lie in the domain of $g$ .

This is one of the most tested algebraic ideas in composition questions.

Example 2 Let

\qquad f(x)=x^2-1,\qquad g(x)=\sqrt{x}

Then

\qquad (g\circ f)(x)=\sqrt{x^2-1}

For this to be defined, we need

\qquad x^2-1 \ge 0

\qquad x\le -1 \quad \text{or} \quad x\ge 1

Hence the domain of

g\circ f

\qquad (-\infty,-1]\cup[1,\infty)

---

Injective and Surjective Language

📖 One-to-One and Onto

Let $f:S\to T$ .

$f$ is one-to-one or injective if

\qquad f(a_1)=f(a_2)\Rightarrow a_1=a_2

$f$ is onto or surjective if for every $b\in T$ , there exists $a\in S$ such that

\qquad f(a)=b

---

What Composition Tells Us About Injectivity

📐 If

g\circ f

is One-to-One

If $g\circ f$ is one-to-one, then:

$f$ must be one-to-one,

$g$ need not be one-to-one on all of its domain.

Why?

If

f(a_1)=f(a_2)

, then applying

g

gives

\qquad g(f(a_1))=g(f(a_2))

that is,

\qquad (g\circ f)(a_1)=(g\circ f)(a_2)

Since

g\circ f

is one-to-one, we get

\qquad a_1=a_2

f

must be injective.

💡 Important Subtlety

Even if $g\circ f$ is injective, $g$ may fail to be injective on values that never come from $f$ .

So from injectivity of $g\circ f$ , we can conclude:

$f$ must be injective,

$g$ need not be injective globally.

---

What Composition Tells Us About Surjectivity

📐 If

g\circ f

is Onto

If $g\circ f:S\to U$ is onto, then:

$g$ must be onto,

$f$ need not be onto.

Reason:

If

g\circ f

is onto

U

, then for every

u\in U

there exists

x\in S

such that

\qquad g(f(x))=u

But

f(x)

lies in the domain of

g

, so some input to

g

maps to

u

.

Hence

g

is onto.

💡 Important Subtlety

From surjectivity of $g\circ f$ , we only know that $f(S)$ is large enough for $g$ to hit all of $U$ .

So:

$g$ must be onto,

$f$ need not be onto its codomain.

---

Summary of the Main Implications

📐 Must-Know Logical Table

If $g\circ f$ is one-to-one, then

$f$ must be one-to-one

$g$ need not be onto

$g$ need not be one-to-one globally

g\circ f

is onto, then

$g$ must be onto

$f$ need not be one-to-one

$f$ need not be onto

For standard exam answers, the most important clean facts are:

$g\circ f$ injective $\Rightarrow f$ injective

$g\circ f$ surjective $\Rightarrow g$ surjective

::: ---

Composition and Inverse Functions

📐 Inverse via Identity

A function $f:S\to T$ has an inverse $f^{-1}:T\to S$ if and only if $f$ is bijective.

Then

$\qquad f^{-1}\circ f = I_S$
and
$\qquad f\circ f^{-1} = I_T$

where $I_S$ and $I_T$ are identity functions on $S$ and $T$ respectively.

📖 Identity Function

The identity function on a set $S$ is

$\qquad I_S(x)=x$

for every $x\in S$ .

---

Associativity of Composition

📐 Associativity

If all relevant compositions are defined, then

$\qquad h\circ (g\circ f) = (h\circ g)\circ f$

So composition is associative.

But it is generally not commutative.

---

Common Algebraic Patterns

📐 Useful Patterns

\qquad f(x)=ax+b,\quad g(x)=cx+d

then

\qquad (g\circ f)(x)=c(ax+b)+d

\qquad f(x)=x^2,\quad g(x)=\sqrt{x}

then

\qquad (g\circ f)(x)=\sqrt{x^2}=|x|

\qquad f(x)=\dfrac{1}{x},\quad g(x)=x+1

then

\qquad (g\circ f)(x)=1+\dfrac{1}{x}

with

x\ne 0

Domains must be checked after substitution, not before only.

---

PYQ-Type Logic You Must Remember

💡 CMI Strategy

When a question asks about $g\circ f$ :

identify the order clearly,

check whether the composition is defined,

if algebraic, substitute carefully,

if logical, ask what must happen to $f$ and what must happen to $g$ ,

do not assume converse statements are true unless proved.

---

Common Mistakes

⚠️ Avoid These Errors

❌ Writing $g\circ f(x)$ instead of $(g\circ f)(x)$ in a confusing way

❌ Reversing the order of application

❌ Forgetting to check the domain after substitution

❌ Assuming injectivity of $g\circ f$ forces injectivity of $g$

❌ Assuming surjectivity of $g\circ f$ forces surjectivity of $f$

❌ Thinking composition is commutative

---

Minimal Worked Examples

Example 3 Let

\qquad f(x)=x+2,\qquad g(x)=\dfrac{1}{x}

Then

\qquad (g\circ f)(x)=\dfrac{1}{x+2}

For this to be defined, we need

\qquad x+2\ne 0

So the domain is

\qquad \mathbb{R}\setminus\{-2\}

--- Example 4 Suppose

g\circ f

is one-to-one. Prove

f

is one-to-one. Take any

a_1,a_2

such that

\qquad f(a_1)=f(a_2)

Apply

g

to both sides:

\qquad g(f(a_1))=g(f(a_2))

\qquad (g\circ f)(a_1)=(g\circ f)(a_2)

Since

g\circ f

is one-to-one,

\qquad a_1=a_2

Therefore

f

is one-to-one. ---

Practice Questions

:::question type="MCQ" question="Let

f(x)=x^2+1

and

g(x)=2x-3

. Then

(g\circ f)(x)

equals" options=["

2x^2-1

","

(2x-3)^2+1

","

2x^2+2-3

","

x^2-2

"] answer="A" hint="Apply

f

first, then

g

." solution="We first compute

\qquad f(x)=x^2+1

Now apply

g

\qquad (g\circ f)(x)=g(x^2+1)=2(x^2+1)-3=2x^2-1

Hence the correct option is

\boxed{A}

." ::: :::question type="NAT" question="Let

f(x)=x-1

and

g(x)=x^2

. Find

(f\circ g)(3)

." answer="8" hint="Compute

g(3)

first." solution="We have

\qquad g(3)=3^2=9

Now apply

f

\qquad (f\circ g)(3)=f(9)=9-1=8

Hence the answer is

\boxed{8}

." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If

g\circ f

is one-to-one, then

f

must be one-to-one","If

g\circ f

is onto, then

g

must be onto","If

g\circ f

is one-to-one, then

g

must be one-to-one","If

g\circ f

is onto, then

f

must be onto"] answer="A,B" hint="Think about what property must pass backward or forward through composition." solution="1. True. Injectivity of

g\circ f

forces injectivity of

f

True. Surjectivity of

g\circ f

forces surjectivity of

g

False.

g

need not be one-to-one on all of its domain.

False.

f

need not be onto its codomain.

Hence the correct answer is

\boxed{A,B}

." ::: :::question type="SUB" question="Find the domain of

(g\circ f)(x)

f(x)=x^2-4

and

g(x)=\dfrac{1}{x}

." answer="

\mathbb{R}\setminus\\{-2,2\\}

" hint="The output of

f

must lie in the domain of

g

." solution="We have

\qquad f(x)=x^2-4

and

\qquad g(x)=\dfrac{1}{x}

\qquad (g\circ f)(x)=\dfrac{1}{x^2-4}

For this to be defined, we require

\qquad x^2-4\ne 0

Thus

\qquad (x-2)(x+2)\ne 0

\qquad x\ne 2,\ -2

Hence the domain is

\qquad \boxed{\mathbb{R}\setminus\{-2,2\}}

." ::: ---

Summary

❗ Key Takeaways for CMI

$(g\circ f)(x)$ means apply $f$ first and then $g$ .

Composition is associative but not usually commutative.

The domain of a composite function must be checked after substitution.

If $g\circ f$ is injective, then $f$ must be injective.

If $g\circ f$ is surjective, then $g$ must be surjective.

Identity and inverse functions are naturally expressed using composition.

---

💡 Next Up

Proceeding to Function iteration.

---

Part 2: Function iteration

Function Iteration

Overview

Function iteration means applying a function repeatedly to its own outputs. If a function

f

sends

x

f(x)

, then iteration studies

\qquad x,\ f(x),\ f(f(x)),\ f(f(f(x))),\dots

This topic appears in CMI-style questions through composition, trajectories, fixed points, periodic points, idempotent functions such as

f \circ f = f

, higher-order conditions such as

g \circ g \circ g = g

, and recursive rules that define a map implicitly. The key skill is to move between algebraic identity, orbit structure, and global behavior. ---

Learning Objectives

❗ By the End of This Topic

After studying this topic, you will be able to:

use iterate notation correctly and distinguish it from ordinary powers

analyse trajectories, fixed points, and periodic points of a function

use composition identities such as $f \circ f=f$ and $g \circ g \circ g=g$

apply the chain rule to iterated differentiable functions

reason about finite and infinite trajectories in discrete iteration problems

extract structural consequences such as injectivity, surjectivity, and monotonicity from iteration identities

---

Basic Notation

📖 Iterates of a Function

If $f$ is a function from a set $A$ to itself, then:

$f^{\circ 1} = f$

$f^{\circ 2} = f \circ f$

$f^{\circ 3} = f \circ f \circ f$

in general, $f^{\circ n}$ means $f$ composed with itself $n$ times

Important:

\qquad f^{\circ n}(x)

means the

n

-th iterate of

x

under

f

This is not the same as

(f(x))^n

⚠️ Do Not Confuse These

$f^{\circ 2}(x)=f(f(x))$

$(f(x))^2 = f(x)\cdot f(x)$

These are completely different expressions.

---

Trajectory / Orbit

📖 Trajectory of a Point

For a function $f:A \to A$ , the trajectory or orbit of a point $x$ is

$\qquad \{x,\ f(x),\ f^{\circ 2}(x),\ f^{\circ 3}(x),\dots\}$

Sometimes the order matters, and one studies the sequence

$\qquad x,\ f(x),\ f^{\circ 2}(x),\dots$

rather than just the set of values.

❗ Finite Trajectory Principle

For a deterministic iteration rule, a trajectory is finite if and only if some value repeats.

If
$\qquad f^{\circ m}(x)=f^{\circ n}(x)$
for some $m<n$ ,

then from that point onward the iteration becomes periodic.

---

Fixed Points and Periodic Points

📖 Fixed Point

A point $x$ is a fixed point of $f$ if

$\qquad f(x)=x$

📖 Periodic Point

A point $x$ is periodic of period $k \ge 1$ if

$\qquad f^{\circ k}(x)=x$

The least such positive $k$ is called the period of $x$ .

📐 Examples of Periodic Structure

period $1$ means fixed point

period $2$ means

\qquad f(f(x))=x

but

f(x)\ne x

finite trajectory usually means the orbit eventually lands in a cycle

---

Composition Identities

1. Idempotent Functions

📖 Idempotent Function

A function $f$ is called idempotent if

$\qquad f \circ f = f$

That is,

$\qquad f(f(x))=f(x)$ for every $x$

❗ Immediate Consequences of

f \circ f = f

If $y$ lies in the range of $f$ , then there exists some $x$ with $y=f(x)$ .

Applying $f$ again,

$\qquad f(y)=f(f(x))=f(x)=y$

So every point in the range is a fixed point of $f$ .

Hence:

every value attained by $f$ is fixed by $f$

the range of $f$ is contained in the set of fixed points

in fact, the range equals the set of fixed points

📐 Range = Fixed Point Set for Idempotent Maps

If $f \circ f = f$ , then

$\qquad \operatorname{Range}(f)=\{y : f(y)=y\}$

---

2. Triple Iteration Identity

📖 Triple Iterate Identity

If

$\qquad g \circ g \circ g = g$

then letting

$\qquad h = g \circ g$

we get

$\qquad h \circ h = h$

So $h$ is idempotent.

This reduces a third-iterate problem to an idempotent-function problem.

💡 Useful Reduction

Whenever you see
$\qquad g^{\circ 3}=g$ ,

set
$\qquad h=g^{\circ 2}$

Then
$\qquad h^{\circ 2}=g^{\circ 4}=g^{\circ 2}=h$

So all the structure facts for idempotent maps become available for $h$ .

---

Differentiable Iteration and the Chain Rule

📐 Derivative of an Iterate

If $f$ is differentiable, then

$\qquad (f \circ f)'(x)=f'(f(x))\cdot f'(x)$

More generally,

$\qquad (f^{\circ n})'(x)=f'(f^{\circ (n-1)}(x)) \cdots f'(f(x))f'(x)$

📐 Derivative Consequence for

f \circ f=f

If $f \circ f=f$ , then differentiating gives

$\qquad f'(f(x))\cdot f'(x)=f'(x)$

So

$\qquad f'(x)\big(f'(f(x))-1\big)=0$

Hence for each $x$ , at least one of the following must hold:

$\qquad f'(x)=0 \quad \text{or} \quad f'(f(x))=1$

❗ Interpretation

This identity is extremely strong.

at points where $f'(x)\ne 0$ , we must have $f'(f(x))=1$

on the range of an idempotent differentiable function, one often gets strong rigidity

in many real-analysis settings, this forces the only non-constant solution to be the identity map

---

Injective and Surjective Tricks

💡 Very Useful Logic

If $f$ is injective and $f \circ f=f$ , then

\qquad f(f(x))=f(x)

Injectivity gives

\qquad f(x)=x

So an injective idempotent map must be the identity.

If $f$ is surjective and $f \circ f=f$ , then every $y$ is in the range, hence every $y$ is fixed. So again

\qquad f(y)=y

Thus a surjective idempotent map must also be the identity.

❗ Conclusion

If $f \circ f=f$ , then the strongest nontrivial case is when $f$ is neither obviously injective nor obviously surjective. Many problems then ask you to prove one of those properties and deduce

$\qquad f(x)=x$

---

Finite Trajectories in Discrete Iteration

📖 Trajectory under a Rule

Suppose a map $T$ is defined on positive integers by some rule. Then the trajectory of $a$ is

$\qquad a,\ T(a),\ T^{\circ 2}(a),\dots$

A finite trajectory means only finitely many distinct values occur.

❗ How Finite Trajectories Arise

A finite trajectory means the sequence must eventually repeat. Since the rule is deterministic, a repeated value creates a cycle.

So finite-trajectory questions are usually solved by:

identifying possible cycles

proving that every finite orbit must end in one of them

constructing examples of desired lengths if asked

💡 Typical Structure Method

In discrete iteration games:

find monotonicity outside special values

identify when the map increases

identify when the map sharply decreases

study minimal element of a trajectory

classify all possible cycles

---

Functional-Equation Viewpoint

📐 Iteration as a Functional Equation

Many iteration problems amount to identities like

$f^{\circ 2}=f$

$f^{\circ 3}=f$

$f(n)=f(f(n+5))$

$q(x)=q\!\left(\dfrac{1}{1-x}\right)$

The general strategy is:

find an invariant or repeated structure

rewrite using composition

deduce fixed points / range constraints / periodic constraints

reduce the problem to algebra or order structure

---

Minimal Worked Examples

Example 1 Let

f(x)=x+1

\mathbb{R}

. Then

\qquad f^{\circ 2}(x)=f(x+1)=x+2

\qquad f^{\circ 3}(x)=x+3

So in general,

\qquad f^{\circ n}(x)=x+n

This trajectory is infinite for every real

x

. --- Example 2 Let

f(x)=x^2

on nonnegative reals. Then

x=0

and

x=1

are fixed points because

\qquad 0^2=0,\quad 1^2=1

Also, if

0<x<1

, then repeated iteration drives values toward

0

, while if

x>1

, repeated iteration grows rapidly. This shows that iteration is governed by fixed points and how the function behaves near them. ---

Common Error Patterns

⚠️ Avoid These Errors

❌ treating $f^{\circ 2}(x)$ as $(f(x))^2$

❌ assuming finite trajectory means fixed point; it may instead mean a cycle

❌ forgetting that a repeated value in a deterministic system implies eventual periodicity

❌ differentiating $f(f(x))$ incorrectly

❌ forgetting to use the range when $f \circ f=f$

❌ solving pointwise but ignoring global conditions such as onto or monotone

---

Strategy for CMI-Type Questions

💡 CMI Strategy

Write the iterate notation cleanly. Keep track of $f$ , $f^{\circ 2}$ , $f^{\circ 3}$ separately.

Look for fixed points first. They often control the whole problem.

For $f \circ f=f$ , immediately study the range.

For $g^{\circ 3}=g$ , set $h=g^{\circ 2}$ and reduce to the idempotent case.

For discrete trajectories, classify cycles and use minimal-element or monotonicity arguments.

If differentiability is given, differentiate the iterate identity and exploit the chain rule.

If onto or one-to-one is obtained, try to force the identity map.

---

Practice Questions

:::question type="MCQ" question="If

f

is a function such that

f \circ f = f

, which of the following must be true?" options=["Every point in the domain is fixed","Every point in the range is fixed","

f

is constant","

f

is one-to-one"] answer="B" hint="Write

y=f(x)

for a point in the range." solution="Let

y

be any point in the range of

f

. Then there exists some

x

such that

\qquad y=f(x)

Now apply

f

\qquad f(y)=f(f(x))

Since

f \circ f=f

, this becomes

\qquad f(y)=f(x)=y

So every point in the range is fixed. The other statements need not hold in general. Hence the correct option is

\boxed{B}

." ::: :::question type="NAT" question="Let

f(x)=2x+1

for all real

x

. Find

f^{\circ 2}(3)

." answer="15" hint="First compute

f(3)

, then apply

f

again." solution="We have

\qquad f(3)=2\cdot 3+1=7

Now apply

f

once more:

\qquad f^{\circ 2}(3)=f(7)=2\cdot 7+1=15

Therefore the answer is

\boxed{15}

." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If

f

is injective and

f \circ f=f

, then

f(x)=x

for all

x

","If

f

is surjective and

f \circ f=f

, then

f(x)=x

for all

x

","If a trajectory repeats a value, then it becomes eventually periodic","For every function,

f^{\circ 2}(x)=(f(x))^2

"] answer="A,B,C" hint="Use injectivity, surjectivity, and deterministic iteration carefully." solution="1. True. From

f(f(x))=f(x)

and injectivity, we get

f(x)=x

for all

x

True. If

f

is surjective, every point is in the range; but every point in the range of an idempotent map is fixed. Hence

f(x)=x

for all

x

True. Once a deterministic iteration revisits a value, the same sequence repeats from there onward, so the orbit is eventually periodic.

False.

f^{\circ 2}(x)

means

f(f(x))

, not

(f(x))^2

Therefore the correct answer is

\boxed{A,B,C}

." ::: :::question type="SUB" question="Suppose

f:\mathbb{R}\to\mathbb{R}

is differentiable and satisfies

f \circ f = f

. Show that for every real number

x

, either

f'(x)=0

f'(f(x))=1

." answer="For every real

x

f'(x)\big(f'(f(x))-1\big)=0

, so either

f'(x)=0

f'(f(x))=1

." hint="Differentiate the identity

f(f(x))=f(x)

using the chain rule." solution="We are given

\qquad f(f(x))=f(x)

for every real

x

. Differentiate both sides with respect to

x

. By the chain rule,

\qquad \dfrac{d}{dx}f(f(x)) = f'(f(x))\cdot f'(x)

and

\qquad \dfrac{d}{dx}f(x)=f'(x)

\qquad f'(f(x))\cdot f'(x)=f'(x)

Rearranging,

\qquad f'(x)\big(f'(f(x))-1\big)=0

Hence for every real

x

, at least one of the two factors must be zero. Therefore,

\qquad f'(x)=0 \quad \text{or} \quad f'(f(x))=1

This proves the required statement. ::: ---

Summary

❗ Key Takeaways for CMI

Iteration studies repeated composition: $f^{\circ n}$ , not powers of values.

A finite deterministic trajectory must eventually become periodic.

If $f \circ f=f$ , then the range of $f$ is exactly the fixed-point set of $f$ .

If an idempotent map is injective or surjective, it must be the identity.

Differentiating iterate identities often produces strong rigidity conditions.

For $g^{\circ 3}=g$ , studying $g^{\circ 2}$ is often the right first reduction.

In hard problems, the right invariant or orbit structure is usually more important than direct computation.

---

💡 Next Up

Proceeding to Existence of inverse.

---

Part 3: Existence of inverse

Existence of Inverse

Overview

The inverse of a function exists only when the function matches inputs and outputs in a perfectly reversible way. In CMI-style questions, this topic is not just about writing

f^{-1}(x)

algebraically; it is about checking whether an inverse function exists at all, which depends on injectivity, surjectivity, the chosen domain and codomain, and sometimes a suitable restriction of domain. ---

Learning Objectives

❗ By the End of This Topic

After studying this topic, you will be able to:

decide whether a function has an inverse

distinguish between left inverse, right inverse, and two-sided inverse

test injectivity, surjectivity, and bijectivity correctly

find inverse functions when they exist

understand how domain restriction can create an inverse

---

Core Definition

📖 Inverse Function

Let $f:A\to B$ be a function.

A function $g:B\to A$ is called the inverse of $f$ if

$\qquad g(f(x))=x \text{ for every } x\in A$

and

$\qquad f(g(y))=y \text{ for every } y\in B$

In that case, we write

$\qquad g=f^{-1}$

❗ Main Criterion

A function $f:A\to B$ has an inverse function if and only if $f$ is bijective.

That means:

every element of $B$ is hit by exactly one element of $A$

equivalently, $f$ is both injective and surjective

---

Injective, Surjective, Bijective

📐 Injective

A function $f:A\to B$ is injective if

$\qquad f(x_1)=f(x_2) \Rightarrow x_1=x_2$

for all $x_1,x_2\in A$ .

This means different inputs give different outputs.

📐 Surjective

A function $f:A\to B$ is surjective if for every $y\in B$ , there exists some $x\in A$ such that

$\qquad f(x)=y$

This means the range of $f$ is exactly the codomain $B$ .

📐 Bijective

A function is bijective if it is both injective and surjective.

Only then does a genuine inverse function exist.

---

Why Inverse Requires Bijectivity

💡 One-to-One and Onto

For $f^{-1}$ to be a function:

every output of $f$ must come from some input

\Rightarrow

surjectivity

no output of $f$ should come from two different inputs

\Rightarrow

injectivity

If either fails, the inverse cannot be a well-defined function on the full codomain.

---

Left Inverse and Right Inverse

📐 Left Inverse

A function $g:B\to A$ is a left inverse of $f:A\to B$ if

$\qquad g\circ f = I_A$

where $I_A(x)=x$ for all $x\in A$ .

A left inverse exists only when $f$ is injective.

📐 Right Inverse

A function $h:B\to A$ is a right inverse of $f:A\to B$ if

$\qquad f\circ h = I_B$

A right inverse exists only when $f$ is surjective.

❗ Full Inverse

A two-sided inverse exists if both happen together, that is, when $f$ is bijective.

---

Identity Function

📐 Identity Function

For a set $A$ , the identity function $I_A:A\to A$ is defined by

$\qquad I_A(x)=x$

If $f$ has inverse $f^{-1}$ , then

$\qquad f^{-1}\circ f = I_A$

and

$\qquad f\circ f^{-1} = I_B$

---

How to Find an Inverse

💡 Standard Algebraic Method

To find the inverse of a bijective function:

write

\qquad y=f(x)

solve for $x$ in terms of $y$

replace $y$ by $x$

state the correct domain and codomain of the inverse

This works only after confirming that an inverse exists.

---

Domain and Codomain Matter

⚠️ Same Formula, Different Invertibility

A function can be invertible for one choice of domain and codomain, but not for another.

Example:
$\qquad f(x)=x^2$

as a function $\mathbb{R}\to\mathbb{R}$ , it is not injective, so no inverse exists

as a function $[0,\infty)\to[0,\infty)$ , it is bijective, so the inverse exists and is

\qquad f^{-1}(x)=\sqrt{x}

So invertibility depends on the full function definition, not just the formula.

---

Horizontal Line View

💡 Graph Test for Injectivity

A real-valued function is injective on an interval if every horizontal line cuts its graph at most once.

If some horizontal line meets the graph more than once, the function is not one-to-one, so an inverse function cannot exist on that domain.

---

Strict Monotonicity and Inverse

📐 A Useful Practical Rule

If a real-valued function is strictly increasing or strictly decreasing on an interval, then it is injective on that interval.

So many inverse-function problems reduce to checking monotonicity on the given domain.

Examples:

$f(x)=2x+3$ is strictly increasing on $\mathbb{R}$ , so invertible

$f(x)=x^3$ is strictly increasing on $\mathbb{R}$ , so invertible

$f(x)=x^2$ is not one-to-one on $\mathbb{R}$ , so not invertible there

---

Standard Examples

📐 Example 1: Linear Function

For
$\qquad f(x)=ax+b,\quad a\ne 0$

the function is bijective from $\mathbb{R}$ to $\mathbb{R}$ .

To find the inverse:
$\qquad y=ax+b$

$\qquad x=\dfrac{y-b}{a}$

So
$\qquad f^{-1}(x)=\dfrac{x-b}{a}$

📐 Example 2: Reciprocal-Type Function

For
$\qquad f(x)=\dfrac{1}{x}$ on $\mathbb{R}\setminus\{0\}$

the function is bijective from $\mathbb{R}\setminus\{0\}$ to $\mathbb{R}\setminus\{0\}$ and

$\qquad f^{-1}(x)=\dfrac{1}{x}$

So the function is its own inverse.

📐 Example 3: Quadratic with Restricted Domain

For
$\qquad f(x)=x^2$

on $\mathbb{R}$ : no inverse function exists

on $[0,\infty)$ : inverse exists and is

\qquad f^{-1}(x)=\sqrt{x}

on $(-\infty,0]$ : inverse exists and is

\qquad f^{-1}(x)=-\sqrt{x}

---

Composition Check

📐 How to Verify an Inverse

If you think $g$ is the inverse of $f$ , check both:

$\qquad f(g(x))=x$

and

$\qquad g(f(x))=x$

with the correct allowed values of $x$ in each case.

⚠️ Do Not Check Only One Side Blindly

Sometimes one composition simplifies nicely only because the domain has been ignored.

For example, with
$\qquad f(x)=x^2$
and
$\qquad g(x)=\sqrt{x}$ ,

we have
$\qquad g(f(x))=\sqrt{x^2}=|x|$

This equals $x$ only when $x\ge 0$ .

So the correct domain matters critically.

---

Minimal Worked Examples

Example 1 Let

\qquad f(x)=3x-5

Find the inverse. Write

\qquad y=3x-5

Then

\qquad x=\dfrac{y+5}{3}

\qquad f^{-1}(x)=\dfrac{x+5}{3}

--- Example 2 Does

\qquad f(x)=x^2

have an inverse from

\mathbb{R}

\mathbb{R}

? No, because

\qquad f(2)=f(-2)=4

So the function is not injective on

\mathbb{R}

. Hence no inverse function exists on that domain. ---

CMI Strategy

💡 How to Solve Inverse-Existence Questions

first identify the domain and codomain carefully

test injectivity and surjectivity separately

if not injective, try domain restriction

if bijective, then find the inverse algebraically

verify by composition

in graph-based questions, use monotonicity or the horizontal line idea

---

Common Mistakes

⚠️ Avoid These Errors

❌ trying to find $f^{-1}$ before checking whether it exists

❌ confusing range with codomain

❌ forgetting that $x^2$ is not invertible on all of $\mathbb{R}$

❌ checking only one of $f\circ f^{-1}$ or $f^{-1}\circ f$

❌ ignoring domain restrictions while solving for the inverse

---

Practice Questions

:::question type="MCQ" question="Which of the following functions from

\mathbb{R}

\mathbb{R}

has an inverse?" options=["

f(x)=x^2

","

f(x)=|x|

","

f(x)=x^3

","

f(x)=x^2+1

"] answer="C" hint="An inverse exists only for a bijection." solution="We test each function on

\mathbb{R}

f(x)=x^2

is not injective because

\qquad f(2)=f(-2)

f(x)=|x|

is not injective because

\qquad |2|=|-2|

f(x)=x^3

is strictly increasing on

\mathbb{R}

, hence injective. Also every real number

y

is of the form

\qquad y=x^3

for some real

x=\sqrt[3]{y}

, so it is surjective.

f(x)=x^2+1

is not injective on

\mathbb{R}

Hence only

f(x)=x^3

has an inverse. Therefore the correct option is

\boxed{C}

." ::: :::question type="NAT" question="Let

f(x)=4x-7

. Find

f^{-1}(13)

." answer="5" hint="First find the inverse function." solution="Let

\qquad y=4x-7

Then

\qquad x=\dfrac{y+7}{4}

\qquad f^{-1}(x)=\dfrac{x+7}{4}

Now evaluate at

x=13

\qquad f^{-1}(13)=\dfrac{13+7}{4}=\dfrac{20}{4}=5

Hence the answer is

\boxed{5}

." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If a function has an inverse, then it must be bijective.","If a function is injective, then a left inverse may exist.","If a function is surjective, then a right inverse may exist.","The function

f(x)=x^2

from

[0,\infty)

[0,\infty)

has an inverse."] answer="A,B,C,D" hint="Recall the relation between left inverse, right inverse, and bijectivity." solution="1. True. A two-sided inverse exists exactly when the function is bijective.

True. A left inverse exists only in the injective case.

True. A right inverse exists only in the surjective case.

True. On

[0,\infty)

, the function

f(x)=x^2

is bijective onto

[0,\infty)

, and its inverse is

\qquad f^{-1}(x)=\sqrt{x}

Hence all four statements are true. Therefore the correct answer is

\boxed{A,B,C,D}

." ::: :::question type="SUB" question="Show that the function

f:\mathbb{R}\setminus\{2\}\to\mathbb{R}\setminus\{1\}

defined by

f(x)=\dfrac{x}{x-2}

is invertible, and find its inverse." answer="

f^{-1}(x)=\dfrac{2x}{x-1}

" hint="Set

y=\dfrac{x}{x-2}

and solve for

x

." solution="We are given

\qquad f(x)=\dfrac{x}{x-2}

with domain

\mathbb{R}\setminus\{2\}

and codomain

\mathbb{R}\setminus\{1\}

. To find the inverse, let

\qquad y=\dfrac{x}{x-2}

Then

\qquad y(x-2)=x

\qquad yx-2y=x

\qquad yx-x=2y

\qquad x(y-1)=2y

\qquad x=\dfrac{2y}{y-1}

So the inverse candidate is

\qquad f^{-1}(x)=\dfrac{2x}{x-1}

Now we verify: $\qquad f\!\left(\dfrac{2x}{x-1}\right)=\dfrac{\frac{2x}{x-1}}{\frac{2x}{x-1}-2} =\dfrac{\frac{2x}{x-1}}{\frac{2x-2x+2}{x-1}} =\dfrac{\frac{2x}{x-1}}{\frac{2}{x-1}}=x$ for

x\ne 1

. Also, $\qquad f^{-1}\!\left(\dfrac{x}{x-2}\right) =\dfrac{2\cdot \frac{x}{x-2}}{\frac{x}{x-2}-1} =\dfrac{\frac{2x}{x-2}}{\frac{x-(x-2)}{x-2}} =\dfrac{\frac{2x}{x-2}}{\frac{2}{x-2}}=x$ for

x\ne 2

. Hence

f

is invertible, and

\qquad \boxed{f^{-1}(x)=\dfrac{2x}{x-1}}

." ::: ---

Summary

❗ Key Takeaways for CMI

A function has an inverse if and only if it is bijective.

Bijective means both injective and surjective.

Left inverse corresponds to injectivity; right inverse corresponds to surjectivity.

Domain and codomain are part of the function, so invertibility depends on them.

Many non-invertible formulas become invertible after domain restriction.

Always verify an inverse by composition.

---

💡 Next Up

Proceeding to Inverse of a function.

---

Part 4: Inverse of a function

Inverse of a function

Overview

The inverse of a function reverses the action of the original function. If

f

sends an input

x

to an output

y

, then

f^{-1}

sends

y

back to

x

. In CMI-style questions, inverse functions are tested not only through formulas, but through domain-range matching, one-one behaviour, composition, and careful restriction of domain. ---

Learning Objectives

❗ By the End of This Topic

After studying this topic, you will be able to:

Decide when a function has an inverse.

Find the inverse of a function algebraically.

Restrict the domain of a function when necessary to make it invertible.

Use composition to verify inverses.

Distinguish clearly between $f^{-1}(x)$ and $\dfrac{1}{f(x)}$ .

---

Core Idea

📖 Inverse of a function

A function $f:A\to B$ has an inverse if there exists a function $f^{-1}:B\to A$ such that

$\qquad f^{-1}(f(x))=x \quad \text{for all } x\in A$

and

$\qquad f(f^{-1}(y))=y \quad \text{for all } y\in B$

So the inverse undoes the original function.

❗ Domain and Range Swap

If $f$ has an inverse, then:

domain of $f^{-1}$ = range of $f$

range of $f^{-1}$ = domain of $f$

This is one of the most important facts in inverse-function questions.

---

When Does an Inverse Exist?

📐 Necessary condition

A function must be one-one to have an inverse as a function.

That means:
$\qquad f(a)=f(b) \Rightarrow a=b$

Equivalently, different inputs must give different outputs.

📖 One-one and onto viewpoint

For a function $f:A\to B$ :

one-one (injective): no two distinct elements of $A$ have the same image

onto (surjective): every element of $B$ is hit by some element of $A$

For an inverse from

B

back to

A

to exist on the whole codomain

B

, the function must be both one-one and onto.

💡 Graph Test

A function is one-one if every horizontal line intersects its graph at most once.

This is called the horizontal line test.

---

How to Find an Inverse Algebraically

📐 Standard method

To find the inverse of $y=f(x)$ :

Write

\qquad y=f(x)

Solve for $x$ in terms of $y$

Interchange $x$ and $y$

Write the result as

\qquad y=f^{-1}(x)

---

Minimal Worked Examples

Example 1 Find the inverse of

\qquad f(x)=3x-5

Write

\qquad y=3x-5

Solve for

x

\qquad y+5=3x

\qquad x=\dfrac{y+5}{3}

Interchange

x

and

y

\qquad f^{-1}(x)=\dfrac{x+5}{3}

--- Example 2 Find the inverse of

\qquad f(x)=\dfrac{x-2}{x+3}

Write

\qquad y=\dfrac{x-2}{x+3}

Solve for

x

\qquad y(x+3)=x-2

\qquad yx+3y=x-2

\qquad yx-x=-2-3y

\qquad x(y-1)=-(2+3y)

\qquad x=\dfrac{2+3y}{1-y}

Interchange

x

and

y

\qquad f^{-1}(x)=\dfrac{2+3x}{1-x}

Domain note:

original function is undefined at $x=-3$

inverse is undefined at $x=1$ , which is the range restriction of the original function

---

Restricting the Domain

❗ Why restriction is often needed

Some common functions are not one-one on their natural domain, so they do not have an inverse unless we restrict the domain.

Example:
$\qquad f(x)=x^2$

On all real numbers, this is not one-one because
$\qquad f(2)=f(-2)=4$

So no inverse exists on $\mathbb{R}$ .

But if we restrict the domain to
$\qquad x\ge 0$

then the inverse becomes
$\qquad f^{-1}(x)=\sqrt{x}$

⚠️ Most Important Square Trap

If
$\qquad f(x)=x^2$

then the inverse is not
$\qquad \pm \sqrt{x}$

because an inverse must itself be a function.

After restricting to $x\ge 0$ , the inverse is
$\qquad \sqrt{x}$

After restricting to $x\le 0$ , the inverse is
$\qquad -\sqrt{x}$

---

Composition Check

📐 How to verify an inverse

If you claim that $g=f^{-1}$ , then check:

$\qquad f(g(x))=x$

and

$\qquad g(f(x))=x$

on the appropriate domains.

Example For

\qquad f(x)=3x-5

and

\qquad g(x)=\dfrac{x+5}{3}

, we get

\qquad f(g(x))=3\left(\dfrac{x+5}{3}\right)-5=x+5-5=x

and

\qquad g(f(x))=\dfrac{3x-5+5}{3}=x

g=f^{-1}

. ---

Inverse Is Not Reciprocal

⚠️ Do Not Confuse These

$f^{-1}(x)$ means the inverse function

$\dfrac{1}{f(x)}$ means reciprocal of the function value

These are completely different. Example: If

\qquad f(x)=2x

then

\qquad f^{-1}(x)=\dfrac{x}{2}

but

\qquad \dfrac{1}{f(x)}=\dfrac{1}{2x}

---

Domain and Range Logic

📐 Always track these

If $f:A\to B$ is invertible, then:

each value in the range of $f$ becomes an input for $f^{-1}$

each value in the domain of $f$ becomes an output for $f^{-1}$

Example:
If

\qquad f(x)=x^2,\ x\ge 0

then:

domain of $f$ is $[0,\infty)$

range of $f$ is $[0,\infty)$

So for the inverse:

domain of $f^{-1}$ is $[0,\infty)$

range of $f^{-1}$ is $[0,\infty)$

---

Standard Function Patterns

📐 Common inverse pairs

$f(x)=ax+b,\ a\ne 0$

\qquad \Rightarrow \qquad f^{-1}(x)=\dfrac{x-b}{a}

$f(x)=x^2,\ x\ge 0$

\qquad \Rightarrow \qquad f^{-1}(x)=\sqrt{x}

$f(x)=x^2,\ x\le 0$

\qquad \Rightarrow \qquad f^{-1}(x)=-\sqrt{x}

$f(x)=\dfrac{ax+b}{cx+d}$ with $ad-bc\ne 0$

can often be inverted by solving linearly for

x

$f(x)=a^x,\ a>0,\ a\ne 1$

\qquad \Rightarrow \qquad f^{-1}(x)=\log_a x

---

Graph-Based Understanding

📖 Graph of an inverse

The graph of $f^{-1}$ is the reflection of the graph of $f$ in the line

$\qquad y=x$

💡 How this helps

If a point $(a,b)$ lies on the graph of $f$ , then the point $(b,a)$ lies on the graph of $f^{-1}$ .

So inverse graphs swap coordinates.

---

Common Errors

⚠️ Avoid These Errors

❌ finding an inverse without checking whether the function is one-one

❌ forgetting to restrict domain for functions like $x^2$

❌ writing $\pm\sqrt{x}$ as an inverse
✅ Correct habits:

---

CMI Strategy

💡 How to Attack Inverse Questions

First ask: is the function one-one on the given domain?

If not, restrict the domain if the problem allows it.

Solve $y=f(x)$ for $x$ cleanly.

Track the domain and range after inversion.

Use composition to confirm the result.

In graph questions, use reflection in $y=x$ and horizontal line logic.

---

Practice Questions

:::question type="MCQ" question="If

f(x)=3x-7

, then

f^{-1}(x)

is" options=["

\dfrac{x-7}{3}

","

\dfrac{x+7}{3}

","

3x+7

","

\dfrac{1}{3x-7}

"] answer="B" hint="Set

y=3x-7

and solve for

x

." solution="Write

\qquad y=3x-7

Then

\qquad y+7=3x

\qquad x=\dfrac{y+7}{3}

Interchanging

x

and

y

, we get

\qquad f^{-1}(x)=\dfrac{x+7}{3}

Hence the correct option is

\boxed{B}

." ::: :::question type="NAT" question="For

f(x)=x^2

with domain

x\ge 0

, find

f^{-1}(49)

." answer="7" hint="First identify the inverse function." solution="Since the domain of

f(x)=x^2

is restricted to

x\ge 0

, the inverse is

\qquad f^{-1}(x)=\sqrt{x}

Therefore,

\qquad f^{-1}(49)=\sqrt{49}=7

Hence the answer is

\boxed{7}

." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If a function has an inverse, then it must be one-one.","For an invertible function, domain of

f^{-1}

equals range of

f

.","

f^{-1}(x)

always means

\dfrac{1}{f(x)}

.","The graph of

f^{-1}

is the reflection of the graph of

f

in the line

y=x

."] answer="A,B,D" hint="Recall the meaning of inverse and its graph." solution="1. True. A function must be one-one to have an inverse as a function.

True. Domain and range swap under inversion.

False.

f^{-1}(x)

means inverse function, not reciprocal.

True. The graph of the inverse is the reflection of the graph in the line

y=x

Hence the correct answer is

\boxed{A,B,D}

." ::: :::question type="SUB" question="Find the inverse of

f(x)=\dfrac{x+1}{x-2}

and state its domain." answer="

f^{-1}(x)=\dfrac{2x+1}{x-1}

, domain of

f^{-1}

\mathbb{R}\setminus\\{1\\}

" hint="Set

y=\dfrac{x+1}{x-2}

and solve for

x

." solution="Write

\qquad y=\dfrac{x+1}{x-2}

Now solve for

x

\qquad y(x-2)=x+1

\qquad yx-2y=x+1

\qquad yx-x=2y+1

\qquad x(y-1)=2y+1

\qquad x=\dfrac{2y+1}{y-1}

Interchanging

x

and

y

, we get

\qquad f^{-1}(x)=\dfrac{2x+1}{x-1}

The denominator shows that

\qquad x\ne 1

So the domain of the inverse is

\qquad \mathbb{R}\setminus\{1\}

Hence

\qquad \boxed{f^{-1}(x)=\dfrac{2x+1}{x-1}}

with domain

\qquad \boxed{\mathbb{R}\setminus\{1\}}

." ::: ---

Summary

❗ Key Takeaways for CMI

An inverse reverses the action of the original function.

A function must be one-one to have an inverse as a function.

Domain and range swap under inversion.

Many functions need domain restriction before they become invertible.

$f^{-1}(x)$ is not the same as $\dfrac{1}{f(x)}$ .

Composition and graph reflection are the two fastest ways to verify inverse relationships.

Chapter Summary

❗ Operations on functions — Key Points

Composition of Functions: For functions $f: B \to C$ and $g: A \to B$ , the composite function $(f \circ g)(x) = f(g(x))$ has domain $\{x \in A \mid g(x) \in B\}$ . Composition is associative but generally not commutative.
Function Iteration: $f^n(x)$ denotes the $n$ -th iteration of $f$ , defined as $f \circ f^{n-1}(x)$ for $n \ge 1$ , with $f^0(x) = x$ (the identity function).
Existence of Inverse: A function $f: A \to B$ possesses an inverse function $f^{-1}: B \to A$ if and only if $f$ is bijective (both injective/one-to-one and surjective/onto).
Properties of Inverse: If $f^{-1}$ exists, then $(f \circ f^{-1})(x) = x$ for all $x$ in the domain of $f^{-1}$ , and $(f^{-1} \circ f)(x) = x$ for all $x$ in the domain of $f$ .
Domain and Range of Inverse: The domain of $f^{-1}$ is the range of $f$ , and the range of $f^{-1}$ is the domain of $f$ .
Finding the Inverse: To find $f^{-1}(x)$ , replace $f(x)$ with $y$ , swap $x$ and $y$ , then solve the resulting equation for $y$ .
* Graphical Representation: The graph of $y = f^{-1}(x)$ is the reflection of the graph of $y = f(x)$ across the line $y=x$ .

Chapter Review Questions

:::question type="MCQ" question="Given $f(x) = \sqrt{x-1}$ and $g(x) = x^2+2$ . Determine the domain of the composite function $(f \circ g)(x)$ ." options=[" $[1, \infty)$ "," $(-\infty, \infty)$ "," $[0, \infty)$ "," $[-1, 1]$ "] answer=" $(-\infty, \infty)$ " hint="First, find the expression for $(f \circ g)(x)$ . Then, identify the values of $x$ for which this expression is defined." solution="First, we find the expression for $(f \circ g)(x)$ :
$(f \circ g)(x) = f(g(x)) = f(x^2+2) = \sqrt{(x^2+2)-1} = \sqrt{x^2+1}$ .
For $\sqrt{x^2+1}$ to be defined, the expression under the square root must be non-negative: $x^2+1 \ge 0$ .
Since $x^2 \ge 0$ for all real $x$ , $x^2+1 \ge 1$ for all real $x$ .
Thus, $\sqrt{x^2+1}$ is defined for all real numbers.
The domain of $(f \circ g)(x)$ is $(-\infty, \infty)$ ."
:::

:::question type="NAT" question="If $f(x) = x^3 - 2$ , find the value of $f^{-1}(6)$ ." answer="2" hint="First, find the inverse function $f^{-1}(x)$ . Then, substitute the given value into the inverse function." solution="To find the inverse function $f^{-1}(x)$ , let $y = x^3 - 2$ .
Swap $x$ and $y$ : $x = y^3 - 2$ .
Solve for $y$ :
$y^3 = x+2$
$y = \sqrt[3]{x+2}$
So, $f^{-1}(x) = \sqrt[3]{x+2}$ .
Now, substitute $x=6$ into $f^{-1}(x)$ :
$f^{-1}(6) = \sqrt[3]{6+2} = \sqrt[3]{8} = 2$ ."
:::

:::question type="MCQ" question="Which of the following functions is invertible over its natural domain?" options=[" $f(x) = x^2 - 4x + 3$ "," $f(x) = |x-2|$ "," $f(x) = \frac{1}{x^2+1}$ "," $f(x) = \sqrt[3]{x-1}$ "] answer=" $f(x) = \sqrt[3]{x-1}$ " hint="A function is invertible if and only if it is bijective (one-to-one and onto). Consider the graph or properties of each function." solution="A function is invertible if it is bijective (injective and surjective).

f(x) = x^2 - 4x + 3

: This is a parabola opening upwards. It fails the horizontal line test (e.g.,

f(1) = 0

and

f(3) = 0

), so it is not injective. Not invertible.

f(x) = |x-2|

: This is a V-shaped graph. It fails the horizontal line test (e.g.,

f(1) = 1

and

f(3) = 1

), so it is not injective. Not invertible.

f(x) = \frac{1}{x^2+1}

: This function has

f(-1) = \frac{1}{2}

and

f(1) = \frac{1}{2}

, so it is not injective. Not invertible.

f(x) = \sqrt[3]{x-1}

: This is a cube root function, which is strictly increasing over its entire domain

\mathbb{R}

. It is both injective and surjective over

\mathbb{R}

, thus it is bijective and invertible."
:::

:::question type="MCQ" question="Let $f(x) = 2x+1$ . Find the expression for $f^3(x)$ ." options=[" $6x+3$ "," $8x+7$ "," $2x+7$ "," $4x+5$ "] answer=" $8x+7$ " hint="Calculate $f^2(x) = f(f(x))$ first, then use that result to calculate $f^3(x) = f(f^2(x))$ ." solution="We calculate the iterations step-by-step:
$f^1(x) = f(x) = 2x+1$
$f^2(x) = f(f(x)) = f(2x+1) = 2(2x+1)+1 = 4x+2+1 = 4x+3$
$f^3(x) = f(f^2(x)) = f(4x+3) = 2(4x+3)+1 = 8x+6+1 = 8x+7$ ."
:::

What's Next?

💡 Continue Your CMI Journey

Understanding operations on functions is a cornerstone for advanced topics in algebra and pre-calculus. The concepts explored here, particularly domain and range considerations for composite and inverse functions, will be crucial when studying more complex function types, such as polynomial, rational, exponential, and logarithmic functions. Furthermore, a solid grasp of inverse functions is fundamental for calculus, especially when dealing with implicit differentiation and derivatives of inverse trigonometric functions.