An introduction to Mathematical Theory of Control

Size: px
Start display at page:

Download "An introduction to Mathematical Theory of Control"

Transcription

1 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 / 120

2 Introduction Since the beginnings of Calculus, differential equations have provided an effective mathematical model for a wide variety of physical phenomena. Consider a system whose state can be described by a finite number of real valued parameters, say x = (x 1, x 2,..., x n ). If the rate of change ẋ = dx dt is entirely determined by the state x itself, then the evolution of the system can be modelled by the ordinary differential equation ẋ = g (x). (1) If the state of the system is known at some initial time t 0, the future behavior for t > t 0 can then be determined by solving a problem of Cauchy consisting of (1) together with the initial condition x (t 0 ) = x 0. (2) Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

3 Introduction We are here taking a spectator s point of view: the mathematical model allows us to understand a portion of the physical word and predict its future evolution, but we have no means of altering its behavior in any way. Celestial mechanics provides a typical example of this situation. We can accurately calculate the orbits of moons and planets and exactly predict time and location of eclipses, but we cannot change them in the slightest amount. This classical point of view assumes that physical systems are isolated and all the information contained in them is completely accessible to the external observer. The mathematical model describes the evolution of the system taking into account its internal strengths and observations on the systems made from abroad but there is no way to interfere in this evolution. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

4 Introduction The failure of this framework turns out to be clear in front of the development of technology and engineering. The invention of machines and tools and their dissemination put the researcher in front of the reality of systems that can be easily guided from abroad in order to regulate its operation based on a pre-established project and with the specific objective to be realized. Mathematical models of these systems should take into account also the forces or impulses coming from abroad. Thus, comes the need to accept the modern point of view, where any physical system (machine, or chemical, biological or social process) is defined in a certain region of space and has its own dynamics in base which develops, exchanging continuously information with the external environment. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

5 Introduction Such exchange of information occurs through certain channels that are named generically inputs (if the information coming from the exterior to the system) and outputs (the information will be to the outside of the system). Graphically we can represent a system like u (t) x (t) The mathematical control theory is the theoretical basis for the study of physical systems equipped with inputs and outputs and provides a different paradigm. We now assume the presence of an external agent, namely a "controller" who can actively influence the evolution of the system. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

6 Introduction This new situation is modelled by a control system, ẋ = f (x, u), u (.) U (3) where U is a family of admissible control functions. In this case, the rate of change ẋ (t) depends not only of the state x itself, but also on some external parameters, say u = (u 1, u 2,..., u m ), which can also vary in time. The control function u (.) subject to some constraints, will be chosen by a controller in order to modify the evolution of the system and achieve certain preassigned goals: steer the system from a state to another, maximize the terminal value of one of the parameters, minimize a certain cost functional, etc. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

7 Introduction In a standard setting, we are given a set of control values U R m. The family of admissible control functions is defined as U := {u : R R m : u measurable, u (t) U for a. e. t} The control system (3) can be written as a differential inclusion, namely x F (x) (4) where, for each x, the set of possible velocities is given by F (x) := {y : y = f (x, u) for some u U}. (5) Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

8 Introduction An absolutely continuous function x : [0, T ] R n is said to be an admissible solution (or trajectory) of the control system (3) if there exists a measurable control u : [0, T ] U such that x (t) = f (x (t), u (t)) for almost every t [0, T ]. (6) By solution (or trajectory) of the differential inclusion (4) we mean any absolutely continuous function x : [0, T ] R n such that x (t) F (x (t)) for almost every t [0, T ]. (7) Clearly, every admissible trajectory of the control system (3) is also a solution of the differential inclusion (4). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

9 Introduction Under some regularity assumptions on f, given any solution of (4), one can select a measurable control u : [0, T ] U such that x (t) = f (x (t), u (t)) for almost every t [0, T ], that is, x is a trajectory of the control system (3). Differential inclusions often provide a convenient approach for the analysis of control systems, as we will see in what follows. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

10 Introduction The control law can be assigned in two basically different ways: in "open loop" form, as a function of time: t u (t), and in "closed loop" or "feedback", as a function of the state: x u (x). Implementing an open loop control u = u (t) is in a sense easier, since the only information needed is provided by a clock, measuring time. On the other hand, to implement a closed loop control u = u (x) one constantly needs to measure the state x of the system. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

11 Introduction Designing a feedback control, however yields to some distinct advantages. The feedback controls are more robust in the presence of random perturbations. For example, assume that we seek a control u (.) which steers the system described by (3) from an initial state P to the origin. This can be achieved say by an open loop control t u (t). In many practical situations, however, the evolution is influenced by additional disturbance which cannot be predicted in advance. The actual behavior of the system will be thus be governed by ẋ = f (x, u) + η (t), (8) where t η (t) is a perturbation term. In this case, if the open loop control u = u (t) steers the system (3) from an initial state P to the origin, this same control function may not accomplish the same task with (8), when a perturbation is present. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

12 Introduction Alternatively, one can solve the problem of steering the system described by (3) from an initial state P to the origin by mean of a closed loop control. In this case, we would seek a control function u = u (x) such that all the trajectories of the ordinary differential equation ẋ = g (x) := f (x, u (x)) (9) approach the origin as t. This approach is less sensitive to the presence of external disturbances. Two examples will be presented below, Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

13 Example 1: boat on the river Consider a river with a straight course, and using a set of planar coordinates, assume that it occupies the horizontal strip S := { (x 1, x 2 ) R 2 : < x 1 < +, 1 < x 2 < 1 }. Moreover, assume that speed of the water is given by the velocity vector v (x 1, x 2 ) = ( 1 x 2 2, 0 ). If a boat on the river is merely dragged by the current, its position will be determined by the differential equation (ẋ 1, ẋ 2 ) = ( 1 x 2 2, 0 ). On the other hand, if the boat is powered by an engine, then its motion can be modelled by the control system (ẋ 1, ẋ 2 ) = ( 1 x u 1, u 2 ), (10) where u = (u 1, u 2 ) describe the velocity of the boat relative to the water. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

14 Example 1 The set U of admissible controls consists of all measurable functions u : R R 2 taking values inside the closed disc { } U = (ω 1, ω 2 ) R 2 : ω 21 + ω22 M, (11) where M accounts for the maximum speed (in any direction) that can be produced by the engine. Given an initial condition (x 1, x 2 ) (0) = ( x 1, x 2 ) solving (10) one finds t t x 1 (t) = x 1 + t + u 1 (s) ds x t x 2 (t) = x 2 + u 2 (s) ds ( 1 x 2 1). 0 0 s 0 u 2 (τ) dτ 2 ds, Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

15 Example 1 In particular, the constant control u = (u 1, u 2 ) = ( 2 3, 1) takes the boat from a point ( x 1, 1) on one side of the river to the point ( x 1, 1) on the opposite side, in two units of time. Observe that if M > 0 then the boat can be steered from any point P of the river to any other point of the river (exercise: justify!) and that the admissible trajectories of the control system (10) (11) coincide with the solutions of the differential inclusion (ẋ 1, ẋ 2 ) F (x 1, x 2 ) = { (y 1, y 2 ) : (y x 22 )2 + y 22 M }. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

16 Example 2: cart on a rail Consider a cart which can move without friction along a straight rail. For simplicity assume that it has unit mass. Let y (0) = ȳ be its initial position and v (0) = v be its initial velocity. If no forces are present, its future position is simply given by y (t) = ȳ + t v. Next, assume that a controller is able to push the cart, with an external force u = u (t). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

