Hybrid Control and Switched Systems. Lecture #8 Stability and convergence of hybrid systems (topological view)
|
|
- Rosamond Murphy
- 5 years ago
- Views:
Transcription
1 Hybrid Control and Switched Systems Lecture #8 Stability and convergence of hybrid systems (topological view) João P. Hespanha University of California at Santa Barbara Summary Lyapunov stability of hybrid systems 1
2 Properties of hybrid systems sig set of all piecewise continuous signals :[0,T) R n, T (0, ] sig set of all piecewise constant signals q:[0,t), T (0, ] Sequence property p : sig sig {false,true} E.g., A pair of signals (q, ) sig sig satisfies p if p(q, ) = true A hybrid automaton H satisfies p ( write H ² p ) if p(q, ) = true, for every solution (q, ) of H ensemble properties property of the whole family of solutions (cannot be checked just by looking at isolated solutions) e.g., continuity with respect to initial conditions Lyapunov stability of ODEs (recall) sig set of all piecewise continuous signals taking values in R n Given a signal sig, sig ú sup t 0 (t) signal norm ODE can be seen as an operator T : R n sig that maps 0 R n into the solution that starts at (0) = 0 A solution * is (Lyapunov) stable if T is continuous at * 0 ú * (0), i.e., e > 0 δ >0 : 0 * 0 δ T( 0 ) T(* 0 ) sig e δ sup t 0 (t) * (t) e (t) * (t) e pend.m 2
3 Lyapunov stability of hybrid systems ú Φ 2 (q 1, ) Φ 1 (q 1, ) = q 2? mode q 2 mode q 1 sig set of all piecewise continuous signals :[0,T) R n, T (0, ] sig set of all piecewise constant signals q:[0,t), T (0, ] A solution (q *, * ) is (Lyapunov) stable if T is continuous at (q * (0), * (0)). To make sense of continuity we need ways to measure distances in R n and sig sig Lyapunov stability of hybrid systems A few possible metrics one cares very much about the discrete states matching one does not care at all about the discrete states matching A solution (q *, * ) is (Lyapunov) stable if T is continuous at (q 0*, 0* )ú(q * (0), * (0)), i.e., e > 0 δ >0 : d( (q * (0), * (0)), (q(0), (0)) ) δ sup t 0 d ( (q * (t), * (t)), (q(t), (t)) ) e 1. If the solution starts close to (q *, * ) it will remain close to it forever 2. e can be made arbitrarily small by choosing δ sufficiently small Note: may actually not be metrics on R n because one may want zero-distance between points. However, still define a topology on R n, which is what is really needed to make sense of continuity 3
4 Topological spaces Given a set and a collection of subsets of (, ) is a topological space if 1., 2., 3. 1, 2,, n i=1n i (1 n ) Eamples: ú { q 1, q 2,, q n } (finite) ú {, } (trivial topology all points are close to each other) ú { } {all subsets of } (discrete topology no two distinct points are close to each other) ú {, {1}, {1,2} } of {1,2} ú R n Intuitively: two elements of are arbitrarily close if for every open set one belongs to, the other also belongs to is called a topology and the sets in are called open and their complements are called closed A point is only arbitarily close to itself (Hausdorff space) ú { (possibly infinite) union of all open balls } (norm-induced topology) open ball { R n : 0 < e } How to prove that 2. holds? (Hint: and are distributive & intersection of two open balls is in ) Continuity in Topological spaces Given a set and a collection of subsets of (, ) is a topological space if 1., 2., 3. 1, 2,, n i=1n i (1 n ) Given a function f: with, topological space is called a topology and the sets in are called open and their complements are called closed f is continuous at a point 0 in if for every neighborhood (i.e., set containing an open set) of f( 0 ) there is a neighborhood of 0 such that f( ). f( ) f( 0 ) f 0 Intuitively: arbitrarily close points in are transformed into arbitrarily close points in For norm-induced topologies we need only consider balls ú { y : y f( 0 ) < e } and ú { : 0 < δ } 4
5 Continuity in Topological spaces Given a function f: with, topological space f is continuous at a point 0 in if for every neighborhood (i.e., set containing an open set) of f( 0 ) there is a neighborhood of 0 such that f( ). Eamples: ú R n, ú R m, ú { (possibly infinite) union of all open balls } (norm-induced top.) open ball { R n : 0 < e } leads to the usual definition of continuity in R n : f continuous at 0 if e > 0 δ > 0 : 0 < δ f() f( 0 ) < e f( ) f( 0 ) f 0 Could be restated as: for every ball ú { y : y f( 0 ) < e } there is a ball ú { : 0 < δ } such that f() or equivalently f( ) Continuity in Topological spaces Given a function f: with, topological space f is continuous at a point 0 in if for every neighborhood (i.e., set containing an open set) of f( 0 ) there is a neighborhood of 0 such that f( ). Eamples: ú { q 1, q 2,, q n } (finite) 1. ú {, } (trivial topology all points are close to each other) 2. ú { } {all subsets of } (discrete topology no two distinct points are close to each other) 3. ú {, {1}, {1,2} } of {1,2} Is any of these functions f : R continuous? (usual norm-topology in R) f() f() f() f() 5
6 Continuity in Topological spaces Given a function f: with, topological space f is continuous at a point 0 in if for every neighborhood (i.e., set containing an open set) of f( 0 ) there is a neighborhood of 0 such that f( ). Eamples: ú { q 1, q 2,, q n } (finite) 1. ú {, } (trivial topology all points are close to each other) 2. ú { } {all subsets of } (discrete topology no two points are close to each other) 3. ú {, {1}, {1,2} } of {1,2} (2 is?close? to 1 but 1 is not?close? to 2) Is any of these functions f : R continuous? (usual norm-topology in R) f() f() f() f() continuous for 1., 2., 3. continuous for 1., 3. continuous only for 1. continuous only for 1. (for those that don t want to leave anything to the imagination ) Given a sets, with topologies and One can construct a topology on : ú { :, } Eample: ú {1, 2}, ú {, {1}, {1,2} } ú R, R norm-induced topology some open sets:, { (1,): (1,2) }, { (q,): q=1,2, (1, ) } not open sets: { (1,): (1,2] }, { (2,): (1,2) } One can construct a topology sig on the set sig of signals q:[0,t), T (0, ]: sig ú sets of the form ú { q sig : q(t) (t) t} where the (t) are a collection of open sets Eample: ú {1, 2}, ú {, {1}, {1,2} } some open sets: { q : q(t) = 1 t 1 }, { q : q(t) = 1 t Q } not open sets: {q : q(t) = 2 t 1 } ú R, R norm-induced topology some open sets: { : (t) < 0 t }, { : (t) < 1 t } non open sets: { : 0 (t) dt <1 } 6
7 Back to hybrid systems A solution (q *, * ) is (Lyapunov) stable if T is continuous at (q 0*, 0* )ú(q * (0), * (0)), i.e., for every neighborhood of T(q 0*, 0* ) there is a neighborhood of (q 0*, 0* ) such that T( ) Case 1: domain of T: trivial topology (all points close to each other) R n usual topology induced from Euclidean norm co-domain of T: sig trivial topology (all signals close to each other) sig usual topology induced from sup-norm e > 0 δ >0 : q(0), * (0) (0)) < δ t * (t) (t) < e one does not care at all about the discrete states matching Back to hybrid systems A solution (q *, * ) is (Lyapunov) stable if T is continuous at (q 0*, 0* )ú(q * (0), * (0)), i.e., for every neighborhood of T(q 0*, 0* ) there is a neighborhood of (q 0*, 0* ) such that T( ) Case 2: domain of T: discrete topology (all points far from each other) R n usual topology induced from Euclidean norm co-domain of T: sig discrete topology (all signals far from each other) sig usual topology induced from sup-norm e > 0 δ >0 : q * (0) = q(0), * (0) (0)) < δ t q * (t) = q(t), * (t) (t) < e one cares very much about the discrete states matching 7
8 Back to hybrid systems A solution (q *, * ) is (Lyapunov) stable if T is continuous at (q 0*, 0* )ú(q * (0), * (0)), i.e., for every neighborhood of T(q 0*, 0* ) there is a neighborhood of (q 0*, 0* ) such that T( ) Case 3: domain of T: Q discrete topology (all points far from each other) R n usual topology induced from Euclidean norm co-domain of T: sig trivial topology (all signals close to each other) sig usual topology induced from sup-norm e > 0 δ >0 : q * (0) = q(0), * (0) (0)) < δ t * (t) (t) < e one cares very much about the discrete states matching Back to hybrid systems A solution (q *, * ) is (Lyapunov) stable if T is continuous at (q 0*, 0* )ú(q * (0), * (0)), i.e., for every neighborhood of T(q 0*, 0* ) there is a neighborhood of (q 0*, 0* ) such that T( ) Case 4: domain of T: {, {1}, {1,2} }, ú {1,2} R n usual topology induced from Euclidean norm co-domain of T: sig trivial topology (all signals close to each other) sig usual topology induced from sup-norm small perturbation in (but no perturbation in q) leads to small change in for q * (0) = 1: e > 0 δ >0 : q(0) = 1, * (0) (0)) < δ t * (t) (t) < e for q * (0) = 2: e > 0 δ >0 : q(0), * (0) (0)) < δ t * (t) (t) < e small perturbation in leads to small change in, regardless of q(0) 8
9 Back to hybrid systems A solution (q *, * ) is (Lyapunov) stable if T is continuous at (q 0*, 0* )ú(q * (0), * (0)), i.e., for every neighborhood of T(q 0*, 0* ) there is a neighborhood of (q 0*, 0* ) such that T( ) Case 4: domain of T: discrete topology (all points far from each other) R n usual topology induced from Euclidean norm co-domain of T: {, {1}, {1,2} }, ú {1,2} (signal version ) sig usual topology induced from sup-norm e > 0 δ >0 : q * (0) = q(0), * (0) (0)) < δ tq * (t) = 2 or q * (t) = q(t), * (t) (t) < e small perturbation in (but no perturbation in q) leads to small change in, q * and q may differ only when q * = 2 Eample #2: Thermostat mean temperature room 73? q = 1 q = 2 heater 77? q = 2 no trajectory is stable some trajectories are stable others unstable turn heater off turn heater on t Why? all trajectories are stable for discrete topology on (all points far from each other) for trivial topology on (all points close to each other) for discrete topology on for the domain and the trivial topology for the codomain 9
10 pump pump-on inflow λ = 3 constant outflow μ = 1 y 1? pump off (q = 1) Eample #5: Tank system y τ.5? goal prevent the tank from emptying or filling up δ =.5 delay between command is sent to pump and the time it is eecuted wait to off (q = 4) τ ú 0 τ ú 0 wait to on (q = 2) τ.5? pump on (q = 3) A possible topology for : ú {, {1,2}, {3,4}, {1,2,3,4} } y 2? this topology only distinguishes between modes based on the state of the pump Eample #4: Inverted pendulum swing-up u [-1,1] θ Hybrid controller: 1 st pump/remove energy into/from the system by applying maimum force, until E 0 (energy control) 2 nd wait until pendulum is close to the upright position 3 th net to upright position use feedback linearization controller remove energy E [-ε,ε]? E < ε E > ε pump energy wait E [-ε,ε]? ω + θ δ? stabilize 10
11 Eample #4: Inverted pendulum swing-up u [-1,1] θ A possible topology for ú {r,p,w,s} : ú {, {s}, {r,p,w,s} } 1. for solutions (q *, * ) that start in s, we only consider perturbations that also start in s 2. for solutions (q *, * ) that start outside s, the perturbations can start in any state remove energy E [-ε,ε]? E < ε E > ε pump energy wait E [-ε,ε]? ω + θ δ? stabilize Asymptotic stability for hybrid systems A solution (q *, * ) is (Lyapunov) stable if T is continuous at (q 0*, 0* )ú(q * (0), * (0)), i.e., for every neighborhood of T(q 0*, 0* ) there is a neighborhood of (q 0*, 0* ) such that T( ) Definition: A solution (q *, * ) is asymptotically stable if it is stable, every solution (q,) eists globally, and q q *, * as t in the sense of the topology on sig 11
12 Eample #7: Server system with congestion control incoming rate r q q ma? r ú m r q ma q server B rate of service (bandwidth) every solution eists globally and converges to a periodic solution that is stable. Do we have asymptotic stability? Eample #7: Server system with congestion control incoming rate r q q ma? r ú m r q ma q server B rate of service (bandwidth) every solution eists globally and converges to a periodic solution that is stable. Do we have asymptotic stability? No, its difficult to have asymptotic stability for non-constant solutions due to the synchronization requirement. (not even stability Always?) 12
13 Eample #2: Thermostat mean temperature room 73? q = 1 q = 2 heater 77? q = 2 no trajectory is stable turn heater off turn heater on t all trajectories are stable but not asymptotically for discrete topology on (all points far from each other) Why? for trivial topology on (all points close to each other) Stability of sets Poincaré distance between (q, ), (q *, * ) sig sig after t 0 (q * (t), * (t)) (q(t), (t)) distance at the point t where the (q(t), (t)) is the furthest apart from (q *, * ) can also be viewed as the distance from the trajectory (q, ) to the set {(q * (t), * (t)) :t t 0 } For constant trajectories (q *, * ) its just the sup-norm: 13
14 Stability of sets Poincaré distance between (q, ), (q *, * ) sig sig after t 0 Definition: A solution (q *, * ) is Poincaré stable if T is continuous at (q 0*, 0* ) ú (q * (0), * (0)) for the topology on sig induced by the Poincaré distance, e > 0 δ >0 : d 0 ((q(0), (0)), (q * (0), * (0))) δ d P ((q *, * ), (q,); 0) = sup t 0 inf τ 0 d T ((q(t), (t)), (q * (τ), * (τ))) e in more modern terminology one would say that the following set is stable { (q * (t), * (t)) : t 0 } (open sets are unions of open Poincaré balls { sig : d P ( 0 ) < e }. Show this is a topology ) Stability of sets Poincaré distance between (q, ), (q *, * ) sig sig after t 0 Definition: A solution (q *, * ) is Poincaré asymptotically stable if it is Poincaré stable, every solution (q, ) eists globally, and d P ((q,), (q *, * ); t ) 0 as t in more modern terminology one would say that the following set is asymptotically stable: { (q * (t), * (t)) : t 0 } 14
15 Eample #7: Server system with congestion control incoming rate r q q ma? r ú m r q ma q server B rate of service (bandwidth) r all trajectories are Poincaré asymptotically stable q ma q To think about 1. With hybrid systems there are many possible notions of stability. (especially due to the topology imposed on the discrete state) WHICH ONE IS THE BEST? (engineering question, not a mathematical one) What type of perturbations do you want to consider on the initial conditions? (this will define the topology on the initial conditions) What type of changes are you willing to accept in the solution? (this will define the topology on the signals) 2. Even with ODEs there are several alternatives: e.g., e > 0 δ >0 : 0 eq δ sup t 0 (t) eq e or e > 0 δ >0 : 0 eq δ 0 (t) eq dt e or e > 0 δ >0 : 0 0* δ d P (, * ; 0 ) e (even for linear systems these definitions may differ: Why?) Lyapunov integral Poincaré 15
16 Net lecture Analysis tools for hybrid systems 1. Impact maps Fied-point theorem Stability of periodic solutions 2. Decoupling Switched systems Supervisors 16
Hybrid Control and Switched Systems. Lecture #1 Hybrid systems are everywhere: Examples
Hybrid Control and Switched Systems Lecture #1 Hybrid systems are everywhere: Examples João P. Hespanha University of California at Santa Barbara Summary Examples of hybrid systems 1. Bouncing ball 2.
More informationHybrid Control and Switched Systems. Lecture #9 Analysis tools for hybrid systems: Impact maps
Hybrid Control and Switched Systems Lecture #9 Analysis tools for hybrid systems: Impact maps João P. Hespanha University of California at Santa Barbara Summary Analysis tools for hybrid systems Impact
More informationHybrid Control and Switched Systems. Lecture #7 Stability and convergence of ODEs
Hybrid Control and Switched Systems Lecture #7 Stability and convergence of ODEs João P. Hespanha University of California at Santa Barbara Summary Lyapunov stability of ODEs epsilon-delta and beta-function
More informationHybrid Control and Switched Systems. Lecture #11 Stability of switched system: Arbitrary switching
Hybrid Control and Switched Systems Lecture #11 Stability of switched system: Arbitrary switching João P. Hespanha University of California at Santa Barbara Stability under arbitrary switching Instability
More information106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)
106 CHAPTER 3. TOPOLOGY OF THE REAL LINE 3.3 Limit Points 3.3.1 Main Definitions Intuitively speaking, a limit point of a set S in a space X is a point of X which can be approximated by points of S other
More informationHybrid Control and Switched Systems. Lecture #4 Simulation of hybrid systems
Hybrid Control and Switched Systems Lecture #4 Simulation of hybrid systems João P. Hespanha University of California at Santa Barbara Summary 1. Numerical simulation of hybrid automata simulations of
More informationMath General Topology Fall 2012 Homework 1 Solutions
Math 535 - General Topology Fall 2012 Homework 1 Solutions Definition. Let V be a (real or complex) vector space. A norm on V is a function : V R satisfying: 1. Positivity: x 0 for all x V and moreover
More information2 Metric Spaces Definitions Exotic Examples... 3
Contents 1 Vector Spaces and Norms 1 2 Metric Spaces 2 2.1 Definitions.......................................... 2 2.2 Exotic Examples...................................... 3 3 Topologies 4 3.1 Open Sets..........................................
More informationMath 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008
Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together
More informationStochastic Hybrid Systems: Applications to Communication Networks
research supported by NSF Stochastic Hybrid Systems: Applications to Communication Networks João P. Hespanha Center for Control Engineering and Computation University of California at Santa Barbara Deterministic
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationControlo Switched Systems: Mixing Logic with Differential Equations. João P. Hespanha. University of California at Santa Barbara.
Controlo 00 5 th Portuguese Conference on Automatic Control University of Aveiro,, September 5-7, 5 00 Switched Systems: Mixing Logic with Differential Equations João P. Hespanha University of California
More informationMCE693/793: Analysis and Control of Nonlinear Systems
MCE693/793: Analysis and Control of Nonlinear Systems Systems of Differential Equations Phase Plane Analysis Hanz Richter Mechanical Engineering Department Cleveland State University Systems of Nonlinear
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More informationTopology Homework Assignment 1 Solutions
Topology Homework Assignment 1 Solutions 1. Prove that R n with the usual topology satisfies the axioms for a topological space. Let U denote the usual topology on R n. 1(a) R n U because if x R n, then
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 20: LMI/SOS Tools for the Study of Hybrid Systems Stability Concepts There are several classes of problems for
More informationMath General Topology Fall 2012 Homework 8 Solutions
Math 535 - General Topology Fall 2012 Homework 8 Solutions Problem 1. (Willard Exercise 19B.1) Show that the one-point compactification of R n is homeomorphic to the n-dimensional sphere S n. Note that
More informationMAS3706 Topology. Revision Lectures, May I do not answer enquiries as to what material will be in the exam.
MAS3706 Topology Revision Lectures, May 208 Z.A.Lykova It is essential that you read and try to understand the lecture notes from the beginning to the end. Many questions from the exam paper will be similar
More informationLecture 9 Nonlinear Control Design. Course Outline. Exact linearization: example [one-link robot] Exact Feedback Linearization
Lecture 9 Nonlinear Control Design Course Outline Eact-linearization Lyapunov-based design Lab Adaptive control Sliding modes control Literature: [Khalil, ch.s 13, 14.1,14.] and [Glad-Ljung,ch.17] Lecture
More informationWalker Ray Econ 204 Problem Set 2 Suggested Solutions July 22, 2017
Walker Ray Econ 204 Problem Set 2 Suggested s July 22, 2017 Problem 1. Show that any set in a metric space (X, d) can be written as the intersection of open sets. Take any subset A X and define C = x A
More informationHybrid Control and Switched Systems. Lecture #3 What can go wrong? Trajectories of hybrid systems
Hybrid Conrol and Swiched Sysems Lecure #3 Wha can go wrong? Trajecories of hybrid sysems João P. Hespanha Universiy of California a Sana Barbara Summary 1. Trajecories of hybrid sysems: Soluion o a hybrid
More informationMath 730 Homework 6. Austin Mohr. October 14, 2009
Math 730 Homework 6 Austin Mohr October 14, 2009 1 Problem 3A2 Proposition 1.1. If A X, then the family τ of all subsets of X which contain A, together with the empty set φ, is a topology on X. Proof.
More informationof the set A. Note that the cross-section A ω :={t R + : (t,ω) A} is empty when ω/ π A. It would be impossible to have (ψ(ω), ω) A for such an ω.
AN-1 Analytic sets For a discrete-time process {X n } adapted to a filtration {F n : n N}, the prime example of a stopping time is τ = inf{n N : X n B}, the first time the process enters some Borel set
More information2. The Concept of Convergence: Ultrafilters and Nets
2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two
More informationThe discrete and indiscrete topologies on any set are zero-dimensional. The Sorgenfrey line
p. 1 Math 525 Notes on section 17 Isolated points In general, a point x in a topological space (X,τ) is called an isolated point iff the set {x} is τ-open. A topological space is called discrete iff every
More informationF 1 =. Setting F 1 = F i0 we have that. j=1 F i j
Topology Exercise Sheet 5 Prof. Dr. Alessandro Sisto Due to 28 March Question 1: Let T be the following topology on the real line R: T ; for each finite set F R, we declare R F T. (a) Check that T is a
More informationMAT 530: Topology&Geometry, I Fall 2005
MAT 530: Topology&Geometry, I Fall 2005 Midterm Solutions Note: These solutions are more detailed than solutions sufficient for full credit. Let X denote the set {a, b, c}. The collections Problem 1 5+5
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationInput to state Stability
Input to state Stability Mini course, Universität Stuttgart, November 2004 Lars Grüne, Mathematisches Institut, Universität Bayreuth Part IV: Applications ISS Consider with solutions ϕ(t, x, w) ẋ(t) =
More informationMeasures. Chapter Some prerequisites. 1.2 Introduction
Lecture notes Course Analysis for PhD students Uppsala University, Spring 2018 Rostyslav Kozhan Chapter 1 Measures 1.1 Some prerequisites I will follow closely the textbook Real analysis: Modern Techniques
More informationDiscontinuous Systems
Discontinuous Systems Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University Outline Simple Examples Bouncing ball Heating system Gearbox/cruise control Simulating Hybrid Systems
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationAn introduction to Mathematical Theory of Control
An introduction to Mathematical Theory of Control Vasile Staicu University of Aveiro UNICA, May 2018 Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May 2018
More information1. Continuous Functions between Euclidean spaces
Math 441 Topology Fall 2012 Metric Spaces by John M. Lee This handout should be read between Chapters 1 and 2 of the text. It incorporates material from notes originally prepared by Steve Mitchell and
More informationWe will begin our study of topology from a set-theoretic point of view. As the subject
p. 1 Math 490-01 Notes 5 Topology We will begin our study of topology from a set-theoretic point of view. As the subject expands, we will encounter various notions from analysis such as compactness, continuity,
More informationLecture Notes Introduction to Ergodic Theory
Lecture Notes Introduction to Ergodic Theory Tiago Pereira Department of Mathematics Imperial College London Our course consists of five introductory lectures on probabilistic aspects of dynamical systems,
More informationHybrid Control and Switched Systems. Lecture #6 Reachability
Hbrid Control and Switched Stem Lecture #6 Reachabilit João P. Hepanha Univerit of California at Santa Barbara Summar Review of previou lecture Reachabilit tranition tem reachabilit algorithm backward
More informationMath 535: Topology Homework 1. Mueen Nawaz
Math 535: Topology Homework 1 Mueen Nawaz Mueen Nawaz Math 535 Topology Homework 1 Problem 1 Problem 1 Find all topologies on the set X = {0, 1, 2}. In the list below, a, b, c X and it is assumed that
More informationOnly Intervals Preserve the Invertibility of Arithmetic Operations
Only Intervals Preserve the Invertibility of Arithmetic Operations Olga Kosheleva 1 and Vladik Kreinovich 2 1 Department of Electrical and Computer Engineering 2 Department of Computer Science University
More informationSolutions to Tutorial 7 (Week 8)
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 7 (Week 8) MATH2962: Real and Complex Analysis (Advanced) Semester 1, 2017 Web Page: http://www.maths.usyd.edu.au/u/ug/im/math2962/
More informationPersistent Chaos in High-Dimensional Neural Networks
Persistent Chaos in High-Dimensional Neural Networks D. J. Albers with J. C. Sprott and James P. Crutchfield February 20, 2005 1 Outline: Introduction and motivation Mathematical versus computational dynamics
More informationHybrid Systems - Lecture n. 3 Lyapunov stability
OUTLINE Focus: stability of equilibrium point Hybrid Systems - Lecture n. 3 Lyapunov stability Maria Prandini DEI - Politecnico di Milano E-mail: prandini@elet.polimi.it continuous systems decribed by
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationEE291E Lecture Notes 3 Autonomous Hybrid Automata
EE9E Lecture Notes 3 Autonomous Hybrid Automata Claire J. Tomlin January, 8 The lecture notes for this course are based on the first draft of a research monograph: Hybrid Systems. The monograph is copyright
More informationFinite State Machines 2
Finite State Machines 2 Joseph Spring School of Computer Science 1COM0044 Foundations of Computation 1 Discussion Points In the last lecture we looked at: 1. Abstract Machines 2. Finite State Machines
More information*Room 3.13 in Herschel Building
MAS3706: Topology Dr. Zinaida Lykova School of Mathematics, Statistics and Physics Newcastle University *Room 3.13 in Herschel Building These lectures concern metric and topological spaces and continuous
More informationMath 54: Topology. Syllabus, problems and solutions. Pierre Clare. Dartmouth College, Summer 2015
Math 54: Topology Syllabus, problems and solutions Pierre Clare Dartmouth College, Summer 2015 1 [M] Topology (2 nd ed.), by J. Munkres. Textbook O. Introduction - 4 lectures O.1 Elementary set theory
More informationTopology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski
Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology
More informationZur Konstruktion robust stabilisierender Regler mit Hilfe von mengenorientierten numerischen Verfahren
Zur Konstruktion robust stabilisierender Regler mit Hilfe von mengenorientierten numerischen Verfahren Oliver Junge Zentrum Mathematik Technische Universität München mit Lars Grüne, Bayreuth Outline optimal
More informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
More information2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α.
Chapter 2. Basic Topology. 2.3 Compact Sets. 2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α. 2.32 Definition A subset
More informationIntroduction to Dynamical Systems
Introduction to Dynamical Systems France-Kosovo Undergraduate Research School of Mathematics March 2017 This introduction to dynamical systems was a course given at the march 2017 edition of the France
More information18.175: Lecture 2 Extension theorems, random variables, distributions
18.175: Lecture 2 Extension theorems, random variables, distributions Scott Sheffield MIT Outline Extension theorems Characterizing measures on R d Random variables Outline Extension theorems Characterizing
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationGramians based model reduction for hybrid switched systems
Gramians based model reduction for hybrid switched systems Y. Chahlaoui Younes.Chahlaoui@manchester.ac.uk Centre for Interdisciplinary Computational and Dynamical Analysis (CICADA) School of Mathematics
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationTrajectory tracking & Path-following control
Cooperative Control of Multiple Robotic Vehicles: Theory and Practice Trajectory tracking & Path-following control EECI Graduate School on Control Supélec, Feb. 21-25, 2011 A word about T Tracking and
More informationSwitched Systems: Mixing Logic with Differential Equations
research supported by NSF Switched Systems: Mixing Logic with Differential Equations João P. Hespanha Center for Control Dynamical Systems and Computation Outline Logic-based switched systems framework
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationExistence of Optima. 1
John Nachbar Washington University March 1, 2016 Existence of Optima. 1 1 The Basic Existence Theorem for Optima. Let X be a non-empty set and let f : X R. The MAX problem is f(x). max x X Thus, x is a
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 informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationBanach Spaces V: A Closer Look at the w- and the w -Topologies
BS V c Gabriel Nagy Banach Spaces V: A Closer Look at the w- and the w -Topologies Notes from the Functional Analysis Course (Fall 07 - Spring 08) In this section we discuss two important, but highly non-trivial,
More informationU e = E (U\E) e E e + U\E e. (1.6)
12 1 Lebesgue Measure 1.2 Lebesgue Measure In Section 1.1 we defined the exterior Lebesgue measure of every subset of R d. Unfortunately, a major disadvantage of exterior measure is that it does not satisfy
More informationNOTIONS OF DIMENSION
NOTIONS OF DIENSION BENJAIN A. STEINHURST A quick overview of some basic notions of dimension for a summer REU program run at UConn in 200 with a view towards using dimension as a tool in attempting to
More informationNotes on the Point-Set Topology of R Northwestern University, Fall 2014
Notes on the Point-Set Topology of R Northwestern University, Fall 2014 These notes give an introduction to the notions of open and closed subsets of R, which belong to the subject known as point-set topology.
More informationGeometry and topology of continuous best and near best approximations
Journal of Approximation Theory 105: 252 262, Geometry and topology of continuous best and near best approximations Paul C. Kainen Dept. of Mathematics Georgetown University Washington, D.C. 20057 Věra
More information01. Review of metric spaces and point-set topology. 1. Euclidean spaces
(October 3, 017) 01. Review of metric spaces and point-set topology Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 017-18/01
More information1 Lyapunov theory of stability
M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability
More informationContents. Index... 15
Contents Filter Bases and Nets................................................................................ 5 Filter Bases and Ultrafilters: A Brief Overview.........................................................
More informationHybrid Systems Course Lyapunov stability
Hybrid Systems Course Lyapunov stability OUTLINE Focus: stability of an equilibrium point continuous systems decribed by ordinary differential equations (brief review) hybrid automata OUTLINE Focus: stability
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Supplement A: Mathematical background A.1 Extended real numbers The extended real number
More informationUniversity of Sheffield. School of Mathematics and Statistics. Metric Spaces MAS331/6352
University of Sheffield School of Mathematics and Statistics Metric Spaces MAS331/635 017 18 1 Metric spaces This course is entitled Metric spaces. You may be wondering what such a thing should be. We
More informations P = f(ξ n )(x i x i 1 ). i=1
Compactness and total boundedness via nets The aim of this chapter is to define the notion of a net (generalized sequence) and to characterize compactness and total boundedness by this important topological
More informationMath 201 Topology I. Lecture notes of Prof. Hicham Gebran
Math 201 Topology I Lecture notes of Prof. Hicham Gebran hicham.gebran@yahoo.com Lebanese University, Fanar, Fall 2015-2016 http://fs2.ul.edu.lb/math http://hichamgebran.wordpress.com 2 Introduction and
More informationEcon Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n
Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions
More informationR N Completeness and Compactness 1
John Nachbar Washington University in St. Louis October 3, 2017 R N Completeness and Compactness 1 1 Completeness in R. As a preliminary step, I first record the following compactness-like theorem about
More informationFunctional Analysis Exercise Class
Functional Analysis Exercise Class Week 2 November 6 November Deadline to hand in the homeworks: your exercise class on week 9 November 13 November Exercises (1) Let X be the following space of piecewise
More informationSome Function Problems SOLUTIONS Isabel Vogt Last Edited: May 24, 2013
Some Function Problems SOLUTIONS Isabel Vogt Last Edited: May 24, 23 Most of these problems were written for my students in Math 23a/b at Harvard in 2/22 and 22/23. They cover basic function theory, countability,
More informationSolutions to Problem Set 5 for , Fall 2007
Solutions to Problem Set 5 for 18.101, Fall 2007 1 Exercise 1 Solution For the counterexample, let us consider M = (0, + ) and let us take V = on M. x Let W be the vector field on M that is identically
More informationCourse on Hybrid Systems
Course on Hybrid Systems Maria Prandini Politecnico di Milano, Italy Organizer and lecturer: Maria Prandini Politecnico di Milano, Italy maria.prandini@polimi.it Additional lecturers: CONTACT INFO Goran
More informationControlling and Stabilizing a Rigid Formation using a few agents
Controlling and Stabilizing a Rigid Formation using a few agents arxiv:1704.06356v1 [math.ds] 20 Apr 2017 Abstract Xudong Chen, M.-A. Belabbas, Tamer Başar We show in this paper that a small subset of
More informationGELFAND S THEOREM. Christopher McMurdie. Advisor: Arlo Caine. Spring 2004
GELFAND S THEOREM Christopher McMurdie Advisor: Arlo Caine Super Advisor: Dr Doug Pickrell Spring 004 This paper is a proof of the first part of Gelfand s Theorem, which states the following: Every compact,
More informationDef. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =
CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and
More informationSolutions to Tutorial 8 (Week 9)
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 8 (Week 9) MATH3961: Metric Spaces (Advanced) Semester 1, 2018 Web Page: http://www.maths.usyd.edu.au/u/ug/sm/math3961/
More informationIntroduction to Proofs
Real Analysis Preview May 2014 Properties of R n Recall Oftentimes in multivariable calculus, we looked at properties of vectors in R n. If we were given vectors x =< x 1, x 2,, x n > and y =< y1, y 2,,
More informationMetric Spaces Lecture 17
Metric Spaces Lecture 17 Homeomorphisms At the end of last lecture an example was given of a bijective continuous function f such that f 1 is not continuous. For another example, consider the sets T =
More informationSwitched systems: stability
Switched systems: stability OUTLINE Switched Systems Stability of Switched Systems OUTLINE Switched Systems Stability of Switched Systems a family of systems SWITCHED SYSTEMS SWITCHED SYSTEMS a family
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationThe p-adic numbers. Given a prime p, we define a valuation on the rationals by
The p-adic numbers There are quite a few reasons to be interested in the p-adic numbers Q p. They are useful for solving diophantine equations, using tools like Hensel s lemma and the Hasse principle,
More informationEconomics 204 Fall 2012 Problem Set 3 Suggested Solutions
Economics 204 Fall 2012 Problem Set 3 Suggested Solutions 1. Give an example of each of the following (and prove that your example indeed works): (a) A complete metric space that is bounded but not compact.
More information1 The Local-to-Global Lemma
Point-Set Topology Connectedness: Lecture 2 1 The Local-to-Global Lemma In the world of advanced mathematics, we are often interested in comparing the local properties of a space to its global properties.
More informationBIBO STABILITY AND ASYMPTOTIC STABILITY
BIBO STABILITY AND ASYMPTOTIC STABILITY FRANCESCO NORI Abstract. In this report with discuss the concepts of bounded-input boundedoutput stability (BIBO) and of Lyapunov stability. Examples are given to
More informationMid Term-1 : Practice problems
Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to
More informationStochastic Hybrid Systems: Applications to Communication Networks
research supported by NSF Stochastic Hybrid Systems: Applications to Communication Networks João P. Hespanha Center for Control Engineering and Computation University of California at Santa Barbara Talk
More informationarxiv: v3 [math.ds] 9 Nov 2012
Positive expansive flows Alfonso Artigue November 13, 2018 arxiv:1210.3202v3 [math.ds] 9 Nov 2012 Abstract We show that every positive expansive flow on a compact metric space consists of a finite number
More informationPHY411 Lecture notes Part 5
PHY411 Lecture notes Part 5 Alice Quillen January 27, 2016 Contents 0.1 Introduction.................................... 1 1 Symbolic Dynamics 2 1.1 The Shift map.................................. 3 1.2
More information