Lecture 4: Fourier Transforms.
|
|
- Ruth Weaver
- 5 years ago
- Views:
Transcription
1 1 Definition. Lecture 4: Fourier Transforms. We now come to Fourier transforms, which we give in the form of a definition. First we define the spaces L 1 () and L 2 (). Definition 1.1 The space L 1 () is defined as follows: L 1 () {f : C L 2 () {f : C f(t) dt < }. f(t) 2 dt < }. The space L 1 () is called the space of absolutely integrable functions and L 2 () is called the space of square-integrable functions. We can now define the Fourier transform: Definition 1.2 The Fourier transform of f L 1 () is defined as F (ω) for ω, where the integral is defined as f(t)e iωt dt f(t)e iωt dt lim f(t)e iωt dt. The reason for requiring that f L 1 () is to ensure that the integral converges: it converges absolutely, and therefore it converges. In fact, it converges pointwise: we have where F (ω) f(t)e iωt dt. F (ω) F (ω) for each ω, Example 1.1 f(t) e t. It is easy to check that f L 1 (). First, we have 1
2 Then we see that F (ω) e t e iωt dt e t e iωt dt + e t e iωt dt + e (1+iω)t dt iω ω 2 e e t e iωt dt e t e iωt dt e (1 iω)t dt 1 iω e (1+iω) 1 + iω e (1 iω) ( ) 1 iω e iω 1 + iω + eiω. 1 iω Example 1.2 f(t) In this case we have { 1, t 1 F (ω) lim F (ω) ω 2., t > 1. F (ω) 1 1 e iωt dt { 2 sin ω ω ω 2, ω. 2 Continuity and differentiability. We now turn to the continuity and differentiability of the Fourier transform F (ω) of f L 1 (). To formulate the results, we need the concept of piecewise continuous functions on. Definition 2.1 A function f : C is said to be piecewise continuous on if f is piecewise continuous on every closed, bounded subinterval [a, b]. We denote the set of picewise continuous functions by G(). From the definition, we see that a piecewise continuous function on has only a finite number of discontinuities on each finite subinterval, but it may have an infinite number on the whole of the real line. As an example we take f(x) [x] which is defined as [x] n if n x < n + 1, where n Z. This is a picewise continuous function with discontinuities at every integer value for x. We now have the following result: 2
3 Theorem 2.1 If f L 1 () G() then its Fourier transform F (ω) has the following properties: 1. F (ω) is defined for all ω ; 2. F is continuous on ; 3. F (ω) as ω ±. Proof: The first part follows from the fact that f L 1 () and thus that the integral defining F (ω) is absolutely convergent for each ω. The second part uses the following result, which we quote without proof: Lemma 2.1 Suppose that {f h : h } is a family of piecewise continuous functions, and suppose further that (i) There is a function g so that f h (x) g(x) for all x and all h, (ii) g(x)dx <, (iii) lim h f h (x) f(x) for each x. Then we have lim f h (x)dx f(x)dx. h We then consider F (ω + h) F (ω) and show that this difference tends to zero as h. So, we have F (ω + h) F (ω) f(x)[e i(ω+h) x e iωx ]dx f(x)e iωx [e ihx 1]dx f h (x)dx, where f h (x) f(x)e iωx [e ihx 1]. Clearly we have for each x and we also have lim f h(x) h f h (x) f(x) e ihx 1 2 f(x), 3
4 and g(x) 2 f(x) satisfies the conditions of Lemma 2.1, so that we have That is lim h f(x)e iωx [e ihx 1]dx. and this proves the continuity of F (ω). lim[f (ω + h) F (ω)], h The third part, namely lim ω ± F (ω), can be found in standard textbooks, and we refer the reader to the course book. We shall also need a result on the differentiability of the Fourier transform F (ω) of f(x). To this end, we have first the M-test for integrals, which is the equivalent to the Weierstrass majorant theorem for functional series: Theorem 2.2 Let f(x, y) be a continuous function defined on 2 be such that (i) F (x) f(x, y)dy exists (ii) there is a function g(y) L 1 () so that f(x, y) g(y) for all x, y then converges uniformly on. That is, F (x) F (x) uniformly on as. This means that f(x, y)dy f(x, y)dy F (x) as. sup F (x) F (x) x Proof: First note that and we then have F (x) F (x) f(x, y)dy + f(x, y)dy F (x) F (x) f(x, y) dy + 4 g(y)dy + f(x, y) dy g(y)dy
5 from which we have sup F (x) F (x) g(y)dy + x as since g(y) L 1 (). This is given in the following result: g(y)dy Theorem 2.3 Suppose that f(x, y) and f x(x, y) are continuous on 2 and that we also have: (i) F (x) (ii) G(x) Then uniformly as. f(x, y)dy converges for each x, f x(x, y)dy converges uniformly on, that is G (x) F (x) f x(x, y)dy G(x) f x(x, y)dy. Proof: For the proof of this result, see pp in the notes for Lecture 1, and in particular Theorem 2.2. As an example of Theorem 2.3 we take f(x) e x2 and calculate its Fourier transform. First put f(ω, x) e x2 e iωx. Then as is easily seen. Secondly F (ω) f(ω, x)dx, G(ω) f ω(ω, x)dx ( ix)f(ω, x)dx converges uniformly (Theorem 2.2, see also the notes for Lecture 1). Hence, by Theorem 2.3, we have 5
6 since we have as is easily verified. F (ω) i i d 2 dx i [ d 2 dx ω 2 ω 2 F (ω), xe x2 e iωx dx ( e x2) e iωx dx (e x2 e iωx ) dx + iω e x2 e iωx dx d ) (e x2 e iωx dx, dx ] e x2 e iωx dx Consequently, we find that F (ω) satisfies the differential equation which has general solution F (ω) ω 2 F (ω), F (ω) Ce ω2 /4, where C is an arbitrary real constant. We then note that F () e x2 dx π. Then C π and we have that the Fourier transform of e x2 is 3 ules for computation. F (ω) πe ω2 /4. We now turn to consider some useful rules for simplifying the calculation of Fourier transforms. In the following we will also use the notation F[f] for the Fourier transform of a function f. The first rule we have is quite obvious: Theorem 3.1 If f, g G() L 1 () and a, b C, then F[af + bg](ω) af (ω) + bg(ω). One of the uses of the Fourier transform is to transform differential equations into algebraic equations, which are (usually) easier to solve. The following result is then of great utility: 6
7 Theorem 3.2 If f is continuous and f, f G() L 1 () then F[f ](ω) iωf (ω). Proof: The proof relies on the fact that, under the given conditions, f(x) as x ±. First we have f(x) f() + and since f G() L 1 (), we have that x f (t)dt. exists, so that x lim x ± f (t)dt lim f(x) x ± exists. Now, if f(x) a as x we have f(x) a > as x. Thus there is an > so that f(x) > a /2 for x > and therefore f(x) dx diverges, contradicting the fact that f G() L 1 (). A similar argument shows that f(x) as x. Having established these limits, we then obtain: because F[f ](ω) lim f (x)e iωx dx lim iω f (x)e iωx dx [f(x)e iωx iωf (ω), f(x)e iωx dx ] f(x)( iω)e iωx dx lim f(x)e iωx lim [f()e iω f()e iω ] since f(x) x ±. In the same way we can prove: Theorem 3.3 If f, f, f (2),..., f (n 1) are continuous and f, f, f (2),..., f (n) L 1 (), then G() F[f (n) ](ω) (iω) n F (ω). 7
8 Proof: Proof by induction. To deal with differential equations with variable (polynomial) coefficients we need the following results: Theorem 3.4 If f, xf G() L 1 () then F[xf(x)](ω) if (ω). Also, if we have f, x n f G() for some natural number n, then F[x n f(x)](ω) i n F (n) (ω). Proof: For a proof, consult the course textbook. Finally, we come to the scaling law: Theorem 3.5 If f G() L 1 () and A, B with A, then F[f(Ax + B)](ω) 1 B A ei A ω F ( ω A ). Proof: The proof is a simple calculation, using a change of variable t Ax + B. Note that there are two cases. A > and A <. For A > we have For A < we have F[f(Ax + B)](ω) f(ax + B)e iωx dx 1 f(t)e A 1 B A ei A ω F ( ω A ). t B iω A dt This proves the result. F[f(Ax + B)](ω) f(ax + B)e iωx dx 1 f(t)e A 1 B ( A) ei A ω F ( ω A ) 1 B A ei A ω F ( ω A ). t B iω A In order to use Fourier transforms as a tool in calculations, we need to be able to find the inverse transform. That is, we need to be able to calculate the function which has a given expression as its Fourier transform. To this end we define the inverse Fourier transform as follows: 8 dt
9 Definition 3.1 The inverse Fourier transform of F (ω) where F F[f] for some function f G() L 1 () is defined as F 1 1 [F ](x) lim F (ω)e ixω dω. 2π Note that we may write the right-hand side as at least formally. 1 F[F ]( x) 2π We end this lecture with the following result, which we shall return to in the following lecture: Theorem 3.6 Suppose f G() L 1 () has Fourier transform F (ω). Then we have F 1 1 [F ](x) lim F (ω)e ixω dω f(x ) + f(x + ) 2π 2 at each x where the right- and left-hand derivatives of f(x) exist. Note the similarity of this with the theorem on the convergence of Fourier series. 9
sech(ax) = 1 ch(x) = 2 e x + e x (10) cos(a) cos(b) = 2 sin( 1 2 (a + b)) sin( 1 2
Math 60 43 6 Fourier transform Here are some formulae that you may want to use: F(f)(ω) def = f(x)e iωx dx, F (f)(x) = f(ω)e iωx dω, (3) F(f g) = F(f)F(g), (4) F(e α x ) = α π ω + α, F( α x + α )(ω) =
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 information1 Review of di erential calculus
Review of di erential calculus This chapter presents the main elements of di erential calculus needed in probability theory. Often, students taking a course on probability theory have problems with concepts
More informationFourier transforms. R. C. Daileda. Partial Differential Equations April 17, Trinity University
The Fourier Transform R. C. Trinity University Partial Differential Equations April 17, 214 The Fourier series representation For periodic functions Recall: If f is a 2p-periodic (piecewise smooth) function,
More informationLecture 34. Fourier Transforms
Lecture 34 Fourier Transforms In this section, we introduce the Fourier transform, a method of analyzing the frequency content of functions that are no longer τ-periodic, but which are defined over the
More information1 From Fourier Series to Fourier transform
Differential Equations 2 Fall 206 The Fourier Transform From Fourier Series to Fourier transform Recall: If fx is defined and piecewise smooth in the interval [, ] then we can write where fx = a n = b
More informationIndeed, the family is still orthogonal if we consider a complex valued inner product ( or an inner product on complex vector space)
Fourier series of complex valued functions Suppose now f is a piecewise continuous complex valued function on [, π], that is f(x) = u(x)+iv(x) such that both u and v are real valued piecewise continuous
More informationAdvanced Calculus Math 127B, Winter 2005 Solutions: Final. nx2 1 + n 2 x, g n(x) = n2 x
. Define f n, g n : [, ] R by f n (x) = Advanced Calculus Math 27B, Winter 25 Solutions: Final nx2 + n 2 x, g n(x) = n2 x 2 + n 2 x. 2 Show that the sequences (f n ), (g n ) converge pointwise on [, ],
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 informationMath 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx.
Math 321 Final Examination April 1995 Notation used in this exam: N 1 π (1) S N (f,x) = f(t)e int dt e inx. 2π n= N π (2) C(X, R) is the space of bounded real-valued functions on the metric space X, equipped
More informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 5 FFT and Divide and Conquer Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 56 Outline DFT: evaluate a polynomial
More information17 The functional equation
18.785 Number theory I Fall 16 Lecture #17 11/8/16 17 The functional equation In the previous lecture we proved that the iemann zeta function ζ(s) has an Euler product and an analytic continuation to the
More informationA sufficient condition for the existence of the Fourier transform of f : R C is. f(t) dt <. f(t) = 0 otherwise. dt =
Fourier transform Definition.. Let f : R C. F [ft)] = ˆf : R C defined by The Fourier transform of f is the function F [ft)]ω) = ˆfω) := ft)e iωt dt. The inverse Fourier transform of f is the function
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 informationFourier Series. Fourier Transform
Math Methods I Lia Vas Fourier Series. Fourier ransform Fourier Series. Recall that a function differentiable any number of times at x = a can be represented as a power series n= a n (x a) n where the
More information13. Examples of measure-preserving tranformations: rotations of a torus, the doubling map
3. Examples of measure-preserving tranformations: rotations of a torus, the doubling map 3. Rotations of a torus, the doubling map In this lecture we give two methods by which one can show that a given
More informationDRAFT - Math 102 Lecture Note - Dr. Said Algarni
Math02 - Term72 - Guides and Exercises - DRAFT 7 Techniques of Integration A summery for the most important integrals that we have learned so far: 7. Integration by Parts The Product Rule states that if
More informationf(x) cos dx L L f(x) sin L + b n sin a n cos
Chapter Fourier Series and Transforms. Fourier Series et f(x be an integrable functin on [, ]. Then the fourier co-ecients are dened as a n b n f(x cos f(x sin The claim is that the function f then can
More informationThe Central Limit Theorem
The Central Limit Theorem (A rounding-corners overiew of the proof for a.s. convergence assuming i.i.d.r.v. with 2 moments in L 1, provided swaps of lim-ops are legitimate) If {X k } n k=1 are i.i.d.,
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 informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationQuestions from Larson Chapter 4 Topics. 5. Evaluate
Math. Questions from Larson Chapter 4 Topics I. Antiderivatives. Evaluate the following integrals. (a) x dx (4x 7) dx (x )(x + x ) dx x. A projectile is launched vertically with an initial velocity of
More informationMATH FALL 2014 HOMEWORK 10 SOLUTIONS
Problem 1. MATH 241-2 FA 214 HOMEWORK 1 SOUTIONS Note that u E (x) 1 ( x) is an equilibrium distribution for the homogeneous pde that satisfies the given boundary conditions. We therefore want to find
More informationMetric Spaces Lecture 17
Metric Spaces Lecture 17 Homeomorphisms At the end of last lecture an example was given of a bijective continuous function f such that f 1 is not continuous. For another example, consider the sets T =
More informationFourier Series Example
Fourier Series Example Let us compute the Fourier series for the function on the interval [ π,π]. f(x) = x f is an odd function, so the a n are zero, and thus the Fourier series will be of the form f(x)
More informationG: Uniform Convergence of Fourier Series
G: Uniform Convergence of Fourier Series From previous work on the prototypical problem (and other problems) u t = Du xx 0 < x < l, t > 0 u(0, t) = 0 = u(l, t) t > 0 u(x, 0) = f(x) 0 < x < l () we developed
More information1 Mathematical Preliminaries
Mathematical Preliminaries We shall go through in this first chapter all of the mathematics needed for reading the rest of this book. The reader is expected to have taken a one year course in differential
More informationReal Analysis Qualifying Exam May 14th 2016
Real Analysis Qualifying Exam May 4th 26 Solve 8 out of 2 problems. () Prove the Banach contraction principle: Let T be a mapping from a complete metric space X into itself such that d(tx,ty) apple qd(x,
More information1.1 Appearance of Fourier series
Chapter Fourier series. Appearance of Fourier series The birth of Fourier series can be traced back to the solutions of wave equation in the work of Bernoulli and the heat equation in the work of Fourier.
More informationNotes on uniform convergence
Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean
More information1 The Complex Fourier Series
The Complex Fourier Series Adding Complexity to life The complex Fourier series is in some ways a superior product, at least for those people who are not terrified by complex numbers. Suppose fx) is a
More informationMATHS & STATISTICS OF MEASUREMENT
Imperial College London BSc/MSci EXAMINATION June 2008 This paper is also taken for the relevant Examination for the Associateship MATHS & STATISTICS OF MEASUREMENT For Second-Year Physics Students Tuesday,
More informationAPPLIED MATHEMATICS Part 4: Fourier Analysis
APPLIED MATHEMATICS Part 4: Fourier Analysis Contents 1 Fourier Series, Integrals and Transforms 2 1.1 Periodic Functions. Trigonometric Series........... 3 1.2 Fourier Series..........................
More informationMath 341: Probability Seventeenth Lecture (11/10/09)
Math 341: Probability Seventeenth Lecture (11/10/09) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/341/ Bronfman Science Center Williams
More informationA List of Problems in Real Analysis
A List of Problems in Real Analysis W.Yessen & T.Ma December 3, 218 This document was first created by Will Yessen, who was a graduate student at UCI. Timmy Ma, who was also a graduate student at UCI,
More informationThe Fourier Transform Method
The Fourier Transform Method R. C. Trinity University Partial Differential Equations April 22, 2014 Recall The Fourier transform The Fourier transform of a piecewise smooth f L 1 (R) is ˆf(ω) = F(f)(ω)
More informationHow many initial conditions are required to fully determine the general solution to a 2nd order linear differential equation?
How many initial conditions are required to fully determine the general solution to a 2nd order linear differential equation? (A) 0 (B) 1 (C) 2 (D) more than 2 (E) it depends or don t know How many of
More informationMATH 6337 Second Midterm April 1, 2014
You can use your book and notes. No laptop or wireless devices allowed. Write clearly and try to make your arguments as linear and simple as possible. The complete solution of one exercise will be considered
More informationEconomics 204 Fall 2011 Problem Set 2 Suggested Solutions
Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit
More informationp. 6-1 Continuous Random Variables p. 6-2
Continuous Random Variables Recall: For discrete random variables, only a finite or countably infinite number of possible values with positive probability (>). Often, there is interest in random variables
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions
Math 50 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 205 Homework #5 Solutions. Let α and c be real numbers, c > 0, and f is defined
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 informationMATH 205C: STATIONARY PHASE LEMMA
MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)
More informationLecture 5: Integrals and Applications
Lecture 5: Integrals and Applications Lejla Batina Institute for Computing and Information Sciences Digital Security Version: spring 2012 Lejla Batina Version: spring 2012 Wiskunde 1 1 / 21 Outline The
More informationProduct measure and Fubini s theorem
Chapter 7 Product measure and Fubini s theorem This is based on [Billingsley, Section 18]. 1. Product spaces Suppose (Ω 1, F 1 ) and (Ω 2, F 2 ) are two probability spaces. In a product space Ω = Ω 1 Ω
More informationOutline. Math Partial Differential Equations. Fourier Transforms for PDEs. Joseph M. Mahaffy,
Outline Math 53 - Partial Differential Equations s for PDEs Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory
More informationf (r) (a) r! (x a) r, r=0
Part 3.3 Differentiation v1 2018 Taylor Polynomials Definition 3.3.1 Taylor 1715 and Maclaurin 1742) If a is a fixed number, and f is a function whose first n derivatives exist at a then the Taylor polynomial
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 informationMath 140A - Fall Final Exam
Math 140A - Fall 2014 - Final Exam Problem 1. Let {a n } n 1 be an increasing sequence of real numbers. (i) If {a n } has a bounded subsequence, show that {a n } is itself bounded. (ii) If {a n } has a
More informationEntrance Exam, Real Analysis September 1, 2017 Solve exactly 6 out of the 8 problems
September, 27 Solve exactly 6 out of the 8 problems. Prove by denition (in ɛ δ language) that f(x) = + x 2 is uniformly continuous in (, ). Is f(x) uniformly continuous in (, )? Prove your conclusion.
More informationChapter 10: Partial Differential Equations
1.1: Introduction Chapter 1: Partial Differential Equations Definition: A differential equations whose dependent variable varies with respect to more than one independent variable is called a partial differential
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 informationLinear second-order differential equations with constant coefficients and nonzero right-hand side
Linear second-order differential equations with constant coefficients and nonzero right-hand side We return to the damped, driven simple harmonic oscillator d 2 y dy + 2b dt2 dt + ω2 0y = F sin ωt We note
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 informationMath 3338, Homework 4. f(u)du. (Note that f is discontinuous, whereas F is continuous everywhere.)
Math 3338, Homework 4. Define a function f by f(x) = { if x < if x < if x. Calculate an explicit formula for F(x) x f(u)du. (Note that f is discontinuous, whereas F is continuous everywhere.) 2. Define
More informationMATH115. Indeterminate Forms and Improper Integrals. Paolo Lorenzo Bautista. June 24, De La Salle University
MATH115 Indeterminate Forms and Improper Integrals Paolo Lorenzo Bautista De La Salle University June 24, 2014 PLBautista (DLSU) MATH115 June 24, 2014 1 / 25 Theorem (Mean-Value Theorem) Let f be a function
More informationMath 152 Take Home Test 1
Math 5 Take Home Test Due Monday 5 th October (5 points) The following test will be done at home in order to ensure that it is a fair and representative reflection of your own ability in mathematics I
More informationContinuity. MATH 161 Calculus I. J. Robert Buchanan. Fall Department of Mathematics
Continuity MATH 161 Calculus I J. Robert Buchanan Department of Mathematics Fall 2017 Intuitive Idea A process or an item can be described as continuous if it exists without interruption. The mathematical
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 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 informationTime-Dependent Statistical Mechanics A1. The Fourier transform
Time-Dependent Statistical Mechanics A1. The Fourier transform c Hans C. Andersen November 5, 2009 1 Definition of the Fourier transform and its inverse. Suppose F (t) is some function of time. Then its
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 informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationChapter 3a Topics in differentiation. Problems in differentiation. Problems in differentiation. LC Abueg: mathematical economics
Chapter 3a Topics in differentiation Lectures in Mathematical Economics L Cagandahan Abueg De La Salle University School of Economics Problems in differentiation Problems in differentiation Problem 1.
More informationMath 205b Homework 2 Solutions
Math 5b Homework Solutions January 5, 5 Problem (R-S, II.) () For the R case, we just expand the right hand side and use the symmetry of the inner product: ( x y x y ) = = ((x, x) (y, y) (x, y) (y, x)
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 informationChapter 8 Indeterminate Forms and Improper Integrals Math Class Notes
Chapter 8 Indeterminate Forms and Improper Integrals Math 1220-004 Class Notes Section 8.1: Indeterminate Forms of Type 0 0 Fact: The it of quotient is equal to the quotient of the its. (book page 68)
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 information2 Two-Point Boundary Value Problems
2 Two-Point Boundary Value Problems Another fundamental equation, in addition to the heat eq. and the wave eq., is Poisson s equation: n j=1 2 u x 2 j The unknown is the function u = u(x 1, x 2,..., x
More informationNorthwestern University Department of Electrical Engineering and Computer Science
Northwestern University Department of Electrical Engineering and Computer Science EECS 454: Modeling and Analysis of Communication Networks Spring 2008 Probability Review As discussed in Lecture 1, probability
More informationAnalysis Qualifying Exam
Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,
More information18.175: Lecture 15 Characteristic functions and central limit theorem
18.175: Lecture 15 Characteristic functions and central limit theorem Scott Sheffield MIT Outline Characteristic functions Outline Characteristic functions Characteristic functions Let X be a random variable.
More informationFinal Exam May 4, 2016
1 Math 425 / AMCS 525 Dr. DeTurck Final Exam May 4, 2016 You may use your book and notes on this exam. Show your work in the exam book. Work only the problems that correspond to the section that you prepared.
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 informationSome Aspects of Solutions of Partial Differential Equations
Some Aspects of Solutions of Partial Differential Equations K. Sakthivel Department of Mathematics Indian Institute of Space Science & Technology(IIST) Trivandrum - 695 547, Kerala Sakthivel@iist.ac.in
More informationExamination paper for TMA4125 Matematikk 4N
Department of Mathematical Sciences Examination paper for TMA45 Matematikk 4N Academic contact during examination: Anne Kværnø a, Louis-Philippe Thibault b Phone: a 9 66 38 4, b 9 3 0 95 Examination date:
More informationLecture 5: Expectation
Lecture 5: Expectation 1. Expectations for random variables 1.1 Expectations for simple random variables 1.2 Expectations for bounded random variables 1.3 Expectations for general random variables 1.4
More informationProblem 3. Give an example of a sequence of continuous functions on a compact domain converging pointwise but not uniformly to a continuous function
Problem 3. Give an example of a sequence of continuous functions on a compact domain converging pointwise but not uniformly to a continuous function Solution. If we does not need the pointwise limit of
More information1 Joint and marginal distributions
DECEMBER 7, 204 LECTURE 2 JOINT (BIVARIATE) DISTRIBUTIONS, MARGINAL DISTRIBUTIONS, INDEPENDENCE So far we have considered one random variable at a time. However, in economics we are typically interested
More informationCHAPTER 6. Limits of Functions. 1. Basic Definitions
CHAPTER 6 Limits of Functions 1. Basic Definitions DEFINITION 6.1. Let D Ω R, x 0 be a limit point of D and f : D! R. The limit of f (x) at x 0 is L, if for each " > 0 there is a ± > 0 such that when x
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More informationMetric Spaces. Exercises Fall 2017 Lecturer: Viveka Erlandsson. Written by M.van den Berg
Metric Spaces Exercises Fall 2017 Lecturer: Viveka Erlandsson Written by M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK 1 Exercises. 1. Let X be a non-empty set, and suppose
More informationDefinition of differential equations and their classification. Methods of solution of first-order differential equations
Introduction to differential equations: overview Definition of differential equations and their classification Solutions of differential equations Initial value problems Existence and uniqueness Mathematical
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More information1. For each statement, either state that it is True or else Give a Counterexample: (a) If a < b and c < d then a c < b d.
Name: Instructions. Show all work in the space provided. Indicate clearly if you continue on the back side, and write your name at the top of the scratch sheet if you will turn it in for grading. No books
More informationMATH 411 NOTES (UNDER CONSTRUCTION)
MATH 411 NOTES (NDE CONSTCTION 1. Notes on compact sets. This is similar to ideas you learned in Math 410, except open sets had not yet been defined. Definition 1.1. K n is compact if for every covering
More informationMath 337, Summer 2010 Assignment 5
Math 337, Summer Assignment 5 Dr. T Hillen, University of Alberta Exercise.. Consider Laplace s equation r r r u + u r r θ = in a semi-circular disk of radius a centered at the origin with boundary conditions
More informationAn idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim
An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the
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 informationInternational Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994
International Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994 1 PROBLEMS AND SOLUTIONS First day July 29, 1994 Problem 1. 13 points a Let A be a n n, n 2, symmetric, invertible
More informationAnnouncements. Topics: Homework:
Announcements Topics: - sections 7.1 (differential equations), 7.2 (antiderivatives), and 7.3 (the definite integral +area) * Read these sections and study solved examples in your textbook! Homework: -
More informationAssignment-10. (Due 11/21) Solution: Any continuous function on a compact set is uniformly continuous.
Assignment-1 (Due 11/21) 1. Consider the sequence of functions f n (x) = x n on [, 1]. (a) Show that each function f n is uniformly continuous on [, 1]. Solution: Any continuous function on a compact set
More informationLECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).
CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f
More informationSeries FOURIER SERIES. Graham S McDonald. A self-contained Tutorial Module for learning the technique of Fourier series analysis
Series FOURIER SERIES Graham S McDonald A self-contained Tutorial Module for learning the technique of Fourier series analysis Table of contents Begin Tutorial c 24 g.s.mcdonald@salford.ac.uk 1. Theory
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More information7.1. Calculus of inverse functions. Text Section 7.1 Exercise:
Contents 7. Inverse functions 1 7.1. Calculus of inverse functions 2 7.2. Derivatives of exponential function 4 7.3. Logarithmic function 6 7.4. Derivatives of logarithmic functions 7 7.5. Exponential
More informationThe random variable 1
The random variable 1 Contents 1. Definition 2. Distribution and density function 3. Specific random variables 4. Functions of one random variable 5. Mean and variance 2 The random variable A random variable
More informationSequences and Series of Functions
Chapter 13 Sequences and Series of Functions These notes are based on the notes A Teacher s Guide to Calculus by Dr. Louis Talman. The treatment of power series that we find in most of today s elementary
More information