Identity, Inverse, and Composite Functions

Functions Can Act on One Another

So far, we have treated a function mainly as a mapping from inputs to outputs.

Now we take the next step: functions themselves can be combined.

Suppose

and

An input can first pass through \(f\), producing an element of \(B\), and then pass through \(g\), producing an element of \(C\).

That chained mapping is called a composition.

If a function can be reversed perfectly, the reversing function is its inverse.

And if a function sends every element to itself, it is an identity function.

Together, these ideas let us describe doing something, undoing it, and doing nothing at all.

Identity Functions

An identity function leaves every input unchanged.

On a set \(A\), the identity function is commonly written

and defined by

For the real numbers, we may write

Why Identity Matters

The identity function plays a role similar to identity elements in arithmetic.

Adding \(0\) leaves a number unchanged:

Multiplying by \(1\) leaves a number unchanged:

Likewise, composing with an identity function leaves a compatible function unchanged.

and

when

Identity functions therefore provide the neutral element for composition.

Composite Functions

Suppose

and

The composition of \(g\) with \(f\) is written

It means:

Apply \(f\) first, then apply \(g\).

Formally,

The composite function maps directly from \(A\) to \(C\):

Example

Let

and

Then

Substitute \(f(x)=2x+1\) into \(g\):

Therefore,

Order of Composition

Composition is generally not commutative.

That means

and

usually produce different functions.

Using

and

we found

Now reverse the order:

Since

we obtain

Thus

in general.

Read from Right to Left

The notation

is easiest to read operationally from right to left:

This is similar to nested parentheses: the inside operation happens first.

Domain and Codomain Compatibility

Not every pair of functions can be composed in every order.

For

to make sense, outputs from \(f\) must be valid inputs for \(g\).

If

and

the match is automatic because \(f\) lands in the set from which \(g\) accepts inputs.

A More General Condition

Composition can still work when the entire codomain of \(f\) is not literally the domain of \(g\), provided the outputs that actually occur lie inside the domain of \(g\).

A practical condition is

Whenever this condition holds,

is defined for every permitted input \(x\) of \(f\).

Example

Suppose

and

Although \(\sqrt{x}\) is not real-valued for negative real inputs, the outputs of \(f(x)=x^2\) are always nonnegative.

Therefore,

is defined for every real \(x\).

Evaluating Composite Functions

A composite can be evaluated one stage at a time.

Suppose

and

Find

First evaluate \(f\):

Then apply \(g\):

Therefore,

Equivalent Direct Substitution

We could also first find the composite rule:

Then substitute \(x=4\):

Both methods describe the same mapping.

Inverse Functions

An inverse function reverses the action of a function.

If

then the inverse satisfies

In mapping form,

becomes

The domain and codomain switch roles.

If

is bijective, then

Inverse as Reversed Ordered Pairs

If a function contains the ordered pair

its inverse contains

This matches the earlier definition of inverse relations, with one important addition: for the inverse relation to be a function on the entire codomain, the original function must be bijective.

When Does an Inverse Function Exist?

A function has an inverse function from its entire codomain back to its entire domain exactly when it is bijective.

That means the function must be both injective and surjective.

Why Injectivity Is Required

Suppose

and

with

Reversing the mapping would require

and

One input to the inverse would have two different outputs, so the inverse would fail to be a function.

Why Surjectivity Is Required

If some element of the codomain is never reached by \(f\), then after reversing the direction that element would become an input with no output.

Therefore a full inverse

requires every element of \(B\) to be reached.

Finding an Inverse Algebraically

For a bijective real-valued function written as

a standard algebraic method is:

1. write \(y=f(x)\),
2. interchange \(x\) and \(y\),
3. solve for \(y\),
4. rename the result \(f^{-1}(x)\).

Example

Let

Write

Swap \(x\) and \(y\):

Solve for \(y\):

Therefore,

Interpretation

The original function multiplies by \(3\) and then adds \(5\).

The inverse reverses those operations in reverse order:

• subtract \(5\),
• then divide by \(3\).

This “undo in reverse order” idea is a useful practical way to think about inverse functions.

Inverse and Identity Relationships

A function and its inverse undo one another.

If

is bijective, then

Composing first with \(f\) and then with \(f^{-1}\) returns the original element of \(A\):

Likewise, composing first with \(f^{-1}\) and then with \(f\) returns the original element of \(B\):

Element-by-Element View

If

then

If

then

These equations are the cleanest algebraic expression of the idea that inverse functions undo one another.

Inverse Function versus Reciprocal

The notation

does not mean the reciprocal of \(f\).

The reciprocal of a function value is

The inverse function is

These are different concepts.

Example

Let

The reciprocal expression is

But the inverse function is found by reversing the mapping:

Therefore,

in general.

The superscript \(-1\) indicates inverse mapping here, not numerical reciprocal.

Graphs of Inverse Functions

If

belongs to the graph of \(f\), then

belongs to the graph of \(f^{-1}\).

So the coordinates are exchanged.

Geometrically, exchanging \(x\) and \(y\) reflects a graph across the line

Therefore, the graphs of a function and its inverse are mirror images across

Why the Horizontal-Line Test Appears

A function must pass the vertical-line test.

After reflection across \(y=x\), vertical and horizontal directions switch.

Therefore, the original function must pass the horizontal-line test if its inverse relation is to pass the vertical-line test and become a function.

This is the graphical connection between injectivity and invertibility.

