Subcontests
(7)Convergence of a Piecewise-Monotone Function Sequence
A continuous function f:[a,b]→[a,b] is called piecewise monotone if [a,b] can be subdivided into finitely many subintervals
I1=[c0,c1],I2=[c1,c2],…,Iℓ=[cℓ−1,cℓ]
such that f restricted to each interval Ij is strictly monotone, either increasing or decreasing. Here we are assuming that a=c0<c1<⋯<cℓ−1<cℓ=b. We are also assuming that each Ij is a maximal interval on which f is strictly monotone. Such a maximal interval is called a lap of the function f, and the number ℓ=ℓ(f) of distinct laps is called the lap number of f. If f:[a,b]→[a,b] is a continuous piecewise-monotone function, show that the sequence (nℓ(fn)) converges; here fn means f composed with itself n-times, so f2(x)=f(f(x)) etc.