17 Example 2 The evolution of the system is then determined by the second order equation (determined by the Newton law) ÿ = u (t). (12) Calling now x 1 (t) = y (t) and x 2 (t) = v (t), respectively the position and the velocity of the chart at time t, the equation (12) can be written as a first order control system { ẋ1 = x 2 (13) ẋ 2 = u Given the initial condition x 1 (0) = ȳ, x 2 (0) = v, solving (13) one finds t x 1 (t) = ȳ + t v + 0 t (t s) u (s) ds, x 2 (t) = v + 0 u (s) ds. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

18 Example 2 Assuming that the force satisfies the constraint u (t) 1, the control system (13) is equivalent to the differential inclusion (ẋ 1, ẋ 2 ) F (x 1, x 2 ) = {(x 2, ω) : 1 ω 1}. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

19 Example 2 We now consider the problem of steering the system at the origin (0, 0) R 2. In other words, we want the chart to be eventually at the origin with zero speed. For example, if the initial condition (ȳ, v) = (2, 2), this goal is achieved by the open-loop control 1 if 0 t 4 ū (t) = 1 if 4 t 6 0 if t 6. A direct calculation shows that (x 1 (t), x 2 (t)) = (0, 0) for t 6. However, the above control would not accomplish the same task in connection with (ȳ, v) = (2, 2) (exercise: verify!) Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

20 Example 2 A related problem is that of asymptotic stabilization: we seek a feedback control function u = u (x 1, x 2 ) such that for every initial data (ȳ, v) the corresponding solution of the Cauchy problem (ẋ 1, ẋ 2 ) = (x 2, u (x 1, x 2 )), (x 1, x 2 ) (0) = (ȳ, v) approaches the origin as t, that is, lim (x 1, x 2 ) (t) = (0, 0). t There are several feedback controls which accomplish this task. One is u (x 1, x 2 ) = x 1 x 2. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

21 Questions of interest In connection with a control system of the general form (3) several mathematical questions can be formulated. A first set of problems is concerned with the dynamics of the system. Given an initial state x, one would like to determine which other states x R n can be reached using the various admissible controls u U. More precisely, given a control function u = u (t), call x (., u) the solution of the Cauchy problem ẋ (t) = f (x (t), u (t)), x (0) = x, and define the reachable set at time t as R (t) = {x (t, u) : u U}. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

22 Questions of interest The closure, boundedness, convexity and the dimension of the set R (t) provide useful information on the control system. In addition, it is interesting to study whether R (t) is a neighborhood of the initial point x for all t > 0. In the positive case, the system is said to be small time locally controllable at x. Another important case is when R (t) includes the entire space t>0 R n. We then say that the system is globally controllable. The dependence of the reachable set R (t) on the time t and on the set of admissible controls U is also a subject of investigation. One may ask whether the same points in R (t) can be reached by using controls which are piecewise constant, or take values within the set of extreme points of U. Being able to perform the same tasks by mean of a smaller set of control functions, easier to implement, is quite relevant in practical applications. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

23 Questions of interest A second very important area of control theory is concerned with the optimal control. In many applications, among all strategies which accomplish a certain task, one seeks an optimal one, based on a given performance criterion. A performance criterion can be defined by an integral functional of the form J = T 0 L (t, x, u) dt, (14) and the values of J will have to be optimized among the admissible trajectories of (3), with a number of initial or terminal constraints. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

24 Questions of interest For example, among all controls which steer the system from the initial point x to some point on the target set T at time T, we may seek the one that minimize the cost functional (14). This problem is formulated as T min u U 0 L (t, x, u) dt, (15) subject to ẋ = f (x, u), x (0) = x, x (T ) T. (16) Observe that if (3) takes the simplest form ẋ = u, u (t) U = R n and if T = {ȳ} consists on just one point, then we do not have any constraint on the derivative ẋ. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

25 Questions of interest Our problem of optimal control thus reduces to the standard problem of the Calculus of Variations min x (.) T 0 L (t, x, ẋ) dt, x (0) = x, x (T ) = ȳ. (17) Roughly speaking, the main difference between the problem (15) (16) and (17) is that in (17) the derivative ẋ is not restricted, while in (15) (16) the derivative is constrained within the set F (x) := {y : y = f (x, u) for some u U}. The basic mathematical theory of optimal control has been concerned with the following main topics: existence of optimal controls; necessary conditions for the optimality of a control; suffi cient conditions for optimality. The next section will be dedicated to Carathéodory solutions to ordinary differential equations which arise from control systems, and to which the classical notion of solution is not appropriate. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

26 Normed vector spaces A real vector space is a nonempty set X endowed with two operations: + : X X X and : R X X satisfying the following conditions: 1 (x + y) + z = x + (y + z), x, y, z X ; 2 x + y = y + x, x, y X ; 3 there exists 0 X such that x + 0 = x, x X ; 4 for every x X there exists x X such that x + ( x) = 0 x X ; 5 (α + β) x = α x + β x, α, β R, x X ; 6 α (x + y) = α x + α y, α R, x, y X ; 7 1 x = x, x X (where 1 is the unit real number) 8 α (β x) = (αβ) x, α, β R, x X. We denote by (X, +, ) a vector space with the operations + and. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

27 Normed vector spaces A subset A of a vector space (X, +, ) is said to be convex if λx + (1 λ) y A,, x, y A and λ [0, 1]. Let (X, +, ) be a (real) vector space. A norm on X is a mapping. : X R with the following properties: (i) x = 0 if and only if x = 0; (ii) α x = α x α R, x X ; (iii) x + y x + y x, y X. If. is a norm on X then we say that (X,. ) is a vector normed space, or simply a normed space. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

28 Normed vector spaces Let (X,. ) be a normed space and for x 0 X and r > 0 let B r (x 0 ) = {x X : x x 0 < r} be the open ball centered at x 0 with radius r, and B r (x 0 ) = {x X : x x 0 r} be the closed ball centered at x 0 with radius r. Both the open and the closed balls centered at x 0 with radius r are convex set Indeed, if x, y B r (x 0 ) and 0 λ 1 then λx + (1 λ) y x 0 λ (x x 0 ) + (1 λ) (y x 0 ) = λ x x 0 + (1 λ) y x 0 < λr + (1 λ) r = r hence λx + (1 λ) y B r (x 0 ), and B r (x 0 ) is a convex set. The proof for B r (x 0 ) is similar. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

29 Normed vector spaces are metric spaces Recall that if (X,. ) is a normed space then d : X X R defined by d (x, y) = x y is a distance (or metric) on X, that is satisfies the following properties: (a) d (x, y) = 0 if and only if x = y; (b) d (x, y) = d (y, x) x, y X ; (c) d (x, y) d (x, z) + d (z, y) x, y, z X. If d : X X R satisfies (a), (b) and (c) then d is called a metric on X and (X, d) is said to be a metric space. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

30 Banach spaces Let (X,. ) be a normed space. A sequence (x n ) n 1 X is said to be convergent if there exists x X such that: for every ε > 0 there exists n ε N so that x n x < ε whenever n n ε. A sequence (x n ) n 1 X is said to a Cauchy sequence if for every ε > 0 there exists n ε N so that x n x m < ε whenever n, m n ε. We say that a normed space is complete if every Cauchy sequence is convergent. A complete normed vector space is called a Banach space. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

31 Examples of Banach spaces The finite dimensional space R n with the Euclidian norm x = n i=1 x i, if x = (x 1,..., x n ) R n ; The space C ([a, b], R n ) of all continuous functions f : [a, b] R n, with norm f = sup f (t) ; t [a,b] Given a subset Ω R m, we say that a map f : Ω R n is Lipschitz continuous if there exists a constant L such that f (x) f (y) L x y, x, y Ω. The space Lip (Ω, R n ) of all these Lipschitz continuous mappings is a Banach space with norm f Lip = sup f (x) + sup x Ω x =y f (x) f (y). x y Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

32 Examples of normed space which is not Banach spaces The space X = P ([0, 1]) of polynomial functions p : [0, 1] R with the norm p = sup p (t) t [0,1] is a normed space but not a Banach space Indeed, the sequence of polynomials p n (t) = n k=0 t k k! is a Cauchy sequence converges uniformly on [0, 1] hence also with respect to. to the continuous function f (t) = e t. Hence it is a Cauchy sequence in (C ([0, 1], R),. ), therefore also in (P ([0, 1]),. ). But its limit f (t) = e t, is not polynomial, that is,it has no limit in the space X = P ([0, 1]). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

33 Banach contraction mapping principle The next Banach s theorem show that for an equation, a unique solution exists and depends continuously on the parameters that describe the problem if the equation can be written in the form x = Φ (λ, x) (18) and the map x Φ (λ, x) is a contraction for each given value of the parameter λ, that is, for some κ < 1, Φ (λ, x) Φ (λ, y) κ x y, λ Λ, x, y X. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

34 Banach contraction mapping principle Theorem (contraction mapping principle) Let (X,. ) be a Banach space, Λ be a metric space and let Φ : Λ X X be a continuous mapping such that, for some κ < 1, Φ (λ, x) Φ (λ, y) κ x y, λ Λ, x, y X. (19) Then: (i) For each λ Λ there exists a unique x (λ) X such that (ii) The map λ x (λ) is continuous (iii) For any λ Λ, y X one has x (λ) = Φ (λ, x (λ)) (20) y x (λ) 1 y Φ (λ, y). (21) 1 κ Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

35 Proof of Banach contraction principle Fix any point y X. For each λ Λ, consider the sequence y k = y k (λ) defined by y 0 = y, y k+1 = Φ (λ, y k ) for k 0. By induction, for every k 0 one checks that y k+1 y k κ k y 1 y 0 = κ k y Φ (λ, y). (22) Since κ < 1, the sequence (y k ) k 0 is Cauchy in the Banach space X, hence it converges to some limit point, which we call x (λ). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

36 Proof of Banach contraction principle By the continuity of Φ (λ,.) we have hence (20) holds. x (λ) = lim k y k+1 = lim k Φ (λ, y k ) = Φ (λ, x (λ)), The uniqueness of x (λ) is proved observing that, if then by (19) it follows that x 1 = Φ (λ, x 1 ), x 2 = Φ (λ, x 2 ), x 1 x 2 = Φ (λ, x 1 ) Φ (λ, x 2 ) κ x 1 x 2. The assumption κ < 1 implies x 1 = x 2. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

37 Proof of Banach contraction principle Next, observe that (22) yields y k+1 y k i=0 y i+1 y i y Φ (λ, y) y Φ (λ, y) and letting k we obtain (21). i=0 κ i = k κ i i=0 y Φ (λ, y). 1 κ To show the continuity of λ x (λ) let (λ n ) n 1 be a sequence of parameters converging to λ. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

38 Proof of Banach contraction principle Using (21) with λ = λ n and y = x (λ ) we obtain x (λ ) x (λ n ) 1 1 κ x (λ ) Φ (λ n, x (λ )) = 1 1 κ Φ (λ, x (λ )) Φ (λ n, x (λ )) (23) and since λ Φ (λ, x) is continuous, the right-hand side of (23) tends to zero as n. Hence x (λ n ) x (λ ) proving the continuity of λ x (λ). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

39 Elements of Lebesgue measure theory If I = (a, b) is an open interval of R then the Lebesgue measure of I is defined by µ (I ) = b a. For any open set A R the Lebesgue measure is defined by { } µ (A) = sup µ (I j ) : I j A, I j open int., I j I k = if j = k. j J j J If F R is compact (that is, closed and bounded), then there exists an open and bounded interval I = (α, β) such that F I. Define then the Lebesgue measure of F by µ (F ) = µ (I ) µ (I \F ). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

40 Elements of Lebesgue measure theory If X R is any subset, then we define and µ (X ) = sup {µ (F ) : F compact X } µ (X ) = inf {µ (A) : A compact open, bounded and with X A}. We say that X is Lebesgue measurable if µ (X ) = µ (X ) and the common value is called the Lebesgue measure of X and denoted by µ (X ) : µ (X ) := µ (X ) = µ (X ). One has the following: Proposition: A subset X R is Lebesgue measurable if and only if for every ε > 0 there exists a compact K ε R and an open set A ε R such that K ε X A ε and µ (A ε \K ε ) < ε. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

41 Elements of Lebesgue measure theory Example: A finite or countable set A R is Lebesgue measurable and has a null measure. We denote by L the family of all Lebesgue measurable subsets of R and if I is an interval, we denote by L (I ) the family of all measurable subsets of I : L (I ) = {A L : A I }. Let I R be an interval. A function f : I R n is said to be Lebesgue measurable if for every open set V R n the preimage f 1 (V ) = {t I : f (t) V } is a Lebesgue measurable subset of I. Recall that f : I R n is said to be continuous if at each t 0 I, one has f (t 0 ) = lim t t0 f (t). f : I R n is said to be lower semicontinuous if at each t 0 I, one has f (t 0 ) lim inf t t 0 f (t). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

42 Elements of Lebesgue measure theory Remark: Every continuous or lower semicontinuous function, is measurable. We say that a property P holds almost everywhere (a.e. for short) on a set A R if there exists a set N R such that µ (N) = 0 and every point of A\N has the property P. Let (f n ) n 1 be a sequence of measurable functions, f n : I R n and if then the function f is measurable. f n (x) f (x) for a.e. x I If f : [a, b] R n is measurable and if f (t) φ (t) for all t [a, b] for some integrable scalar function φ, then f itself is integrable. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

43 Elements of Lebesgue measure theory If f and f differ only on a set of measure zero are identified. With this equivalence relation, the space of integrable functions f : [a, b] R n is written L 1 ([a, b], R n ) and it is a Banach space with norms f L 1 = b a f (t) dt. Lebesgue dominated convergence theorem: If (f n ) n 1 is a sequence of measurable functions which converges a.e. to f and if there exists an integrable function ψ such that f n (t) ψ (t) for all n 1 and t [a, b], then b a b f (t) dt = lim f n (t) dt n a Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

44 Elements of Lebesgue measure theory Characterization of measurable functions: For any function f [a, b] R n, the following statements are equivalent: (i) f is measurable (ii) For every ε > 0 there exists a compact set K ε [a, b] with and such that the restriction µ ([a, b] \K ε ) < ε f Kε is continuous. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

45 Elements of Lebesgue measure theory Absolutely continuous functions: A function f : [a, b] R n is said to be absolutely continuous if for every ε > 0 there exists δ > 0 such that for any finite family of disjoint intervals {]s i, t i ] : 1 i N} with total length N t i s i < δ one has i=1 N f (t i ) f (s i ) < ε. i=1 Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

