uniolympiads English

IMC 2021, Ημέρα 1, Θέμα 4

Let f ⁣:R→Rf\colon \mathbb{R} \to \mathbb{R} be a function. Suppose that for every ε>0\varepsilon > 0, there exists a function g ⁣:R→(0,∞)g\colon \mathbb{R} \to (0, \infty) such that for every pair (x,y)(x, y) of real numbers,

if ∣x−y∣<min⁡{g(x),g(y)}, then ∣f(x)−f(y)∣<ε.\text{if } |x - y| < \min\{g(x), g(y)\}, \text{ then } |f(x) - f(y)| < \varepsilon.

Prove that ff is the pointwise limit of a sequence of continuous R→R\mathbb{R} \to \mathbb{R} functions, i.e., there is a sequence h1,h2,…h_1, h_2, \dots of continuous R→R\mathbb{R} \to \mathbb{R} functions such that lim⁡n→∞hn(x)=f(x)\lim_{n \to \infty} h_n(x) = f(x) for every x∈Rx \in \mathbb{R}.

Πρωτότυπο από το επίσημο PDFLet f ∶ R → R be a function. Suppose that for every ε > 0, there exists a function g ∶ R → (0, ∞) such that for every pair (x, y) of real numbers, if ∣x − y∣ < min {g(x), g(y)}, then ∣f (x) − f (y)∣ < ε. Prove that f is the pointwise limit of a sequence of continuous R → R functions, i.e., there is a sequence h 1 , h 2 , . . . of continuous R → R functions such that lim h n (x) = f (x) for every x ∈ R. n→∞

Η μεταγραφή συγκρίθηκε σύμβολο προς σύμβολο με το πρωτότυπο, όχι ακόμα από άνθρωπο.

Χρόνος σε αυτό το θέμα 0:00

Δούλεψε τουλάχιστον 45 λεπτά πριν ανοίξεις τη λύση.

Επίσημη λύση

(proposed by Camille Mau, Nanyang Technological University, Singapore)

Hint: Start from a segment in place of R\mathbb{R} and use its compactness. Or recall the cool things called “the Lebesgue characterization theorem” and “the Baire characterization theorem”.

Solution 1. Since gg depends also on ε\varepsilon, let us use the notation g(x,ε)g(x, \varepsilon). Considering only ε=1/n\varepsilon = 1/n for positive integer nn will suffice to reach our conclusions, hence we may use min⁡{g(x,1/m)∣m≤n}\min\{g(x, 1/m) \mid m \le n\} in place of g(x,1/n)g(x, 1/n) and thus assume g(x,ε)g(x, \varepsilon) decreasing in ε\varepsilon.

For any x∈Rx \in \mathbb{R}, choose δn(x)=min⁡{1/n,g(x,1/n)}\delta_n(x) = \min\{1/n, g(x, 1/n)\}. Of the δn(x)\delta_n(x)-neighborhoods of all xx select (using local compactness of the reals) an inclusion-minimal locally finite covering {Ui}\{U_i\}. From its inclusion-minimality it follows that we may enumerate UiU_i with i∈Zi \in \mathbb{Z} so that Ui∩Uj≠∅U_i \cap U_j \ne \varnothing only when ∣i−j∣≤1|i - j| \le 1 and the enumeration goes from left to right on the real line. For an assumed nn, let xix_i be the center of UiU_i and δi=δn(xi)\delta_i = \delta_n(x_i), so that Ui=(xi−δi,xi+δi)U_i = (x_i - \delta_i, x_i + \delta_i) and δi<1/n\delta_i < 1/n for all ii.

Now define a continuous fn:R→Rf_n : \mathbb{R} \to \mathbb{R} so that it equals f(xi)f(x_i) in Ui∖(Ui−1∪Ui+1)U_i \smallsetminus (U_{i-1} \cup U_{i+1}), and so that fnf_n changes continuously between f(xi−1)f(x_{i-1}) and f(xi)f(x_i) in the intersection Ui−1∩UiU_{i-1} \cap U_i.

Now we show that fn→ff_n \to f pointwise. Fix a point xx and ε=1/m>0\varepsilon = 1/m > 0, and choose

n>max⁡{1/g(x,ε),m}.n > \max\{1/g(x, \varepsilon), m\}.
Examine the construction of fnf_n for any such nn. Observe that g(x,ε)>1/n>δig(x, \varepsilon) > 1/n > \delta_i and 1/n<1/m1/n < 1/m. There are two cases:

  • xx belongs to the unique UiU_i. Then using the monotonicity of g(x,ε)g(x, \varepsilon) in ε\varepsilon we have
    ∣xi−x∣<δi≤min⁡{g(xi,1n),g(x,ε)}≤min⁡{g(xi,ε),g(x,ε)}.|x_i - x| < \delta_i \le \min\left\{g\left(x_i, \frac{1}{n}\right), g(x, \varepsilon)\right\} \le \min\{g(x_i, \varepsilon), g(x, \varepsilon)\}.
    Hence
    ∣f(x)−fn(x)∣=∣f(x)−f(xi)∣<ε.|f(x) - f_n(x)| = |f(x) - f(x_i)| < \varepsilon.
  • xx belongs to Ui−1∩UiU_{i-1} \cap U_i. Similar to the previous case,
    ∣f(x)−f(xi−1)∣,∣f(x)−f(xi)∣<ε.|f(x) - f(x_{i-1})|, |f(x) - f(x_i)| < \varepsilon.
    Since fn(x)f_n(x) is between fn(xi−1)=f(xi−1)f_n(x_{i-1}) = f(x_{i-1}) and fn(xi)=f(xi)f_n(x_i) = f(x_i) by construction, we have
    ∣f(x)−fn(x)∣<ε.|f(x) - f_n(x)| < \varepsilon.

