Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

I came across the following inequality, dubbed the "Neoclassical Inequality" which holds uniformly in $p\geq 1, n$:

$\frac{1}{p^2}\sum_{j=0}^n\frac{a^{j/p}b^{(n-j)/p}}{(j/p)!((n-j)/p)!}\leq \frac{(a+b)^{n/p}}{(n/p)!}$

Notice that if $p=1$, we get the binomial theorem. As well, the inequality is homogenous in $a$ and $b$ so wlog replace $a$ with $x$ and $b$ with $(1-x)$.

My question concerns the proof of this inequality, found in the paper here on page 254 (page 40 of the pdf), theorem 2.2.3.

Without going into too much detail (see the link above for the gory details), the idea of the proof is to define functions $F_{\theta_j}(x,v)$ which more-or-less correspond to individual terms of the sum and reduce the proof of the inequality to showing that

$\sum_{0}^nF_{\theta_j}(x,v)\leq 1 \ \ \ \ (\star)$

holds for all $v>1/n$ and all $x$. Now comes the key idea: we can prove $(\star)$ by showing that

$\left(\frac{\partial}{\partial x}(x(1-x))\frac{\partial}{\partial x}-\frac{\partial}{\partial v}\right)F_\theta\geq 0,$

so that by the maximum principle for sub-parabolic functions, we can conclude that any positive linear combination of the $F_\theta$ attains its maximum over the region $v>1/n,x\in(0,1)$ on its parabolic boundary. In particular, we get $(\star)$.

This is a technique that's new to me. I was wondering where else one can use such maximum principles to prove inequalities. It looks like the general idea is to find an appropriate parabolic differential operator for the inequality which makes the terms in the inequality a subsolution. More importantly, I was wondering when one should consider the inspiration to apply such a technique to proving an inequality.

share|improve this question

1 Answer 1

As far as I know this inequality was first proved by Terry Lyons in 90-s by standard method of Lagrange multipliers.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.