Maths Olympiad Prep

Library / /32 of 34

Algebra Difficulty 6.8 National olympiad Prove it Romania

Let nn be a positive integer, let a1,,ana_1, \dots, a_n be pairwise distinct real numbers, and let b1,,bnb_1, \dots, b_n be arbitrary real numbers. Show that:
a) if the bib_i are all positive, then there exists a polynomial ff with real coefficients, no root of which is real, such that f(ai)=bif(a_i) = b_i, i=1,,ni = 1, \dots, n;
b) there always exists a polynomial ff whose roots are all real, and f(ai)=bif(a_i) = b_i, i=1,,ni = 1, \dots, n.

Solution

a) We exhibit two examples. Let fi=ji(Xaj)f_i = \prod_{j \neq i} (X - a_j), i=1,,ni = 1, \dots, n. Since the fif_i never vanish simultaneously, the Lagrange type interpolation polynomial f=i=1nbifi2fi(ai)2f = \sum_{i=1}^n \frac{b_i f_i^2}{f_i(a_i)^2} clearly satisfies the required conditions.

Another example may be obtained by adding a suitable positive constant to the square of a suitable Lagrange interpolation polynomial; for instance, let bb be a positive real number less than each bib_i, and let
f=b+(i=1nbibfi(ai)fi)2. f = b + \left( \sum_{i=1}^{n} \frac{\sqrt{b_i - b}}{f_i(a_i)} f_i \right)^2.

b) Proceed by induction on nn. The base case n=1n=1 being clear, let n2n \ge 2.
If some bi=0b_i = 0, fix such an index ii, and apply the induction hypothesis to provide a polynomial gg whose roots are all real, and g(aj)=bjajaig(a_j) = \frac{b_j}{a_j - a_i} for all jij \neq i. The polynomial f=(Xai)gf = (X - a_i)g clearly satisfies the required conditions.

If no bi=0b_i = 0, assume, without loss of generality, that a1<<ana_1 < \dots < a_n, and let II be the set of all indices ii such that bibi+1>0b_i b_{i+1} > 0. For each ii in II, choose aia'_i and bib'_i such that ai<ai<ai+1a_i < a'_i < a_{i+1} and bibi<0b_i b'_i < 0. The roots of the Lagrange polynomial solving the interpolation problem f(ai)=bif(a_i) = b_i, i=1,,ni = 1, \dots, n, and f(ai)=bif(a'_i) = b'_i, iIi \in I, are then all real and the conclusion follows.

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 and solution reproduced as published; topic and difficulty added by this site.