Given a monic quadratic polynomial $Q(x)$, define \[ Q_n (x) = \underbrace{Q(Q(\cdots(Q(x))\cdots))}_{\text{compose $n$ times}} \]for every natural number $n$. Let $a_n$ be the minimum value of the polynomial $Q_n(x)$ for every natural number $n$. It is known that $a_n > 0$ for every natural number $n$ and there exists some natural number $k$ such that $a_k \neq a_{k+1}$. (a) Prove that $a_n < a_{n+1}$ for every natural number $n$. (b) Is it possible to satisfy $a_n < 2021$ for every natural number $n$? Proposed by Fajar Yuliawan
Problem
Source: Indonesian Stage 1 TST for IMO 2022, Test 1 (Algebra)
Tags: algebra, polynomial, inequalities
12.12.2021 09:56
Nice one. Who is the author?
12.12.2021 12:10
We do this more generally for a strictly convex twice differentiable function $f$ with a single minimum in $x_0$. We classify $3$ possible behaviours for $a_n$. $I$)$f(x)>x$ $\forall x\in\mathbb{R}$. Therefore we have $t=inf(im(f(x)-x))=min(im(f(x)-x))>0$, or in other words $f(x)\geq x+t$ $\forall x\in \mathbb{R}$. In this case $f_{n+1}(x)\geq f_n(x)+t\geq a_n+t$, which implies $a_{n+1}\geq a_n+t$, and thus $a_n$ is a strictly increasing unbounded sequence. $II$) $f(x)$ has two points of intersection $x_1< x_2$ and $x_1\leq x_0<x_2$. Considering the function $f_n$, we have $f_n(x_2)=2$ and $f_n(x_1)=x_1$, and so by intermediate value theorem there is a $c$ such that $f_n(c)=x_0$, and thus $f_{n+1}(x)= f(f_n(x))\geq f(x_0)=a_1$, and so $a_n$ is constant. $III$) $f(x)$ has two points (they may be coincident, which couldn't happen before) $x_1\leq x_2$, and $x_0<x_1$. For $x<x_1$ we have $f(x)>x$. Since $f_n'=f'(f_{n-1})\cdots f'(x)$, to achieve minimum we must have $f'(f_{k}(x))=0$ for some $k\geq 0$ which implies $f_k(x)=x_0$. However if $k>0$ we have $f_k(x)\geq f(x_0)>x_0$, and so the only minimum is always in $x_0$. Now we note by induction that, since $f$ is increasing in $[x_0,x_1]$ and since $f(x)>x$ $\forall x\in [x_0,x_1)$, $x_1=f_{n+1}(x_1)>f_{n+1}(x_0)>f_n(x_0)=a_n>a_{n-1}>\cdots >a_1>x_0$, and this $a_n$ is a strictly increasing bounded function, which by monotone convergence theorem must converge, and it must in fact converge to $x_1$. Now we finally return to our problem: We couldn't have case $I$ since $a_n$ is constant. In both cases $II$ and $III$ part a) was proved. For part b) it suffices to take a function which satisfies the hypothesis $x_0<x_1\leq x_2$. For example, $Q(x)=(x-\frac{1}{4})^2+0.01$ works since $a_1>0$ and $x_1<2021$.
15.12.2021 18:09
Translated by yours truly, from Indonesian.
30.03.2022 07:39
This example very nice for part (b) $$x^2+\frac{1}{4}x+\frac{1}{8}$$