Young's inequality for products explained

In mathematics, Young's inequality for products is a mathematical inequality about the product of two numbers. The inequality is named after William Henry Young and should not be confused with Young's convolution inequality.

Young's inequality for products can be used to prove Hölder's inequality. It is also widely used to estimate the norm of nonlinear terms in PDE theory, since it allows one to estimate a product of two terms by a sum of the same terms raised to a power and scaled.

Standard version for conjugate Hölder exponents

The standard form of the inequality is the following, which can be used to prove Hölder's inequality.

A second proof is via Jensen's inequality.

Yet another proof is to first prove it with

b = 1 an then apply the resulting inequality to \tfrac{a}{b ^{q}} . The proof below illustrates also why Hölder conjugate exponent is the only possible parameter that makes Young's inequality hold for all non-negative values. The details follow:

Young's inequality may equivalently be written as$$a^\backslash alpha\; b^\backslash beta\; \backslash leq\; \backslash alpha\; a\; +\; \backslash beta\; b,\; \backslash qquad\backslash ,\; 0\; \backslash leq\; \backslash alpha,\; \backslash beta\; \backslash leq\; 1,\; \backslash quad\backslash \; \backslash alpha\; +\; \backslash beta\; =\; 1.$$

Where this is just the concavity of the logarithm function.Equality holds if and only if

a = b or \{\alpha, \beta\} = \{ 0 , 1 \}. This also follows from the weighted AM-GM inequality.

Generalizations

Elementary case

2 , $$a\; b\; \backslash leq\; \backslash frac\; +\; \backslash frac,$$which also gives rise to the so-called Young's inequality with \varepsilon (valid for every \varepsilon > 0 ), sometimes called the Peter–Paul inequality.^[1] This name refers to the fact that tighter control of the second term is achieved at the cost of losing some control of the first term – one must "rob Peter to pay Paul"$$a\; b\; ~\backslash leq~\; \backslash frac\; +\; \backslash frac.$$

Proof: Young's inequality with exponent

2 is the special case p = q = 2 . However, it has a more elementary proof.

Start by observing that the square of every real number is zero or positive. Therefore, for every pair of real numbers

a and b we can write:$$0\; \backslash leq\; (a-b)^2$$ Work out the square of the right hand side:$$0\; \backslash leq\; a^2\; -\; 2\; a\; b\; +\; b^2$$ Add 2 a b to both sides:$$2\; a\; b\; \backslash leq\; a^2\; +\; b^2$$Divide both sides by 2 and we have Young's inequality with exponent 2 : $$a\; b\; \backslash leq\; \backslash frac\; +\; \backslash frac$$

Young's inequality with

\varepsilon follows by substituting a' and b' as below into Young's inequality with exponent 2 : $$a\text{'}\; =\; a/\backslash sqrt,\; \backslash ;\; b\text{'}\; =\; \backslash sqrt\; b.$$

Matricial generalization

T. Ando proved a generalization of Young's inequality for complex matrices ordered by Loewner ordering.^[2] It states that for any pair

A, B of complex matrices of order n there exists a unitary matrix U such that$$U^*\; |A\; B^*|\; U\; \backslash preceq\; \backslash tfrac\; |A|^p\; +\; \backslash tfrac\; |B|^q,$$where {} ^{*} denotes the conjugate transpose of the matrix and |A| = \sqrt{A ^{*} A}.

Standard version for increasing functions

For the standard version^{[3] [4]} of the inequality,let

f denote a real-valued, continuous and strictly increasing function on [ 0 , c] with c > 0 and f( 0 ) = 0 . Let f ^{-1} denote the inverse function of f. Then, for all a \in [ 0 , c] and b \in [ 0 , f(c)], $$a\; b\; ~\backslash leq~\; \backslash int\_0^a\; f(x)\backslash ,dx\; +\; \backslash int\_0^b\; f^(x)\backslash ,dx$$with equality if and only if b = f(a).

With

f(x) = x ^{p-1} and f ^{-1} (y) = y ^{q-1} , this reduces to standard version for conjugate Hölder exponents.

For details and generalizations we refer to the paper of Mitroi & Niculescu.^[5]

Generalization using Fenchel–Legendre transforms

By denoting the convex conjugate of a real function

f by g, we obtain$$a\; b\; ~\backslash leq~\; f(a)\; +\; g(b).$$This follows immediately from the definition of the convex conjugate. For a convex function f this also follows from the Legendre transformation.

More generally, if

f is defined on a real vector space X and its convex conjugate is denoted by f ^{\star} (and is defined on the dual space X ^{\star} ), then$$\backslash langle\; u,\; v\; \backslash rangle\; \backslash leq\; f^\backslash star(u)\; +\; f(v).$$where \langle ⋅ , ⋅ \rangle : X ^{\star} x X \to \Reals is the dual pairing.

Examples

The convex conjugate of

f(a) = a ^{p} / p is g(b) = b ^{q} / q with q such that \tfrac{ 1 }{p} + \tfrac{ 1 }{q} = 1 , and thus Young's inequality for conjugate Hölder exponents mentioned above is a special case.

The Legendre transform of

f(a) = e ^{a} - 1 is g(b) = 1 - b + b ln b , hence a b \leq e ^{a} - b + b ln b for all non-negative a and b. This estimate is useful in large deviations theory under exponential moment conditions, because b ln b appears in the definition of relative entropy, which is the rate function in Sanov's theorem.

External links

• Young's Inequality at PlanetMath

Notes and References

1. ,
2. Book: T. Ando. Huijsmans. C. B.. Kaashoek. M. A.. Luxemburg. W. A. J.. de Pagter. B.. 3. Operator Theory in Function Spaces and Banach Lattices. 1995. Springer. 978-3-0348-9076-2. 33–38. Matrix Young Inequalities.
3. , Chapter 4.8
4. , Theorem 2.9
5. Mitroi, F. C., & Niculescu, C. P. (2011). An extension of Young's inequality. In Abstract and Applied Analysis (Vol. 2011). Hindawi.