OPTIMAL CONTROL PROBLEMS WITH VARIABLE ENDPOINTS
|
|
|
- Leonard Hall
- 9 years ago
- Views:
Transcription
1 PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON DYNAMICAL SYSTEMS AND DIFFERENTIAL EQUATIONS May 24 27, 2002, Wilmington, NC, USA pp OPTIMAL CONTROL PROBLEMS WITH VARIABLE ENDPOINTS BAVO LANGEROCK Abstract. In a previous paper [5] we have proven a geometric formulation of the maximum principle for non-autonomous optimal control problems with fixed endpoint conditions. In this paper we shall reconsider and extend some results from [5] in order to obtain the maximum principle for optimal control problems with variable endpoint conditions. We only consider the case where one of the endpoints may vary, whereas the other is kept fixed. 1. Introduction and preliminary definitions. The development of optimal control theory in a differential geometric setting has been carried out by for instance H.J. Sussmann in [14], where a coordinate-free formulation of the maximum principle is given. Many interesting problems that can be regarded as a control problems are encountered in differential geometry. For instance, the problem of characterising length minimising curves in sub-riemannian geometry (see [4, 11, 12]) has become one of the standard examples in geometric optimal control theory. Another field of applications can be found in the geometric formulation of Lagrangian systems subjected to nonholonomic constraints (see [10] and references therein). More recently, the formulation of Lagrangian systems on Lie-algebroids, which has been studied in [2, 8, 15], can also be treated as an optimal control problem. In [5] we have given a proof of the coordinate-free maximum principle for (timedependent) optimal control systems with fixed endpoint conditions, relying on the approach of L.S. Pontryagin et al. in [7]. As a side result of our approach, we were able to derive some necessary and sufficient conditions for the existence of what are called (strictly) abnormal extremals in sub-riemannian geometry (for an example of a strictly abnormal extremal, we refer to [9]). In this paper, it is our goal to present an extension of the maximum principle for (time-dependent) optimal control problems with variable endpoint conditions. The outline of the paper is as follows. In the remainder of this section, we briefly describe the geometric setting in which we study control systems. The maximum principle and some intermediate results obtained in [5] are summarised in Section 2 without giving all the technical details. These results are indispensable in order to present a comprehensive treatment of control problems with variable endpoints in Section 3. We now proceed towards the definition of a geometric control structure. It should be noted that we impose rather strong smoothness conditions. However, it occurs to us that there is a sufficiently large and relevant class of control problems that fits into the framework presented below (see [14] for a different approach) Mathematics Subject Classification. 49Kxx, 53Cxx. Key words and phrases. optimal control theory, variable endpoints. 1
2 2 B. LANGEROCK Definition 1. A geometric control structure is a triple (τ, ν, ρ) consisting of: (i) a fibre bundle τ : M IR over the real line, where M is called the event space and with typical fibre Q, which is referred to as the configuration manifold, (ii) a fibre bundle ν : U M, called the control space, and (iii) a bundle morphism ρ : U J 1 τ over the identity on M, such that τ 1,0 ρ = ν. In the above definition, the first jet space of τ is denoted by J 1 τ and the projections J 1 τ IR and J 1 τ M are denoted by τ 1 and τ 1,0 respectively. The map ρ, which is called the anchor map, makes the following diagram commutative: ρ U J 1 τ ν τ M 1,0 τ IR A section u : I U of τ ν is called a smooth control if ρ u = j 1 c, where c = ν u is called the smooth base section of the control u. In order to fix the ideas we will first elaborate on the notion of smooth controls. Fix a bundle adapted coordinate chart on M and let (t, x 1,..., x n ) (where dim Q = n) denote the associated coordinate functions. In particular the projection τ maps (t, x 1,..., x n ) onto t. Similarly we consider an adapted coordinate chart of the control space U, with coordinate functions (t, x 1,..., x n, u 1,..., u k ) (with dim U = 1 + n + k). A smooth control u, being a section of τ ν, locally represented by n functions x i (t), i = 1,..., n and k functions u a (t), a = 1,..., k, and has to satisfy, by definition, the following equation: ẋ i (t) = ρ i (t, x i (t), u a (t)). The above equations are easily recognised (see [7]) as the law of motion that occurs in standard control theory. It turns out, however, that the class of smooth controls should be further extended to sections admitting (a finite number of) discontinuities in the form of certain jumps in the fibres of ν, such that the corresponding base section is piecewise smooth (see also [7]). For instance, assume that u 1 : [a, b] U and u 2 : [b, c] U are two smooth controls with respective base sections c 1 and c 2, such that c 1 (b) = c 2 (b). The composite control u 2 u 1 : [a, c] U of u 1 and u 2 is defined by: { u1 (t) t [a, b], u 2 u 1 (t) = u 2 (t) t ]b, c]. It is readily seen that u 2 u 1 is (in general) discontinuous at t = b, however, the base ν (u 2 u 1 ) is continuous. This definition can easily be extended to any finite number of smooth controls, yielding what we shall call in general a control (a detailed definition can be found in [5]). We say that a control u : [a, b] U with base section c takes x to y if c(a) = x and c(b) = y, with x, y M.
3 OPTIMAL CONTROL PROBLEMS WITH VARIABLE ENDPOINTS 3 We now introduce the notion of optimality. Assume that a cost function L C (U) is given. For any control u : [a, b] M we can define its cost J (u): J (u) = b a L(u(t))dt. A control u taking x to y is said to be optimal if, given any other control u taking x to y then, we have J (u) J (u ). The problem of finding the optimal controls taking a given point to another given point is called an optimal control problem with fixed endpoint conditions. On the other hand, assume that two immersed submanifolds i : S i M and j : S f M are given. A control u taking a point x i(s i ) to a point y j(s f ) is said to be optimal if, given any other control u taking x i(s i ) to y j(s f ), then J (u) J (u ). The problem of finding the optimal controls taking a point in S i to a point in S f is called an optimal control problem with variable endpoint conditions. The maximum principle gives necessary conditions to be satisfied by optimal controls. In Section 2 we present a version of the maximum principle, proven in [5], for optimal control problems with fixed endpoint conditions whereas in Section 3 we prove necessary conditions for optimal controls in the case of optimal control problems with variable endpoints, in the specific case where either S i = {x} or S f = {y} (i.e. one of the endpoints is kept fixed). The more general case is more involved and is left for future work. The case where one of the endpoints is kept fixed, admits an elegant and concise approach, which is worth to be treated separately. 2. Optimal control problems with fixed endpoints. This section gives a quick review of some results obtained in [5], to which we refer for the proofs and further technical details Controllability and the cone of variations. Consider the total time derivative T, which is a vector field along τ 1,0, i.e. T : J 1 τ T M : jt 1 c T t c( t ) (where t is the standard vector field on IR and T t c the tangent map of c : IR M at t). Using this map, the everywhere defined family of vector fields D = {T ρ σ σ Γ(ν)} on M, generated by (local) sections of ν, is well defined. The family D plays a crucial role in deriving the maximum principle, as will become clear from the following observation. In [5] it is proven that the base of any control is a concatenation of integral curves of vector fields in D and vice versa (see below). We first proceed with some elementary definitions associated with this family of vector fields (see also [6], where one can find a detailed treatment of the theory of generalised distributions). A composite flow of vector fields in D is defined in the following way. Let (X l,..., X 1 ) denote an ordered family of l vector fields in D and let {φ i t} denote the flow of X i = T ρ σ i. For T = (t l,..., t 1 ) IR l, belonging to a suitable domain the composite flow of the X i is defined by Φ T (x) = φ l t l... φ 1 t 1 (x), where T is called the composite flow parameter. The concatenation γ through x τ 1 (a), associated with Φ and T, is a piecewise smooth curve defined as follows:
4 4 B. LANGEROCK γ : [a, a + t t l ] M with φ 1 sgn(t (x) for t [a, a 1)(t a) 1] φ 2 sgn(t γ(t) = 2 )(t a 1 ) (φ1 t 1 (x)) for t ]a 1, a 2 ]... φ l sgn(t l )(t a l 1 ) (... (φ1 t 1 (x))...) for t ]a l 1, a l ], where a i = a + i j=1 t j, sgn(t i ) = ti t i for t i 0 and sgn(0) = 0. Assume that all t i 0, then γ(t) = X i (γ(t)), and thus γ is an integral curve of X i when restricted to [a i 1, a i ]. Moreover, since every X i = T ρ σ i is τ-related to t on IR we have that τ(γ(t)) = t and thus γ determines (at least on every smooth part) a section of τ. Define the sections u i (t) = σ i (φ t ai (x)) on [a i 1, a i ]. Then it is easily seen that u = u l... u 1 is a control with base curve γ; we shall call u the control induced by the ordered family of sections (σ l,..., σ 1 ). We can conclude that every concatenation of integral curves of vector fields of an ordered set of D is the base section of a control. On the other hand, if u : [a, b] U is a smooth control, then its base section c is an immersion (i.e. ċ = T ρ u 0). Therefore, one can find a finite subdivision of [a, b] such that on every subinterval, the section u along c can be extended to a section σ of ν (see for instance [1]). It is then easily seen that the restriction of c to each subinterval is an integral curve of the vector field T ρ σ in D. This implies that the base curve of a control is a concatenation of integral curves associated with vector fields in D. Consider the following relation on M: x y iff there exists a composite flow Φ of vector fields in D such that Φ T (x) = y for some T = (t l,..., t 1 ) IR l with t i 0 for all i = 1,..., l. This relation is reflexive, transitive, but not symmetric since if x y then τ(x) τ(y). Using the notations introduced above, we can say that x y iff there exists a control u : [a, b] U with base curve c such that c(a) = x and c(b) = y. This justifies the following definition: the set of reachable points from x, denoted by R x, is the set of all y M such that x y. In particular, if u is a control with base section c taking x to y, we shall write x u y. It is always assumed that, if we have fixed a control u taking x to y, then we shall only consider an ordered family of vector fields (X l,..., X 1 ), with composite flow Φ such that Φ T (x) = y and such that u is induced by the ordered family (σ l,..., σ 1 ) of sections of ν and, in addition, X i = T ρ σ i. Using this convention, assume that x u y, consider a composite flow Φ and composite flow parameter T IR l, and let γ denote the concatenation associated with Φ and T through x. Using the same notations from above, assume that s ]a i 1, a i ]. Then we define T Φ b s : T γ(s) M T y M by T Φ b s = T φ l t l... T φ i a i s. Definition 2. The cone of variations C y R x at y R x is the convex cone in T y M generated by the following set of tangent vectors in T y M: {T Φ b s(y (γ(s))) s ]a, b] and Y D} {T Φ b s( γ(s)) s ]a, b]}, i.e. C y R x consists of all finite linear combinations, with nonnegative coefficients, of tangent vectors in the above set. In [5] we have proven the following theorem, which is fundamental for a proof of the maximum principle.
5 OPTIMAL CONTROL PROBLEMS WITH VARIABLE ENDPOINTS 5 Theorem 1. Given any curve θ : [0, 1] M through y at t = 0 and whose tangent vector at t = 0 belongs to the interior of the cone C y R x, then there exists an ɛ > 0 such that θ(t) R x for all t [0, ɛ]. In particular, the above theorem implies that the interior of the cone C y R x can be regarded as a tangent cone to the set of reachable points. Before proceedings we introduce the vertical cone of variations V y R x at y R x, which is the convex cone generated by the set: {T Φ b s(y (γ(s)) γ(s)) s ]a, b] and Y D}. It is easily seen that V y R x is contained in C y R x. Many results will be formulated in terms of this vertical cone of variations. For simplicity, we always assume that C y R x has a nonempty interior Optimality and the extended control structure. In the following we concentrate on optimal control problems (with fixed endpoints). Assume that a cost function L C (U) is given. One of the basic ideas in the book of L.S. Pontryagin et al. in [7], was to consider an extended geometric control structure in which the cost function becomes part of the anchor map. More specifically, consider the manifolds M = M IR, U = U IR and let τ : M IR : (m, J) τ(m), ν : U M : (u, J) (ν(u), J) denote two projections, making M and U into bundles over respectively IR and M. The extended anchor map ρ : U J 1 τ is defined by ρ(u, J) = (ρ(u), J, L(u)) (where we have used the standard identification of J 1 τ with J 1 τ IR 2 ). From now on we shall refer to (τ, ν, ρ) as the extended geometric control structure. It is instructive to see how the control structure (τ, ν, ρ) and the extended control structure (τ, ν, ρ) can be related. Consider a control u in the control structure (τ, ν, ρ) and define the following section of τ ν: u(t) = (u(t), J(t)) with J(t) = J 0 + t a L(u(s))ds, where J 0 IR can be chosen arbitrary (note that J(b) = J 0 + J (u)). It is easily seen that u is a control in the extended control structure: ρ u = j 1 c follows from ρ u = j 1 c, and J(t) = L(u(t)). By reversing the above arguments, one can prove that any control in the extended control structure (τ, ν, ρ) determines a control in the control structure (τ, ν, ρ). In particular, we have that if x u y with cost J (u), then (x, J 0 ) u (y, J 0 +J (u)) in the extended control structure (for arbitrary J 0 IR). And, vice versa, if (x, J 0 ) u (y, J 1 ) then there exists a control u such that x u y and J (u) = J 1 J 0. These observations justify the choice for calling the coordinate J the cost coordinate. Assume that we fix a control u taking x to y and the associated control u in the extended control structure taking (x, 0) to (y, J (u)) (i.e. we fix J 0 = 0). Similar to the construction in the control structure (τ, ν, ρ), we can associate with u a composite flow and composite flow parameter and, consequently, we can introduce the cone of variations C (y,j (u)) R (x,0) in the extended control structure and apply Theorem 1, in the following sense. If u is optimal, then the tangent vector J, corresponding to the cost coordinate, can not be contained in the interior of the cone of variations C (y,j (u)) R (x,0). Indeed, using the notations from Theorem 1, the curve defined by θ(t) = (y, J (u) t) for t [0, 1] satisfies θ(0) = J. Then, if J is contained in the interior of C (y,j (u)) R (x,0), there exists an ɛ > 0 such that
6 6 B. LANGEROCK (x, 0) (y, J (u) ɛ) or, equivalently, there exists a control taking x to y with cost J (u) ɛ, which is impossible since u is assumed to be optimal. The condition that J is not contained in the interior of C (y,j (u)) R (x,0) can be translated into a differential equation and a maximality condition, which are known as the necessary conditions provided by the maximum principle. In the remainder of this section we explain how these conditions are obtained Multipliers and the maximum principle. Before proceeding we still have to introduce a few additional concepts. First, let V τ denote the bundle of vertical tangent vectors to τ, i.e. V τ = {w T M T τ(w) = 0}, with dual bundle V τ. Note that the vertical cone of variations V y R x is entirely contained in V y τ, justifying the denomination vertical cone. Consider the fibred product U M V τ of U and V τ over M, i.e. (u, w) U M V τ if u U, w V τ and ν(u) = τ M (w), where τ M : T M M denotes the tangent bundle projection. Let λ IR and define a section σ λ of the fibration U M T M U M V τ by σ λ (u, η) = (u, α) where α is uniquely determined by the conditions 1. α, T(ρ(u)) + λl(u) = 0, and 2. α projects onto η. The map σ λ is smooth, as is easily seen from the coordinate expression α = (ρ i (u)η i + λl(u))dt + η i dx i. Using σ λ we can pull-back the canonical symplectic two-form ω on T M to a closed two-form ω λ on U M V τ: ω λ = σ λ (pr 2ω) with pr 2 : U M T M T M, the standard projection onto the second factor. Herewith, we can introduce the notion of a multiplier of a control. Definition 3. Let u denote a control with base c. A pair (η(t), λ), where η(t) is a piecewise smooth section of V τ along c and λ IR, is called a multiplier of u if the following three properties are satisfied: 1. i ( u(t), η(t)) ω λ = 0 (on every smooth part of the curve (u(t), η(t))), 2. for any fixed t I, the function u σ λ (u(t), η(t)), T(ρ(u )) + λl(u ), defined on ν 1 (c(t)), attains a global maximum for u = u(t), 3. (η(t), λ) 0 for any t I = [a, b]. Another concept that we will need is that of the dual of a cone. Let C denote a convex cone in a vector space V. The dual convex cone C in V is defined by C = {α V α, v 0, v C}. A result from [7], which we shall take for granted here, tells us that, given two convex cones C and C, such that the interior of C has an empty intersection with C, then they can be separated in the sense that there exists an α C for which α, C 0. It is also instructive to note that C = (cl(c)) and C = cl(c), where cl(c) denotes the closure of C (these results are taken from [3]). We are now ready to state the following theorem, establishing a connection between the multipliers of a control and elements in the dual cone of V (y,j (u)) R (x,0). We agree to write elements, say η, of V(y,J (u)) τ as (η, λ), where η V τ and λ IR, using the identification of V(y,J (u)) τ with V y τ IR, i.e. η = η + λdj (y,j (u)). A similar identification between T(y,J (u)) M and T y M IR can be made valid. Theorem 2. Let (η, λ) denote a multiplier, then the covector in V (y,j (u)) τ defined by (η(b), λ), is contained in the dual cone (V (y,j (u)) R (x,0) ). On the other hand, if (η y, λ) (V (y,j (u)) R (x,0) ) then there exists a multiplier (η, λ) with η(b) = η y.
7 OPTIMAL CONTROL PROBLEMS WITH VARIABLE ENDPOINTS 7 A straightforward corollary of this theorem is the maximum principle, formulated in the following way: if a control u is optimal then there exists a multiplier (η, λ) with λ 0. Indeed, since J can not belong to the interior of C (y,j (u)) R (x,0) if u is optimal, there must exist an element in (C (y,j (u)) R (x,0) ), say (α y, λ), such that (α y, λ), J 0 or, more specifically, λ 0. Since V (y,j (u)) R (x,0) C (y,j (u)) R (x,0), the restriction (η y, λ) V τ of (α y, λ) to V τ is contained in the dual cone of V (y,j (u)) R (x,0). We conclude that there exists a (η y, λ) (V (y,j (u)) R (x,0) ) with λ 0. Using Theorem 2, we have that there exists a multiplier (η, λ) such that λ 0. This necessary condition is precisely the necessary condition of the maximum principle. The following theorem is a minor generalisation of a theorem proven in [5] which will be used in the following section. Theorem 3. Assume that u is a control taking x to y and let (η, λ) denote a multiplier. Fix a composite flow Φ in the extended setting, such that Φ T ((x, 0)) = (y, J (u)) and with associated vertical cone of variations V (y,j (u)) R (x,0). Then η(t) + λdj = (T Φ b t) (η(b) + λdj). Moreover, if we define α(t) = σ λ (u(t), η(t)), then we also have: α(t) + λdj = (T Φ b t) (α(b) + λdj). Remark 1. Let (α y, λ) denote an element in (C (y,j (u)) R (x,0) ). By definition it is easily seen that both γ(b) + L(u) J and ( γ(b) + L(u) J ) are elements in C (y,j (u)) R (x,0). Since (α y, λ) is an element in the dual cone, we have that (α y, λ), ± ( γ(b) + L(u) J ) 0, which is only possible if (α y, λ), γ(b) + L(u) J = 0. More specifically, since γ(b) = T(ρ(u(b))), we obtain that α y = σ λ (u(b), η y ), where η y is the restriction of α y to elements in V y τ. 3. Optimal control problems with variable endpoints. Recall the definition of an optimal control problem with variable endpoints from Section 1 and consider two immersed submanifolds i : S i M and j : S f M. We only treat the specific case where either S i = {x} or S f = {y}. We would like to mention explicitly that, in this section, a control u taking a point x i(s i ) to a point y j(s f ) is said to be optimal if, given any other control u taking x i(s i ) to y j(s f ), then J (u) J (u ). Note that this notion of optimality is stronger then the notion of optimality from the previous section. Consequently, we can already conclude that if u is optimal among all controls taking points from S i to S f, then there exists a multiplier (η, λ) with λ 0. In this section we shall construct two more conditions (one for the case where S i = {x} and one if S f = {y}), which are known as the transversality conditions (see [7]). The first of these two transversality conditions (i.e. for S i = {x}) is easily derived in the next section. The second condition (S f = {y}) takes some more effort. In the sequel, we use the notations introduced in the previous section The transversality condition at the endpoint (S i = {x}). Assume that u is optimal. We consider the following tangent vector in T (y,j (u)) M: w = J + T j(v), where v T y S f can be chosen arbitrarily. We shall now prove by contradiction, that w is not contained in the interior of C (y,j (u)) R (x,0). Assume that w is in the interior of C (y,j (u)) R (x,0). Fix any curve in S f, say θ : [0, 1] S f, satisfying the condition that the tangent vector at t = 0 equals v,
8 8 B. LANGEROCK i.e. θ(0) = v. We now define a curve θ : [0, 1] M in the extended control structure and apply Theorem 1. More specifically, let θ(t) = (j(θ(t)), J (u) t) M. It is easily seen that θ(0) = (y, J (u)), and that θ(0) = w = J + T j(v). Using Theorem 1, we know that there exists an ɛ > 0 such that (j(θ(ɛ)), J (u) ɛ) R (x,0). In particular, we have that there exists a control taking x to j(θ(ɛ)) S f with cost J (u) ɛ. However, since u is assumed to be optimal, this is not possible. The same construction can be carried out for any positive multiple of w, implying that the convex cone, generated by all vectors w = J + T j(v) for v T j(t y S f ), can be separated from the cone of variations C (y,j (u)) R (x,0). Therefore, there exists a hyperplane in (α y, λ) (C (y,j (u)) R (x,0) ) such that (α y, λ), J + T j(v) 0, for all v T y S f. In particular, putting v = 0, we have (α y, λ), J 0, or λ 0. Following the same arguments as in the preceding section, we may conclude that there exists a multiplier (η, λ) with λ 0, where η(b) equals the restriction of α y to V τ. In Remark 1 we have stated that η(b) satisfies σ λ (u(b), η(b)) = α y. Take an arbitrary vector in the tangent space to S f, i.e. v T y S f. Then λ α y, v holds by definition of (α y, λ). This equations is also valid for v, implying that λ α y, v. Assume λ = 0, then α y (T j(t y S f )) 0 (where we use V 0 denotes the annihilator space in W of a linear subspace V of W). On the other hand, if λ < 0, then we obtain 1 α y, λ 1 v and 1 α y, λ 1 v. Now, since this equation holds for any multiple of v, we find again that α y (T j(t y S f )) 0. We conclude that if u is optimal, there exists a multiplier (η, λ) with λ 0 and σ λ (u(b), η(b)) (T j(t y S f )) The transversality condition at the starting point (S f = {y}). In order to prove a similar result for the initial submanifold S i, we are obliged to construct a new control structure (τ, ν, ρ ), which we shall call the inverse control structure. Consider the following bundle τ : M IR : x τ(x). And consider the map ξ : Γ(τ) Γ(τ ) defined as follows, if c :]a, b[ M is contained in Γ(τ) then ξ(c) :] b, a[ M, t c( t ). It is easily seen that ξ is invertible, and that it induces a bundle morphism between J 1 τ and J 1 τ, which will be denoted by the same letter for the sake of simplicity, and is defined by ξ(j 1 t c) = j 1 t(ξ(c)). It is easily seen that ξ : J 1 τ J 1 τ is fibred over the identity on M and over the mapping 1 : IR IR : t t, making the following diagram commutative. J 1 τ ξ J 1 τ τ 1,0 τ 1,0 M M τ τ 1 IR IR The total time derivative T : J 1 τ T M is related to T : J 1 τ T M as follows: T (ξ(j 1 t c)) = T(j 1 t c). Define a new anchor map ρ : U J 1 τ : u ξ ρ(u). We shall now further investigate the relation between the geometric control structures (τ, ν, ρ ) and (τ, ν, ρ), and in particular between the order relations induced by the families of vector fields D and D, respectively.
9 OPTIMAL CONTROL PROBLEMS WITH VARIABLE ENDPOINTS 9 Assume that σ Γ(ν). The vector field T ρ σ equals T ρ σ up to a minus sign. Indeed, since T ξ = T, we obtain that T ρ σ = T ξ ρ σ = T ρ σ. Therefore, we have D = D. Let us write the order relation induced by D as and, as before the order relation induced by D as. We then have that, if x y, then y x, and vice versa. Indeed, assume that Φ T (x) = y, where Φ is a composite flow associated with the ordered family (X l,..., X 1 ) of vector fields in D and T = (t l,..., t 1 ) IR l +. It is now easily seen that (Φ T ) 1 is precisely Ψ T, where Ψ is the composite flow associated with ( X 1,..., X l ) of vector fields in D and T = (t 1,..., t l ). Thus Ψ T (y) = x or y x. Moreover, if we consider the cone of variations C x R y in T x M with respect to the inverse control setting, we obtain that C x R y = (T Φ b a) 1 (C y R x ). We will now reformulate Theorem 1 in terms of the inverse control structure (τ, ν, ρ ) leading to a new theorem in the control structure (τ, ν, ρ). Let θ : [0, 1] M denote an arbitrary curve through x M at t = 0 such that θ(0) is contained in the interior of C x R y. Using Theorem 1 we obtain that there exists an ɛ > 0 such that γ(t) R y for 0 t ɛ. This brings us to the following theorem, which is merely a reformulation of Theorem 1 applied to (τ, ν, ρ ). Theorem 4. Let θ : [0, 1] M with γ(0) = x. If T Φ b a( θ(0)) is contained in the interior of C y R x, then there exists an ɛ > 0 such that θ(t) y for all 0 t ɛ. We shall now use this result. Assume that x u y, such that u is optimal. Let v T x S i and let θ : [0, 1] S i denote a curve with θ(0) = v. Let Φ denote a composite flow in the extended setting such that Φ T ((x, 0)) = (y, J (u)) and consider the curve θ : [0, 1] M defined by θ(t) = (i(θ(t)), t), with θ(0) = T i(v) + J = w. Assume that T Φ b a(w) is contained in the interior of the cone of variations C (y,j (u)) R (x,0) in the extended setting. Then, from Theorem 4, it is easily seen that (i(θ(ɛ)), ɛ) (y, J (u)) for some ɛ > 0. This implies that there exists a control u with i(θ(ɛ)) u y with cost J (u ) = J (u) ɛ. Since θ(ɛ) S i and since we assumed u to be optimal, this is impossible. The further analysis is basically the same as the one in Section 3.1. Again we consider the convex cone generated by all tangent vectors of the form T Φ b a( J + T i(v)), where v T x S i is arbitrary. Using a result from above, this cone can be separated from the cone of variations C (y,j (u)) R (x,0). This implies the existence of an element (α y, λ) in the dual cone of C (y,j (u)) R (x,0) such that, in addition, (α y, λ), T Φ b a( J + T i(v)) 0. Consider the restriction η y of α y to the set of vertical vectors V τ (see Remark 1). Since (η y, λ) is an element of the dual to the vertical cone of variations, we have that there exists a multiplier (η, λ) (with η(b) = η y and α y = σ λ (u(b), η y )) such that σ λ (u(b), η(b)) + λdj, T Φ b a( J + T i(v)) 0, for all v T x S i. If we use Theorem 3, then σ λ (u(a), η(a)) + λdj, J T i(v) 0. For v = 0, we find that λ 0, which is the standard necessary condition from the maximum principle. If v can be chosen arbitrarily we have α y, T i(v) λ. If λ =
10 10 B. LANGEROCK 0, then α y, T i(v) 0 and α y, T i(v) 0, implying that α y (T i(t x S i )) 0. If, on the other hand, λ < 0, then α y, T i(λ 1 v) 1 and α y, T i(λ 1 v) 1. Since this inequality holds for any multiple of v, we obtain once more that α y (T i(t x S i )) 0. The results from Sections 3.1 and 3.2 can now be combined in the following theorem, which is a geometric version of the maximum principle for optimal control problem with variable endpoint conditions, provided either S i or S f reduces to a point. Theorem 5. Assume that u is a control taking x to y. If u is optimal among all controls with initial point in S i and final point in S f then there exists an extremal (η, λ) such that 1. λ 0, 2. σ λ (u(a), η(a)) (T i(t x S i )) 0, if S f = {y}, or σ λ (u(b), η(b)) (T j(t y S f )) 0, if S i = {x}. It is easily seen that this theorem agrees with the results obtained in [7, p 48]. Acknowledgements. This research is supported by a grant from the Bijzonder onderzoeksfonds of Ghent University. I am indebted to F. Cantrijn for the many discussions and the careful reading of this paper. REFERENCES [1] S. Helgason, Differential geometry, lie groups, and symmetric spaces, Academic Press, New York, [2] J.F. Cariñena and E. Martínez, Lie algebroid generalization of geometric mechanics, Lie algebroids and related topics in differential geometry (Warzawa) (P. Urbański J. Kubarski and R. Wolak, eds.), Banach Center Publications, vol. 54, 2001, pp [3] G. Köthe, Topological vector spaces I, Springer-Verlag, Berlin, [4] B. Langerock, A connection theoretic approach to sub-riemannian geometry, J. Geom. Phys. (2002), to appear. [5], Geometric aspects of the maximum principle and lifts over a bundle map, Acta. Appl. Math. (2003), to appear. [6] P. Libermann and C.-M. Marle, Symplectic geometry and analytical mechanics, Reidel, Dortrecht, [7] L.S. Pontryagin, V.G. Boltyanskii, R.V. Gamklelidze and E.F. Mishchenko, The mathematical theory of optimal processes, Wiley, Interscience, [8] E. Martínez, Lagrangian mechanics on lie algebroids, Acta. Appl. Math. 67 (2001), [9] R. Montgomery, Abnormal minimizers, Siam Journal on control and optimization 32 (1994), [10] M. de León S. Martíez, J. Cortés, Symmetries in vakonomic dynamics: applications to optimal control, J. Geom. Phys. 38 (2001), [11] R.S. Strichartz, sub-riemannian geometry, J. Diff. Geom. 24 (1986), [12], Corrections to sub-riemannian geometry, J. Diff. Geom. 30 (1989), [13] H.J. Sussmann, Orbits of families of vector fields and integrability of distributions, Trans. Amer. Math. Soc. 180 (1973), [14], An introduction to the coordinate-free maximum principle, Geometry of Feedback and Optimal Control (New York) (B. Jakubczyk and W. Respondek, eds.), Marcel Dekker, 1997, pp [15] A. Weinstein, Lagrangian mechanics and groupoids, Mechanics Day (P.S. Krishnaprasad, W.F. Shadwick and T.S. Ratiu, ed.), 1995, pp Department of Mathematical Physics and Astronomy, Ghent University, Krijgslaan 281 S9, B-9000 Gent Belgium address: [email protected] URL:
Duality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
DEFORMATION OF DIRAC STRUCTURES ALONG ISOTROPIC SUBBUNDLES. and MARCO ZAMBON
Vol. 65 (2010) REPORTS ON MATHEMATICAL PHYSICS No. 2 DEFORMATION OF DIRAC STRUCTURES ALONG ISOTROPIC SUBBUNDLES IVÁN CALVO Laboratorio Nacional de Fusión, Asociación EURATOM-CIEMAT, E-28040 Madrid, Spain
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 6 Permutation Groups Let S be a nonempty set and M(S be the collection of all mappings from S into S. In this section,
Separation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
Practical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
Metric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
Matrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXXI, 1 (2012), pp. 71 77 71 CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC E. BALLICO Abstract. Here we study (in positive characteristic) integral curves
Fuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
Mathematical Physics, Lecture 9
Mathematical Physics, Lecture 9 Hoshang Heydari Fysikum April 25, 2012 Hoshang Heydari (Fysikum) Mathematical Physics, Lecture 9 April 25, 2012 1 / 42 Table of contents 1 Differentiable manifolds 2 Differential
ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE
Illinois Journal of Mathematics Volume 46, Number 1, Spring 2002, Pages 145 153 S 0019-2082 ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE J. HUISMAN Abstract. Let C be a
3. Prime and maximal ideals. 3.1. Definitions and Examples.
COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,
Continued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
THREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces
Communications in Mathematical Physics Manuscript-Nr. (will be inserted by hand later) Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Stefan Bechtluft-Sachs, Marco Hien Naturwissenschaftliche
(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
The Australian Journal of Mathematical Analysis and Applications
The Australian Journal of Mathematical Analysis and Applications Volume 7, Issue, Article 11, pp. 1-14, 011 SOME HOMOGENEOUS CYCLIC INEQUALITIES OF THREE VARIABLES OF DEGREE THREE AND FOUR TETSUYA ANDO
Inner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces OLEG REINOV St. Petersburg State University Dept. of Mathematics and Mechanics Universitetskii pr. 28, 198504 St, Petersburg
4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
Let H and J be as in the above lemma. The result of the lemma shows that the integral
Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;
SOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS
SOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS Ivan Kolář Abstract. Let F be a fiber product preserving bundle functor on the category FM m of the proper base order r. We deduce that the r-th
Max-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
Math 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
PYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
Multi-variable Calculus and Optimization
Multi-variable Calculus and Optimization Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Multi-variable Calculus and Optimization 1 / 51 EC2040 Topic 3 - Multi-variable Calculus
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS. denote the family of probability density functions g on X satisfying
MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS I. Csiszár (Budapest) Given a σ-finite measure space (X, X, µ) and a d-tuple ϕ = (ϕ 1,..., ϕ d ) of measurable functions on X, for a = (a 1,...,
Fixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
FIXED POINT SETS OF FIBER-PRESERVING MAPS
FIXED POINT SETS OF FIBER-PRESERVING MAPS Robert F. Brown Department of Mathematics University of California Los Angeles, CA 90095 e-mail: [email protected] Christina L. Soderlund Department of Mathematics
INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 24
INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 24 RAVI VAKIL Contents 1. Degree of a line bundle / invertible sheaf 1 1.1. Last time 1 1.2. New material 2 2. The sheaf of differentials of a nonsingular curve
Class Meeting # 1: Introduction to PDEs
MATH 18.152 COURSE NOTES - CLASS MEETING # 1 18.152 Introduction to PDEs, Fall 2011 Professor: Jared Speck Class Meeting # 1: Introduction to PDEs 1. What is a PDE? We will be studying functions u = u(x
2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
INCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
ALMOST COMMON PRIORS 1. INTRODUCTION
ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
THE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
Scalar Valued Functions of Several Variables; the Gradient Vector
Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions vector valued function of n variables: Let us consider a scalar (i.e., numerical, rather than y = φ(x = φ(x 1,
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
SINTESI DELLA TESI. Enriques-Kodaira classification of Complex Algebraic Surfaces
Università degli Studi Roma Tre Facoltà di Scienze Matematiche, Fisiche e Naturali Corso di Laurea Magistrale in Matematica SINTESI DELLA TESI Enriques-Kodaira classification of Complex Algebraic Surfaces
ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS
ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS I. KIGURADZE AND N. PARTSVANIA A. Razmadze Mathematical Institute
Schooling, Political Participation, and the Economy. (Online Supplementary Appendix: Not for Publication)
Schooling, Political Participation, and the Economy Online Supplementary Appendix: Not for Publication) Filipe R. Campante Davin Chor July 200 Abstract In this online appendix, we present the proofs for
Row Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
T ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
Constrained optimization.
ams/econ 11b supplementary notes ucsc Constrained optimization. c 2010, Yonatan Katznelson 1. Constraints In many of the optimization problems that arise in economics, there are restrictions on the values
a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
Continuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
Support Vector Machines Explained
March 1, 2009 Support Vector Machines Explained Tristan Fletcher www.cs.ucl.ac.uk/staff/t.fletcher/ Introduction This document has been written in an attempt to make the Support Vector Machines (SVM),
Stationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
Walrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
Core Maths C1. Revision Notes
Core Maths C Revision Notes November 0 Core Maths C Algebra... Indices... Rules of indices... Surds... 4 Simplifying surds... 4 Rationalising the denominator... 4 Quadratic functions... 4 Completing the
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
NOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
Largest Fixed-Aspect, Axis-Aligned Rectangle
Largest Fixed-Aspect, Axis-Aligned Rectangle David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: February 21, 2004 Last Modified: February
Properties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
Smarandache Curves in Minkowski Space-time
International J.Math. Combin. Vol.3 (2008), 5-55 Smarandache Curves in Minkowski Space-time Melih Turgut and Süha Yilmaz (Department of Mathematics of Buca Educational Faculty of Dokuz Eylül University,
88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a
88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small
Section 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
The Tangent Bundle. Jimmie Lawson Department of Mathematics Louisiana State University. Spring, 2006
The Tangent Bundle Jimmie Lawson Department of Mathematics Louisiana State University Spring, 2006 1 The Tangent Bundle on R n The tangent bundle gives a manifold structure to the set of tangent vectors
Tree sums and maximal connected I-spaces
Tree sums and maximal connected I-spaces Adam Bartoš [email protected] Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal and
CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010
CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected
8.1 Examples, definitions, and basic properties
8 De Rham cohomology Last updated: May 21, 211. 8.1 Examples, definitions, and basic properties A k-form ω Ω k (M) is closed if dω =. It is exact if there is a (k 1)-form σ Ω k 1 (M) such that dσ = ω.
Fiber sums of genus 2 Lefschetz fibrations
Proceedings of 9 th Gökova Geometry-Topology Conference, pp, 1 10 Fiber sums of genus 2 Lefschetz fibrations Denis Auroux Abstract. Using the recent results of Siebert and Tian about the holomorphicity
THE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
Invariant Metrics with Nonnegative Curvature on Compact Lie Groups
Canad. Math. Bull. Vol. 50 (1), 2007 pp. 24 34 Invariant Metrics with Nonnegative Curvature on Compact Lie Groups Nathan Brown, Rachel Finck, Matthew Spencer, Kristopher Tapp and Zhongtao Wu Abstract.
Linear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
RANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
LECTURE III. Bi-Hamiltonian chains and it projections. Maciej B laszak. Poznań University, Poland
LECTURE III Bi-Hamiltonian chains and it projections Maciej B laszak Poznań University, Poland Maciej B laszak (Poznań University, Poland) LECTURE III 1 / 18 Bi-Hamiltonian chains Let (M, Π) be a Poisson
SOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
Høgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver
Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: [email protected] Narvik 6 PART I Task. Consider two-point
MICROLOCAL ANALYSIS OF THE BOCHNER-MARTINELLI INTEGRAL
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 MICROLOCAL ANALYSIS OF THE BOCHNER-MARTINELLI INTEGRAL NIKOLAI TARKHANOV AND NIKOLAI VASILEVSKI
1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
Degree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
TOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
University of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
Unified Lecture # 4 Vectors
Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,
BANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
SURVEY ON DYNAMICAL YANG-BAXTER MAPS. Y. Shibukawa
SURVEY ON DYNAMICAL YANG-BAXTER MAPS Y. Shibukawa Department of Mathematics, Faculty of Science, Hokkaido University, Sapporo 060-0810, Japan e-mail: [email protected] Abstract In this survey,
Cartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
The Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
Shortcut sets for plane Euclidean networks (Extended abstract) 1
Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,
Solutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
