uniolympiads Ελληνικά

IMC 2008, Day 1, Problem 2

Denote by VV the real vector space of all real polynomials in one variable, and let P ⁣:V→RP\colon V \to \mathbb{R} be a linear map. Suppose that for all f,g∈Vf, g \in V with P(fg)=0P(fg) = 0 we have P(f)=0P(f) = 0 or P(g)=0P(g) = 0. Prove that there exist real numbers x0,cx_0, c such that P(f)=c f(x0)P(f) = c\,f(x_0) for all f∈Vf \in V.

Original from the official PDFDenote by V the real vector space of all real polynomials in one variable, and let P : V → R be a linear map. Suppose that for all f, g ∈ V with P (f g) = 0 we have P (f ) = 0 or P (g) = 0. Prove that there exist real numbers x 0 , c such that P (f ) = c f (x 0 ) for all f ∈ V .

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

Solution. We can assume that P≠0P \ne 0.

Let f∈Vf \in V be such that P(f)≠0P(f) \ne 0. Then P(f2)≠0P(f^2) \ne 0, and therefore P(f2)=aP(f)P(f^2) = aP(f) for some non-zero real aa. Then 0=P(f2−af)=P(f(f−a))0 = P(f^2 - af) = P(f(f-a)) implies P(f−a)=0P(f-a) = 0, so we get P(a)≠0P(a) \ne 0. By rescaling, we can assume that P(1)=1P(1) = 1. Now P(X+b)=0P(X+b) = 0 for b=−P(X)b = -P(X). Replacing PP by P^\hat{P} given as

P^(f(X))=P(f(X+b))\hat{P}(f(X)) = P(f(X+b))
we can assume that P(X)=0P(X) = 0.

Now we are going to prove that P(Xk)=0P(X^k) = 0 for all k≥1k \ge 1. Suppose this is true for all k<nk < n. We know that P(Xn+e)=0P(X^n + e) = 0 for e=−P(Xn)e = -P(X^n). From the induction hypothesis we get

P((X+e)(X+1)n−1)=P(Xn+e)=0,P\big((X+e)(X+1)^{n-1}\big) = P(X^n + e) = 0,
and therefore P(X+e)=0P(X+e) = 0 (since P(X+1)=1≠0P(X+1) = 1 \ne 0). Hence e=0e = 0 and P(Xn)=0P(X^n) = 0, which completes the inductive step. From P(1)=1P(1) = 1 and P(Xk)=0P(X^k) = 0 for k≥1k \ge 1 we immediately get P(f)=f(0)P(f) = f(0) for all f∈Vf \in V.

Transcribed from the official solutions, page 1. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?