Bernstein s inequality and Nikolsky s inequality for R d
|
|
- Eleanor Page
- 6 years ago
- Views:
Transcription
1 Bernstein s inequality and Nikolsky s inequality for d Jordan Bell jordan.bell@gmail.com Department of athematics University of Toronto February 6 25 Complex Borel measures and the Fourier transform Let ( d ) = rca( d ) be the set of complex Borel measures on d. This is a Banach algebra with the total variation norm with convolution as multiplication; for µ ( d ) we denote by µ the total variation of µ which itself belongs to ( d ) and the total variation norm of µ is µ = µ ( d ). For µ ( d ) it is a fact that the union O of all open sets U d such that µ (U) = itself satisfies µ (O) =. We define supp µ = d \ O called the support of µ. For µ ( d ) we define ˆµ : d C by ˆµ(ξ) = e 2πiξ x dµ(x) ξ d. d It is a fact that ˆµ belongs to C u () the collection of bounded uniformly continuous functions d C. For ξ d ˆµ(ξ) e 2πiξ x d µ (x) = µ ( d ) = µ. () d Let m d be Lebesgue measure on d. For f L ( d ) let Λ f = fm d which belongs to ( d ). We define ˆf : d C by ˆf(ξ) = Λ f (ξ) = e 2πiξ x dλ f (x) = d f(x)e 2πiξ x dm d (x) d ξ d. The following theorem establishes properties of the Fourier transform of a complex Borel measure with compact support. Thomas H. Wolff Lectures on Harmonic Analysis p. 3 Proposition.3.
2 Theorem. If µ ( d ) and supp µ is compact then ˆµ C ( d ) and for any multi-index α D α ˆµ = F (( 2πix) α µ). For > if supp µ B( ) then D α ˆµ (2π) α µ. Proof. For j =... d let e j be the jth coordinate vector in d with length. Let ξ d and define (h) = ˆµ(ξ + he j) ˆµ(ξ) h. h We can write this as e 2πihxj (h) = e 2πiξ x dµ(x). h d For any x d e 2πihxj h = e 2πihxj h 2πihx j h = 2π x j. Because µ has compact support 2π x j L (µ). Furthermore for each x d we have e 2πihxj 2πix j h. h Therefore the dominated convergence theorem tells us that lim (h) = 2πix j e 2πiξ x dµ(x). h d On the other hand for α k = for k = j and α k = otherwise so (D α ˆµ)(ξ) = lim h (h) (D α ˆµ)(ξ) = ( 2πix) α e 2πiξ x dµ(x) = F (( 2πix) α µ)(ξ) d and in particular ˆµ C ( d ). (The Fourier transform of a regular complex Borel measure on a locally compact abelian group is bounded and uniformly continuous. 2 ) Because µ has compact support so does ( 2πix) α µ hence we can play the above game with ( 2πix) α µ and by induction it follows that for any α D α ˆµ = F (( 2πix) α µ) 2 Walter udin Fourier Analysis on Groups p. 5 Theorem
3 and in particular ˆµ C ( d ). Suppose that supp µ B( ). The total variation of the complex measure ( 2πix) α µ is the positive measure hence Then using () (2π) α x α x d α d µ ( 2πix) α µ = (2π) α x α x d α d d µ (x) d = (2π) α x α x d α d d µ (x) (2π) α = (2π) α B() B() B() = (2π) α d d µ (x) = (2π) α µ. α α d d µ (x) d µ (x) F (( 2πix) α µ) ( 2πix) α µ (2π) α µ. But we have already established that D α ˆµ = F (( 2πix) α µ) which with the above inequality completes the proof. 2 Test functions For an open subset Ω of d we denote by D(Ω) the set of those φ C (Ω) such that supp φ is a compact set. Elements of D(Ω) are called test functions. It is a fact that there is a test function φ satisfying: (i) φ(x) = for x (ii) φ(x) = for x 2 (iii) φ and (iv) φ is radial. We write for k = 2... φ k (x) = φ(k x) x d. For any multi-index α hence (D α φ k )(x) = k α (D α φ)(k x) x d D α φ k = k α D α φ. (2) We use the following lemma to prove the theorem that comes after it. 3 3 Thomas H. Wolff Lectures on Harmonic Analysis p. 4 Lemma.5. 3
4 Lemma 2. Suppose that f C N ( d ) and D α f L ( d ) for each α N. Then for each α N D α (φ k f) D α f in L ( d ) as k. Proof. Let α N. In the case α = φ k f f = φ k (x)f(x) f(x) dx d = φ k (x)f(x) f(x) dx x k x k f(x) dx. Because f L ( d ) this tends to as k. Suppose that α >. The Leibniz rule tells us that with c β = ( α β) we have for each k D α (φ k f) = φ k D α f + c β D α β fd β φ k. For C = max β c β D α (φ k f) φ k D α f <β α C <β α cβ D α β fd β φ k <β α D β φ k D α β f. Let C 2 = max <β α D β φ. By (2) for < β α we have Thus D β φ k = k β D β φ C 2 k β C 2 k. D α (φ k f) φ k D α f C C 2 k <β α D α β f which tends to as k. For any k φ k D α f D α f = φ k (x)(d α f)(x) (D α f)(x) dx d = φ k (x)(d α f)(x) (D α f)(x) dx x k x k (D α f)(x) dx and because D α f L ( d ) this tends to as k. But D α (φ k f) D α f D α (φ k f) φ k D α f + φ k D α f D α f which completes the proof. 4
5 Now we calculate the Fourier transform of the derivative of a function and show that the smoother a function is the faster its Fourier transform decays. 4 Theorem 3. If f C N ( d ) and D α f L ( d ) for each α N then for each α N D α f(ξ) = (2πiξ) α ˆf(ξ) ξ d. (3) There is a constant C = C(f N) such that ˆf(ξ) C( + ξ ) N ξ d. Proof. If g Cc ( d ) then for any j d integrating by parts ( j g)(x)e 2πiξ x dx = 2πiξ j g(x)e 2πiξ x dx. d d It follows by induction that if g C N c ( d ) then for each α N D α g(ξ) = (2πiξ) α ĝ(ξ) ξ d. Let α N. For k = 2... let f k = φ k f. For each k we have f k C N ( d ) hence D α f k (ξ) = (2πiξ) α fk (ξ) ξ d. On the one hand D α f k D α f = F (D α f k D α f) D α f k D α f and Lemma 2 tells us that this tends to as k. On the other hand for ξ d D α f k (ξ) (2πiξ) α ˆf(ξ) = (2πiξ) α fk (ξ) (2πiξ) α ˆf(ξ) = (2πiξ) α F (f k f)(ξ) (2πiξ) α f k f which by Lemma 2 tends to as k. Therefore for ξ d D α f(ξ) (2πiξ) α ˆf(ξ) D α f k D α f + D α f k (ξ) (2πiξ) α ˆf(ξ) and because the right-hand side tends to as k we get D α f(ξ) = (2πiξ) α ˆf(ξ). If y S d then there is at least one j d with y j from which we get y β >. β =N 4 Thomas H. Wolff Lectures on Harmonic Analysis p. 4 Proposition.4. 5
6 The function y β =N yβ is continuous S d so there is some C N > such that y β y S d. C N β =N For nonzero x d write x = x y with which β =N xβ = x N β =N yβ. Therefore x N C N x β x d. β =N For α N because the Fourier transform of an element of L belongs to C we have by (3) that ξ ξ α ˆf(ξ) belongs to C ( d ) and in particular is bounded. Then for ξ d ξ N ˆf(ξ) C N ξ β ˆf(ξ) β =N = C N C N = C. On the one hand for ξ we have hence giving β =N β =N + ξ 2 ξ ξ β ˆf(ξ) ξ β ˆf(ξ) ( ) N + ξ ξ N = 2 N ( + ξ ) N 2 On the other hand for ξ we have ˆf(ξ) C ξ N C 2 N ( + ξ ) N. + ξ 2 and so Thus for ˆf(ξ) ˆf 2 N 2 N ˆf 2 N ( + ξ ) N. { } C = max 2 N C 2 N ˆf we have completing the proof. ˆf(ξ) C( + ξ ) N ξ d 6
7 3 Bernstein s inequality for L 2 For a Borel measurable function f : d C let O be the union of those open subsets U of d such that f(x) = for almost all x U. In other words O is the largest open set on which f = almost everywhere. The essential support of f is the set ess supp f = d \ O. The following is Bernstein s inequality for L 2 ( d ). 5 Theorem 4. If f L 2 ( d ) > and ess supp ˆf B( ) (4) then there is some f C ( d ) such that f(x) = f (x) for almost all x d and for any multi-index α D α f 2 (2π) α f 2. Proof. Let χ be the indicator function for B( ). By (4) the Cauchy-Schwarz inequality and the Parseval identity ˆf = χ ˆf χ 2 ˆf = m d (B( )) /2 f 2 < 2 so ˆf L ( d ). The Plancherel theorem 6 tells us that if g L 2 ( d ) and ĝ L ( d ) then g(x) = ĝ(ξ)e 2πix ξ dξ d for almost all x d. Thus for f : d C defined by f (x) = ˆf(ξ)e 2πix ξ dξ = F ( ˆf)( x) x d d we have f(x) = f (x) for almost all x d. Because f = f almost everywhere f = ˆf. Applying Theorem to dµ(ξ) = f ( ξ)dξ we have f C ( d ) and for any multi-index α D α f = F (( 2πiξ) α ˆf( ξ)). 5 Thomas H. Wolff Lectures on Harmonic Analysis p. 3 Proposition Walter udin eal and Complex Analysis third ed. p. 87 Theorem
8 By Parseval s identity D α f 2 = ( 2πiξ) α 2 ˆf( ξ) = (2πiξ) α χ (ξ) ˆf(ξ) 2 (2πiξ) α χ (ξ) ˆf (2π) α ˆf 2 = (2π) α f 2 proving the claim. 4 Nikolsky s inequality Nikolsky s inequality tells us that if the Fourier transform of a function is supported on a ball centered at the origin then for p q the L q norm of the function is bounded above in terms of its L p norm. 7 Theorem 5. There is a constant C d such that if f S ( d ) > and p q then Proof. Let g = f i.e. supp ˆf B( ) f q C d d( p q ) f p. g(x) = d f( x) x d. Then for ξ d ĝ(ξ) = g(x)e 2πiξ x dx = d d f( x)e 2πiξ x dx = ˆf(ξ) d showing that supp ĝ = supp ˆf B( ). Let χ D( d ) with χ(ξ) = for ξ with which ĝ = χĝ. Then g = (F χ) g and using Young s inequality with + q = r + p g q F χ r g q = ˆχ r g q. (5) 7 Camil uscalu and Wilhelm Schlag Classical and ultilinear Harmonic Analysis volume I p. 83 Lemma
9 oreover ( g a = d f( x) a dx ( d = da+d f(y) a dy d = d( a ) f a ) /a ) /a so (5) tells us d( ) q f q ˆχ r d( ) p f p i.e. f q ˆχ r d( p q ) f p. Now r = + q p so r because p q namely r. By the log-convexity of L r norms for r = θ we have Thus with we have proved the claim. ˆχ r ˆχ θ ˆχ θ. C d = max{ ˆχ ˆχ } 5 The Dirichlet kernel and Fejér kernel for The function D C () defined by D (x) = sin 2πx x πx and D () = 2 is called the Dirichlet kernel. Let χ function for the set [ ]. We have for x χ (x) = χ (ξ)e 2πixξ dξ = = e 2πixξ 2πix e 2πixξ dξ = e 2πix 2πix + e2πix 2πix = e 2πix e 2πix πx 2i sin 2πx =. πx be the indicator 9
10 For x = χ () = 2 = D (). Thus D = χ. For f L () and > we define (S f)(x) = ˆf(ξ)e 2πiξx dξ x. It is straightforward to check that sin 2πt (S f)(x) = f(x t)dt = (D f)(x) x. πt For f L () > and x (S m f)(x)dm = = = = = = = ( m m ( m ( f(y) m ( We define the Fejér kernel K C () by K (x) = ) ˆf(ξ)e 2πiξx dξ dm f(y)e 2πiξy dy ( m ) e 2πiξ(y x) dξ m ) ( f(y) D m (y x)dm ) e 2πiξx dξ dm ) ) dy dm ( ) sin 2πm(y x) f(y) dm dy π(y x) ( ) cos 2πm(y x) f(y) 2π 2 (y x) 2 dy ( f(y) cos 2π(y x) 2π 2 (y x) 2 2π 2 (y x) 2 cos 2πx 2π 2 x 2 x and K () =. Thus because K is an even function (S m f)(x)dm = (K f)(x). One proves that K is an approximate identity: K K (x)dx = dy ) dy.
11 and for any δ > lim K (x)dx =. x >δ The fact that K is an approximate identity implies that for any f L () K f f in L () as. We shall use the Fejér kernel to prove Bernstein s inequality for. 8 Theorem 6. If µ () > and supp µ [ ] then ˆµ 4π ˆµ. Proof. For x let dµ x (t) = e 2πixt dµ(t). µ x has the same support has µ and µ x (x) = e 2πixt dµ x (t) = e 2πixt e 2πixt dµ(t) = ˆµ(x + x ). It follows that to prove the claim it suffices to prove that ˆµ () 4π ˆµ. Write f = ˆµ C u (). Define C c () by { t t < (t) = t. t We calculate for x so (t)e 2πixt dt = e 2πix ( + e 2πix ) 2 4π 2 x 2 (sin πx)2 = π 2 x 2 cos 2πx = 2π 2 x 2. (x) = K (x). Then for t [ ] (e 2πiξ e 2πiξ )K (ξ)e 2πiξt dξ = K (t ) K (t + ) = ( t + ) ( t ) = t. 8 ark A. Pinsky Introduction to Fourier Analysis and Wavelets p. 22 Theorem
12 On the one hand the integral of the left-hand side with respect to µ is (e 2πiξ e 2πiξ )K (ξ)e 2πiξt dξdµ(t) = (e 2πiξ e 2πiξ )K (ξ)f(ξ)dξ. On the other hand the integral of the right-hand side with respect to µ is t dµ(t) = 2πitdµ(t) 2πi = 2πi F (( 2πit)µ)() = 2πi f (). Hence giving proving the claim. 2πi f () = (e 2πiξ e 2πiξ )K (ξ)f(ξ)dξ f () 4π f K = 4π f 2
Zygmund s Fourier restriction theorem and Bernstein s inequality
Zygmund s Fourier restriction theorem and Bernstein s inequality Jordan Bell jordanbell@gmailcom Department of Mathematics, University of Toronto February 13, 2015 1 Zygmund s restriction theorem Write
More informationTOOLS FROM HARMONIC ANALYSIS
TOOLS FROM HARMONIC ANALYSIS BRADLY STADIE Abstract. The Fourier transform can be thought of as a map that decomposes a function into oscillatory functions. In this paper, we will apply this decomposition
More information1 Fourier Integrals on L 2 (R) and L 1 (R).
18.103 Fall 2013 1 Fourier Integrals on L 2 () and L 1 (). The first part of these notes cover 3.5 of AG, without proofs. When we get to things not covered in the book, we will start giving proofs. The
More informationFOURIER TRANSFORMS. 1. Fourier series 1.1. The trigonometric system. The sequence of functions
FOURIER TRANSFORMS. Fourier series.. The trigonometric system. The sequence of functions, cos x, sin x,..., cos nx, sin nx,... is called the trigonometric system. These functions have period π. The trigonometric
More informationMATH MEASURE THEORY AND FOURIER ANALYSIS. Contents
MATH 3969 - MEASURE THEORY AND FOURIER ANALYSIS ANDREW TULLOCH Contents 1. Measure Theory 2 1.1. Properties of Measures 3 1.2. Constructing σ-algebras and measures 3 1.3. Properties of the Lebesgue measure
More informationTopics in Harmonic Analysis Lecture 1: The Fourier transform
Topics in Harmonic Analysis Lecture 1: The Fourier transform Po-Lam Yung The Chinese University of Hong Kong Outline Fourier series on T: L 2 theory Convolutions The Dirichlet and Fejer kernels Pointwise
More informationTHE RESTRICTION PROBLEM AND THE TOMAS-STEIN THEOREM
THE RESTRICTION PROBLEM AND THE TOMAS-STEIN THEOREM DENNIS KRIVENTSOV Abstract. E. M. Stein s restriction problem for Fourier transforms is a deep and only partially solved conjecture in harmonic analysis.
More information1.5 Approximate Identities
38 1 The Fourier Transform on L 1 (R) which are dense subspaces of L p (R). On these domains, P : D P L p (R) and M : D M L p (R). Show, however, that P and M are unbounded even when restricted to these
More informationTOPICS IN FOURIER ANALYSIS-III. Contents
TOPICS IN FOUIE ANALYSIS-III M.T. NAI Contents 1. Fourier transform: Basic properties 2 2. On surjectivity 7 3. Inversion theorem 9 4. Proof of inversion theorem 10 5. The Banach algebra L 1 ( 12 6. Fourier-Plancheral
More informationSOLUTIONS TO HOMEWORK ASSIGNMENT 4
SOLUTIONS TO HOMEWOK ASSIGNMENT 4 Exercise. A criterion for the image under the Hilbert transform to belong to L Let φ S be given. Show that Hφ L if and only if φx dx = 0. Solution: Suppose first that
More informationCHAPTER VI APPLICATIONS TO ANALYSIS
CHAPTER VI APPLICATIONS TO ANALYSIS We include in this chapter several subjects from classical analysis to which the notions of functional analysis can be applied. Some of these subjects are essential
More informationRESULTS ON FOURIER MULTIPLIERS
RESULTS ON FOURIER MULTIPLIERS ERIC THOMA Abstract. The problem of giving necessary and sufficient conditions for Fourier multipliers to be bounded on L p spaces does not have a satisfactory answer for
More informationFRAMES AND TIME-FREQUENCY ANALYSIS
FRAMES AND TIME-FREQUENCY ANALYSIS LECTURE 5: MODULATION SPACES AND APPLICATIONS Christopher Heil Georgia Tech heil@math.gatech.edu http://www.math.gatech.edu/ heil READING For background on Banach spaces,
More informationMATH 220 solution to homework 5
MATH 220 solution to homework 5 Problem. (i Define E(t = k(t + p(t = then E (t = 2 = 2 = 2 u t u tt + u x u xt dx u 2 t + u 2 x dx, u t u xx + u x u xt dx x [u tu x ] dx. Because f and g are compactly
More informationMath 172 Problem Set 5 Solutions
Math 172 Problem Set 5 Solutions 2.4 Let E = {(t, x : < x b, x t b}. To prove integrability of g, first observe that b b b f(t b b g(x dx = dt t dx f(t t dtdx. x Next note that f(t/t χ E is a measurable
More informationAverage theorem, Restriction theorem and Strichartz estimates
Average theorem, Restriction theorem and trichartz estimates 2 August 27 Abstract We provide the details of the proof of the average theorem and the restriction theorem. Emphasis has been placed on the
More informationBochner s Theorem on the Fourier Transform on R
Bochner s heorem on the Fourier ransform on Yitao Lei October 203 Introduction ypically, the Fourier transformation sends suitable functions on to functions on. his can be defined on the space L ) + L
More informationPositive definite functions, completely monotone functions, the Bernstein-Widder theorem, and Schoenberg s theorem
Positive definite functions, completely monotone functions, the Bernstein-Widder theorem, and Schoenberg s theorem Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June
More informationII. FOURIER TRANSFORM ON L 1 (R)
II. FOURIER TRANSFORM ON L 1 (R) In this chapter we will discuss the Fourier transform of Lebesgue integrable functions defined on R. To fix the notation, we denote L 1 (R) = {f : R C f(t) dt < }. The
More informationThe Hilbert transform
The Hilbert transform Definition and properties ecall the distribution pv(, defined by pv(/(ϕ := lim ɛ ɛ ϕ( d. The Hilbert transform is defined via the convolution with pv(/, namely (Hf( := π lim f( t
More informationu t = u p (t)q(x) = p(t) q(x) p (t) p(t) for some λ. = λ = q(x) q(x)
. Separation of variables / Fourier series The following notes were authored initially by Jason Murphy, and subsequently edited and expanded by Mihaela Ifrim, Daniel Tataru, and myself. We turn to the
More informationThe Fourier Transform and applications
The Fourier Transform and applications Mihalis Kolountzakis University of Crete January 2006 Mihalis Kolountzakis (U. of Crete) FT and applications January 2006 1 / 36 Groups and Haar measure Locally compact
More informationn 1 f = f m, m=0 n 1 k=0 Note that if n = 2, we essentially get example (i) (but for complex functions).
Chapter 4 Fourier Analysis 4.0.1 Intuition This discussion is borrowed from [T. Tao, Fourier Transform]. Fourier transform/series can be viewed as a way to decompose a function from some given space V
More informationHarmonic Analysis: from Fourier to Haar. María Cristina Pereyra Lesley A. Ward
Harmonic Analysis: from Fourier to Haar María Cristina Pereyra Lesley A. Ward Department of Mathematics and Statistics, MSC03 2150, 1 University of New Mexico, Albuquerque, NM 87131-0001, USA E-mail address:
More informationReal Analysis Chapter 8 Solutions Jonathan Conder. = lim n. = lim. f(z) dz dy. m(b r (y)) B r(y) f(z + x y) dz. B r(y) τ y x f(z) f(z) dz
3. (a Note that η ( (t e /t for all t (,, where is a polynomial of degree. Given k N, suppose that η (k (t P k (/te /t for all t (,, where P k (x is some polynomial of degree (k. By the product rule and
More information7: FOURIER SERIES STEVEN HEILMAN
7: FOURIER SERIES STEVE HEILMA Contents 1. Review 1 2. Introduction 1 3. Periodic Functions 2 4. Inner Products on Periodic Functions 3 5. Trigonometric Polynomials 5 6. Periodic Convolutions 7 7. Fourier
More informationNotes. 1 Fourier transform and L p spaces. March 9, For a function in f L 1 (R n ) define the Fourier transform. ˆf(ξ) = f(x)e 2πi x,ξ dx.
Notes March 9, 27 1 Fourier transform and L p spaces For a function in f L 1 (R n ) define the Fourier transform ˆf(ξ) = f(x)e 2πi x,ξ dx. Properties R n 1. f g = ˆfĝ 2. δλ (f)(ξ) = ˆf(λξ), where δ λ f(x)
More information1.3.1 Definition and Basic Properties of Convolution
1.3 Convolution 15 1.3 Convolution Since L 1 (R) is a Banach space, we know that it has many useful properties. In particular the operations of addition and scalar multiplication are continuous. However,
More informationMath 172 Problem Set 8 Solutions
Math 72 Problem Set 8 Solutions Problem. (i We have (Fχ [ a,a] (ξ = χ [ a,a] e ixξ dx = a a e ixξ dx = iξ (e iax e iax = 2 sin aξ. ξ (ii We have (Fχ [, e ax (ξ = e ax e ixξ dx = e x(a+iξ dx = a + iξ where
More informationReminder Notes for the Course on Distribution Theory
Reminder Notes for the Course on Distribution Theory T. C. Dorlas Dublin Institute for Advanced Studies School of Theoretical Physics 10 Burlington Road, Dublin 4, Ireland. Email: dorlas@stp.dias.ie March
More informationHermite functions. Jordan Bell Department of Mathematics, University of Toronto. September 9, 2015
Hermite functions Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto September 9, 25 Locally convex spaces If V is a vector space and {p α : α A} is a separating family
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More informationTools from Lebesgue integration
Tools from Lebesgue integration E.P. van den Ban Fall 2005 Introduction In these notes we describe some of the basic tools from the theory of Lebesgue integration. Definitions and results will be given
More informationLECTURE Fourier Transform theory
LECTURE 3 3. Fourier Transform theory In section (2.2) we introduced the Discrete-time Fourier transform and developed its most important properties. Recall that the DTFT maps a finite-energy sequence
More informationFourier Series. ,..., e ixn ). Conversely, each 2π-periodic function φ : R n C induces a unique φ : T n C for which φ(e ix 1
Fourier Series Let {e j : 1 j n} be the standard basis in R n. We say f : R n C is π-periodic in each variable if f(x + πe j ) = f(x) x R n, 1 j n. We can identify π-periodic functions with functions on
More informationThe Wiener algebra and Wiener s lemma
he Wiener algebra and Wiener s lemma Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of oronto January 17, 2015 1 Introduction Let = R/Z. For f L 1 () we define f L 1 () = 1 For
More informationTHE MATTILA INTEGRAL ASSOCIATED WITH SIGN INDEFINITE MEASURES. Alex Iosevich and Misha Rudnev. August 3, Introduction
THE MATTILA INTEGRAL ASSOCIATED WITH SIGN INDEFINITE MEASURES Alex Iosevich and Misha Rudnev August 3, 005 Abstract. In order to quantitatively illustrate the role of positivity in the Falconer distance
More informationFourier Transform & Sobolev Spaces
Fourier Transform & Sobolev Spaces Michael Reiter, Arthur Schuster Summer Term 2008 Abstract We introduce the concept of weak derivative that allows us to define new interesting Hilbert spaces the Sobolev
More informationSome basic elements of Probability Theory
Chapter I Some basic elements of Probability Theory 1 Terminology (and elementary observations Probability theory and the material covered in a basic Real Variables course have much in common. However
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationINTRODUCTION TO NONLINEAR WAVE EQUATIONS
INTRODUCTION TO NONLINEAR WAVE EQUATIONS JONATHAN LUK Contents 1. Introduction 1. Linear wave equation via Fourier transform 4.1. Review of Fourier theory 4.. Returning to the linear wave equation 4 3.
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More information13. Fourier transforms
(December 16, 2017) 13. Fourier transforms Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2017-18/13 Fourier transforms.pdf]
More informationDifferentiation and function spaces
209: Honors Analysis in R n Differentiation and function spaces 1 Banach Space, Hilbert Space A vector (linear) space E over a field K is a set endowed with two operations + : E E E and : K E E that satisfy
More informationOutline of Fourier Series: Math 201B
Outline of Fourier Series: Math 201B February 24, 2011 1 Functions and convolutions 1.1 Periodic functions Periodic functions. Let = R/(2πZ) denote the circle, or onedimensional torus. A function f : C
More informationTHE LAPLACIAN AND THE DIRICHLET PROBLEM
THE LAPLACIAN AND THE DIRICHLET PROBLEM Stefano Meda Università di Milano-Bicocca c Stefano Meda 2016 ii A Francesco Contents 0.1 Background and preliminary results................ 1 0.1.1 Convolution..........................
More informationSTRUCTURE OF (w 1, w 2 )-TEMPERED ULTRADISTRIBUTION USING SHORT-TIME FOURIER TRANSFORM
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 39 2018 (154 164) 154 STRUCTURE OF (w 1, w 2 )-TEMPERED ULTRADISTRIBUTION USING SHORT-TIME FOURIER TRANSFORM Hamed M. Obiedat Ibraheem Abu-falahah Department
More informationFolland: Real Analysis, Chapter 8 Sébastien Picard
Folland: Real Analysis, Chapter 8 Sébastien Picard Problem 8.3 Let η(t) = e /t for t >, η(t) = for t. a. For k N and t >, η (k) (t) = P k (/t)e /t where P k is a polynomial of degree 2k. b. η (k) () exists
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 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 informationTopics in Fourier analysis - Lecture 2.
Topics in Fourier analysis - Lecture 2. Akos Magyar 1 Infinite Fourier series. In this section we develop the basic theory of Fourier series of periodic functions of one variable, but only to the extent
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationComplex Analysis, Stein and Shakarchi The Fourier Transform
Complex Analysis, Stein and Shakarchi Chapter 4 The Fourier Transform Yung-Hsiang Huang 2017.11.05 1 Exercises 1. Suppose f L 1 (), and f 0. Show that f 0. emark 1. This proof is observed by Newmann (published
More informationAdvanced Real Analysis
Advanced Real Analysis Edited and typeset by David McCormick Based upon lectures by José Luis Rodrigo University of Warwick Autumn Preface These notes are primarily based on the lectures for the course
More informationBest constants in the local Hausdorff Young inequality on compact Lie groups
Best constants in the local Hausdorff Young inequality on compact Lie groups Michael G Cowling University of New South Wales Gwangju, August 7, 2014 1 / 24 Thanks It is a pleasure to be here! This is work
More informationFourier transforms, I
(November 28, 2016) Fourier transforms, I Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/notes 2016-17/Fourier transforms I.pdf]
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 informationThe Bernstein and Nikolsky inequalities for trigonometric polynomials
he ernstein and Nikolsky ineualities for trigonometric polynomials Jordan ell jordanbell@gmailcom Department of Mathematics, University of oronto January 28, 2015 1 Introduction Let = R/2πZ For a function
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
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 informationChapter 4. The dominated convergence theorem and applications
Chapter 4. The dominated convergence theorem and applications The Monotone Covergence theorem is one of a number of key theorems alllowing one to exchange limits and [Lebesgue] integrals (or derivatives
More informationUNCERTAINTY PRINCIPLES WITH FOURIER ANALYSIS
UNETAINTY PINIPLES WITH FOUIE ANALYSIS ALDE SHEAGEN Abstract. We describe the properties of the Fourier transform on in preparation for some relevant physical interpretations. These include the Heisenberg
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationA Bowl of Kernels. By Nuriye Atasever, Cesar Alvarado, and Patrick Doherty. December 03, 2013
December 03, 203 Introduction When we studied Fourier series we improved convergence by convolving with the Fejer and Poisson kernels on T. The analogous Fejer and Poisson kernels on the real line help
More informationSolutions to Tutorial 11 (Week 12)
THE UIVERSITY OF SYDEY SCHOOL OF MATHEMATICS AD STATISTICS Solutions to Tutorial 11 (Week 12) MATH3969: Measure Theory and Fourier Analysis (Advanced) Semester 2, 2017 Web Page: http://sydney.edu.au/science/maths/u/ug/sm/math3969/
More informationPart II Probability and Measure
Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationThe uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008
The uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008 Emmanuel Candés (Caltech), Terence Tao (UCLA) 1 Uncertainty principles A basic principle
More information3: THE SHANNON SAMPLING THEOREM
3: THE SHANNON SAMPLING THEOEM STEVEN HEILMAN 1. Introduction In this final set of notes, we would like to end where we began. In the first set of notes, we mentioned that mathematics could be used to
More informationChapter 9. Parabolic Equations. 9.1 Introduction. 9.2 Some Results from Functional Analysis
Chapter 9 Parabolic Equations 9.1 Introduction If u(x, t) represents the temperature in a body Ω R n at a point x Ω at time t, then the propagation (or diffusion) of heat is (approximately) described by
More informationg(x) = P (y) Proof. This is true for n = 0. Assume by the inductive hypothesis that g (n) (0) = 0 for some n. Compute g (n) (h) g (n) (0)
Mollifiers and Smooth Functions We say a function f from C is C (or simply smooth) if all its derivatives to every order exist at every point of. For f : C, we say f is C if all partial derivatives to
More informationBernoulli polynomials
Bernoulli polynomials Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto February 2, 26 Bernoulli polynomials For k, the Bernoulli polynomial B k (x) is defined by ze xz
More information8 Singular Integral Operators and L p -Regularity Theory
8 Singular Integral Operators and L p -Regularity Theory 8. Motivation See hand-written notes! 8.2 Mikhlin Multiplier Theorem Recall that the Fourier transformation F and the inverse Fourier transformation
More informationFINITE FOURIER ANALYSIS. 1. The group Z N
FIITE FOURIER AALYSIS EIL LYALL 1. The group Z Let be a positive integer. A complex number z is an th root of unity if z = 1. It is then easy to verify that the set of th roots of unity is precisely {
More informationA. Iosevich and I. Laba January 9, Introduction
K-DISTANCE SETS, FALCONER CONJECTURE, AND DISCRETE ANALOGS A. Iosevich and I. Laba January 9, 004 Abstract. In this paper we prove a series of results on the size of distance sets corresponding to sets
More informationLinear Independence of Finite Gabor Systems
Linear Independence of Finite Gabor Systems 1 Linear Independence of Finite Gabor Systems School of Mathematics Korea Institute for Advanced Study Linear Independence of Finite Gabor Systems 2 Short trip
More informationWavelets and applications
Chapter 3 Wavelets and applications 3. Multiresolution analysis 3.. The limits of Fourier analysis Although along this chapter the underlying Hilbert space will be L 2 (R), we start with a completely explicit
More information6.2 Fubini s Theorem. (µ ν)(c) = f C (x) dµ(x). (6.2) Proof. Note that (X Y, A B, µ ν) must be σ-finite as well, so that.
6.2 Fubini s Theorem Theorem 6.2.1. (Fubini s theorem - first form) Let (, A, µ) and (, B, ν) be complete σ-finite measure spaces. Let C = A B. Then for each µ ν- measurable set C C the section x C is
More informationFor example, the real line is σ-finite with respect to Lebesgue measure, since
More Measure Theory In this set of notes we sketch some results in measure theory that we don t have time to cover in full. Most of the results can be found in udin s eal & Complex Analysis. Some of the
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 information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationHeisenberg s inequality
Heisenberg s inequality Michael Walter 1 Introduction 1 Definition. Let P be a probability measure on R. Then its mean or expectation is defined as E(P) := x dp(x) Its variance is the expected square deviation
More informationLebesgue s Differentiation Theorem via Maximal Functions
Lebesgue s Differentiation Theorem via Maximal Functions Parth Soneji LMU München Hütteseminar, December 2013 Parth Soneji Lebesgue s Differentiation Theorem via Maximal Functions 1/12 Philosophy behind
More informationThe Lindeberg central limit theorem
The Lindeberg central limit theorem Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto May 29, 205 Convergence in distribution We denote by P d the collection of Borel probability
More informationTHE DIRICHLET-JORDAN TEST AND MULTIDIMENSIONAL EXTENSIONS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 129, Number 4, Pages 1031 1035 S 0002-9939(00)05658-6 Article electronically published on October 10, 2000 THE DIRICHLET-JORDAN TEST AND MULTIDIMENSIONAL
More informationNAME: MATH 172: Lebesgue Integration and Fourier Analysis (winter 2012) Final exam. Wednesday, March 21, time: 2.5h
NAME: SOLUTION problem # 1 2 3 4 5 6 7 8 9 points max 15 20 10 15 10 10 10 10 10 110 MATH 172: Lebesgue Integration and Fourier Analysis (winter 2012 Final exam Wednesday, March 21, 2012 time: 2.5h Please
More informationANALYSIS QUALIFYING EXAM FALL 2017: SOLUTIONS. 1 cos(nx) lim. n 2 x 2. g n (x) = 1 cos(nx) n 2 x 2. x 2.
ANALYSIS QUALIFYING EXAM FALL 27: SOLUTIONS Problem. Determine, with justification, the it cos(nx) n 2 x 2 dx. Solution. For an integer n >, define g n : (, ) R by Also define g : (, ) R by g(x) = g n
More informationMATH 5640: Fourier Series
MATH 564: Fourier Series Hung Phan, UMass Lowell September, 8 Power Series A power series in the variable x is a series of the form a + a x + a x + = where the coefficients a, a,... are real or complex
More informationMarcinkiewicz Interpolation Theorem by Daniel Baczkowski
1 Introduction Marcinkiewicz Interpolation Theorem b Daniel Baczkowski Let (, µ be a measure space. Let M denote the collection of all extended real valued µ-measurable functions on. Also, let M denote
More information2. Function spaces and approximation
2.1 2. Function spaces and approximation 2.1. The space of test functions. Notation and prerequisites are collected in Appendix A. Let Ω be an open subset of R n. The space C0 (Ω), consisting of the C
More information44 CHAPTER 3. CAVITY SCATTERING
44 CHAPTER 3. CAVITY SCATTERING For the TE polarization case, the incident wave has the electric field parallel to the x 3 -axis, which is also the infinite axis of the aperture. Since both the incident
More informationSobolev spaces. May 18
Sobolev spaces May 18 2015 1 Weak derivatives The purpose of these notes is to give a very basic introduction to Sobolev spaces. More extensive treatments can e.g. be found in the classical references
More informationChapter 7: Bounded Operators in Hilbert Spaces
Chapter 7: Bounded Operators in Hilbert Spaces I-Liang Chern Department of Applied Mathematics National Chiao Tung University and Department of Mathematics National Taiwan University Fall, 2013 1 / 84
More informationRudin Real and Complex Analysis - Harmonic Functions
Rudin Real and Complex Analysis - Harmonic Functions Aaron Lou December 2018 1 Notes 1.1 The Cauchy-Riemann Equations 11.1: The Operators and Suppose f is a complex function defined in a plane open set
More informationGaussian Hilbert spaces
Gaussian Hilbert spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto July 11, 015 1 Gaussian measures Let γ be a Borel probability measure on. For a, if γ = δ a then
More informationHARMONIC ANALYSIS TERENCE TAO
HARMONIC ANALYSIS TERENCE TAO Analysis in general tends to revolve around the study of general classes of functions (often real-valued or complex-valued) and operators (which take one or more functions
More informationMATH6081A Homework 8. In addition, when 1 < p 2 the above inequality can be refined using Lorentz spaces: f
MATH68A Homework 8. Prove the Hausdorff-Young inequality, namely f f L L p p for all f L p (R n and all p 2. In addition, when < p 2 the above inequality can be refined using Lorentz spaces: f L p,p f
More informationLet R be the line parameterized by x. Let f be a complex function on R that is integrable. The Fourier transform ˆf = F f is. e ikx f(x) dx. (1.
Chapter 1 Fourier transforms 1.1 Introduction Let R be the line parameterized by x. Let f be a complex function on R that is integrable. The Fourier transform ˆf = F f is ˆf(k) = e ikx f(x) dx. (1.1) It
More informationRademacher functions
Rademacher functions Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto July 6, 4 Binary expansions Define S : {, } N [, ] by Sσ σ k k, σ {, }N. For example, for σ and σ,
More informationCompact operators on Banach spaces
Compact operators on Banach spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 12, 2017 1 Introduction In this note I prove several things about compact
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More information