Math 2.0

Real functions Theorem

Hölder's inequality for sums

Builds on Young's inequality for products

Statement

Let p,q>1p, q > 1 be real numbers with 1p+1q=1\frac{1}{p} + \frac{1}{q} = 1, and let a1,…,an,b1,…,bna_1, \dots, a_n, b_1, \dots, b_n be real numbers. Then ∑i=1n∣aibi∣≤(∑i=1n∣ai∣p)1/p(∑i=1n∣bi∣q)1/q.\sum_{i=1}^{n} |a_i b_i| \le \Big( \sum_{i=1}^{n} |a_i|^p \Big)^{1/p} \Big( \sum_{i=1}^{n} |b_i|^q \Big)^{1/q}.

Remarks

Scale so that both factors on the right are 11. Then apply Young's inequality to each product ∣ai∣∣bi∣|a_i| |b_i| and add. For p=q=2p = q = 2 it is the Cauchy–Schwarz inequality. Mathlib states a form as Real.inner_le_Lp_mul_Lq.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Inequality of arithmetic and geometric means statement
  2. Young's inequality for products statement
  3. Hölder's inequality for sums statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Hölder%27s_inequality, Counting measure
About this page
Tag0BKDAGMGX9
URIm2://0BKDAGMGX9
Kindstatement, theorem
WritingW1 stated
MSC26D15
StatusThis copy of the site has no build data. Run m2 status 0BKDAGMGX9.
UsesYoung's inequality for products

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.