Differential Analysis II Lectures 22-24
|
|
- Alexander Dawson
- 6 years ago
- Views:
Transcription
1 Lecture : 3 April Differential Analysis II Lectures - Instructor: Larry Guth Trans.: Kevin Sacel.1 Precursor to Schrödinger Equation Suppose we are trying to find u(, t) with u(, 0) = f() satisfying one of the following three PDEs: A: t u = u B: t u = u C: t u = i u We can tae then tae the Fourier transform of each of these, corresponding to A : t û(w, t) = (πiw) u(w, t) B : t u(w, t) = (πiw) u(w, t) C : tû(w, t) = i(πiw) u (w, t) Each of these can now be formally solved in this frequency domain, since these are just separable differential equations (and the initial data f corresponds to initial data f). However, such solutions might or might not correspond to legitimate solutions u, since if the formal solution for û is not well enough behaved in w, then one cannot tae the Fourier transform to get a corresponding solution u. We analyze each case separately. A: Solving yields û(w, t) = ep(cw t)f (w). For almost all initial data, this solution goes bananas for t > 0, because ep(cw t) grows too fast. Thus, we can t possibly tae a Fourier transform to find a legitimate solution u(, t). For eample, if f = e π, which decays quite nicely, then f = e πw, which although it still decays nicely, is taen over by ep(cw t) for any t > 0. Of course, if f C c, then we get a solution. B: Solving yields u(w, t) = ep( Cw t)f(w). For t > 0, for most f, u will become immediately quite smooth. If f L 1, then f is bounded, and so û(w, t) decays rapidly, which means that taing the Fourier transform, u(, t) is C. In fact, we can say a bit more. Proposition 1. u(, 1) L C f L 1 Proof. We have u(, 1) u(w, 1) L 1 w = (πiw) e iw f(w) L 1 (πiw) e iw L 1 f L C f L 1 1
2 Even further, one can use either a scaling argument (since if u(, t) is a solution to the differential equation, so is u(λ, λ t)) or a direct argument (presented below) to prove the following proposition: Proposition. u(, t) L t 1/ f L 1 Proof. u(, t) u(w, t) L 1 w Cw = e t f (w) L 1 e Cwt L 1 f L 1/ t C f L 1 C: Solving in the frequency domain yields (up to rescaling) u(w, t) = e iw t f(w). Note that this means that if f is Schwartz, then so is û, so in particular, if f is itself Schwartz, then so is f, hence u, and so we can tae the Fourier transform and get a Schwartz function u satisfying the PDE. So at the very least, we can solve for f Schwartz, which is a decently large class. Proposition 3. u(, t) L is independent of t for each 0. Proof. By an application of Plancherel s Theorem, this is equal to (πiw) e iw t f(w) L, and so the w eponential term has constant modulus 1 and does not affect this value. What this means is that studying C is much more subtle than studying A or B, since the previous proposition tells us that the total mass in the solution of this equation is independent of t, so things will not just blow up or become more regular as t increases. If we want to study decay, we need to be careful. By scaling, if solutions to this PDE do decay, then it would need to do so in a way resembling the following: u(, t) L t 1/ f L 1. The main question is, does this hold?. The Schrödinger Equation Instead of PDE C from the previous subsection, we will focus on the Schrödinger equation, which as we will see immediately behaves quite similarly to the above. The Schrödinger Equation: Find u(, t), R d, t R, satisfying the initial condition u(, 0) = f() such that t u = i u. In the frequency domain, this amounts to solving the equation û(w, t) = e i w t f (w), and issues of convergence are relatively similar to case C of the previous subsection. In fact, the same eact proves carry over to show: Proposition. If f S, then we get a solution u S. Proposition 5. For any multi-inde I, I u(, t) L is independent of t. We wish to understand the decay of the Schrödinger equation. In particular, we will prove the following proposition: Proposition 6. u(, t) L t d/ f L 1. Remar 7. There is in fact a nice formula for the solution, given by u(, t) = t d/ e i /t f(), so that the proposition becomes trivial. However, we want to have a more generalizable gadget for completing this proof.
3 Proof. We will complete the proof in the net lecture. For now, let us reduce the problem to a lemma. First of all, note that u(, t) = u(w, t)e iw dw = lim e δw e i w t f (w)e iw dw δ 0 Now if we set S δ,t () equal to the inverse Fourier transform of e δ w e i w t with respect to w, then we see that u(, t) = lim S δ,t () f(). δ 0 In particular, we included the term e δ w so that we could tae this Fourier transform in the first place. Hence, we find that u(, t) L lim inf S δ,t L f L 1. It suffices therefore to prove that S δ,t L t d/ uniformly as δ 0. By scaling, we need only prove in fact that S δ,1 L is uinformly bounded by a constant. But this integral breas up into a product as follows: S δ,1 () = e δ w e i w e iw dw R d d = e δw j e iw j e iw j j dw j j=1 R So it suffices to prove the one-dimensional case, the second of the following two lemmas: Lemma 1. e δw e iw dw 1 uniformly in δ. R Lemma. e δw e iw e iw dw 1 uniformly in δ,. R We will prove these net time. Again, the second of these lemmas is what we actually need, but proving the first gives us a good indication for how we might prove the second. Lecture 3: 6 April Completion of proof Proof Setch of Lemma 1. Set η = w. Then changing variables accordingly, we see e δw e iw dw = e δη η 1/ e iη dη, 0 0 and this ind of loos similar to the integration estimates in the Gauss circle problem. A bounded distance away from 0, we can use the triangle inequality, while away from 0, we can integrate by parts. The main term of integration will be η 3/ e iη, which is integrable. Proof Setch of Lemma. This is similar, but now e iw is replaced with e i(w+w ). But w + w is just a quadratic centered around w 0 := /, and the same proof carries over where we change coordinates to integrate around this center instead. Remar 8. There is an alternative proof of these two. The oscillatory term gets faster and faster away from w 0, and so if we brea the integral up into corresponding full periods in the real and imaginary parts, we will get alternating sums which are at most as large as the first term, which can be bounded by the triangle inequality. 3
4 3. Statement of Strichartz Theorem In fact, we see that by the same method, we can study S δ,t () still for all δ,, but also for all t, not just t 0. Say we fi δ = 1. Of course, we now that the mass given by S 1 (t, ) L remains constant in time. At time t = 0, S 1 (t, ) has about height 1 and width 1, while at time t >> 1, it is defocused with height about t d/ and width about t. For negative t, we get focusing data, while for positive t, we get defocusing data, because if we solve the Schrödinger equation with this initial data, we just flow with t getting larger, and for starting at negative t, this collimates around t = 0 and then defocuses again. Qualitatively, the focusing and defocusing data are quite similar, so one epects it to be difficult to use purely qualitative estimates to learn about what happens as we flow in time. Nonetheless, we might be interested in what inds of estimates we can still obtain. To motivate this, consider the following question: Question 1. For which p do we have the estimate u(, t) p L,t f L = mass 1/? Intimately related is the question of how large is the set {(, t): u(, t) > t}? (d+1) d Remar 9. For the function S 1 we have been considering, we get such an estimate if and only if p >, which we will see later. So what about solutions to the Schrödinger equation? Note that if u solves the Schrödinger equation, then u λ (, t) := u(/λ, t/λ ) also solves the Schrödinger equation with initial data f λ () = f(/λ), and we have d+) u p λ L λ ( /p u L p, f λ L λ d/ f L.,t,t Hence, the only possible p which could possibly answer our question is when p = (d + )/d. In fact, this equation is satisfied uniformly for all S δ uniformly in δ if and only if p = (d + )/d. Of course, it is worth noting that S δ,t () is by definition the solution to Schrödinger equation with initial data given by a Gaussian (in particular the inverse Fourier transform of e δw ). So one might epect the following theorem: Theorem 10 (Strichartz, 1970 s). Set p = (d + )/d. Then the estimate u(, t) L p,t u(, 0) L holds for all solutions to the Schrödinger equation. The proof of this theorem will come later, but even here, we stumble upon a general sort of analytic question: Question. Let T be a given linear operator. Then find all p, q such that there is an inequality of the form T f L p f L q. Eample 11. Just something to thin about: Consider g() := e i (1 + ) 1/, and let T f := f g. Then for what (p, q) do we get an inequality as above. This is of course a difficult question, and currently, there is no universal way to solve this question. However, there are many tools which can be used to attac it. We will see how interpolation is one etremely useful tool, allowing us to tae two given estimates of this form and yield an interval-worth of these estimates. 3.3 Interpolation Interpolation of L p spaces comes in two flavors, both from the first half of the 0th century. The first is due to Riesz-Thorin, while the second is due to Marciniewicz. We will follow the Marciniewicz approach instead, although see Remar 13. We begin with a special case of interpolation. Theorem 1 (Interpolation, Special Case). If T is a linear operator, 1 p < r < q, and T f L p p q r f L p for all f L and T f L q f L q for all f L, then for all f L, we have T f L r C(p, q, r) f L r.
5 Remar 13. In this special case, Riesz-Thorin actually gives C(p, q, r) = 1, which is optimal. What the Riesz-Thorin approach gives in terms of better bounds, the Marciniewicz approach maes up for in slightly more general hypotheses, to be stated later, ecept for some fairly uninteresting cases which Marciniewicz doesn t cover but Riesz-Thorin does. We shall not concern ourselves with these matters from here on. We won t quite finish the proof today, but we ll still do a little bit of wor. The idea of the proof of interpolation is to loo at f and T f at different height scales. Define Sf := {: f() < +1 }, f = f χ S f. p Then we have f = f, and we get f L p S (f) p. The idea now is to use estimates on S l (T f ) and glue them together carefully to arrive at a proof. We shall wor through this over the remainder of this lecture and into net lecture. We begin with the estimate on S l (T f ). Proposition 1. If T f p f p for all f L p, then S l (T f ) p ( l)p S (f). Proof. We have p p p S l (T f ) lp T f p p f p S (f). Hence, the proposition above gives us bounds on S l (T f ) with respect to both p and q. Say p < q. Then we see that if l >, then the q-bound is better, and vice versa if l <. This allows us to prove the following corollary: Corollary 15. If T f p f p for all f L p and T f q f q for all f L q with p < q, then there is a constant ɛ(p, q, r) such that for p < r < q, (T f ) ɛ l L l r f L r. Proof. Suppose first that l. Then using the q-bounds, we find and so (T f ) l r r rl S l (T f ) rl q (l )q S (f) = f r r rl r q (l )q (T f ) (l )(1 q/r) q/r f l r r (l )(1 q/r) q/p and 1 q/r < 0. We have a similar bound when l, but instead we get our ɛ value is p/r 1 (and the etra q/p term disappears, though this doesn t matter). Lecture : 8 April Finishing the special case Let s add some etra notation. Set V λ (f) := {: f() > λ}. Of course, V λ (f) λ p T f p p. Now, we will actually show that the theorem we stated last time is true in a slightly weaer setting (and in fact, we ve already down some of the wor). Theorem 16 (Interpolation, Tae II). Suppose T is sublinear (meaning T (f + g)() T f() + T g() ), and we have the so-called wea type estimates V λ (T f) λ p f p p for all f L p q and Vλ(T f) f q for all f L q, say with 1 p < r < q. Then T f L r C(p, q, r) f L r. Remar 17. If we had the wea type estimates, but with constants A p and A q, then our concluding estimate would have an etra factor of A α p A 1 α q, with 1 = α 1 + (1 α) 1 r p q. This is a simple scaling argument, so it suffices to prove for A p = A q = 1. We have Lemma 3. V λ(t f ) ( /λ) p S (f) (and also for q). 5
6 Proof. V λ (T f ) λ p f p p S (f) p. Lemma. V l(t f ) lr S (f) r ɛ l Proof. Essentially done last time. Corollary 18. T f L r f L r Proof. We have T f l l χv l (T f ), so taing L r norms and using the previous lemma gives the result. Our goal is now to add the contributions from all of these height scales. The naïve approach would be to simply use the sublinearity of T to give T f L r T f L r f L r At this point, we d have trouble bounding by f L r. Instead, we want to use the info from our bounds on S (f) to change the first inequality. The correct way to do this is with the following lemma, which is the tricy part of the argument. Lemma 5. V T f ( l ) S r lr ɛ l (f) Proof. This would be easy if T f() l implied that there eists a with T f () l. Unfortunately, we don t have this, but we can be a little bit more clever. For each l, choose weights w with w = 1, which we will choose later. Then the sublinearity of T means that if T f() l, then there is some with T f () w l. So we find that V l(t f) V (T f ) S (f) r lr w c ɛ l w l So if we choose w 1 with constant chosen so that (l ) w = 1, then the w term is dominated by the eponential decay of the ɛ l term, and so we can replace ɛ by an arbitrarily smaller value and obtain the same result. The rest of the proof is now easy. T f r r V l(t f) l l lr S (f) r ɛ l Summing in l, we see this is on the order of S (f) r, which is itself about f r r.. Statement of the General Case The following is essentially the content of a problem on the th PSet, and is again discussed in the April 15 notes. Theorem 19 (Marciniewicz Interpolation). Suppose 1 p i q i for i = 0, 1 with q 0 = q 1. If T sublinear and for all f in the appropriate spaces we have the wea type estimates that for all λ, c. (V λ (T f) λ qi ) 1/qi A i f pi then for each 0 < θ < 1, setting 1 = θ 1 + (1 θ) 1 p θ p 0 p 1 and similarly for q θ, we have strong type estimates of the form θ T f q θ θ A 1 0 A θ 1 f pθ. In other words, the space of estimates of the form T f q f p is conve in the (1/p, 1/q)-domain, and in order to interpolate, one only needs wea estimates at the boundary. 6
7 Question 3. Here s a challenge. Suppose we are given (p 0, q 0 ), (p 1, q 1 ) as in the hypotheses of the theorem. Is there a sublinear operator T such that T f q f p if and only if (p, q) lie in the interpolating interval between these two endpoints? How about if we choose any conve subset of the (1/p, 1/q)-domain? Remar 0. If T is the Fourier transform on R d, then we have strong estimates on L by Plancherel (in fact equality) and L by the triangle inequality. Hence, we get strong estimates by interpolation of the form f L q f L p with p q = 1. In fact, these are the only such estimates for the Fourier transform. 7
8 MIT OpenCourseWare Differential Analysis II: Partial Differential Equations and Fourier Analysis Spring 016 For information about citing these materials or our Terms of Use, visit:
Now, the above series has all non-negative terms, and hence is an upper bound for any fixed term in the series. That is to say, for fixed n 0 N,
l p IS COMPLETE Let 1 p, and recall the definition of the metric space l p : { } For 1 p
More information18.01 Single Variable Calculus Fall 2006
MIT OpenCourseWare http://ocw.mit.edu 8.0 Single Variable Calculus Fall 2006 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Lecture 0 8.0 Fall 2006 Lecture
More informationAbel Summation MOP 2007, Black Group
Abel Summation MOP 007, Blac Group Zachary Abel June 5, 007 This lecture focuses on the Abel Summation formula, which is most often useful as a way to tae advantage of unusual given conditions such as
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 informationCentral Limit Theorem and the Law of Large Numbers Class 6, Jeremy Orloff and Jonathan Bloom
Central Limit Theorem and the Law of Large Numbers Class 6, 8.5 Jeremy Orloff and Jonathan Bloom Learning Goals. Understand the statement of the law of large numbers. 2. Understand the statement of the
More informationLecture 12 Reactions as Rare Events 3/02/2009 Notes by MIT Student (and MZB)
Lecture 1 Reactions as Rare Events 3/0/009 Notes by MIT Student (and MZB) 1. Introduction In this lecture, we ll tackle the general problem of reaction rates involving particles jumping over barriers in
More informationNotes on Discrete Probability
Columbia University Handout 3 W4231: Analysis of Algorithms September 21, 1999 Professor Luca Trevisan Notes on Discrete Probability The following notes cover, mostly without proofs, the basic notions
More informationCourse Description for Real Analysis, Math 156
Course Description for Real Analysis, Math 156 In this class, we will study elliptic PDE, Fourier analysis, and dispersive PDE. Here is a quick summary of the topics will study study. They re described
More informationDecoupling Lecture 1
18.118 Decoupling Lecture 1 Instructor: Larry Guth Trans. : Sarah Tammen September 7, 2017 Decoupling theory is a branch of Fourier analysis that is recent in origin and that has many applications to problems
More informationGaussian integrals. Calvin W. Johnson. September 9, The basic Gaussian and its normalization
Gaussian integrals Calvin W. Johnson September 9, 24 The basic Gaussian and its normalization The Gaussian function or the normal distribution, ep ( α 2), () is a widely used function in physics and mathematical
More informationA Propagating Wave Packet The Group Velocity
Lecture 7 A Propagating Wave Pacet The Group Velocity Phys 375 Overview and Motivation: Last time we looed at a solution to the Schrödinger equation (SE) with an initial condition (,) that corresponds
More informationIB Mathematics HL Year 2 Unit 11: Completion of Algebra (Core Topic 1)
IB Mathematics HL Year Unit : Completion of Algebra (Core Topic ) Homewor for Unit Ex C:, 3, 4, 7; Ex D: 5, 8, 4; Ex E.: 4, 5, 9, 0, Ex E.3: (a), (b), 3, 7. Now consider these: Lesson 73 Sequences and
More informationCONSTRUCTION OF sequence of rational approximations to sets of rational approximating sequences, all with the same tail behaviour Definition 1.
CONSTRUCTION OF R 1. MOTIVATION We are used to thinking of real numbers as successive approximations. For example, we write π = 3.14159... to mean that π is a real number which, accurate to 5 decimal places,
More information2 Generating Functions
2 Generating Functions In this part of the course, we re going to introduce algebraic methods for counting and proving combinatorial identities. This is often greatly advantageous over the method of finding
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationProblem 1: Compactness (12 points, 2 points each)
Final exam Selected Solutions APPM 5440 Fall 2014 Applied Analysis Date: Tuesday, Dec. 15 2014, 10:30 AM to 1 PM You may assume all vector spaces are over the real field unless otherwise specified. Your
More information0.1. Linear transformations
Suggestions for midterm review #3 The repetitoria are usually not complete; I am merely bringing up the points that many people didn t now on the recitations Linear transformations The following mostly
More informationLecture 3: September 10
CS294 Markov Chain Monte Carlo: Foundations & Applications Fall 2009 Lecture 3: September 10 Lecturer: Prof. Alistair Sinclair Scribes: Andrew H. Chan, Piyush Srivastava Disclaimer: These notes have not
More informationUNCONSTRAINED OPTIMIZATION PAUL SCHRIMPF OCTOBER 24, 2013
PAUL SCHRIMPF OCTOBER 24, 213 UNIVERSITY OF BRITISH COLUMBIA ECONOMICS 26 Today s lecture is about unconstrained optimization. If you re following along in the syllabus, you ll notice that we ve skipped
More informationMore Empirical Process Theory
More Empirical Process heory 4.384 ime Series Analysis, Fall 2008 Recitation by Paul Schrimpf Supplementary to lectures given by Anna Mikusheva October 24, 2008 Recitation 8 More Empirical Process heory
More information1 Continuity and Limits of Functions
Week 4 Summary This week, we will move on from our discussion of sequences and series to functions. Even though sequences and functions seem to be very different things, they very similar. In fact, we
More informationDIFFERENTIATING UNDER THE INTEGRAL SIGN
DIFFEENTIATING UNDE THE INTEGAL SIGN KEITH CONAD I had learned to do integrals by various methods shown in a book that my high school physics teacher Mr. Bader had given me. [It] showed how to differentiate
More informationTopic 4 Notes Jeremy Orloff
Topic 4 Notes Jeremy Orloff 4 auchy s integral formula 4. Introduction auchy s theorem is a big theorem which we will use almost daily from here on out. Right away it will reveal a number of interesting
More informationBregman Divergence and Mirror Descent
Bregman Divergence and Mirror Descent Bregman Divergence Motivation Generalize squared Euclidean distance to a class of distances that all share similar properties Lots of applications in machine learning,
More informationIntroduction. So, why did I even bother to write this?
Introduction This review was originally written for my Calculus I class, but it should be accessible to anyone needing a review in some basic algebra and trig topics. The review contains the occasional
More informationTheorem (Special Case of Ramsey s Theorem) R(k, l) is finite. Furthermore, it satisfies,
Math 16A Notes, Wee 6 Scribe: Jesse Benavides Disclaimer: These notes are not nearly as polished (and quite possibly not nearly as correct) as a published paper. Please use them at your own ris. 1. Ramsey
More informationClass Meeting # 2: The Diffusion (aka Heat) Equation
MATH 8.52 COURSE NOTES - CLASS MEETING # 2 8.52 Introduction to PDEs, Fall 20 Professor: Jared Speck Class Meeting # 2: The Diffusion (aka Heat) Equation The heat equation for a function u(, x (.0.). Introduction
More informationA COUNTEREXAMPLE TO AN ENDPOINT BILINEAR STRICHARTZ INEQUALITY TERENCE TAO. t L x (R R2 ) f L 2 x (R2 )
Electronic Journal of Differential Equations, Vol. 2006(2006), No. 5, pp. 6. ISSN: 072-669. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) A COUNTEREXAMPLE
More informationGeneral Technical Remarks on PDE s and Boundary Conditions Kurt Bryan MA 436
General Technical Remarks on PDE s and Boundary Conditions Kurt Bryan MA 436 1 Introduction You may have noticed that when we analyzed the heat equation on a bar of length 1 and I talked about the equation
More information1 5 π 2. 5 π 3. 5 π π x. 5 π 4. Figure 1: We need calculus to find the area of the shaded region.
. Area In order to quantify the size of a 2-dimensional object, we use area. Since we measure area in square units, we can think of the area of an object as the number of such squares it fills up. Using
More informationNOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES
NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES JONATHAN LUK These notes discuss theorems on the existence, uniqueness and extension of solutions for ODEs. None of these results are original. The proofs
More informationLecture Notes March 11, 2015
18.156 Lecture Notes March 11, 2015 trans. Jane Wang Recall that last class we considered two different PDEs. The first was u ± u 2 = 0. For this one, we have good global regularity and can solve the Dirichlet
More informationAP Calculus AB Summer Assignment
AP Calculus AB Summer Assignment Name: When you come back to school, it is my epectation that you will have this packet completed. You will be way behind at the beginning of the year if you haven t attempted
More information1D Wave Equation General Solution / Gaussian Function
D Wave Euation General Solution / Gaussian Function Phys 375 Overview and Motivation: Last time we derived the partial differential euation known as the (one dimensional wave euation Today we look at the
More informationApproximate inference, Sampling & Variational inference Fall Cours 9 November 25
Approimate inference, Sampling & Variational inference Fall 2015 Cours 9 November 25 Enseignant: Guillaume Obozinski Scribe: Basile Clément, Nathan de Lara 9.1 Approimate inference with MCMC 9.1.1 Gibbs
More informationWAITING FOR A BAT TO FLY BY (IN POLYNOMIAL TIME)
WAITING FOR A BAT TO FLY BY (IN POLYNOMIAL TIME ITAI BENJAMINI, GADY KOZMA, LÁSZLÓ LOVÁSZ, DAN ROMIK, AND GÁBOR TARDOS Abstract. We observe returns of a simple random wal on a finite graph to a fixed node,
More informationMATH 426, TOPOLOGY. p 1.
MATH 426, TOPOLOGY THE p-norms In this document we assume an extended real line, where is an element greater than all real numbers; the interval notation [1, ] will be used to mean [1, ) { }. 1. THE p
More information3.3 Limits and Infinity
Calculus Maimus. Limits Infinity Infinity is not a concrete number, but an abstract idea. It s not a destination, but a really long, never-ending journey. It s one of those mind-warping ideas that is difficult
More informationSolutions to the 77th William Lowell Putnam Mathematical Competition Saturday, December 3, 2016
Solutions to the 77th William Lowell Putnam Mathematical Competition Saturday December 3 6 Kiran Kedlaya and Lenny Ng A The answer is j 8 First suppose that j satisfies the given condition For p j we have
More informationMetric spaces and metrizability
1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively
More informationLecture 9: Taylor Series
Math 8 Instructor: Padraic Bartlett Lecture 9: Taylor Series Week 9 Caltech 212 1 Taylor Polynomials and Series When we first introduced the idea of the derivative, one of the motivations we offered was
More informationMATH 116, LECTURES 10 & 11: Limits
MATH 6, LECTURES 0 & : Limits Limits In application, we often deal with quantities which are close to other quantities but which cannot be defined eactly. Consider the problem of how a car s speedometer
More informationx 1 + x 2 2 x 1 x 2 1 x 2 2 min 3x 1 + 2x 2
Lecture 1 LPs: Algebraic View 1.1 Introduction to Linear Programming Linear programs began to get a lot of attention in 1940 s, when people were interested in minimizing costs of various systems while
More information0.1 Complex Analogues 1
0.1 Complex Analogues 1 Abstract In complex geometry Kodaira s theorem tells us that on a Kähler manifold sufficiently high powers of positive line bundles admit global holomorphic sections. Donaldson
More informationMAT 585: Johnson-Lindenstrauss, Group testing, and Compressed Sensing
MAT 585: Johnson-Lindenstrauss, Group testing, and Compressed Sensing Afonso S. Bandeira April 9, 2015 1 The Johnson-Lindenstrauss Lemma Suppose one has n points, X = {x 1,..., x n }, in R d with d very
More informationCalculus I. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This document was written and copyrighted by Paul Dawkins. Use of this document and its online version is governed by the Terms and Conditions of Use located at. The online version of this document is
More informationChapter 7. Number Theory. 7.1 Prime Numbers
Chapter 7 Number Theory 7.1 Prime Numbers Any two integers can be multiplied together to produce a new integer. For example, we can multiply the numbers four and five together to produce twenty. In this
More informationPreface.
This document was written and copyrighted by Paul Dawkins. Use of this document and its online version is governed by the Terms and Conditions of Use located at. The online version of this document is
More information18.303: Introduction to Green s functions and operator inverses
8.33: Introduction to Green s functions and operator inverses S. G. Johnson October 9, 2 Abstract In analogy with the inverse A of a matri A, we try to construct an analogous inverse  of differential
More informationResearch Article On Maslanka s Representation for the Riemann Zeta Function
International Mathematics and Mathematical Sciences Volume 200, Article ID 7447, 9 pages doi:0.55/200/7447 Research Article On Maslana s Representation for the Riemann Zeta Function Luis Báez-Duarte Departamento
More informationMA131 - Analysis 1. Workbook 4 Sequences III
MA3 - Analysis Workbook 4 Sequences III Autumn 2004 Contents 2.3 Roots................................. 2.4 Powers................................. 3 2.5 * Application - Factorials *.....................
More informationChapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011)
Chapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011) Before we consider Gelfond s, and then Schneider s, complete solutions to Hilbert s seventh problem let s look back
More informationConvex Optimization Notes
Convex Optimization Notes Jonathan Siegel January 2017 1 Convex Analysis This section is devoted to the study of convex functions f : B R {+ } and convex sets U B, for B a Banach space. The case of B =
More informationCONVERGENCE AND STABILITY OF A REGULARIZATION METHOD FOR MAXIMAL MONOTONE INCLUSIONS AND ITS APPLICATIONS TO CONVEX OPTIMIZATION
Variational Analysis and Appls. F. Giannessi and A. Maugeri, Eds. Kluwer Acad. Publ., Dordrecht, 2004 CONVERGENCE AND STABILITY OF A REGULARIZATION METHOD FOR MAXIMAL MONOTONE INCLUSIONS AND ITS APPLICATIONS
More informationHOW TO LOOK AT MINKOWSKI S THEOREM
HOW TO LOOK AT MINKOWSKI S THEOREM COSMIN POHOATA Abstract. In this paper we will discuss a few ways of thinking about Minkowski s lattice point theorem. The Minkowski s Lattice Point Theorem essentially
More information14.30 Introduction to Statistical Methods in Economics Spring 2009
MIT OpenCourseWare http://ocw.mit.edu.30 Introduction to Statistical Methods in Economics Spring 009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. .30
More informationLECTURE 2. Hilbert Symbols
LECTURE 2 Hilbert Symbols Let be a local field over Q p (though any local field suffices) with char() 2. Note that this includes fields over Q 2, since it is the characteristic of the field, and not the
More informationTHE EGG GAME DR. WILLIAM GASARCH AND STUART FLETCHER
THE EGG GAME DR. WILLIAM GASARCH AND STUART FLETCHER Abstract. We present a game and proofs for an optimal solution. 1. The Game You are presented with a multistory building and some number of superstrong
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationRANDOM PROPERTIES BENOIT PAUSADER
RANDOM PROPERTIES BENOIT PAUSADER. Quasilinear problems In general, one consider the following trichotomy for nonlinear PDEs: A semilinear problem is a problem where the highest-order terms appears linearly
More informationCS 229r: Algorithms for Big Data Fall Lecture 19 Nov 5
CS 229r: Algorithms for Big Data Fall 215 Prof. Jelani Nelson Lecture 19 Nov 5 Scribe: Abdul Wasay 1 Overview In the last lecture, we started discussing the problem of compressed sensing where we are given
More informationSpectral Graph Theory Lecture 2. The Laplacian. Daniel A. Spielman September 4, x T M x. ψ i = arg min
Spectral Graph Theory Lecture 2 The Laplacian Daniel A. Spielman September 4, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in class. The notes written before
More informationD(f/g)(P ) = D(f)(P )g(p ) f(p )D(g)(P ). g 2 (P )
We first record a very useful: 11. Higher derivatives Theorem 11.1. Let A R n be an open subset. Let f : A R m and g : A R m be two functions and suppose that P A. Let λ A be a scalar. If f and g are differentiable
More informationALGEBRAIC STRUCTURE AND DEGREE REDUCTION
ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S F n. We define deg(s) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(s) n S 1/n. In fact,
More informationLecture 4: LMN Learning (Part 2)
CS 294-114 Fine-Grained Compleity and Algorithms Sept 8, 2015 Lecture 4: LMN Learning (Part 2) Instructor: Russell Impagliazzo Scribe: Preetum Nakkiran 1 Overview Continuing from last lecture, we will
More informationTaylor Series and Series Convergence (Online)
7in 0in Felder c02_online.te V3 - February 9, 205 9:5 A.M. Page CHAPTER 2 Taylor Series and Series Convergence (Online) 2.8 Asymptotic Epansions In introductory calculus classes the statement this series
More informationLecture 6 Random walks - advanced methods
Lecture 6: Random wals - advanced methods 1 of 11 Course: M362K Intro to Stochastic Processes Term: Fall 2014 Instructor: Gordan Zitovic Lecture 6 Random wals - advanced methods STOPPING TIMES Our last
More informationWe denote the space of distributions on Ω by D ( Ω) 2.
Sep. 1 0, 008 Distributions Distributions are generalized functions. Some familiarity with the theory of distributions helps understanding of various function spaces which play important roles in the study
More informationFurther Mathematical Methods (Linear Algebra) 2002
Further Mathematical Methods (Linear Algebra) Solutions For Problem Sheet 9 In this problem sheet, we derived a new result about orthogonal projections and used them to find least squares approximations
More informationFROM LOCAL TO GLOBAL. In this lecture, we discuss Cayley s theorem on flecnodes and ruled surfaces.
FROM LOCAL TO GLOBAL In this lecture, we discuss Cayley s theorem on flecnodes and ruled surfaces. Theorem 0.1. If P is a polynomial in C[z 1, z 2, z 3 ], and if FP vanishes on Z(P), then Z(P) is ruled.
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 informationCalculus of Variation An Introduction To Isoperimetric Problems
Calculus of Variation An Introduction To Isoperimetric Problems Kevin Wang The University of Sydney SSP Working Seminars, MATH2916 May 4, 2013 Contents I Lagrange Multipliers 2 1 Single Constraint Lagrange
More informationWe are now going to go back to the concept of sequences, and look at some properties of sequences in R
4 Lecture 4 4. Real Sequences We are now going to go back to the concept of sequences, and look at some properties of sequences in R Definition 3 A real sequence is increasing if + for all, and strictly
More information6.842 Randomness and Computation March 3, Lecture 8
6.84 Randomness and Computation March 3, 04 Lecture 8 Lecturer: Ronitt Rubinfeld Scribe: Daniel Grier Useful Linear Algebra Let v = (v, v,..., v n ) be a non-zero n-dimensional row vector and P an n n
More informationON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM
ON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM ALEXANDER KUPERS Abstract. These are notes on space-filling curves, looking at a few examples and proving the Hahn-Mazurkiewicz theorem. This theorem
More informationx + 1/2 ; 0 x 1/2 f(x) = 2 2x ; 1/2 < x 1
Lecture 3: Invariant Measures Finding the attracting set of a dynamical system tells us asymptotically what parts of the phase space are visited, but that is not the only thing of interest about the long-time
More informationFactoring. there exists some 1 i < j l such that x i x j (mod p). (1) p gcd(x i x j, n).
18.310 lecture notes April 22, 2015 Factoring Lecturer: Michel Goemans We ve seen that it s possible to efficiently check whether an integer n is prime or not. What about factoring a number? If this could
More information3.2 Constructible Numbers
102 CHAPTER 3. SYMMETRIES 3.2 Constructible Numbers Armed with a straightedge, a compass and two points 0 and 1 marked on an otherwise blank number-plane, the game is to see which complex numbers you can
More informationSlope Fields: Graphing Solutions Without the Solutions
8 Slope Fields: Graphing Solutions Without the Solutions Up to now, our efforts have been directed mainly towards finding formulas or equations describing solutions to given differential equations. Then,
More informationREGULARITY FOR INFINITY HARMONIC FUNCTIONS IN TWO DIMENSIONS
C,α REGULARITY FOR INFINITY HARMONIC FUNCTIONS IN TWO DIMENSIONS LAWRENCE C. EVANS AND OVIDIU SAVIN Abstract. We propose a new method for showing C,α regularity for solutions of the infinity Laplacian
More informationUpper Bounds to Error Probability with Feedback
Upper Bounds to Error robability with Feedbac Barış Naiboğlu Lizhong Zheng Research Laboratory of Electronics at MIT Cambridge, MA, 0239 Email: {naib, lizhong }@mit.edu Abstract A new technique is proposed
More information2.4 The Extreme Value Theorem and Some of its Consequences
2.4 The Extreme Value Theorem and Some of its Consequences The Extreme Value Theorem deals with the question of when we can be sure that for a given function f, (1) the values f (x) don t get too big or
More informationAP Calculus AB Summer Assignment
AP Calculus AB Summer Assignment Name: When you come back to school, you will be epected to have attempted every problem. These skills are all different tools that you will pull out of your toolbo this
More informationLecture 4: Graph Limits and Graphons
Lecture 4: Graph Limits and Graphons 36-781, Fall 2016 3 November 2016 Abstract Contents 1 Reprise: Convergence of Dense Graph Sequences 1 2 Calculating Homomorphism Densities 3 3 Graphons 4 4 The Cut
More informationTaylor Series and Asymptotic Expansions
Taylor Series and Asymptotic Epansions The importance of power series as a convenient representation, as an approimation tool, as a tool for solving differential equations and so on, is pretty obvious.
More informationLecture Notes for LG s Diff. Analysis
Lecture Notes for LG s Diff. Analysis trans. Paul Gallagher Feb. 18, 2015 1 Schauder Estimate Recall the following proposition: Proposition 1.1 (Baby Schauder). If 0 < λ [a ij ] C α B, Lu = 0, then a ij
More informationRoberto s Notes on Infinite Series Chapter 1: Sequences and series Section 4. Telescoping series. Clear as mud!
Roberto s Notes on Infinite Series Chapter : Sequences and series Section Telescoping series What you need to now already: The definition and basic properties of series. How to decompose a rational expression
More informationB ɛ (P ) B. n N } R. Q P
8. Limits Definition 8.1. Let P R n be a point. The open ball of radius ɛ > 0 about P is the set B ɛ (P ) = { Q R n P Q < ɛ }. The closed ball of radius ɛ > 0 about P is the set { Q R n P Q ɛ }. Definition
More informationLogic I - Session 10 Thursday, October 15,
Logic I - Session 10 Thursday, October 15, 2009 1 Plan Re: course feedback Review of course structure Recap of truth-functional completeness? Soundness of SD Thursday, October 15, 2009 2 The course structure
More informationComplex Numbers. April 10, 2015
Complex Numbers April 10, 2015 In preparation for the topic of systems of differential equations, we need to first discuss a particularly unusual topic in mathematics: complex numbers. The starting point
More information1 Fourier Integrals of finite measures.
18.103 Fall 2013 1 Fourier Integrals of finite measures. Denote the space of finite, positive, measures on by M + () = {µ : µ is a positive measure on ; µ() < } Proposition 1 For µ M + (), we define the
More informationWeek 1 Lecture: Concepts of Quantum Field Theory (QFT)
Wee 1 Lecture: Concepts of Quantum Field Theory QFT Andrew Forrester April 4, 008 Relative Wave-Functional Probabilities This Wee s Questions What are the eact solutions for the Klein-Gordon field? What
More informationUnit 5 Solving Quadratic Equations
SM Name: Period: Unit 5 Solving Quadratic Equations 5.1 Solving Quadratic Equations by Factoring Quadratic Equation: Any equation that can be written in the form a b c + + = 0, where a 0. Zero Product
More informationA.1 Introduction & Rant
Scott Hughes 1 March 004 A.1 Introduction & Rant Massachusetts Institute of Technology Department of Physics 8.0 Spring 004 Supplementary notes: Complex numbers Complex numbers are numbers that consist
More informationATTRACTORS FOR SEMILINEAR PARABOLIC PROBLEMS WITH DIRICHLET BOUNDARY CONDITIONS IN VARYING DOMAINS. Emerson A. M. de Abreu Alexandre N.
ATTRACTORS FOR SEMILINEAR PARABOLIC PROBLEMS WITH DIRICHLET BOUNDARY CONDITIONS IN VARYING DOMAINS Emerson A. M. de Abreu Alexandre N. Carvalho Abstract Under fairly general conditions one can prove that
More informationREAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE
REAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE CHRISTOPHER HEIL 1.4.1 Introduction We will expand on Section 1.4 of Folland s text, which covers abstract outer measures also called exterior measures).
More informationPage 1. These are all fairly simple functions in that wherever the variable appears it is by itself. What about functions like the following, ( ) ( )
Chain Rule Page We ve taken a lot of derivatives over the course of the last few sections. However, if you look back they have all been functions similar to the following kinds of functions. 0 w ( ( tan
More informationMidterm Exam, Thursday, October 27
MATH 18.152 - MIDTERM EXAM 18.152 Introduction to PDEs, Fall 2011 Professor: Jared Speck Midterm Exam, Thursday, October 27 Answer questions I - V below. Each question is worth 20 points, for a total of
More informationMaterial covered: Class numbers of quadratic fields, Valuations, Completions of fields.
ALGEBRAIC NUMBER THEORY LECTURE 6 NOTES Material covered: Class numbers of quadratic fields, Valuations, Completions of fields. 1. Ideal class groups of quadratic fields These are the ideal class groups
More informationIntermediate Algebra. Gregg Waterman Oregon Institute of Technology
Intermediate Algebra Gregg Waterman Oregon Institute of Technology c August 2013 Gregg Waterman This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License.
More information