AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad algebra problems? Check out Art of Problem Solving's NEW Intermediate Algebra by Richard Rusczyk and Mathew Crawford. Over 1600 problems!
Personal tools

Hölder's Inequality

From AoPSWiki

(Redirected from Hölder's inequality)

Contents

Elementary Form

If a_1, a_2, \dotsc, a_n, b_1, b_2, \dotsc, b_n, \dotsc, z_1, z_2, \dotsc, z_n are nonnegative real numbers and \lambda_a, \lambda_b, \dotsc, \lambda_z are nonnegative reals with sum of 1, then \begin{align*}a_1^{\lambda_a}b_1^{\lambda_b} \dotsm z_1^{\lambda_z} + \dotsb &+ a_n^{\lambda_a} b_n^{\lambda_b} \dotsm z_n^{\lambda_z} \\\le{}& (a_1 + \dotsb + a_n)^{\lambda_a} (b_1 + \dotsb + b_n)^{\lambda_b} \dotsm (z_1 + \dotsb + z_n)^{\lambda_z} .\end{align*} Note that with two sequences and , and , this is the elementary form of the Cauchy-Schwarz Inequality.

We can state the inequality more concisely thus: Let \{ \{a_{ij}\}_{i=1}^n \} _{j=1}^m be several sequences of nonnegative reals, and let be a sequence of nonnegative reals such that . Then \sum_j \prod_i a_{ij}^{\lambda_i} \le \prod_i \biggl( \sum_j a_{ij} \biggr)^{\lambda_i} .

Proof of Elementary Form

We will use weighted AM-GM. We will disregard sequences for which one of the terms is zero, as the terms of these sequences do not contribute to the left-hand side of the desired inequality but may contribute to the right-hand side.

For integers , let us define \beta_k = \frac{\prod_i a_{ik}^{\lambda_i}}{\sum_j \prod_i a_{ij}^{\lambda_i}} . Evidently, . Then for all integers , by weighted AM-GM, \sum_j a_{ij} = \sum_j \beta_j \left(\frac{a_{ij}}{\beta_j} \right) \ge \prod_j \left( \frac{a_{ij}}{\beta_j} \right)^{\beta_j} . Hence \prod_i \biggl( \sum_j a_{ij} \biggr)^{\lambda_i} \ge \prod_i \prod_j \left( \frac{a_{ij}}{\beta_j} \right)^{\lambda_i \beta_j} = \prod_j \biggl[ \prod_i \Bigl( \frac{a_{ij}}{\beta_j} \Bigr)^{\lambda_i} \biggr]^{\beta_j} . But from our choice of , for all integers , \prod_i \left( \frac{a_{ij}}{\beta_j} \right)^{\lambda_i} = \frac{\prod_i a_{ij}^{\lambda_i}}{ \beta_k} = \frac{\prod_j a_{ij}^{\lambda_i}}{ \prod_j a_{ij}^{\lambda_i} / \sum_j \prod_i a_{ij}^{\lambda_i}} = \sum_j \prod_i a_{ij}^{\lambda_i} . Therefore \prod_j \biggl[ \prod_i \Bigl( \frac{a_{ij}}{\beta_j} \Bigr)^{\lambda_i} \biggr]^{\beta_j} = \prod_k \biggl( \sum_j \prod_i a_{ij}^{\lambda_i} \biggr)^{\beta_k} = \sum_j \prod_i a_{ij}^{\lambda_i}, since the sum of the is one. Hence in summary, \prod_i \biggl( \sum_j a_{ij} \biggr)^{\lambda_i} \ge \sum_j \prod_i a_{ij}^{\lambda_i} , as desired. Equality holds when a_{ij}/\beta_j = a_{ij'}/\beta_{j'} for all integers , i.e., when all the sequences are proportional.

Statement

If , , then and .

Proof

If then a.e. and there is nothing to prove. Case is similar. On the other hand, we may assume that for all . Let a=\frac{|f(x)|^p}{||f||_p^p}, b=\frac{|g(x)|^q}{||g||_q^q},\alpha=1/p,\beta=1/q. Young's Inequality gives us \frac{|f(x)|}{||f||_p}\frac{|g(x)|}{||g||_q} \leq \frac{1}{p}\frac{|f(x)|^p}{||f||_p^p} + \frac{1}{q}\frac{|g(x)|^q}{||g||_q^q}. These functions are measurable, so by integrating we get \frac{||fg||_1}{||f||_p||g||_q}\leq \frac{1}{p}\frac{||f(x)||^p}{||f||_p^p} + \frac{1}{q}\frac{||g(x)||^q}{||g||_q^q} = \frac{1}{p}+\frac{1}{q}=1 .

Examples

  • Prove that, for positive reals , the following inequality holds:
\left(1 + \frac {x}{y}\right)^k + \left(1 + \frac {y}{x}\right)^k\geq 2^{k+1}


This article has been found by the AoPSWiki Editors not to be written in wiki style. Help us out by putting this page in wiki style and removing this message.

Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us