Skip to content
Worked Examples · Example 15

Q.Let f:{2,3,4,5}→{3,4,5,9}f: \{2, 3, 4, 5\} \to \{3, 4, 5, 9\} and g:{3,4,5,9}→{7,11,15}g: \{3, 4, 5, 9\} \to \{7, 11, 15\} be functions defined as f(2)=3f(2) = 3, f(3)=4f(3) = 4, f(4)=f(5)=5f(4) = f(5) = 5 and g(3)=g(4)=7g(3) = g(4) = 7 and g(5)=g(9)=11g(5) = g(9) = 11. Find gofgof.

Sikkim CbseNCERTSubjective· 3mImportance★★★★★
41% · 43/104 Questions
✓ Free question

The composite function g∘fg \circ f is defined only for inputs whose ff-image lies in the domain of gg. Here, g∘f={(2,7),(3,7),(4,11),(5,11)}g \circ f = \{(2,7), (3,7), (4,11), (5,11)\}.

Why this approach works

When you compose two functions, you're essentially applying one after the other: first ff, then gg. But there's a catch — the output of ff must be a valid input for gg. That means the range of ff (the set of all values ff actually produces) must be a subset of the domain of gg (the set of values gg can accept). If any f(x)f(x) lands outside gg's domain, then g(f(x))g(f(x)) is simply not defined for that xx.

Here, both functions are given explicitly as finite sets of ordered pairs, so we can compute g(f(x))g(f(x)) for each xx in the domain of ff by direct substitution — but we must check each time that f(x)f(x) actually belongs to the domain of gg.

Watch out

A common mistake is to assume g∘fg \circ f is defined for all elements of ff's domain. Always verify that every f(x)f(x) lies in the domain of gg before writing the composite.

Step-by-step computation

1. Identify the domains and ranges

  • Domain of ff: {2,3,4,5}\{2, 3, 4, 5\}
  • Codomain of ff: {3,4,5,9}\{3, 4, 5, 9\} (but the actual range is {3,4,5}\{3, 4, 5\} since f(4)=f(5)=5f(4)=f(5)=5)
  • Domain of gg: {3,4,5,9}\{3, 4, 5, 9\}
  • Codomain of gg: {7,11,15}\{7, 11, 15\}

Notice that every value in the range of ff — namely 3,4,53, 4, 5 — is indeed in the domain of gg. So g∘fg \circ f will be defined for all x∈{2,3,4,5}x \in \{2,3,4,5\}.

2. Compute g(f(2))g(f(2))

f(2)=3f(2) = 3. Now g(3)=7g(3) = 7. So g(f(2))=7g(f(2)) = 7.

3. Compute g(f(3))g(f(3))

f(3)=4f(3) = 4. Then g(4)=7g(4) = 7. So g(f(3))=7g(f(3)) = 7.

4. Compute g(f(4))g(f(4))

f(4)=5f(4) = 5. Then g(5)=11g(5) = 11. So g(f(4))=11g(f(4)) = 11.

5. Compute g(f(5))g(f(5))

f(5)=5f(5) = 5. Then g(5)=11g(5) = 11. So g(f(5))=11g(f(5)) = 11.

6. Write the composite as a set of ordered pairs

The composite g∘fg \circ f is the function from {2,3,4,5}\{2,3,4,5\} to {7,11,15}\{7,11,15\} given by:

g∘f={(2,7),(3,7),(4,11),(5,11)}g \circ f = \{(2,7), (3,7), (4,11), (5,11)\}

Tip

Notice that g∘fg \circ f is not one-to-one: both 22 and 33 map to 77, and both 44 and 55 map to 1111. This is fine — composites can lose injectivity even if the individual functions are injective (though here gg itself is not injective either).

✓Final answer

The composite function is g∘f={(2,7),(3,7),(4,11),(5,11)}g \circ f = \{(2,7), (3,7), (4,11), (5,11)\}.

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.