15 Limit sets. Lyapunov functions
|
|
|
- Homer Taylor
- 10 years ago
- Views:
Transcription
1 15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior of the solutions). It does not mean that the transient behavior of the solutions is of no importance, but at this point I would like to concentrate on the case t. From the previous discussion it should be clear that an equilibrium or a limit cycle can be an ultimate outcome of the system s dynamics. Can we have anything else? How to describe the asymptotic behavior in most general terms? In this lecture I will try to answer these and some other questions by studying the limit sets of the flow of (1). I will also introduce the notion of the Lyapunov function, an extremely powerful device to analyze behavior of (1) Limit sets and their properties Recall that x(t; x 0 ) denotes the solution to (1) with the initial condition x 0. Considered as the mapping of U to U parameterized by the time t, it is called the flow of system (1). The corresponding geometric object that we study if the orbit γ(x 0 ). Definition 1. Point x is called an omega limit point of solution x(t; x 0 ) or orbit γ(x 0 ) if there exists a sequence t 1,..., t k,... of the time moments such that t k as k, for which x(t k ; x 0 ) x, k holds. The set of all such points of x(t; x 0 ) is called the ω-limit (or forward) set of x(t; x 0 ) or orbit γ(x 0 ) and denoted ω(x 0 ). Similarly, for t k an alpha limit point and α-limit (or backward) set α(x 0 ) are defined. Example 2. If ˆx is an equilibrium of (1) then ω(ˆx) = α(ˆx) = ˆx. Example 3. An asymptotically stable limit cycle is the ω-limit set for at leat some initial conditions (can you think of a sequence of points such that for any point on the limit cycle there is a convergent sequence x(t; x 0 )?). By the way, using the limit sets it is possible to define the limit cycle as the closed curve, which is a limit set for some initial conditions that do not belong to the curve itself. Example 4. Consider ẋ = x, x R. For the equilibrium ˆx = 0 we have that α(0) = ω(0) = 0. For any other point x R\{0} we obviously have ω(x) = 0, α(x) =. Math 484/684: Mathematical modeling of biological processes by Artem Novozhilov [email protected]. Spring
2 Example 5. Here is a slightly more involved example: ṙ = r(a r), θ = sin 2 θ + (r a) 2. Here we have three equilibria ˆr 0 = 0, (ˆr, ˆθ) = (a, 0), and (ˆr, ˆθ) = (a, π). All three of them are unstable. The analysis of the phase portrait shows that the ω-limit set for most of the initial conditions represent the closed curve composed by two equilibria on the circle, and the heteroclinic trajectories connecting them. Therefore, in the examples we saw that it is possible for the limit set of a planar system to be an equilibrium, a limit cycle, or a closed curve that is composed of equilibria and orbits. Can it be anything else? Limit sets have a lot of nice properties, which I summarize in the following theorem. Theorem 6. Limit sets are closed and invariant. If x(t; x 0 ) is bounded (i.e., x(t; x 0 ) < M for any t for some constant M which may depend on x 0 ), then ω(x 0 ) and α(x 0 ) are non-empty and connected. I will leave the proof of this theorem to the reader. Here are a few remarks. The limit set is closed means that for any convergent sequence x k belonging to, e.g., ω(x 0 ) the limit lim k x k = x is also in ω(x 0 ). The invariance property means that if x ω(x 0 ) then the whole orbit x(t; x) ω(x 0 ). The fact that a bounded orbit has non-empty limit sets follows immediately from the fact that any bounded sequence has a convergent subsequence. It also holds that ω(x 0 ) is empty if and only if x(t; x 0 ). Connectedness of ω(x 0 ) can be proved by contradiction. The celebrated Poincaré Bendixson Theorem classifies the possible limit sets of planar systems. For instance, the following theorem holds Theorem 7 (Poincaré Bendixson). Consider planar system (1), for which the equilibria are isolated. If the positive orbit γ + (x 0 ) (i.e., for t > 0) is bounded then 1. ω(x 0 ) is an equilibrium, or 2. ω(x 0 ) is a closed orbit, or 3. For each x ω(x 0 ), α( x) and ω( x) are equilibria Lyapunov functions and limit sets In the previous subsection I discussed the limit sets. But how actually find them? For this we will need the notion of the Lyapunov function. In particular, the following theorem holds. 2
3 Theorem 8. Consider an autonomous system of ODE ẋ = f(x), x U R d, and let G U. Consider function V C (1) (G, R) and the mapping t V ( x(t; x 0 ) ) along the solution x(t; x 0 ). If the derivative of this mapping V is sign definite ( V 0 or V 0) then ω(x 0 ) G (and α(x 0 ) G) contained in the set {x: V (x) = 0}. Proof. Assume that V 0 (the other case is treated similarly). Let x ω(x 0 ). This means that there is sequence (t k ) k=1 such that x(t k; x 0 ) x. This means, by continuity of V, that V ( x) 0. If V ( x) = 0 then the theorem is proved. Therefore assume that V ( x) > 0. This implies that V ( x(t; x) ) > V ( x). On the other hand, since V is non-decreasing along the trajectories, V ( x(t; x 0 ) ) V ( x). Consider sequence (t+t k ) k=1 for some fixed t. By the properties of the solutions x(t+t k; x 0 ) = x(t; x), which together with the previous yields a contradiction V ( x(t; x) ) V ( x). Therefore, V ( x) = 0. Function V as in the last theorem is called a Lyapunov function (but see the next subsection). The derivative V is often called the derivative of V along the vector field f, or Lie derivative. Example 9. Consider again the predator prey model with intraspecific competition, in dimensionless variables ẋ = x(1 αx + y), ẏ = y( γ βy + x). We know from the previous analysis that for some parameter values (αγ < 1) it is possible to have a nontrivial equilibrium ˆx 2 = (ˆx, ŷ), which corresponds to the mutual species coexistence. We also found that this equilibrium, when present in R 2 + is asymptotically stable. In our analysis we were not able to completely discard the possibility of having a closed curve. This example fills this gap. Consider function, whose form is suggested by the integral of the classical Lotka Volterra predator prey model V (x, y) = ˆx log x x + ŷ log y y and find its derivative along our vector field: V = (ˆx x)(1 αx + y) + (ŷ y)( γ βy + x) = α(ˆx x) 2 + β(ŷ y) 2. For any (x, y) R 2 V + is non-negative and equal to zero only at (ˆx, ŷ). Therefore, this point is the only candidate for ω-limit set, and therefore it is globally asymptotically stable for the system. Sometimes the set of zeros of V is large, and we would like to identify those points which are actually in the limit sets. This can be done with Theorem 10 (LaSalle). Let Ĝ = {x G: V (x) = 0} be the set of zeros of the derivative of a Lyapunov function along given vector field f, and let G be positive invariant. Then the orbits of the vector field tent to the maximal invariant subset of Ĝ. 3
4 15.3 Lyapunov functions and stability of equilibria In the previous subsection a function V was called a Lyapunov function for vector field f in the domain G if it is sign definite in G along the orbits of f. A canonical definition of Lyapunov function is as follows. Definition 11. Let ˆx be an equilibrium of ẋ = f(x), x U R d. A function V C (1) (G, R), where G is a neighborhood of ˆx, is called a Lyapunov function for ˆx in G if: V (ˆx) = 0 and V (x) > 0 for all x G \ {ˆx}. V (x) 0 for all x G. If instead of the second condition, the condition V (x) < 0 for all x G \ {ˆx} holds, then V is called a strict Lyapunov function. Using this definition, it is possible to prove Theorem 12 (Lyapunov). Let ˆx be an equilibrium of ẋ = f(x), x U R d. If there exists a Lyapunov function for ˆx then ˆx is stable, if there exists a strict Lyapunov function for ˆx than ˆx is asymptotically stable. There are no universal methods to construct Lyapunov functions, though. Example 13. Consider first the classical Lotka Volterra model Ṅ = an bp N, P = cp N dp. Recall that we were able to integrate this system, and found that the solutions are the level sets of If one considers a function H(N, P ) = bp + cn a log P d log N. V (N, P ) = H(N, P ) H( ˆN, ˆP ), ˆN = d c, ˆP = a b then it can be checked that V is a Lyapunov function for ( ˆN, ˆP ). Hence the equilibrium, as we already saw, Lyapunov stable. Here, actually, V 0. Consider again the predator prey model with intraspecific competition, in dimensionless variables And let One can check that is a strict Lyapunov function for (ˆx, ŷ). ẋ = x(1 αx + y), ẏ = y( γ βy + x). H(x, y) = ˆx log x x + ŷ log y y. V (x, y) = H(ˆx, ŷ) H(x, y) 4
5 It is important to mention that Lyapunov functions allow to infer global aspects of the behavior of the orbits. For example, the following is true. Consider again the same system ẋ = f(x), x U R d with an asymptotically stable equilibrium ˆx. By definition, the basin of attraction B(ˆx) of ˆx is the set of initial conditions such that x(t; x 0 ) ˆx for t. It can be shown that if V is a strict Lyapunov function for ˆx, then the sets G c = {x G: V (x) c} are in the basin of attraction of ˆx. In the last example, the whole R 2 + is in the basin of attraction of (ˆx, ŷ). 5
Dynamical Systems. Chapter 7
150 Chapter 7 Dynamical Systems Mathematical models of scientific systems often lead to differential equations in which the independent variable is time. Such systems arise in astronomy, biology, chemistry,
4 Lyapunov Stability Theory
4 Lyapunov Stability Theory In this section we review the tools of Lyapunov stability theory. These tools will be used in the next section to analyze the stability properties of a robot controller. We
Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x
Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written
Fuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
3. Reaction Diffusion Equations Consider the following ODE model for population growth
3. Reaction Diffusion Equations Consider the following ODE model for population growth u t a u t u t, u 0 u 0 where u t denotes the population size at time t, and a u plays the role of the population dependent
Stability. Chapter 4. Topics : 1. Basic Concepts. 2. Algebraic Criteria for Linear Systems. 3. Lyapunov Theory with Applications to Linear Systems
Chapter 4 Stability Topics : 1. Basic Concepts 2. Algebraic Criteria for Linear Systems 3. Lyapunov Theory with Applications to Linear Systems 4. Stability and Control Copyright c Claudiu C. Remsing, 2006.
ANALYSIS OF A MODEL OF TWO PARALLEL FOOD CHAINS. Sze-Bi Hsu. Christopher A. Klausmeier. Chiu-Ju Lin. (Communicated by the associate editor name)
Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 00X Website: http://aimsciences.org pp. X XX ANALYSIS OF A MODEL OF TWO PARALLEL FOOD CHAINS Sze-Bi Hsu Department of Mathematics National
The Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
E3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
Lecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
Lecture 13 Linear quadratic Lyapunov theory
EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time
Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
Hello, my name is Olga Michasova and I present the work The generalized model of economic growth with human capital accumulation.
Hello, my name is Olga Michasova and I present the work The generalized model of economic growth with human capital accumulation. 1 Without any doubts human capital is a key factor of economic growth because
MA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
Chapter 7. Sealed-bid Auctions
Chapter 7 Sealed-bid Auctions An auction is a procedure used for selling and buying items by offering them up for bid. Auctions are often used to sell objects that have a variable price (for example oil)
Separation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
MATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
Metric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
Mathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
Control Systems with Actuator Saturation
Control Systems with Actuator Saturation Analysis and Design Tingshu Hu Zongli Lin With 67 Figures Birkhauser Boston Basel Berlin Preface xiii 1 Introduction 1 1.1 Linear Systems with Actuator Saturation
MA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity
MA4001 Engineering Mathematics 1 Lecture 10 Limits and Dr. Sarah Mitchell Autumn 2014 Infinite limits If f(x) grows arbitrarily large as x a we say that f(x) has an infinite limit. Example: f(x) = 1 x
88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a
88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small
Walrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
CHAPTER 1 BASIC TOPOLOGY
CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is
FIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3
FIRTION SEQUENES ND PULLK SQURES RY MLKIEWIH bstract. We lay out some foundational facts about fibration sequences and pullback squares of topological spaces. We pay careful attention to connectivity ranges
GROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
Nonlinear Systems and Control Lecture # 15 Positive Real Transfer Functions & Connection with Lyapunov Stability. p. 1/?
Nonlinear Systems and Control Lecture # 15 Positive Real Transfer Functions & Connection with Lyapunov Stability p. 1/? p. 2/? Definition: A p p proper rational transfer function matrix G(s) is positive
Nonlinear Systems of Ordinary Differential Equations
Differential Equations Massoud Malek Nonlinear Systems of Ordinary Differential Equations Dynamical System. A dynamical system has a state determined by a collection of real numbers, or more generally
On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems
Dynamics at the Horsetooth Volume 2, 2010. On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems Eric Hanson Department of Mathematics Colorado State University
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
THE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
SOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
Lecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
RANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
Lecture 4: BK inequality 27th August and 6th September, 2007
CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound
Duality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
CPC/CPA Hybrid Bidding in a Second Price Auction
CPC/CPA Hybrid Bidding in a Second Price Auction Benjamin Edelman Hoan Soo Lee Working Paper 09-074 Copyright 2008 by Benjamin Edelman and Hoan Soo Lee Working papers are in draft form. This working paper
Game Theory: Supermodular Games 1
Game Theory: Supermodular Games 1 Christoph Schottmüller 1 License: CC Attribution ShareAlike 4.0 1 / 22 Outline 1 Introduction 2 Model 3 Revision questions and exercises 2 / 22 Motivation I several solution
CHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 16
INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 16 RAVI VAKIL Contents 1. Valuation rings (and non-singular points of curves) 1 1.1. Completions 2 1.2. A big result from commutative algebra 3 Problem sets back.
Convex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
Network Traffic Modelling
University of York Dissertation submitted for the MSc in Mathematics with Modern Applications, Department of Mathematics, University of York, UK. August 009 Network Traffic Modelling Author: David Slade
BIOE 370 1. Lotka-Volterra Model L-V model with density-dependent prey population growth
BIOE 370 1 Populus Simulations of Predator-Prey Population Dynamics. Lotka-Volterra Model L-V model with density-dependent prey population growth Theta-Logistic Model Effects on dynamics of different functional
Differentiating under an integral sign
CALIFORNIA INSTITUTE OF TECHNOLOGY Ma 2b KC Border Introduction to Probability and Statistics February 213 Differentiating under an integral sign In the derivation of Maximum Likelihood Estimators, or
24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
Rolle s Theorem. q( x) = 1
Lecture 1 :The Mean Value Theorem We know that constant functions have derivative zero. Is it possible for a more complicated function to have derivative zero? In this section we will answer this question
1 Introduction, Notation and Statement of the main results
XX Congreso de Ecuaciones Diferenciales y Aplicaciones X Congreso de Matemática Aplicada Sevilla, 24-28 septiembre 2007 (pp. 1 6) Skew-product maps with base having closed set of periodic points. Juan
Math 231b Lecture 35. G. Quick
Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces OLEG REINOV St. Petersburg State University Dept. of Mathematics and Mechanics Universitetskii pr. 28, 198504 St, Petersburg
Some Problems of Second-Order Rational Difference Equations with Quadratic Terms
International Journal of Difference Equations ISSN 0973-6069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of Second-Order Rational Difference Equations with Quadratic
HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
0.1 Phase Estimation Technique
Phase Estimation In this lecture we will describe Kitaev s phase estimation algorithm, and use it to obtain an alternate derivation of a quantum factoring algorithm We will also use this technique to design
4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces
Communications in Mathematical Physics Manuscript-Nr. (will be inserted by hand later) Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Stefan Bechtluft-Sachs, Marco Hien Naturwissenschaftliche
1. Introduction. PROPER HOLOMORPHIC MAPPINGS BETWEEN RIGID POLYNOMIAL DOMAINS IN C n+1
Publ. Mat. 45 (2001), 69 77 PROPER HOLOMORPHIC MAPPINGS BETWEEN RIGID POLYNOMIAL DOMAINS IN C n+1 Bernard Coupet and Nabil Ourimi Abstract We describe the branch locus of proper holomorphic mappings between
Orbits of the Lennard-Jones Potential
Orbits of the Lennard-Jones Potential Prashanth S. Venkataram July 28, 2012 1 Introduction The Lennard-Jones potential describes weak interactions between neutral atoms and molecules. Unlike the potentials
1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: [email protected] Proof: For any element x of the empty set, x is also an element of every set since
1 The Concept of a Mapping
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 1 The Concept of a Mapping The concept of a mapping (aka function) is important throughout mathematics. We have been dealing
INTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
THE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets
Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Nathaniel Hendren January, 2014 Abstract Both Akerlof (1970) and Rothschild and Stiglitz (1976) show that
Cartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
V(x)=c 2. V(x)=c 1. V(x)=c 3
University of California Department of Mechanical Engineering Linear Systems Fall 1999 (B. Bamieh) Lecture 6: Stability of Dynamic Systems Lyapunov's Direct Method 1 6.1 Notions of Stability For a general
Math 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
Notes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
A Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:
Quasi-static evolution and congested transport
Quasi-static evolution and congested transport Inwon Kim Joint with Damon Alexander, Katy Craig and Yao Yao UCLA, UW Madison Hard congestion in crowd motion The following crowd motion model is proposed
Date: April 12, 2001. Contents
2 Lagrange Multipliers Date: April 12, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 12 2.3. Informative Lagrange Multipliers...........
A note on Dulac functions for a sum of vector fields
AVANZA. Vol. iii. Fm - Iit, Uacj (2013) 17 23. Isbn: 978-607-9224-52-3 A note on Dulac functions for a sum of vector fields Osuna, Osvaldo, Vargas-De-León, Cruz, Villaseñor, Gabriel Abstract In this paper
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
Practice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and
SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
Models of Cortical Maps II
CN510: Principles and Methods of Cognitive and Neural Modeling Models of Cortical Maps II Lecture 19 Instructor: Anatoli Gorchetchnikov dy dt The Network of Grossberg (1976) Ay B y f (
Dimension Theory for Ordinary Differential Equations
Vladimir A. Boichenko, Gennadij A. Leonov, Volker Reitmann Dimension Theory for Ordinary Differential Equations Teubner Contents Singular values, exterior calculus and Lozinskii-norms 15 1 Singular values
8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension.
8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension. 8.1 Definitions Definition If every point in a set S has arbitrarily small neighborhoods whose boundaries do not intersect
Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
Critical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
Math 241, Exam 1 Information.
Math 241, Exam 1 Information. 9/24/12, LC 310, 11:15-12:05. Exam 1 will be based on: Sections 12.1-12.5, 14.1-14.3. The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/241fa12/241.html)
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
Stability Analysis of Nonlinear Systems with Linear Programming
Stability Analysis of Nonlinear Systems with Linear Programming A Lyapunov Functions Based Approach Von der Fakultät für Naturwissenschaften - Institut für Mathematik der Gerhard-Mercator-Universität Duisburg
Functional Optimization Models for Active Queue Management
Functional Optimization Models for Active Queue Management Yixin Chen Department of Computer Science and Engineering Washington University in St Louis 1 Brookings Drive St Louis, MO 63130, USA [email protected]
Hydrodynamic Limits of Randomized Load Balancing Networks
Hydrodynamic Limits of Randomized Load Balancing Networks Kavita Ramanan and Mohammadreza Aghajani Brown University Stochastic Networks and Stochastic Geometry a conference in honour of François Baccelli
Lecture 14: Section 3.3
Lecture 14: Section 3.3 Shuanglin Shao October 23, 2013 Definition. Two nonzero vectors u and v in R n are said to be orthogonal (or perpendicular) if u v = 0. We will also agree that the zero vector in
it is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