46 Elements of Lebesgue measure theory If f : [a, b] R n is absolutely continuous, then its derivative f is defined almost everywhere and it satisfies t f (t) = f (t 0 ) + f (s) ds for all t, t 0 [a, b]. t 0 Every Lipschitz continuous function f defined on [a, b] is absolutely continuous. The set of all absolutely continuous functions f : [a, b] R n is denoted by AC ([a, b], R n ). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

47 Elements of multivalued analysis Assume (X, d) is a metric space. For x X and A X let d (x, A) be the distance from x to A defined by d (x, A) = inf {d (x, y) : y A}. If A X and ε > 0 then B (A, ε) denotes the ε neighborhood of A defined by B (A, ε) = {x X : d (x, A) ε}. If A = {x 0 } then B (A, ε) is the closed ball centered at x 0 with radius ε : B (x 0, ε) = {x X : d (x, x 0 ) ε}. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

48 Elements of multivalued analysis If A, B are two closed, bounded and nonempty subsets of X then the Hausdorff-Pompeiu distance between A and B is defined by { } d H (A, B) = max sup d (a, B), sup d (b, A). a A b B One has that d H (A, B) = inf { ε > 0 : B B (A, ε) and A B (B, ε) } = max {d (a, B), d (b, A) : a A and b B}. The space C (X ) of all closed, bounded and nonempty subsets of X endowed with the Hausdorff-Pompeiu distance d H is a metric space. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

