Maths Olympiad Prep

Library / Local Mathematical Competitions /23 of 23

Local Mathematical Competitions

Algebra Difficulty 7.6 National Olympiad, round 2 Prove it Romania

Given a polynomial f(x)f(x) with rational coefficients, of degree d≥2d \ge 2, we define the sequence of sets f0(Q),f1(Q),…f^0(\mathbb{Q}), f^1(\mathbb{Q}), \dots, by f0(Q)=Qf^0(\mathbb{Q}) = \mathbb{Q} and then fn+1(Q)=f(fn(Q))f^{n+1}(\mathbb{Q}) = f(f^n(\mathbb{Q})) for n≥0n \ge 0.
(Given a set SS, we write f(S)f(S) for the set {f(x)∣x∈S}\{f(x) \mid x \in S\}.)
Let fω(Q)=⋂n=0∞fn(Q)f^\omega(\mathbb{Q}) = \bigcap_{n=0}^\infty f^n(\mathbb{Q}) be the set of numbers that are in all of the sets fn(Q)f^n(\mathbb{Q}). Prove that fω(Q)f^\omega(\mathbb{Q}) is a finite set.
(Romania) Dan Schwarz

Solution

For any function ff, denote its nn-th iterate fnf^n. Take d=deg⁡f≥2d = \deg f \ge 2. One can write f(x)=1N(axd+g(x))f(x) = \frac{1}{N}(a x^d + g(x)) for some N∈Z+∗N \in \mathbb{Z}_+^*, a∈Z∗a \in \mathbb{Z}^*, and some g∈Z[x]g \in \mathbb{Z}[x], with deg⁡g≤d−1\deg g \le d-1, g(x)=∑i=0d−1aixig(x) = \sum_{i=0}^{d-1} a_i x^i, ai∈Za_i \in \mathbb{Z}, for all 0≤i≤d−10 \le i \le d-1.
Finally, fω(Q)⊂fn(Q)⊂fn−1(Q)⊆Qf^\omega(\mathbb{Q}) \subset f^n(\mathbb{Q}) \subset f^{n-1}(\mathbb{Q}) \subseteq \mathbb{Q}, for n≥1n \ge 1.
For any x∈Qx \in \mathbb{Q}, one can uniquely write x=μ(x)ν(x)x = \frac{\mu(x)}{\nu(x)}, with μ(x),ν(x)∈Z\mu(x), \nu(x) \in \mathbb{Z}, and ν(x)>0\nu(x) > 0, gcd⁡(μ(x),ν(x))=1\gcd(\mu(x), \nu(x)) = 1. Take now M=∑i=0d−1∣ai∣+2N∣a∣+1M = \frac{\sum_{i=0}^{d-1} |a_i| + 2N}{|a|} + 1, and
M:={x∈Q;∣x∣>M},F:={x∈Q;ν(x)>a2}. \mathcal{M} := \{x \in \mathbb{Q} ; |x| > M\}, \quad \mathcal{F} := \{x \in \mathbb{Q} ; \nu(x) > a^2\}.
Now, (Q∖F)∩(Q∖M)(\mathbb{Q} \setminus \mathcal{F}) \cap (\mathbb{Q} \setminus \mathcal{M}) is obviously finite; take m\mathfrak{m} to be its cardinality.
For x∈Mx \in \mathcal{M} one has ∣f(x)∣≥∣x∣+1>M|f(x)| \ge |x| + 1 > M (see LEMMA 1), hence f(x)∈Mf(x) \in \mathcal{M}. Then ∣fn(x)∣≥∣x∣+n|f^n(x)| \ge |x| + n. For x∈Fx \in \mathcal{F} one has ν(f(x))≥ν(x)+1>a2\nu(f(x)) \ge \nu(x) + 1 > a^2 (see LEMMA 2), hence f(x)∈Ff(x) \in \mathcal{F}. Then ν(fn(x))≥ν(x)+n\nu(f^n(x)) \ge \nu(x) + n.
Take x∈fω(Q)x \in f^\omega(\mathbb{Q}), and take nn large enough. Then we will have x∈fn(Q)x \in f^n(\mathbb{Q}), hence there will exist xn∈Qx_n \in \mathbb{Q} such that fn(xn)=xf^n(x_n) = x. If fk(xn)∈Mf^k(x_n) \in \mathcal{M} for n−k>∣x∣n-k > |x|, then ∣x∣=∣fn(xn)∣=∣fn−k(fk(xn))∣≥∣fk(xn)∣+(n−k)>∣x∣|x| = |f^n(x_n)| = |f^{n-k}(f^k(x_n))| \ge |f^k(x_n)| + (n-k) > |x|, absurd. If fk(xn)∈Ff^k(x_n) \in \mathcal{F} for n−k>ν(x)n-k > \nu(x), then ν(x)=ν(fn(xn))=ν(fn−k(fk(xn)))≥ν(fk(xn))+(n−k)>ν(x)\nu(x) = \nu(f^n(x_n)) = \nu(f^{n-k}(f^k(x_n))) \ge \nu(f^k(x_n)) + (n-k) > \nu(x), absurd.
Take nn large enough so that n>m+max⁡{∣x∣,ν(x)}n > \mathfrak{m} + \max\{|x|, \nu(x)\}.
One then has fk(xn)∈(Q∖F)∩(Q∖M)f^k(x_n) \in (\mathbb{Q} \setminus \mathcal{F}) \cap (\mathbb{Q} \setminus \mathcal{M}), for 0≤k≤m0 \le k \le \mathfrak{m}, therefore there will exist 0≤i<j≤m0 \le i < j \le \mathfrak{m} such that fi(xn)=fj(xn)f^i(x_n) = f^j(x_n), therefore fn(xn)=fk(xn)f^n(x_n) = f^k(x_n) for some i≤k≤ji \le k \le j, hence x=fn(xn)=fk(xn)∈(Q∖F)∩(Q∖M)x = f^n(x_n) = f^k(x_n) \in (\mathbb{Q} \setminus \mathcal{F}) \cap (\mathbb{Q} \setminus \mathcal{M}).
This implies fω(Q)⊆(Q∖F)∩(Q∖M)f^\omega(\mathbb{Q}) \subseteq (\mathbb{Q} \setminus \mathcal{F}) \cap (\mathbb{Q} \setminus \mathcal{M}), thus a finite set.

