Maths Olympiad Prep

Library / /1 of 5

Combinatorics Difficulty 7.8 National Olympiad, round 2 Prove it Romania

The function f:RRf: \mathbb{R} \to \mathbb{R} has the property that every point of local minimum has a neighbourhood (α,β)(\alpha, \beta) so that ff is strictly convex on (α,β)(\alpha, \beta). Prove that the set of the points of local minimum is countable.

Solution

Let SS be the set of points of local minimum of ff.

For each xSx \in S, by hypothesis, there exists an open interval (αx,βx)(\alpha_x, \beta_x) containing xx such that ff is strictly convex on (αx,βx)(\alpha_x, \beta_x).

Recall that a strictly convex function on an interval has at most one point of local minimum (since if there were two, the function would be constant or linear between them, contradicting strict convexity).

Therefore, for each xSx \in S, xx is the unique point of local minimum of ff in (αx,βx)(\alpha_x, \beta_x).

Thus, the intervals (αx,βx)(\alpha_x, \beta_x), for xSx \in S, are pairwise disjoint.

But the set of pairwise disjoint open intervals in R\mathbb{R} is at most countable (since each contains a rational number, and the rationals are countable).

Therefore, SS is at most countable.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.