Maths Olympiad Prep

Library / Thirteenth IMAR Mathematical Competition /2 of 4

Thirteenth IMAR Mathematical Competition, 2015

Algebra Difficulty 6.2 National Olympiad Prove it Romania

a) Show that, if I⊂RI \subset \mathbb{R} is a closed bounded interval, and f:I→Rf: I \to \mathbb{R} is a non-constant monic polynomial function such that max⁡x∈I∣f(x)∣<2\max_{x \in I} |f(x)| < 2, then there exists a non-constant monic polynomial function g:I→Rg: I \to \mathbb{R} such that max⁡x∈I∣g(x)∣<1\max_{x \in I} |g(x)| < 1.

b) Show that there exists a closed bounded interval I⊂RI \subset \mathbb{R} such that max⁡x∈I∣f(x)∣≥2\max_{x \in I} |f(x)| \ge 2 for every non-constant monic polynomial function f:I→Rf: I \to \mathbb{R}.

Solution

a) Let I⊂RI \subset \mathbb{R} be a closed bounded interval, let P(I)P(I) be the set of all polynomial functions f:I→Rf: I \to \mathbb{R}, and let ∥f∥=max⁡x∈I∣f(x)∣\|f\| = \max_{x \in I} |f(x)|. Define A:P(I)→P(I)A: P(I) \to P(I) by Af(x)=(f(x))2−12∥f∥2Af(x) = (f(x))^2 - \frac{1}{2}\|f\|^2, x∈Ix \in I. If ff is monic (respectively, non-constant), then so is AfAf. Further, ∥Af∥=12∥f∥2\|Af\| = \frac{1}{2}\|f\|^2, so
∥Anf∥=2(12∥f∥)2n, \|A^n f\| = 2 \left( \frac{1}{2} \|f\| \right)^{2^n},
where An=A∘⋯∘AA^n = A \circ \dots \circ A, nn times, is the nn-th iterate of AA. Consequently, if ∥f∥<2\|f\| < 2 for some ff in P(I)\mathcal{P}(I), then ∥Anf∥<1\|A^n f\| < 1 for nn large enough.

b) In the notation above, let I=[−2,2]I = [-2, 2], and define B:P(I)→P(I)B: \mathcal{P}(I) \to \mathcal{P}(I) by
Bf(x)=12f(x+2)+12f(−x+2),x∈I. Bf(x) = \frac{1}{2}f(\sqrt{x+2}) + \frac{1}{2}f(-\sqrt{x+2}), \quad x \in I.
If ff is monic, so is BfBf. Further, ∥Bf∥≤∥f∥\|Bf\| \le \|f\|, and deg⁡Bf=⌊12deg⁡f⌋\deg Bf = \lfloor \frac{1}{2} \deg f \rfloor. Consequently, if 2n≤deg⁡f<2n+12^n \le \deg f < 2^{n+1}, where nn is a non-negative integer, then deg⁡Bnf=1\deg B^n f = 1. To conclude the proof, notice that every monic polynomial function of degree 1 on II has norm at least 2.

Remark. Tchebysheff's polynomials and their properties provide an alternative solution. If nn is a non-negative integer, and −1≤x≤1-1 \le x \le 1, the Tchebysheff polynomial (real-valued function) of degree nn is defined by ...

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

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