We have that ∣f(x)−fn(x)∣<ε|f(x) - f_n(x)| < \varepsilon holds for sufficiently large nn, which proves the pointwise convergence.

Solution 2. This solution uses the Baire characterization theorem: A function f:R→Rf : \mathbb{R} \to \mathbb{R} is a pointwise limit of continuous functions if and only if its restriction to every non-empty closed subset of R\mathbb{R} has a point of continuity.

Assume the contrary in view of the above theorem: A⊆RA \subseteq \mathbb{R} is a non-empty closed set and ff has no point of continuity in AA. Let’s think that ff is defined only on AA.

Then for all x∈Ax \in A there exist rationals p<qp < q for which lim sup⁡xf>q\limsup_x f > q, lim inf⁡xf<p\liminf_x f < p. Apply the Baire category theorem: If a complete metric space AA is a countable union of sets then some of the sets is dense in a positive radius metric ball of AA. It follows that there exist pp and qq, which serve for a subset B⊂AB \subset A which is dense on a certain ball (in the induced metric of the real line) A1⊂AA_1 \subset A. It yields that both sets Q=f−1(q,∞)Q = f^{-1}(q, \infty) and P=f−1(−∞,p)P = f^{-1}(-\infty, p) are dense in A1A_1.

Choose ε=(q−p)/10\varepsilon = (q - p)/10 and find kk for which the set S={x:g(x)>1/k}S = \{x : g(x) > 1/k\} is also dense on a certain ball A2⊂A1A_2 \subset A_1. Partition SS into subsets where f(x)>(p+q)/2f(x) > (p + q)/2 and f(x)⩽(p+q)/2f(x) \leqslant (p + q)/2, one of them is again dense somewhere in A3A_3, say the latter.

Now take any point y∈A3∩Qy \in A_3 \cap Q and a very close (within distance min⁡(1/k,g(y))\min(1/k, g(y))) to yy point xx with g(x)>1/kg(x) > 1/k but f(x)⩽(p+q)/2f(x) \leqslant (p + q)/2. This pair x,yx, y contradicts the property of ff from the problem statement.

Solution 3. This solution uses the Lebesgue characterization theorem: If f:R→Rf : \mathbb{R} \to \mathbb{R} is a function and, for all real cc, the sublevel and superlevel sets {x∣f(x)⩾c}\{x \mid f(x) \geqslant c\}, {x∣f(x)⩽c}\{x \mid f(x) \leqslant c\} are countable intersections of open sets then ff is a pointwise limit of continuous functions.

Now the solution follows from the formula with a countable intersection of the unions of intervals:

{x∣f(x)⩾c}=⋂n,k=1∞⋃y∈Rf(y)⩾c(y−min⁡{1k,g(y,1n)},y+min⁡{1k,g(y,1n)})(∗)\{x \mid f(x) \geqslant c\} = \bigcap_{n,k=1}^{\infty} \bigcup_{\substack{y \in \mathbb{R} \\ f(y) \geqslant c}} \left(y - \min\left\{\frac{1}{k}, g\left(y, \frac{1}{n}\right)\right\}, y + \min\left\{\frac{1}{k}, g\left(y, \frac{1}{n}\right)\right\}\right) \tag{$*$}
and the similar formula for {x:f(x)⩽c}\{x : f(x) \leqslant c\}. It remains to prove (∗)(*).

The left hand side is obviously contained in the right hand side, just put y=xy = x.

To prove the opposite inclusion assume the contrary, that f(x)<cf(x) < c, but xx is contained in the right hand side. Choose a positive integer nn such that f(x)<c−1/nf(x) < c - 1/n and kk such that g(x,1/n)>1/kg(x, 1/n) > 1/k. Then, since xx belongs to the right hand side, we see that there exists yy such that f(y)⩾cf(y) \geqslant c and

∣x−y∣<min⁡{g(y,1n),1k}⩽min⁡{g(y,1n),g(x,1n)},|x - y| < \min\left\{g\left(y, \frac{1}{n}\right), \frac{1}{k}\right\} \leqslant \min\left\{g\left(y, \frac{1}{n}\right), g\left(x, \frac{1}{n}\right)\right\},
which yields f(x)⩾f(y)−1/n⩾c−1/nf(x) \geqslant f(y) - 1/n \geqslant c - 1/n, a contradiction.

Μεταγραφή από το επίσημο κείμενο λύσεων, σελίδες 4–5. Η μεταγραφή δεν έχει ελεγχθεί δεύτερη φορά· αν έχεις αμφιβολία, κοίτα το πρωτότυπο.

Θέμα αρχείου: η εκφώνηση είναι το επίσημο κείμενο (μεταγραμμένο, με το πρωτότυπο παραπάνω). Η ταξινόμηση ανά αντικείμενο και η δυσκολία εκτιμήθηκαν αυτόματα· υποδείξεις και λύση στα ελληνικά προστίθενται σταδιακά.

Πώς πήγε;