Longer Function Chains

Composition can involve more than two functions.

If

then we may form

Operationally,

Composition is associative:

So we do not need to worry about how a chain of compositions is grouped, provided the domain and codomain connections are valid.

Order Still Matters

Associativity does not mean commutativity.

We may regroup compatible compositions, but we may not generally reverse their order.

Practical Applications

Unit Conversion Chains

Suppose one function converts miles to kilometers and another converts kilometers to meters.

Their composition converts miles directly to meters.

The composite function packages the full conversion into one mapping.

Data Processing Pipelines

A software pipeline might

• parse raw input,
• normalize the data,
• calculate a result,
• format the output.

Each stage can be viewed as a function, and the complete pipeline as a composition of functions.

Encoding and Decoding

If an encoding function is bijective, a decoding function can act as its inverse.

This is the same structural idea as doing and undoing a reversible transformation.

Pricing and Tax

Suppose

calculates a base price from quantity \(q\), while

adds tax to a price \(x\).

Then

calculates the final taxed price directly from the quantity.

Coordinate Transformations

Geometric transformations such as translations, rotations, reflections, and scalings can often be composed.

If each transformation is invertible, the entire chain can be undone by applying the inverse transformations in reverse order.

Worked Examples

Example 1: Find a Composite Rule

Let

and

Then

So

Therefore,

Example 2: Reverse the Composition

Using the same functions,

Therefore,

So

Example 3: Evaluate a Composite

Let

Find

First,

Then,

Therefore,

Example 4: Find an Inverse

Let

Write

Swap \(x\) and \(y\):

Solve:

Thus

Example 5: Verify an Inverse

Using

and

compute

Therefore,

Example 6: Restrict Before Inverting

The function

is not injective, so it does not have an inverse function on all real inputs.

Restrict the domain:

Now \(g\) is bijective, and its inverse is

The domain restriction removes the ambiguity between positive and negative square roots.

Common Errors

1. Applying Composition in the Wrong Order

In

apply \(f\) first and \(g\) second.

2. Assuming Composition Is Commutative

In general,

3. Ignoring Domain Compatibility

The outputs of the first function must be valid inputs for the second.

4. Assuming Every Function Has an Inverse Function

A full inverse function requires bijectivity.

A non-injective function produces ambiguity when reversed, and a non-surjective function leaves some reversed inputs unmapped.

5. Confusing \(f^{-1}(x)\) with \(1/f(x)\)

Inverse functions and reciprocals are different concepts.

6. Swapping \(x\) and \(y\) without Checking Invertibility

The algebraic swap-and-solve procedure can produce an inverse relation even when the original function is not one-to-one.

Before calling the result an inverse function, verify that the original mapping is invertible on the stated domain and codomain.

7. Forgetting to Reverse the Order of Operations

If a function performs several reversible operations in sequence, its inverse must undo them in reverse order.

Practice

Composition

Let

and

Find:

1. \((g\circ f)(x)\)
2. \((f\circ g)(x)\)

Evaluate a Composite

Let

and

Find

Find an Inverse

Find the inverse of

Verify the Identity

Using

and

show that

Inverse or Reciprocal?

Let

Write:

1. the reciprocal expression \(1/f(x)\),
2. the inverse function \(f^{-1}(x)\).

The Deeper Idea

Identity, inverse, and composition give functions an algebraic structure of their own.

Composition lets mappings be chained:

Identity leaves a mapping unchanged:

An inverse reverses a suitable mapping:

These ideas echo familiar arithmetic structure:

• identity elements leave something unchanged,
• inverse operations undo one another,
• and composition combines operations into a larger process.

But functions make the structure more general because the objects being moved can be numbers, points, vectors, matrices, sets, records, geometric figures, or other mathematical objects.

This viewpoint will become increasingly important in transformations, algebraic structures, matrices, calculus, and higher mathematics.

Summary

• The identity function on \(A\) is \[ \operatorname{id}_A(a)=a. \]
• For \[ f:A\to B, \] identity composition satisfies \[ f\circ\operatorname{id}_A=f \] and \[ \operatorname{id}_B\circ f=f. \]
• The composition of \(g\) with \(f\) is \[ (g\circ f)(x)=g(f(x)). \]
• In \(g\circ f\), apply \(f\) first and \(g\) second.
• Composition is generally not commutative: \[ g\circ f\neq f\circ g. \]
• Composition is associative: \[ h\circ(g\circ f)=(h\circ g)\circ f. \]
• For \(g\circ f\) to be defined, outputs of \(f\) must be valid inputs for \(g\).
• A bijective function \[ f:A\to B \] has an inverse \[ f^{-1}:B\to A. \]
• The inverse reverses ordered pairs and mappings.
• A function and its inverse satisfy \[ f^{-1}\circ f=\operatorname{id}_A \] and \[ f\circ f^{-1}=\operatorname{id}_B. \]
• The inverse-function notation \[ f^{-1}(x) \] does not mean \[ \frac{1}{f(x)}. \]
• The graphs of a function and its inverse are reflections across \[ y=x. \]

Identity, inverse, and composition turn functions from isolated rules into a system of reusable mappings. We can chain functions into larger processes, recognize when a mapping can be reversed, and use identity functions to describe when nothing has changed.

Sets, Relations, and Functions

• Previous: Injective, Surjective, and Bijective Functions
• Sets, Relations, and Functions — return to the lesson directory.