In the conventional calculus track, monotonicity is reduced to a sign check: if , the function increases. For the aspirant targeting the top 0.01% — JEE Advanced, ISI, CMI, or Putnam — this simplification is dangerously incomplete. Functions may be strictly increasing at a point while decreasing in every neighborhood of that point. They may be continuous and monotone yet have a derivative of zero almost everywhere.
To master monotonicity at this level is to master the tension between algebraic rigidity and topological flexibility.
I. What Does “Increasing” Actually Mean?
The most persistent misconception in competitive mathematics — and the source of many counterexamples on the Putnam — is the conflation of “increasing at a point” with “increasing on an interval.”
A function is said to be increasing at a point if there exists a neighborhood such that:
- If , then .
- If , then .
Strict monotonicity replaces and with and .
A function is increasing on an interval if for every pair with , we have .
A fundamental result: if a function is increasing at every point in an open interval, it is increasing on the interval. However, the converse relationship via derivatives is where the traps lie.
The Positive Derivative Trap
It is true that if for all , then is strictly increasing on .
It is false that if at a specific point , then is increasing in some neighborhood of .
Consider this pathological function, a favourite in advanced analysis courses:
At , the derivative via first principles:
Strictly positive. Yet for :
As , the term oscillates violently between and . The derivative frequently becomes negative arbitrarily close to zero. The function is not increasing on any open interval containing , despite .
Why 'f'(c) > 0 ⟹ Increasing Near c' Fails
The intuition ” means the function is rising, so it must go up near ” conflates instantaneous rate with interval behavior. The derivative guarantees for slightly less than and for slightly greater — but only relative to . It does not preserve the order between two arbitrary points near . The oscillation of can reverse the ordering between nearby points even while the function climbs through itself.
So when does a vanishing derivative not destroy strict monotonicity? The answer is beautiful in its simplicity:
is strictly increasing on if for all AND the set of points where is discrete (does not contain any interval).
Stationary points do not break strict monotonicity unless they form a plateau. This distinction — between an isolated zero and a flat segment — is the key shortcut.
Let . Is strictly increasing on ?
View Solution
- for all .
- only at — a single point, which is a discrete set.
- Since does not contain any interval, the Discrete Zero Theorem applies.
- Conclusion: is strictly increasing on .
This seemingly trivial result illustrates a critical principle. The same argument extends to , , and many composite functions where the derivative vanishes at isolated points.
II. Darboux’s Theorem: The Hidden Power of Derivatives
A common misconception is that derivatives must be continuous. They need not be. But Jean Gaston Darboux proved that they possess something almost as powerful.
Let be a differentiable real-valued function on . If is any value between and , then there exists some such that .
In elementary calculus, the Intermediate Value Theorem applies to continuous functions. Darboux shows that derivatives — even wildly discontinuous ones — automatically satisfy the IVT. This has profound consequences:
1. Non-Jump Discontinuities: A derivative cannot have a simple jump discontinuity. If exists everywhere, it cannot jump from 1 to 2 without passing through all intermediate values. The only possible discontinuities of a derivative are oscillatory (like ).
2. Sign Preservation: If for all , then must maintain a constant sign throughout . This allows us to conclude strict monotonicity by checking at a single convenient point, provided we can show never vanishes. This technique appears routinely in ISI/CMI subjective problems.
3. Root Counting: Combined with Rolle’s Theorem, if takes values of opposing sign, an intermediate zero must exist — even if is discontinuous.
Error: Assuming everywhere implies .
Correction: has everywhere but is bounded. Monotonicity implies direction, not unbounded growth. Always check for asymptotes.
Is there a strictly increasing function such that for all ?
View Solution
Step 1 — Initial Deductions: If is strictly increasing, then must be non-negative, so . Since is strictly increasing, is also strictly increasing (composition of increasing functions), so is increasing. This implies is convex.
Step 2 — Growth Analysis: If for large (with ), then:
This implies super-linear growth in , hence super-quadratic growth in , which feeds back into even faster growth of . The growth rate escalates without bound.
Step 3 — Rigorous Contradiction: Assume for large . Then , so . Integrating:
But then , so . Integrating yields , making grow faster still. This cascade produces a contradiction — no smooth function can sustain this feedback loop.
Step 4 — The Slow Growth Case: If for large , similar bounding arguments show becomes too small to equal .
Conclusion: No such function exists.
III. The Domain Paradox: Disjoint Intervals
When a function’s domain is a union of disjoint intervals, the standard derivative test becomes dangerously incomplete. This is one of the most commonly missed traps in JEE Advanced.
When a domain is with to the left of , the function is increasing on if and only if:
- is increasing on ,
- is increasing on , and
- The Jump Condition: .
For piecewise functions or unions of intervals, explicitly checking boundary values is a mandatory step that most students skip.
The classic trap: on . We have everywhere — the derivative is negative throughout. But and , so despite . The function is not decreasing on its full domain.
Let . Discuss the monotonicity of on its domain.
View Solution
Step 1 — Domain: is defined for . Domain is .
Step 2 — Derivative:
Step 3 — Sign Analysis:
- always.
- when , and when (and ).
Step 4 — Monotonicity on Each Piece:
- Decreasing on (since throughout).
- Decreasing on .
- Increasing on .
Step 5 — The Jump Condition Check: Is decreasing on ?
- (the term dominates).
- .
- The function “resets” from to across the discontinuity.
Conclusion: is decreasing on and decreasing on separately. It is not monotonic on .
IV. Inequality Stripping & Functional Equations
For strictly monotonic functions, functional inequalities can be algebraically “stripped” — but only with extreme care about domains.
- If is strictly increasing:
- If is strictly decreasing: (inequality reversal)
Critical: Always verify the domain constraint first — and must both lie in the domain of before stripping. This is the step most students omit, and the step problem-setters exploit.
Solve for : given that is a strictly decreasing function defined on .
View Solution
Step 1 — Monotonicity Reversal: Since is strictly decreasing, strip and reverse:
This gives , so or .
Step 2 — Domain Constraints: Both inputs must lie in :
- .
- or .
- Intersection: .
Step 3 — Final Answer:
- Algebraic solution: or .
- Domain constraint: .
- Answer: .
Forgetting Domain Constraints
A common error is to answer ” or ” without checking that inputs to lie in its domain . Since , the entire left branch is eliminated. This is exactly the kind of trap JEE Advanced setters design.
For problems asking “find the set of values of parameter for which is monotonic”:
- Require (or ) for all in the domain.
- Separate variables: rewrite as or .
- The condition holds iff or .
- This transforms a calculus problem into an algebraic optimisation problem.
Example: Find such that is increasing on . The condition for all reduces to discriminant : , giving .
The Involution Integral (ISI B.Math 2016)
A beautiful problem that combines monotonicity deduction with integration:
Let be differentiable with for all and . Evaluate .
Hint: What kind of function satisfies f(f(x)) = x?
is an involution — it is its own inverse. What does this imply about monotonicity and the graph’s symmetry?
View Solution
Step 1 — Monotonicity Deduction: Since , the function is injective (one-to-one), hence strictly monotone.
Step 2 — Direction: . Apply : . Since , is strictly decreasing.
Step 3 — Symmetry: means the graph of is symmetric about the line .
Step 4 — The Elegant Invariance Argument: Since is its own inverse (), we use the geometric identity: for any strictly monotone bijection with :
This is because the graph of and together tile the rectangle .
Here and , so:
This result holds for any such involution — not just .
V. The Topology of Monotone Functions
We now turn to the deep structural results that constrain how monotone functions can behave — or misbehave.
Froda’s Theorem: Counting Discontinuities
The set of discontinuities of a monotone function defined on an interval is at most countable. Furthermore, all such discontinuities must be jump discontinuities (discontinuities of the first kind).
Proof Sketch: Let be monotonically increasing on . At each discontinuity , the left and right limits exist with . Associate each discontinuity with the open interval in the range. Since is monotone, these intervals are disjoint. Each contains a distinct rational number (by density of ), and the rationals are countable.
- Impossibility Arguments: If a problem describes a monotonic function with an uncountable set of discontinuities, it cannot exist.
- Almost Everywhere Continuity: Monotone functions are continuous except at countably many points. By Lebesgue’s theorem, they are differentiable almost everywhere.
- Synthesis Problems: When constructing a monotone function with specific properties, Froda guarantees you can only prescribe countably many jumps.
Error: If for all , then everywhere.
Correction: This holds only for continuous . A discontinuous can be negative on a set of measure zero without affecting the integral. The correct conclusion is almost everywhere.
Dini’s Theorem: From Pointwise to Uniform
If a monotone sequence of continuous functions converges pointwise to a continuous function on a compact set , then the convergence is uniform.
This allows the interchange of limits and integrals: . In competition problems with sequences of functions, establishing monotonicity in is often the “hidden step” required to justify this swap.
Error: If is a sequence of strictly increasing functions converging to , then is strictly increasing.
Correction: Limits only preserve weak inequalities. Example: is strictly increasing for all , but is constant.
Heuristic: When taking limits of monotonic functions, always relax strict to weak .
Sequences: Where Analysis Meets Algebra
Let . Determine the maximum term and the limit.
View Solution
Step 1 — Continuise: Define and let .
Step 2 — Differentiate:
Step 3 — Critical Point: .
Step 4 — Monotonicity:
- for → increases.
- for → decreases.
Step 5 — Integer Comparison: Maximum at or :
- Check: ✓
Step 6 — Convergence: For , the sequence is decreasing and bounded below by 1. By the Monotone Convergence Theorem:
Let be positive reals with and . Show both sequences converge to the same limit.
Hint: AM-GM
What does the AM-GM inequality tell you about vs ? Which sequence is increasing and which is decreasing?
View Solution
Step 1 — AM-GM: , so for all .
Step 2 — is Decreasing: Since :
Step 3 — is Increasing: Since :
Step 4 — Bounded: is decreasing, bounded below by . is increasing, bounded above by .
Step 5 — Convergence: By the Monotone Convergence Theorem, both converge. Let , :
Both converge to the arithmetic-geometric mean .
VI. Monotonicity Across Mathematics
The Erdős–Szekeres Theorem reveals that monotonicity is not merely a calculus concept — it is a universal structural phenomenon.
The Erdős–Szekeres Theorem
Prove that any sequence of distinct real numbers contains a monotone subsequence of length .
View Solution
The Pigeonhole Synthesis:
For each element , assign the pair where:
- = length of the longest increasing subsequence ending at .
- = length of the longest decreasing subsequence ending at .
Assume no monotone subsequence of length exists. Then and for all , giving at most distinct pairs.
Since there are elements, by the Pigeonhole Principle, two indices share the same pair.
Contradiction:
- If : extends the increasing subsequence ending at , so . Contradicts .
- If : extends the decreasing subsequence, so . Contradicts .
Since elements are distinct, one case must hold.
Cross-Connections
Erdős’s Theorem: If a multiplicative function is monotonically increasing, it must be of the form for some . The algebraic structure (multiplicativity) combined with order structure (monotonicity) forces the function into an extremely narrow form — a beautiful example of algebraic rigidity.
In solving , if is monotone in , we can construct upper and lower solutions that squeeze the actual solution — the Monotone Iterative Method. The convergence relies on the Monotone Convergence Theorem, connecting pure analysis to computational trajectories.
Selected Problems
(Putnam 1968 B6 variant): Let be continuous. Suppose that for every , there exists such that is monotone on . Prove that is monotone on .
Hint
(ISI B.Math Style): Let be strictly increasing on and continuous on . Prove that is strictly increasing on .
Hint
(Erdős–Szekeres Extension): Construct a permutation of that has no increasing or decreasing subsequence of length .
Hint
(Functional Monotonicity): Find all such that for all and is monotonically increasing.
Hint
(Discontinuous Derivative): Prove that if is differentiable on and is monotonic, then must be continuous.
Hint
(Sequence Limits): Evaluate .
Hint
(Functional Equation): Find all continuous satisfying and for all .
Hint
(Inverse Integration): Let be strictly increasing, continuous, with . Prove:
Geometric Hint
Challenge Problem
The Devil’s Slide
Let be the Cantor function (Devil’s Staircase). It is continuous, non-decreasing, surjective, with , , and almost everywhere — yet it is not constant.
Part (a): The Cantor function has plateaus (it is not strictly increasing). Construct a modification that is:
- Strictly increasing,
- Singular ( almost everywhere),
- A homeomorphism of to itself.
Part (b): Prove that such a maps a set of Lebesgue measure 0 to a set of Lebesgue measure 1.