Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $ p,r \geqslant 1, \; f \in L^r (\mathbb R), g \in L^p (\mathbb R), \; 2/q = 1/p + 1/r$. Here $ 2p / q > 1 $ and $ 2r / q > 1 $ . Also $ \frac{q}{2p} + \frac{q}{2r} = 1$. I want to prove following. $$ \sum_{k=1}^n \left( \int_{a_{k-1}}^{a_k} |g|^p \right)^{\frac{q}{2p}} \left( \int_{a_{k-1}}^{a_k} |f|^r \right)^{\frac{q}{2r}} \leqslant \left( \sum_{k=1}^n \int_{a_{k-1}}^{a_k} | g| ^p \right)^{\frac{q}{2p}}\left( \sum_{k=1}^n \int_{a_{k-1}}^{a_k} | f| ^r \right)^{\frac{q}{2r}} $$ for given real sequence $\{a_k\}$.

share|cite|improve this question
up vote 1 down vote accepted

Let $b_k:=\left(\int_{a_{k-1}}^{a_k}|g|^p\right)^{\frac q{2p}}$ and $c_k:=\left(\int_{a_{k-1}}^{a_k}|f|^q\right)^{\frac q{2r}}$. We have by Hölder's inequality for sums, applied to the exponents $\frac{2r}q$ and $\frac{2p}r$ that, $$\sum_{k=1}^nb_kc_k\leq \left(\sum_{k=1}^nb_k^{\frac{2p}q}\right)^{\frac q{2p}} \left(\sum_{j=1}^nc_j^{\frac{2r}q}\right)^{\frac q{2r}}.$$ The LHS corresponds to the LHS in the wanted inequality, and the same for the RHS.

share|cite|improve this answer
Oh, I understand this, really thank you. – Misaj Jun 17 '12 at 17:43
You are welcome. – Davide Giraudo Jun 17 '12 at 17:47

Your Answer


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.