Math 2.0

statement theorem

Hölder's inequality for sums

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.

Explanations

L1 human

Hölder's inequality bounds a sum of products by the sizes of the two sequences. Each size is measured with its own exponent, pp for one and qq for the other.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • 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

Sources

  1. Web https://en.wikipedia.org/wiki/Hölder%27s_inequality, Counting measure