49 Elements of multivalued analysis Let X and Y be two sets and let 2 Y = {A : A Y } be the family of all subsets of Y. By multifunction or multivalued map or set-valued map from X to Y we mean a map or correspondence which associate to each x X a unique subset F (x) of Y. The set F (x) is called the value of F at x. A multifunction F from X to Y will be denoted by F : X 2 Y. The set Gr (F ) = {(x, y) : x X, y F (x)} is called the graph of the multifunction F : X 2 Y. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

50 Elements of multivalued analysis Let X, Y be metric spaces. We say that F is closed, bounded, compact valued if its values are all closed, bounded or compact. We say that F : X 2 Y has closed graph if Gr (F ) is a closed subset of the product metric space X Y, which is equivalent to: if: x n X, x n x, y n F (x n ), y n y then y F (x). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

51 Elements of multivalued analysis Let F : X 2 Y be a multivalued map with closed and bounded values. We say that F is Hausdorff continuous at x 0 X if lim d H (F (x), F (x 0 )) = 0, x x 0 that is, for every ε > 0 there exists δ ε > 0 such that d H (F (x), F (x 0 )) < ε whenever x B (x 0, δ ε ). Let I R and let F : I 2 Rn be a multifunction. A function f : I R n is said to be a selection of F if f (t) F (t) for all t I. If f : I R n is a selection of F and if it is a measurable function then we say that f is a measurable selection of F. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

52 Elements of multivalued analysis In order to introduce the lexicografic measurable selection, we need to define the lexicographic order relation on R n : if x = (x 1, x 2,..., x n ) and y = (y 1, y 2,..., y n ) then we say that x < y if one of the following situations happens: x 1 < y 1 or x 1 = y 1 and x 2 < y 2 or... x 1 = y 1,...,x n 1 = y n 1, and x n < y n. One has the following: Proposition: If K R n is compact subset of R n then there there exists a first element ξ of K with respect to the lexicografic order, that is, there exists ξ K such that ξ < x for all x K. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

53 Elements of multivalued analysis If F : I 2 Rn is a multifunction with compact values then we can define the lexicographic selection t ξ (t) where ξ (t) F (t) is the first element of the compact set F (t) with respect to the lexicographic order. One has the following: Proposition If I = [a, b] and if F : I 2 Rn is a compact valued multifunction, with closed graph and if t ξ (t) is the lexicografic selection of F then t ξ (t) is a measurable selection. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

54 Carathéodory solutions As we already seen in the basic model of a control system a control system, ẋ = f (x, u) as soon as a control function u = u (t) from the family U of admissible controls is assigned, the evolution can be determined by solving the ordinary differential equation (ode, for short) ẋ = g (t, x) (24) where g (t, x) := f (x, u (t)). (25) Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

55 Classical solutions In the classical theory of ordinary differential equations like (24) we assume that the function g is continuous with respect to both the variable and the appropriate notion of solution is the one of "classical solution". Definition: Let Ω R R n be an open set and let g : Ω R n be a function which define the equation (24). A function ϕ : I R R n, with I an interval, is called a classical solution of (24) if ϕ C 1 (I, R n ), G (ϕ) := {(t, ϕ (t)) : t I } Ω and ϕ (t) = g (t, ϕ (t)) for all t I. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

56 Carathéodory solutions For the case of control systems, the function g defined by (25) follows to be only measurable with respect to t variable, so the notion of classical solution is not appropriate. We will use instead the notion of Carathéodory solution. Definition: Let Ω be an open set in R R n and let g : Ω R n be a function which define an equation like (24). A function ϕ : I R R n, with I an interval, is called a Carathéodory solution of (24) if ϕ AC (I, R n ), G (ϕ) := {(t, ϕ (t)) : t I } Ω and ϕ (t) = g (t, ϕ (t)) a.e t I. (26) Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

