A simpler version of Hilbert's Inequality states that:
For any real numbers a1,a2⋯,an the following inequality holds:
∑ni=1∑nj=1aiaji+j≤π∑ni=1a2i.
I was reading a proof of this inequality where first they applied Cauchy Schwarz to get (∑ni=1∑nj=1aiaji+j)2≤(∑ni=1∑nj=1√ia2i√j(i+j))(∑ni=1∑nj=1√ja2j√i(i+j)).
Then they stated that it suffices to prove ∑∞n=1√m(m+n)√n≤π for any positive integer m.
Can someone explain why this is true? I tried manipulating the expression in a lot of different ways but couldn't conclude the result above. I'd appreciate any ideas or thoughts.
Answer
You can show that ∞∑n=1√m(m+n)√n<∫∞0√m(m+x)√xdx=(2arctan(√xm))|x=∞x=0=π.
No comments:
Post a Comment