Lebl-Basic-Analysis-I · Problem 3.6.13

Continuous Functions

Mathematics · monotone-functions-continuity

Problem

Suppose f:[0,1]→(0,1)f : [0, 1] \to (0, 1) is increasing. Show that for every ϵ>0\epsilon > 0, there exists a strictly increasing g:[0,1]→(0,1)g : [0, 1] \to (0, 1) such that g(0)=f(0)g(0) = f(0), f(x)≤g(x)f(x) \leq g(x) for all xx, and g(1)−f(1)<ϵg(1) - f(1) < \epsilon.
Intuitive explanation

The key is to "lift" ff slightly while keeping it trapped between the boundary constraints. Since ff is increasing but not strictly, you need to add a small, carefully controlled perturbation that breaks ties without overshooting the upper bound of (0,1)(0,1). Think of it as threading a strictly increasing curve through the "slack space" above ff and below 11—the ϵ\epsilon tolerance on the endpoint gives you just enough room to make this work for any initial gap.

Intuitive explanation

The key is to "lift" ff slightly while keeping it trapped between the boundary constraints. Since ff is increasing but not strictly, you need to add a small, carefully controlled perturbation that breaks ties without overshooting the upper bound of (0,1)(0,1). Think of it as threading a strictly increasing curve through the "slack space" above ff and below 11—the ϵ\epsilon tolerance on the endpoint gives you just enough room to make this work for any initial gap.

Related theory

Browse the problem library