Maths Olympiad Prep

Library / /207 of 299

Algebra Difficulty 6.9 National Olympiad Prove it Iran

A (n+1)(n + 1)-tuple (h1,h2,,hn+1)(h_1, h_2, \dots, h_{n+1}) where for every 1in+11 \le i \le n + 1, hi(x1,x2,,xn)h_i(x_1, x_2, \dots, x_n) is an nn-variable polynomial with real coefficients is called good if the following condition holds.
For any nn functions f1,f2,,fn:RRf_1, f_2, \dots, f_n : \mathbb{R} \to \mathbb{R}, if for all 1in+11 \le i \le n + 1, Pi(x)=hi(f1(x),f2(x),,fn(x))P_i(x) = h_i(f_1(x), f_2(x), \dots, f_n(x)) is a polynomial in variable xx, then f1(x),f2(x),,fn(x)f_1(x), f_2(x), \dots, f_n(x) are polynomials.

a) Prove that for all positive integers nn, there exists a good (n+1)(n+1)-tuple (h1,h2,,hn+1)(h_1, h_2, \dots, h_{n+1}) such that the degree of each hih_i is more than one.

b) Prove that there does not exist any integer n>1n > 1 for which there is a good (n+1)(n+1)-tuple (h1,h2,,hn+1)(h_1, h_2, \dots, h_{n+1}) such that all hih_i are symmetric polynomials.

Solution

a) We set an example using induction on nn. For n=1n=1, consider the following pair of polynomials of degree 2
h1(x)=x2+x, h2(x)=x2. h_1(x) = x^2 + x, \ h_2(x) = -x^2.
Now for any function f:RRf: \mathbb{R} \to \mathbb{R}, if P1(x)=h1(f(x))P_1(x)=h_1(f(x)) and P2(x)=h2(f(x))P_2(x)=h_2(f(x)) are polynomials, then P1(x)+P2(x)=f(x)P_1(x) + P_2(x) = f(x) is a polynomial.

Now assume that (h1,h2,,hn+1)(h_1, h_2, \dots, h_{n+1}) is a good (n+1)(n+1)-tuple of nn-variable polynomials. Define the following (n+2)(n+2)-tuple (g1,g2,,gn+2)(g_1, g_2, \dots, g_{n+2}) of polynomials with n+1n+1 variables as
{gi(x1,x2,,xn+1)=hi(x1,x2,,xn),1in+1,gn+2(x1,x2,,xn+1)=x12+xn+1,i=n+2. \begin{cases} g_i(x_1, x_2, \dots, x_{n+1}) = h_i(x_1, x_2, \dots, x_n), & 1 \le i \le n+1, \\ g_{n+2}(x_1, x_2, \dots, x_{n+1}) = x_1^2 + x_{n+1}, & i = n+2. \end{cases}
Now let f1,f2,,fn+1:RRf_1, f_2, \dots, f_{n+1} : \mathbb{R} \to \mathbb{R} be some functions such that for all 1in+21 \le i \le n+2
Pi(x1,,xn+1)=gi(f1,f2,,fn+1), P_i(x_1, \dots, x_{n+1}) = g_i(f_1, f_2, \dots, f_{n+1}),
is a polynomial. By induction hypothesis we obtain that f1(x),f2(x),,fn(x)f_1(x), f_2(x), \dots, f_n(x) are polynomials. Note that f1(x)2f_1(x)^2 is a polynomial.
Therefore, fn+1=Pn+2f12f_{n+1} = P_{n+2} - f_1^2 is also a polynomial.
The degree of all gig_i's are more than 1. Therefore the given example is a good (n+2)(n+2)-tuple.

b) According to the Fundamental Theorem of Symmetric Polynomials, for any symmetric polynomial hi(x1,,xn)h_i(x_1, \dots, x_n) there exists another polynomial gi(x1,,xn)g_i(x_1, \dots, x_n) such that
hi(x1,,xn)=gi(symxi,symxixj,,x1x2xn). h_i(x_1, \dots, x_n) = g_i \left( \sum_{sym} x_i, \sum_{sym} x_i x_j, \dots, x_1 x_2 \cdots x_n \right).
Now assume that for some n>1n > 1 there exists a good (n+1)(n + 1)-tuple of symmetric polynomials. Consider the following functions
f1(x)=x, f2(x)=x, f3(x)=f4(x)==fn+1(x)=0. f_1(x) = |x|, \ f_2(x) = -|x|, \ f_3(x) = f_4(x) = \dots = f_{n+1}(x) = 0.
Note that
{symfifj=x2,symfi1fi2fik=0,k2. \left\{ \begin{array}{l} \sum_{sym} f_i f_j = -x^2, \\ \\ \sum_{sym} f_{i_1} f_{i_2} \cdots f_{i_k} = 0, \quad \forall k \neq 2. \end{array} \right.
Therefore,
Pi(x)=hi(f1(x),,fn(x))=gi(0,x2,0,,0)=Hi(x2). P_i(x) = h_i(f_1(x), \dots, f_n(x)) = g_i(0, -x^2, 0, \dots, 0) = H_i(-x^2).
Where HiH_i is a polynomial with real coefficients. So for any ii, Pi(x)P_i(x) is a polynomial, and therefore all fif_i's are polynomials, too. But f1f_1 and f2f_2 are not polynomials. Contradiction, hence the claim. ■

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.