57 Carathéodory solutions: some remarks (i) An absolutely continuous function ϕ : [t 0, t 1 ] R n, is a Carathéodory solution of (24) if G (ϕ) := {(t, ϕ (t)) : t [t 0, t 1 ]} Ω and t x (t) = x (t 0 ) + g (s, x (s)) ds for every t t 0 [t 0, t 1 ]. (ii) Any classical solution is a Carathéodory solution (iii) The function ϕ : [ 1, 1] R defined by ϕ (t) = { t if t 0 t if t < 0 is a Carathéodory solution but not a classical solutions of x = 1, x (0) = 0. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

58 Existence of Carathéodory solutions We assume that the function g : Ω R R n R n satisfies the following conditions: (A) For every x the function t g (t, x) defined on the section Ω x = {t : (t, x) Ω} is measurable. For every t, the function x g (t, x) defined on the section Ω t = {x : (t, x) Ω} is continuous (B) For every compact K Ω there exist constants C K, L K such that g (t, x) C K, g (t, x) g (t, y) L K x y, for all (t, x), (t, y) K.. (27) For some (t 0, x 0 ) Ω we consider the Cauchy problem (g, t 0, x 0 ) : ẋ = g (t, x), x (t 0 ) = x 0. (28) Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

59 Existence of Carathéodory solutions Theorem (existence) Given a map g : Ω R n, consider the Cauchy problem (g, t 0, x 0 ) in (28) for some (t 0, x 0 ) Ω. (i) If g satisfies (A), (B), then there exists ε > 0 such that (28) has a local solution x (.) defined for t [t 0, t 0 + ε] (ii) Assume, in addition that the function g is defined in the entire space R R n and there exist constants C, L such that g (t, x) C, g (t, x) g (t, y) L x y (29) for all (t, x), (t, y) R R n. Then for every T > t 0, the Cauchy problem (28) has a global solution x (.) defined for all t [t 0, T ]. Moreover, the solution depends continuously on the initial data x 0. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

60 Proof of the Existence of Carathéodory solutions Assume that g satisfies (A) in R R n and (29). Let T > t 0. We shall construct a forward solution x = x x0 : [t 0, T ] R n. In view of applying Theorem 1 (the Banach contraction mapping principle) we define Λ = R n (the initial value x 0 R n plays here the role of a parameter). Let X be the space C ([t 0, T ], R n ) endowed with the weighted norm x + = sup e. 2Lt x (t), t [t 0,T ] which is equivalent to the usual C ([t 0, T ], R n ) norm defined by x = sup t [t0,t ] x (t),and define Φ : Λ X X by setting t Φ (x 0, w) (t) = x 0 + g (s, w (s)) ds, t [t 0, T ]. t 0 (30) Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

61 Proof of the Existence of Carathéodory solutions To prove that Φ is well defined, for each w X we need to show that the composite function s g (s, w (s)) is integrable. Let δ = T t 0. Given a function w X we consider the sequence of piecewise constant functions (w n ) n N with w n (t) = w ( t 0 + k δ ) [, t t 0 + k δ n n, t 0 + (k + 1) δ ], 0 k n 1 n By assumption (A), the maps t g (t, w n (t)) are all measurable. Moreover, (29) implies that lim g (t, w (t)) g (t, w n (t)) lim L w (t) w n (t) = 0, n n hence t g (t, w (t)) is measurable, being a pointwise limit of a sequence of measurable functions. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

62 Proof of the Existence of Carathéodory solutions Since g (s, w (s)) C for all s, it follows that the integral in (30) is well defined and depends continuously on t. Hence Φ is well defined and takes values inside X. The continuity of the map x 0 Φ (x 0, w) is obvious. To prove that w Φ (x 0, w) is a contraction in ( X,. + ), let w, w X and let By the definition of. + and (31), we have θ = w w +. (31) w (s) w (s) θe.2ls for all s [t 0, T ]. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

63 Proof of the Existence of Carathéodory solutions Moreover, by (29), for all t [t 0, T ], e. 2Lt Φ (x0, w (t)) Φ ( x 0, w (t) ) t = e 2Lt [ ( g (s, w (s)) g s, w (s) )] ds t 0 t e 2Lt L w (s) w (s) ds t 0 t e 2Lt Lθe 2Ls ds < δ t 0 2. Therefore, Φ (x 0, w) Φ ( x 0, w ) + 1 w w 2 +. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

64 Proof of the Existence of Carathéodory solutions We can now apply the Banach contraction mapping principle, obtaining the existence of a unique continuous mapping x 0 x x0 such that x x0 = Φ (x 0, x x0 ) that is, t x x0 (t) = x 0 + g (s, x x0 (s)) ds, t [t 0, T ]. t 0 This means that x x0 proof of (ii). is the required solutions, and this achieves the Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

65 Proof of the Existence of Carathéodory solutions To prove (i) concerning local existence of solution without the additional assumption (29), choose ε > 0 small enough so that the set K = {(t, x) : t t 0 ε, x x 0 ε} is entirely contained in Ω. Then consider a smooth cut-off function φ : R R n [0, 1] such that φ 1 on K, while φ 0 outside some larger compact set K, with K K Ω. Observe that the function { g + φ (t, x) g (t, x) if (t, x) Ω (t, x) = 0 if (t, x) / Ω satisfies (A) and (B), together with the extra assumption (29), because it vanishes outside the compact set K. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

66 Proof of the Existence of Carathéodory solutions By the previous steps, there exists a solution x (.) to the Cauchy problem x = g + (t, x), x (t 0 ) = x 0 defined on arbitrary large interval [t 0, T ]. We now recall that K is a neighborhood of (t 0, x 0 ). Therefore for some ε > 0 suffi ciently small, the point (t, x (t)) remains in K as t [t 0, t 0 + ε]. Since g and g + coincide on K, the function x (.) thus provides a local solution to the original problem (g, t 0, x 0 ) on the interval [t 0, t 0 + ε]. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

67 Uniqueness of Carathéodory solutions The next lemma represents a main ingredient in several uniqueness proofs and it is a simplified version of Gronwall s lemma: Lemma (Gronwall) Let z (.) be an absolutely continuous nonnegative function such that z (t 0 ) γ, ż (t) α (t) z (t) + β (t) for a.e. t [0, T ], (32) for some integrable functions α, β and some constant γ 0. Then z satisfies the inequality t t z (t) γe α(s)ds 0 + t t 0 t β (s) e s α(u)du ds for all t [0, T ]. (33) Theorem (uniqueness) Let g : Ω R n satisfies (A) and (B), as in the existence Theorem. Let x 1 (.), x 2 (.) be solutions of (28), defined on the intervals [t 0, t 1 ], [t 0, t 2 ] respectively. If T = min {t 1, t 2 }, then x 1 (t) = x 2 (t) for all t [t 0, T ]. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

68 Proof of the uniqueness of Carathéodory solutions Since g satisfies assumption (B), for the compact set K = {(t, x 1 (t)) : t [t 0, T ]} {(t, x 2 (t)) : t [t 0, T ]} there exists L K 0 such that g (t, x) g (t, y) L K x y for all (t, x), (t, y) K. For all t [t 0, T ] = [t 0, t 1 ] [t 0, t 2 ] let z (t) = x 1 (t) x 2 (t). One has that z (.) is absolutely continuous and ż (t) ẋ 1 (t) ẋ 2 (t) L K z (t) for almost all t [t 0, T ]. Applying Gronwall s lemma with α = L K, β = γ = 0 we obtain that z (t) 0 for all t [t 0, T ]. Hence z (t) = x 1 (t) x 2 (t) = 0 for all t [t 0, T ]. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

69 Characterization of maximal solutions Let g : Ω R R n R n. In general, a solution to the Cauchy problem ẋ = g (t, x), x (t 0 ) = x 0 (34) is defined only locally, for t in a neighborhood of the initial time t 0. If a solution cannot be extended beyong a certain time T, two cases may arise: (i) as t T, the point (t, x (t)) approaches the boundary Ω of the domain Ω; (ii) as t T, the solution blows up, that is x (t). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

70 Characterization of maximal solutions Theorem Let Ω R R n be an open set, g : Ω R n satisfies the basic assumptions (A) and (B), (t 0, x 0 ) Ω and let T = sup {τ : (34) has a solution defined on [t 0, τ]}. Then either T = + or lim t T [ x (t) + ] 1 = +, (35) d ((t, x (t)), Ω) where d ((t, x), Ω) = inf { t s + x y : (s, y) Ω}. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

71 Characterization of maximal solutions Proof: Assume that T <. If (35) does not hold, then there exist M > 0, ε > 0 and a sequence t n T as n, such that x (t n ) M, d ((t n, x (t n )), Ω) ε. By possibly taking a subsequence, we can assume that x (t n ) converges to a point x as n, with (T, x ) Ω. Let ρ > 0 so small that the cylinder is entirely contained in Ω. K = {(t, x) : t T ρ, x x 0 ρ} Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

72 Characterization of maximal solutions Consider a smooth cut-off function φ : R R n [0, 1] such that φ 1 on K, while φ 0 outside some larger compact set K, with K K Ω, and define g + (t, x) = { φ (t, x) g (t, x) if (t, x) Ω 0 if (t, x) / Ω (36) Then g + g on K, and in addition g + satisfies the global bounds C, L such that g + (t, x) C, g + (t, x) g + (t, y) L x y for all (t, x), (t, y) R R n, for some constants L, C 1. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

73 Characterization of maximal solutions Fix δ > 0 small enough so that (2C + 1) δ ρ, and choose n so large that x (t n ) x δ, T t n δ. By (ii) of the existence Theorem, the Cauchy problem y = g + (t, y), x (t n ) = x (t n ) has a solution y (.) defined on [t n, T + δ]. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

74 Characterization of maximal solutions We can now define an extension x of x by setting { x (t) if t0 t t x (t) = n y (t) if t n t T + δ. Since y (t) C for t [t n, T + δ], we have y (t) x y (t) x (t n ) + x (t n ) x C (t t n ) + δ 2C δ + δ ρ. Therefore, for all t [t n, T + δ], the point (t, y (t)) remains inside the compact K where g and g + coincide. The function x (.) thus provide a solution of the original problem (34), defined on a strictly larger interval [t 0, T + δ]. This contradicts the maximality of T, thus proving the theorem. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

75 Nonlinear control systems We consider the control system x = f (t, x, u), u (.) U (37) where the set of admissible controls is defined as U := {u : R R m : u measurable, u (t) U for all t} (38) We shall assume the following basic hypothesis: (H) : The set U R m of control values is compact, Ω R R n is an open set, the function f : Ω U R n is continuous in all variables and continuously differentiable with respect to x. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

76 Trajectory of nonlinear control systems Definition: An absolutely continuous function x : [a, b] R n is said to be a solution (or trajectory) of (37) if its graph {(t, x (t)) : t [0, T ]} is entirely contained in Ω, and if there exists a measurable control u : [a, b] U such that x (t) = f (t, x (t), u (t)) for almost every t [a, b]. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

77 An equivalent differential inclusion In connection with (37), define the multifunction F : Ω P (R n ) by and consider the differential inclusion F (t, x) = {f (t, x, ω) : ω U} (39) x F (t, x). (40) Definition: We call solution or trajectory of the differential inclusion (40) any absolutely continuous function x : [a, b] R n whose graph {(t, x (t)) : t [a, b]} is entirely contained in Ω, and x (t) F (t, x (t)) for almost every t [a, b]. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

78 An equivalent differential inclusion Observe that, for each (t, x), the set of admissible velocities x in (37) is given in parametrized form, as the image of a fixed set U R n. On the other hand, when we study the differential inclusion (40), we do not assume any parametrization. The next result due to Filippov, shows that the two approaches are essentially equivalent. Filippov s lemma An absolutely continuous function x : [a, b] R n is a trajectory of the control system (37) if and only if it is a trajectory of the differential inclusion (40) with F (t, x) defined by (39). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

79 Proof of Filippov s lemma If x : [a, b] R n is a trajectory of the control system (37) then its graph is entirely contained in Ω, and if there exists a measurable control u : [a, b] U such that Then x (t) = f (t, x (t), u (t)) for almost every t [a, b]. x (t) = f (t, x (t), u (t)) F (t, x (t)) for almost every t [a, b], hence it is a trajectory of the differential inclusion (40). Assume now that x : [a, b] R n is a trajectory of the differential inclusion (40). Then x (t) F (t, x (t)) for almost every t [a, b]. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

80 Proof of Filippov s lemma Fix any ω U and define the multifunction W : [a, b] 2 Rn by { {ω U : f (t, x (t), ω) = x W (t) = (t)} if x (t) F (t, x (t)) {ω} otherwise. Remark that W (t) is a compact subset and W (t) = {ω} for t in a set of null Lebesgue measure. Let u (t) be the first element of W (t). Then by Proposition 2 of Section 2 one has that t u (t) is measurable, u (t) W (t) hence x (t) = f (t, x (t), u (t)), and x (.) is a trajectory of the control system (37). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

81 Fundamental properties of trajectories Let f, U satisfy the basic assumption (H) and let (0, x) Ω. For any measurable control u : [0, T ] U, the Cauchy problem x = f (t, x, u (t)), x (0) = x (41) is equivalent to x = g (t, x), x (0) = x. (42) where g (t, x) = f (t, x, u (t)) is suffi ciently regular to have a local solution x (., u) : [0, δ] R n of (42). Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

82 Fundamental properties of trajectories To study how the solution x (., u) depends on u, we first consider the globally bounded case, assuming (H ) : The set U R m of control values is compact, the function f : R R n U R n is continuous in all variables and continuously differentiable with respect to x and satisfies f (t, x, ω) C, D x f (t, x, ω) L, (43) for some constants C, L 0 and all (t, x, ω) R R n U. Then we have the following global existence and continuous dependence result: Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

83 Fundamental properties of trajectories Theorem (imput-output map): Let the assumption (H ) be satisfied. Then, for every T > 0 and u U the Cauchy problem (41) has a unique solution x (., u) : [0, T ] R n. The imput-output map u x (., u) is continuous from L 1 ([0, T ], R m ) to C ([0, T ], R n ) (the space of continuous functions from [0, T ] into R n. The continuous dependence of trajectories on the control is a useful basic result. Consider now a sequence of admissible controls (u n ) n N such that the sequence of the corresponding solutions (x (., u n )) n N converge to x (.) uniformly on [0, T ]. A natural question is whether the function x is a solution of the original problem. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

84 Fundamental properties of trajectories Example: Consider the system and for t R define x (t) = u (t), x (0) = 0, u (t) { 1, 1} a.e. (44) u n (t) = { 1 if sin (nt) 0 1 if sin (nt) < 0. Then x (., u n ) converges to x 0 uniformly for all t R but x 0 is not a trajectory of (44). We can conclude that the set of trajectories of (44) is not closed. Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May / 120

Recent Trends in Differential Inclusions

Recent Trends in Differential Inclusions Recent Trends in Alberto Bressan Department of Mathematics, Penn State University (Aveiro, June 2016) (Aveiro, June 2016) 1 / Two main topics ẋ F (x) differential inclusions with upper semicontinuous,

More information

at time t, in dimension d. The index i varies in a countable set I. We call configuration the family, denoted generically by Φ: U (x i (t) x j (t))

at time t, in dimension d. The index i varies in a countable set I. We call configuration the family, denoted generically by Φ: U (x i (t) x j (t)) Notations In this chapter we investigate infinite systems of interacting particles subject to Newtonian dynamics Each particle is characterized by its position an velocity x i t, v i t R d R d at time

More information

Nonlinear Control Systems

Nonlinear Control Systems Nonlinear Control Systems António Pedro Aguiar pedro@isr.ist.utl.pt 3. Fundamental properties IST-DEEC PhD Course http://users.isr.ist.utl.pt/%7epedro/ncs2012/ 2012 1 Example Consider the system ẋ = f

More information

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem 56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi

More information

(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε

(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε 1. Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional

More information

LECTURE 15: COMPLETENESS AND CONVEXITY

LECTURE 15: COMPLETENESS AND CONVEXITY LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other

More information

1 Lyapunov theory of stability

1 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 information

Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping.

Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping. Minimization Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping. 1 Minimization A Topological Result. Let S be a topological

More information

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is

More information

s P = f(ξ n )(x i x i 1 ). i=1

s 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 information

Functional Differential Equations with Causal Operators

Functional Differential Equations with Causal Operators ISSN 1749-3889 (print), 1749-3897 (online) International Journal of Nonlinear Science Vol.11(211) No.4,pp.499-55 Functional Differential Equations with Causal Operators Vasile Lupulescu Constantin Brancusi

More information

ASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN MODULAR FUNCTION SPACES ABSTRACT

ASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN MODULAR FUNCTION SPACES ABSTRACT ASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN MODULAR FUNCTION SPACES T. DOMINGUEZ-BENAVIDES, M.A. KHAMSI AND S. SAMADI ABSTRACT In this paper, we prove that if ρ is a convex, σ-finite modular function satisfying

More information

From now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.

From now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1. Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x

More information

THEOREMS, ETC., FOR MATH 515

THEOREMS, ETC., FOR MATH 515 THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every

More information

Dynamic Blocking Problems for a Model of Fire Propagation

Dynamic Blocking Problems for a Model of Fire Propagation Dynamic Blocking Problems for a Model of Fire Propagation Alberto Bressan Department of Mathematics, Penn State University, University Park, Pa 16802, USA bressan@mathpsuedu February 6, 2012 Abstract This

More information

16 1 Basic Facts from Functional Analysis and Banach Lattices

16 1 Basic Facts from Functional Analysis and Banach Lattices 16 1 Basic Facts from Functional Analysis and Banach Lattices 1.2.3 Banach Steinhaus Theorem Another fundamental theorem of functional analysis is the Banach Steinhaus theorem, or the Uniform Boundedness

More information

2 Statement of the problem and assumptions

2 Statement of the problem and assumptions Mathematical Notes, 25, vol. 78, no. 4, pp. 466 48. Existence Theorem for Optimal Control Problems on an Infinite Time Interval A.V. Dmitruk and N.V. Kuz kina We consider an optimal control problem on

More information

B. Appendix B. Topological vector spaces

B. Appendix B. Topological vector spaces B.1 B. Appendix B. Topological vector spaces B.1. Fréchet spaces. In this appendix we go through the definition of Fréchet spaces and their inductive limits, such as they are used for definitions of function

More information

LMI Methods in Optimal and Robust Control

LMI Methods in Optimal and Robust Control LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear

More information

NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES

NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES JONATHAN LUK These notes discuss theorems on the existence, uniqueness and extension of solutions for ODEs. None of these results are original. The proofs

More information

Stabilization of Control-Affine Systems by Local Approximations of Trajectories

Stabilization of Control-Affine Systems by Local Approximations of Trajectories Stabilization of Control-Affine Systems by Local Approximations of Trajectories Raik Suttner arxiv:1805.05991v2 [math.ds] 9 Jun 2018 We study convergence and stability properties of control-affine systems.

More information

Metric Spaces and Topology

Metric 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 information

Part III. 10 Topological Space Basics. Topological Spaces

Part 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 information

An introduction to some aspects of functional analysis

An introduction to some aspects of functional analysis An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms

More information

MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES

MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES PETE L. CLARK 4. Metric Spaces (no more lulz) Directions: This week, please solve any seven problems. Next week, please solve seven more. Starred parts of

More information

MAS3706 Topology. Revision Lectures, May I do not answer enquiries as to what material will be in the exam.

MAS3706 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 information

Mathematics for Economists

Mathematics for Economists Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples

More information

Notes on uniform convergence

Notes on uniform convergence Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean

More information

i=1 β i,i.e. = β 1 x β x β 1 1 xβ d

i=1 β i,i.e. = β 1 x β x β 1 1 xβ d 66 2. Every family of seminorms on a vector space containing a norm induces ahausdorff locally convex topology. 3. Given an open subset Ω of R d with the euclidean topology, the space C(Ω) of real valued

More information

Real Analysis Notes. Thomas Goller

Real Analysis Notes. Thomas Goller Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................

More information

Research Article Solvability of a Class of Integral Inclusions

Research Article Solvability of a Class of Integral Inclusions Abstract and Applied Analysis Volume 212, Article ID 21327, 12 pages doi:1.1155/212/21327 Research Article Solvability of a Class of Integral Inclusions Ying Chen and Shihuang Hong Institute of Applied

More information

ANALYSIS QUALIFYING EXAM FALL 2017: SOLUTIONS. 1 cos(nx) lim. n 2 x 2. g n (x) = 1 cos(nx) n 2 x 2. x 2.

ANALYSIS QUALIFYING EXAM FALL 2017: SOLUTIONS. 1 cos(nx) lim. n 2 x 2. g n (x) = 1 cos(nx) n 2 x 2. x 2. ANALYSIS QUALIFYING EXAM FALL 27: SOLUTIONS Problem. Determine, with justification, the it cos(nx) n 2 x 2 dx. Solution. For an integer n >, define g n : (, ) R by Also define g : (, ) R by g(x) = g n

More information

Tools from Lebesgue integration

Tools from Lebesgue integration Tools from Lebesgue integration E.P. van den Ban Fall 2005 Introduction In these notes we describe some of the basic tools from the theory of Lebesgue integration. Definitions and results will be given

More information

2. The Concept of Convergence: Ultrafilters and Nets

2. 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 information

l(y j ) = 0 for all y j (1)

l(y j ) = 0 for all y j (1) Problem 1. The closed linear span of a subset {y j } of a normed vector space is defined as the intersection of all closed subspaces containing all y j and thus the smallest such subspace. 1 Show that

More information

Overview of normed linear spaces

Overview of normed linear spaces 20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural

More information

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable

More information

ON THE ESSENTIAL BOUNDEDNESS OF SOLUTIONS TO PROBLEMS IN PIECEWISE LINEAR-QUADRATIC OPTIMAL CONTROL. R.T. Rockafellar*

ON THE ESSENTIAL BOUNDEDNESS OF SOLUTIONS TO PROBLEMS IN PIECEWISE LINEAR-QUADRATIC OPTIMAL CONTROL. R.T. Rockafellar* ON THE ESSENTIAL BOUNDEDNESS OF SOLUTIONS TO PROBLEMS IN PIECEWISE LINEAR-QUADRATIC OPTIMAL CONTROL R.T. Rockafellar* Dedicated to J-L. Lions on his 60 th birthday Abstract. Primal and dual problems of

More information

Continuity of convex functions in normed spaces

Continuity of convex functions in normed spaces Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional

More information

1 Directional Derivatives and Differentiability

1 Directional Derivatives and Differentiability Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=

More information

Notions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy

Notions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.

More information

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

g 2 (x) (1/3)M 1 = (1/3)(2/3)M. COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is

More information

Math General Topology Fall 2012 Homework 11 Solutions

Math General Topology Fall 2012 Homework 11 Solutions Math 535 - General Topology Fall 2012 Homework 11 Solutions Problem 1. Let X be a topological space. a. Show that the following properties of a subset A X are equivalent. 1. The closure of A in X has empty

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered

More information

Implications of the Constant Rank Constraint Qualification

Implications of the Constant Rank Constraint Qualification Mathematical Programming manuscript No. (will be inserted by the editor) Implications of the Constant Rank Constraint Qualification Shu Lu Received: date / Accepted: date Abstract This paper investigates

More information

Topological properties

Topological properties CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological

More information

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................

More information

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability... Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................

More information

Characterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets

Characterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets Convergence in Metric Spaces Functional Analysis Lecture 3: Convergence and Continuity in Metric Spaces Bengt Ove Turesson September 4, 2016 Suppose that (X, d) is a metric space. A sequence (x n ) X is

More information

2.1 Dynamical systems, phase flows, and differential equations

2.1 Dynamical systems, phase flows, and differential equations Chapter 2 Fundamental theorems 2.1 Dynamical systems, phase flows, and differential equations A dynamical system is a mathematical formalization of an evolutionary deterministic process. An evolutionary

More information

We denote the space of distributions on Ω by D ( Ω) 2.

We denote the space of distributions on Ω by D ( Ω) 2. Sep. 1 0, 008 Distributions Distributions are generalized functions. Some familiarity with the theory of distributions helps understanding of various function spaces which play important roles in the study

More information

THEOREMS, ETC., FOR MATH 516

THEOREMS, ETC., FOR MATH 516 THEOREMS, ETC., FOR MATH 516 Results labeled Theorem Ea.b.c (or Proposition Ea.b.c, etc.) refer to Theorem c from section a.b of Evans book (Partial Differential Equations). Proposition 1 (=Proposition

More information

u( x) = g( y) ds y ( 1 ) U solves u = 0 in U; u = 0 on U. ( 3)

u( x) = g( y) ds y ( 1 ) U solves u = 0 in U; u = 0 on U. ( 3) M ath 5 2 7 Fall 2 0 0 9 L ecture 4 ( S ep. 6, 2 0 0 9 ) Properties and Estimates of Laplace s and Poisson s Equations In our last lecture we derived the formulas for the solutions of Poisson s equation

More information

Introduction and Preliminaries

Introduction and Preliminaries Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis

More information

1.2 Fundamental Theorems of Functional Analysis

1.2 Fundamental Theorems of Functional Analysis 1.2 Fundamental Theorems of Functional Analysis 15 Indeed, h = ω ψ ωdx is continuous compactly supported with R hdx = 0 R and thus it has a unique compactly supported primitive. Hence fφ dx = f(ω ψ ωdy)dx

More information

PROBLEMS. (b) (Polarization Identity) Show that in any inner product space

PROBLEMS. (b) (Polarization Identity) Show that in any inner product space 1 Professor Carl Cowen Math 54600 Fall 09 PROBLEMS 1. (Geometry in Inner Product Spaces) (a) (Parallelogram Law) Show that in any inner product space x + y 2 + x y 2 = 2( x 2 + y 2 ). (b) (Polarization

More information

1 The Observability Canonical Form

1 The Observability Canonical Form NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)

More information

Continuous Functions on Metric Spaces

Continuous Functions on Metric Spaces Continuous Functions on Metric Spaces Math 201A, Fall 2016 1 Continuous functions Definition 1. Let (X, d X ) and (Y, d Y ) be metric spaces. A function f : X Y is continuous at a X if for every ɛ > 0

More information

Locally Lipschitzian Guiding Function Method for ODEs.

Locally Lipschitzian Guiding Function Method for ODEs. Locally Lipschitzian Guiding Function Method for ODEs. Marta Lewicka International School for Advanced Studies, SISSA, via Beirut 2-4, 3414 Trieste, Italy. E-mail: lewicka@sissa.it 1 Introduction Let f

More information

Some Background Material

Some 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 information

A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION

A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION O. SAVIN. Introduction In this paper we study the geometry of the sections for solutions to the Monge- Ampere equation det D 2 u = f, u

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction 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 information

What to remember about metric spaces

What to remember about metric spaces Division of the Humanities and Social Sciences What to remember about metric spaces KC Border These notes are (I hope) a gentle introduction to the topological concepts used in economic theory. If the

More information

The Skorokhod reflection problem for functions with discontinuities (contractive case)

The Skorokhod reflection problem for functions with discontinuities (contractive case) The Skorokhod reflection problem for functions with discontinuities (contractive case) TAKIS KONSTANTOPOULOS Univ. of Texas at Austin Revised March 1999 Abstract Basic properties of the Skorokhod reflection

More information

SMSTC (2017/18) Geometry and Topology 2.

SMSTC (2017/18) Geometry and Topology 2. SMSTC (2017/18) Geometry and Topology 2 Lecture 1: Differentiable Functions and Manifolds in R n Lecturer: Diletta Martinelli (Notes by Bernd Schroers) a wwwsmstcacuk 11 General remarks In this lecture

More information

Extremal Solutions of Differential Inclusions via Baire Category: a Dual Approach

Extremal Solutions of Differential Inclusions via Baire Category: a Dual Approach Extremal Solutions of Differential Inclusions via Baire Category: a Dual Approach Alberto Bressan Department of Mathematics, Penn State University University Park, Pa 1682, USA e-mail: bressan@mathpsuedu

More information

for all subintervals I J. If the same is true for the dyadic subintervals I D J only, we will write ϕ BMO d (J). In fact, the following is true

for all subintervals I J. If the same is true for the dyadic subintervals I D J only, we will write ϕ BMO d (J). In fact, the following is true 3 ohn Nirenberg inequality, Part I A function ϕ L () belongs to the space BMO() if sup ϕ(s) ϕ I I I < for all subintervals I If the same is true for the dyadic subintervals I D only, we will write ϕ BMO

More information

Topology, 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, 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 information

Functional Analysis HW #3

Functional Analysis HW #3 Functional Analysis HW #3 Sangchul Lee October 26, 2015 1 Solutions Exercise 2.1. Let D = { f C([0, 1]) : f C([0, 1])} and define f d = f + f. Show that D is a Banach algebra and that the Gelfand transform

More information

L p Spaces and Convexity

L p Spaces and Convexity L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function

More information

Convex Analysis and Economic Theory Winter 2018

Convex 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 information

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books. Applied Analysis APPM 44: Final exam 1:3pm 4:pm, Dec. 14, 29. Closed books. Problem 1: 2p Set I = [, 1]. Prove that there is a continuous function u on I such that 1 ux 1 x sin ut 2 dt = cosx, x I. Define

More information

Convex Geometry. Carsten Schütt

Convex Geometry. Carsten Schütt Convex Geometry Carsten Schütt November 25, 2006 2 Contents 0.1 Convex sets... 4 0.2 Separation.... 9 0.3 Extreme points..... 15 0.4 Blaschke selection principle... 18 0.5 Polytopes and polyhedra.... 23

More information

The Dirichlet s P rinciple. In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation:

The Dirichlet s P rinciple. In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation: Oct. 1 The Dirichlet s P rinciple In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation: 1. Dirichlet s Principle. u = in, u = g on. ( 1 ) If we multiply

More information

Set, functions and Euclidean space. Seungjin Han

Set, functions and Euclidean space. Seungjin Han Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,

More information

The Caratheodory Construction of Measures

The Caratheodory Construction of Measures Chapter 5 The Caratheodory Construction of Measures Recall how our construction of Lebesgue measure in Chapter 2 proceeded from an initial notion of the size of a very restricted class of subsets of R,

More information

Analysis in weighted spaces : preliminary version

Analysis in weighted spaces : preliminary version Analysis in weighted spaces : preliminary version Frank Pacard To cite this version: Frank Pacard. Analysis in weighted spaces : preliminary version. 3rd cycle. Téhéran (Iran, 2006, pp.75.

More information

INTRODUCTION TO REAL ANALYTIC GEOMETRY

INTRODUCTION TO REAL ANALYTIC GEOMETRY INTRODUCTION TO REAL ANALYTIC GEOMETRY KRZYSZTOF KURDYKA 1. Analytic functions in several variables 1.1. Summable families. Let (E, ) be a normed space over the field R or C, dim E

More information

Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence

Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations

More information

On Discontinuous Differential Equations

On Discontinuous Differential Equations On Discontinuous Differential Equations Alberto Bressan and Wen Shen S.I.S.S.A., Via Beirut 4, Trieste 3414 Italy. Department of Informatics, University of Oslo, P.O. Box 18 Blindern, N-316 Oslo, Norway.

More information

Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm

Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm Chapter 13 Radon Measures Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm (13.1) f = sup x X f(x). We want to identify

More information

Existence and Uniqueness

Existence and Uniqueness Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect

More information

Econ Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n

Econ 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 information

(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define

(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that

More information

The Implicit Function and Inverse Function Theorems

The Implicit Function and Inverse Function Theorems The Implicit Function and Inverse Function Theorems Selina Klien 12. November 2015 Selina Klien Implicit Functions and Solution Mappings 12. November 2015 1 / 45 Outline 1 Introduction Important s 2 Implicit

More information

FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets

FUNCTIONAL 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 information

Preliminary Exam 2018 Solutions to Morning Exam

Preliminary Exam 2018 Solutions to Morning Exam Preliminary Exam 28 Solutions to Morning Exam Part I. Solve four of the following five problems. Problem. Consider the series n 2 (n log n) and n 2 (n(log n)2 ). Show that one converges and one diverges

More information

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )

More information

Homework If the inverse T 1 of a closed linear operator exists, show that T 1 is a closed linear operator.

Homework If the inverse T 1 of a closed linear operator exists, show that T 1 is a closed linear operator. Homework 3 1 If the inverse T 1 of a closed linear operator exists, show that T 1 is a closed linear operator Solution: Assuming that the inverse of T were defined, then we will have to have that D(T 1

More information

Sobolev Spaces. Chapter Hölder spaces

Sobolev Spaces. Chapter Hölder spaces Chapter 2 Sobolev Spaces Sobolev spaces turn out often to be the proper setting in which to apply ideas of functional analysis to get information concerning partial differential equations. Here, we collect

More information

A FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS

A FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS Fixed Point Theory, (0), No., 4-46 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html A FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS A. ABKAR AND M. ESLAMIAN Department of Mathematics,

More information

Half of Final Exam Name: Practice Problems October 28, 2014

Half of Final Exam Name: Practice Problems October 28, 2014 Math 54. Treibergs Half of Final Exam Name: Practice Problems October 28, 24 Half of the final will be over material since the last midterm exam, such as the practice problems given here. The other half

More information

1 Lesson 1: Brunn Minkowski Inequality

1 Lesson 1: Brunn Minkowski Inequality 1 Lesson 1: Brunn Minkowski Inequality A set A R n is called convex if (1 λ)x + λy A for any x, y A and any λ [0, 1]. The Minkowski sum of two sets A, B R n is defined by A + B := {a + b : a A, b B}. One

More information

Threshold solutions and sharp transitions for nonautonomous parabolic equations on R N

Threshold solutions and sharp transitions for nonautonomous parabolic equations on R N Threshold solutions and sharp transitions for nonautonomous parabolic equations on R N P. Poláčik School of Mathematics, University of Minnesota Minneapolis, MN 55455 Abstract This paper is devoted to

More information

On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q)

On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) Andreas Löhne May 2, 2005 (last update: November 22, 2005) Abstract We investigate two types of semicontinuity for set-valued

More information

Functional Analysis Exercise Class

Functional 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 information

The weak topology of locally convex spaces and the weak-* topology of their duals

The weak topology of locally convex spaces and the weak-* topology of their duals The weak topology of locally convex spaces and the weak-* topology of their duals Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 3, 2014 1 Introduction These notes

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

Nonlinear Dynamical Systems Lecture - 01

Nonlinear Dynamical Systems Lecture - 01 Nonlinear Dynamical Systems Lecture - 01 Alexandre Nolasco de Carvalho August 08, 2017 Presentation Course contents Aims and purpose of the course Bibliography Motivation To explain what is a dynamical

More information

Examples of Dual Spaces from Measure Theory

Examples of Dual Spaces from Measure Theory Chapter 9 Examples of Dual Spaces from Measure Theory We have seen that L (, A, µ) is a Banach space for any measure space (, A, µ). We will extend that concept in the following section to identify an

More information