Maths Olympiad Prep

Library / /508 of 520

Algebra Difficulty 6.4 National olympiad Prove it

The seventy-first problem: Given an integer n3\mathrm{n} \geq 3, let A={{z1,z2,,zn}ziC,zi=1,1in}\mathcal{A}=\left\{\left\{\mathrm{z}_{1}, \mathrm{z}_{2}, \ldots, \mathrm{z}_{\mathrm{n}}\right\}\left|\mathrm{z}_{\mathrm{i}} \in \mathrm{C},\right| \mathrm{z}_{\mathrm{i}} \mid=1,1 \leq \mathrm{i} \leq \mathrm{n}\right\}, find sinAA{maxuCu=1{zAuz}}\sin _{\mathrm{A} \in \mathcal{A}}\left\{\max _{\substack{\mathrm{u} \in \mathrm{C} \\|\mathrm{u}|=1}}\left\{\prod_{\mathrm{z} \in \mathrm{A}}|\mathrm{u}-\mathrm{z}|\right\}\right\}, and determine all AA\mathrm{A} \in \mathcal{A} for which this minimum of the maximum values can be achieved.

Solution

The 71st problem,
Solution: First, we prove that for any {z1,z2,,zn}A\{z_1, z_2, \ldots, z_n\} \in \mathcal{A}, there exists a unit complex number uu such that j=1nuzj2\prod_{j=1}^{n} |u - z_j| \geq 2. In fact, let
f(z)=j=1n(zzj)=zn+cn1zn1+cn2zn2++c1z+c0 f(z) = \prod_{j=1}^{n} (z - z_j) = z^n + c_{n-1} z^{n-1} + c_{n-2} z^{n-2} + \ldots + c_1 z + c_0

where c0=(1)nz1z2znc_0 = (-1)^n z_1 z_2 \ldots z_n, and c0=1|c_0| = 1.
Let ω=e2πin\omega = e^{\frac{2 \pi i}{n}}, ε=eargc0ni\varepsilon = e^{\frac{\arg c_0}{n} i}, then
k=1nf(εωk)=nεn+nc0=2nc0 \sum_{k=1}^{n} f(\varepsilon \cdot \omega^k) = n \cdot \varepsilon^n + n \cdot c_0 = 2n c_0
k=1nf(εωk)k=1nf(εωk)=2nc0=2n \Rightarrow \sum_{k=1}^{n} |f(\varepsilon \cdot \omega^k)| \geq \left| \sum_{k=1}^{n} f(\varepsilon \cdot \omega^k) \right| = |2nc_0| = 2n

By the mean value principle, there exists a k{1,2,,n}k \in \{1, 2, \ldots, n\} such that f(εωk)2|f(\varepsilon \cdot \omega^k)| \geq 2. Let u=εωku = \varepsilon \cdot \omega^k, then Πj=1nuzj=f(u)2\Pi_{j=1}^{n} |u - z_j| = |f(u)| \geq 2. Therefore, for any A={z1,z2,,zn}AA = \{z_1, z_2, \ldots, z_n\} \in \mathcal{A}, we have
maxuCu=1{ΠzAuz}2 \max_{\substack{u \in C \\ |u| = 1}} \left\{ \Pi_{z \in A} |u - z| \right\} \geq 2

Next, we find all {z1,z2,,zn}A\{z_1, z_2, \ldots, z_n\} \in \mathcal{A} such that maxuCu=1{zAuz}=2\max_{\substack{u \in C \\ |u| = 1}} \left\{ \prod_{z \in A} |u - z| \right\} = 2. According to the above analysis, in this case, we must have:
f(εω1)=f(εω2)==f(εωn)=2c0 f(\varepsilon \cdot \omega^1) = f(\varepsilon \cdot \omega^2) = \ldots = f(\varepsilon \cdot \omega^n) = 2c_0

Let g(z)=f(z)znc0g(z) = f(z) - z^n - c_0, then degg(z)n1\deg g(z) \leq n-1, and for any k{1,2,,n}k \in \{1, 2, \ldots, n\},
g(εωk)=f(εωk)(εωk)nc0=2c0c0c0=0 g(\varepsilon \cdot \omega^k) = f(\varepsilon \cdot \omega^k) - (\varepsilon \cdot \omega^k)^n - c_0 = 2c_0 - c_0 - c_0 = 0

This indicates that g(z)0g(z) \equiv 0. Therefore,
f(z)=j=1n(zzj)=zn+c0=zn+(1)nz1z2zn f(z) = \prod_{j=1}^{n} (z - z_j) = z^n + c_0 = z^n + (-1)^n z_1 z_2 \ldots z_n

