SIMO Retiree Blog

(Guest author Andrew here!) A good exercise for Olympiad students is to prove the following: A real polynomial $f(x)\in \R[x]$ which is everywhere non-negative ( psd , short for positive semi-definite) must be a sum of squares ( sos ).  This is in some sense an algebraic witness to the analytic property of being non-negative, and is an example of what is known as a Positivstellensatz . One might reasonably ask whether this extends to the case of multiple variables, and it turns out the answer is no .  Consider the two variable polynomial $g(x,y)=x^4y^2+x^2y^4-3x^2y^2+1$ (the Motzkin polynomial ). Non-negativity follows from the AM-GM inequality. But how can we show that it isn't a sum of squares? We now introduce an object known as the Newton polytope. Given a polynomial $f$,  To every monomial with non-zero coefficient, assign a point whose $i^{th}$ coordinate is the degree of the $i^{th}$ variable in that monomial, e.g. assign to $x_1^n$ the point $(n, 0)$. The Newton p...

Hi, it's Choo Ray. Recently, I visited a SIMO National Team training session to soak in the atmosphere and meet some young friends. The session was about sequences and had quite a few interesting questions, so it was a pity that attendance was low (coincidentally many students were involved in the National Olympiad in Informatics). Today I would like to highlight a particular question that intrigued me and discuss some variations. Full Score For those of you looking for a challenge, I will list all variations here. Sequences, Example 2.3 Let $a_1,a_2,...$ and $b_1,b_2,...$ and $c_1,c_2,...$ be three arbitrary infinite sequences of positive integers. Prove that there exist different indices, $r,s,t$ such that $a_r \ge a_s \ge a_t$ and $b_r \ge b_s \ge b_t$ and $c_r \ge c_s \ge c_t$. Variation 1: Distinct positive integers Let $a_1,a_2,...$ and $b_1,b_2,...$ and $c_1,c_2,...$ be three arbitrary infinite sequences of distinct positive integers. Prove that there exist diffe...

(David here.) In this post, I go through a surprisingly tricky functional equation that appeared on the 2018 edition of the IMO Revenge, a contest where the contestants made problems for their trainers. The problem (IMO Revenge 2018/4) Find all functions $f:\mathbb{Q}\rightarrow\mathbb{R}$ such that $$f(x)^2-f(y)^2=f(x+y)\cdot f(x-y)$$ for all $x,y\in \mathbb{Q}$. Fun fact - I was actually at that IMO as an observer! I had good memories of attempting the test, solving problem 3 and meeting the contestant-proposer (who later went on to propose an actual IMO Q3). Initial observations Clearly, $f(x) = x$ works. Furthermore, the equation is homogeneous in $f$ - if $f$ works then so must $cf$. It's also cheap to get that $f(0) = 0$ and $f(-x) = -f(x)$. This was roughly where I ran out of cheap things to find - I didn't manage to get any more special values or any standard properties (like injectivity or surjectivity). Some progress When you get stuck on a functional equati...

(This is Yan Sheng.) Last time we studied a family of inequalities involving absolute values on linear polynomials, and asked the question of how lazy we can be to prove inequalities of that form. This week, we will be applying the same approach to a different family: 3-variable homogeneous symmetric inequalities of low degree. A polynomial $P(x,y,z)$ in 3 variables is called homogeneous of degree $d$ if each of its terms is of degree $d$, and symmetric if $P(x,y,z)=P(x',y',z')$ for all permutations $x',y',z'$ of $x,y,z$. Inequalities involving homogeneous symmetric polynomials include the AM-GM inequality$$\left(\frac{x+y+z}3\right)^3\ge xyz,$$and the Schur inequality$$x^r(x-y)(x-z)+y^r(y-x)(y-z)+z^r(z-x)(z-y)\ge0$$for integers $r\ge0$. For the rest of this post, write $\mathcal P^+_d$ for the family of all homogeneous symmetric polynomials $P(x,y,z)$ of degree $d$ such that $P(x,y,z)\ge0$ holds for all $x,y,z\ge0$. Our Main Problem is to describe $\math...

(This is Yan Sheng.) What does it mean to "properly understand" some mathematical result? For me, I find it the most satisfying when I can answer the following two questions: What is the minimal set of special cases that I need to verify to prove it? How could I have come up with it myself? In this and the next blog post, I'll describe two different situations in olympiad inequalities that I've tried to understand better recently, by answering the two questions above. Theorem (Popoviciu 1965): Let $f:[a,b]\to\mathbb R$ be a convex function. Then for any $x,y,z\in[a,b]$, we have$$\begin{align*}&f(x)+f(y)+f(z)+3f\left(\frac{x+y+z}3\right)\\&\ge2\left(f\left(\frac{x+y}2\right)+\left(\frac{y+z}2\right)+\left(\frac{z+x}2\right)\right).\end{align*}$$ What an interesting statement! It's not immediately clear how to prove it with Jensen's inequality, and it makes me wonder what other similar inequalities hold for convex functions. Let's try provin...