UG Mathematics Booster Test 3 - Composition and Invertibility
📌 Answers are locked once submitted — results and explanations appear at the end.
QUESTION 1 OF 20
Let \(f\) and \(g\) be two mappings. If the composite function \(f\circ g\) is one-one, what can be concluded?
QUESTION 2 OF 20
Identify the correct statements regarding the domain of \(f\circ g\), given functions \(f\) and \(g\):
(i) \(x\in\) Domain of \(g\)
(ii) \(g(x)\in\) Domain of \(f\)
(iii) \(x\in\) Range of \(f\)
QUESTION 3 OF 20
Let \(f\) and \(g\) be functions. Which statement is incorrect?
QUESTION 4 OF 20
Question (Match the Following):
| List I | List II |
|---|---|
| 1. Minimum of \(f\circ g\) | a. 0 |
| 2. Minimum of \(g\circ f\) | b. -1 |
| 3. Value of \(f(g(0))\) | c. 0 |
| 4. Value of \(g(f(0))\) | d. -1 |
QUESTION 5 OF 20
(Case/Numerical):
Let \(f(x)=ax+b\) and \(g(x)=cx+d\). For \(f\circ g=g\circ f\), what condition must hold?
QUESTION 6 OF 20
When do regions defined by \(f(g(x))\)and \(g(f(x))\)coincide?
QUESTION 7 OF 20
A sequence undergoes a moving average transformation. Is this transformation globally invertible to uniquely recover the original sequence?
QUESTION 8 OF 20
Let \(A\) be a finite set. A function is chosen randomly from all possible functions \(A\rightarrow A\). What is the probability that it is invertible?
QUESTION 9 OF 20
A 2D linear transformation is given by
\(T(x,y)=(ax+by, cx+dy)\)
with non-zero determinant. What is the inverse transformation?
QUESTION 10 OF 20
What is the relationship between the area under a function \(f\) and the area under its inverse \(f^{-1}\)over corresponding intervals?
QUESTION 11 OF 20
\(\int_{-a}^{a}\,f(x) dx\)
QUESTION 12 OF 20
QUESTION 13 OF 20
QUESTION 14 OF 20
Assertion (A): A polynomial function is onto.
Reason (R): Its derivative is non-negative.
QUESTION 15 OF 20
Arrange steps to find inverse of an exponential function:
1. Substitute \(y=a^{x}\)
2. Isolate base
3. Apply logarithm
4. Swap variables
QUESTION 16 OF 20
To verify that a rational function is its own inverse (self-invertible), one must:
QUESTION 17 OF 20
If \(g\circ f=I\) for functions between two finite sets, what constraint is imposed on their sizes?
QUESTION 18 OF 20
If \(f\circ g=I\) and \(f\) is onto, what is the relation between cardinalities?
QUESTION 19 OF 20
The functional equation
\(f(xy)=f(x)+f(y)\)
characterizes:
QUESTION 20 OF 20
In cryptography, for encryption \(E\) and decryption \(D\), which must hold?
Test Complete!
Answer Review
1 Let \(f\) and \(g\) be two mappings. If the composite function \(f\circ g\) is one-one, what can be concluded?
Injectivity of composition depends on inner mapping Distinct inputs must remain distinct through \(g\) Hence \(g\) must be injective
If \(f\circ g\) is one-one, then different inputs cannot produce the same intermediate value through \(g\). Suppose \(g(x_{1})=g(x_{2})\). Then: \(f(g(x_{1}))=f(g(x_{2}))\) which contradicts injectivity unless \(x_{1}=x_{2}\). Thus \(g\) must necessarily be one-one.
- Option A → \(f\) need not be injective on its entire domain.
- Option B → Onto property is unrelated here.
- Option D → Surjectivity of \(f\) is unnecessary for injectivity of composition.
Used: Elimination
Application:
- Check which property directly preserves distinct inputs.
Final Logic:
- Inner function must avoid collapsing distinct elements.
"Injective composition protects inputs"
2 Identify the correct statements regarding the domain of \(f\circ g\), given functions \(f\) and \(g\):
(i) \(x\in\) Domain of \(g\)
(ii) \(g(x)\in\) Domain of \(f\)
(iii) \(x\in\) Range of \(f\)
Input must belong to domain of \(g\) Output of \(g\) must enter domain of \(f\) Range of \(f\) is irrelevant
For composition: \(\left(f\circ g)(x)=f(g(x)\right)\) to exist, \(x\) must first belong to the domain of \(g\). Then the value \(g(x)\)must lie inside the domain of \(f\). Thus both conditions (i) and (ii) are required.
- Option A → Ignores compatibility with domain of \(f\).
- Option B → Input must first belong to domain of \(g\).
- Option C → Range of \(f\) has no role in defining composition domain.
Used: Contextual/Tonal Matching
Application:
- Follow the order of evaluation in composition.
Final Logic:
- Input enters \(g\) first, then \(f\).
"First \(g\), then \(f\)"
3 Let \(f\) and \(g\) be functions. Which statement is incorrect?
Composition may fail for some inputs Domain depends on compatibility Not always defined universally
The composition \(f\circ g\) exists only when: \(g(x)\in Domain of f\) for the chosen input \(x\). Therefore it is incorrect to claim composition is always defined for all values of \(x\).
- Option B → Can hold for suitable functions.
- Option C → Some compositions indeed have full real domains.
- Option D → Correctly describes domain restrictions.
Used: Extreme Word Filter
Application:
- The phrase "for all \(x\)" signals overgeneralization.
Final Logic:
- Composition depends on domain compatibility.
"Composition needs permission"
4 Question (Match the Following):
| List I | List II |
|---|---|
| 1. Minimum of \(f\circ g\) | a. 0 |
| 2. Minimum of \(g\circ f\) | b. -1 |
| 3. Value of \(f(g(0))\) | c. 0 |
| 4. Value of \(g(f(0))\) | d. -1 |
Matching follows composite evaluation Minimum values differ by order Composition is order-sensitive
The correct arrangement aligns each composition and evaluated value with its corresponding minimum or numerical result. Since \(f\circ g\neq g\circ f\) generally, their outputs and minimum values differ accordingly.
- Option A → Interchanges evaluated values incorrectly.
- Option C → Swaps minima and outputs inconsistently.
- Option D → Composition order is mismatched.
Used: Option Grouping
Application:
- Track each composition carefully and compare outputs.
Final Logic:
- Composition order determines mapping outcomes.
"Order changes answers"
5 (Case/Numerical):
Let \(f(x)=ax+b\) and \(g(x)=cx+d\). For \(f\circ g=g\circ f\), what condition must hold?
Equal compositions require identical coefficients Compare expanded forms Coefficients must match termwise
Compute: \(f(g(x))=a(cx+d)+b=acx+ad+b\) and \(g(f(x))=c(ax+b)+d=acx+bc+d\) For equality for all \(x\): \(ad+b=bc+d\) The strongest matching condition among options is \(a=c\) and \(b=d\).
- Option A → Equal slopes alone are insufficient.
- Option B → Equal constants alone do not ensure commutativity.
- Option C → Only partial coefficient condition.
Used: Substitution
Application:
- Expand both compositions algebraically.
Final Logic:
- Equal functions require coefficient equality.
"Expand and compare"
6 When do regions defined by \(f(g(x))\)and \(g(f(x))\)coincide?
Same composition outputs imply commutativity Graphs overlap only when compositions equal Order independence is required
The regions defined by \(f(g(x))\)and \(g(f(x))\)coincide precisely when: \(f\circ g=g\circ f\) This property is called commutativity of composition.
- Option A → Zero functions are only special cases.
- Option B → Inverse functions need not produce identical compositions.
- Option C → Evenness is unrelated.
Used: Contextual/Tonal Matching
Application:
- Interpret equality of regions as equality of compositions.
Final Logic:
- Equal composite outputs imply commuting functions.
"Same graph = commute"
7 A sequence undergoes a moving average transformation. Is this transformation globally invertible to uniquely recover the original sequence?
Moving averages lose information Boundary data is needed Exact recovery is not automatic
A moving average combines neighboring values and removes some original information. Different sequences may produce the same averages unless an additional initial condition or boundary value is known. Hence global invertibility fails.
- Option A → Same averages can arise from different sequences.
- Option C → Differentiation alone cannot fully recover data.
- Option D → Moving averages are valid functions.
Used: Elimination
Application:
- Check whether unique reconstruction is guaranteed.
Final Logic:
- Loss of information prevents perfect inversion.
"Averages blur data"
8 Let \(A\) be a finite set. A function is chosen randomly from all possible functions \(A\rightarrow A\). What is the probability that it is invertible?
Invertible functions are permutations Total permutations equal \(n!\) Total functions equal \(n^{n}\)
For a finite set with \(n\) elements: • Total functions \(=n^{n}\) • Invertible functions \(=n!\) Hence probability: \(\frac{n!}{n^{n}}\)
- Option A → Invertible functions certainly exist.
- Option B → Not every function is invertible.
- Option D → Formula is incomplete and incorrect.
Used: Substitution
Application:
- Use counting principle for functions and permutations.
Final Logic:
- Probability equals favorable outcomes over total outcomes.
"Permutations are bijections"
9 A 2D linear transformation is given by
\(T(x,y)=(ax+by, cx+dy)\)
with non-zero determinant. What is the inverse transformation?
Matrix inverse formula applies Determinant must be non-zero Adjoint divided by determinant gives inverse
For matrix: \(A=\left[\begin{pmatrix}a & b\\ c & d\end{pmatrix}\right]\) if determinant \(ad-bc\neq 0\), then inverse exists and equals: \(A^{-1}=\frac{1}{ad-bc}\left[\begin{pmatrix}d & -b\\ -c & a\end{pmatrix}\right]\)
- Option B → Original matrix is not inverse generally.
- Option C → Incorrect inverse formula.
- Option D → Non-zero determinant guarantees invertibility.
Used: Formula Recall
Application:
- Apply standard inverse matrix formula.
Final Logic:
- Non-zero determinant ensures inverse transformation exists.
"Swap-diagonal, change signs"
10 What is the relationship between the area under a function \(f\) and the area under its inverse \(f^{-1}\)over corresponding intervals?
Function and inverse reflect about \(y=x\) Corresponding regions are symmetric Areas remain equal
Graphs of a function and its inverse are mirror images about the line: \(y=x\) Hence corresponding enclosed regions have equal area due to geometric symmetry.
- Option A → No general inequality exists.
- Option B → Inverse area is not necessarily zero.
- Option D → Symmetry does not imply cancellation.
Used: Contextual/Tonal Matching
Application:
- Use geometric interpretation of inverse functions.
Final Logic:
- Reflection symmetry preserves area.
"Inverse mirrors across \(y=x\)"
11
\(\int_{-a}^{a}\,f(x) dx\)
Odd functions show symmetry about origin Positive and negative areas cancel Integral over symmetric interval becomes zero
For an odd function: \(f(-x)=-f(x)\) The graph is symmetric about the origin. Over the interval \(\left[-a,a\right]\), the area above the x-axis equals the area below the x-axis in magnitude. Hence both cancel and: \(\int_{-a}^{a}\,f(x) dx=0\) Therefore Option A is correct.
- Option B → No unit-area condition is given.
- Option C → Odd symmetry causes cancellation, not doubling.
- Option D → No constant positive accumulation occurs.
Used: Contextual/Tonal Matching
Application:
- Recognize the standard odd-function integral property.
Final Logic:
- Odd functions integrate to zero over symmetric limits.
"Odd + symmetric limits = 0"
12
Composition acts as operation Identity function exists Every invertible function has inverse
Invertible functions under composition satisfy all group properties: • Closure under composition • Associativity • Identity mapping exists • Every element has an inverse Thus invertible functions from a set to itself form a group under composition.
- Option B → Rings require two operations.
- Option C → Fields need multiplication and addition inverses.
- Option D → Vector spaces require scalar multiplication structure.
Used: Option Grouping
Application:
- Match algebraic properties with standard structures.
Final Logic:
- Identity and inverses under composition imply group structure.
"Composition + inverse = group"
13
Many inputs share same output Function is not injective Horizontal line intersects repeatedly
The Greatest Integer Function maps all real numbers within an interval like \([1,2)\)to the same integer 1. Hence different inputs give identical outputs, violating injectivity. Functions \(x^{3}\), \(e^{x}\), and \(x\) are strictly monotonic and therefore one-one.
- Option A → \(x^{3}\)is strictly increasing on \(R\).
- Option B → Exponential functions are injective.
- Option C → Identity function is perfectly one-one.
Used: Elimination
Application:
- Check whether distinct inputs can share outputs.
Final Logic:
- Only GIF maps intervals to single values.
"Step functions fail one-one"
14 Assertion (A): A polynomial function is onto.
Reason (R): Its derivative is non-negative.
Not all polynomial functions are onto Derivative need not be non-negative Both statements fail generally
The assertion is false because not every polynomial is onto over \(R\rightarrow R\). Example: \(f(x)=x^{2}\) does not produce negative outputs. The reason is also false because polynomial derivatives may be positive, negative, or changing sign. Hence both statements are false.
- Option B → Assertion fails for even-degree polynomials.
- Option C → Derivative condition is incorrect generally.
- Option D → Reason is mathematically false.
Used: Extreme Word Filter
Application:
- The word "all" in polynomial behavior makes statement suspicious.
Final Logic:
- Counterexample \(x^{2}\)disproves the assertion.
"\(x^{2}\) misses negatives"
15 Arrange steps to find inverse of an exponential function:
1. Substitute \(y=a^{x}\)
2. Isolate base
3. Apply logarithm
4. Swap variables
Begin with exponential equation Isolate exponential term Apply logarithm and interchange variables
To find inverse of an exponential function: 1. Write \(y=a^{x}\) 2. Isolate the exponential expression 3. Apply logarithm 4. Swap variables to obtain inverse notation Thus the correct sequence is \(1,2,3,4\).
- Option A → Starts with swapping too early.
- Option B → Isolation step is skipped initially.
- Option D → Incorrect procedural arrangement.
Used: Contextual/Tonal Matching
Application:
- Follow the standard inverse-finding algorithm.
Final Logic:
- Equation setup precedes logarithmic simplification.
"Write → isolate → log → swap"
16 To verify that a rational function is its own inverse (self-invertible), one must:
Self-inverse means repeated application restores input Double composition becomes identity Composition test is sufficient
A function is self-invertible if: \(f(f(x))=x\) This means applying the function twice returns the original input. Therefore the correct verification method is composition with itself.
- Option B → Derivatives test monotonicity, not self-inverse property.
- Option C → Integration is unrelated here.
- Option D → Numerator roots do not establish inverses.
Used: Substitution
Application:
- Apply the function twice and simplify.
Final Logic:
- Identity after double application confirms self-inverse.
"Twice gives original"
17 If \(g\circ f=I\) for functions between two finite sets, what constraint is imposed on their sizes?
Left inverse implies injective mapping Injective maps require larger codomain Domain size cannot exceed codomain
If: \(g\circ f=I\) then \(f\) must be injective. For finite sets, an injective function from \(A\rightarrow B\) requires: \(∣A∣\leq ∣B∣\) Hence the size of the domain cannot exceed the codomain.
- Option A → Opposite inequality is incorrect.
- Option C → Injective functions cannot map larger finite sets into smaller ones.
- Option D → Finite cardinalities impose restrictions.
Used: Dimensional/Unit Analysis
Application:
- Compare sizes required for injective mappings.
Final Logic:
- Injectivity implies codomain size is at least domain size.
"One-one needs space"
18 If \(f\circ g=I\) and \(f\) is onto, what is the relation between cardinalities?
Right inverse implies surjective mapping Surjections need sufficiently large domain Domain size exceeds or equals codomain size
If: \(f\circ g=I\) then \(f\) has a right inverse and is onto. For finite sets, surjective mappings satisfy: \(∣A∣\geq ∣B∣\) since every codomain element must receive at least one pre-image.
- Option A → Surjections cannot map smaller sets onto larger sets.
- Option C → Equality is not always necessary.
- Option D → Finite sets impose definite restrictions.
Used: Elimination
Application:
- Use finite-set surjection principles.
Final Logic:
- Onto mappings require large enough domains.
"Onto needs coverage"
19 The functional equation
\(f(xy)=f(x)+f(y)\)
characterizes:
Product converts into sum Fundamental logarithmic identity Standard logarithm property
Logarithmic functions satisfy: \(log(xy)=logx+logy\) Hence the equation: \(f(xy)=f(x)+f(y)\) is the characteristic logarithmic property.
- Option A → Polynomials do not preserve multiplicative addition identities.
- Option B → Exponentials satisfy additive exponent laws differently.
- Option D → Modulus functions follow absolute value properties.
Used: Contextual/Tonal Matching
Application:
- Recognize classical logarithmic identity.
Final Logic:
- Product-to-sum behavior identifies logarithms.
"Multiply inside → add outside"
20 In cryptography, for encryption \(E\) and decryption \(D\), which must hold?
Decryption reverses encryption Composition restores original message Encryption and decryption are inverses
Encryption converts plaintext into ciphertext, while decryption reverses the process. Therefore: \(D(E(x))=x\) must hold for every valid message. This expresses inverse-function behavior used in cryptographic systems.
- Option A → Encryption alone need not reverse itself.
- Option B → Decryption alone is not self-inverse generally.
- Option C → Encryption and decryption are distinct operations.
Used: Contextual/Tonal Matching
Application:
- Interpret encryption-decryption as inverse mappings.
Final Logic:
- Decrypting encrypted data restores original input.
"Encrypt then decrypt = original"