LEMMA 1. For x∈Mx \in \mathcal{M} one has ∣f(x)∣≥∣x∣+1>M|f(x)| \ge |x| + 1 > M.
Proof. Clearly then ∣x∣>M>1|x| > M > 1. Now ∣a∣∣x∣dN>∑i=0d−1∣ai∣∣x∣d−1N+∣x∣d+∣x∣d>∑i=0d−1∣ai∣∣x∣iN+∣x∣+1≥∣g(x)∣N+∣x∣+1\frac{|a||x|^d}{N} > \frac{\sum_{i=0}^{d-1} |a_i||x|^{d-1}}{N} + |x|^d + |x|^d > \frac{\sum_{i=0}^{d-1} |a_i||x|^i}{N} + |x| + 1 \ge \frac{|g(x)|}{N} + |x| + 1. It follows that ∣f(x)∣=∣axd+g(x)N∣≥(∣a∣∣x∣dN−∣g(x)∣N)>∣x∣+1>M|f(x)| = \left| \frac{a x^d + g(x)}{N} \right| \ge \left( \frac{|a||x|^d}{N} - \frac{|g(x)|}{N} \right) > |x| + 1 > M. □\square

LEMMA 2. For x∈Fx \in \mathcal{F} one has ν(f(x))≥ν(x)+1>a2\nu(f(x)) \ge \nu(x) + 1 > a^2.
Proof. For x∈Fx \in \mathcal{F} one can write f(x)=1Nν(x)d(aμ(x)d+ν(x)z)=μ(f(x))ν(f(x))f(x) = \frac{1}{N \nu(x)^d}(a \mu(x)^d + \nu(x) z) = \frac{\mu(f(x))}{\nu(f(x))}, with z=ν(x)d−1g(x)∈Zz = \nu(x)^{d-1} g(x) \in \mathbb{Z}. Now, for e=gcd⁡(ν(x),a)e = \gcd(\nu(x), a), one has ν(x)=er\nu(x) = e r, a=eba = e b, with gcd⁡(r,b)=1\gcd(r, b) = 1.
Then it follows that δ=gcd⁡(aμ(x)d+ν(x)z,Nν(x)d)≤N⋅gcd⁡(eμ(x)d+erz,edrd)=Ne⋅gcd⁡(bμ(x)d+rz,ed−1rd)=Ne⋅gcd⁡(bμ(x)d+rz,ed−1)\delta = \gcd(a \mu(x)^d + \nu(x) z, N \nu(x)^d) \le N \cdot \gcd(e \mu(x)^d + e r z, e^d r^d) = N e \cdot \gcd(b \mu(x)^d + r z, e^{d-1} r^d) = N e \cdot \gcd(b \mu(x)^d + r z, e^{d-1}), since from previous relations gcd⁡(bμ(x),r)=1\gcd(b \mu(x), r) = 1. Lastly δ≤Ne⋅gcd⁡(bμ(x)d+rz,ed−1)≤Need−1=Ned≤N∣a∣d\delta \le N e \cdot \gcd(b \mu(x)^d + r z, e^{d-1}) \le N e e^{d-1} = N e^d \le N |a|^d.
Therefore ν(f(x))=Nν(x)dδ≥Nν(x)dN∣a∣d>ν(x)\nu(f(x)) = \frac{N \nu(x)^d}{\delta} \ge \frac{N \nu(x)^d}{N |a|^d} > \nu(x), since ν(x)>a2≥∣a∣dd−1\nu(x) > a^2 \ge |a|^{\frac{d}{d-1}}. It follows that ν(f(x))≥ν(x)+1>a2\nu(f(x)) \ge \nu(x) + 1 > a^2. □\square

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.