08.10.2016 Views

Foundations of Data Science

2dLYwbK

2dLYwbK

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

1 + x ≤ e x for all real x<br />

(1 − x) n ≥ 1 − nx for 0 ≤ x ≤ 1<br />

(x + y) 2 ≤ 2x 2 + 2y 2<br />

Triangle Inequality<br />

|x + y| ≤ |x| + |y|.<br />

Cauchy-Schwartz Inequality<br />

|x||y| ≥ x T y<br />

Young’s Inequality For positive real numbers p and q where 1 + 1 p q<br />

positive reals x and y,<br />

xy ≤ 1 p xp + 1 q yq .<br />

= 1 and<br />

Hölder’s inequalityHölder’s inequality For positive real numbers p and q with 1 + p<br />

1<br />

= 1, q<br />

(<br />

n∑<br />

n∑<br />

) 1/p ( n∑<br />

) 1/q<br />

|x i y i | ≤ |x i | p |y i | q .<br />

i=1<br />

i=1<br />

i=1<br />

Jensen’s inequality For a convex function f,<br />

f<br />

( n∑<br />

i=1<br />

α i x i<br />

)<br />

≤<br />

n∑<br />

α i f (x i ),<br />

i=1<br />

Let g(x) = (1 − x) n − (1 − nx). We establish g(x) ≥ 0 for x in [0, 1] by taking<br />

the derivative.<br />

g ′ (x) = −n(1 − x) n−1 + n = n ( 1 − (1 − x) n−1) ≥ 0<br />

for 0 ≤ x ≤ 1. Thus, g takes on its minimum for x in [0, 1] at x = 0 where g(0) = 0<br />

proving the inequality.<br />

(x + y) 2 ≤ 2x 2 + 2y 2<br />

The inequality follows from (x + y) 2 + (x − y) 2 = 2x 2 + 2y 2 .<br />

Lemma 12.1 For any nonnegative reals a 1 , a 2 , . . . , a n and any ρ ∈ [0, 1], ( ∑ n<br />

i=1 a i) ρ<br />

≤<br />

∑ n<br />

i=1 aρ i . 381

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!