DOCSLIB.ORG

Ordinary Differential Equation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Ordinary Differential Equation Ordinary Differential Equations ISC-5315 { 1 Ordinary differential equation 1 References • Sachin Shanbag, lecture notes (see class website) • Wikipedia (see class website) 2 Basics Explicit differential equation (1) dy y0 = = F [t] (Quadrature) (1) dt Explicit differential equation (2) y0 = F (y; t) (2) Implicit differential equation F [y; y0; t) = 0 (We will not look these) (3) 3 Higher order ODEs can be reduced to a system of first order ODEs, for example y00(t) + y(t) = 0 (4) with initial conditions y(0) = 0; y0(0) set z = y0, then we can express as a system of two ODEs z0(t) + y(t) = 0 (5) y0(t) − z(t) = 0 with initial conditions z(0) = 0; y(0). In general an n-order ODE can be reduced to a system of n 1-order ODEs. 4 Systems of equations 0 0 1 0 1 0 1 y1 a11 a12 ::: a1m y1 0 By C Ba21 a12 ::: a1mC By2C B 2C = B C B C (6) @:::A @ ::: ::: ::: ::: A @:::A 0 yn an1 an2 ::: anm yn y0 = Ay (7) y(0) = y0 (8) 1 Peter Beerli; March 31, 2011 Ordinary Differential Equations ISC-5315 { 2 5 Boundary value problems (We will not look at boundary value problems, only at initial value problems in ACS 1) Boundary value problems (BVP) y00(t) + y(t) = 0 with y(0) = 0 y(π=2) = 2 (9) Initial value problem (IVP) y00(t) + y(t) = 0 with y(0) = 0 y0(0) = 0 (10) Typically only scalar equations are used 6 Uniqueness Multiple solutions to some ODEs exist, for example y0(t) = py(t) with y(0) = 0 Solution 1: y(t) = 0 (11) Solution 2: t2 y(t) = (12) 4 7 Existence Solutions may not exist for all values of t y0(t) = [y(t)]2 with y(0) = Solution: 1 1 y(t) = exists only for t 6= (13) −1 − t 8 Lipschitz continuity In mathematical analysis, Lipschitz continuity, named after Rudolf Lipschitz, is a strong form of uniform continuity for functions. Intuitively, a Lipschitz continuous function is limited in how fast it can change: For every pair of points on the graph of this function, their secant line-segment's slope has absolute-value no greater than a definite real number; this constant, which is the same for all the secants, is called the function's \Lipschitz constant" (or \modulus of uniform continuity"). 2 Peter Beerli; March 31, 2011 Ordinary Differential Equations ISC-5315 { 3 A function n+1 n f(x; t): R ! R (14) is Lipschitz continuous if, for all (y1; t) and (y2; t), there exists an L, such that jf(y ; t) − f(y ; t)j 2 1 ≤ L: (15) jy2 − y1j Figure 1: For a Lips- If f(y; t) can be differentiated with respect to y, then chitz continuous function, there is a double cone @f(y; t) L = max (16) (shown in white) whose D @y vertex can be translated along the graph, so that Examples the graph always remains entirely outside the cone. f(y; t) = y2; y 2 [−3; 7] ) L = 14 (17) p f(y; t) = y2 + 5; y 2 R ) L = 1 (18) Small L implies a slowly varying function of y. 8.1 Indicator of uniqueness and existence It informs us about uniqueness and existence. A theorem without proof: If f(y; t) is Lipschitz continuous, then the initial value 0 y (t) = f(y; t) y(0) = y0 (19) has a unique differentiable solution on [a; b] for each y0, which depends continuously on y0 jy(t) − y^(t)j ≤ eLtjy(0) − y^(0)j: (20) Bounded perturbation of the ODE, such as 0 y (t) = f(t; y^ + r(t; y^)y ^(0) =y ^0 (21) with r(t; y^) ≤ kMk (22) then M jy(t) − y^(t)j ≤ eLtjy(0) − y^(0)j + (eLt − 1) (23) L Example: Recall that we had multiple solutions for the ODE y0(t) = py(t) y(0) = 0: (24) the function is discontinuous near zero @f(t; y) 1 = (25) @y 2py(t) Therefore the function is not Lipschitz continuous. 3 Peter Beerli; March 31, 2011 Ordinary Differential Equations ISC-5315 { 4 8.2 Lipschitz continuity examples 8.2.1 Continuous functions that are Lipschitz continuous: p The function f(x) = x2 +5 defined for all real numbers is Lipschitz continuous with the Lipschitz constant K = 1, because it is everywhere differentiable and the absolute value of the derivative is bounded above by 1. Likewise, the sine function is Lipschitz continuous because its derivative, the cosine function, is bounded above by 1 in absolute value. The function f(x) = jxj defined on the reals is Lipschitz continuous with the Lipschitz constant equal to 1, by the reverse triangle inequality. This is an example of a Lipschitz continuous function that is not differentiable. More generally, a norm on a vector space is Lipschitz continuous with respect to the associated metric, with the Lipschitz constant equal to 1. 8.2.2 Continuous functions that are not (globally) Lipschitz continuous: The function f(x) = x2 with domain all real numbers is not Lipschitz continuous. This function becomes arbitrarily steep as x approaches 1. It is however locally Lipschitz continuous. p The function f(x) = x defined on [0; 1] is not Lipschitz continuous. This function becomes infinitely steep as x approaches 0 since its derivative becomes infinite. 8.2.3 Differentiable functions that are not (globally) Lipschitz continuous. The function f(x) = x3=2 sin (1=x) with x 6= 0 and f(0) = 0, restricted on [0; 1], gives an example of a function that is differentiable on a compact set while not locally Lipschitz because its derivative function is not bounded. See also the first property below. 9 Numerical solutions of ODEs Consider an explicit scalar ODE 0 y (t) = f(y; t) y(0) = y0: (26) We can discretize the t domain ft0; t1; :::; tk; :::; tng. We compute approximate numerical solutions at the gridpoints tk yk = y(tk) ∼ Yk = Y (tk): (27) where Yk are the exact solutions evaluated at grid points. We explore simple methods based on Taylor series and Euler methods. 9.1 Taylor series 0 Given y (t) = f(y; t) with initial values y(t0) = y0 we can consider a Taylor series expansion of y around t0 (t − t )2 y(t) = y + (t − t )y0(t ) + 0 y00(t ) + ::: (28) 0 0 0 2! 0 4 Peter Beerli; March 31, 2011 Ordinary Differential Equations ISC-5315 { 5 recall that df @f @f @y y00(t) = = + (chain rule) (29) dt @t @y @t @f @f y00(t) = + f (30) @t @y A general expression for order-n method h2 hn y(t ) = y(t ) + hy0(t ) + y00(t ) + ::: + y(n)(t ) (31) i i−1 i−1 2! i−1 n! i−1 the error is O(hn+1) hn+1 = jY − y j = y(n+1)(ξ) withξ 2 [t ; t ] (32) G i i (n + 1)! i−1 i Example: y(t) = t − y y(0) = 1; (33) differentiate y0 repeatedly y0(t) = t − y y0(0) = −1 y00(t) = 1 − y0 y00(0) = 2 y(3)(t) = −y00 y(3)(0) = −2 y(4)(t) = −y(3) y(4)(0) = 2 4th order Taylor series solution t2 t4 y(t) = 1 − t + (2) + fract33!(−2) + (2) (34) 2! 4! t3 t4 = 1 − t + t2 − + (35) 3 12 Exact solution Y (t) = t + 2e−t − 1 (36) A comparison of the exact solution with the approximate Taylor series solution is shown in figure 2. In summary we can attest that the Taylor approximation delivers great results for small h values. The differentiation of f(t; y) can be laborious; it is problem specific and need to be repeated for dif- ferent f(t; y), can be automated. The error analysis of the Taylor approximation is straightforward and one can get an upper bound of the error. In practice only low order Taylor series formulae are used (Runge-Kutta formulae take their inspiration from higher order Taylor series). 5 Peter Beerli; March 31, 2011 Ordinary Differential Equations ISC-5315 { 6 1.00 0.95 0.90 0.85 0.80 0.75 0.70 0.0 0.2 0.4 0.6 0.8 1.0 Figure 2: The blue curve represent the exact formula (36) and the red dashed curve reflects the Taylor approximation (35). 9.2 Euler method 9.2.1 Forward Euler method 0 Given y (t) = f(y; t) with initial values y(t0) = y0 we can discretize the first derivative with time step h = tn − tn−1 (37) as y − y y0 = n n−1 = f(t ; y ) = f (38) h n−1 n−1 n−1 and then use a time marching algorithm yn = yn−1 + fn−1 (39) (40) Example: Say, we have f(t; y) = −2t3 + 12t2 − 20t + 8:5; y(0) = 1 (41) Using Mathematica we can construct the following function for the Euler method: euler[y0_,h_]:=Module[ {yy={},ii={},i=0}, AppendTo[yy,y0]; While[i<4, AppendTo[yy,yy[[-1]]+h (8.5-20 i+12 i^2-2 i^3)]; AppendTo[ii,i]; i+= h 6 Peter Beerli; March 31, 2011 Ordinary Differential Equations ISC-5315 { 7 ]; AppendTo[ii,i]; Transpose[{ii,yy}] ] and with different intervals sizes we get different accuracies. Figure 3 shows results for an h = 0:01 and h = 0:1 in comparison with the exact solution. 5 4 3 2 1 2 3 4 Figure 3: The blue curve represent the exact formula and the blue dashed curve reflects the Euler approxi- mation with h = 0:01, and green with h = 0:1 We see that the accuracy of the Euler approximation is quite good with small intervals but stinks with large intervals, looking at the algorithm, we that it is equivalent to Riemann's sum (quadra- ture).
Load more

Recommended publications
  • Lipschitz Continuity of Convex Functions
    Lipschitz Continuity of Convex Functions Bao Tran Nguyen∗ Pham Duy Khanh† November 13, 2019 Abstract We provide some necessary and sufficient conditions for a proper lower semi- continuous convex function, defined on a real Banach space, to be locally or globally Lipschitz continuous. Our criteria rely on the existence of a bounded selection of the subdifferential mapping and the intersections of the subdifferential mapping and the normal cone operator to the domain of the given function. Moreover, we also point out that the Lipschitz continuity of the given function on an open and bounded (not necessarily convex) set can be characterized via the existence of a bounded selection of the subdifferential mapping on the boundary of the given set and as a consequence it is equivalent to the local Lipschitz continuity at every point on the boundary of that set. Our results are applied to extend a Lipschitz and convex function to the whole space and to study the Lipschitz continuity of its Moreau envelope functions. Keywords Convex function, Lipschitz continuity, Calmness, Subdifferential, Normal cone, Moreau envelope function. Mathematics Subject Classification (2010) 26A16, 46N10, 52A41 1 Introduction arXiv:1911.04886v1 [math.FA] 12 Nov 2019 Lipschitz continuous and convex functions play a significant role in convex and nonsmooth analysis. It is well-known that if the domain of a proper lower semicontinuous convex function defined on a real Banach space has a nonempty interior then the function is continuous over the interior of its domain [3, Proposition 2.111] and as a consequence, it is subdifferentiable (its subdifferential is a nonempty set) and locally Lipschitz continuous at every point in the interior of its domain [3, Proposition 2.107].
    [Show full text]
  • The Beginnings 2 2. the Topology of Metric Spaces 5 3. Sequences and Completeness 9 4
    MATH 3963 NONLINEAR ODES WITH APPLICATIONS R MARANGELL Contents 1. Metric Spaces - The Beginnings 2 2. The Topology of Metric Spaces 5 3. Sequences and Completeness 9 4. The Contraction Mapping Theorem 13 5. Lipschitz Continuity 19 6. Existence and Uniqueness of Solutions to ODEs 21 7. Dependence on Initial Conditions and Parameters 26 8. Maximal Intervals of Existence 29 Date: September 6, 2017. 1 R Marangell Part II - Existence and Uniqueness of ODES 1. Metric Spaces - The Beginnings So.... I am from California, and so I fly through L.A. a lot on my way to my parents house. How far is that from Sydney? Well... Google tells me it's 12000 km (give or take), and in fact this agrees with my airline - they very nicely give me 12000 km on my frequent flyer points. But.... well.... are they really 12000 km apart? What if I drilled a hole through the surface of the Earth? Using a little trigonometry, and the fact that the radius of the earth is R = 6371 km, we have that the distance `as the mole digs' so-to-speak from Sydney to Los Angeles CA is given by (see Figure 1): 12000 x = 2R sin ≈ 10303 km (give or take) 2R Figure 1. A schematic of the earth showing an `equatorial' (or great) circle from Sydney to L.A. So I have two different answers, to the same question, and both are correct. Indeed, Sydney is both 12000 km and around 10303 km away from L.A. What's going on here is pretty obvious, but we're going to make it precise.
    [Show full text]
  • Convergence Rates for Deterministic and Stochastic Subgradient
    Convergence Rates for Deterministic and Stochastic Subgradient Methods Without Lipschitz Continuity Benjamin Grimmer∗ Abstract We extend the classic convergence rate theory for subgradient methods to apply to non-Lipschitz functions. For the deterministic projected subgradient method, we present a global O(1/√T ) convergence rate for any convex function which is locally Lipschitz around its minimizers. This approach is based on Shor’s classic subgradient analysis and implies generalizations of the standard convergence rates for gradient descent on functions with Lipschitz or H¨older continuous gradients. Further, we show a O(1/√T ) convergence rate for the stochastic projected subgradient method on convex functions with at most quadratic growth, which improves to O(1/T ) under either strong convexity or a weaker quadratic lower bound condition. 1 Introduction We consider the nonsmooth, convex optimization problem given by min f(x) x∈Q for some lower semicontinuous convex function f : Rd R and closed convex feasible → ∪{∞} region Q. We assume Q lies in the domain of f and that this problem has a nonempty set of minimizers X∗ (with minimum value denoted by f ∗). Further, we assume orthogonal projection onto Q is computationally tractable (which we denote by PQ( )). arXiv:1712.04104v3 [math.OC] 26 Feb 2018 Since f may be nondifferentiable, we weaken the notion of gradients to· subgradients. The set of all subgradients at some x Q (referred to as the subdifferential) is denoted by ∈ ∂f(x)= g Rd y Rd f(y) f(x)+ gT (y x) . { ∈ | ∀ ∈ ≥ − } We consider solving this problem via a (potentially stochastic) projected subgradient method.
    [Show full text]
  • The Lipschitz Constant of Self-Attention
    The Lipschitz Constant of Self-Attention Hyunjik Kim 1 George Papamakarios 1 Andriy Mnih 1 Abstract constraint for neural networks, to control how much a net- Lipschitz constants of neural networks have been work’s output can change relative to its input. Such Lips- explored in various contexts in deep learning, chitz constraints are useful in several contexts. For example, such as provable adversarial robustness, estimat- Lipschitz constraints can endow models with provable ro- ing Wasserstein distance, stabilising training of bustness against adversarial pertubations (Cisse et al., 2017; GANs, and formulating invertible neural net- Tsuzuku et al., 2018; Anil et al., 2019), and guaranteed gen- works. Such works have focused on bounding eralisation bounds (Sokolic´ et al., 2017). Moreover, the dual the Lipschitz constant of fully connected or con- form of the Wasserstein distance is defined as a supremum volutional networks, composed of linear maps over Lipschitz functions with a given Lipschitz constant, and pointwise non-linearities. In this paper, we hence Lipschitz-constrained networks are used for estimat- investigate the Lipschitz constant of self-attention, ing Wasserstein distances (Peyré & Cuturi, 2019). Further, a non-linear neural network module widely used Lipschitz-constrained networks can stabilise training for in sequence modelling. We prove that the stan- GANs, an example being spectral normalisation (Miyato dard dot-product self-attention is not Lipschitz et al., 2018). Finally, Lipschitz-constrained networks are for unbounded input domain, and propose an al- also used to construct invertible models and normalising ternative L2 self-attention that is Lipschitz. We flows. For example, Lipschitz-constrained networks can be derive an upper bound on the Lipschitz constant of used as a building block for invertible residual networks and L2 self-attention and provide empirical evidence hence flow-based generative models (Behrmann et al., 2019; for its asymptotic tightness.
    [Show full text]
  • Hölder-Continuity for the Nonlinear Stochastic Heat Equation with Rough Initial Conditions
    Stoch PDE: Anal Comp (2014) 2:316–352 DOI 10.1007/s40072-014-0034-6 Hölder-continuity for the nonlinear stochastic heat equation with rough initial conditions Le Chen · Robert C. Dalang Received: 22 October 2013 / Published online: 14 August 2014 © Springer Science+Business Media New York 2014 Abstract We study space-time regularity of the solution of the nonlinear stochastic heat equation in one spatial dimension driven by space-time white noise, with a rough initial condition. This initial condition is a locally finite measure μ with, possibly, exponentially growing tails. We show how this regularity depends, in a neighborhood of t = 0, on the regularity of the initial condition. On compact sets in which t > 0, 1 − 1 − the classical Hölder-continuity exponents 4 in time and 2 in space remain valid. However, on compact sets that include t = 0, the Hölder continuity of the solution is α ∧ 1 − α ∧ 1 − μ 2 4 in time and 2 in space, provided is absolutely continuous with an α-Hölder continuous density. Keywords Nonlinear stochastic heat equation · Rough initial data · Sample path Hölder continuity · Moments of increments Mathematics Subject Classification Primary 60H15 · Secondary 60G60 · 35R60 L. Chen and R. C. Dalang were supported in part by the Swiss National Foundation for Scientific Research. L. Chen (B) · R. C. Dalang Institut de mathématiques, École Polytechnique Fédérale de Lausanne, Station 8, CH-1015 Lausanne, Switzerland e-mail: [email protected] R. C. Dalang e-mail: robert.dalang@epfl.ch Present Address: L. Chen Department of Mathematics, University of Utah, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA 123 Stoch PDE: Anal Comp (2014) 2:316–352 317 1 Introduction Over the last few years, there has been considerable interest in the stochastic heat equation with non-smooth initial data: ∂ ν ∂2 ˙ ∗ − u(t, x) = ρ(u(t, x)) W(t, x), x ∈ R, t ∈ R+, ∂t 2 ∂x2 (1.1) u(0, ·) = μ(·).
    [Show full text]
  • 1. the Rademacher Theorem
    GEOMETRIC ANALYSIS PIOTR HAJLASZ 1. The Rademacher theorem 1.1. The Rademacher theorem. Lipschitz functions defined on one dimensional inter- vals are differentiable a.e. This is a classical result that is covered in most of courses in mea- sure theory. However, Rademacher proved a much deeper result that Lipschitz functions defined on open sets in Rn are also differentiable a.e. Let us first discuss differentiability of Lipschitz functions defined on one dimensional intervals. This result is a special case of differentiability of absolutely continuous functions. Definition 1.1. We say that a function f :[a; b] ! R is absolutely continuous if for very " > 0 there is δ > 0 such that if (x1; x1 +h1);:::; (xk; xk +hk) are pairwise disjoint intervals Pk in [a; b] of total length less than δ, i=1 hi < δ, then k X jf(xi + hi) − f(xi)j < ": i=1 The definition of an absolutely continuous function reminds the definition of a uniformly continuous function. Indeed, we would obtain the definition of a uniformly continuous function if we would restrict just to a single interval (x; x+h), i.e. if we would assume that k = 1. Despite similarity, the class of absolutely continuous function is much smaller than the class of uniformly continuous function. For example Lipschitz function f :[a; b] ! R are absolutely continuous, but in general H¨oldercontinuous functions are uniformly continuous, but not absolutely continuous. Proposition 1.2. If f; g :[a; b] ! R are absolutely continuous, then also the functions f ± g and fg are absolutely continuous.
    [Show full text]
  • On Lipschitz Continuity of Projections 2
    ON LIPSCHITZ CONTINUITY OF PROJECTIONS ONTO POLYHEDRAL MOVING SETS EWA M. BEDNARCZUK1 AND KRZYSZTOF E. RUTKOWSKI2 Abstract. In Hilbert space setting we prove local lipchitzness of projections onto parametric polyhedral sets represented as solutions to systems of inequalities and equations with parameters appearing both in left-hand-sides and right-hand-sides of the constraints. In deriving main results we assume that data are locally Lips- chitz functions of parameter and the relaxed constant rank constraint qualification condition is satisfied. 1. Introduction Continuity of metric projections of a given v¯ onto moving subsets have already been investigated in a number of instances. In the framework of Hilbert spaces, the projection ′ PC (¯v) of v¯ onto closed convex sets C, C , i.e., solutions to optimization problems minimize kz − v¯k subject to z ∈ C, (Proj) are unique and Hölder continuous with the exponent 1/2 in the sense that there exists a constant ℓH > 0 with ′ 1/2 kPC (¯v) − PC′ (¯v)k≤ ℓH [dρ(C, C )] , where dρ(·, ·) denotes the bounded Hausdorff distance (see [2] and also [7, Example 1.2]). In the case where the sets, on which we project a given v¯, are solution sets to systems of equations and inequalities, the problem P roj is a special case of a general parametric problem minimize ϕ0(p, x) subject to (Par) ϕi(p, x)=0 i ∈ I1, ϕi(p, x) ≤ 0 i ∈ I2, where x ∈ H, p ∈D⊂G, H - Hilbert space, G - metric space, ϕi : D×H→ R, arXiv:1909.13715v2 [math.OC] 6 Oct 2019 i ∈ {0} ∪ I1 ∪ I2.
    [Show full text]
  • Stability and Convergence of Stochastic Gradient Clipping: Beyond Lipschitz Continuity and Smoothness
    Stability and Convergence of Stochastic Gradient Clipping: Beyond Lipschitz Continuity and Smoothness Vien V. Mai 1 Mikael Johansson 1 Abstract problems are at the core of many machine-learning appli- cations, and are often solved using stochastic (sub)gradient Stochastic gradient algorithms are often unsta- methods. In spite of their successes, stochastic gradient ble when applied to functions that do not have methods can be sensitive to their parameters (Nemirovski Lipschitz-continuous and/or bounded gradients. et al., 2009; Asi & Duchi, 2019a) and have severe instabil- Gradient clipping is a simple and effective tech- ity (unboundedness) problems when applied to functions nique to stabilize the training process for prob- that grow faster than quadratically in the decision vector x lems that are prone to the exploding gradient (Andradottir¨ , 1996; Asi & Duchi, 2019a). Consequently, a problem. Despite its widespread popularity, the careful (and sometimes time-consuming) parameter tuning convergence properties of the gradient clipping is often required for these methods to perform well in prac- heuristic are poorly understood, especially for tice. Even so, a good parameter selection is not sufficient to stochastic problems. This paper establishes both circumvent the instability issue on steep functions. qualitative and quantitative convergence results of the clipped stochastic (sub)gradient method Gradient clipping and the closely related gradient normal- (SGD) for non-smooth convex functions with ization technique are simple modifications to the underlying rapidly growing subgradients. Our analyses show algorithm to control the step length that an update can make that clipping enhances the stability of SGD and relative to the current iterate. These techniques enhance that the clipped SGD algorithm enjoys finite con- the stability of the optimization process, while adding es- vergence rates in many cases.
    [Show full text]
  • Arxiv:1706.10175V1 [Math.CV] 30 Jun 2017 Uscnomlslto Fteieult 11 Ihrsett H D the to Respect with (1.1) Inequality the Metric
    LIPSCHITZ CONTINUITY OF QUASICONFORMAL MAPPINGS AND OF THE SOLUTIONS TO SECOND ORDER ELLIPTIC PDE WITH RESPECT TO THE DISTANCE RATIO METRIC PEIJIN LI AND SAMINATHAN PONNUSAMY Abstract. The main aim of this paper is to study the Lipschitz continuity of certain (K,K′)-quasiconformal mappings with respect to the distance ratio metric, and the Lipschitz continuity of the solution of a quasilinear differential equation with respect to the distance ratio metric. 1. Introduction and main results Martio [22] was the first who considered the study on harmonic quasiconformal mappings in C. In the recent years the articles [8, 14, 16, 17, 18, 26] brought much light on this topic. In [6, 21], the Lipschitz characteristic of (K,K′)-quasiconformal mappings has been discussed. In [20], the authors proved that a K-quasiconformal harmonic mapping from the unit disk D onto itself is bi-Lipschitz with respect to hyperbolic metric, and also proved that a K-quasiconformal harmonic mapping from the upper half-plane H onto itself is bi-Lipschitz with respect to hyperbolic metric. In [23], the authors proved that a K-quasiconformal harmonic mapping from D to D′ is bi-Lipschitz with respect to quasihyperbolic metrics on D and D′, where D and D′ are proper domains in C. Important definitions will be included later in this section. In [15], Kalaj considered the bi-Lipschitz continuity of K-quasiconformal solution of the inequality (1.1) ∆f B Df 2. | | ≤ | | Here ∆f represents the two-dimensional Laplacian of f defined by ∆f = fxx +fyy = 4fzz and the mapping f satisfying the Laplace equation ∆f = 0 is called harmonic.
    [Show full text]
  • Metric Spaces
    Chapter 1. Metric Spaces Definitions. A metric on a set M is a function d : M M R × → such that for all x, y, z M, Metric Spaces ∈ d(x, y) 0; and d(x, y)=0 if and only if x = y (d is positive) MA222 • ≥ d(x, y)=d(y, x) (d is symmetric) • d(x, z) d(x, y)+d(y, z) (d satisfies the triangle inequality) • ≤ David Preiss The pair (M, d) is called a metric space. [email protected] If there is no danger of confusion we speak about the metric space M and, if necessary, denote the distance by, for example, dM . The open ball centred at a M with radius r is the set Warwick University, Spring 2008/2009 ∈ B(a, r)= x M : d(x, a) < r { ∈ } the closed ball centred at a M with radius r is ∈ x M : d(x, a) r . { ∈ ≤ } A subset S of a metric space M is bounded if there are a M and ∈ r (0, ) so that S B(a, r). ∈ ∞ ⊂ MA222 – 2008/2009 – page 1.1 Normed linear spaces Examples Definition. A norm on a linear (vector) space V (over real or Example (Euclidean n spaces). Rn (or Cn) with the norm complex numbers) is a function : V R such that for all · → n n , x y V , x = x 2 so with metric d(x, y)= x y 2 ∈ | i | | i − i | x 0; and x = 0 if and only if x = 0(positive) i=1 i=1 • ≥ cx = c x for every c R (or c C)(homogeneous) • | | ∈ ∈ n n x + y x + y (satisfies the triangle inequality) Example (n spaces with p norm, p 1).
    [Show full text]
  • Functions of One Variable
    viii 3.A. FUNCTIONS 77 Appendix In this appendix, we describe without proof some results from real analysis which help to understand weak and distributional derivatives in the simplest context of functions of a single variable. Proofs are given in [11] or [15], for example. These results are, in fact, easier to understand from the perspective of weak and distributional derivatives of functions, rather than pointwise derivatives. 3.A. Functions For definiteness, we consider functions f :[a,b] → R defined on a compact interval [a,b]. When we say that a property holds almost everywhere (a.e.), we mean a.e. with respect to Lebesgue measure unless we specify otherwise. 3.A.1. Lipschitz functions. Lipschitz continuity is a weaker condition than continuous differentiability. A Lipschitz continuous function is pointwise differ- entiable almost everwhere and weakly differentiable. The derivative is essentially bounded, but not necessarily continuous. Definition 3.51. A function f :[a,b] → R is uniformly Lipschitz continuous on [a,b] (or Lipschitz, for short) if there is a constant C such that |f(x) − f(y)|≤ C |x − y| for all x, y ∈ [a,b]. The Lipschitz constant of f is the infimum of constants C with this property. We denote the space of Lipschitz functions on [a,b] by Lip[a,b]. We also define the space of locally Lipschitz functions on R by R R R Liploc( )= {f : → : f ∈ Lip[a,b] for all a<b} . By the mean-value theorem, any function that is continuous on [a,b] and point- wise differentiable in (a,b) with bounded derivative is Lipschitz.
    [Show full text]
  • Fat Homeomorphisms and Unbounded Derivate Containers
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 81, 545-560 (1981) Fat Homeomorphisms and Unbounded Derivate Containers J. WARGA* Department of Mathematics, Northeastern University, Boston, Massachusetts 021 I5 Submitted by Harold Kushner We generalize local and global inverse function theorems to continuous transfor- mations in I?“, replacing nonexistent derivatives by set-valued “unbounded derivate containers.” We also construct and study unbounded and ordinary derivate containers, including extensions of generalized Jacobians. 1. INTRODUCTION Let B(x, a) [B(x, a)] denote the open [closed] ball of center x and radius a. The classical inverse function theorem implies that a C’ function f in a Banach space whose derivativef’(2) has a continuous inverse is fat at X, i.e., there exists c > 0 such that f(&, a)) 2 @f(f), ca) for sufficiently small positive a. A global version of the inverse function theorem [ 7, Lemma 1, p. 661 asserts that if f is C’ in some neighborhood X of B(.F, a) and If’(x)-‘1 </3 (X E X) then .fXB(% a>>= B(.fT% a/P) P<a,<a) and a restriction off has a C’ inverse U: g(j-(f), a/j?) + @, a). If f is a Lipschitzian mapping in R” then a known result concerning functions defined on convex sets [5, Lemma 3.3, p. 5541 yields, as special cases, fat mapping and local and global homeomorphism theorems formulated in terms of derivate containers /if(x). The latter play the role of set-valued derivatives and are, crudely speaking, sets of limits of f:(y) as i + 00 and y --) x, where (fi) is any sequence of C’ functions converging uniformly to f.
    [Show full text]