Olympiad Maths Prep

Track / Stage 6 / 298 of 400 #1298 of 2000

Problem 1298

National olympiad, first round
Algebra Difficulty 6.5 Prove it

Example 4 (2004 Thailand Mathematical Olympiad Problem) Let the function f:[0,1]Rf:[0,1] \rightarrow \mathbf{R} satisfy
(1) f(0)=f(1)=0f(0)=f(1)=0;
(2) For all x,y[0,1]x, y \in[0,1], and xy,f(x)f(y)<xyx \neq y,|f(x)-f(y)|<|x-y|.

Prove: For all x,y[0,1],f(x)f(y)<12x, y \in[0,1],|f(x)-f(y)|<\frac{1}{2}.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Proof 1 For all x[0,1]x \in [0,1], we have
\begin{array}{l} |f(x)|=|f(x)-f(0)|\frac{1}{2}$, assume
\frac{1}{2}\frac{1}{2}$,
then let
1x1>x20.f(0)=f(1), \begin{array}{c} 1 \geqslant x_{1}>x_{2} \geqslant 0 . \\ f(0)=f(1), \end{array}

Since
so f(x2)f(x1)\left|f\left(x_{2}\right)-f\left(x_{1}\right)\right|
=f(x2)f(0)+f(1)f(x1)f(x2)f(0)+f(1)f(x1)<x20+1x1=1(x1x2)<12. \begin{array}{l} =\left|f\left(x_{2}\right)-f(0)+f(1)-f\left(x_{1}\right)\right| \\ \leqslant\left|f\left(x_{2}\right)-f(0)\right|+\left|f(1)-f\left(x_{1}\right)\right| \\ <x_{2}-0+1-x_{1} \\ =1-\left(x_{1}-x_{2}\right)<\frac{1}{2} . \end{array}

So f(x2)f(x1)<12\left|f\left(x_{2}\right)-f\left(x_{1}\right)\right|<\frac{1}{2}.
This is the conventional proof of the problem, using the properties of absolute value inequalities. Deep thinking reveals the geometric meaning contained within, leading to a new proof by constructing a geometric figure:
Proof 3 Because f(x2)f(x1)<x2x1\left|f\left(x_{2}\right)-f\left(x_{1}\right)\right|<\left|x_{2}-x_{1}\right|.
So
f(x2)f(x1)x2x1<1, \left|\frac{f\left(x_{2}\right)-f\left(x_{1}\right)}{x_{2}-x_{1}}\right|<1,

which means the slope kk of the line connecting any two points on the graph of y=f(x)y=f(x) satisfies k<1|k|<1. Therefore, all points on the graph of y=f(x)y=f(x) must be confined within a square region with side length 22\frac{\sqrt{2}}{2} as shown in Figure 5-1. Let the highest point on the graph be E(x4,y0)E\left(x_{4}, y_{0}\right), and the lowest point be F(xb,yb)F\left(x_{b}, y_{b}\right). Then kEF<1\left|k_{E F}\right|<1, connect EFE F, intersecting OBO B at point PP, extend FEF E and EFE F to intersect OAO A and BCB C at GG and HH respectively. Draw a line parallel to ABA B through point PP intersecting OAO A and BCB C at MM and NN respectively, and draw perpendiculars from points EE, FF, GG, HH, MM, and NN to OBO B, with the feet of the perpendiculars being EE^{\prime}, FF^{\prime}, GG^{\prime}, HH^{\prime}, MM^{\prime}, and NN^{\prime} respectively, then
f(xs)f(xn)<GG+HH<MM+NN=22(PM+PN)=22MN=12. \begin{aligned} f\left(x_{s}\right)-f\left(x_{n}\right) & <\left|G G^{\prime}\right|+\left|H H^{\prime}\right| \\ & <\left|M M^{\prime}\right|+\left|N N^{\prime}\right| \\ & =\frac{\sqrt{2}}{2}(|P M|+|P N|) \\ & =\frac{\sqrt{2}}{2}|M N|=\frac{1}{2} . \end{aligned}

Since EE and FF are the highest and lowest points on the graph of y=f(x)y=f(x) respectively, we have f(x2)f(x1)f(xa)f(xb)<12\left|f\left(x_{2}\right)-f\left(x_{1}\right)\right| \leqslant f\left(x_{a}\right)-f\left(x_{b}\right)<\frac{1}{2}.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.