Chapter 9: Basic of Hypercontractivity
|
|
- Gervais Giles Blake
- 5 years ago
- Views:
Transcription
1 Analysis of Boolean Functions Prof. Ryan O Donnell Chapter 9: Basic of Hypercontractivity Date: May 6, 2017 Student: Chi-Ning Chou Index Problem Progress 1 Exercise 9.3 (Tightness of Bonami Lemma) 2/2 2 Exercise 9.6 (Bonami Lemma implies (2,4)-Hypercontractivity) 4/4 3 Exercise 9.9 (Basic properties of (p, q, ρ)-hypercontractivity) 2/2 4 Exercise 9.10 (Basic properties of (p, q, ρ)-hypercontractivity) 2/2 5 Exercise 9.11 (Basic properties of (p, q, ρ)-hypercontractivity) 3/3 6 Exercise 9.14 ((p, 2)-Bonami Lemma) 2/2 7 Exercise 9.15 (Generality of Theorem 9.22) 1/1 8 Exercise 9.16 ((2, q)-hypercontractivity by induction of derivative) 1/1 9 Exercise 9.18 (Sharpen Level-1 Inequality) 2/2 10 Exercise 9.19 (Level-k inequalities) 2/2 11 Exercise 9.20 (KKL fails for function with range [ 1, 1]) 1/1 14 Exercise 9.29 (General-variance KKL) 1/1 15 Exercise 9.30 (State-of-the-art constant of KKL) 2/3 16 Exercise 9.31 (Delicate version of Theorem 9.28) 1/1 Table 1: Problem Set 6: Progress 1
2 Problem 1. Exercise 9.3 (Tightness of Bonami Lemma) (a) Let A := {S 1 S 2 S 7 ( E[f 4 ] = E x { 1,1} n[ = = [n] ) k }, we have 3, k 3,..., k 3,n 2k x T 1 x T 2 x T 3 x T 4 ] (1) T 1,...,T 4 [n], T 1 = = T 4 =k T 1,...,T 4 [n], T 1 = = T 4 =k S 1 S 7 A S 1 S 7 A E x { 1,1} n[x T 1 x T 2 x T 3 x T 4 ] (2) E x { 1,1} n[x S 1 S 2 S 3 x S 4 S 5 S 6 x S 1 S 3 S 5 x S 2 S 4 S 6 ] (3) E x { 1,1} n[(x i [6]S i ) 2 ] (4) ( ) n = A = k 3, k 3,..., k 3, n 2k. (5) Also, E[f 2 ] = E x { 1,1} n[ = = T 1,T 2 [n], T 1 = T 2 =k T [n], T =k T 1,T 2 [n], T 1 = T 2 =k 1 = x T 1 x T 2 ] (6) E x { 1,1} n[x T 1 x T 2 ] (7) ( ) n. (8) k As a result, we have E[f 4 ] ( n ) 1 = k 3, k 3,..., k 3,n 2k E[f 2 ] 2 ( n k) 2. (9) (b) Expand the formula, we have ( n ) k 3,..., k 3 (,n 2k n k ) 2 = (n) 2k (k!) 2 (n) 2 k ( k, (10) 3!)6 where (n) k = n (n 1) (n k + 1). By Stirling s formula and taking n, we have (k!) 2 (n) 2k lim n (n) 2 k Plug-in (a), we have f 4 Ω(k 1/2 ) 3 k f 2. ( k 3!)6 = Θ(k 2 9 k ), (11) = 1. (12) 2
3 Problem 2. Exercise 9.6 (Bonami Lemma implies (2,4)-Hypercontractivity) (a) By triangle inequality, Bonami lemma, and the fact that f =k 2 f 2 for any k N, we have T (1 δ)/ 3 f 4 ( Bonami lemma) = T (1 δ)/ 3 f =k 4 (13) k=0 k 3 T(1 δ)/ 3 f =k 2 (14) k=0 (1 δ) k f =k 2 (15) k=0 (1 δ) k f 2 1 δ f 2. (16) k=0 Note that k=0 f =k 2 2 = f 2 2 by Parseval s equality. (b) Here, we show that for any h : { 1, 1} n R, g d p = g d p for any p R + and d N +. g d p p = g(x (1) ) p g(x (2) ) p g(x (d) ) p (17) x (1),x (2),...,x (d) { 1,1} n d ( ) = (18) i=1 (c) Apply (a) on T (1 δ)/ 3 f d we get x (i) { 1,1} n g(x (i) ) p = g dp p. (19) T (1 δ)/ 3 f d 4 = T (1 δ)/ 3 f d 4 (20) 1 δ f d 2 = 1 δ f d 2. (21) That is, T (1 δ)/ 3 f 4 ( 1 δ )1/d f 2. When d, we have T (1 δ)/ 3 f 4 f 2. (d) Take δ 0 +, we have T 1/ 3 f 4 f 2, i.e., the (2,4)-Hypercontractivity Theorem. 3
4 Problem 3. Exercise 9.9 (Basic properties of (p, q, ρ)-hypercontractivity) (a) For any a, b R, Thus, cx is (p, q, ρ)-hypercontractive. a + ρb(cx) q = a + ρbcx q (22) a + bcx p (23) = a + b(cx) p. (24) (b) Take a = 0 and b = 1, by the (p, q, ρ)-hypercontractivity of X, we have Thus, ρ X p X q. ρ X q = ρx q (25) X p. (26) 4
5 Problem 4. Exercise 9.10 (Basic properties of (p, q, ρ)-hypercontractivity) (a) By Taylor expansion to the first order, we have 1 + bx r 1 + be[x] + O(b 2 ). (27) As X is (p, q, ρ)-hypercontractive, we have 1 + ρɛx q 1 + ɛx p. Combine with (27), we have 1 + ρɛe[x] + O(ρ 2 ɛ 2 ) 1 + ɛe[x] + O(ɛ 2 ). (28) By letting ɛ 0 +, as 0 < ρ < 1, there exists ɛ 0 such that As ρ <, the above inequality holds only if E[X] = 0. ρɛ 0 E[X] ɛ 0 E[X]. (29) (b) To Taylor expand 1 + bx r, let s compute d 2 d(bx i ) bx r as follows. d 1 + bx r = b 1 + bx 1 r r (1 + bx i ) r 1, (30) dx i d 2 dx 2 i 1 + bx r = (1 r)b bx 1 2r r Thus, Taylor expand 1 + bx r to the second order, we have (1 + bx i ) 2r 1 + b(r 1) 1 + b 2 X 1 r r (1 + bx i ) r 2. (31) 1 + bx r = 1 + be[x] + b2 (r 1) E[X 2 ] + O(b 3 ) (32) 2 From (a), we know that E[X] = 0 so by the (p, q, ρ)-hypercontractivity of X, we have 1 + ρ2 ɛ 2 (q 1) 2 Similarly, when ɛ 0 +, there exists ɛ 0 > 0 such that That is, ρ p 1 q 1. E[X 2 ] + O(ɛ 3 ρ 3 ) 1 + ɛ2 (p 1) E[X 2 ] + O(ɛ 3 ). (33) 2 ρ 2 ɛ 2 0(q 1)E[X 2 ] ɛ 2 0(p 1)E[X 2 ]. (34) 5
6 Problem 5. Exercise 9.11 (Basic properties of (p, q, ρ)-hypercontractivity) (a) For any a, b R, Thus, X is (q, q, 0)-hypercontractive. (b) WLOG, consider arbitrary a R, a + 0 bx q = a (35) = E[a + bx] (36) E[ a + bx ] (37) = a + bx 1 (38) a + bx q. (39) a + ρx q = (1 ρ)a + ρ(a + X) q (40) Thus, X is (q, q, ρ)-hypercontractive for any 0 ρ 1. (1 ρ)a + ρ a + X q (41) (1 ρ) a + X q + ρ a + X q (42) = a + X q. (43) (c) By Exercise 9.10 (a), E[X] = 0. Let 0 ρ ρ 1. By Exercise 9.11 (b), X is (q, q, ρ /ρ)- hypercontractive. That is, for any a, b R, a + ρ bx q a + ρbx q (44) a + bx p, (45) where the first inequality is due to the (q, q, ρ /ρ)-hypercontractivity and the second inequality is due to the (p, q, ρ)-hypercontractive. Thus, if X is (p, q, ρ)-hypercontractive, then X is also (p, q, ρ )-hypercontractive for any 0 ρ ρ. 6
7 Problem 6. Exercise 9.14 ((p, 2)-Bonami Lemma) (a) For any 1 p 2, take q = By Holder s inequality, we have p p 1 2. By Theorem 9.21 (the (2, q)-bonami Lemma), we have f q q 1 k f 2. (46) f 2 2 f p f q. (47) Combine the above two equations, we have the (p, 2)-Bonami Lemma as follows. f 2 k 1 f p. (48) p 1 (b) It suffices to show that exp(2 4 p ) > p 1 for any 1 p < 2. First, observe that when p = 2, the two sides are both equal to 1. Next, differentiate both sides and get By first order Taylor approximation, d dp LHS = 4 p 2 exp(2 4 ), p (49) d RHS = 1. dp (50) e 2 p p 1 = 2 p. (51) Plug-in (49) and (50), we have d p LHS d dprhs and thus the inequality holds. 7
8 Problem 7. Exercise 9.15 (Generality of Theorem 9.22) Similarly to the proof of Theorem 9.22, take 1 p 2 such that 1 2 = θ p + 1 θ 2+ɛ θ and ɛ > 0. By the interpolation version of Holder s inequality, we have for some f 2 f θ p f 1 θ 2+ɛ (52) f θ p 1 + ɛ k(1 θ) f 1 θ 2. (53) That is, Compute that Let ɛ 0 +, we have f 2 (1 + ɛ) 1 θ 2θ k f p. (54) 1 θ 2θ θ = ɛp 2(2 + ɛ p), (55) = ( 2 p 1)1 ɛ + 1 p 1 2. (56) f 2 e k( 2 p 1) f p. (57) 8
9 Problem 8. Exercise 9.16 ((2, q)-hypercontractivity by induction of derivative) Let s prove the (2, q)-hypercontractivity theorem using induction of derivative. Recall that f = e + x n d. That is, by the linearity of T, we can rewrite T f q as follows. As (1/ q 1) 1 and x n { 1, 1}, we have T f 2 q = T e + (1/ q 1)x n T d 2 q (58) = E x [E xn [ T e + (1/ q 1)x n T d q ]] 2/q (59) ( = E x [E xn [ T e + (1/ q 1)x n T d 2) q/2 ]] 2/q (60) E xn [ T e + (1/ q 1)x n T d 2 ] = (T e) q 1 (T d)2 (T e) 2 + (T d) 2. (61) Since h(t) = t q/2 is convex when q 2, we have E xn [ ( T e + (1/ q 1)x n T d 2) q/2 ( ] E xn [ T e + (1/ q/2. q 1x n T d) ]) 2 (62) Combine (61) and (62), we have E x [E xn [ T e + (1/ ( q 1)x n T d q ]] 2/q E x [ (T e) 2 + (T d) 2) q/2 ] 2/q = (T e) 2 + (T d) 2 q/2. (63) By the triangle inequality of q/2, we have (T e) 2 + (T d) 2 q/2 (T e) 2 q/2 + (T d) 2 q/2 = T e 2 q + T d 2 q. (64) By induction hypothesis, T e 2 q/2 e 2 q and T d 2 2 d 2 2. Thus, we conclude that T f 2 q e d 2 2 = f 2 2. (65) 9
10 Problem 9. Exercise 9.18 (Sharpen Level-1 Inequality) (a) Combine the fact that E[f] = α and the expansion of stability of f, for any 0 < ρ 1, we have Stab ρ [f] = n ρ k W k [f] (66) k=0 Also, by the Small-Set Expansion theorem, Thus, W 1 [f] 1 ρ (α 2 1 ρ α 2 ). (b) Reformulate the RHS in (a), we have ρw 1 [f] + E[f] 2 = ρw 1 [f] + α 2. (67) Stab ρ [f] α 2 1 ρ. (68) 1 ρ (α 2 1 ρ α 2 ) = α 2 1 2ρ (α 1 ρ 1) ρ (69) = α 2 1 2ρ ln α (1 ρ 1 ρ + O(ρ2 ) 1) (70) = α 2 ( 2 ln(1/α) + O(ρ)). 1 ρ (71) Let ρ 0 and combine with (a), we have W 1 [f] 2α 2 ln(1/α). 10
11 Problem 10. Exercise 9.19 (Level-k inequalities) (a) Plug-in k ɛ = 2e 1 ɛ ln(1/α), we have (b) By second order Taylor expansion, we have W k 2e [f] ( 2 ln(1/α)(1 ɛ) ln(1/α))2(1 ɛ) ln(1/α) α 2 (72) e = ( 1 ɛ )2(1 ɛ) ln(1/α) α 2 (73) = α 2 2(1 ɛ)(1 ln(1 ɛ)) (74) = α 2ɛ 2(1 ɛ) ln(1/(1 ɛ)). (75) ln(1 ɛ) ɛ + ɛ2 2. (76) Thus, α 2ɛ 2(1 ɛ) ln(1/(1 ɛ)) = α 2ɛ+2(1 ɛ) ln((1 ɛ)) (77) α 2ɛ+2(1 ɛ)( ɛ+ɛ2 /2) (78) = α 2ɛ2 ɛ 2 = α ɛ2. (79) 11
12 Problem 11. Exercise 9.20 (KKL fails for function with range [ 1, 1]) i [n] Consider f(x) = trunc( x i n ) and let f (x) = Var[f] P[ i [n] x i n. Observe that i [n] x i n > 1] = Ω(1). (80) Also, for any i [n], As Inf i [f ] = E[x i ][(D i f ) 2 ] = 1 n, we have As a result, the statement of KKL doesn t hold on f. Inf i [f] Inf i [f ]. (81) MaxInf[f] MaxInf[f ] = 1 n. (82) 12
13 Problem 12. Exercise 9.24 (Hamming ball achieves Small-Set Expansion stability bound) By Small-Set Expansion theorem, we have an upper bound for the ρ-stability of indicator function. Concretely, for any A { 1, 1} n, E[1 A ] = α, we have Stab ρ [1 A ] α 2 1+ρ. (83) In this exercise, we are going to show that the Hamming ball indicator function will asymptotically achieve the bound by proving that Λ ρ (Φ 1 (t)) = Θ(µ 2 1+ρ ). (84) (a) 13
14 Problem 13. Exercise 9.25 (a) 14
15 Problem 14. Exercise 9.29 (General-variance KKL) It suffices to prove that S: S 1 ( 1 3 ) S f(s) 2 Var[f] 3 I[f]/ Var[f]. Recall that Var[f] = S: S 1 f(s) 2. Thus, by the concavity of h(t) = (1/3) t, we have S: S 1 f(s) 2 Var[f] (1 3 ) S ( 1 f(s) 2 3 ) S: S 1 Var[f] S (85) = 3 I[f]/ Var[f]. (86) Note that replace 1 3 with 0 < ρ < 1, we have ρ S f(s) 2 Var[f] ρ I[f]/ Var[f]. (87) S: S 1 15
16 Problem 15. Exercise 9.30 (State-of-the-art constant of KKL) (a) From Exercise 9.29, we have S: S 1 ρ S f(s) 2 Var[f] ρĩ[f]. (88) Note that the LHS is upper bounded by 1 ρ I(ρ) [f] because I (ρ) [f] = S S ρ S 1 f(s) 2 (89) 1 ρ S: S 1 Also, for each i [n], by Corollary 9,25, we have Thus, we have I (ρ) [f] = i [n] ρ S f(s) 2. (90) I (ρ) i [f] I i [f] 2 1+ρ. (91) I (ρ) i [f] I i [f] 2 1+ρ MaxInf[f] 1 ρ 1+ρ I[f]. (92) i [n] As a result, from (88), (90), and (92), we have MaxInf[f] 1 ρ 1+ρ 1 ρ Ĩ[f] 1 ρĩ[f]. (93) For any 0 < δ < 1, take ρ = 1 δ 1+δ 1 ρ (0, 1) such that δ = 1+ρ. We have MaxInf[f] ( 1 + δ 1 δ ) 1 δ ( 1 Ĩ[f] ) 1 δ ( 1 δ 1 + δ ) 1 δ Ĩ[f]. (94) Now, consider how small the base of Ĩ[f] can be. ( 1 + δ 1 δ )1/δ > ( /δ )1/δ. (95) Note that the RHS is a non-decreasing function. Thus, it suffices to lower bound the case when δ 0. lim (1 + 2 δ 0 1/δ )1/δ = e 2. (96) As a result, we have for any C > e 2 MaxInf[f] Ω(C Ĩ[f] ). (97) 16
17 (b) Let s lower bound ( 1 δ 1+δ )1/δ for 0 < δ < 1/2. By the definition of e, we have ( 1 δ ( 1 + δ )1/δ = (1 2δ 1 + δ )1+δ/δ) 1/(1+δ) (98) ( e 2) 1/(1+δ). (99) When 0 < δ < 1/2, by second order Taylor expansion, we have Combine (99) and (100), we have δ = (1 + δ) 1 1 δ + δ δ2 2. (100) Now, take δ = 1, by (94), (96), and (101), we have 2Ĩ[f]1/3 ( 1 δ 1 + δ )1/δ e 2 δ2. (101) MaxInf[f] ( 1 + δ 1 δ ) 1 δ ( 1 Ĩ[f] ) 1 δ ( 1 δ 1 + δ ) 1 δ Ĩ[f] (102) e 2 ( 1 Ĩ[f] )2Ĩ[f]1/3 exp( 2Ĩ[f]) exp( Ĩ[f]1/3 ). (103) 4 17
18 ρ k S / F Problem 16. Exercise 9.31 (Delicate version of Theorem 9.28) Similarly, we take the parameters in Theorem 9.28 in the following setting. For any η > 0, 0 ɛ < 1, and k 0, define τ = ɛ1+η I[f] 1+η C(η) k, J = {j [n] : I j [f] τ}, so J I[f]2+η ɛ 1+η C(η)k. (104) Also, define F = {S : S J} {S : S > k}. (105) Now, consider 0 < ρ < 1 chosen later according to η. The idea is to upper bound i/ J I(ρ) i [f] with the error and lower bound it with the Fourier mass not in F. By Corollary 9.25 i/ J I (ρ) i [f] I[f] 2 1+ρ i/ J (106) max i[f] 1 ρ 1+ρ I i [f] i/ J (107) τ 1 ρ 1+ρ I[f] = i/ J I[f] ɛ(1+η) 1 ρ 1+ρ 1 ρ (1+η) 1+ρ 1 ρ C(η) k 1+ρ. (108) 1 As to the lower bound, we have I (ρ) i [f] = i/ J i/ J = S S / F S: i S ρ S 1 f(s) 2 S J ρ S 1 f(s) 2 ρ S 1 f(s) 2 (109) (110) (111) f(s) 2. (112) Now, take ρ = η 2+η = C(η)1/2, we have 1 + η = 1+ρ 1 ρ C(η) k/2 S / F f(s) 2 i/ J. As a result, (108) and (112) become I (ρ) i [f] C(η) k/(1+η) ɛ (113) That is, S / F f(s) 2 C(η) k( η ) ɛ. (114) 18
19 Problem 17. (a) 19
20 Problem 18. (a) 20
21 Problem 19. (a) 21
22 Problem 20. (a) 22
CSE 291: Fourier analysis Chapter 2: Social choice theory
CSE 91: Fourier analysis Chapter : Social choice theory 1 Basic definitions We can view a boolean function f : { 1, 1} n { 1, 1} as a means to aggregate votes in a -outcome election. Common examples are:
More informationReverse Hyper Contractive Inequalities: What? Why?? When??? How????
Reverse Hyper Contractive Inequalities: What? Why?? When??? How???? UC Berkeley Warsaw Cambridge May 21, 2012 Hyper-Contractive Inequalities The noise (Bonami-Beckner) semi-group on { 1, 1} n 1 2 Def 1:
More informationMATH 217A HOMEWORK. P (A i A j ). First, the basis case. We make a union disjoint as follows: P (A B) = P (A) + P (A c B)
MATH 217A HOMEWOK EIN PEASE 1. (Chap. 1, Problem 2. (a Let (, Σ, P be a probability space and {A i, 1 i n} Σ, n 2. Prove that P A i n P (A i P (A i A j + P (A i A j A k... + ( 1 n 1 P A i n P (A i P (A
More informationContinuity. Matt Rosenzweig
Continuity Matt Rosenzweig Contents 1 Continuity 1 1.1 Rudin Chapter 4 Exercises........................................ 1 1.1.1 Exercise 1............................................. 1 1.1.2 Exercise
More informationAn upper bound on l q norms of noisy functions
Electronic Collouium on Computational Complexity, Report No. 68 08 An upper bound on l norms of noisy functions Alex Samorodnitsky Abstract Let T ɛ, 0 ɛ /, be the noise operator acting on functions on
More informationLecture 7. 1 Notations. Tel Aviv University Spring 2011
Random Walks and Brownian Motion Tel Aviv University Spring 2011 Lecture date: Apr 11, 2011 Lecture 7 Instructor: Ron Peled Scribe: Yoav Ram The following lecture (and the next one) will be an introduction
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationHypercontractivity of spherical averages in Hamming space
Hypercontractivity of spherical averages in Hamming space Yury Polyanskiy Department of EECS MIT yp@mit.edu Allerton Conference, Oct 2, 2014 Yury Polyanskiy Hypercontractivity in Hamming space 1 Hypercontractivity:
More informationThus f is continuous at x 0. Matthew Straughn Math 402 Homework 6
Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some
More informationHomework 1 Solutions Math 587
Homework 1 Solutions Math 587 1) Find positive functions f(x),g(x), continuous on (0, ) so that f = O(g(x)) as x 0, but lim x 0 f(x)/g(x) does not exist. One can take f(x) = sin(1/x) and g(x) = 1, for
More informationPhenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012
Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 202 BOUNDS AND ASYMPTOTICS FOR FISHER INFORMATION IN THE CENTRAL LIMIT THEOREM
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationCALCULUS JIA-MING (FRANK) LIOU
CALCULUS JIA-MING (FRANK) LIOU Abstract. Contents. Power Series.. Polynomials and Formal Power Series.2. Radius of Convergence 2.3. Derivative and Antiderivative of Power Series 4.4. Power Series Expansion
More information2. Metric Spaces. 2.1 Definitions etc.
2. Metric Spaces 2.1 Definitions etc. The procedure in Section for regarding R as a topological space may be generalized to many other sets in which there is some kind of distance (formally, sets with
More informationCompletion Date: Monday February 11, 2008
MATH 4 (R) Winter 8 Intermediate Calculus I Solutions to Problem Set #4 Completion Date: Monday February, 8 Department of Mathematical and Statistical Sciences University of Alberta Question. [Sec..9,
More informationLecture 3: Expected Value. These integrals are taken over all of Ω. If we wish to integrate over a measurable subset A Ω, we will write
Lecture 3: Expected Value 1.) Definitions. If X 0 is a random variable on (Ω, F, P), then we define its expected value to be EX = XdP. Notice that this quantity may be. For general X, we say that EX exists
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More information1 Dimension Reduction in Euclidean Space
CSIS0351/8601: Randomized Algorithms Lecture 6: Johnson-Lindenstrauss Lemma: Dimension Reduction Lecturer: Hubert Chan Date: 10 Oct 011 hese lecture notes are supplementary materials for the lectures.
More informationconverges as well if x < 1. 1 x n x n 1 1 = 2 a nx n
Solve the following 6 problems. 1. Prove that if series n=1 a nx n converges for all x such that x < 1, then the series n=1 a n xn 1 x converges as well if x < 1. n For x < 1, x n 0 as n, so there exists
More informationThe Moment Method; Convex Duality; and Large/Medium/Small Deviations
Stat 928: Statistical Learning Theory Lecture: 5 The Moment Method; Convex Duality; and Large/Medium/Small Deviations Instructor: Sham Kakade The Exponential Inequality and Convex Duality The exponential
More informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
More informationLARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011
LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS S. G. Bobkov and F. L. Nazarov September 25, 20 Abstract We study large deviations of linear functionals on an isotropic
More informationSection Taylor and Maclaurin Series
Section.0 Taylor and Maclaurin Series Ruipeng Shen Feb 5 Taylor and Maclaurin Series Main Goal: How to find a power series representation for a smooth function us assume that a smooth function has a power
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More informationAnalysis of Boolean Functions
Analysis of Boolean Functions Kavish Gandhi and Noah Golowich Mentor: Yufei Zhao 5th Annual MIT-PRIMES Conference Analysis of Boolean Functions, Ryan O Donnell May 16, 2015 1 Kavish Gandhi and Noah Golowich
More information8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0
8.7 Taylor s Inequality Math 00 Section 005 Calculus II Name: ANSWER KEY Taylor s Inequality: If f (n+) is continuous and f (n+) < M between the center a and some point x, then f(x) T n (x) M x a n+ (n
More information0.1 Uniform integrability
Copyright c 2009 by Karl Sigman 0.1 Uniform integrability Given a sequence of rvs {X n } for which it is known apriori that X n X, n, wp1. for some r.v. X, it is of great importance in many applications
More informationMath 651 Introduction to Numerical Analysis I Fall SOLUTIONS: Homework Set 1
ath 651 Introduction to Numerical Analysis I Fall 2010 SOLUTIONS: Homework Set 1 1. Consider the polynomial f(x) = x 2 x 2. (a) Find P 1 (x), P 2 (x) and P 3 (x) for f(x) about x 0 = 0. What is the relation
More informationMath 3T03 - Topology
Math 3T03 - Topology Sang Woo Park April 5, 2018 Contents 1 Introduction to topology 2 1.1 What is topology?.......................... 2 1.2 Set theory............................... 3 2 Functions 4 3
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationGeometric Series and the Ratio and Root Test
Geometric Series and the Ratio and Root Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2018 Outline 1 Geometric Series
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background We have seen that some power series converge. When they do, we can think of them as
More informationQuantum boolean functions
Quantum boolean functions Ashley Montanaro 1 and Tobias Osborne 2 1 Department of Computer Science 2 Department of Mathematics University of Bristol Royal Holloway, University of London Bristol, UK London,
More informationIf g is also continuous and strictly increasing on J, we may apply the strictly increasing inverse function g 1 to this inequality to get
18:2 1/24/2 TOPIC. Inequalities; measures of spread. This lecture explores the implications of Jensen s inequality for g-means in general, and for harmonic, geometric, arithmetic, and related means in
More informationLecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain.
Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain. For example f(x) = 1 1 x = 1 + x + x2 + x 3 + = ln(1 + x) = x x2 2
More informationExercise Solutions to Functional Analysis
Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n
More informationLecture 10: Hypercontractivity
CS 880: Advanced Comlexity Theory /15/008 Lecture 10: Hyercontractivity Instructor: Dieter van Melkebeek Scribe: Baris Aydinlioglu This is a technical lecture throughout which we rove the hyercontractivity
More informationDECOUPLING LECTURE 6
18.118 DECOUPLING LECTURE 6 INSTRUCTOR: LARRY GUTH TRANSCRIBED BY DONGHAO WANG We begin by recalling basic settings of multi-linear restriction problem. Suppose Σ i,, Σ n are some C 2 hyper-surfaces in
More informationMcGill University Math 354: Honors Analysis 3
Practice problems McGill University Math 354: Honors Analysis 3 not for credit Problem 1. Determine whether the family of F = {f n } functions f n (x) = x n is uniformly equicontinuous. 1st Solution: The
More informationPart IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Theorems Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationf(x) f(z) c x z > 0 1
INVERSE AND IMPLICIT FUNCTION THEOREMS I use df x for the linear transformation that is the differential of f at x.. INVERSE FUNCTION THEOREM Definition. Suppose S R n is open, a S, and f : S R n is a
More informationWorkshop on Discrete Harmonic Analysis Newton Institute, March 2011
High frequency criteria for Boolean functions (with an application to percolation) Christophe Garban ENS Lyon and CNRS Workshop on Discrete Harmonic Analysis Newton Institute, March 2011 C. Garban (ENS
More informationUpper Bounds for Partitions into k-th Powers Elementary Methods
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 9, 433-438 Upper Bounds for Partitions into -th Powers Elementary Methods Rafael Jaimczu División Matemática, Universidad Nacional de Luján Buenos Aires,
More informationCLASSICAL PROBABILITY MODES OF CONVERGENCE AND INEQUALITIES
CLASSICAL PROBABILITY 2008 2. MODES OF CONVERGENCE AND INEQUALITIES JOHN MORIARTY In many interesting and important situations, the object of interest is influenced by many random factors. If we can construct
More informationFKN Theorem on the biased cube
FKN Theorem on the biased cube Piotr Nayar Abstract In this note we consider Boolean functions defined on the discrete cube { γ, γ 1 } n equipped with a product probability measure µ n, where µ = βδ γ
More informationExercise 1. Let f be a nonnegative measurable function. Show that. where ϕ is taken over all simple functions with ϕ f. k 1.
Real Variables, Fall 2014 Problem set 3 Solution suggestions xercise 1. Let f be a nonnegative measurable function. Show that f = sup ϕ, where ϕ is taken over all simple functions with ϕ f. For each n
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationBoolean Functions: Influence, threshold and noise
Boolean Functions: Influence, threshold and noise Einstein Institute of Mathematics Hebrew University of Jerusalem Based on recent joint works with Jean Bourgain, Jeff Kahn, Guy Kindler, Nathan Keller,
More information,... We would like to compare this with the sequence y n = 1 n
Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.
More informationA Noisy-Influence Regularity Lemma for Boolean Functions Chris Jones
A Noisy-Influence Regularity Lemma for Boolean Functions Chris Jones Abstract We present a regularity lemma for Boolean functions f : {, } n {, } based on noisy influence, a measure of how locally correlated
More informationLecture 34: Recall Defn: The n-th Taylor polynomial for a function f at a is: n f j (a) j! + f n (a)
Lecture 34: Recall Defn: The n-th Taylor polynomial for a function f at a is: n f j (a) P n (x) = (x a) j. j! j=0 = f(a)+(f (a))(x a)+(1/2)(f (a))(x a) 2 +(1/3!)(f (a))(x a) 3 +... + f n (a) (x a) n n!
More informationbe the set of complex valued 2π-periodic functions f on R such that
. Fourier series. Definition.. Given a real number P, we say a complex valued function f on R is P -periodic if f(x + P ) f(x) for all x R. We let be the set of complex valued -periodic functions f on
More informationVISCOSITY SOLUTIONS. We follow Han and Lin, Elliptic Partial Differential Equations, 5.
VISCOSITY SOLUTIONS PETER HINTZ We follow Han and Lin, Elliptic Partial Differential Equations, 5. 1. Motivation Throughout, we will assume that Ω R n is a bounded and connected domain and that a ij C(Ω)
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationMath The Laplacian. 1 Green s Identities, Fundamental Solution
Math. 209 The Laplacian Green s Identities, Fundamental Solution Let be a bounded open set in R n, n 2, with smooth boundary. The fact that the boundary is smooth means that at each point x the external
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More informationCombinatorial Criteria for Uniqueness of Gibbs Measures
Combinatorial Criteria for Uniqueness of Gibbs Measures Dror Weitz School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540, U.S.A. dror@ias.edu April 12, 2005 Abstract We generalize previously
More informationLECTURE 2: LOCAL TIME FOR BROWNIAN MOTION
LECTURE 2: LOCAL TIME FOR BROWNIAN MOTION We will define local time for one-dimensional Brownian motion, and deduce some of its properties. We will then use the generalized Ray-Knight theorem proved in
More informationFinite Metric Spaces & Their Embeddings: Introduction and Basic Tools
Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools Manor Mendel, CMI, Caltech 1 Finite Metric Spaces Definition of (semi) metric. (M, ρ): M a (finite) set of points. ρ a distance function
More informationMathematics for Economists
Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples
More informationHonours Analysis III
Honours Analysis III Math 354 Prof. Dmitry Jacobson Notes Taken By: R. Gibson Fall 2010 1 Contents 1 Overview 3 1.1 p-adic Distance............................................ 4 2 Introduction 5 2.1 Normed
More informationAnalysis III Theorems, Propositions & Lemmas... Oh My!
Analysis III Theorems, Propositions & Lemmas... Oh My! Rob Gibson October 25, 2010 Proposition 1. If x = (x 1, x 2,...), y = (y 1, y 2,...), then is a distance. ( d(x, y) = x k y k p Proposition 2. In
More informationSummer Jump-Start Program for Analysis, 2012 Song-Ying Li
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture 6: Uniformly continuity and sequence of functions 1.1 Uniform Continuity Definition 1.1 Let (X, d 1 ) and (Y, d ) are metric spaces and
More informationMeasure and Integration: Solutions of CW2
Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost
More informationLectures 22-23: Conditional Expectations
Lectures 22-23: Conditional Expectations 1.) Definitions Let X be an integrable random variable defined on a probability space (Ω, F 0, P ) and let F be a sub-σ-algebra of F 0. Then the conditional expectation
More informationRearrangement on Conditionally Convergent Integrals in Analogy to Series
Electronic Proceedings of Undergraduate Mathematics Day, Vol. 3 (8), No. 6 Rearrangement on Conditionally Convergent Integrals in Analogy to Series Edward J Timko University of Dayton Dayton OH 45469-36
More informationBalls & Bins. Balls into Bins. Revisit Birthday Paradox. Load. SCONE Lab. Put m balls into n bins uniformly at random
Balls & Bins Put m balls into n bins uniformly at random Seoul National University 1 2 3 n Balls into Bins Name: Chong kwon Kim Same (or similar) problems Birthday paradox Hash table Coupon collection
More informationSequences: Limit Theorems
Sequences: Limit Theorems Limit Theorems Philippe B. Laval KSU Today Philippe B. Laval (KSU) Limit Theorems Today 1 / 20 Introduction These limit theorems fall in two categories. 1 The first category deals
More informationMAT1000 ASSIGNMENT 1. a k 3 k. x =
MAT1000 ASSIGNMENT 1 VITALY KUZNETSOV Question 1 (Exercise 2 on page 37). Tne Cantor set C can also be described in terms of ternary expansions. (a) Every number in [0, 1] has a ternary expansion x = a
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationERROR AND SENSITIVTY ANALYSIS FOR SYSTEMS OF LINEAR EQUATIONS. Perturbation analysis for linear systems (Ax = b)
ERROR AND SENSITIVTY ANALYSIS FOR SYSTEMS OF LINEAR EQUATIONS Conditioning of linear systems. Estimating errors for solutions of linear systems Backward error analysis Perturbation analysis for linear
More informationu( x) = g( y) ds y ( 1 ) U solves u = 0 in U; u = 0 on U. ( 3)
M ath 5 2 7 Fall 2 0 0 9 L ecture 4 ( S ep. 6, 2 0 0 9 ) Properties and Estimates of Laplace s and Poisson s Equations In our last lecture we derived the formulas for the solutions of Poisson s equation
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT4410, autumn 2017 Nadia S. Larsen. 17 November 2017.
Product measures, Tonelli s and Fubini s theorems For use in MAT4410, autumn 017 Nadia S. Larsen 17 November 017. 1. Construction of the product measure The purpose of these notes is to prove the main
More information1 Complete Statistics
Complete Statistics February 4, 2016 Debdeep Pati 1 Complete Statistics Suppose X P θ, θ Θ. Let (X (1),..., X (n) ) denote the order statistics. Definition 1. A statistic T = T (X) is complete if E θ g(t
More informationHydrodynamic Limit with Geometric Correction in Kinetic Equations
Hydrodynamic Limit with Geometric Correction in Kinetic Equations Lei Wu and Yan Guo KI-Net Workshop, CSCAMM University of Maryland, College Park 2015-11-10 1 Simple Model - Neutron Transport Equation
More informationEE514A Information Theory I Fall 2013
EE514A Information Theory I Fall 2013 K. Mohan, Prof. J. Bilmes University of Washington, Seattle Department of Electrical Engineering Fall Quarter, 2013 http://j.ee.washington.edu/~bilmes/classes/ee514a_fall_2013/
More informationNOTES ON FRAMES. Damir Bakić University of Zagreb. June 6, 2017
NOTES ON FRAMES Damir Bakić University of Zagreb June 6, 017 Contents 1 Unconditional convergence, Riesz bases, and Bessel sequences 1 1.1 Unconditional convergence of series in Banach spaces...............
More informationLecture Notes 3 Convergence (Chapter 5)
Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let
More informationLaplace s Equation. Chapter Mean Value Formulas
Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
More informationFall 2016 Math 2B Suggested Homework Problems Solutions
Fall 016 Math B Suggested Homework Problems Solutions Antiderivatives Exercise : For all x ], + [, the most general antiderivative of f is given by : ( x ( x F(x = + x + C = 1 x x + x + C. Exercise 4 :
More information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
More information5 Operations on Multiple Random Variables
EE360 Random Signal analysis Chapter 5: Operations on Multiple Random Variables 5 Operations on Multiple Random Variables Expected value of a function of r.v. s Two r.v. s: ḡ = E[g(X, Y )] = g(x, y)f X,Y
More informationFourier Series. 1. Review of Linear Algebra
Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier
More informationLecture 22: Variance and Covariance
EE5110 : Probability Foundations for Electrical Engineers July-November 2015 Lecture 22: Variance and Covariance Lecturer: Dr. Krishna Jagannathan Scribes: R.Ravi Kiran In this lecture we will introduce
More informationLecture 21: Expectation of CRVs, Fatou s Lemma and DCT Integration of Continuous Random Variables
EE50: Probability Foundations for Electrical Engineers July-November 205 Lecture 2: Expectation of CRVs, Fatou s Lemma and DCT Lecturer: Krishna Jagannathan Scribe: Jainam Doshi In the present lecture,
More informationThe Vapnik-Chervonenkis Dimension
The Vapnik-Chervonenkis Dimension Prof. Dan A. Simovici UMB 1 / 91 Outline 1 Growth Functions 2 Basic Definitions for Vapnik-Chervonenkis Dimension 3 The Sauer-Shelah Theorem 4 The Link between VCD and
More informationProblem Set 1 October 30, 2017
1. e π can be calculated from e x = x n. But that s not a good approximation method. The n! reason is that π is not small compared to 1. If you want O(0.1) accuracy, then the last term you need to include
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More informationAgnostic Learning of Disjunctions on Symmetric Distributions
Agnostic Learning of Disjunctions on Symmetric Distributions Vitaly Feldman vitaly@post.harvard.edu Pravesh Kothari kothari@cs.utexas.edu May 26, 2014 Abstract We consider the problem of approximating
More informationFKN theorem for the multislice, with applications
FKN theorem for the multislice, with applications Yuval Filmus * September 5, 2018 Abstract The Friedgut Kalai Naor (FKN) theorem states that if f is a Boolean function on the Boolean cube which is close
More informationMath General Topology Fall 2012 Homework 6 Solutions
Math 535 - General Topology Fall 202 Homework 6 Solutions Problem. Let F be the field R or C of real or complex numbers. Let n and denote by F[x, x 2,..., x n ] the set of all polynomials in n variables
More information) ) = γ. and P ( X. B(a, b) = Γ(a)Γ(b) Γ(a + b) ; (x + y, ) I J}. Then, (rx) a 1 (ry) b 1 e (x+y)r r 2 dxdy Γ(a)Γ(b) D
3 Independent Random Variables II: Examples 3.1 Some functions of independent r.v. s. Let X 1, X 2,... be independent r.v. s with the known distributions. Then, one can compute the distribution of a r.v.
More informationMath Review for Exam Answer each of the following questions as either True or False. Circle the correct answer.
Math 22 - Review for Exam 3. Answer each of the following questions as either True or False. Circle the correct answer. (a) True/False: If a n > 0 and a n 0, the series a n converges. Soln: False: Let
More informationLogarithmic Sobolev inequalities in discrete product spaces: proof by a transportation cost distance
Logarithmic Sobolev inequalities in discrete product spaces: proof by a transportation cost distance Katalin Marton Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences Relative entropy
More informationAn introduction to Birkhoff normal form
An introduction to Birkhoff normal form Dario Bambusi Dipartimento di Matematica, Universitá di Milano via Saldini 50, 0133 Milano (Italy) 19.11.14 1 Introduction The aim of this note is to present an
More informationMATH 31B: MIDTERM 2 REVIEW. sin 2 x = 1 cos(2x) dx = x 2 sin(2x) 4. + C = x 2. dx = x sin(2x) + C = x sin x cos x
MATH 3B: MIDTERM REVIEW JOE HUGHES. Evaluate sin x and cos x. Solution: Recall the identities cos x = + cos(x) Using these formulas gives cos(x) sin x =. Trigonometric Integrals = x sin(x) sin x = cos(x)
More informationIntroduction to Banach Spaces
CHAPTER 8 Introduction to Banach Saces 1. Uniform and Absolute Convergence As a rearation we begin by reviewing some familiar roerties of Cauchy sequences and uniform limits in the setting of metric saces.
More informationFast Convolution; Strassen s Method
Fast Convolution; Strassen s Method 1 Fast Convolution reduction to subquadratic time polynomial evaluation at complex roots of unity interpolation via evaluation at complex roots of unity 2 The Master
More information