This shows that z1,z2,,znz_1, z_2, \ldots, z_n are nn points uniformly distributed on the unit circle in the complex plane, i.e., z1,z2,,znz_1, z_2, \ldots, z_n are the nn vertices of a regular nn-gon.
Conversely, if z1,z2,,znz_1, z_2, \ldots, z_n are the nn vertices of a regular nn-gon, then
j=1n(zzj)=zn+(1)nz1z2zn \prod_{j=1}^{n} (z - z_j) = z^n + (-1)^n z_1 z_2 \ldots z_n

Thus, for any unit complex number uu,
ΠzAuz=un+(1)nz1z2znun+(1)nz1z2zn=2 \Pi_{z \in A} |u - z| = \left| u^n + (-1)^n z_1 z_2 \ldots z_n \right| \leq \left| u^n \right| + \left| (-1)^n z_1 z_2 \ldots z_n \right| = 2

Therefore, such {z1,z2,,zn}\{z_1, z_2, \ldots, z_n\} satisfy the given conditions.

Note: Generally, if f(z)=cnzn+cn1zn1++c1z+c0f(z) = c_n z^n + c_{n-1} z^{n-1} + \ldots + c_1 z + c_0 is an nn-degree polynomial with complex coefficients, then there exists a unit complex number z0z_0 such that f(z0)c0+cn|f(z_0)| \geq |c_0| + |c_n|.

More generally, we have the following proposition: Given f(z)=cnzn+cn1zn1++c1z+c0f(z) = c_n z^n + c_{n-1} z^{n-1} + \ldots + c_1 z + c_0 as an nn-degree polynomial with complex coefficients, prove that there exists a complex number z0(z01)z_0 (|z_0| \leq 1) such that f(z0)c0+max1knck[nk]|f(z_0)| \geq |c_0| + \max_{1 \leq k \leq n} \frac{|c_k|}{\left[ \frac{n}{k} \right]}.

Proof: We only need to prove that for k{1,2,,n}k \in \{1, 2, \ldots, n\}, there exists zC,z1z \in C, |z| \leq 1, such that f(z)c0+ck[nk]|f(z)| \geq |c_0| + \frac{|c_k|}{\left[ \frac{n}{k} \right]}.
When k=1k = 1, we first prove that there exists a complex number z1(z11)z_1 (|z_1| \leq 1) such that f(z1)c0+1nc1|f(z_1)| \geq |c_0| + \frac{1}{n} \cdot |c_1|.
Take the unit complex number s0=eiα,α=arg(c0)s_0 = e^{i \alpha}, \alpha = -\arg(c_0), then s0c0Rs_0 c_0 \in \mathbb{R}, and s0c00s_0 c_0 \geq 0; take the unit complex number s1=eiβs_1 = e^{i \beta}, β=arg(c1s0)\beta = -\arg(c_1 s_0), then s1s0c1Rs_1 s_0 c_1 \in \mathbb{R}, and s1s0c10s_1 s_0 c_1 \geq 0. Let
g(z)=s0f(s1z)=s0cns1nzn+s0cn1s1n1zn1++s0c1s1z+s0c0=anzn+an1zn1++a1z+a0 \begin{array}{l} g(z) = s_0 f(s_1 z) \\ = s_0 c_n s_1^n z^n + s_0 c_{n-1} s_1^{n-1} z^{n-1} + \ldots + s_0 c_1 s_1 z + s_0 c_0 \\ = a_n z^n + a_{n-1} z^{n-1} + \ldots + a_1 z + a_0 \end{array}

Then f(s1z)=s0f(s1z)=g(z)|f(s_1 z)| = |s_0| \cdot |f(s_1 z)| = |g(z)|, a0=s0c0=c0|a_0| = |s_0 c_0| = |c_0|, a1=s0c1s1=c1|a_1| = |s_0 c_1 s_1| = |c_1|. Next, we only need to prove that there exists z1|z| \leq 1 such that g(z)a0+a1n=a0+a1n|g(z)| \geq |a_0| + \frac{|a_1|}{n} = a_0 + \frac{a_1}{n}.
Otherwise, for any z1|z| \leq 1, g(z)<a0+a1n|g(z)| < a_0 + \frac{a_1}{n}, hence g(z)<a0+a1n|g(z)| < a_0 + \frac{a_1}{n}. Let g(z)=anzn+an1zn1++a1z+a0g(z) = a_n z^n + a_{n-1} z^{n-1} + \ldots + a_1 z + a_0, and let \(g(z) = a_n (z - b_1)(z - b_2) \

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.