This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
(exp tX)<j)(h) 6 L'L\ for some t 6 R, h £ H. Thus g = (exptX)hk for some k € K C H; thus g £ exp(RX)H. Suppose that g = exp(tiX)hi = exp(t2X)h,2. Then <j>(g) = )(p) = V(p), for each point p in M. The derived flag of a distribution V is the sequence of modules of vector • • •, 1>{q,p) =
= 4>(exptiX) = 0(expt 2 X) = exp (d(j>(t2X)).
and by injectivity of expod<^> on MX, we conclude t\ = ti- Then by cancellation h\ =b,2, so the representation is unique. The same argument works for .H'exp(RX'). Thus by Proposition 3.6 f) is not (IFT). A reason for presenting the alternate proof is that this second proof gives us the following new characterization of maximal semigroups. T h e o r e m 6.11. Let G be a simply connected solvable Lie group and let S := S(h + ) = ( e x p h + ) be a maximal semigroup of G, where t)+ is a half-space semialgebra, and f) is a codimension one subalgebra which is not an ideal. Then there exists X £ (h + \ h) f~l g' and for any such X, S = H(expRX) = (expMX)H with unique factorization in each case, where H := (exp h) We remark that the proof remains valid in the more general connected case. 6.2
Considering
(IFC)
The notion of irrelevance for controllability (IFC) is the natural one to look at if one's starting point is control systems on manifolds rather than the semigroups of smooth invertible maps. So we start with the vector fields generating flow maps
70 rather than the flow maps themselves. Actually this was our original motivation to introduce the irrelevancy notion, which proved more broadly powerful. For detailed proofs we refer to 17 . As a consequence of Theorem 5.5 and Proposition 5.6, controllability questions on g can be reduced to a problem on the factor algebra JJ/ IFC(g). Of course whether this information is very useful or not depends on the following two aspects: (D) Determination: How hard is the problem of determining IFC(g)? (S) Simplification: How complicated is the structure of the quotient g/IFC(g)? Is it much simpler that that of a general solvable g? For nilpotent g we obtain the best possible answers one can hope for: T h e o r e m 6.12. If g is nilpotent, then IFC(g) = A(g) = g'. A subalgebra f) C g is QFC) iff t) C g,'. Proof. An (IFT)-subalgebra f) is contained in g' by Lemma 6.5, and thus A(g) C g' by Corollary 6.3. By Proposition 5.3 we conclude that every (IFC)-subalgebra is contained in g', in particular IFC(g) C g'. The converse containments in the first statement are proved in 17 , and the converse implication in the second statement then follows from Theorem 5.5. • For g solvable, not nilpotent, the answer to (D) is, roughly speaking, that it is as hard as finding the Jordan normal form of a linear map. And concerning (S) one finds that g/ IFC(g) is only slightly more complicated than the basic-metabelian algebras mentioned in the previous section. The structure of these algebras (in terms of brackets) is not very complicated and actually easily understood, the major task one has to perform is introducing a well-suited notation. One might be disappointed by our anwswer to (D), in particular after one finds out that it is also necessary to pick a "generic" element in g, so this is not a straightforward procedure for finding IFC(g). But actually finding IFC(g) itself is not necessarily the task that must be solved. There are smaller ideals which are easily determined and which already provide most of the possible reduction: Proposition 6.13. If Q is solvable, then D2Q = [g',g'] is an (IFC)-ideal. See 17 for a proof. The factor algebra g = Q/D2Q is metabelian, i.e., its bracket algebra [g, g] is abelian. For practical purposes Proposition 5.6 can be quite useful. It allows one to proceed inductively: having found some (IFC)-ideal, pass to the quotient and look for (IFC)-ideals there. Finally there is a nice characterization of (IFC)-ideals in algebraic terms. Definition 6.14. We call a subalgebra f) C g an (NCA)-subalgebTa if it has the following property: If a C Q is a subalgebra and a + I) = g, then a = g. The acronym (NCA) stands for no complementary algebra: f) being an (NCA)subalgebra means there is no proper subalgebra o with 0 + f) = g. Of course it makes sense to speak of (NCA)-ideals, too. Proposition 6.15. An ideal i o/g is (IFC) if and only if it is an (NCA)-ideal.
71 We cannot expect that a sum of (IFC)-algebras fji,h2 is (IFC). Nevertheless, we obtain an analogue of the previous proposition. Its proof requires a few extra arguments, though. Proposition 6.16. If the subalgebra I J C J generates a closed subgroup (exp f)) and is (NCA), then it is (IFC). Every (NCA)-algebra t) is contained in A(g). Proof. Suppose that t) is (NCA). Then h C A(fl) must hold because if I) \ A(g) ^ 0 we can actually find a hyperplane subalgebra f) such that i) + t) = 0, cf. Lemma 6.5. We claim that f) is (IFC), so we consider M = G/H and $ C g such that the system on M given by {x | x e $} is controllable. We must show that S ( $ ) = G holds true. As usual 7r: G —> M denotes the canonical map, pa = 7r(e) the base point, and pr,, = d7r(e): a —> fl/f) is the projection with kernel I). Now let a = (($)) C 0, the subalgebra generated by $ . Then controllability on M implies TP0M = < X(po) | X 6 o !• which is equivalent to pr1)(o) = 0, hence a+ f) = 0. As f) is (NCA), o = £| follows, so int(5(*)) # 0. Since f) C A(g), H C A(G). Thus 5 ( $ ) is transitive on G/A(G). As A(G) is (IFT) and int(S($)) # 0, we deduce S ( $ ) = G, finishing the proof. • Now we ask if the reverse implication holds true, so is every (IFC)-algebra (NCA)? Example 6.6 and the discussion leading to Proposition 6.8 show that this is a nontrivial problem. Take an t) which is not (NCA). Take a proper subalgebra o 7^ g such that a + t) = Q. Then it is clear that the system induced by $ = a on M = G/H will be transitive at least on a neighborhood of the base point po = 7r(e) of M, but we cannot expect in general that the semigroup S = A = (exp o) is transitive on M, for that is equivalent to G = HA, and the latter we know for sure only if Ad(G)fj n o = {0} is trivial. Example 6.17. Again we consider the algebra of motions of the euclidean plane 0 = s p a n { A , X , Y } with brackets: [A,X] = Y, [A,Y] = -X. Which subalgebras f) of fl are not (NCA)? Let us look at dim h: 3-dim: Of course 0 is not (NCA), but it isn't (IFC) either. 2-dim: There's only one hyperplane subalgebra: 0'. Of course 0' is not (NCA), but it is not (IFC) either. 1-dim: The line RX is not (NCA) iff X £ g' because 0' is the only possible choice we have for a complementary subalgebra. As Ad(G)0 ; = 0', RX n Ad(G)$' = {0}, so G = exp(RX)G' holds true, i.e., RX is not (IFC). So in this case -i(NCA) implies -i(IFC). In particular we observe that, for example, the subalgebra f) = RX is (NCA), so it is (IFC), too. But we also observe that f) g IFC(0) = {0}. So the inclusion f) C A(o) if t) is (IFC) cannot be improved any further. An (IFC)-algebra need not be contained in the ideal IFC(0). We conjecture that-.(NCA) =$• -.(IFC), resp., (IFC) =$> (NCA) so we state this as an open
72 Problem 6.18. Prove or disprove: an (IFC)-algebra is also (NCA). Now we return to our discussions of the benefits of passing to the quotient g/IFC(g). 6.3
The controllability
normal
form
Reduction modulo A(g) led us to A-reduced algebras which actually turned out to be the ones we called basic-metabelian. The algebra g/IFC(g) also deserves a special name, we call it the controllability normal form (CNF)o/g. If IFC(g) = {0} we say that g is in (CNF). Although the structure (bracket-wise) of such a g in (CNF) is not really complicated, having a reasonable terminology is indispensable for analyzing it. Roughly speaking, such a g is made out of two components, a real vector space V and a set (actually a vector subspace) o C g£(V) of linear maps V -*V such that (1) every A G a is diagonalizable over C, and (2) any two maps A,A'(Ea
commute: A A' = A' A.
These conditions are tantamount to saying that a is an abelian subalgebra of g£(V), and V may be decomposed into common eigenspaces of A, A'. Formalizing this statement it turns out that one can decompose g in the following way:
fl = h e 0 g A © ® g u , AeA
(6.1)
wen
which has to be interpreted as follows: • h is an abelian subalgebra of g corresponding to o plus the center 3(g). • The sets A, Q stand for the so-called roots signifying the common eigenvalues and g , g" are common eigenspaces also called root-spaces. • A is the set of real roots; each A G A is a nonzero linear form A: f) —> R, and [H,XX] = \{H)XX,
holds true for all H G h, Xx G g A .
• Q is the set of complex roots—actually only one half of it since complex eigenvalues always appear in conjugate pairs—so an w G fi is an R-linear map from h -> C such that w(h) % R. The root space g" is isomorphic (as a vector space) to some Cr considered as a real vector space, and for H € h, Xu G gw
[H,Xu]=u(H)Xu. • Each root space gA, g" is an abelian ideal and [g a ,g^] = 0 for all a,/3 G A u Q . At this point one clearly sees the difference between the (CNF) g/IFC(g) and the basic metabelian g/A(g): in the latter case there are no complex roots (eigenvalues) .
73 Proposition 6.19. Let g be as in (CNF). Then
fl' = ©8 A ©©8 W > A€A
"* A(g) = © g " .
wgn
wen
A hyperplane subalgebra a in g has the form 0- = cii, + 8 ,
wi£/i a hyperplane Of, C h, or
a = f) © ^ f t g a © a,,
6.^
Generic controllability
un£/a a hyperplane oM C g^.
rank and type
Now we reap some of the benefits of reduction because we will be able to answer the following questions: • What is the minimum number of elements Xi,... ,Xr necessary to generate a given g as a Lie algebra, i.e., {{X\,... ,Xr)) = 8? • Given a Lie algebra g, some "drift vector fields" Ai,... ,Aj and some "input vector fields" Bi,... ,Bi, what are the minimal numbers (i,d) such that U = {Ai ,...,Ad, ±B%,..., ±Bi) is controllable? • Will controllability or noncontrollability of the system given by U = {Ai ,...,Ad, ± B i , . . . , ±Bi} C jj be stable under perturbations (to Aj, Bk € fl)? Is it a generic property? For the first two questions we observe that existence of such minimal numbers r, resp (i,d) is not really an issue, but it is not at all clear how to compute them. We call r the generic controllability rank of g, GCR(g), and (i,d) the generic controllability type of g, GCT(g). This choice of terminology has something to do with the last question because once certain conditions can be expressed in terms of some polynomials (say in Xi,..., Xr) not vanishing (like a rank condtion), they are either void or generic, so they hold either never or in almost every case. Looking at the (CNF) of a solvable g we can immediately read off its controllability rank and type. With the notation of (CNF) we let d\ = max < diniR g | A 6 A > ,
and
du = max {dime g" | u; € fi} ,
and obtain: Proposition 6.20. Let g be in (CNF).
Then
GCR(g) = max {dim t), 1 + dA, 1 + dn} , and GCT(g) = (i, d) with i + d = GCR(g), i = max {dim f), 1 + ^ A } ,
and
d = max{0,1 + dn — i) •
74 The proof requires two separate arguments. One must find a set of generators of the appropriate size, and one must show that one cannot generate g with less elements. In both cases the root decomposition as in (6.1) is instrumental. The details can be found in 1T. A particularly nice result is the next theorem which simplifies Sachkov's work on controllability of solvable Lie algebras, cf. 2 2 , also 2 3 . Definition 6.21. We call a Lie algebra g SID-controllable, if there exist A,B € g such that S(A,±B) = G, i.e., the single input plus drift system g = g(A + uB), u 6 R is controllable. It turns out that this is a generic property of the Lie algebra g rather than the particular pair (A,B): the set of such pairs is either empty or open and dense in g x g. T h e o r e m 6.22. For a solvable Lie algebra the following statements are equivalent: (i) g is SID-controllable. (ii) every factor algebra g/i (i C g an ideal) is SID-controllable. (hi) g/£>2g is SID-controllable (iv) GCT( 0 ) = (1,1), (v) g/IFC(g) is isomorphic to a semidirect product Ck x$j R with Q diag(a>i,...,uik) 6 g£{k, C) and w i , . . . ,Wfc € C \ R pairwise distinct.
=
If g is SID-controllable, then the foloowing statements hold true: (vi) $j has no ideals of codimension 2. (vii) Q' is a hyperplane and A(g) = $)'. Alternatively, in view of (iii), one can reduce the problem of classifying SIDcontrollable algebras to the metabelian case [fl',g'] = 0. This is a basic case in Sachkov's work which allows a very short classification where the conditions involved are similar to familiar criteria from linear control theory. Proposition 6.23. A metabelian g is SID-controllable iff it is isomorphic to a semidirect product M.k x ^ R where A € g£(k,M) has nonreal spectrum spec(A) C C\R and every eigenvalue has geometric multiplicity 1. The latter is equivalent to iank(A + XI) > k - 1 for all A 6 C. Comparison with the previous theorem reveals how far away from g/ IFC(g) the possibly bigger algebra Q/D2Q actually may be. The metabelian g/D 2 g has a root decomposition similar to the (CNF):
g/D2g = h © 0 g A e 0 g „ . A€A
u6d
The difference is that the root spaces Q\, gw need not be eigenspaces, they may be generalized eigenspaces; and the subalgebra t) is nilpotent but not necessarily abelian.
75
7
Irrelevant groups and algebras: the semisimple case
The highly developed structure theory for semisimple Lie groups and algebras allows one to derive quite powerful results concerning irrelevancy in the semisimple setting. This project has been carried out by L. San Martin and co-workers over a period of several years. We do not undertake to explain the details of these developments here, but only highlight a few principle results. Let G be a connected semisimple Lie group with finite center and let a denote its Lie algebra. Then the Lie group and the Lie algebra admit Iwasawa decompositions of the form G = KAN, g = t + a + n, where K = exp(t), A = exp(a), and N = exp(n), and where the product factorization of each element is unique and the Lie algebra decomposition is into direct summands. The Iwasawa decompositions arise by taking an Cartan decomposition t + p of 5, picking a maximal abelian subalgebra o of p, letting II be a set of positive roots for a, and setting n equal to the sum of the root spaces for the positive roots. Set M equal to the centralizer of A in K. Then P = MAN is a group, called a minimal parabolic group. The coset space G/P is called a maximal boundary of G. The first major result of San Martin appeared in 2 4 . We cite it in the language of this paper, not the language that he used. T h e o r e m 7 . 1 . Let G be a connected semisimple Lie group with finite center, and let P be a minimal parabolic subgroup. Then P is (IFT). Much stronger results are available if G is simple 25 . T h e o r e m 7.2. Let G be a simple Lie group and let H he a closed subgroup such that 0 < dim(H) < dim(G) and the coset space G/H is compact. Then H is (IFT).
References 1. J. Hilgert, K. H. Hofmann, and J. D. Lawson, Lie Groups, Convex Cones, and Semigroups, (Oxford Press, Oxford, 1989). 2. J. Hilgert and K.-H. Neeb, Basic Theory of Lie Semigroups and Applications, (Springer Lecture Notes in Mathematics 1552, Springer, 1993). 3. —, "Hyperplane subalgebras in real Lie algebras," Geom. Dedicata 36, 207-224 (1990). 4. K. H. Hofmann, J. D. Lawson, and E. B. Vinberg, Editors, Semigroups in Algebra, Geometry and Analysis, (de Gruyter, Berlin, 1995). 5. V. Jurdjevic, Geometric Control Theory, (Cambridge Press, Cambridge, 1997). 6. V. Jurdjevic and H. Sussmann, Control systems on Lie groups J. Diff. Eq. 12, 313-329 (1972). 7. J. D. Lawson, Maximal subsemigroups of Lie groups that are total, Proceedings of the Edinburgh Math. Soc. 87 , 479-501 (1987). 8. —, "Ordered Manifolds, Invariant Cone Fields, and Semigroups," Forum Math. 1 , 273-308 (1989). 9. —, "Semigroups of Ol'shanskii type," Semigroups in Algebra, Geometry and
76 Analysis, (de Gruyter, Berlin, 1994). 10. —, "Semigroups in Mobius and Lorentzian geometry," Geom. Dedicata 70, 139-180 (1998). 11. —, "Geometric control and Lie semigroup theory," In: Differential Geometry and Control, Proceedings of Symposia in Pure Mathematics, 64, Editors: G. Ferreyra, R. Gardner, H. Hermes, H. Sussmann, (Amer. Math. Soc, 207-221 1999). 12. C. Loewner, "On some transformation semigroups," J. Rat. Mech. and Anal. 5, 791-804 (1956). 13. —, "On some transformation semigroups invariant under Euclidean or nonEuclidean isometries," J. Math, and Mech. 8, 393-409(1959) . 14. —, "On semigroups in analysis and geometry," Bulletin A.M.S. 70, 1-15 (1964). 15. D. Mittenhuber, "Dubins' problem inhyperbolic space," In: Geometric Control and Non-holonomic Mechanics, CMS Conference Proceedings, Volume 25, Editors: V. Jurdjevic, R.W. Sharpe, (Can. Math. Soc, 101-114 1998). 16. —, "Controllability of solvable Lie algebras," J. Dyn. Contr. Systems 6, 453459 (2001). 17. —, "Controllability of systems on solvable Lie groups: the generic case," J. Dyn. Contr. Systems 7:1, 61-75 (2001) . 18. F. Monroy-Perez, "Non-euclidean Dubins' problem," J. Dyn. Contr. Systems 4:2, 249-272 (1998). 19. G. I. Ol'shanskii, "Convex cones in symmetric Lie algebras, Lie semigroups, and invariant causal structures on pseudo-Riemannian symmetric spaces," Sov. Math. Dokl. 26 , 97-101 (1982). 20. —/'Invariant cones in Lie algebras, Lie semigroups, and the holomorphic discrete series," Fund. Anal, and Appl. 15 , 275-285 (1982). 21. R. S. Palais, "A global formulation of the Lie theory of transformation groups," (Memoirs of the Amer. Math. Soc, Providence, 1957). 22. Y. Sachkov, "Controllability of right-invariant systems on solvable Lie groups," J. Dyn. Contr. Systems 3:4, 531-564 (1997). 23. —, "Survey on Controllability of Invariant Systems on Solvable Lie Groups," In: Differential Geometry and Control, Proceedings of Symposia in Pure Mathematics, Volume 64, Editors: G. Ferreyra, R. Gardner, H. Hermes, H. Sussmann, (Amer. Math. Soc, 297-317 1999). 24. L. San Martin, "Invariant control sets on flag manifolds," Math, of Control, Signals, and Systems 6 , 41-61 (1993). 25. L. San Martin and P. Tonelli, "Transitive actions of semigroups in semisimple Lie groups," Semigroup Forum 58, 142-151 (1999). 26. H. Sussmann, "The bang-bang problem for certain control systems in GL(ra, R), SIAM J. Control 10, 470-476 (1972).
77 CANONICAL CONTACT SYSTEMS FOR CURVES: A SURVEY
WITOLD RESPONDEK Laboratoire de mathematiques de VINSA de 16 131 Mont Saint Aignan, France E-mail: [email protected]
Rouen
WILLIAM PASILLAS-LEPINE Laboratoire des signaux et systemes, Supelec 91 129 Gif-sur-Yvette, France E-mail: [email protected] We start with a brief overview of results characterizing distributions (equivalently Pfaffian systems) that are locally equivalent to a canonical contact system. Then we concentrate on distributions equivalent to the canonical contact system on 7 n (IR,]R m ), that is the canonical contact system for curves. We give various necessary and sufficient geometric conditions for a distribution (or a Pfaffian system) to be locally equivalent to the canonical contact systems for curves. We study the geometry of that class of systems, in particular, the existence of corank one involutive subdistributions contained in the successive elements of the derived flag. We give a new characterization of distributions locally equivalent to the canonical contact systems for curves that uses only one involutive subdistribution in which all information about the geometry and about the regularity is encoded. We also distinguish regular points, at which the system is equivalent to the canonical contact system, and singular points, at which we propose a new normal form that generalizes the canonical contact system on Jn(R, R m ) in a way analogous to that how Kumpera-Ruiz normal form generalizes Goursat normal form, that is, the canonical contact system on Jn(R, M.). Finally, we briefly discuss how the geometry of distributions equivalent to the canonical contact systems for curves is reflected by their flatness and illustrate some of our results by a model of a simple nonholonomic control system.
1
Introduction
Consider Jn(Rk ,Rm), and denote by (qi,...
,qk,ui,...
the space of n-jets of smooth maps from Kfc into E m , ,um,Pi),
for 1 < i < m and for 1 < \a\ < n,
the canonical coordinates, also called natural coordinates, on this space (see e.g. 3 , 25 , and 3 2 ) , where qj, for 1 < j < k, represent independent variables and Ui, for 1 < i < m, represent dependent variables; the vector of non-negative integers a = (<TI, . . . ,o~k) is a multi-index such that \o~\ = o~\ + • • • + o~k
78
Denote p° — ut, for 1 < i < m. Any smooth map ip from Efc into Rm defines a submanifold in Jn(Rk ,Rm) by the relations Pi = - ^ — ( g i , - - - , % ) ,
for 1 < i < m and 0 < \a\ < n. This submanifold is called the n-graph of ip. It turns out that all n-graphs are integral submanifolds, of dimension k, of a distribution called the canonical contact system on Jn (Rk, Rm) or the Cartan distribution 32 on J n (M f c ,E m ). The Pfaffian system that anihilates this distribution, which is also called the canonical contact system (see e.g 3 and 2 5 ) , is given in the canonical coordinates of Jn(Rk, Rm) by ft
dp? - YjPi
.j.
'dqj = 0,
for 1 < i < m and for 0 < |cr| < n — 1,
where a + \j = {a\,... , Oj + 1 , . . . ,ak). The above description explains the importance of contact systems in geometric theory of (partial) differential equations and in differential geometry. In the former, a (partial) differential equation is interpreted as a submanifold in J"(K fc , IRm) and thus it is natural to study the geometry of pairs consisting of a contact system and a submanifold, see e.g. 3 , 19 , and 3 2 . In the latter, contact systems allow to describe, for instance, diffeomorphisms which preserve the n-graphs of appplications (for example, n-graphs of curves in the case k = 1), see e.g. 3 and 2 5 . A natural problem which arises is to characterize those distributions which are (locally) equivalent to a canonical contact system. This problem was posed by Pfaff 29 in 1814 and seems still to be open in its full generality although many important particular solutions have been obtained. In the case n = 1, with m = 1 and an arbitrary k the final solution has been obtained by Darboux 7 in his famous theorem generalizing earlier results of Pfaff 29 and Frobenius n . The case n = 2, m = 1 and A; = 1 was solved by Engel in 8 . The case n > 2, m = 1 and k = 1 was solved by E. von Weber 33 , Cartan 5 and Goursat 14 (at generic points) and by Libermann 18 , Kumpera and Ruiz 17 , and Murray 24 (at an arbitrary point). The case n = 1, with k and m arbitrary has been studied and solved by Bryant 2 (see also 3 ) . This paper is devoted to the problem of when a given distribution is locally equivalent to the canonical contact system in the case k = 1, n and m arbitrary, that is to the canonical contact system for curves. This problem has been studied by Gardner and Shadwick 12 , Murray 24 , and Tilbury and Sastry 31 (as a particular case of the the problem of equivalence to the
79
so-called extended Goursat normal form). Their solutions are based on a result of 12 that assures the equivalence provided that a certain differential form satisfies precise congruence relations. The problem of how to verify the existence of such a form had apparently remained open. This difficulty was solved by Aranda-Bricaire and P o m e t 1 , who proposed an algorithm which determines the existence of such a form. Their solution, although being elegant and checkable, uses the formalism of infinite dimensional manifolds and thus goes away from classical results characterizing contact systems. Recently, the authors 27 gave a geometric characterization of canonical contact systems in the case k = 1, and n and m arbitrary. That characterization of the canonical contact system on Jn(R,Rm), recalled as Theorem 2.1, turns out to be a natural combination of that given for J 1 (E f c ,R m ) by Bryant (see 2 and 3 ) and that given for J"(M,M) by Murray 2 4 . The aim of this paper is to analyze various possible characterizations of the canonical contact system on J"(M, K m ) . We start with stating, as Theorem 2.1, the result of 2 7 . That result involves two conditions: an essential geometric condition stating that each element 2)W of the derived flag (see the definition in the next section) contains an involutive subdistribution of corank one and the regularity condition T>^ = T>i (see the definition of the Lie flag in the next section). We will discuss other equivalent formulations of both conditions using, in particular, the notion of characteristic distributions (Theorem 5.4) and the language of Pfaffian systems (Theorem 3.7 and Corollary 5.5). All those descriptions lead to the following characterization, stated as 5.6, which is the main result of the paper. Main Theorem A rank m + 1 distribution V, with m > 2, on a manifold M of dimension (n + l)m + 1 is equivalent, in a small enough neighborhood of any point p in M, to the canonical contact system on J"(M, M.m) if and only if the following conditions hold. (i) £>(") = TM. (ii) £>(™-1) is of constant rank nm + 1 and contains an involutive subdistribution Cn-i that has constant corank one in (iii) 2>(°>(p) g £„_!(?). This result implies that all information containing both the geometry and the regularity of the problem is completely encoded in the involutive subdistribution £„_i of corank one in D(™-1). In particular, its existence and the regular intersection with 2?(°) (p) imply the existence of an involutive subdistribution of corank 1 in each X>W and, moreover, imply all regularity conditions X>W — T>i. It is important to observe that if conditions (i) and (ii) of the theorem are satisfied then the involutive subdistribution jCn-i is necessarily
80
unique (see Lemma 4.2), which allows to check easily condition (iii). In the case of Goursat structures, that is for m = 1, we give Theorem 5.7, an analogue of the above result, in which all information is, this time, encoded in the characteristic distribution Cn-\ of £>(" - 1 '. The paper is organized as follows. In Section 2 we define the canonical system for curves and we give Theorem 2.1, a first characterization of distributions that are locally equivalent to the canonical contact system for curves. In Section 3 we sketch briefly the history of results describing various canonical contact systems. In Section 4 we discuss the problem of whether a given distribution possesses a corank one involutive subdistribution and we recall Bryant's solution of that problem. Section 5 contains other characterizations of the canonical contact systems for curves. One of them, Theorem 5.4, is based on the notion of characteristic distributions while another, Theorem 5.6, uses only one involutive sudistribution in which all information about the geometry and about the regularity is encoded. The presented proof gives a method of constructing canonical coordinates for any distribution equivalent to the canonical contact system. Still in Section 5, we present an analogue of Theorem 5.6 for Goursat structures that uses, this time, only one characteristic distribution. Flatness of control systems equivalent to a canonical contact system for curves is discussed in Section 6. In particular, we show how the geometry of that class of systems helps to describe their flat outputs. We give a model of a mechanical nonholonomic system equivalent to a canonical contact system in Section 7. In Section 8 we introduce extended Kumpera-Ruiz normal forms and give a result, Theorem 8.1, stating that any contact system, regular or singular, is locally equivalent to an extended Kumpera-Ruiz normal form.
2
The Canonical Contact System for Curves
A rank k distribution V on a smooth manifold M is a map that assigns smoothly to each point pin M a, linear subspace V(p) C Tp M of dimension k. In other words, a rank A; distribution is a smooth rank k subbundle of the tangent bundle TM. Such a field of tangent fc-planes is spanned locally by k pointwise linearly independent smooth vector fields / i , . . . , fk on M, which will be denoted by X> = ( / i , . . . , / * ) . Two distributions V and V denned on two manifolds M and M, respectively, are equivalent if there exists a smooth diffeomorphism ip between M and M such that (
81
fields D<°) C 2? (1) C • • • denned inductively by D(0)=£>
P< i + 1 ) = X>(i) + [ D ( i ) , P w ] ,
and
for t > 0.
(2.1)
The Lie /Jag is the sequence of modules of vector fields Do C T>\ C • • • defined inductively by V0=V
and
P i + i =Vt + [T>o,T>i], for t > 0.
(2.2)
In general, the derived and Lie flags are different; though for any point p in the underlying manifold the inclusion T>i(p) C X>W(p) clearly holds, for i > 0. For a given distribution V, defined on a manifold M, we will say that a point p of M is a regular point of V if all the elements T>i of its Lie flag have constant rank in a small enough neighborhood of p. A distribution V is said to be completely nonholonomic if, for each point p i n M , there exists an integer N(p) such that VN^(p) = TPM. A distribution V is said to be involutive if its first derived system satisfies V^ = £>(°'. An alternative description of the above defined objects can also be given using the dual language of differential forms. A Pfaffian system 1 of rank s on a smooth manifold M is a map that assigns smoothly to each point p in M a linear subspace l(p) c T*M of dimension s. In other words, a Pfaffian system of rank s is a smooth subbundle of rank s of the cotangent bundle T*M. Such a field of cotangent s-planes is spanned locally by s pointwise linearly independent smooth differential 1-forms w i , . . . ,ws on M, which will be denoted by I = (UJI,... ,w s ). Sometimes we will denote the Pfaffian system I = ( w i , . . . ,CJ S ) by ui = 0 , . . . , ws = 0. In the case of a rank one Paffian system I = (w) we will speak also about a Pfaffian equation u = 0. Two Pfaffian systems I and 1 defined on two manifolds M and M, respectively, are equivalent if there exists a smooth diffeomorphism ip between M and M such that X(p) = (ip*l)(p), for each point pin M. For a Pfaffian system I , we can define its derived flag 1^ D 2' 1 ) D • • • by the relations I<°) = I and l( i + 1 > = {a e I ( i ) : da = 0 mod ! « } , for t > 0, provided that each element X^ of this sequence has constant rank. In this case, it is immediate to see that the derived flag of the distribution V = 1± coincides with the sequence of distributions that anihilate the elements of the derived flag of I , that is v(i)
=
(i«)-L ;
for i > o.
For a given Pfaffian system X, we will say that a point p of M is a regular point if p is a regular point for the distribution V =2±, that is if all elements T>i of the Lie flag are of constant rank in a small enough neighborhood of p.
82
Consider the space J n ( E , R m ) of jets of order n > 1 of functions from R into R m . This space is diffeomorphic to R ( " + 1 ) m + 1 . The canonical coordinates associated to R (denoted by x°) and to R m (denoted by x^,... , x ^ ) can be used to define the canonical coordinates on J n (R, R m ) , which will be denoted by 0 T° r° r1 r1 T" J-OJ-^-I)--- j i f n j J - j , . . . , x m , . . . , x j , . . . x
T"
,x
m
,
with obvious indentifications org = 9 and x° = p° = u*, for 1 < i < m, and xj = p3i, for 1 < i < m and 1 < j < n (see the beginning of the Introduction). Observe that any smooth map tp from R into R m defines a curve in J"(R, R m ) by the relations x{ = tpy\x°), for 0 < i < m and 0 < j < n, where ip^ denotes the j - t h derivative with respect to zfj °f the z'-th component of (p. This curve is called the n-graph of (p. It is clear that not all curves in J"(R, R m ) are n-graphs of maps. In order to distinguish the "good" curves from the "bad" ones, we should introduce a set of constraints on the velocities of curves in J n (R, R m ) . In other words, we should endow J"(R, R m ) with a nonholonomic structure. The canonical contact system on J n ( R , R m ) is the completely nonholonomic distribution spanned by the following family of vector fields: /
n—1 m
( d^f > • • • > 5 i ^ " » 9 4 + E T,xi
\
^7) •
(2.3)
In a dual way, we will also call the canonical contact system on J " ( R , R m ) the Pfaffian system (dx{ - x{+1dx%, 0 < j < n - 1, 1 < i < m) annihilating the above distribution. For the canonical contact system on J"(R, R m ) we will also use the name canonical contact system for curves. By definition, if a curve in J"(R, R m ) is the n-graph of some map then it is an integral curve of the canonical contact system. More precisely, a section a : R -> J n (R, R m ) is the n-graph of a curve ip : R -> RTO if and only if it is an integral curve of the canonical contact system on J"(R, R m ) (see e.g. 3 and 2 5 ) . The aim of our paper is to analyze various possible answers to the question "Which distributions are locally equivalent to the canonical contact system on J"(R, R m ) ? " . The following result, obtained by the authors 2 7 , will be the starting point of our study. Theorem 2.1 (regular contact systems, first version). A rank m + 1 distribution V on a manifold M of dimension (n + l)m + 1 is equivalent,
83
in a small enough neighborhood of any point p in M, to the canonical contact system on Jn(IR, E m ) if and only if the two following conditions hold, for 0^1' that has constant corank one in (ii) Each element T>i of the Lie flag has constant rank (i + \)m + 1. Remarks 1. This result yields a constructive test for the local equivalence to the canonical contact system for curves, provided that we know how to check whether or not a given distribution admits a corank one involutive subdistribution. We give in Section 4 a checkable necessary and sufficient condition for the existence of such a distribution. 2. Item (i) describes the essential geometric property of distributions equivalent to canonical contact systems for curves while the condition (ii) distiguishes regular points p at which X>'*'(p) = T^i(p) from singular points, where this last condition is violated. Different roles of (i) and (ii) justify Definition 2.2 below. 3. Theorem 2.1 was proved in 27 , as a special case of a more general result that gives a normal form for any system satisfying (i) (see Remark 2 above). In Section 5 we will present a direct proof of Theorem 5.6, which is another version, under the weakest possible assumptions, of Theorem 2.1. Definition 2.2 (contact systems). A rank m + 1 distribution T> on a manifold M of dimension (n + \)m + 1 is said to be a contact system if, for any 0 < i < n, each element T>^ of the derived flag, has constant rank (i + l)m + 1 and contains an involutive subdistribution Ci C X>W that has constant corank one in A contact system is said to be a regular contact system at p G M if it is, locally at p, equivalent to the canonical contact system on Jn(R, Rm). Otherwise it will be called a singular contact system at p e M. Theorem 2.1 implies that a contact system is a regular contact system at a point p if and only if the point p is regular. Other, than that of Remark 2 above, equivalent characterizations of regular points of contact systems will be given in Theorems 5.4 and 5.6 , and in Corollary 5.5. 3
History
In this section we give a brief histry of the following problem: Which Pfaffian systems are locally equivalent to the canonical contact system on the space Jn(Rk,Wn) of n-jets of maps from Rk to Mm ? This problem is a natural
84
generalization of the follwing classical problem stated in 1814 by Pfaff: Which Pfaffian systems are locally equivalent to the canonical contact system on the space J1 (Rk,Rm) of 1-jets of maps from Rk to R? Studies of that problem have mainly concentrated on the four following cases of equivalence to the canonical contact system on the space • J^Rfc.R): Pfaff (1814), Frobenius (1877), and Darboux (1882); • J"(M,M): Engel (1890), E. von Weber (1898), Cartan (1914), Goursat (1923), Giaro, Kumpera and Ruiz (1978), Libermann (1978), Murray (1994), Mormul (1998-2001), Pasillas-Lepine and Respondek (1998-2001), Montgomery and Zhitomirskii (1999), • J ^ I f ^ i r ) : Gardner (1972), Bryant (1979); • Jn(R,Rm): Garnder and Shadwick (1992), Murray (1994), Tilbury and Sastry (1995), Aranda-Bricaire and Pomet (1995), Pasillas-Lepine and Respondek (1999-2001). In the following subsections we will describe solutions in each of the four above cases. Throughout this section we will use the notation p° = Uj, for 1 < i < m (see Introduction). 3.1
Pfaff-Darboux normal form
In this subsection we recall the classical solution given by Frobenius and Darboux to the original Pfaff question: which Pfaffian systems are locally equivalent to the canonical contact system on the space J 1 (Rk, E) ? We will need the following notion introduced by Frobenius n and Darboux 7 Definition 3.1. The class, at a point p, of the Pfaffian equation u = 0 is the largest integer p such that
Using the notion of class, Darboux 7 gave the following celebrated answer to the problem. Theorem 3.2 (Darboux, 1882). A Pfaffian equation w = 0, defined on a manifold of dimension 2k + 1, is locally equivalent to the equation given by the following canonical contact form dp0 - pldqi
phdqk = 0
on J1(Rk, R), if and only if its class is constant and equals k. The above canonical contact form is called Pfaff-Darboux normal form.
85
3.2
Bryant normal form
In this subsection we will recall a solution to the generalization of Pfaff's problem to the space of 1-jets of arbitrary maps. The following question has been studied by Gardner since 1972, and by Bryant (who gave a solution in 1979): which Pfaffian systems are locally equivalent to the canonical contact system on the space Jl(Wk, W1) ? In order to give an answer we will need the following generalization of the notion of class of a Pfaffian equation. Definition 3.3. The Engel rank, at a point p, of a Pfaffian system I — [uii,... ,uis) is the largest integer p such that there exists a 1-form a inX for which {{da)p A w i A - - - A w s ) ( p ) / 0. Obviously, in the case of a single Pfaffian equation u = 0, the notion of Engel rank reduces to that of class. A characteristic vector field of a distribution P is a vector field / that belongs to V and satisfies [/, V] C T>. The characteristic distribution of V, which will be denoted by C, is the module spanned by all its characteristic vector fields. It follows directly from the Jacobi identity that the characteristic distribution is always involutive but, in general, it needs not be of constant rank. If for a constant rank Pfaffian system I , the characteristic distribution C of the distribution V = l1- is of constant rank, then its anihilator (C)1is a Pfaffian system, called the Cartan system of the Pfaffian system I and denoted by C(X). We refer the reader to 3 for a definition of the Cartan system given in the language of Pfaffian systems. The following result was proved by Bryant in his Ph.D. Thesis 2 (see also 3 ) . Theorem 3.4 (Bryant, 1979). Assume that m ^ 2. A Pfaffian system 2=
(oJi,...,ojm),
defined on a manifold of dimension m + k + mk and such that I^1' = 0, is locally equivalent to the canonical contact system p\dqk = 0
Pm ~ Pmdqi
Pkmdqk = 0
d
dp\ - p\dqi
on J1 (Rk, lRm), if and only if its Engel rank is constant and equals k, and the rank of its Cartan system is constant and equals m + k + mk. The above normal form of a Pfaffian system is called Bryant normal form. Reasons for which the case m = 2 is excluded will be explained in Section 4, see Lemma 4.2 and Corollary 4.3.
86
3.3
Goursat normal form
Starting with the work of Engel 8 and von Weber 33 , the following question has been intensively studied: which Pfaffian systems are locally equivalent to the canonical contact system on the space J"(R, R) ? The case n — 1 was solved by Pfaff in his pioneering paper 29 ; it is also the simplest case of Darboux theorem given above. The case n = 2 was solved by Engel 8 . In order to give a solution for an arbitrary n, recall, see Introduction, the following fundamental notion. The derived system I' of a Pfaffian system 1 = (UJI, ...,u!s) is the Pfaffian system generated by all 1-forms a in I such that da AOJI A • • • A ws = 0.
Starting from a Pfaffian system 1 and its (first) derived system I ' we define the flag of derived systems 1^ D 1^ D • • • D 1^ D • • • inductively by I<°) = J a n d I < i + 1 ) = ( ! « ) ' . The following characterization of Pfaffian systems, that are locally equivalent to the canonical contact system on the space J"(R, R), was found by von Weber and has been intensively studied by Cartan. Theorem 3.5 (van Weber, 1898 ; Cartan, 1914). A Pfaffian system X = (uii,...,LJn) of rank n, defined on a manifold of dimension n + 2, is is locally equivalent (on an open and dense subset) to the canonical contact system dp0 - pldq = 0 , • • • , dpn~l - pndq = 0 on Jn(M., E) if and only if the elements 1^ of the flag of derived systems are of constant rank n — i, for 0 < i < n. The canonical form present in the above theorem is called Goursat normal form, mainly because it was intensively used by Goursat in his book 14 . We will call a Goursat structure any distribution V (resp. any Pfaffian system I) on a manifold of dimension n + 2 such that the elements of the derived flag X>(") are of constant rank i + 2 (resp. the elements j M 0 f the flag of derived systems are of constant rank n — i, for 0 < i < n). Therefore the above theorem says that a Goursat structure is locally equivalent to a Goursat normal form on an open and dense subset of the underlying manifold. Notice, see Proposition 5.1, that a Goursat structure is just a contact system of rank 2 (a contact system of corank 2, if we use the language of Pfaffian systems). Theorem 3.5 is thus a special case of a more general Theorem 2.1 stating that a contact system is equivalent to the canonical contact system on an open and dense subset. Applying the latter theorem to the case of Goursat
87
structures, the open and dense subset of Theorem 3.5 can be described as points p at which X>W(p) = T>i(p) (as shown earlier by Murray 24 directly for Goursat structures). Other equivalent descriptions of the open and dense set of regular points of Goursat structures will follow from characterizations of regular points of contact systems given in Theorems 5.4 and 5.6 and in Corollary 5.5, stated in Section 5. Here we would like only to emphasize that in the cases n = 1 and n = 2 we do not have to restrict ourselves to an open and dense set. In fact, the conditions dim X^\q) — 0, in the case n = 1, and dim l{1)(q) = 1, dim l(2)(q) = 0, in the case n = 2, satisfied for any q in a neighborhood of a given point p, guarantee that the Pfaffian system I on a manifold, respectively of dimension 3 and 4, is locally equivalent around p to Goursat normal form. Giaro, Kumpera, and Ruiz 13 were the first ones who observed that starting from n = 3, singularities may appear for Goursat structures. Example 3.6 (Giaro et al, 1978). The following Pfaffian system of five variables dx2 — xzdxi = 0 dx$ — Xidxi = 0 dx\ — x^dxi = 0 is a Goursat structure, that is, it satisfies the conditions of the above theorem but is not locally equivalent to the canonical contact system on J 3 (E, E) if x5=0. It was this example with which an increasing interest in the problem of singularities of Goursat structures started (for more results see e.g. 17 , 6 , 22 , 23
28 \
21
!
3.4
>
I'
Canonical contact systems for curves
In this section we will discuss the following question: which Pfaffian systems are locally equivalent to the canonical contact system on the space J"(M, E m ) , that is, to the canonical contact system for curves? We will put the answer, given to that question as Theorem 2.1 in Section 2, in a form analogous to that of Theorems 3.4 and refthm-goursat. Theorem 3.7 (regular contact systems, second version). A Pfaffian system I of constant rank nm, where m ^ 2, defined on a manifold of dimension (n + \)m + 1, is locally equivalent (on an open and dense subset)
88
to the canonical contact system dp0! - p\dq = 0 , • • • , dp7?'1 - p^dq = 0 dp°m -pldq
= 0 , • • • , dp^-1 -p^dq
=0
on J"(E, R m ) if and only if each element j W of the flag of derived systems satisfies the following conditions, for 0 < i < n. (i) 1^ is of constant rank (n — i)m; (ii) The Engel rank ofl^ equals one; (iii) The rank of the Cartan system of I^1' is constant and equals (n — i + l)m + l. The above theorem is given, as Corollary 2.4, in 2 7 . Its proof follows directly from Theorem 2.1 and a characterization, via the notion of Engel rank, of the existence of an involutive subdistribution of corank one in a given distribution. Such a characterization was obtained by Bryant 2 and will be discussed in Section 4. Notice that the formulation of Theorem 3.7 can be considered as a natural combination of, on the one hand, Weber-Cartan's Thereom 3.5 and, on the other hand, of Bryant's Theorem 3.4. Indeed, like Thereom 3.5, it involves the derived flag and requires to exclude some singular points. On other hand, like Theorem 3.4, it expresses the basic geometry of the problem through the notion of Engel rank. As we said, we will discuss links between the geometry and Engel rank in Section 4. What concerns regular points, one characterization as points p such that V^ (p) = T>i (p) was already given in Theorem 2.1. We would like, however, to express that regularity condition in terms of the Pfaffian system I ; but is not clear how to represent the elements T>i of the derived flag in terms of X. For that reason, we will present in Section 5 other equivalent descriptions of regular points, in particular, in terms of Pfaffian systems. 4
Involutive s u b d i s t r i b u t i o n s of corank one
The aim of this Section is to provide checkable conditions to verify (i) of Theorem 2.1 and to justify the statement of Theorem 3.7. This will be done by answering the following question: "When does a given constant rank distribution V contain an involutive subdistribution C C T> that has constant corank one in T>T\ In fact, the answer to this question is an immediate consequence of a result contained in Bryant's Ph.D. thesis 2 . Links between Bryant's result and the characterization of the canonical contact system for
89 curves have also been observed by Aranda-Bricaire and Pomet 1. Recall that in Subsection 3.2 we defined the Engel rank of a Pfaffian system X, at a point p, as the largest integer p such that there exists a 1-form u in X for which we have (dw)p(p) ^ OmodX. The Engel rank of a constant rank distribution V will be, by definition, the Engel rank of its anihilator V-1. Obviously, the Engel rank p of a distribution equals zero at each point if and only if the distribution is involutive. We will now give an equivalent definition of the Engel rank, see 2 7 , in the language of vector fields, in the particular case when p — 1, which will be important in the paper. Let V be a distribution such that Z>(°) and T>^ have constant ranks d0 and di, respectively, and denote ro(p) — d\ (p) — do(p). Assume that d0 > 2 and r 0 > 1. Take a family of vector fields ( / l , - - • , / d 0 ) 5 l ) - - - >#r 0 )
such that 2>(°) = ( / ! , . . . , / d o ) and V& = ( A , . . . ,fdo,gu . . . ,gro). The structure functions ck- associated to those generators, for 1 < i < j < d0 and 1 < k < ro, are the smooth functions defined by the following relations: [/* . / > ] = £ 4 9k mod P<°>,
for 1 < i < j < d0.
It is important to point out that the structure functions are not invariantly related to the distribution V, since they depend on the choice of generators. Assume that the Engel rank p of D is constant and that ro > 1. It is easy to check that p = 1 if and only if either do = 2, or do = 3, or do > 4 and the structure functions satisfy the relations
4-c« - <44 + &U + %A - >,& + « , • = o-
(4-i)
for each sextuple (i,j,k,l,p,q) of integers such that l 1. Then the two following conditions are equivalent: (i) The characteristic distribution CofT> has constant rank CQ = do—ro — 1 and the Engel rank p of V is constant and equals 1; (ii) The distribution T> contains a subdistribution B CD that has constant corank one in T> and satisfies [B,B] C T>.
90
Observe that if the first condition is satisfied then we must necessarily have r 0 < do — 1. The following result is included in the proof of Bryant's 2 normal form Theorem (see also 3 ) . An alternative proof of its surprising item (iii) is given in Appendix A of 27 , where the role of the assumption ro > 3 is explained by relating it to the Jacobi identity. Lemma 4.2 (Bryant). LetV be a distribution such thatV^ andV^ have constant ranks do and d\, respectively. Assume that the distribution T> contains a subdistribution B C T> that has constant corank one in T> and satisfies
[B,B]cV. (i) If ro = 1 then the distribution T> contains an involutive subdistribution C C T> that has constant corank one in T>; (ii) Ifr0>2 then B is unique; (iii) If ro > 3 then B is involutive. Observe that, in the first item of the above Lemma, the involutive subdistribution C can be different from B, which is not necessarily involutive. The following result is a direct consequence of Bryant's work. In order to avoid the trivial case ro = 0, for which the existence of a corank one involutive subdistribution is obvious, we will assume that r 0 > 1. Corollary 4.3 (corank one involutive subdistributions). Let V be a distribution such that X>'0' and T>^ have constant ranks do and d\, respectively. Assume that ro > 1. Then, the distribution V contains an involutive subdistribution C C T> that has constant corank one in D if and only if the three following conditions hold: (i) The characteristic distribution C ofT> has constant rank Co — do—ro — 1; (ii) The Engel rank pofDis constant and equals 1; (iii) If ro = 2 then, additionally, the unique corank one subdistribution B C T> such that [B, B] C D must be involutive. We would like to to emphasize that the above conditions are easy to be checked, and, as a consequence, so are the conditions of Theorems 2.1 and 3.7. Indeed, for any distribution, or the corresponding Pfafnan system, we can compute the characteristic distribution C and check whether or not the Engel rank equals 1 using, respectively, the formula (4.2) and the condition (4.3) below. This gives the solution if ro ^ 2 (equivalently, if m / 2). If r 0 = 2 we have additionally to check the involutivness of the unique distribution B satisfying [B, B] C V, whose explicit construction is also given by (4.4) below. In the sequel, we will show, following Bryant 2 , how to verify whether or not the Engel rank equals 1, and how to construct explicitly — if it exists — the unique corank one subdistribution B C V satisfying [B, B] C V (which, in the case r 0 > 2, is the unique involutive subdistribution of corank one in V).
91 Consider a distribution T> of constant rank d0, defined on a manifold of dimension N. Let w i , . . . ,w So , where so = N — do, be differential 1-forms locally spanning VL, the annihilator of V, that is V± =
(ui,...,uao).
We will denote by I the Pffafian system generated by u\,..., For any form ui 6 V-1, we put W(w) = {/GZ> :
wSo.
/jdweP1}.
Clearly, the characteristic distribution C of V is given by C=f)W(oJi).
(4.2)
Now assume that V^ is of constant rank di > do, that is ro > 1, or, equivalently, that the first derived system 2^ is of constant rank smaller than soBy a direct calculation we can check (see e.g. 3 ) that the Engel rank of the distribution V, or of the corresponding Pfaffian system I, equals 1 at p if and only if (dui A db}j)(p) = 0
modi,
(4.3)
for any 1 < i < j < soNow let us choose a family of differential 1-forms LJi,...,u)ro,Wr0+i,...,uSo such that I = (V^)1= (OJX,. .. ,wSo) and i W = (D^)1= (uv 0 +i,... ,w So ). When condition (i) of Lemma 4.1 is satisfied, independently of the value of ro > 2, the unique distribution B satisfying [B, B] C V is given, as shown by Bryant 2 , by B=Y:\V(LJi).
(4.4)
i=l
In fact, Bryant has also proved that it is enough to take in the above sum only two terms corresponding to any 1 < i < j < ro. In order to verify, in the case ro = 2, the conditions of Corollary 4.3 we have additionally to check the involutivity of this explicitly calculable distribution. Notice that, if the distribution V satisfies Lemma 4.1 (i) and r 0 > 3, then the formula (4.4) gives the unique involutive subdistribution C of corank one in V.
92 5
5.1
Contact systems, characteristic distributions, and involutive subdistributions Contact systems and characteristic
distributions
Let V be a contact system, that is, according to Definition 2.2, each distribution Z?W contains a unique involutive subdistribution d of corank one. It turns out that those involutive subdistributions are unique and, moreover, can be expressed in terms of characteristic distributions. Indeed, we have the following result. Proposition 5.1. Let T> be a rank m + 1 contact system, defined on a manifold of dimension (n + l)m + 1. Each distribution P ^ ' — either for 0 < i < n — 2, if m = 1, or for 0 2 — contains a unique involutive subdistribution Ci C P ' 4 ' that has constant corank one in P « and that, for 0 < i < n — 2, coincides with the characteristic distribution Cj+i o/p( J + 1 >. The following picture summarizes the above proposition. £>(°) c P ^ C • • • C X>("-2) C Pf"- 1 ) C P ( n ) = TM U U U U Co C C\ C • • • C Cn-2 C Cn-\ n n ii C\ C C2 C • • • C C n - i
n £>(i)
n c
(5.1)
n
£>(2) C • • • C D^""1)
The inclusions between corresponding successive elements of the first and second row are those of the definition of contact systems. The inclusions between the elements of the third and fourth row express simply the fact that Ci, being a a characteristic distribution of V^\ is contained in 2?W. The equalities between the corresponding elements of the second and third row express a basic property of the sequence of involutive subdistributions Ci. In the case m = 1, that is for Goursat structures, Proposition 5.1 seems to be already known to Cartan 5 . For a proof we refer the reader to Montgomery and Zhitomirskii 21 (see also 4 , 17 , and 2 0 ) . Incidence relations of distributions V^'s and Cj's have been intensively used by the authors 28 and by Montgomery and Zhitomirskii 21 to study the geometry of Goursat structures at singular points. In the case m > 2, to the best of our knowledge, Proposition 5.1, has never been stated. Notice a substantial difference between the cases m = 1 and m > 2, which is the presence of the canonical involutive subdistribution Cn-i in the second row for m > 2. In the case of Goursat structures, that
93 is if m = 1, the distribution p ( " - 1 ) contains many different involutive sudistributions of corank one but non of them has any canonical properties and therefore in the case m = 1, the second row of (5.1) terminates with £„_2This basic difference between the cases m = 1 and m > 2 will be reflected in different statements of Theorems 5.6 and 5.7, that describe, respectively, regular contact systems for m > 2 in terms of £„_i and, for m = 1, in terms of C n _i = £„-2Definition 5.2. We will call the corank one involutive subdistribution d given in the previous result — either for 0 < i < n — 2, if m = 1, or for 0 2 — the canonical subdistribution o / p W . When proving Proposition 5.1 we will use the following result proved in 2 7 . Lemma 5.3 {Co C CI). Let T> be a distribution such that p ( ° ' , T>^\ and T>W have constant ranks do, di > do + 2, and c?2 > d\ + 2, respectively. Assume that each distribution p W , for i = 0 and 1, contains an involutive subdistribution Ci C P ^ that has constant corank one in p W . Then Co CCiProof: (of Proposition 5.1). In the case m = 1, that is for Goursat structures, the result was proven in 21 (see also 4 , 17 , and 2 0 ) . Consider the case m > 2. By Lemma 4.2, we conclude that all involutive distributions d, for 0 < i < n—1, are unique. In order to show that d = Cj+i, for 0 < i < n — 2, apply Lemma 5.3, with T>(°\ T>^1\ and V^2\ being replaced, respectively, by V^\ T>(i+1\ and X>('+2). We conclude that d C Ci+1. On the one hand, the rank of d equals m{i +1) while, on the other hand, the rank of Ci+i is also equal to m(i +1), because V^+1^ contains a subdistribution C,+i that satisfies [Ci+i,d+i] C X>('+1) (see Lemma 4.1). We thus have d = Ci+iD In the case of Goursat structures, that is m = 1, using the canonical subdistributions we can distinguish singular points from regular ones, see 21 and 2 8 . Below we show that the geometry of incidence of canonical subdistributions describes completely also regular contact systems in the general case m > 2. Indeed, we have the following result. Theorem 5.4 (regular contact systems, third version). A rank m + 1 distribution T>, with m > 2, on a manifold M of dimension (n + l)m + 1 is equivalent, in a small enough neighborhood of a point p in M, to the canonical contact system on J"(R, E m ) if and only if the following conditions hold. (i) Each element P ^ of the derived flag, for 0 < i < n, has constant rank (i + \)m + 1. (ii) Each element T>^> of the derived flag, for 0 < i < n — 2, contains the characteristic distribution C,+i of V^l+1' that has constant corank one in P « .
94 (iii) X>(™-1) contains an involutive subdistribution £n-i that has constant corank one in Z)( ra_1 ). (iv) For any 0 < i < n — 3, we have 1)W (p) is not contained in Ci+2 (p) and, moreover, X>(n_2)(p) is not contained in £„_i(p). Remarks 1. Let us look at items (i)-(iv) in the case of of Goursat structures, that is m = 1. Firstly, item (i) implies, according to Proposition 5.1, item (ii). Secondly, in the case m = 1, as shown in 21 and 2 8 , a Goursat structure (that is a distribution of rank two satisfying item (i)) is locally at p equivalent to Goursat normal form under the regularity conditions V^l\p) ^ d+2(p), for 0 < i < n — 3. Thirdly, being equivalent to Goursat normal form, it clearly satisfies (iii) because it admits infinitely many involutive subdistributions of corank one in Z>(™_1), most of which fulfilling the second part of item (iv). 2. Notice that any distribution T> satisfying (i), (ii), and (iii) is a contact system. Indeed, since the characteristic distributions C; are involutive, we put d = Ci+i and thus each distribution 2?W, for 0 < i < n — 2, contains an involutive distribution £j C V^ of corank one because of (i) and (ii). The one before the last distribution 2?(™_1) contains, by (iii), an involutive subdistribution £ n - i , which is unique and it is the canonical involutive subdistribution in P ^ - 1 ) . 3. As we argued in Remark 2 above, (i)-(iii) imply that T> is a contact system. Item (iv) is thus another way of expressing the regularity condition 2?W(p) = T>i(p). Contrary to this last condition, however, item (iv), as well as items (i)-(iii), can be immediately expressed in terms of Pfaffian systems, which we will state below as Corollary 5.5. 4. We will omit a proof of Theorem 5.4 because it follows from a more general result, Theorem 5.6, which will be stated in Subsection 5.2 and proven in Subsection 5.3. Corollary 5.5 (regular contact systems, fourth version). Let I be a Pfaffian system of rank nm, defined on a manifold M of dimension (n + l)m + 1. If m ^ 2, the Pfaffian system I is locally equivalent, at a given point p of M, to the canonical contact system on J n (M, E m ) if and only if (i) The rank of each derived system ZW is constant and equals (n — i)m, for 0 < i < n. (ii) The rank of each Cartan system C(I^) is constant and equals (n + 1 — i)m + 1, for 0 < i < n — 1. (iii) The Engel rank ofl^n~^ is constant and equals 1. (iv) For any 0 < i < n - 3, C(l^+2^){p) is not contained in l^{p) and, moreover, Jn-\{p) is not contained in T^n~2^[p), where Jn-\ is the unique integrable Pfaffian system such that Z(™_1) is of constant corank
95
one in Jn-\, and whose existence is given by (ii) and (iii). Notice two differences between Corollary 5.5 and Theorem 3.7. Firstly, as we have mentioned in Remark 3 just above, item (iv) of Corollary 5.5 gives a description of the open and dense set of regular points of Theorem 3.7. Secondly, when using Corollary 5.5 we have to calculate the Engel rank of l ' " - 1 ) only (equivalently, to verify the existence of an involutive subdistribution of corank one in the distribution X>(™_1) only). 5.2
Contact systems and involutive subdistribution
£n-i
The aim of this subsection is to show that all information about a distribution V, which is locally equivalent to the canonical contact system on J n (K, R m ) , that is, about a regular contact system, is encoded completely in the canonical involutive subdistribution £ n _ i . This information concerns, simultaneously, the existence of all canonical distributions d = C;+i, for 0 < i < n — 2, the regularity of the point p, as well as the desired ranks of all intermediate distributions 2?W. In fact, we have the following result. Theorem 5.6 (regular contact systems, fifth version). A distribution V of rank m + 1, with m >2, on a manifold M of dimension (n + l)m + 1 is equivalent, in a small enough neighborhood of a point p in M, to the canonical contact system on Jn(R, K m ) if and only if the following conditions hold. (i) £>(") = TM. (ii) XH" -1 ' is of constant rank nm + 1 and contains an involutive subdistribution £n-i that has constant corank one in (iii) T>(°)(p) is not contained in Cn-i{p). If the conditions (i)-(iii) are satisfied then, of course, the distribution £ „ _ i , whose existence is claimed by (ii), is unique and it is with the canonical subdistibution of p f " " 1 ) . It is interesting to see how much information is encoded just in the existence of the canonical involutive subdistribution Cn-i and its regular intersection with Z>(°). In this case, the distribution £n-i "knows" about the existence of all canonical distributions £, = Cj+i, as well as about the regularity of all intersections of Z>(*) with C i + 2 . Notice, however, that although Cn-\ "knows" how to distinguish regular points from singular ones, it does not "know" about the geometry of the incidence of various DW's and C,-'s at singular points corresponding to different extended Kumpera-Ruiz normal forms (see Section 8). Theorem 5.6 was stated for m > 2, thus excluding m = 1, for the obvious reason: in the case of Goursat structures, that is for m = 1, we do not have the
96 canonical involutive subdistribution £ „ - i . The second row of (5.1) terminates at £„_2 = Cn-\. It can be noticed, however, that a "non-canonical" version of Theorem 5.6 holds also for m = 1: a rank-two distribution is equivalent to a Goursat normal form if and only if there exists a distribution £„_i satisfying the conditions (i),(ii), and (iii) of Theorem 5.6. Necessity is seen immediately from Goursat normal form while sufficiency follows from the sufficiency part of the presented proof of Theorem 5.6, which is the same independently of the value of m. What is important to emphasize, however, is that in the case m = 1, the condition (iii) is, in general, non veryfiable. In fact, if ranks of D( n _ 1 ) and T>^ equal, respectively, n + 1 and n + 2 then X>("-1) contains an infinity of involutive subdistributions of corank one. In order to check condition (iii) we have to calculate (some of) them and it is not clear how to do it because the method presented in Section 4 and based on Engel rank does not apply. Moreover, even if we would be able to find one such an involutive subdistribution, it may happen that it does not satisfy (iii) while others do. We will show now that an analogue of Theorem 5.6 holds for Goursat structures, that is for m = 1, with Hn-\ replaced by Cn-\. In fact we have the following result. Theorem 5.7 (Goursat normal form). A distribution T> of constant rank two, on a manifold M of dimension n + 2, is equivalent, in a small enough neighborhood of a point p in M, to Goursat normal form, that is to the canonical contact system on J n (R, E), if and only if the following conditions hold. (i) £>(") = TM. (ii) J)(n~2> is of constant rank n; moreover, the characteristic distribution Cn-i of X>(ra_1) is contained in £>(" -2 ) and has constant corank one in T>(n~2K (iii) p(°)(p) is not contained in Cn-i(p). Notice that we assume neither that T>^, for 0 < i < n — 3, are of constant rank nor that X>(n_1) is of constant rank nor that the ranks of 2?W grow by one at any point: the characteristic distribution C n _i "knows" about all that. 5.3
Proof of Theorem 5.6
Proof: Necessity is obvious. We prove sufficiency by giving a sequence of local diffeomorphisms that bring the distribution V to the canonical contact system on J"(E, R m ) . For simplicity, we will use the notation
dx>'
K
dx{,'"'dxL
97
Since £ n - i is an involutive distribution of constant corank m + 1 in TM we can choose m + 1 smooth functions >o, <j>i, . . . ,0 m such that (d(j)0,d(l)i,...,d(f>m) = (^n-i)- 1 in a neighborhood of p. Item (iii) implies that there exists a vector field g~o € T>(°> such that go(p) £ £n-i(p). Moreover, there exists a function fa such that LgQ
r
- JL
( ~ - - dz1'"m'dx»)
J n 1 (
A-)
and d ''O
^
A l
d
,. d
d .
i=l
Since p(™ ^ is of constant rank and corank of £ n _ i in 2?(" ^ equals one, item (iii) implies that 2?( n_1 ) = £ „ _ i + (#0)- Hence Z>(") = pf"" 1 ) + [ZXn-^ZX"-!)] is given by X > ( n ) = £ „ _ i + [9d,£„_i] + (S0). This relation and item (i) imply that we can choose among - ^ j , for 1 < i < m, 1 < j < n, vector fields / i , . . . , fm, for such that P<"> = £ „ _ i + ([po, /i], 1 < » < m) + (go). In particular, this implies that the differentials dfa^,, d
98
and d
V^
i
d
.,
d
d ^
We claim that
Suppose that there exists a vector field / £ X>(n_2) such that / ^ J"„-2- Since go € D("-2> and P< n - 2 ) c X*^"1) = ( 5o ) + £ „ - i , we can suppose that
for suitable smooth functions /3j, 1 < i < m, where at least one function, say /3k, is not identically zero in a neighborhood of p. Since / € X>(n_2) and 2 but [/, 5o ] = E " i Agftr ffo G Z><°) C P ( " - ) , it follows that [f,g0] € V^V _1 mod£„_!, which clearly is not in X>(™ ) = £ n _ i + (g0) thus yielding a contradiction. Hence it follows that V(n~2) C ( § § * , . . . , ^ ) + (0)We will repeat analogous reasoning for the general step and the proof will follow by an induction argument. Suppose that we have introduced a local coordinate system (XQ,X0,... ,xn), where xj = {x{,... ,x3m), for 0 < j < n, and such that
A =4>\ iorO<j
=Lgo
— l and 1 < i < m. Suppose, moreover, that in those coordinates
as well as 2 ? ( " - * ) c ^ „ _ ? ) = ( ^ , . . . , ^ ) + («*,)
(5.3)
and ^-
+ 1 )
=(5o)
+
(^zr)mod(A,...,^_).
(5.4)
Notice that we do not assume the ranks of £>(""«) and of 1)("-
99
We will prove that equations (5.2), (5.3), and (5.4) hold with q being replaced by q + 1. To start with, observe that X>("-«+1) = Z>(n-«) + [£>("-»),£>("-«)] together with (5.3) imply that we can find m vector fields h, • • •, fm G X» (n_9) such that P<"-' + 1 > = &>) + ([/<,»>], l < i < m )
mod(^,...,^).
After relabelling xj, for q < j < n and 1 < i < m, if necessary, we can suppose, because of (5.3) that d d d t A< ^ /i = ^ ™ ° d ( ^ T I , . . . , — ) .
G T>(n~9^, the above expression implies that
Since fi,...,fm ^
^
M
+ ^ m o d ^ , . . . , ^ ) .
(5.5)
Moreover, it follows that the differentials d(j>Q, dcjyf, for 0 < j < q and 1 < i < m, are linearly indpendent at p. Introduce new coordinates by replacing x\ by
for 1 < i < m. In new coordinates, denoted still by x\, the distribution (— — ) v d a ; « ' ' " ' dxn' is preserved while the vector field g0 becomes
for some smooth functions 4>J+1, 1
<m.
T
, . . . , A ) + (»,).
(5.7)
Suppose that there exists a vector field / e X>("-«_1) such that / ^ ^ r ( n _,_ 1 ). Since y0 G £>("-) and P * " - ' " 1 ) c £>(""«), we can suppose, because of (5.5), that ^
Q
Q
Q
100
for suitable smooth functions /?,, 1 < i < m, where at least one function, say Pk, is not identically zero in a neighborhood of p. Since / e D t " - ? - 1 ) and g0 6 E H i f t ^ P (o) c 2?(n-9-i), it follows that [f,go] E 2>("-»> but [/, 5o ] = m o d ( g f 7 , . . . , gf^-), which clearly is not in p("-») because of (5.5). This yields a contradiction thus proving that (5.7) holds. Now observe that the three just proved conditions (5.6), (5.7), and (5.5) correspond, respectively, to (5.2), (5.3), and (5.4), with q being replaced by q + 1. Hence by an induction argument we arrive after n steps at Vi0)
C
*» =
(
}
^
+
(5o)
'
where r±
w=
n—1
m
p.
+
+
r\
a4 gS^ 'S|
mod( )
^-
Since r>(0) is of constant rank m + 1 it follows that X>(°) = T0 = ( ^ ) + (g0), which ends the proof. • 5.4
Constructing canonical coordinates
The presented proof gives a method to calculate a diffeomprphism bringing a regular contact system V of rank m + 1 to the canonical contact system on Jn(Rk, Rm), starting from m + 1 independent functions (j>%, 0 ° , . . . , >£, whose differentials annihilate £ n _ i , that is
(d0g,d0;,...,d^) = (£n_1)-L. Choose a vector field gQ G V^ such that go(p) $ Cn-\. Without loss of generality (see the beginning of the proof), we can suppose that Lgo(f>Q(p) / 0. Define x° = <$ and
J
= &
L
9Q^i
=
for 0 < j < n and 1 < i < m. It follows from the presented proof that in the coordinates (XQ,X°, ..., xn), the contact system T> takes the form
T>-(JL
—
A
rv
i+'i)
101
5.5
Proof of Theorem 5.7
Proof: Necessity is obvious. In order to prove sufficiency, choose a local coordinate system (xi,... ,xn+2) such that x(p) = 0 £ R™+2 and that
c
-(d
-?-)
ax\
oxn-i
We will identify the point p with 0 € R"+ 2 . Since Z>(°) (0) is not contained in C„_i(0), choose a vector field g0 6 V^ such that gQ(0) ^ C„_i(0). By multiplying go, if necessary, by a nonvanishing function, we can assume that 9o = 9o 5I7 + 9o+1 asf^T + s^f^ m o d c « - i • Because C„_i is of corank one in X>("-2) and g0(0) $ C n _i(0), it follows that D<"- 2 ) = C n _! + (50). Hence
*~" = <»•£•••• • 5 b k ' s r ' - - ^ s ^ » -
(5 8)
-
We claim that dim Z>(n_1)(g) = n + 1 for any q in some neighborhood of p = 0. In order to prove it, we will firstly show that dim V^n~1'(q) < n + 1 for any q in some neighborhood of p = 0. If not, there is a sequence of points qi, i = 1,2,... such that qi -> p and such that dim V^n~1\qi) = n + 2. Take a sequence of open neighorhoods Ui, such that qi € Ui and dim Vl^n~1\q) = n + 2 for any q £ \J Ui. Hence on any Ui, the characteristic distribution C„_i of X^"" 1 ) coincides with D*""1) = TM, which contradicts the fact that C„_i is of rank n — 1. Now w are going to prove that dim V^n~l\q) = n +1 in a neighborhod of p = 0. Suppose that dim V^n~1\p) = n. Denote Cj = g | - , for 1 < j < n — 1. There exist an integer 1 < k < n — 1 and a sequence of points qt, i = 1,2,... such that qi -» p and such that [ck,9o](qi) £ 1>(n~2\qi); otherwise, in view of (5.8), we would have, in a neighborhood of p, that £>(™_1) = £>("~2), which contradicts V^ = TM. Take a sequence of open neighborhoods Ui, such that qi 6 t/j and [ck,go](l) $ X^ n _ 2 '(g) for any q &\JUi. From the fact that dim V^n~1\q) < n + 1 it follows that there exist smooth functions a_,-, for 1 < j < n — 1, defined on |J Ui and such that [CJ > 9o] = aj [cfc, go] mod 2?("- 2) .
(5.9)
on (JUi. Now recall that the vector fields Cj, for 1 < j < n - 1, are characteristic vector fields of Z>("_1) and hence [a, [cj,go]] 6 Z>' n_1 ), for any 1 < i, j , < n — 1. Thus we have 2>(n) = 2?(»-D +
( [ 5 o , [c
^
1 < j < n - 1).
102
Notice that (5.9) implies that [30, [9,So]] = ctj[g0, [ck,go]]mod'D<-n~1^ on \jUi. Since dim V^n-^(p) = n, it follows that dim X>
oxn-i
We define an involutive distribution £„_i = (gf~, • • • , gf-) and the remaining part of the proof follows the same line as that of Theorem 5.6. • 6
Flatness of contact systems
In this Section we will discuss flatness of nonholonomic control systems, that are feedback equivalent to a canonical contact system for curves. Consider two control systems, with m + 1 controls, m
S:
x — 2_]fi(x)ui
= f(x)u
and
(6.1)
i=0 m
t : x = ^2fi(x)
Ui = f(i) u,
(6.2)
i=0
evolving respectively on two open sets X and X of RN, where u = (u0,...,umy, u - (u0,...,um), / = (fo, • • •, fmf, and / = (fo,...,fm). We say that the systems E and E are feedback equivalent if there exits a smooth diffeomorphism ip : X -> X and a feedback u = /3u, where the matrix P, whose entries /3j are smooth functions, is invertible at any x 6 X, such that
MfP) = f, where for any vector field g on X we denote by
103
Since the distribution V remains invariant under any invertible transformation u = (iu, all objects that we construct with the help of V can be considered as feedback invariant objects attached to E. The concept of flatness was introduced to control theory by Fliess, Levine, Martin, and Rouchon 9 , 10 in order to characterize control systems that are linearizable by endogenous feedback. This concept goes back to Hilbert 1 5 and Cartan 5 It is easy to observe that contact systems are flat. In this section we explain how the geometry of contact systems, described in previous Sections, provides additional information on various aspects of the flatness of contact systems. Consider a nonlinear control system E of the form (6.1). We say that E is x-flat at (x*,u*) E M.N x E m + 1 (see 10 , 16 , 30 ) if there exits a neighborhood V0 = X0 x Uo of (x*,u*) and smooth functions (pt on X0, for 0 < i < m, called x-flat outputs, having the following property: there exits an integer k and smooth functions •ji, 1 < i < N, and Si, 0 < i < m, such that we have Xi = 7. (>,¥>, •••,V (fe) ), Ui = Si(tp,tp,...,ip^),
l
where
104
canonical contact system on J"(K,M m ). Then we have. (i) £ is x-flat at any (x*,u*) such that (u*)°nv(x*) ^ 0. (ii) The dynamic precompensator zx
= z2 ;
Zn
=
(6.3) V0
linked with the system via the dynamic feedback law « — Hmv I
vfh
J J
where vm = ( « i , . . . ,vmY and 7 is a suitably chosen nonvanishing function, renders the overall system, controlled by {vo,vi,...,vm)t, static feedback linearizable at any point (x*,z*) such that z\ ^ 0. (iii) As x-flat outputs we can choose any m + 1 smooth functions (pa, ipi,...,
105
7
A n Example
In this Section we will consider a simple example given by a kinematical model of a car for which both the front and rear wheels are steerable, see 31 . We denote by (xo,yo) (resp. by (xi,j/i)) the coordinates of the midpoint between the two front (resp. rear) wheels and by a0 (resp. by c*i) the angle of the front (resp. rear) axle with respect to the horizontal. Finally, by tp we denote the angle of the bar connecting the two axles with respect to the horizontal. The two nonholonomic constraints reflecting the fact that the front and rear wheels roll without sleeping are given, respectively, by fi0 = 0 and Qi = 0 where differential 1-forms ilo = sin aodxo — cos aodyo J7i = smaidxi — cosaidyo. The holonomic constraints %i —
XQ
+ c o s ij}
2/i = 2/o +sinV> define a map tp from (S 1 ) 3 x E 2 , equipped with the coordinates (tp,a0,ai,xo,yo) into (5 1 ) 3 x R 4 , equipped with the coordinates (ip,ao,a{^xo,,yo,xi,yi). The pull-backs wo =
= 7r/2 + kn, k 6 Z} C X
and
S2 = {ct\ — ao = kit, k € Z} C X. The differential 1-forms UJQ and uj\ are linearly independent at p 6 X if and only if p ^ S\ n S2- Therefore outside Si fl S2, the nonholonomic constraints define a control system of the form e = /o(0«o + / i ( 0 « i + / 2 ( 0 « 2 , where f = (^,oio,oii,xo,yo) are coordinates on X = (S 1 ) 3 x R 2 , and the distribution V = ( / 0 , / i , / 2 ) , where / 0 = -£-, h = 3^7, and / 2 = cos(ai - ip) ( c o s ( a 0 ) ^ + s i n ( a 0 ) ^ J + sin(ai - a 0 ) ^ .
106 It is interesting to notice that at points of S\ D S2, integral curves of the distribution V = (wo,Wi)x do not represent all trajectories of the system subject to the nonholonomic constraints (uo,uii). Indeed, through any point p £ Si f)S2 there pass trajectories of the system whose velocities do not belong to V(p). We thus consider the model of a car outside Si fl S2. Clearly, the distribution V contains the involutive subdistribution *
I da0 ' Sen / "
of corank one in V. Since n = 1, the distribution C = (~^-, ~^-) is the canonical involutive subdistribution £ n _ i . By a direct calculation we check that V^(p) is of rank five if and only if p £ Si U 53, where S 3 = {a0 - ip = TT/2 + fcTr, k € Z} C X. Therefore at any configuration point outside Si n S3, the model is feedback equivalent to the canonical contact system for curves on J X (E, R 2 ). It is interesting to observe that at points of S2 that are outside Si U S3, the system, although not being equivalent to a cononical contact system, is flat. It can, moreover, be transformed via a local feedback to the following normal form ±1 = x 5 u 0 ±2 =
X1U1
X3 =
U0
X4 =
Ui
x5 = u2, which generates a nilpotent Lie algebra. As flat outputs we can choose X2, X3, and Xi. Notice that the form of the set of singular controls at which the system ceases to be flat changes: it is formed by the union of the planes u0 = 0 and «i = 0 in E 3 . Finally, we would like to mention the following difference between kinematical model of a car towing trailers and that of a multisteerable car. The former defines a Goursat structure (that is a contact system of rank two) at any point of its congfiguration space and, conversly, any Goursat structure can be locally equivalent to that kinematical model at a well choosen point of its configuration space (see 28 and 2 1 ) . This correspondence is no longer valid for multisteerable cars. They define a contact system of rank m +1 > 3 at almost all configurations but, in general, they fail to do so at some configurations (like at p € Si U S3 for the considered example).
107
8
Singular points and extended Kumpera-Ruiz normal forms
The aim of this Section is to study the class of distributions that satisfy condition (i) of Theorem 2.1 but fail to satisfy condition (ii) of that theorem. The fist condition describes the geometry of the canonical contact system while the second condition characterizes regular points. Recall that a distribution that satisfies the former but fails to satisfy the latter at a point p is called a singular contact system at p (see Definition 2.2). In this Section we will recall a result of 27 stating that any such distribution can be brought to a normal form for which we propose the name extended Kumpera-Ruiz normal form. Those forms generalize the canonical contact system on J 1 (R, Rm) in a way analogous to that how Kumpera-Ruiz normal forms (see e.g. 17 , 2 1 , 2 3 , and 28 ) generalize the canonical system on J1(M,1R), which is also called Goursat normal form. Consider the family of vector fields K1 = (K\, ... , K^, KJ) that span the canonical contact system on JX(IR, M.m), where K1
i
- -AK1 - -Aaxp • • • ' "-m — aT£
—
and the family of vector fields AC2 = (K 2 , . . . , K^, KQ) that span the canonical contact system on J 2 (M, K m ) , where 2
-
K
a -A K-2 — H£[' • • • > ^m — o ^
"'l
—
K2
_ ji
a
,
, 2
a_ ,
a
I
,
,
d_ ,
I
a
Loosely speaking, we can write 2 9 d *2 K *"1 — 5 x f ' • • • ' ^m — a ^ T K0 = XxKt + |- XmKm + KQ.
In order to make this precise we will adopt the following natural notation. Consider an arbitrary vector field / given on Jn~1(R, E m ) by n —1 m
/ = E E / / ( ^ - 1 ) ^ + /o°(^-1)4> j=0i=l
u
i
where J " " 1 denotes the coordinates XQ,X°,... , x°m, x\,... , xlm,... , a;" - 1 ,... n_1 m , x ^ of J ( E , E ) . We can lift the vector field / to a vector field on Jn(R, Rm), which we also denote by / , by taking n—1 m f=
v w ^ - ^ j=0i=l
+^ n - ^ a
+Q
.
a +-.. + 0 - 4 - .
108
That is, we lift / by translating it along the directions -^,...
, -J^r-
Notation(lifts of vector fields) . From now on, in any expression of the form n% = S f c o a « ( x ) K r _ 1 ' t h e vector fields K ^ - 1 , . . . , / C ^ - 1 should be considered as their above defined lifts. Let K n _ 1 = ( K ? - 1 , . . . , K ^ - 1 , K ™ _ 1 ) denote a family of vector fields defined on Jn~1(M.,Mm). A regular prolongation, with a parameter c", of K n _ 1 , denoted by Kn = Rc„ ( K " _ 1 ) , is a family of vector fields nn = « , . . . , K £ , K£) defined on J " ( E , E m ) by „ra _
d
n
_
d
(8.1) where cn = ( c " , . . . , cJJ,) is a vector of m real constants. A singular prolongation, with a parameter c™, of /c n _ 1 , denoted by K™ = S C n (/e n - 1 ), is a family of vector fields Kn = (K?, . . . , KJJ,, K#) defined on J n (R, E™) by a
„n _
„n
«0" = (*? + W *
_
+ • • • + « - l + C_ 1 )«»-_ 1 1 + K""1 + XnmK%-\
n
^ " ^
where c = ( c " , . . . , c|J l _ 1 ,0) is a vector of m real constants, the last one being zero. A family of vector fields K" on J " ( E , R m ) , for n > 1, will be called an extended Kumpera-Ruiz normal form if K" = CT„ O • • • o ^ ( K 1 ) , where for each 2 < i < n the map Oi equals either Rct or Sci, for some vector parameters c1. In other words, a Kumpera-Ruiz normal form is a family of vector fields obtained by successive prolongations from the family of vector fields that spans the canonical contact system on J 1 (M, R m ) . The above defined prolongations and prolongations-based definition of extended Kumpera-Ruiz normal forms generalize for contact systems analogous operations introduced by the authors 28 for Goursat structures. Let x : M -> R(»+i)™+i =* J " ( R , R m ) be a local coordinate system on a manifold M, in a neighborhood of a given point pin M. We will say that an extended Kumpera-Ruiz normal form on J"(R, Rm), defined in x-coordinates, is centered at p if we have x(p) = 0. For example, on J 2 (R, E 2 ), we have the two following extended Kumpera-Ruiz normal forms -r2 d.
( JL-
-2,
\d^'
8if ) Xl 8^
I r2 +
a^
9
.
I -r1
9
.. I T 1
-+• X2 \X1 gjs
9
.. I
-TX2Q^
d "\ -+- Q^)
J ,
109
defined by R^^K1) and 5(0,o)(«*), respectively. These two normal forms are obviously centered at zero. Recall, see Definition 2.2 that we define a contact system as a distribution V such that each element 2?W of its derived flag has constant rank (i + l)m + l and contains an involutive subdistribution A C V^ that has constant corank one in PW, for 0 < i < n, that is as a distribution satisfyng the condition (i) of Theorem 2.1. Moreover, we say that a contact system is regular at p if it satisfies at p the regularity condition (ii) of that theorem and is singular at p if it fails to satify that condition. The following theorem from 27 asserts that extended Kumpera-Ruiz normal forms serve as local normal forms for all, regular or singular, contact systems for curves. Theorem 8.1 (extended Kumpera-Ruiz normal forms). A contact system T> of rankm+1 on a manifold M of dimension (n + l)m + 1 is equivalent, in a small enough neighborhood of any point p in M, to a distribution spanned by an extended Kumpera-Ruiz normal form, centered at p and defined on a suitably chosen neighborhood of zero. Acknowledgments This survey is based on lectures delivered by the authors at the Conference on Geometric Control Theory and Applications, organized by Alfonso Anzaido Meneses, Bernard Bonnard, Jean-Paul Gauthier, and Felipe Monroy Perez, at Universidad Autonoma Metropolitana (Unidad Azcapotzalco), Mexico City. The authors are grateful to the local organizers, in particular to Alfonso Anzaido Meneses and Felipe Monroy Perez, for having organized the conference and for their hospitality. Moreover, they are grateful to Jean-Baptiste Pomet for discussions on his results 1. References 1. E.Aranda-Bricaire and J.-B. Pomet, Some explicit conditions for a control system to be feedback equivalent to extended Goursat normal form. In Proceedings of the IF AC Nonlinear Control Systems Design Symposium, (Tahoe City California, 1995). 2. R.Bryant, Some aspects of the local and global theory of Pfaffian systems. Ph.D. thesis (University of North Carolina, Chapel Hill, 1979). 3. R.Bryant, S-S. Chern, R. Gardner, H. Goldschmidt, and P. Griffiths, Exterior Differential Systems. Mathematical Sciences Research Institute Publications. (Springer-Verlag, New York, 1991).
110
4. M.Canadas-Pinedo and C.Ruiz, Pfaffian systems with derived length one. The class of flag systems. Transactions of the American Mathematical Society, 353, 1755-1766, (2001). 5. E.Cartan. Sur I'equivalence absolue de certains systemes d'equations differentielles et sur certaines families de courbes. Bulletin de la Societe Mathematique de France, 42, 12-48. (Euvres completes, Part. II, Vol. 2, (Gauthiers-Villars, Paris, 1914). 6. M.Cheaito and P.Mormul, Rank-2 distributions satisfying the Goursat condition: All their local models in dimension 7 and 8. ESAIM Control, Optimisation, and Calculus of Variations, 4, 137-158 (1999). 7. G.Darboux, Sur le probleme de Pfaff. Bulletin des Sciences mathematiques, 2(6), 14-36, 49-68 (1882). 8. F.Engel, Zur Invariantentheorie der Systeme Pfaff'scher Gleichungen. Berichte Verhandlungen der Koniglich Sachsischen Gesellschaft der Wissenschaften Mathematisch-Physikalische Klasse, Leipzig, 41,42, 157-176; 192-207 (1889), (1890). 9. M.Fliess, J.Levine, P.Martin, and P. Rouchon, Sur les systemes non lineaires differentiellement plats. Comptes Rendus de I'Academie des Sciences, 315, 619-624 (1992). 10. M.Fliess, J.Levine, P.Martin, and P.Rouchon, Flatness and defect of nonlinear systems: Introductory theory and examples. International Journal of Control, 6 1 , 6, 1327-1361 (1995). 11. G.Frobenius, Uber das Pfaff'sche problem. Journal fiir die reine und angewandte Mathematik, 82, 230-315 (1877). 12. R.Gardner and W.Shadwick, The GS algorithm for exact linearization to Brunovsky normal form. IEEE Transactions on Automatic Control, 37, 2, 224-230 (1992). 13. A.Giaro, A.Kumpera, and C.Ruiz, Sur la lecture correcte d'un resultat d'Elie Cartan. Comptes Rendus de I'Academie des Sciences de Paris, 287, 241-244 (1978). 14. E.Goursat, Lecons sur le probleme de Pfaff, ( Hermann, Paris, 1923). 15. D. Hilbert, Uber den Begriff der Klasse von Differentialgleichungen. Mathematische Annalen, 73, 95-108 (1912). 16. B. Jakubczyk, Invariants of dynamic feedback and free systems. In Proceedings of the European Control Conference, Groningen, (1993). 17. A.Kumpera and C.Ruiz, Sur I'equivalence locale des systemes de Pfaff en drapeau. In F. Gherardelli, editor, Monge-Ampere equations and related topics, (Instituto Nazionale di Alta Matematica Francesco Severi, Rome, 201-247, 1982). 18. P.Libermann, Sur le probleme d'equivalence des systemes de Pfaff non
111
completement integrables. Publications Paris VII, 3, 73-110 (1977). 19. V. Lychagin, Local classification of non-linear first order partial differential equations. Russian Mathematical Surveys, 30, 1, 105-175 (1975). 20. P.Martin and P.Rouchon, Feedback linearization and driftless systems. Mathematics of Control, Signals, and Systems, 7, 235-254 (1994). 21. R.Montgomery and M.Zhitomirski Geometric approach to Goursat flags. (Preprint, University of California Santa Cruz 1999). 22. P.Mormul, Rank-2 distributions satisfying the Goursat condition: All their local models in dimension 9. (Preprint, Institute of Mathematics Polish Academy of Sciences, 1997). 23. P.Mormul, Goursat flags: classification of codimension-one singularities. (Preprint, Warsaw University, 1999). 24. R.Murray, Nilpotent bases for a class of nonintegrable distributions with applications to trajectory generation for nonholonomic systems. Mathematics of Control, Signals, and Systems, 7, 58-75 (1994). 25. P.Olver, Equivalence, Invariants, and Symmetry. (Cambridge University Press, 1995). 26. W.Pasillas-Lepine and W.Respondek, On the geometry of control systems equivalent to canonical contact systems: regular points,singular points, and flatness, in Proceedings of the 39th IEEE Conference on Decision and Control, 5151-5156 (Sydney, Australia, 2000). 27. W.Pasillas-Lepine and W.Respondek, Contact systems and corank one involutive subdistributions. To appear in Acta Applicand&Mathematicas (2001). 28. W.Pasillas-Lepine and W.Respondek, On the geometry of Goursat structures. ESAIM Control, Optimisation, and Calculus of Variations, 6, 119-181 (2001). 29. J-F. Pfaff, Methodus generalis, aequationes differentiarum partialum, nee non aequationes differentiales vulgares, utrasque primi ordinis, inter quotcunque variabiles, completi integrandi. Abhandlungen der KoniglichPreufiischen Akademie der Wissenschaften zu Berlin, Mathematische Klasse, 76-136 (1814-1815). 30. J.-B. Pomet, A differential geometric setting for dynamic equivalence and dynamic linearization. In B. Jakubczyk, W. Respondek, and T. Rzezuchowski, editors, Geometry in Nonlinear Control and Differential Inclusions, 32, 319-339. (Banach Center Publications, Warszawa, 1995). 31. D.Tilbury and S. Sastry, The multi-steering n-trailer system: A case study of Goursat normal forms and prolongations. International Journal of Robust and Nonlinear Control, 5, 4, 343-364 (1995). 32. A.Vinogradov, I.Krasil'shchik, and V.Lychagin, Geometry of Jet Spaces
112
and Nonlinear Partial Differential Equations. (Gordon and Breach, New York, 1986). 33. E. von Weber, Zur Invariantentheorie der Systeme Pfaff'scher Gleichungen. Berichte Verhandlungen der Koniglich Sachsischen Gesellschaft der Wissenschaften Mathematisch-Physikalische Klasse, Leipzig, 50, 207-229 (1898). 34. M.Zhitomirski, Normal forms of germs of distributions with a fixed segment of growth vector. Leningrad Mathematics Journal, (English translation), (2), 1043-1065 (1991).
113
THE BRACHISTOCHRONE PROBLEM A N D MODERN CONTROL THEORY HECTOR J. SUSSMANN Department of Mathematics Rutgers University Hill center, Busch Campus Piscataway, NJ 08854, USA E-mail: [email protected]. edu URL: http://www.math.rutgers.edu/~ sussmann JAN C. WILLEMS Department of Mathematics University of Groningen P.O. Box 800, 9700 AV Groningen, The Netherlands URL: http://wvjw.math.rug.nI/~ willems Dedicated to Velimir Jurdjevic on his 60"1 birthday. 1
Introduction
The purpose of this paper is to show that modern control theory, both in the form of the "classical" ideas developed in the 1950s and 1960s, and in that of later, more recent methods such as the "nonsmooth," "very nonsmooth" and "differential-geometric" approaches, provides the best and mathematically most natural setting to do justice to Johann Bernoulli's famous 1696 "brachistochrone problem." (For the classical theory, especially the smooth version of the Pontryagin Maximum Principle, see, e.g., Pontryagin et al. 31 , Lee and Markus 2 6 , Berkovitz 3 ; for the nonsmooth approach, and the version of the Maximum Principle for locally Lipschitz vector fields, cf., e.g., Clarke 12 '', Clarke et al. 14 ; for very nonsmooth versions of the Maximum Principle, see Sussmann 35-36,39,4o,4i,42,43,44. for t n e differential-geometric approach, cf., e.g., Jurdjevic 24 , Isidori 19 , Nijmeijer and van der Schaft 3 0 , Jakubczyk and Respondek 2 0 , Sussmann 37 - 40 .) We will make our case in favor of modern control theory in two main ways. First, we will look at four approaches to the brachistochrone problem, presenting them in chronological order, and comparing them. Second, we will look at several "variations on the theme of the brachistochrone," that is, at several problems closely related to the one of Johann Bernoulli. The first of our two lines of inquiry will be pursued in sections 3, 4, 5, and 6, devoted, respectively, to
114
1. Johann Bernoulli's own solution based on an analogy with geometrical optics, 2. the solution based on the classical calculus of variations, 3. the optimal control method, and, finally, 4. the differential-geometric approach. We will show that each of the three transitions from one of the methods in the above list to the next one leads to real progress for the brachistochrone problem, by making it possible to derive stronger conclusions about it than those that were obtainable by means of previously existing techniques. Specifically, we will point out that l.a the differential equation derived by Johann Bernoulli has spurious solutions (i.e., solutions other than the cycloids), as was first noticed by Taylor in 1715, but l.b the application of the Euler-Lagrange condition of the calculus of variations eliminates these solutions and leaves only the cycloids, and that 2.a with the calculus of variations approach, the existence of solutions is a delicate problem, due to the non-coercivity of the Lagrangian, but 2.b the optimal control control method renders this question trivial, reducing the proof of existence to a straightforward application of the Ascoli-Arzela theorem, and, moreover, 3.a the usual calculus of variations formulations require that one postulate that the optimal curve is the graph of a function x >-> y(x), but 3.b with the optimal control control method this postulate becomes a provable conclusion.
115
These observations show that the first two of the three transitions brought improvements to the analysis of Johann Bernoulli's problem. But the core of our argument is 6, where we look at the third transition and the advent of differential-geometric control theory. We will argue that, on the one hand 4.a previous methods require that we assume extra knowledge of physics (in the form of the law of conservation of energy) in order even to be able to translate Johann's problem into mathematics, and 5.a with those methods an anomalous situation appears to arise when one looks for a state space formulation of the problem and asks for its "Hamilton principal function" V (that is, the value function regarded as a function of both the initial and terminal states), since V ought to be a function of an even number v of variables, but for the brachistochrone problem the best choice of v seems to be five; but on the other hand 4.b in the differential-geometric framework one does not need to bring in conservation of energy in order to formulate the problem; instead, one writes the equations as a control system in ffi4, and then computes the accessibility distribution, which turns out to be three-dimensional at each point; this shows that a nontrivial conserved quantity exists locally, and direct computation shows that it exists globally and is equal to the energy, and 5.b the anomaly described in 5.a disappears, and the principal function V turns out to be defined on E 4 x K4 (although V(q, q') < +00 if and only if q and q' belong to the same leaf of the foliation of R4 by the level submanifolds of the energy function); the method provides a full explanation for the apparent anomaly, by showing that the full optimal synthesis requires impulse controls that lead to instantaneous jumps. The discussion in 6 will also show that the differential-geometric approach brings into the problem interesting connections with other mathematical ideas. To begin with, the analysis leads naturally to a minimum time optimal control problem with a four-dimensional state space and an unbounded scalar control entering linearly into the dynamics. Moreover, this problem is quite degenerate, because its accessibility distribution happens to be three-dimensional, as
116
pointed out above. Since the problem is affine in the control but not linear, complete controllability on each leaf is in principle problematic. The accessibility Lie algebra turns out to be the "diamond Lie algebra," a well known four-dimensional solvable Lie algebra that occurs, for example, in the study of the quantized harmonic oscillator. To establish controllability on each leaf one needs additional arguments, and it turns out that the issue can be settled by computing the Jurdjevic-Kupka Lie saturate (cf. Bonnard et al. 8 ' 9 , Jurdjevic-Kupka 21>22; Jurdjevic 24 ) of the family of system vector fields. The minimum time problem then makes sense in principle for every pair of points belonging to the same leaf. But, since the control is unbounded, it is not at all obvious that an optimal control joining A to B exists for every pair (^4, B) of points belonging to a given leaf L. An application of the Maximum Principle yields a vector field Z tangent to the leaves such that all optimal arcs are integral curves of Z. Since, in general, two arbitrarily chosen points A, B of a leaf L do not lie on the same integral curve of Z, it follows that for general pairs (A, B) € L x L an optimal control joining A to B does not exist. On the other hand, when a control system is completely controllable and a suitable properness condition is satisfied a , then most mathematicians would agree that optimal controls ought to exist, and if they do not then this can only happen because we have not made a good choice of our space U of admissible controls, so U has to be enlarged by adding suitably defined "generalized controls." (For a trivial example, consider the problem of moving from A to B in minimum time with the dynamics x = u, u arbitrary, so in particular no bound is prescribed for the velocity u. Clearly, the "minimum time," is 0, and to attain it one needs to allow instantaneous jumps, which means that the class of ordinary controls has to be enlarged to allow for Delta functions. We will show in 6 that something like this happens for the brachistochrone.) In our case, the true complete optimal synthesis of the problem turns out to require impulse controls, a fact known to be common in problems with "cheap" unbounded controls, and studied in other (linear quadratic) contexts by Jurdjevic and Kupka, cf. Jurdjevic-Kupka 23 , Kupka 2 5 . Our second group of arguments in favor of modern control is presented in 7, and consists of "five modern variations on the theme of the brachistochrone." Following a suggestion made by M. Hestenes in 1956, we "speculate on what type of brachistochrone problem the Bernoulli brothers might have formulated had they lived in modern times" (Hestenes 18 , p. 64), and we "See Definition 6.3 for a precise statement of the properness condition, and Proposition 6.4 for the proof that the condition is satisfied for the brachistochrone problem.
117
extend Hestenes' idea by speculating not only on "what type of . . . problem the . . . brothers might have formulated" but also on what type of answer they might have liked for such problems. We deal with five questions. The first one is Hestenes' own "variation of the brachistochrone problem," which turns out to be a problem solvable by optimal control but not by classical calculus of variations techniques. The second "variation" is the "reflected brachistochrone," a very natural extension of Johann's problem, in which the state space is the whole plane rather than a half plane. This problem is no longer solvable by means of traditional smooth or nonsmooth optimal control methods—because it is a minimum time optimal control problem with a non-Lipschitzian right-hand side—but turns out to lend itself to the "very nonsmooth" approach, which yields a solution with a simple geometric interpretation that, in our view, the Bernoulli brothers would have liked. The third "variation" is the brachistochrone problem with friction, which corresponds, mathematically, to "unfolding" the original Johann Bernoulli question by embedding it in a one-parameter family of problems, the parameter being, of course, the friction coefficient p. These problems turns out to be nondegenerate, in the sense that, for example, their accessibility distribution has rank four at each point. Consequently, their time-optimal controls behave qualitatively like the time-optimal controls for generic control-affine systems in R4 with scalar unbounded controls. In particular, through every point there pass a one-parameter family of optimal curves, since the optimal control is given in feedback form as a function of the state and of an additional scalar parameter that stays constant along each trajectory. The analysis clarifies the way in which the original problem of Johann Bernoulli is degenerate: the accessibility Lie algebra is eight-dimensional for p ^ 0 but four-dimensional for p = 0; the accessibility distribution has rank four everywhere if p ^ 0 but has rank three everywhere if p = 0; the optimal "feedback" control is a function of the state and an extra parameter, but this parameter only occurs in a term that is multiplied by p, so that when p = 0 the optimal control is a function of the state only. The fourth "variation" deals with the derivation of Snell's law of refraction from general necessary conditions for an optimum. Since Snell's law plays a crucial role in Johann's solution of the brachistochrone problem, we speculate that a natural question for him to have asked "if he had lived in modern times" is whether the general theories about minimizing curves that were created in the three centuries after Johann's work actually cover the Snell law case. Our answer is negative if only the classical calculus of variations and pre-1990 smooth and nonsmooth optimal control are considered, but becomes positive
118
if we add to the list our recent very nonsmooth methods To conclude the paper, we take the liberty of including a fifth "variation" that we find amusing but does not really have much to do with control theory. In this "variation"—which is a digression on a topic of great importance and related to geometry, to the brachistochrone, and to Johann Bernoulli—we "speculate" that Johann Bernoulli would have found it very interesting to know b that with his work on the brachistochrone he had been extremely close to solving one of the most important open problems in Geometry, namely, that of the independence of Euclid's fifth postulate from the other ones. (The problem had intrigued mathematicians since ancient times—cf., e.g., Bonola 10 —and was very much in the forefront of research in geometry in Johann's times, as shown by the publication of Saccheri's book 32 in 1733. A definitive solution was found by Beltrami in 1868, cf. Beltrami 2 and Stillwell 33 .) Remark 1.1. An earlier, related version of the argument presented here appeared in 3 8 . That paper also dealt with the evolution from the brachistochrone to the calculus of variations and optimal control, but focused on a different set of issues, especially on the search for the correct Hamiltonian formulation of the necessary condition for an optimum and how opportunities were missed before the "control Hamiltonian" was finally discovered in the 1950s. Q 2
Johann Bernoulli and the brachistochrone problem
In the June 1696 issue of the journal Acta Eruditorum, Johann Bernoulli—a Swiss-born professor of mathematics at the University of Groningen, in the Netherlands0—challenged mathematicians to solve the "problema novum" of finding the curve that—following Leibniz' suggestion—he named the "brachistochrone," from the Greek /3paxicroq: shortest, and xP^vcx;: time d . The journal's May 1697 issue contains articles on this problem by six of the most renowned mathematicians of the time: Johann Bernoulli, Johann's elder brother Jakob, Leibniz, Newton, the marquis de l'Hopital, and Tschirnhaus. Leibniz called Johann Bernoulli's question a "splendid" problem. The fact that he and five other thinkers of such unparalleled distinction chose to * Although he probably would not have thought of asking the question. c T h e Bernoulli family was originally from Antwerp in Flanders, where they lived until 1583. Like many other Flemish Protestants, they fled Flanders to escape religious oppression by the Spanish rulers. They spent some time in Frankfurt, and finally settled in Basel, Switzerland, early in the seventeenth century. d So the brachistochrone is the solution of a minimum time problem, i.e., of a genuine optimal control problem in the modern sense of the term!
119 become actively engaged in the search for its solution shows that at the time of its formulation the problem was perceived by the leaders of the mathematical community as a major challenge, lying at the very frontiers of their research. It would not have been easy at that point to predict the future impact on science of Johann Bernoulli's challenge. Yet, the six famous authors of the 1697 papers must have had their own reasons to sense that an exceptionally promising line of inquiry was being opened, and the developments of the 300 years that followed have lent ample support to their intuition. Today, it is clear that the events of 1696-97 represented a critical turning point in the history of mathematics, and it is widely agreed that with them an important new field, later to be called the "calculus of variations," was born. R e m a r k 2 . 1 . The words "calculus of variations" were first used by Euler in a 1760 paper, cf. 1 5 . Euler had received, in 1755, a letter from a 19-year-old mathematician from Turin, called Ludovico de la Grange Tournier, where a new method was proposed for the study of variational problems, by using what we would now call "variations" (cf. Goldstine ie, p. 110.). This was quite different from the approach Euler had been using until then, and presented in his 1744 book entitled Methodus inveniendi maximi minimeve proprietate gaudentes sive solutio problematis isoperimetrici latissimo sensu accepti, that is "A method for discovering curved lines having a maximum or minimum property or the solution of the isoperimetric problem taken in its widest sense." Euler's earlier method was based on a time-discretization followed by a passage to the limit?, as the size h of the time intervals goes to 0. Euler was so enthusiastic about the new idea of the unknown youngster from Turin that he dropped his own method, adopted that of Lagrange instead, and renamed the subject the calculus of variations. In the summary to his first paper using variations, Euler says "Even though the author of this [Euler] had meditated a long time and had revealed to friends his desire yet the glory of first discovery was reserved to the very penetrating geometer of Turin LA GRANGE, who having used analysis alone, has clearly attained the same solution which the author had deduced by geometrical considerations." £> T h e newborn subject was destined t o become a major area of m a t h e matics. Moreover, its implications would soon extend t o physics, whose very foundations would b e shown in t h e 18th century—by Euler, Maupertuis, Lagrange, and others—to depend on principles formulated in t h e language of the calculus of variations. So it is not surprising t h a t t h e story of t h e brachistochrone is told in e
Euler himself talked about "letting h be infinitesimal."
120
many books, and that the importance of this curve is stressed in most histories of mathematics. The brachistochrone has received honors not commonly bestowed on mathematical curves. For example, it is depicted in a stainedglass window of the Academy building (the main venue of the university) in Groningen. Moreover, the brachistochrone is probably the only mathematical curve that has been deemed worthy of a monument in its honor. In 1994, on the occasion of the 375th anniversary of its foundation, the University of Groningen decided to honor in various ways the most famous former members of its faculty. In the case of Johann Bernoulli, who had been a professor from 1695 to 1705, a decision was made to honor him by erecting a monument to the brachistochrone, one of the most significant discoveries—and one of which he was particularly proud—that he made during his Groningen period. The unveiling of the brachistochrone monument, located in the Zernike complex of the University, took place in 1996, coinciding with the 300th anniversary of the publication of Johann's challenge in Acta Eruditorum. 2.1
Johann Bernoulli's challenge
The June 1696 challenge took the form of an "Invitation to all Mathematicians to solve a new problem": If in a vertical plane two points A and B are given, then it is required to specify the orbit AMB of the movable point M, along which it, starting from A, and under the influence of its own weight, arrives at B in the shortest possible time. So that those who are keen of such matters wiJJ be tempted to solve this problem, is it good to know that it is not, as it may seem, purely speculative and without practical use. Rather it even appears, and this may be hard to believe, that it is very useful also for other branches of science than mechanics. In order to avoid a hasty conclusion, it should be remarked that the straight line is certainly the line of shortest distance between A and B, but it is not the one which is traveled in the shortest time. However, the curve AMB—which I shall disclose if by the end of this year nobody else has found it—is very well known among geometers. Later, Johann Bernoulli changed his original plan to disclose the solution by the end of 1696 and, following a suggestion by Leibniz, extended the deadline until Easter 1697.
121
Responses came from the best mathematical minds of the time. In addition to Johann's own solution, there was one by Leibniz, who had communicated it to Johann in a letter dated June 16, 1696; another one by Jakob; one by Tschirnhaus; one by l'Hopital and, finally, one by Newton. Newton's solution was presented to the Royal Society on February 24, 1697 and published, anonymously and without proof, in the Philosophical Transactions. (The identity of the anonymous author was clear to Johann Bernoulli, since he thought that you can know ex ungue leonem, i.e., that you can know "the lion from its claws.") The May 1697 issue of Acta Eruditorum contains articles with the solutions by Johann 5 and Jakob 6 , as well as contributions by Tschirnhaus and l'Hopital, a short note by Leibniz, remarking that he would not reproduce his own solution, since it was similar to that of the Bernoullis, and Newton's anonymous paper, reprinted from the Philosophical Transactions. 2.2
The cycloid's double role as the brachistochrone and the tautochrone
As is apparent from Johann Bernoulli's announcement, he was under the impression that the problem was new. However, Leibniz knew better: Galileo in his book on the Two New Sciences in 1638 formulated the brachistochrone problem and even suggested that the solution was a circle. (Galileo had showed—correctly—that an arc of a circle always did better than a straight line—except, of course, when B lies on the same vertical line as A—but he then wrongly concluded from this that the circle is optimal.) Johann Bernoulli considered the fact that Galileo had been wrong on two counts, in thinking that the catenary was a parabola, and that the brachistochrone was a circle, as definitive evidence of the superiority of differential calculus (or the Nova Methodus, as he called this new set of techniques, following Leibniz). He was thrilled by his discovery that the brachistochrone was a cycloid. This curve had been introduced by Galileo who gave it its name: related to the circle. Huygens had discovered a remarkable fact about the cycloid: it is the only curve with the property that, when a body oscillates by falling under its own weight while being guided by this curve, then the period of the oscillations is independent of the initial point where the body is releasedJ Therefore Huygens called this curve, the cycloid, the tautochrone (from TOLVTCX;: equal, and xpovcx;: time). Johann Bernoulli was amazed and somewhat puzzled, it seems, by the fact that the same curve had these two remarkable properties related to the 'Contrary to what Galileo thought, the circle has this property only approximately: the period of oscillation of a pendulum is a function of its amplitude.
122
time traveled on it by a body falling under its own weight: Before I end I must voice once more the admiration that I feel for the unexpected identity of Huygens' tautochrone and my brachistochrone. I consider it especially remarkable that that this coincidence can take place only under the hypothesis of Galilei [HJS
2.3
Why was the brachistochrone so important in 1696-97?
Perhaps the crucial fact about Johann Bernoulli's question is that he is telling us very clearly that the solution is a curve that everybody knows, and yet there appears to be no way to guess which curve it is by means of some intuitive geometric argument. This situation should be compared with that arising in another famous and much older question about curve minimization, the isoperimetric problem. In this problem, we are asked to find the simple closed rectifiable curve that encloses the largest possible area among all simple closed rectifiable curves of a given length, and the answer also turns out to be a curve that is certainly "very well known among geometers," namely, a circle. But in this case it is fairly easy to guess directly that the answer is a circle, even though it is a delicate matter to give a rigorous proof. For example, it suffices to observe that the question is rotationally symmetric, so the answer ought to be a rotationally symmetric curve, and the only such curve is the circle. Although this argument does not amount to a completely rigorous proof9, it is undoubtedly rather convincing, and makes it quite obvious that the solution must be a circle. Therefore, if Johann Bernoulli had challenged "the best mathematical minds" of his time to solve the isoperimetric problem, it would not have made s
T h e argument assumes the existence of a solution, as well as its uniqueness up to translations. Indeed, it might conceivably happen that the solution is not unique, and in that case the only conclusion one can draw from rotational symmetry is that every rotation will map a solution 5 to a solution S', which may be different from S.
123
sense for him to say, as he did in his brachistochrone challenge, that "the curve—which I shall disclose if by the end of this year nobody else has found it—is very well known among geometers," since everybo,y would have guessed immediately that the mysterious curve was the circle. In the case of the brachistochrone, there is no way to guess h. The problem was posed and solved at a time when the Calculus was being invented, and cannot be solved without using Calculus. So it provides an impressive illustration of the power of the Calculus to solve problems that cannot be solved in any other way, and to discover truths about the world that can be stated and understood in "well known" terms ', but can only be arrived at by using this new mathematical tool. 3
The standard formulation and Johann Bernoulli's solution
We now discuss the "standard formulation" of the brachistochrone problem in modern mathematical language, as it is usually found in modern books, and Johann Bernoulli's ingenious solution based on an analogy with geometrical optics. In our view, the standard formulation is questionable. We will explain our objections in 6 below, where we will make a case for a different approach, based on differential-geometric control. But first it is necessary to present the classical point of view in detail. The key fact is that the "movable point M" is supposed to move "under the influence of its own weight," which presumably means "under the influence of its own weight and nothing else other than whatever force is needed to keep M on the given curve." This means, in particular, that energy is conserved. 3.1
Formulation of the brachistochrone problem
We choose x and y axes in the plane with the y axis pointing downwards, use (a, a) and (b, j3) to denote, respectively the coordinates of the endpoints A fe Even now, 300 years later, we are not aware of any simple geometric argument that might lead to the cycloid without using Calculus. ' T h i s is an important point. Compare the brachistochrone, for example, with Newton's 1685 work on the shape of a body with minimal drag. In this case, the solution also requires the Calculus, but once we have solved the problem all we find is a curve defined by some strange formula. This curve was not "well known to geometers," and would not have had any particular significance to mathematicians, who would only retain from going through Newton's solution the fact that the solution is "some curve." In the case of the brachistochrone, one does not need the Calculus to explain what the solution is, since cycloids were already well understood curves, but one does need it to discover that the solution is a cycloid.
124
and B of our curve, and fix a number B e l , thought of as the total energy of the particle. The condition characterizing the feasible paths [0,T] B t H- ^(t) = (*(*)»!/(*)) e K2
(3.3.1)
will then be—using m, g to denote, respectively, the particle's mass and the gravitational acceleration—that the sum of the kinetic energy ^{xty)2 +y(t)2) and the potential energy —gmy(t) is equal to E. We can certainly choose units so that m = 1. The condition then becomes l
-(i(t)2
+ y{t)2)-gy{t)
= E.
So we formally define an {A, B, E)-feasible trajectory (or (A, B, E)-feasible path) to be a map (3.3.1), defined on some interval [0, T], such that (i) t(0) = A, £(T) = B, (ii) £ is absolutely continuous, (iii) \{x{t)2 + y(t)2) = E + gy{t) for almost all t G [0,T]. Notice that Condition (iii) implies in particular that the derivatives x and y are bounded, so a feasible path is in fact Lipschitz continuous. Condition (i) states that the path £ must start at A and end at B. The number E + ga is the initial kinetic energy of the body. (Often, only the case E + ga = 0 is considered, corresponding to the body being dropped at time 0 with zero initial speed.) Condition (ii) is of course a modern technicality that would have made no sense to Johann Bernoulli, who was far from imagining that there could exist curves that cannot be recovered by integrating their derivative. Condition (iii) reflects conservation of energy. (The law that the kinetic energy of a body which has fallen from a height h is increased by an amount proportional to h was due to Galileo, and was well known in Bernoulli's time.) An (A, B, .E)-feasible path £ : [0, T] -> E 2 is said to be optimal if there exists no (A, B, £)-feasible path f: [0, f ] -> E 2 for which f < T. An (A, B, E)brachistochrone is either (a) an optimal (A, B, E)-feasib\e path, or (b) the geometric locus in ffi2 of such a path, that is, a subset B of E 2 such that B = {(x,y) G E 2 : there exists t G [0,T*], such that (x,y) = £*(*)} , for some optimal (A, B, .E)-ieasible path £* : [0, T*] i-> E 2 . A brachistochrone is an object which is an (A, i?,.E)-brachistochrone for some A,B,E.
125
Obviously, a feasible path" (3.3.1) must be entirely contained in the closed half-plane H
+(v) = {(x,y) : y > -n] ,
where
n= —,
(3.3.2)
since, for y(t) to be < — n, the kinetic energy would have to be negative, which is of course impossible. It is clear that the solution cannot always be a straight line, as Johann Bernoulli rightly points out in his "Invitation." For example, consider the extreme case when E = 0 and a = ct = (3 = Qj£b. (That is, when the endpoints of the curve are at the same height but do not coincide, and the initial kinetic energy vanishes.) We will show that in this situation there is a feasible path that goes from A to B in finite time. Since the straight-line segment S from A to B is horizontal, (iii) implies that the speed of motion along S vanishes, and then it will follow that S cannot be an optimal path, because the motion along S takes infinite time. To construct a feasible path from A to B we follow a circle C with center on the x axis. The circle can be parametrized by x, taking values in the interval [0, b]. The speed v of motion along C will be proportional to ^/y, and hence bounded away from 0 as long as x is bounded away from 0 and b\. Near A, we can also use y as a parameter, and then y \, 0 as x ], 0, and v behaves like -^ and also like y/y, so ^ ~ -j=, showing that t stays finite as x and y approach 0, since the function y H-> -4= is integrable near y = 0. A similar argument shows that t stays finite near B. So C joins A to B in finite time. 0 3.2
Johann Bernoulli's
solution
It turns out that the brachistochrone is a cycloid. When E = 0, it is the curve described by a point P in a circle that rolls without slipping on on the x axis, in such a way that P passes through A and then through B, without hitting the x axis in between. (It is easy to see that this defines the cycloid uniquely.) Johann Bernoulli's ingenious derivation of the brachistochrone has been the subject of numerous accounts, but since this event plays a crucial role in our own tale, we will briefly tell the story again. Johann Bernoulli based his derivation on Fermat's minimum time principle. If we imagine for a moment that instead of dealing with the motion of a moving body we are dealing with a light ray, Condition (iii) above gives us a °FVom now on, as long as A, B and E are fixed, we just talk about "feasible paths" and "brachistochrones," without explicitly specifying A, B and E.
126
formula for the "speed of light" c(x,y) as a function of the position (x,y): c(xiy)
= ^/2E + 2gy.
We now change coordinates so that E = 0. (This amounts to moving the x axis upward to a height rj.) Then r) is now equal to 0, so our feasible paths live in the half plane H+ = H+(0). Also, let us rescale—or, if the reader so prefers, "change our choice of physical units"—so that 2g = 1. Then our problem is exactly equivalent to that of determining the light rays—i.e., the minimum-time paths—in a plane medium where the speed of light c varies continuously as a function of position according to the formula c[x,y) = y/y. It is then reasonable to expect that, if we use a suitable discretization of our problem, then the optimal paths of the discretized problem will approach those of the original problem as the discretization parameter 5 goes to 0. Johann Bernoulli did this as follows. Let us define ysk=kS
for
S > 0 and it = 0 , 1 , . . . ,
and then divide the half-plane H+ into horizontal strips Sskd={(x,y)eR2:yi
for
k = 0,1,...,
of height S. Johann's discretization is then obtained by replacing c by a constant csk in each strip Sk. The constants c\ are defined by
4 = yvi+i
for
each
k
•
He then computed the light rays for the original problem by taking the limit of the light rays for the discretized problem as 6 j . 0. The light rays of the discretized problem can be studied using Snell's law. Clearly, the paths will be straight-line segments within each individual strip, and all that needs to be done is to determine how these rays bend as they cross the boundary between two strips. The answer is provided by the laws of optics as developed by Snell, Descartes, Fermat, Leibniz and Huygens. Snell had observed that, if the speeds of light on the two sides Hi, Hi of a line L in the plane are different constants «i, i>2, and a light ray R traverses Hi and then enters H2 after being refracted at L, then the ratio fj^V" °^ ^ e s m e s of the incidence and refraction angles is a constant, independent of 61. (By definition, 9i is, for i = 1,2, the angle formed by the part Ri of R that lies in Hi with the line perpendicular to L. It is clear that the Ri are straight lines.) Fermat subsequently showed that this is precisely what happens when light
127
is assumed to follow a minimum-time path. The law relating the incidence angles to the velocities of propagation is due to Leibniz and Huygens, and implies the law of Snell. It says that sin 0i vi ——— = — sin0 2 v2
. or, equivalently,
sin 0i sin0 2 = , vi v2
,,,,>
v(3.3.3)
Johann Bernoulli used (3.3.3) to study the light rays of the discretized problem. If R is such a ray, and we let Rk be the part of R that lies in the strip S|, and use 8sk to denote the angle of Rk with a vertical line, then (3.3.3) enabled him to conclude that the quantity
sin0f
t1/in is a constant, since in each strip S% the speed of our light ray is t/yjfe+1. Passing to the limit as 5 \. 0, we conclude that the sine of the angle 0 between the tangent to the brachistochrone and the vertical axis must be proportional to ^/y. Since dx
sin 0 = sjdx
1
+ dy2
,
we find that dx2 dx + dy2 ~ 2
Vy
'
where v is a constant. Then dx2 4- dy2 _ 1 dx2 vy I.
e., 1 + y'(x)2
C 1 - — , where C = - .
So the curve described by expressing the y-coordinate of the brachistochrone as a function of its x-coordinate will satisfy the differential equation
y'(x) = J^f^, V y(x) for some constant C.
(3.3.4)
128
The parametrized curves tp i-> (x((p),y(
C y(ip) = —(1-cos
0<
satisfy (3.3.4). It is easily seen that these equations specify the cycloid generated by a point P on a circle of diameter C that rolls without slipping on the horizontal axis, in such a way that P is at {XQ, 0) when ip = 0. Moreover, it is also easy to check that (*) given two points A and B in H+ there is exactly one curve passing through A and B and belonging to the family of curves (3.3.5). (The parameter count for (*) is obviously right: (3.3.5) describes a 2parameter family of curves; requiring that the curve pass through A fixes one of the parameters, and then asking that it pass through B fixes the other. Proving (*) requires a bit more work, but is still quite easy.) 4 4-1
Spurious solutions and the calculus of variations approach Remarks on Johann Bernoulli's
argument
The argument that we have presented is the one of Johann Bernoulli, and Equation (3.3.4) is the one that he wrote in his paper, followed by the statement "from which I conclude that the Brachistochrone is the ordinary Cycloid." (He actually wrote dy = dx./-^^, but he was using x for the vertical coordinate and y for the horizontal one. Cf. 34 , p. 394.) In present day notation, it is customary to adopt the convention that the symbol y/r stands for the nonnegative square root of r, but it is obvious that Johann Bernoulli did not have this in mind. What he meant was, clearly, what we would write today as
or, equivalently, y(x)(l + y'(x)2) = constant.
(4.4.2)
In particular, the solution curves should be allowed to have a negative slope, contrary to what a "modern" interpretation of (3.3.4) might suggest. But y' should stay continuous, so that a switching from a + to a — solution of (4.4.1) is not permitted.
129 Even with the more accurate rewriting (4.4.2), the differential equation derived by Johann Bernoulli also has spurious solutions, not given by (3.3.5). Indeed, for any y > 0, the constant function y(x) = y is a solution, corresponding to C = y. More generally, one can take an ordinary cycloid given by (3.3.5), follow it up to y>=7r—so that dy/dx=Q—then follow the constant solution y(x)=C for an arbitrary time T, and then continue with a cycloid given by (3.3.5). Such paths are, indeed, compatible with Huygens' law of refraction. Remark 4.1. The existence of the spurious solutions was pointed out by Brook Taylor (1685-1731) in 1715. (Taylor is known to mathematicians as the discoverer of "Taylor's expansion," the inventor of integration by parts, and the creator of the calculus of finite differences. Like many other mathematicians of his time, he was involved in a priority dispute with Johann Bernoulli, involving Taylor's 1708 solution of the problem of the center of oscillation, that went unpublished until 1714.) <£ 4-2
The calculus of variations approach
The spurious solutions, and all the other problems, such as the apparent arbitrariness of the requirement that y' be continuous, can be eliminated in a number of ways. For example, one can prove directly that the spurious trajectories are not optimal. Or one can use, as an alternative to Johann Bernoulli's method, the calculus of variations approach, based on writing the Euler-Lagrange equation. This equation gives a necessary condition for a function y* to minimize the integral
J= /
L(y(x),y'(x),x)dx
Ja
within the class y of all functions [a,b] B xt-^ y(x) e R that satisfy some appropriate technical conditions (for example, the requirement that y(-) is Lipschitz continuous) and are such that y(a) and y(b) have given values a, j3. Here, the "Lagrangian" 0 x R x [a, b] 3 {y,u,x) >->• L(y,u,x)
GR
is a given function, and Q is an open interval in R. Under suitable technical
130
conditions on L, yt, and the set y, if j/* is a minimizer then the condition
dx \ du X
V* (x) ,y'.(x),z))
=-Q- (v* (x), y', (x), x)
(4.4.3)
must be satisfied for almost all x. It is easy to see that the above result can be applied to the brachistochrone problem, provided that we postulateb that it suffices to consider curves in the x, y plane that are graphs of functions x t-> y(x) denned on the interval [a, b]. Then Constraint (iii) can be written (taking E = 0 and 2g = 1 as before) as dx2 +dy2 = y dt2 , which gives dt =
v/cte2 + dy2 — = L(y, y )dx.
where
L(y,u) = ^ ± Z .
(4.4.4)
Vy So Johann Bernoulli's problem becomes that of minimizing the integral J = /
L{y(x),y'{x))dx,
J a
subject to y(a) = a and y(b) = /?, where L is given by (4.4.4). This gives the equation l + y'(x)2+2y(x)y"(x)
= 0,
(4.4.5)
which is stronger than (4.4.2), since (4.4.2) is equivalent to y' + y' +2yy'y" = 0, i.e., to j/'(l + y' + 2yy") = 0, whose solutions are those of (4.4.5) plus the spurious solutions found earlier. It is easy to verify that the solutions of the Euler-Lagrange equation (4.4.5) are exactly the curves given by (3.3.5), without any extra spurious solutions, showing that, for the brachistochrone problem, the Euler-Lagrange method gives better results than Johann Bernoulli's approach. We now show that optimal control is even better. ''With optimal control, this "postulate" becomes a provable conclusion, as will be shown in 5 below.
131
5
The optimal control approach
Having shown that the Euler-Lagrange equation gives better results than Johann Bernoulli's method, we now look at another important step in the evolution of the theory of minimizing curves, namely, optimal control theory. We show that optimal control provides even better results in two ways: 1. With optimal control it is no longer necessary to postulate that the optimal curve is the graph of a function x i-» y(x). 2. In the optimal control setting, the problem of the existence of an optimum becomes trivial. 5.1
The brachistochrone as an optimal control problem
We can formulate Johann Bernoulli's question as an optimal control problem, in which the motion takes place in the x, y plane, and the dynamical behavior is given by x = u^/\y\,
y = vy/\y~\.
(5.5.1)
Here the control is a 2-dimensional vector (u, v) taking values in the set U = {(u,v):u2+v2
= 1}.
(5.5.2)
(Actually, for the "true" brachistochrone problem the motion is restricted to the upper half plane, so we could have written y/y rather than y/\y\. We choose to use the more general expression y\y\ because later, in the study of the reflected brachistochrone, we will want to work in the whole plane.) Let us use p, q, p0 to denote, respectively, the momentum variables conjugate to x and y, and the abnormal multiplier. Then the control theory Hamiltonian H(x,y,u,v,p,q,po,t) is given (using a = sgny) by the formula H(x,y,u,v,p,q,p0,t)
= (pu + qv)y/ay - p 0 .
The Pontryagin Maximum Principle then tells us that if a curve [0,T] 9 i .->£(*) = (*(*),»(*)) is optimal then there exist absolutely continuous functions t »->• p(t) and 11-> q{t), and a nonnegative constant po, such that, if we let u = x, v — y, and write p to denote the momentum vector (p, q), and \\p\\ to denote its Euclidean norm y/p2 + q2, then the Hamiltonian maximization conditions
• ( 0 -iwoii' "<,, = »
(5 5 3)
'-
132
as well as the "adjoint system" of differential equations
«„=„,
W-_*'*M±%M«)__-4ai 2
2 vow)
,
(5.5.4)
v<w)
are satisfied for almost all t. (Notice that \\plt)\\ ^ 0. Indeed, the Maximum Principle also gives the condition that H = 0. So ||p|| = 0 would imply p0 = 0, contradicting the nontriviality of the triple (p(t),q(t),p0).) If the constant p vanishes, then x = 0, so we get a vertical line. Otherwise, x is always ^ 0, showing that we can use x to parametrize our solution. Since y>{x)
=
!k ax
=
i = l = lt x u p
(5.5.5)
we have l+y'(x)2
= ^ -
(5.5.6)
and y
„{x)
=
l.*L p dx
i.. px
=
(s.5.7)
But (5.5.1) and (5.5.3) imply that a; =
*
Ibll
,
(5.5.8)
and then (5.5.4) and (5.5.7) yield »"(*) = -
2 ML & • 2
<5-5-9)
2t/P So 2yy" = - ^
= - ( 1 + y'2), and then l + y'2+2yy"
= 0,
(5.5.10)
which is exactly Equation (4.4.5). As before, this leads to the cycloids, with no "spurious solutions." Notice that this argument does not involve any discretization or any use of Snell's law of refraction. Notice also that in our control argument we have not postulated that the solution curves could be represented as graphs of functions y(x). We have proved it! This should be contrasted with the analysis based on the calculus of variations, where this fact had to be postulated.) This is one example showing that, for the brachistochrone problem, the optimal control method gives better results than the classical calculus of variations.
133
5.2
Optimality proofs and the existence problem
For a second example showing the advantages of the optimal control method over the classical calculus of variations for the specific case of the brachistochrone problem, we turn to the question of the rigorous proof of the optimality of Bernoulli's cycloids. Clearly, no argument based solely on necessary conditions for optimality will ever prove that a trajectory is optimal, because it could happen, for example, that there are no optimal trajectories, in which case the statement that "every optimal trajectory is a cycloid" would be vacuously true. If we really want to prove the optimality of Bernoulli's cycloids, an extra step is needed. To give a rigorous proof of the optimality of the cycloids, valid for all choices of A and B in the closed half-plane H+ = {x,y) : y > 0}, one can proceed in two ways. One possibility (cf. Bliss 7 ) is to use Hamilton-Jacobi theory. Another, much simpler, approach, is to prove first the existence of an optimal trajectory. Indeed, once this existence result is known for all A, B 6 H+, then it is clear that any optimal trajectory £» : [0, T] t-> H+ going from A to B must be such that its restriction £, \[a, /?] to every subinterval [a, /?] of [0, T] is also optimal for the problem P(a, /?) with endpoints £»(«), £*(/?). (This is a rather obvious point, known in optimal control theory as the "principle of optimality," and noticed in the case of the brachistochrone by Jakob Bernoulli.) If one assumes that £» (a) and £* (/?) are interior points of H+ for 0 < a < /3 < T, then the necessary conditions for optimality give a unique candidate for the solution of P(a,/3), namely, the unique curve in the family given by (3.3.5) that goes through £*(a) and £»(/?). So £* is such that ^»[[a,/?] is given by (3.3.5) whenever 0 < a < /? < T, and this easily implies that £* itself is a cycloid given by (3.3.5). To complete the argument, one has to exclude the possibility of a solution of the problem with endpoints A, B which intersects the x axis at some other point. This can be done by a simple qualitative argument, using the following lemma. L e m m a 5.1. Suppose L is a horizontal line contained in the interior of the upper half-plane H+. Let P, Q be distinct points of L. Then the straight-line segment joining P to Q is strictly faster than any trajectory C, from P to Q such that £ lies entirely in the lower closed half-plane determined by L and at least one point of C, lies strictly below L. Proof. Let T^, T^ be the corresponding times. Let y be the y coordinate of the points of L, so y > 0. Write P = (p,y), Q = (q,y). Let £ : [0,T] >-> H+
134 be the horizontal segment from P to Q. Then Te = Now let [a,b] 3 t i-> ((t) = (x(t),y(t)) in our statement. Then
\q-p\
Vy ' G H+ be a trajectory from P to Q as
m< warn = Vv(d
< ( 6 - o ) v ^ = T c V».
JO
Therefore T, > i| g^ ~- ^Pil = r € , and our proof is complete.
0
d
The following is an immediate consequence of the lemma. Corollary 5.2. Lei A, B be points of H+ such that A^ B, and assume that £ : [a, b] i-+ if+ is h'me optimal. Then £(t) is an interior point of H+ whenever a
135
So everything hinges upon the existence result. It turns out that this is not at all trivial if the brachistochrone problem is reformulated in terms of the classical calculus of variations 0 , because (a) the Lagrangian L given by L(y, u) =
t^
has a singularity at y = 0,
and, even more importantly, (b L is not sufficiently coercive for the usual existence theorems to apply. (The precise meaning of (b) is that, as a function of u, L just grows like a constant times |u|, whereas for the usual existence theorems to apply L would have to grow like a constant times |u| r for some r such that r > 1. More sophisticated existence theorems for classical calculus of variations problems that include the brachistochrone are stated in Cesari n , 14.3 and 14.4, but these conditions are not at all simple, and in addition they depend on other results by Cesari that were to appear in a book that was never published.) In the control theory setting, however, the existence question is easily settled by a completely trivial application of the Ascoli-Arzela theorem: given A, B £ H+, let T be the infimum of the times of all trajectories going from A to B; let {£,-} be a sequence of trajectories from A to B, defined on intervals [0, Tj], such that Tj I T. Then the £y are all contained in a fixed compact subset of H+, as can easily be shown by applying Gronwall's inequality and using the fact that the right-hand side of (5.5.1) has less than linear growth as a function of x and y. Then (5.5.1) implies that the derivatives £, are uniformly bounded as well. So we can use the Ascoli-Arzela theorem to extract a subsequence that converges uniformly to a curve £ : [0,T] \-¥ H+. In principle, £ is just a trajectory of the "convexified" system, in which the evolution equations are those of (5.5.1) but the control constraint is u2 + v2 < 1 rather than u2 + v2 = 1. However, it is easy to see that £ is a true trajectory of the nonconvexified system because, if the inequality u(t)2 + v(t)2 < 1 was strict on a set of positive measure, then it would be possible to find an even faster trajectory from A to B by just reparametrizing £. So we see, once again, that in the control setting a question that is hard from the point of view of the calculus of variations can become easy or even trivial. The key point in the above argument is that there is at least one trajectory going from A to B in finite time, as can easily be verified. (If one of the points J4, B belongs to dH+, and A ^ B, then the argument would not work if the speed of light was y rather than ^/y, for in that case there would be no path joining A and B in finite time.) c
We thank F. H. Clarke for bringing this point to our attention.
136
6 6.1
The differential-geometric connection Is the standard formulation of the brachistochrone problem satisfactory?
The mathematical formulation of the brachistochrone problem, as presented in 3.1, is not completely natural, because it takes it for granted that we know that energy is conserved. More precisely, "energy conservation" is "assumed" in at least two conceptually different ways. First, the fact of energy conservation is a prerequisite for even stating the problem. This is clearly not intellectually satisfactory, because it would be much better to state the problem first, and then let the mathematical analysis discover energy conservation for us, after which we could use this new fact to find the solution. Second, the problem of "finding the minimum time curve from A to B" does not make sense for general A and B, unless the value of the energy E is specified. The problem usually studied in textbooks is another one, namely, that of "finding the minimum-time curve from A to B subject to an extra constraint E = E, for a given E." If this constraint is not given, then we really have, for each given pair (^4, B) of endpoints, a one-parameter family of problems, one for each value of E. (Alternatively, we may want to look at the unconstrained problem, in which we are also minimizing over all values of E. But this is clearly not what Johann Bernoulli or anyone else who studied the problem had in mind, and in addition is easy to solve: the infimum of the times is zero, and there is no minimizer.)
6.2
Hamilton's principal function
At this point, we digress to discuss an important idea of Hamilton, namely, the "principal" or "characteristic" function. This idea was not truly appreciated for more than century, until optimal control theory emerged to provide the right setting that would do it justice. So we will only describe it here in broad outline, following the 1944 article 4 5 by J. L. Synge. For the specific case of the brachistochrone, we will show below that the search for Hamilton's principal function leads directly to the discovery of the differential-geometric structure underlying the problem. Synge wrote that To Hamilton, optics and dynamics were merely two aspects of the calculus of variations. He was not interested in experiments. To him, optics was the investigation of the mathematical properties of of curves giving
137
stationary values to an integral of the type
v= v x y z
j ( > ' '%%d£)du-
(6 6 1}
--
Hamilton was, in fact, a great contributor—probably the gratest single contributor of all time—to the calculus of variations. Consider two points, A' with coordinates x',y',z' and A with coordinates x,y,z. Consider all possible curves connecting A' and A. To each curve corresponds a value of the above integral. [Note by HJS&JCW: Hamilton was working with Lagrangians that are homogeneous of degree one with respect to the velocities. In that case, the choice of the interval of definition of the curves is immaterial, since every curve can be reparametrized to be defined on [0,1] without changing the value of the cost integral.] Now compare these values. Is there one curve that gives a smaller value to the integral than all others? It would seem that there must be, but it would be a rash conclusion. Suffice it to say that "in general" there is a curve giving a smallest value to the integral. Then such a curve is a ray in optics. In the language of the calculus of variations, it is an extremal. Now here is Hamilton's great central idea. Regard the minimum (or stationary) value of the integral as a function of the six coordinates x',y',z',x,y,z of A' and A. This function is Hamilton's characteristic or principal function. There is nothing hard to understand about that. What is hard to follow is Hamilton's plan to develop all the properties of the extremals from the characteristic function. In fact, it is so hard that few mathematicians in the ensuing century have given serious consideration to this plan. With the rise of optimal control, "Hamilton's plan to develop all the properties of the extremals from the characteristic function" has become one of the best and most widely used tools in the modern analysis of optimal control problems, under the name of the "dynamic programming" approach. Synge's complaint that "few mathematicians in the ensuing century have given serious consideration to this plan" may have been true in 1944 but is certainly not true today. 6.3
What is Hamilton's principal function for the brachistochrone?
Let us look at the brachistochrone problem from the modern dynamic programming point of view. The natural questions to ask are
138
1. what is the state space for the brachistochrone problem, and 2. what is the problem's "principal function" in Hamilton's sense? More precisely, we would like to know 3. what, exactly, is the controlled dynamical system q=f(q,u),
q&Q,
uGU
(6.6.2)
that corresponds to the brachistochrone problem ? (and, in particular, what is the system's state space Q ?) 4. what is the cost functional
J?
and 5. what is the value function V, regarded as a function QxQ3
fe,
qt) •->• V(qi,
? i
) € l U {-00, +00}
of the initial and terminal points, as in Hamilton's
definition?
Remark 6.1. Naturally, Hamilton's definition and Synge's version of it have to be modified to adjust them to contemporary standards of mathematical precision. Synge's text quoted above seems to require the existence of an optimum for the principal function to be well defined. We take the point of view that V(qi,qt) is always well defined as an extended real number—i.e., a member o / I U {—oo, +oo}. Precisely, V(qi, qt) is the infimum of the costs of all the trajectories going from qt to qt. In particular, V(qi,qt) = +oo if and only if there exist no trajectories from qi to qt with cost < +oo. 0 We want to address these questions taking seriously the facts that energy conservation need not be known for it to be possible to state the problem mathematically, and that, consequently, there should not be a different brachistochrone problem for each value E of the energy, but only one brachistochrone problem. It is clear that J should be time. But what exactly should we choose for Q, U, and / ? Can we, for example, take Q = E 2 ? This would mean that one can specify arbitrary points qi and qt in R2 and define V(qi,qt) unambiguously. But we know that this is not so. Given qt and qt, the minimization problem as formulated in 3.1 only makes sense for a fixed value E of the energy, and only if both qt and qt belong to the E-dependent closed half-plane H+l — I.
139
Therefore there is a well defined value VE(qi,qt) for each value of E such that qt € H+ (jj and qt € H+ (—), but these values are in general different, and the infimum of all of them is zero. A common way to get around this difficulty is by stipulating that we are only interested in dropping the particle with zero initial kinetic energy. (One can even interpret Johann Bernoulli's statement of the problem, quoted in 2.1, as suggesting this possibility.) This, however, will not do, because it would have the following unnatural consequence: if we pick two points q, q' in an optimal arc T going from qi to qt, and use T(q,q') to denote the piece of T from q to q', then T(q,q') will not in general be an optimal arc from q to q' (because the particle that started falling with zero velocity at qt will not in general have zero velocity at q). In modern terminology, the problem with zero initial kinetic energy does not satisfy the principle of optimality.d Perhaps the state space is bigger than the plane? In other words, it might be the case that one can specify the position and something else at the starting time and a similar object at the terminal time. This will not do either. We cannot, for example, specify the initial and terminal positions and velocity vectors, or even just the positions and the lengths of the velocities. What can be specified is qi, qt, and the energy—or something yielding equivalent information, e.g. the length of the initial velocity vector—and from this there is no way to derive a state space S such that V is defined on S. The key problem is that Hamilton's principal function must be a function of an even number of parameters, since it is a function of the initial and terminal states, but the natural number of variables for the value function of the brachistochrone problem seems to be five, namely, two coordinates for the initial position, two for the terminal position, and one for the energy. 6.4
Lie brackets, integrals of motion, and the differential-geometric perspective
A much better way to pose the problem is to write down the equations of motion that truly correspond to Johann Bernoulli's problem as he stated it in June 1696. One should then let the mathematical analysis lead us to the discovery of energy conservation and the simplification resulting from it. This will lead us naturally to a four-dimensional problem whose analysis is best carried out from the differential-geometric perspective, by means of Lied
J a k o b Bernoulli's solution of the brachistochrone problem makes heavy use of the fact that a portion of a minimizer is itself a minimizer. So Jakob cannot possibly have been thinking that one should only consider the case of zero initial kinetic energy.
140
algebraic calculations. The true equations of motion for the brachistochrone are X =
v, w, V = —uw w = uv y=
(6.6.3)
Here x, y, v and w are the state variables, and u is the control. The values of u are allowed to be arbitrary real numbers. The variables x and y are the horizontal and vertical coordinates of our moving point, and v, w are the components of the velocity vector. The requirement that the point is freely falling "under the influence of its own weight" means that the force effectively acting on the point should be equal to a vector proportional to [0, — g] plus a "virtual force" that does no work, i.e., is perpendicular to the velocity. Equation (6.6.3) captures these requirements, by introducing a virtual force vector of the form [uw, — uv], where u is an arbitrary "control," taking values in E. Using "t" to denote "transpose," and writing q = [x, y, v, w]^, we get a familiar equation, namely, q = F(q) + uG(q),
(6.6.4)
where F = [v,w,0, —gtf, and G = [0,0, — w,v]^. This is a 4-dimensional system, with state space Q equal to M4, and control space U equal to E. 6.5
The diamond Lie algebra
Having expressed our equations of motion in the form (6.6.4), the first thing that one should do, from the differential-geometric perspective, is to compute the iterated Lie brackets of F and G, and determine the Lie algebra structure of our problem. Precisely, we use L to denote the "accessibility Lie algebra" of our system, that is, the Lie algebra of vector fields generated by F and G. Our first task will then be to compute L. It turns out that the four vector fields F, G, [F, G] and [F, [F, G}} are linearly independent over M. (that is, there exists no nontrivial linear combination of them with constant coefficients that vanishes identically), and in addition the relations
141
[G,[F,G]]=F,
(6.6.5)
[F, [F, [F, G}}} = [G, [F, [F, G}]\ = 0
(6.6.6)
hold. It then follows easily that L is four-dimensional. As an abstract Lie algebra, L is isomorphic to the diamond Lie algebra G4, a solvable Lie algebra that plays an important role in representation theory (cf. 4 , p. 59). This Lie algebra has a basis H,P,Q, E, with the commutation relations [H,P}= [H,Q] =
Q, -P,
[P,Q]= [HtE\=
E, [P,E} = [Q,E} = 0.
(To construct an isomorphism $ from G4 to L, define * ( P ) = [F,G], *(Q) = F, *(ff) = G,*(E)
= ~[F, F,G\] •
A concrete realization of G4 as an algebra of differential operators—acting on smooth functions on the real line—can be defined by "quantizing the harmonic oscillator," i.e., by taking P Q E H
dx ' multiplication by x, identity,
i<-PW) = i(-^ + * ! ),
so that H is the Hermite operator. 6.6
Energy conservation
We now compute the accessibility distribution A generated by L. Formally, q i-> A(q) is the map that assigns to each state q the linear space A(q) = {X(q)
:XEL}.
To find A we first observe that, even though the vector fields F, G, [F, G] and [F, [F, G]} are linearly independent over R, a simple computation shows that G = <;1F + <;2[F,G} +
<;3[F,[F,G}},
(6.6.7)
142
where the Q are smooth functions of q, given by v
Ci=—,
9
w
C2 =
9
, Cs =
v2 +w2 5-2-. V
6.6.8
From these facts one can easily show that every iterated Lie bracket of F and G is a linear combination of F, [F,G], and [F,[F,G]] with smooth coefficients. Since F(q), [F,G](q), and [F, [F,G]](q) are linearly independent at each point q E E 4 , we can conclude that A is 3-dimensional at each point. This means—using, for example, Probenius' theorem on the existence of integral manifolds—that, at least locally, there is a nontrivial integral of motion, i.e., a function with nonzero gradient which is constant along all integral curves of F and G, and then also along all solutions of (6.6.4). This integral of motion can be easily computed and turns out to be the energy E, given by E{x,y,v,w)
v2 + w2 = — - — + gy.
(6.6.9)
Notice that E is a smooth function on E 4 , with nowhere vanishing gradient. Therefore the level hypersurfaces of E—i.e., the sets SE^
{q : E(q) = E] ,
for E € E—are smooth 3-dimensional manifolds. (The set SE is given by the equation V=
2E - v2 - w2 Tg '
which shows that each SE is the graph of a smooth function (x,v,w) 6.7
Naive application of the Maximum
H-> y.)
Principle
The fact that our 4-dimensional state space E 4 is foliated by 3-dimensional "leaves" SE has profound implications for the optimization problem. Indeed, if we try to find the optimal trajectories by applying the Maximum Principle, we get nothing. This is a consequence of more general result, namely, that, ( # ) whenever a control system satisfies a nontrivial "holonomic constraint" such as E = constant, then the Maximum Principle is uninformative, because every trajectory is an extremal. (The word "nontrivial" here means that VE never vanishes.)
143
Remark 6.2. The reason for ( # ) is as follows. The necessary condition given by the Maximum Principle for a trajectory-control pair (£, n) to be optimal is that (£, n) be either a "normal extremal" or an "abnormal extremal." Moreover, being an abnormal extremal is a necessary condition for the pair (£, n) to be such that the terminal point of £ does not belong to the interior of the reachable set from the initial point. If a nontrivial constraint such as E = constant is satisfied, then the reachable set from any initial point q is contained in a submanifold of the state space of positive codimension. Hence the reachable set has empty interior. Therefore all trajectory-control pairs are abnormal extremals. ^ 6.8
Controllability
We now investigate the controllability properties of our system. First of all, it is clear that two points qi, qt cannot be joined by a trajectory of (6.6.3) unless they belong to the same leaf SE- We now show that the converse is true, that is, any two points qi, qt belonging to the same leaf of (6.6.3) can be joined by a trajectory. In other words, the restriction of (6.6.3) to each leaf is completely controllable. To prove our statement, we use the technique of "Lie saturates" introduced by Jurdjevic and Kupka. Fix E and let (6.6.3.E) denote the restriction of (6.6.3) to SE- By construction, the system (6.6.3..E) has the accessibility property. So to prove complete controllability it suffices to establish complete controllability of the Lie saturate family of vector fields C. It is clear that F, G and — G belong to C. So the desired conclusion will follow if we show that — F G C. But this follows easily, because the identity [G, [G, F]\ = — F implies e*GFe-*G
6.9
=
_
p
The existence problem
A precise definition of Hamilton's principal function V was given in Remark 6.1. It is clear that, if qi and qt belong to R 4 , then V(qt, qt) < +00 if and only if qi and qt belong to the same leaf SEIt is then reasonable to ask whether an optimal control steering qi to qt exists whenever V(qt,qt) < +00. Equivalently, we want to know if the infimum that occurs in the definition of V is in fact a minimum whenever it is finite. The usual way to prove existence of an optimum is to pick a sequence {??j}j£N of controls steering qi to qt with costs Cj that converge to the infi-
144
mum, look at the corresponding trajectories £,, and then try to produce a subsequence {r)j(e)}e€T$ of {^}jgN that converges in some sense to a limiting control TJOO and is such that the £,•(£) converge to a trajectory £00 of rjco and the costs Cj(^) converge to the cost CQQ of (£oo,»?oo)This method may fail for various reasons. The simplest one is that the £j may "go off to infinity." That is, there may not exist a subsequence {£j(e)}teN that stays in a fixed compact set. In the following definition, we give a name to the property that this particular obstruction to the existence of optimal controls does not occur. Definition 6.3. We say that an optimal control problem with dynamics (6.6.2) and Lagrangian cost functional with Lagrangian L satisfies the properness condition if for every pair qi,qt of states such that V(qi,qt) < +00 there exist a number c € l and a compact subset K of Q such that (1) V(quqt)
(2) whenever rj is a control steering qi to qt with cost < c, and £ is the corresponding trajectory, it follows that £ is entirely contained on K. 0 When a problem satisfies the properness condition, it still does not follow that optimal controls exist, because the minimizing sequences {T]J}J€N need not have subsequences that converge in any reasonable sense. On the other hand, it is commonly agreed that in this case optimal controls really exist if one enlarges the original class U of admissible controls by adding to it some "generalized controls." We will show that this is indeed what happens for our brachistochrone problem, and that in this case the generalized controls can be easily described in concrete terms, and turn out to be none other than "impulse controls." To begin with, we prove the following. Proposition 6.4. The minimum time problem for the brachistochrone system (6.6.3) satisfies the properness condition. Proof. Let qi, qt be two points of M4 having the same energy E. Fix an arbitrary c € E such that c > V(qi,qt). We have to find a constant A such that ||£(i)|| < A for all t € [0,r] whenever r < c and £ : [0,r] (->• K4 is a trajectory of (6.6.3) for some control t 1-4 r)(t) such that £(0) = qi and &T) = qt. Write £(*) = [x{t),y(t), v(t),w(t)]*. Let
9(t) = [v(t)Mt)V, at) = Kt)M*)V-
145
Then (6.6.3) implies that dt
|| C (t)|| 2 = - 2
9
•«,(*).
Therefore dt
2 2 IIC(*)IIS = 2g\w(t)\<9 +w(t)
+\\at)\\
and then, if we write
V>(*) = |llC(*)ll 2 -IK(o)|| 2 |, we find that < [\g2 + \K(s)\\2) ds < c(g2 + ||C(0)||2) + / V(*) ds. Jo Jo Then Gronwall's inequality implies that m
W)
< c(g2 + | | C ( 0 ) | | V < c{g2 + ||C(0)|| 2 )e c .
It then follows that
IICWII 2
0 6.10
• Application of the Maximum Principle on manifolds
Using the integral of motion E, we can regard E 4 as foliated by the 3dimensional level hypersurfaces of E, and conclude that every trajectory is contained in one of the leaves Sg. If E G E, then the Maximum Principle on manifolds (cf. 3T ) can be applied to the problem restricted to Sg. The conclusion turns out to be exactly the same as that for the unrestricted problem, except that the nontriviality condition for the momentum is slightly stronger. This extra strength is actually fundamental for, as explained in 6.7, without it the conclusion would be completely uninformative. If [a, b] 3 t H-> £„(£) € E 4 is an optimal trajectory for our problem, corresponding to a control [a, b] 3 t i-> n* (t) € E, then the usual version of the Maximum Principle yields the existence of a nontrivial momentum vector field [a, b] 3 t !->• 7r(t) 6 E 4
146
(often called an "adjoint vector") that satisfies the adjoint equation, the Hamiltonian maximization condition, and the additional condition that the maximized value of the Hamiltonian is a nonnegative constant 6 . The principle applied to the restriction to the leaves yields the stronger conclusion that n(t) cannot be orthogonal to the leaf Sg that contains £*. (In differential-geometric terms, -?v(t) is really a covectoron Sg at £*(£), and has to be nontrivial as such. Equivalently, if one insists on regarding 7r(i) as a vector in R 4 , then it should not be orthogonal to the tangent space to Sg at £*(£).) (Naturally, one could also avoid using the Maximum Principle on manifolds by invoking instead the fact that Sg is identified with M3 in an obvious way, since it is the graph of a smooth function (x,v,w) i-> y(x,v,w). This would amount to eliminating y from the equations by substituting for it its expression in terms of the other variables, for each fixed E.) The Hamiltonian is the function R4 x E x M4 3 (q,u,p) >-> R defined by H(q,u,p)
=
(6.6.10)
where the functions ip, ip are defined by
•
Since u is completely unrestricted, H cannot have a maximum as a function of u unless tp(q,p) = 0. So V"(6(*).T(*)) = 0
for
a11
*•
(6.6.11)
t,
(6.6.12)
Differentiation of (6.6.12) yields p(^(t),Tr{t))
= 0 for all
where p{q,p)d=
147
A further differentiation—together with the fact that [G, [F, G]] = F—yields 0(M*)Mt))
+u(t)
= 0,
(6.6.13)
where e(q,p)^{p,[F,[F,G]](q)). This, together with the equalities ip = p = 0, determine u as a function of q, i.e., provide an optimal control in the form of a state space feedback law u = u(q), as we now show. First of all, (6.6.7) implies that *l> =
(6.6.14)
along our trajectory. Next, we use the crucial fact that ¥>(*(«),&(t)) 5* 0,
(6.6.15)
which follows from the stronger version of the Maximum Principle. (The precise argument is as follows. The covector n(t) must be nontrivial as a linear functional on the tangent space at £*(<) of the leaf containing £*(t). Since this space is spanned by the three vectors F(^(t)), [F,G](£*(£)) and [F,[F,G]](Ut)), one of the numbers ¥>(*(*),&(*)). p{*(t),t.{t)), 0(TT (*),£,(*)) must be nonzero. We know that p(ir(t),t;*(t)) = 0. If <^(7r(t), £*(*)) = 0, then (6.6.13) would imply that 6{n(t), £» (£)) = 0, and we would get a contradiction. Hence (6.6.15) holds.) Therefore (6.6.13) implies u{t)
(6 6 16)
—
--
that is U{t)
~
(«(t),F(Ut)))
(6 6 17)
•
- -
Moreover, it follows from (6.6.14), together with the fact that I/J = p = 0 along our trajectory, that Ci(Ut)M^(t),^(t)) Then (6.6.16) implies
+ C3(Ut))0(At),Ut))
= 0.
(6.6.18)
148
as long as C3 (£*(*)) ^ 0. Therefore u{t) = u(Ut)),
(6.6.20)
where , def
Ivg
uj(q) = u{x, y, v, w) =
(6.6.21) 2 2 . v2 + w'z It is then clear that u is a smooth function on the complement of the set S = {(x,y,v,w)
:v2+w2
= 0} .
(6.6.22)
The "singular" set £ corresponds, naturally, to the points where the kinetic energy vanishes, which as we know from our other analyses is where some singular behavior occurs. If we define Z(q)=F(q)+Lj(q)G(q), we see that Z is a smooth vector field extremals in the sense of the Maximum The resulting trajectories are easily use the feedback u = u(q), the dynamic
(6.6.23) 4
on M \E whose trajectories are the Principle. computed. First, observe that, if we equations become
x = v, Vw, v = —2g(v2 + w2)~1vw , 2 1 2 L ...2w..2 w = 2g(v22_+w )~ v —„ g 2 2 1 2 = {v + w )' {2gv - g{v2 + w2)) = g{v2 +w2)~1(v2 -w2).
(6-6-24)
If we introduce a complex variable z denned by z = v + iw, then the last two equations of (6.6.24) say that
i = ^ 1
that is, z=9—.
(6.6.25)
z
\\ '* The formulas of (6.6.25) define a well known dynamical system of the complex plane C. The right-hand side of the equations is a smooth vector field on C\{0}. The integral curves are circles passing through the origin and having center on the real axis (plus the imaginary axis, parametrized by E 3 t —> (0, — gt), which is also a solution since along it (6.6.25) just says that i = — gi). The parametric equation of the circles is z(t) = r{l + a e^), where a £ { + 1 , - 1 } and r is a positive real number.
(6.6.26)
149
Once it has been shown that the velocity vector {v,w) evolves according to (6.6.26), a trivial integration shows that the trajectories described by the position vector (x, y) are cycloids. 6.11
The complete synthesis and Hamilton's principal function for the 4-dimensional brachistochrone problem
We haven't yet completely answered all our earlier questions and determined Hamilton's principal function V. Let qi, qt be two points of R4. It is clear that V(qi, qt) = +oo unless both <7i and qt belong to the same energy hypersurface, because if the energies are different then the points cannot be joined by a trajectory, and the infimum of the empty set is +oo. On the other hand, if the points qi and qt belong to the same level hypersurface Sg, then we know that they can be joined by a trajectory, so V(qi, qt) will be finite. Moreover, it is reasonable to expect that such a curve will exist, and if it does not then we ought to be able to explain why. Write qi = (Ai,a,i), qt = (At,at), where Ai} at, At, at, belong to R 2 . The classical analysis carried out earlier seems to suggest that, once Ai, At and E are specified, there will be only one optimal arc joining them. So, if we specify Ai and At but do not fix the energy, then there should be a 1parameter family of such arcs (one arc for each value of E). Yet we now seem to need a 3-parameter family, because we want to accommodate all possible pairs (oj, at) (i.e., four parameters) as long as they give rise to the same energy (one constraint, and 4 — 1 = 3 ) . Equivalently, given E, we ought to be able to choose the directions 0i, Ot, of the velocity vectors ai and at in a completely arbitrary way. (Their magnitudes are determined by the fact that the energy at qi and qt must equal E.) But given Ai, At and E there is a unique cycloid from Ai to At corresponding to the energy E, and in particular the directions 6i, 6t at Ai, At of this cycloid are completely determined by Ai, At and E. In other words, we ought to be able to choose freely the two angles 9i, 6t, but it appears that we cannot do so. The solution of this apparent paradox is as follows. Suppose we fix an energy level E. Given any Ai, the set C(Ai, E) of those a's such that (Ai, a) € Sg is either empty or a circle, except for the "borderline" case when (Ai,0) £ Sg and C(Ai,E) consists of a single point. If C(Ai,E) is a circle, then through each point of {Ai} x C(Ai,E) there passes an integral curve of Z. The set of all points lying on such curves is 2-dimensional, and intersects the 1-dimensional set {At} x C(At,E) at just one point. This means that there is a unique pair (a.i,at) such that (Ai,a,i) and (At,at) lie on the same integral
150
curve of Z. The portion of that curve joining (At, en) to (At,at) is, of course, our famous cycloid. What is then the optimal trajectory joining (Ai, at) to (At, at) for general ai, at"? What is the corresponding value of V(Ai,ai,At,at)'? The answer is quite simple: the "optimal trajectory" is obtained by 1. applying an impulse control to rotate a; to a; instantaneously, 2. then following the cycloid from (Ai,cn) to
(At,at),
3. finally applying another impulse control to rotate at to at. (These are not true trajectories, of course, but it is easy to translate the above into a statement about a minimizing sequence of true trajectories.) The value V(Ai,cii, At,at) is therefore equal to V(Ai,a,i,At,dt). 7 7.1
Five modern variations on the theme of the brachistochrone Hestenes' "variation of the brachistochrone problem"
In 1956, M. Hestenes wrote (in
18
, p. 64):
... it is interesting to speculate on what type of brachistochrone problem the Bernoulli brothers might have formulated had they lived in modern times. An interesting variation of the brachistochrone problem can be described as follows: Consider an idealized rocket ship moving in a vertical plane. The ship is to be considered as a particle acted upon by a gravitational force g and a thrust of constant magnitude F and variable inclination (p ... There are no other forces acting on this ship. The pilot steers the ship by controlling the inclination
y = y(t)
0
subject to the constraints (with unit mass) x — F cos tp
y = F sin (p — g
and with x, y, x, y, prescribed at t = 0 and t — T, one which minimizes the time of flight T.
151
It can be shown that the path of least time has the following interesting property: there is a line L with direction fixed in space, and with position fixed relative to the ship, such that if a particle M is moving along L with constant speed, the ship will traverse a path of least time by keeping the thrust aimed at the particle M. Hestenes later on proceeds to solve the problem. Let us present a solution based on optimal control. The dynamical equations can be rewritten as x =z
z = F cos ip
y =w
w = F sin (p — g.
If [0,T] 9 ( 4 (x*(t), z*(t),yt(t),w*(t)) e I 2 is an optimal trajectory, corresponding to a control function [0, T] 3 t t-> ip* (t) € M, then the Maximum Principle yields a nonnegative constant -KQ and and a vector-valued function [0,T]3t^n(t)
=
(nx(t),irz(t),Try(t),Trw(t)).
The Hamiltonian is given by H(x,z,y,w,ip,px,pz,py,pw,po)
= px z+pz Fcosip+py w+pw (Fsmtp-g)-p0
.
The adjoint equation becomes •kx = 0
7rz = — 7rx
Then, if we write u)(t) — {nz(t),Ttw(t)), u(t) =
-ky = 0
nw = — •Ky .
we have tui,
(JQ +
where u>o and u>i are constant two-dimensional vectors. The Hamiltonian maximization condition then says that the vector u(i) = (cos ip(t), sin ip(t)) is given by
""» = »
•
<"•»
The Hamiltonian must vanish along our trajectory. Therefore, ir(t) can never vanish, for if 7r(t) = 0 it would follow that TT0 = 0, contradicting the nontriviality condition. Hence u>(t) cannot vanish identically. So u is a linear function which is not identically equal to zero. Therefore there is at most one value of t such that uj(t) = 0. It follows that the function u of (7.7.1) is well denned except possibly at one point i. Moreover, if such a i exists, then cj(t) = (t — i)cji, so if t < t u(t) = {—wi ui\ if t > i.
152
The "line L" of Hestenes' "interesting property" is the line Lt with direction <jj\, with a point At having a "position fixed relative to the ship" given by At = (x*{t),y*(t))
+u}0.
So in fact Lt is moving along with the ship. If a point qt on Lt moves with constant velocity UJ\, starting at Ao at time 0, then the point's position at time t is A* + toj\. Therefore the vector from the ship's position to qt is precisely u)(t). We have shown that the direction of the thrust is uj(t), from which Hestenes' "geometric property" follows. 1.2
The reflected brachistochrone problem
In 3, our analysis of the brachistochrone problem was carried out in a halfplane, by looking only for optimal trajectories that are entirely above the x axis, as in Johann Bernoulli's original problem. Let us pursue Hestenes' idea that "it is interesting to speculate on what type of brachistochrone problem the Bernoulli brothers might have formulated had they lived in modern times." An obvious question for the brothers to ask would have been that of finding out what happens if we work in the whole plane. This is in fact a much more natural mathematical setting for the brachistochrone problem. We shall refer to this new question as the reflected brachistochrone problem. (It is because we were thinking all along of this extension that we wrote y/\y~\ rather that ^Jy in (5.5.1)). For a recent study of the reflected brachistochrone problem from the dynamic programming perspective, see Malisoff 2 8 ' 2 9 . Solving this more general problem amounts to finding the light rays when the medium is the whole plane, and the speed of light is ^/\y\. In other words, we want to find the minimum time paths for the control system (5.5.1) with control set U given by (5.5.2) and state space equal to the whole plane. Notice that this problem is "completely controllable," in the sense that (C) any two points A, B of R2 can be joined by a feasible path, even if they lie on opposite sides of the x axis. To prove (C), observe first that the desired conclusion is trivial if A and B both lie in the open upper half plane or in the open lower half plane. So it clearly suffices to prove the conclusion if A lies in the open upper half plane and B belongs to the x axis. Moreover, we can assume that A lies on the same vertical line as B, for otherwise we can pick A' on the same vertical as B but strictly above B, and join A to A' first in finite time. So let us suppose
153
that A - (a,a) and B{a,0). Then the curve [0,a] 9 s 4 ( a , a - s ) certainly goes from A to B. Along this curve, dy = -^/ydt, so dy
ds
Therefore the total time T required to move from A to B along this curve is given by fa J0
ds
n
r-
yfa-s
so T < +oo, and (C) is proved. The crucial point here is that the right-hand side of (5.5.1) vanishes along the x axis, but this does not prevent the existence of feasible paths crossing the x-axis in finite time, because the "speed of light function" (x,y) <-+c(x,y) = y/\y] is not Lipschitz near the x axis. Remark 7.1. If the function c was Lipschitz-continuous, then the well known uniqueness theorem for ordinary differential equations would imply that every solution passing through a point on the x axis is a constant curve. This would obviously render it impossible for feasible curves starting at a point not on the x axis to reach the x axis in finite time. An important example of this situation is the case when the speed o light is \y\ rather than y/\y\. That case was also studied by Johann Bernoulli, as is clearly seen in the text we quoted at the end of 2.2, where he says that if, for example, the velocities were as the altitudes, then both curves [HJS & JCW: that is, the brachistochrone and the tautochrone] would be algebraic, the one a circle, the other one a straight line. It turns out that the "brachistochrones" for the case when the speed of light is \y\ are half circles whose center lies on the x axis. Moreover, these circles take infinite time to reach the x axis, precisely because the function J/ — ' >• |y| is Lipschitz. ^ We have seen that the complete controllability of (5.5.2) depends essentially on the non-Lipschitzian character of its speed of light function. However, this same non-Lipschitzian character also renders the Maximum Principle inapplicable, in its classical and nonsmooth versions (including the so-called "Lojasiewicz version," cf. Sussmann 35), since all these results require a Lipschitz reference vector field. Can we still use necessary conditions to find the solution, perhaps by invoking a more general version of the Maximum Principle that would be applicable to this nonsmooth, non-Lipschitzian case?
154
Suppose, for example, that we want to find an optimal trajectory £ going from A to B, where A lies in the upper half-plane and B is in the lower halfplane. Then one can easily show, first of all, that an optimal trajectory £ exists, using the Ascoli-Arzela theorem as before (cf. 5.2). Next, using the usual necessary conditions for optimality, e.g. the Euler-Lagrange equation or the classical version of the Maximum Principle, one shows that any portion of an optimal curve which is entirely contained in the closed upper half plane or in the closed lower half plane is a cycloid given by (3.3.5), or a reflection or such a cycloid with respect to the x axis. Next, one sees that £ cannot traverse the x axis more than once. (This is a very straightforward consequence of Lemma 5.1.) Therefore £ must consist of a cycloid T\ going from A to a point X in the x axis, followed by a second cycloid 1^ going from X to B. It remains to find X. Naturally, X is the only point on £ in a neighborhood of which the usual smooth and nonsmooth versions of the Maximum Principle are inapplicable. On the other hand, it is easy to produce a nonrigorous formal argument yielding the missing condition, as we now show. Let us apply the Maximum Principle formally, even though the technical conditions required for the validity of the usual versions are not verified. The maximized value of the Hamiltonian is clearly equal to ||p||\/[y| — po, and we know that this number is in fact equal to zero. So \\p\t)\\V\y\=Po
for all
t.
(7.7.2)
If we multiply (5.5.6) by \y(t)\, and use (7.7.2), we find
|y(*)l ( l + ^ ) » ) = M * ^ K = ^ .
(7.7.3)
The adjoint system (5.5.4) tells us that p is constant on each time interval that does not contain the point r such that £(r) = X. If we make the Ansatz that p is actually constant on the whole time interval, i.e., that the constant values of p on both sides of T are equal, we find that the cycloids Ti, T2 must be such that the quantity C=\y(x)\(l+y'(x)2).
(7.7.4)
which is constant along each Tj, actually has the same value for both curves. This extra condition determines X. The above argument is, of course, not rigorous. It turns out, however, that the recent "very nonsmooth" versions of the Maximum Principle developed by one of us—cf. Sussmann 39>4o,4i,42,43,44—apply to this problem and provide a
155
rigorous justification for our formal argument. The reason for this is that the new results do not require Lipschitz continuity—or even continuity—of the reference vector field. All that is needed is that the flow maps generated by the reference flow be differentiable in an appropriate sensed Remarkably, our "extra condition" has a simple geometric meaning. Recall that the cycloids of Johann Bernoulli's problem are generated by a circle rolling along the x axis. The extra condition then says that
(C) The rolling circles that generate the upper and lower cycloids must have equall radii. 7.3 A modest claim If we are going to "speculate" as Hestenes did, it is natural to ask not only what questions the Bernoulli brothers would have asked if they had lived in modern times, but also what kinds of answers they would have liked. This is of course a hard question to answer, and anything we say will have to be highly subjective. Granted this, we are firmly convinced that 1. The Bernoulli brothers would have liked the "interesting property" of the solution of Hestenes' problem (which is almost certainly the reason why Hestenes chose to emphasize this property) and also that 2. they would have found elegant the geometric condition of our solution of the reflected brachistochrone problem. This seems clear to us but, since de gustibus non est disputandum, we shall not pursue this particular argument further. 7.4
The brachistochrone with friction
In the problem studied in 6, we assumed that there was no friction. This implied that energy was conserved and that the four-dimensional state space was foliated by three-dimensional orbits of the system's accessibility distribution. ' F o r the specific case of the reflected brachistochrone, classical differentiability suffices. For more general problems, one needs other theories of "generalized differentiation," as e x p l a i n e d in 39,40,41,42,43,44
156 It is then natural to consider the more general case of the brachistochrone with friction, and to expect that for this problem there will be no nontrivial conserved functions of the state, so the accessibility distribution will be fourdimensional, and the system will have the accessibility property. We now outline some of the results, without carrying out a complete analysis. The dynamical behavior of the system is given by the equations x—
v, w, v = —uw — pv, w = uv — pw — g, y =
(7.7.5)
where, as before, u is an unbounded scalar control. The parameter p is a real number, the friction coefficient. The problem with friction corresponds to p > 0. When p = 0 we get the frictionless case considered earlier. If we write
F(q) =
v w -pv -pw
G(q) =
0 0 -w v
then (7.7.5) takes the form q=
F(q)+uG(q).
(7.7.6)
From now on, we assume that p ^ 0, since the case when p — 0 has already been discussed. Let L be the Lie algebra of vector fields generated by F and G. In order to analyze the structure of L, it will be convenient to introduce five new vector fields Z, V, W, X, and Y. The following eight formulas express F, G, and [G, F] in terms of the usual differential operator notation for vector fields, and define Z, V, W, X, and V:
F = vdx + wdv — pvdv - {pw + g)du vd„ G= - wdv + [G,F] = -wdx + vdy — gdv wdu Z= vdv + V = dv
w = X = Y =
dx 8y
157
Let S be the linear span of the eight vector fields F, G, [G,F], Z, V, W, X, and Y. It then turns out that S C I , because Z = a(F + [G,[G,F}}), W = 7 ([F, Z] + F + PZ), V = [G,W], X = pV-[F,V], Y = PW- [F, W], where 1 , 1 a = - and 7 = — . P 29 On the other hand, the formulas [F, [G, F]] = -p[G, F] + 2gX - 2pgV, [G,[G,F]] = -F-pZ, [F,Z] = [F,V} [F,W] [F,X] [G,Z] [G,V] [G,W]
= = = = = =
-F-pZ-2gW, -X + pV, -Y + pW, [F,Y] = 0, [G,X] = [G,Y] = 0, -W, V,
show that [F, S] C S and [G, S]CS. So L = S. A straightforward calculation shows that F, G, [G,F], Z, V, W, X, and Y are linearly independent over E. So L is an S-dimensional Lie algebra. Let A be the accessibility distribution of our system, so A(q) = {h(q) : h 6 L} if q 6 K4. Since the vector fields X, Y, V and W belong to L, it is clear that A(q) = M4 for every q. So our system has the accessibility property. An analysis similar to the one carried out in the previous section for the frictionless problem yields an optimal "feedback control" 2gv _Cy2 ~ vw u = — - — 5 - + 2 np — 25 - — r2> v + w involving an additional parameter £, given by _ TVy_
TTx
{7.7.7)
158
(Here irx, ny are the X and Y components of the momentum, which are easily seen to be constant along extremals.) In other words, through every point q € E 4 there passes a one-parameter family of optimal trajectories, depending on the parameter C,. 7.5
The classical brachistochrone as a degenerate problem
The family of brachistochrone problems with friction coefficient p constitutes an "unfolding" of the classical frictionless problem. For p ^ 0, the situation is generic, in the sense that the accessibility distribution is four-dimensional. The generic behavior of the time-optimal trajectories for such problems is precisely the one described here: the control is given in "feedback" form, depending on the state and an extra parameter. Formula (7.7.7) shows that the extra parameter only occurs as part of a term that is multiplied by p. It follows that when p = 0 the extra parameter disappears, and we get a state space feedback as determined earlier. 7.6
Deriving Snell's law from the Maximum Principle
Our third "modern variation" will involve going back to ancient times, long before 1696, and considering Fermat's minimum time principle and Snell's law of refraction. We have already explained how Snell's law is intimately related to the brachistochrone problem, since it played a crucial role in Johann Bernoulli's solution. So, if we pursue Hestenes' line of inquiry further, and speculate on other questions that the Bernoulli brothers might have asked "had they lived in modern times," it is easy to imagine them asking the following. (Q) Given that in these modern times powerful general theories have been developed, going far beyond the particular examples that were dealt with by ad hoc methods up to the 17th and early 18th centuries, do these general theories actually cover all these special examples whose study preceded and begat them? As an important special case of this question, the brothers would certainly want to know whether the necessary conditions of the calculus of variations and optimal control theory apply, in particular, to the derivation of Snell's law. So let us consider a medium such as the one we described when discussing Snell's law, in which the speed of light is constant on each of the two sides H-, H+ of a hyperplane H in K n , but the constant values c_, c+, are different.
159
Let us ask the obvious question, namely, whether Snell's law be derived from the Maximum Principle. It is easy to see that there is no way to formulate this question as a minimum time problem with a controlled dynamics q = f(q,u,t) in which / is continuous with respect to q, since | | / | | has to jump as we cross H. In the usual versions of the Maximum Principle, it is not required that / be differentiate, or even continuous, with respect to the control u. But here the situation is different, since we need to be able to deal with an / which is discontinuous with respect to the state variable q. Once again, it turns out that the recent versions the Maximum Principle developed in Sussmann 39>4o,4i,42,43,44 apply to this problem as well, and lead to Snell's law. The reason is that in these version all that is needed is that the reference trajectory £* arise from a flow {$t',t} consisting of differentiable maps, and there is no need for this flow to be generated by a continuous vector field. 7.7
Was Johann Bernoulli close to discovering non-Euclidean geometry?
Given a "speed of light function" (x,y) •-* c{x,y) on some plane region, the time along a curve is given by _ y/dx2 + dy2 c(x,y) since y ^f + -^ = c(x,y). This means that, if we adopt a slightly different point of view, and think of time as "length," then the function c defines a Riemannian metric on the set fi c = {{x,y) : c(x,y) > 0}, provided that c is sufficiently smooth. Let us assume that c(x,y) > 0 whenever y > 0, as was the case in our two examples. Then c gives rise to a Riemannian metric 2
_ dx2 + dy2 c(x,y)2
on the upper half plane. The "brachistochrones" are then the minimum length curves, that is, the geodesies. In the case of the "true brachistochrone," when c(x,y) = y/\y~\, these geodesies are cycloids (plus vertical segments) but maximal geodesies have finite length. On the other hand, in the case when c{x, y) = \y\, so that the Riemannian metric on the upper half plane is given by ds2=y-2(dx2+dy2), the geodesies are, as we have seen, half circles of infinite length.
(7.7.8)
So, using modern terminology, the circles that occur as solutions of this modified version of Johann Bernoulli's brachistochrone problem are the geodesies of a Riemannian metric on the upper half plane given by (7.7.8). We now know that this Riemannian metric defines the so called Poincare half plane, which is the simplest model of non-Euclidean geometry. This raises an obvious question: how close did Johann Bernoulli get to solving the famous problem of the provability of Euclid's fifth postulate? What renders the question particularly interesting is that 1. Johann Bernoulli lived at a time when the problem of Euclid's parallel postulate was very much at the center of mathematical research. For example, G. Saccheri published in 1733 his book 3 2 , entitled Euclides ab omni naevo vindicatus (that is, "Euclid vindicated from every flaw"), where he pushed very far the development of non-Euclidean geometry, only to end up dismissing it by claiming that a particular conclusion he had reached had to be rejected because it was "repugnant to the nature of a straight line." 2. The cycloids that occur in the original brachistochrone problem have many of the incidence properties of Euclidean lines, and therefore come close to satisfying all Euclid's postulates other than the fifth. But they do not yet provide a good model for non-Euclidean geometry because they "go to infinity" (i.e., approach the x axis) with finite length. 3. The half-circles of the Poincare model have all the desired incidence properties and also have infinite length, so they furnish a perfect model where all the Euclidean axioms other than the fifth are true. 4. Johann Bernoulli did study these half circles, as we pointed out in Remark 7.1. So in a sense he did discover the Poincare model. 5. Johann Bernoulli was definitely interested in the question, since he made significant contributions to the early stages of the development of the idea of geodesies on curved surfaces, by studying the curves of minimum length on a surface, which later 9 came to be known as "geodesies." 6. The solution of the problem of the independence of Euclid's postulate is extremely simple by today's standards, even though mathematicians took about 2200 years to find it. Actually, the solution is so simple that it can be explained to any undergraduate with a moderate understanding of plane analytic geometry. All that is required is to take any 9
T h e word "geodesic" was coined much later by Liouville (1809-1892).
161
reasonable way to compute "time" along curves, rename "time" by calling it "length," and then call the length-minimizing curves (that is, the "brachistochrones") "lines." For example, the case when c = \y\ leads us to taking the half circles with center on the x axis (plus the vertical half lines) and calling them "lines." Once this trivial renaming has been carried out, it is easy to verify that all of Euclid's postulates other than the fifth hold, but the fifth postulate fails. So Johann Bernoulli had essentially all the tools he needed to solve the problem and prove that Saccheri was wrong, by showing that Euclid's fifth postulate does not follows from the other ones. Why didn't he do it? One can surmise that he lacked the understanding of the geometric significance of the cycloids and half circles that he had found as solutions of his minimization problems. He certainly saw these curves as "geometric," but failed to see that they could serve as the "lines" of a different geometry. In modern terms, this is a trivial remark, namely, that one can turn around the well known fact that the segment is the shortest path between two points, and make it the definition of the notion of segment, while at the same time using a more general prescription to measure "length." But the idea that minimization problems can be the source of new geometries evolved very slowly over two millennia, and took a long time to crystallize, reaching final form in the nineteenth century, in the era of Gauss and Riemann, when it revolutionized mathematics and then moved on, at the beginning of the twentieth century, to bring a a fundamental change in our understanding of the physical universe. One can already find the idea in a rudimentary form in Fermat's least time principle'1, which can be interpreted as saying that light rays follow the shortest paths, with the proviso that "length" must now be defined in terms of a new and more refined geometry, in which the physical properties of space influence the geometry, and shortest paths can be curved or bent. This interpretation is suggested, for example, by G. Lochak, in 27 , p. 57-58 [our translation]: [Fermat's principle] anticipated the greatest revolution to be undergone by geometry in the future, namely, the discovery of non-Euclidean geometries, because it showed for the first time that the physical properties of a medium might cause the shortest paths not to be straight lines. ''which, as we have seen, was a direct ancestor of Johann Bernoulli's solution of the brachistochrone problem
162
In fact, Leibniz definitely uses the word "shortest" in his analysis of the refraction problem in his 1684 Nova methodus paper, showing that he was at least entertaining the possibility that light rays in a medium with variable speed of light truly were "shortest paths" in some new geometry. But it would appear that, in spite of these earlier glimpses of what would become one of the greatest scientific ideas of all times, the era of Johann Bernoulli was not yet ready to take the trivial step of turning around the lenght minimization property of segments. Johann Bernoulli passionately wanted to succeed and be famous, and was obsessed by the desire to surpass his contemporaries, especially his brother Jacob and his son Daniel*. It is thus sadly ironic that he, of all people, got so close to solving an important 2000-year old problem but missed because he failed to take a small step, a step so simple that today it can easily be explained to beginners. Had Johann Bernoulli "lived in modern times," he probably would have been torn between the curiosity to find out about non-Euclidean geometry and the desire not to hear about the tragedy of his missed opportunity to reach eternal fame and glory. Acknowledgements The writing of this paper began while the first author was Johann Bernoulli Visiting Professor at the University of Groningen, in May, June and July 1999, and continued while he was back at Rutgers University, partially supported by the National Science Foundation under NSF Grant DMS 98-03411. It was concluded while he was Weston Visiting Professor at the Weizmann Institute of Science in Rehovot, Israel, from October 2000 to January 2001. He is grateful to the University of Groningen, the Weizmann Institute, and NSF, for their help and support. References 1. Bell, E. T., Men of Mathematics. (Simon and Schuster, New York, 1937). 2. Beltrami, E., Saggio di interpretazione della geometria noneuclidea.Giornale di Matematiche VI, 284-312 (1868) (in Italian). "Johann was very jealous of Daniel's success. He once threw Daniel out of the house for having won a French Academy of Sciences prize for which Johannn had also been a candidate (cf. Bell l , p. 134). Probably with the help of his loyal disciple Euler (a student of Johann in Basel and a colleague of Daniel in Saint Petersburg), Johann plagiarized Daniel's pathbreaking work on hydrodynamics (cf. Guillen 1 7 ) .
163 (Eng. transl. in Stillwell, 33 , 7-34). 3. Berkovitz, L. D., Optimal Control Theory. (Springer-Verlag, New York, 1974). 4. Berna, P., N. Conze, M. Duflo, M. Levy-Nahas, M. Rais, P. Renouard, M. Vergne, Representations des groupes resolubles. (Dunod, Paris, 1972). 5. Bernoulli, Johann, Curvatura radii in diaphanis nonuniformibus . . . [The curvature of a ray in nonuniform media . . . ]. Acta Eruditorum, May, 206-211 (1697). {Opera omnia I, 187-193.) 6. Bernoulli, Jakob, Solutio problematum fraternorum . . . una cum propositione reciproca aliorum [Solution of problems of my brother . . . together with the proposition of others in turn]. Acta Eruditorum, May, 211-217 (1697). (Opera I, 768-778.) 7. Bliss, G. A., Calculus of Variations. (Open Court Publishing Co., Chicago, 1925). 8. Bonnard, B., V. Jurdjevic, I. A. Kupka and G. Sallet, Transitivity of families of invariant vector fields on the semidirect products of Lie groups. Trans. Amer. Math. Soc. 271, no. 2, 525-535 (1982). 9. Bonnard, B., V. Jurdjevic, I. A. Kupka and G. Sallet, Systemes de champs de vecteurs transitifs sur les groupes de Lie semi-simples et leurs espaces homogenes (French). In Systems Analysis Conf. (Bordeaux, 1978), Asterisque, Soc. Math. France, Paris, 75-76 (1980). 10. Bonola, R., Non-Euclidean Geometry. (Italian original: La Geometria non-Euclidea, The Open Court Publishing Co., 1912.) Eng. transl. by H. S. Carslaw, (Dover, New York, 1955). 11. Cesari, L., Optimization—Theory and Applications. (Springer-Verlag, New York, 1983). 12. Clarke, F. H., The maximum principle under minimal hypotheses. SI AM J. Control Optim. 14, 1078-1091 (1976). 13. Clarke, F. H., Optimization and Nonsmooth Analysis. (Wiley Interscience, New York, 1983). 14. Clarke, F. H., Yu. S. Ledyaev, R. J. Stern, and P. R. Wolenski, Nonsmooth Analysis and Control Theory. Grad. Texts in Math. 178, (Springer-Verlag, Berlin, 1998). 15. Euler, L., Methodus inveniendi . . . accepti. Lausanne, Geneva, 1744; (Opera omnia, ser. I, vol. 25, 1952). 16. Goldstine, H. H., A History of the Calculus of Variations from the 17th to the 19th Century. (Springer-Verlag, New York, 1981). 17. Guillen, M., Five equations that changed the world: the power and poetry of mathematics. (New York, Hyperion, 1995).
164
18. Hestenes, M. R., Elements of the calculus of variations. In Modern Mathematics for the Engineer, (E. F. Beckenbach Ed., McGraw-Hill, New York, 1956). 19. Isidori, A., Nonlinear Control Systems. (Springer-Verlag, Berlin, 1995). 20. Jakubczyk, B., and W. Respondek eds., Geometry of Feedback and Optimal Control. (Marcel Dekker, New York, 1997). 21. Jurdjevic, V., and I. A. K. Kupka, Control systems on semisimple Lie groups and their homogeneous spaces. Ann. Inst. Fourier (Grenoble) 31, no. 4, vi, 151-179. 22. Jurdjevic, V., and I. A. K. Kupka, Control systems subordinated to a group action: accessibility. J. Differential Equations 39, no. 2, 186-211 (1981). 23. Jurdjevic, V., and I. A. K. Kupka, Linear systems with degenerate quadratic costs. Compt. Rend. Math. Rep. Acad. Sci. Canada 10, no. 2, 101-106 (1988). 24. Jurdjevic, V. Geometric Control Theory. (Cambridge U. Press, New York, 1997). 25. Kupka, I. A. K., Degenerate linear systems with quadratic cost under finiteness assumptions. In New trends in nonlinear control theory (Nantes, 1988), Lecture Notes in Control and Inform. Sci. 122, (Springer, Berlin, 231-239, 1989). 26. Lee, E. B., and L. Markus, Foundations of Optimal Control Theory. (Wiley, New York, 1967). 27. Lochak, G., La Geometrisation de la Physique. (Flammarion, Paris, 1994). 28. Malisoff, M., On the Bellman equation for optimal control problems with exit times and unbounded cost functionals. In Proc. 38th IEEE Conference on Decision and Control, Phoenix, AZ, Dec. 1999, (IEEE Publications, New York, 23-28, 1999). 29. Malisoff, M., A remark on the Bellman equation for optimal control problems with exit times and noncoercing dynamics. In Proc. 38th IEEE Conference on Decision and Control, Phoenix, AZ, Dec. 1999, (IEEE Publications, New York, 877-881, 1999). 30. Nijmeijer, H., and A. van der Schaft, Nonlinear Dynamical Control Systems. (Springer-Verlag, New York, 1990). 31. Pontryagin, L. S., V. G. Boltyanskii, R. V. Gamkrelidze, and E. F. Mischenko, The Mathematical Theory of Optimal Processes. (Wiley, New York, 1962). 32. Saccheri, G., Euclides ab omni naevo vindicatus: sive conatus geometricus quo stabiliuntur prima ipsa universale Geometriae Principia. (Milan,
165 Italy, 1733). 33. Stillwell, J., Sources of Hyperbolic Geometry. History of Mathematics, Vol. 10 (Amer. Math. Society, Providence, RI, 1996). 34. Struik, D. J., Ed., A Source Book in Mathematics, 1200-1800. (Harvard U. Press, Cambridge, Mass., 1969). 35. Sussmann, H. J., A strong version of the Lojasiewicz maximum principle. In Optimal Control of Differential Equations, N. H. Pavel Ed., (Marcel Dekker, New York, 293-309, 1994). 36. Sussmann, H. J., A strong version of the Maximum Principle under weak hypotheses. In Proc. 33rd IEEE Conference on Decision and Control, Orlando, FL, 1994, (IEEE publications, New York, 1950-1956, 1994). 37. Sussmann, H. J., An introduction to the coordinate-free maximum principle. In Geometry of Feedback and Optimal Control, B. Jakubczyk and W. Respondek Eds., (Marcel Dekker, New York, 463-557, 1997). 38. Sussmann, H. J., and J. C. Willems, 300 years of optimal control: from the brachystochrone to the maximum principle. (IEEE Control Systems Magazine, 32-44, June 1997). 39. Sussmann, H. J., Multidifferential calculus: chain rule, open mapping and transversal intersection theorems. In Optimal Control: Theory, Algorithms, and Applications, W. W. Hager and P. M. Pardalos Editors, (Kluwer Academic Publishers, 436-487, 1998). 40. Sussmann, H. J., Geometry and optimal control. In Mathematical Control Theory, J. Baillieul and J. C. Willems Eds., (Springer-Verlag, New York, 140-198, 1998). 41. Sussmann, H. J., Transversality conditions and a strong maximum principle for systems of differential inclusions. In Proc. 37th IEEE Conference on Decision and Control, Tampa, FL, Dec. 1998. (IEEE publications, New York, 1-6, 1998). 42. Sussmann, H. J., Resultats recents sur les courbes optimales. In Quelques aspects de la theorie du controle, Journee annuelle de la Societe Mathematique de France, (Paris, 1-50, June 2000). 43. Sussmann, H. J., A nonsmooth hybrid maximum principle. In Stability and Stabilization of Nonlinear Systems (Proceedings of the First European Community Nonlinear Control Network Workshop on Stability and Stabilization held in Ghent, Belgium, on March 15-16, 1999), D. Aeyels, F. Lamnabhi-Lagarrigue and A. J. van der Schaft Eds. Lect. Notes Control and Information Sciences 246, (SpringerVerlag, 325-354, 1999). 44. Sussmann, H. J., New theories of set-valued differentials and new versions of the maximum principle of optimal control theory. To appear in
166
Nonlinear Control in the Year 2000 (Proceedings of the European Control Network Workshop on Nonlinear Control, Paris, France, June 5-7, 2000), A. Isidori, F. Lamnabhi-Lagarrigue and W. Respondek Eds., (SpringerVerlag, 487-526,2000). 45. Synge, J. L., The life and early work of Sir William Rowan Hamilton. Scripta Mathematica X, 13-25 (1944).
Part II Contributed Chapters
This page is intentionally left blank
169
SYMPLECTIC M E T H O D S FOR S T R O N G LOCAL OPTIMALITY I N T H E B A N G - B A N G CASE ANDREI A. AGRACHEV Steklov Mathematical Institute, Russian Academy of Sciences, Gubkina ul.8 - 117966 Moscow, Russia and SISSA, Via Beirut 4 - 34014 Trieste, Italy E-mail: [email protected] GIANNA STEFANI Dip. di Matematica Applicata, G. Sansone, Via S. Marta 3 -50139 Firenze, Italy E-mail: [email protected] PIERLUIGI ZEZZA Dip. di Matematica per le Decisioni Via C. Lombroso 6/17 - 50134 Firenze, Italy E-mail:[email protected], URL: http://www.dmd.unifi.it/zezza/ We announce a new sufficient condition for a bang-bang extremal to be a strong local optimum for a control problem in the Mayer form. The controls appear linearly and take values in a polyhedron and the state space and the constraints are smooth, finite dimensional manifolds.
1
Introduction
We state a sufficient condition for a bang-bang extremal to be a strong local optimum for a control problem in the Mayer form. The controls appear linearly and they take values in a polyhedron and the state space and the constraints are smooth, finite dimensional manifolds; here we give only a sketch of the proof, a complete version of the result will be published elsewhere, see 7
The sufficient optimality condition contains two different sets of assumptions: the first (Assumption 1 and 2) concerns the regularity of the Hamiltonian flow while the second is the positivity of a suitable second variation. In the case of bang-bang extremals the control values belong to the boundary of the control set so that the kernel of the first variation does not contain any subspace and hence the usual second variation is not defined. To overcome this problem we consider the finite dimensional subproblem generated by perturbing the switching times. We prove that the sufficient second order
170
optimality conditions for this finite dimensional subproblem yield local strong optimality. We follow the Hamiltonian approach to strong optimality consisting in constructing a field of state extremals covering a neighborhood of the reference trajectory. This field of extremals is obtained by projecting, on the base manifold M, the flow of the maximized Hamiltonian emanating from the Lagrangian submanifold of the initial transversality conditions, which belongs to T*M; if this projection admits a Lipschitz continuous inverse, then we can estimate the variation of the cost at a neighboring trajectory by a function which depends only on the final point and it is hence independent on the control differential equation, the Lipschitz continuity of the inverse is guaranteed by the surjectivity of the tangent map. Let us point out that if the final point is fixed then the manifold of the admissible final points reduces to a singleton and hence, to obtain optimality, it is sufficient the surjectivity of the projection which corresponds to the classical non self-intersecting property of the state extremals, when the final point is not fixed, the optimality will also be guaranteed by the positivity of the second variation. The relations existing between the second variation and the symplectic properties of the Hamiltonian flow can be used to show that if the second variation is positive then the tangent map of the flow is surjective and the sufficient optimality conditions for the above mentioned function of the final point are satisfied. A crucial idea underlying the general approach is that the linear Hamiltonian flow of this linear quadratic problem has to be the tangent map of the flow of the maximized Hamiltonian. Some issues has already been addressed. In 5 we stated sufficient conditions for strong local optimality for an optimal control problem in Rn with unbounded controls, while in 4 we gave an intrinsic expression of the accessory problem and we studied the relations between the Hamiltonian flow and the index of the second variation. The geometric properties of the field of extremals needed to prove sufficient conditions for strong optimality has been studied in 6 . Similar conditions for time-optimality of a bang-bang trajectory have been obtained by A. Sarychev in 9 and 8 .
171
2
Main results
Let Xi, i = 1 , 2 , . . . , m be m distinct C°° vector fields defined on the C°° manifold M and let us define the multivalued function X:M^>TM,
X:x*+co{X1(x),...,Xm[x)},
where co denotes the convex hull. We consider an optimal control problem stated in the Mayer form Minimize
J(£) := co(£(0)) + cT{Z{T))
(2.1)
subject to i{t) e x{i(t)) ttO) 6 N0 , £(T) 6 JVr
(2-2) (2.3)
where N0, NT are C°° submanifolds of M. We are given, as a candidate optimal solution, a reference bang-bang Pontryagin extremal £; that is an absolutely continuous function £ : [0, T] - • M which is a solution of system (2.2)-(2.3), satisfies the Pontryagin maximum principle (PMP) and it is such that we can find a partition of the interval [0, T], {0 = t0 < tx < t2 < • • • < tr < U+i = T} with the property that, in each subinterval, the function £ is a solution of i(t) = XjMt)),
te[ti-i,n]
(2.4)
for some ji 6 { 1 , 2 , . . . , m } ; the values ti, i = 1,2,... ,r will be called switching times. We assume that Xj{ ^ Xji+1, for i = 1,2,..., r, for not introducing unnecessary switching times. Corresponding t o t h i s reference trajectory we define the time-dependent reference vector field h : [0, T] x M -> TM and we set hi ~ % 4 . _ l j t . ) : x >->•
Xj^x).
The time dependent reference vector field ht defines, by lifting to the cotangent bundle, the reference time dependent Hamiltonian H : [0,T] x T*M - • E, (t,£) ^
(£,ht(n£)),
where n : T*M -> M is the canonical projection and we set Hi := The maximized Hamiltonian H :T*M-*R,
l^
max
(l,v),
H^t._lit.y
172
is well defined and Lipschitz. For simpler notations we set x0 := |(0), xT := £(T). Recalling that any Hamiltonian Ht : T* M ->• R defines a Hamiltonian vector field, denoted by Ht, we can express the PMP by saying that there exist po £ {0,1} and a lift A of £ which is a solution of X(t) = Ht(X(t))
(2.5)
A(0) - po dco(x0) = 0 on TX0N0 \{T)+podcT(xT)=0 on TXTNT
(2.6) (2.7)
such that bo| + | | A | | ^ 0 Ht{X(t)) =
max (X(t),v) = H(X(t)). vEX(i(t))
The functions po CQ and po ex are denned on N0 and Nx, respectively, but they can be extended to the whole manifold M in such a way that the transversality conditions (2.6) and (2.7) hold on the whole tangent space. Let us denote by a, j3 : M —> E two functions such that a -p0c0 /3 — po ex
on N0, on Nx
A(0) = da(xo), X(T) =
-dP(xT).
In the normal case (po = 1) Q, /3 are cost functions equivalent to the original ones while in the abnormal case (po = 0) they are extensions of the zero function. When po = 0 all the costs disappear from our conditions and indeed we will study a problem with a zero cost. Proving that £ is a strict strong minimizer will imply that it is isolated among the admissible trajectories. The transversality conditions of the PMP can be stated saying that the end points of the adjoint covector belong to some specific Lagrangian manifolds, if we define A0 := {da(x) + T^No | x 6 N0} , A T := {-d/3(x) + T^Nx | x € NT} , then the transversality conditions (2.6)-(2.7) can be expressed as A(0) 6 A 0 ,
X(T) G A T .
173 The sufficient conditions will be stated analyzing the problem Minimize
J(fl := a(£(0)) + /?(£(T))
(P)
subject to (2.2) and (2.3). The points ti:=\(U),
i=0,l,...,r + l
will be called the switching points of the adjoint covector A. From the PMP we can deduce the following consequences which represent necessary optimality conditions for i — 1,2,..., r Hi(li) = Hi+i(£i) (d(Hi+1-Hi),Hi+1)(ei)>0. To state sufficient condition for f to be a strong local minimizer we need to strengthen these two conditions. We will assume that the following hold Assumption 1. (d(Hi+1 - Hi),Sw){ti)
> 0, * = 1,2,... ,r.
Assumption 2. The maximum max (\(t),v), t€[0,T] v€Xtf(t)) is attained at a vertex of X(£(t)) for all t ^ ti,t2,- • -,tr or along an onedimensional edge for t = t\, t2, • • •, tr. These conditions are strictly related to the properties of the flow of the maximized Hamiltonian H and they can be interpreted as regularity conditions on the maximized Hamiltonian near the adjoint covector. In fact the PMP implies that each switching point Hi belongs to the level set i?j+i — Hi = 0 and Assumption 1 yields that this level set is an hypersurface called switching surface. Moreover we can prove Lemma 2 . 1 . Under Assumption 1 there exists a neighborhood U of IQ such that we can define recursively, for i = 0 , 1 , . . . , r, the C°°-maps Ti : U - • M, and fa : U -> T*M
in the following way, set To : = 0,
the T{ 's are implicitly defined by (Hi - Hi+1) (expnWHiifa-iit))) Ti("i) = ti,
=0
174
while the fa 's are C°° symplectic diffeomorphism defined as <j>i{t) := exp(-Ti(e)Hi+1)
expn(e)Hi{4>i-i{l)).
Under Assumptions 1 and 2, by Lemma 2.1, we can say that the map "K : [0,T] x U - > [ 0 , r ] x T*M given by •K{t,t) = (t,exptHi+1(
t £ [Ti(0,r i + i(/)],
is the unique solution of the Hamiltonian system \(t) = H(X(t)) A(0) = L Moreover the flow "K is C°° on each 2 n + 1 dimensional C°° manifold with boundary Oj, given by Oi := { ( M ) | / € U, Ti_i(0 < * < Ti(l)} C [0,T] x T*M. Let us remark that every solution of this system has the same number of switches as the adjoint covector A. Remark 2.2. Assumption 1 plays a role analogous to the one of the strengthened Legendre condition in the case of unbounded controls; in fact Lemma 2.1 says that we can define locally, in a tube around the adjoint covector, a timedependent Hamiltonian as {t,l)t-¥Hi(t,e),
for
M~1(t,t)£Oi.
Assumption 2, which concerns the uniqueness of the maximum point, ensures that with this choice we obtain the maximized Hamiltonian, for analogous conditions in the case of unbounded controls see 5 . In the case of bang-bang extremals, the kernel of the first variation of the problem is trivial and hence the usual second variation, which is defined on the kernel of the first one, does not exist. To define an appropriate second variation we proceed starting from the following trivial fact: any choice of a subset of admissible variations for problem ( P ) would lead to a subproblem and hence to necessary conditions. Let us choose an appropriate r—dimensional family of variations corresponding to bang-bang trajectories, they are constructed by taking variations of the switching times. The optimality with respect to these variations will be sufficient (under the above stated assumptions) to prove strong local optimality of the reference trajectory. For a given a > 0 such that min i=l,...,r+l
(U — tj_i) > 2a,
175
let e G B(0, a) C W, set e 0 = £V+i = 0 and consider the time-dependent vector field obtained from the reference one in the following way (e,x) t-> ht(e,x) = hi(x) , t 6 (£,-_i + £•,•-!, *i +£i),
i = 1,2,.. .,r + 1.
In other words we have moved the switching time U by £j. Remark 2.3. Notice that a small e corresponds to a control variation which is small in the L1 norm but not in the L°° norm. We denote the flow of £(t) = ht(e,£(t)) by St : M x B ( 0 , a ) - » M and we consider the following finite dimensional subproblem of problem (P) Minimize
j(x,e)
:= a(x) + P(Sr(x,e))
(sub-P)
subject to x £ N0 , ST(x,e)
e NT.
Note that St : x ^
St(x,0)
is the flow of the reference vector field and hence St(xo, 0) = £(£)• Thanks to the choice of a,0 we have that the PMP implies that (xo,0) is a critical point for 7, that is dj(xo,0)=0, so that the second derivative of 7 at (xo,0) is well defined and J":=^27(xo,0) is a quadratic form on TXo M x E r which gives the second order approximation of 7. Thus the second variation of (sub-P) is the restriction of J " to the linearization of the constraints, namely if we set Ji = {{6x,e) e TXON0 x W : ST*{5x,e)
e
TXTNT},
then the second variation of (sub-P) is J,'^. Our main result is given by the following theorem. It states that under the regularity conditions on the maximized Hamiltonian, the positivity of the second variation of (sub-P) it is sufficient to prove that the reference trajectory is a strict strong local minimizer for the original problem. Theorem 2.4. Assume that a given bang-bang Pontryagin extremal £ satisfies Assumptions 1 and 2. If the second variation J!^ of (sub-P) is positive definite then £ is a strict strong local minimizer. In the abnormal case £ is an isolated admissible solution of the constrained control system.
176
3
Sketch of the proof
The proof is very technical, here we give an idea of how to construct the field of extremals and of the relations existing between the Hamiltonian flow and the second variation. A general introduction to symplectic methods and their applications to optimal control is in 1 and 2 . When the initial point is not free, it is not possible to cover, by the projection, a neighborhood of the initial point. In the calculus of variations this problem was solved by perturbing the initial time, but this method does not work in our case because the projection is singular on [£o,*i]- We can achieve the same result by perturbing the initial cost with a penalty term and constructing an equivalent problem with a free initial point. Let Q be any non negative quadratic form on TXoM, such that kerQ = TX0N0, we extend it to TXoM x E r by setting Q[6x,e}2 = Q[6x}2. If the quadratic form J" is positive on N then we can find p > 0 such that J" + PQ > 0 on {(Sx,e) G TXoM x W : ST*(Sx,e)
€ TXTNT} ,
as can be easily proved by elementary arguments of linear algebra. Let us choose a function ap such that ap = a on iVo dotp — da on TXo N0 D2(ap-a){xQ) = pQ, and consider the problem Minimize
a p (£(0)) + j8(£(T))
(3.1)
subject to
iit) G x(m) £(T) e NT. Since the reference trajectory satisfies the initial boundary conditions then proving that it is optimal for this new problem yields its optimality for the original one; therefore without loss of generality we can assume that the original problem has already the initial point free (iVo = M and a = ap) and hence the initial Lagrangian submanifold is horizontal and its projection covers a neighborhood of the initial point xoRemark 3 . 1 . This reduction is possible because the new cost on the initial point contains an exact penalty which can be constructed assuming that the second variation is positive definite.
177
Let s be the canonical one form in T*M, we denote by er = da the canonical symplectic two form on T*M, see 3 for the definitions. In the following we will use some of the properties of the Cartan form u> = s — H dt on I x T*M, associated to the Hamiltonian H. Namely • u> evaluated along a lift of a solution of (2.2) is non positive and it is zero along A. • w is exact on the manifold generated by the flow of H emanating from a Lagrangian manifold. By taking the restriction to a neighborhood of xo we can assume that A Q C U and that it is a smooth simply connected Lagrangian submanifold. We define r+1 4=1
The fi;'s are n + 1 dimensional C°°-manifolds with boundary. When the map -Kt := 7T o 0it : A 0 M- M
is nonsingular for all t € [0, T] then, by relating the properties of the Cartan form u> and those of this map, we can estimate the variation of the cost at a neighboring trajectory by a function which depends only on the final point and it is hence independent on the control differential equation. The optimality properties of | can be described through those of the symplectic map "Kt* '• Tf0Ao —> T^,t-.M, for simpler notations we set LQ := T(0 Ao- In particular let us consider, for i = 1,2,..., r + 1, the tangent map to the pull-back of the restriction of the flow "K to fli-i is given by the maps ^ : L 0 -»• TtoT*M ipi :=5ii.](exptiHi)tf(j)i-.it
=
ji^l^iexpti-iHi)*^-!*.
The functions ^,'s can be used to characterize the singularity of 7rt T h e o r e m 3.2. The map n* "Kt* • L0 -»• T^M is onto for each t £ [0,T], i.e.,
for each t 6 [0, T], if and only if
178
1. For i = 1,2,..., r -+-1 we have that ir*ipiL0 = TX0M. 2. For i = 1,2, ...,r
if Sli, Sl2 € L0 are such that 7r» tpi 5ti = 7T* rpi+iSl2
then adjide1,tpi+1S£2)>0. The above theorem states that, in the bang-bang case, a conjugate point can occur only at a switching time and, differently from the case of unbounded controls, the second variation may have a positive index without having positive nullity for a smaller t. When the final point is not fixed the following Theorem describes the optimality of £. Theorem 3.3. Assume that the map 7r» "Kt* '• LQ —> T;,t,M is onto for each t G [0, X1]. If for every non zero 6(.\ 6
LQ
7r» ipr+iS£i
and % £
^•T*^X(T)^T
SUC
^
^hat
= 7T» SI2
we have that o-(V»r+i«i, W2) > 0 then £ is a strict strong local minimizer for the problem (P). To show the relations between the second variation and the properties of the Hamiltonian flow, we first reduce (sub-P) to a problem which is linear in the control and where the admissible control maps are piecewise constant with the ti's as switching times. This goal can be achieved by a reparametrization of time. Consider the following control boundary value problem on E (p{r) = 1 + y>(0) = 0,
V(T)
where the control u takes values in (—1,1). Any solution of this boundary value problem is an increasing isomorphism of the interval [0, T] onto itself. If we set £i : = y - 1 ( * i ) ~U,
i=
l,2,...,r
179
then we have that ht(e,x) Moreover Sv^(x,e)
=
hv-i(t)(x).
is the solution of the differential equation C(T) = [1 + K T ) ] M C ( T ) ) ,
C(0)=X.
(3.2)
Let us notice that, since the behaviour of the trajectory is fully described by the integral of the control v, to obtain our variations it is sufficient to take v as a piecewise constant control with the same switching times of the reference trajectory. If i/; is the value of the control on [U-i, t{) and we set Ui ~
Vi (ti — i j - x )
then, from the definition and from the boundary conditions, we have that i
r+1
3=1
3=1
the last relation yields that our control space U has dimension r U:= ^ ( u i , u 2 , . . . , « r + i ) € # r + 1 | 5 T « i = o L For each u € U we denote by uu the corresponding control. In our finite dimensional subproblem (sub-P) we take the state defined by equation (3.2) and than the reference control will be the zero one. If we define the second variation of this problem, as in 4 , through the pull-back system, we obtain a linear-quadratic problem on TXoM x U. Thanks to the special structure of the problem the associated Hamiltonian is of the following type
(«,./)-• Gi'(MMt) where G" : T*QM x TXQM -> ffi is a piecewise constant linear Hamiltonian. We denote by Q"(6l,u) the solution of the associated Hamiltonian system \{t) = G'l{\{t))vu{t),
A(0) = St
The Lagrangian subspaces of the transversality conditions are L'J := {{-D2j(x0)(Sx,-),6x)
where 7 = a + f3 o St-
\ Sx G TXoM}
(3.3)
180
We study the changes of the signature of the second variation recursively, for k = 0 , 1 , . . . , r, on each
xk = xnTX0MnUk, where Uk := {u e U | Uj = 0 for j = k + 2 , . . .r + 1} , notice that UQ = {0} and Ur = U. This corresponds to consider admissible controls that are zero from a certain switching time on. Following the same ideas as in the case of unbounded controls, see 4 , we obtain that ker J!^ is described by those S£ G LQ and u G Uk such that %'^{5(.,u) £ L? and f G'i (S" (W,«)) i/„ (*) d* = 0,
for all veUk.
(3.4)
Thanks to Assumption 1, equation (3.4) defines a linear feedback laww : LQ —> U and S"(<W, (w, SI)) corresponds to the solution of the classical Jacobi system, since it is the solution of the Hamiltonian system of the second variation with the feedback control defined by equation (3.4). To conclude the proof we show that the linear maps
S$.(M):=S5r-(M,<w,M»), contain the necessary information about the behaviour of tangent map to the flow "K at the switching point £;. This information can be described through the anti-symplectic isomorphism i : T*oM x TX0M -> T(oT*M,
(w, 6x) •-> - u +
d(-0)t5x,
as S§. = »-Vfc+i * for * = 0 , 1 , . . . , r.
(3.5)
It is important to notice that (3.5) states that, modulo isomorphisms, the flow of the Hamiltonian of the second variation is the tangent map to the flow of the maximized Hamiltonian. References 1. Andrei A. Agrachev and Revaz V. Gamkrelidze, Symplectic geometry for optimal control, in Nonlinear Controllability and Optimal Control, Hector J. Sussmann, Ed., Pure and Applied Mathematics, vol. 133 (Marcel Dekker, 1990).
181
2. Andrei A. Agrachev and Revaz V. Gamkrelidze, Symplectic methods for optimization and control, in Geometry of Feedback and Optimal Control, New York, New York, B. Jacubczyk and W. Respondek, Eds., Pure and Applied Mathematics, 1-58 (Marcel Dekker, 1997). 3. Vladimir I. Arnold, Mathematical methods in classical mechanics (Springer, New York, 1980). 4. Andrei A. Agrachev, Gianna Stefani and PierLuigi Zezza, An invariant second variation in optimal control, International Journal of Control, 7 1 , 5, 689-715 (1998). 5. Andrei A. Agrachev, Gianna Stefani and PierLuigi Zezza, Strong minima in optimal control, Proceeding of the Steklov Mathematical Institute, 220, 4-26 (1998); translation from Tr. Mat. Inst. Steklova 220, 8-22 (1998). 6. Andrei A. Agrachev, Gianna Stefani and PierLuigi Zezza, A Hamiltonian approach to strong minima in optimal control, in Differential Geometry and Control. Proceedings of the Summer Research Institute, Boulder, CO, USA, June 29-July 19, 1997, Providence, RI, Ferreyra et al., Eds., 11-22 (American Mathematical Society, 1999). 7. Andrei A. Agrachev, Gianna Stefani and PierLuigi Zezza, Strong optimality for a bang-bang trajectory, Tech. report 08 (Dipartimento di Matematica per le Decisioni, Firenze, 2000). 8. Andrei V. Sarychev, Sufficient optimality conditions for Pontryagin extremals, Syst. Control Lett. 19, 6, 451-460 (1992). 9. Andrei V. Sarychev, First and second order sufficient optimality conditions for bang-bang controls, SI AM J. Control Optimization, 1, 35, 315-340 (1997).
This page is intentionally left blank
183
C H A R G E S I N M A G N E T I C FIELDS A N D S U B - R I E M A N N I A N GEODESICS ALFONSO ANZALDO-MENESES AND FELIPE MONROY-PEREZ Departamento de Ciencias Bdsicas, Universidad Autonoma Metropolitana-azcapotzalco, 02200, Mexico D.F. E-mail: [email protected], [email protected] In this paper we study the action of certain nilpotent Lie groups under which a differential system given in terms of a rank-two distribution remains invariant. Such systems describe the dynamics of electric charges in static inhomogeneous magnetic fields. The action of the Lie group associated to the sub-Riemannian structures in the simplest non-uniform cases, contains naturally the Heisenberg group which corresponds to a uniform field. A linear magnetic field yields the nilpotent group associated with the so-called Martinet case and the group corresponding to systems of Engel type. The Cartan five dimensional system is also the natural setting for the study of linear magnetic fields acting on classical electric charges. Our results generalize previous works on this class of non-holonomic systems.
1
Introduction
Let A be a rank-two distribution denned on a differential manifold. We study the action of certain nilpotent Lie groups that leave the differential system determined by A invariant. The motivation for this study is the geometry of dynamical systems describing the motion of classical electric charges in the Euclidean plane, under the influence of external, perpendicular and inhomogeneous magnetic fields. Sub-Riemannian geometry provides a natural setting for the study of certain aspects in classical particle and plasma physics 5 , this approach is not new and has been in the literature at least in the last ten years, see for instance, 13 . The dynamics of a classical electric charge in the plane under the influence of a perpendicular inhomogeneous magnetic field can be described by means of a rank-two distribution, which together with a flat Riemannian metric, determines a sub-Riemannian structure. The Lie algebra generated by the distribution turns out to be nilpotent. The study of the action of the corresponding nilpotent Lie group plays an important role in our analysis, and it contains as the simplest nilpotent subgroup the well-known Heisenberg group. The so-called Martinet case, studied by R. Montgomery, 14 , and B. Bonnard et al, x, turns out, under our approach, to be a particular example
184
corresponding to linear magnetic fields. Our work is related with that of Y.L. Sachkov 17 and that of the two authors mentioned above. In contrast with those references, we present explicit and detailed calculations of trajectories (sub-Riemannian geodesies), and a more general approach. The PfafHan system associated to the inhomogeneous magnetic field leads us to consider Goursat and Cartan distributions. The non-holonomic constraints encoded in the set of 1—forms, motivates the extension of the standard two dimensional Lagrangian to higher dimensions, even in this generality, certain constants of motion are explicitly exhibited. For this presentation we apply variational principles and perform an explicit integration process in terms of hyper-elliptic functions. Abnormal extremals appear, however they turn out to be non strictly abnormal. In a separate work 12 , we apply Pontryagin Maximum Principle to carry out the study of a time optimal control problem in certain nilpotent Lie groups which contain some of the groups described here. Apart from this introduction, this paper contains four sections. In the second section we establish our notation, and provide basic definitions and standard results in sub-Riemannian geometry and distributions. In section three we apply the Lagrange multipliers technique and explicitly integrate the extremal equations in terms hyper-elliptic integrals. In section four, we discuss low dimensional cases. In particular we study the five dimensional Cartan system, which has attracted a lot of interest in differential geometry and control theory, see 3 . Also in this case we present an explicit integration in terms of the Weierstrass p-function. 2
Sub-Riemannian geometry and classical particles
As we mentioned before, some problems in classical particle physics find a natural setting within a general geometric framework which goes in the literature under different names: singular Riemannian geometry 2 , sub-Riemannian geometry 19 , or Carnot-Caratheodory geometry 7 . 2.1
Sub-Riemannian geodesies and distributions
A sub-Riemannian structure on a manifold P consists of a couple (A, g), where A is a distribution satisfying the so-called full-rank condition (Lie(A)(g) = TqP, for all q € P), and g is a Riemannian metric on A, see 8 . Let us denote the corresponding scalar product as (-,-) 9 . An admissible curve for A, also called horizontal, is an absolutely continuous curve
185
q : [0, Tg] -> P such that q(t) £ A(g(£)) almost everywhere. The length of an admissible curve q(t) is given as
L{q{t)) = J
9
^J(q(t),q(t))g dt,
whereas its energy is given as follows
E(q{t)) = \ j '(q(t),q(t))g dt. Given two points qo,qi 6 P, a minimizer connecting qo with q\ is an admissible curve q : [0, Tq] —> P with minimal length satisfying q(0) = qo and q(Tq) = qi. This defines the sub-Riemannian distance between qo and q\. It is well known that if all the curves considered are defined in the same interval, then the length and energy minimizing problems are equivalent. By the Chow-Rashevsky's theorem 6 , 14 , if the distribution satisfies the full-rank condition, and the manifold is connected, then any two points can be connected by a smooth horizontal path. A non-constant admissible curve q : [0,Tq] —¥ P is called a subRiemannian geodesic, if its restriction to any small enough subinterval of [0, Tq] is a minimizer, and ||<7(£)||9 does not depend on the parameter t. In contrast with the Riemannian case, sub-Riemannian geodesies are not determined by its initial tangent vector, but by its initial covector, that is, if p 6 T*P is an initial covector, then the corresponding initial tangent vector v is denned by means of the following formula (w,v)g
=p{w),
for all w S A(TT(P)), where IT denotes the canonical projection of the cotangent bundle T*P. We shall consider in this paper bracket generating and regular distributions. A distribution A on a manifold P is said to be bracJcet generating, if there is an integer n such that A™ = TqP for each q € P. Here, A i + 1 = [A,A 4 ], i = l,..., which lead to the flag A , c A^ c • • • C TqP
186
As R. Montgomery has pointed o u t 1 5 , the growth vector is the most basic numerical invariant associated with a distribution. The growth vector nq of A at the point q, is defined as nq = (niq,n2q,...
,nnq),
where n ^ = dim Aq. The distribution is said to be regular at q, if the growth vector is constant in a neighborhood of the point q. The notion of symmetry in sub-Riemannian geometry has been studied since the early paper of R. Brockett 2 . More recently symmetries have been analyzed for higher dimensional Heisenberg groups n , and for some relevant cases of low dimensional Lie algebras 17 . We shall follow our paper mentioned above to describe the symmetries of A by means of the action on P of a Lie group under which A remains invariant. 2.2
Geometry of non-holonomic
constraints
The dynamics of a point under non-holonomic constraints when these are given by a certain Pfaffian system, can be written as a differential control system. The corresponding variational problem of minimizing the action, can be formulated either as an optimal control problem, or in the language of connections on principal bundles. Let M be the base manifold, a simply connected and complete twodimensional Riemannian manifold and take a coordinate chart with coordinates (x,y). Let {d6i — {vidx + fiidy)}i be a set of linearly independent 1—forms, the kernel of this Pfaffian system is encoded in the differential control system q = uX1{q)
+vX2{q),
where the control parameters u = x, v — y and the state variable q = (x,y,6\,...) are taken in the appropriate spaces denoted as U and P respectively. If A = {Xi,X2} turns out to be a regular and bracket generating distribution, then for all q € P, we can complete a basis {Xi(q),X2(q),X3(q),... ,XdimP(Q)} for each tangent space TqP. By declaring this basis orthonormal we obtain an inner product (-, -)q whose restriction to A yields a sub-Riemannian structure. The sub-Riemannian geodesies correspond to absolutely continuous solution curves [0, Tq] ->• P, t H» q(t) of the above control system which minimize the energy functional
187
E(q(t)) = \jq<«(*),«(*)>, dt=^J
\2+v2
dt.
In summary, we obtain under this setting an optimal control problem on the manifold P. The above formulation leads us naturally to the framework of principal bundles. Because in our case (not true in general), the Lie group G, corresponding to the Lie algebra go generated by the vector fields {X3,... , Xdim p } , yields an action • : G x P -> P satisfying {9192)-q = 9i- (92 • q) for each q € P, which together with the natural projection TT : P -> M, q H* Tr(q) = (x, y), determines the principal bundle over M with total space P and structure group G. Furthermore, since for each q 6 P one has the splitting TqP = Horq © Verq, where Horq = Aq and Verq = go(q), then a unique connection on the principal bundle (P, M, n, G, •) is determined, see 18 for details. Remark 2.1. The control system mentioned before determines horizontal lifts Xi and X2 of tangent vectors on M. This lifting provides a smoothly varying family of linear maps aq : T(x>y)M —*TqP satisfying dirq o aq — idM and a(g-q) = g- a{q) 2.3
The variational Problem
As explained above, the physical problem of a classical particle evolving on the manifold M under the influence of an external static magnetic field normal to M, can be formulated indistinctly either as a variational problem, as an optimal control problem or as a problem of connections on principal bundles. In this paper we take the calculus of variations' approach to discuss the problem. Let us choose the coordinate chart (x, y) on M in such a way that the magnetic field B is written locally as (0,0, Bz). We shall consider two cases, namely Polynomial magnetic fields The function Bz (x) is a polynomial in x Linear magnetic fields The function Bz(x,y)
is linear in both x and y
If m denotes the particle's mass, the geometrical problem consists in the calculation of the extremum of the action
S=jJ(x>+y>)dt,
188 subject to nonholonomic constraints which correspond to particular gauge choices for the magnetic field vector potential. 3
Polynomial Magnetic Fields
Several choices are possible to define a polynomial Bz(x), in particular we consider nonholonomic constraints defined by means of the following Pfaffian system ojk=d9k-l-xkdy,
k = l,...,N
+ l,
(3.1)
where N is the degree of Bz(x). These 1—forms have a well defined degree. Setting deg(x) = deg(y) = 1, we get deg(uik) = k + 1. Particular cases for which some of these forms are absent could be of some interest. This variational problem lead us to a rank-two distribution A defined on the N + 3-dimensional manifold P, with coordinates q = (x,y, 6\,... , #;v+i), as explained before. The distribution A is given by the vector fields
Xi = dx, N+l
X2 = dy+Y^
-^dOi.
(3.2)
This distribution is bracket generating and its growth vector is generically written as ( 2 , . . . , N + 3); the last entry can be smaller under some circumstances. The Lie brackets lead to a nilpotent Lie algebra denoted as Q, with the following commuting relations [Xi,X2] = X3, [Xi,X3] = X4,
[XI,XN+2]
with
= Xtf+3,
189
N+l
1
The vector field XN+3 — 86N+I is central, and the subalgebras generated by the vector fields {Xk, k ^ 1} are Abelian. The subalgebra generated by {Xi,X3,Xi,... ,XN+3} is a non-Abelian ideal, whereas those generated by {Xi,Xi+\,... ,XN+3} are Abelian ideals. Let * be the product on P defined as ( a i , a 2 , . . . ,aN+3)*(a[,a'2,...
,a'N+3)
= (a'{,a2',...
,"#+3)
where a" = a i + a[, "2 = a 2 + a 2 ,
fc-i
ai' = a*+aj;+ V 71
1
^a?~X>
k = 3,...,N + 3
The manifold P becomes a Lie group with this product and we have Theorem 3.1. The group (P, *) acts on itself by left multiplication leaving the vector fields {X\,..., Xw+3} invariant Proof. It follows directly from the definition of *-left invariant vector fields.
• From the physical point of view we can write the following Corollary 3.2. The dynamical system defined by the metric x2 + y2 and the non-holonomic constraints u>i = dBi — \xldy, i = 1 , . . . , N + 1 is invariant under the left action of P. Remark 3.3. Observe that the vector fields {X{} are not left invariant with respect to left translations of the group law locally obtained by the exponential map, that is a" = ai + a[,
a'2' = a2 + o>'2, a'l = a3 + a'3 + -(ctict'2 — 0.^2), • • • ,etc.
190 However, any linearly independent set of vector fields left invariant with respect to this group law, can be expressed as linear combination of the basis {Xi} above. These linear combinations determine a map from the tangent space to itself and are directly related to the gauge invariance of the magnetic field vector potential. Clearly, the set of all linear maps of the corresponding vector space forms a group. Accordingly, there is set of related Pfaffian systems corresponding to the same dynamical system. We are dealing here with the group of automorphisms Aut(g) of our nilpotent Lie algebra g.
3.1
Goursat systems
The Goursat normal form for a Pfaffian system has been in the control theory literature under the name of chained form systems. This normal form has been used in the study of planning problems with non-integrable velocity constraints, see 16 . A Pfaffian system on a N + 3 dimensional manifold P system is in the Goursat normal form, if there exist a coordinate chart q = (x,y,ui,... ,UN+I) on which the system is written as follows
du\ — ydx du2 — u\dx \
(3.3)
dv,N+l ~ Ujydx
This system, together with a flat Riemannian metric on P, is equivalent the system discussed above, in the sense that it leads to the same equations of motion and it is possible to give an analytic map from one set of variables to the other. We have the following Proposition 3.4. The Lie algebra determined by system (3.3) is isomorphic to the Lie algebra g. Proof. In fact, the kernel of the above Pfaffian system is encoded in the following differential system
q=
xZ1(q)+yZ2(q),
defined by the following vector fields
191 N
Z\ = dx + ydui + 22 Uidui+x t=i
Z2=dy The non-zero Lie brackets are the following [Z1,Z2] =
-du1=:Z3
[ZuZk]
= (-l)* + 1 0u f c _i =: Zk+1
[Z1:ZN]
= (-l)N+1duN
=: ZN+1
Therefore, the Lie algebra coincides with Q above as expected. 3.2
(3.4)
•
Sub-Riemannian geodesies for polynomial fields
In this section we shall integrate the extremal equations. This equations are written in the total space P, and project down to the base manifold M. That is, consider a curve C : [0, Tc] -+ M, t »-> C(t), with initial point {xo,Vo) = C(0) and with p0 in the fiber 7r -1 (xo,yo). The parallel transport of po along C is given by the curve defined by dC{t)/dt = apdC(t)/dt, with (7(0) = po and C(t) = p. The curve C projects by 7r onto the curve C. As usual in optimal control problems, there are two types of extremal curves, normal and abnormal, in the present context the latter correspond to those extremals which do not depend on the kinetic energy. For details on abnormality we refer the reader to R. Montgomery's survey 14 . Proposition 3.5. The normal extremals project to the curve t i-> C(t) = (x(t),y(t)) which satisfies the system x = jj =
qBz(x)y -qBz{x)x
with qBz(x) a polynomial in x. And consequently can be integrated by quadratures. Proof. For the Pfaffian system (3.1) and the metric given by the kinetic energy, the Lagrangian is given by
192
C = A 0 y ( x 2 + y2) + j ; \k0k
-
-xky),
k=i
where the A*, A; = 1,...,JV + 1, are Lagrange parameters, in general time dependent, and the parameter Ao is a constant, which can be taken equal to 1. The Euler Lagrange equations readily yield Aj
Et JTWX
mx = my =
. (i-iyx
j_i .
y
'
x
'
Ai = 0, consequently, all Lagrange parameters A; are constant. The above equations are just Lorentz' equations for a particle charge q with mass m, under the influence of the magnetic field given by B = (0,0, Bz)1 and qBz = — ]T^ (i-\)\x%~1 •> which i s a polynomial of degree N in x. The horizontal trajectory C(t) is given by the solutions x(t) and y(t) and by the solutions of the Pfaffian system 0* — \xly = 0, for i = 1 , . . . , N + 1 , as required. In order to integrate the equations we parameterize the trajectories by arclength, write the field as ^qBz = ^ bix1, and set, without loss of generality, the coordinate chart in such a way that (xo,yo) is the origin in the plane, we have then N
bixly,
x = ^2 i=0
d
TT-^
bi
i+1
«=0
so that integrating N
h °i
E TT\ i=0
and then
X
i+1
'
193 h a2N+2X27V+2
£ = a0 + a\x +
with £ = x and a set of known constants a i5 i = 1 , . . . , 2N + 3. Some of these constants are the following
a0 = (iof, ai = 26 0 «/o, a-2 = hy0 - b%,
2bNbM-i
&2N+1
a2N+2
N(N + 1) _
b%
The above equation can be formally integrated by means of the following hyper-elliptic integral
t(x) =
/ (0) y/a0 H
h a2N+2C2N+2
'
the associated inverse functions are thus the solutions of the above algebraic equation and the integration is complete.
•
Remark 3.6. The coefficients Oj can lead to singular algebraic curves for certain initial conditions. For example, for XQ = 0 and bo = 0, i.e., ao = 0 = a\, the curve has at least a double point for N > 0. Since qBz{x) = bo + b\x + • • •, this example corresponds to a trajectory along a line (the yaxis) for which the magnetic field is zero. Since in this case the remaining parallel lines on which the magnetic field is zero can be at any other values of x, then the same applies for all straight lines on which B is zero. We now discuss abnormal extremals for polynomial fields. We consider in this case the Goursat normal form for the Pfaffian system which is equivalent to our system as was mentioned above. We take Liu and Sussmann's definition of strict abnormality, see 10 Definition 3.7. A strictly abnormal extremal of a sub-Riemannian manifold, is an abnormal extremal that is not normal.
194
Proposition 3.8. Abnormal extremals for polynomial magnetic fields in one variable correspond to straight lines on M, and consequently they are not strictly abnormal. Proof. In this case we have the Lagrangian JV+l
£ abnormal G
\
"* \ / -
=2-,
Afc Ufc
'
„.
*\
~uk+lx),
i=l
and the Euler-Lagrange equations reduce to qBz(x)y
= 0,
qBz(x)x
= 0,
where again B = (0,0, BZY and qBz = \N+I, with constants of integration a. The non-trivial solutions are precisely the set of points for which Bz(x) = 0, which corresponds to straight lines, i.e., x = y •=• 0, in base space. Therefore, the abnormal extremals are not strictly abnormal. D Remark 3.9. We observe that, the equations of motion resulting from other gauges are equivalent to these obtained equations above. Furthermore, the extremal for the case n = 1 corresponds to the famous example of R. Montgomery and I. Kupka, see 9 . 3.3
Engel and Martinet systems
There are two particular cases which has been extensively studied by Y. Sachkov 17 , R. Montgomery 14 and B.Bonnard et al x , they are known as Engel and Martinet systems. Engel case In this case one considers the polynomial gauge for N = 1 and writes z = d\ and w = 82 in (3.2). The resulting vector fields are the following
195
Xi = dx, x2 X2 = dy + xdz + —dw, X3 = dz + xdw, Xi = dw, these vector fields yield a basis for the so-called Engel algebra
[X\, X2] = Xz,
[Xi, Xz] = Xi.
This algebra is four dimensional and the associated one-forms are of Goursat type. The growth vector of the distribution {X\,X2} is (2,3,4). The corresponding magnetic field is ^-Bz = b^x + boMartinet case In this case, one takes ^Bz = bix, that is, zero constant magnetic field contribution. From the two 1—forms of the Goursat system resulting for N = 1 in (3.1) only that corresponding to the single Martinet 1—form dw = dz — \x2dy is considered. The growth vector is here (2,3) for x 7^ 0 and (2,2,3) for x = 0. Notice that the reduced vector fields still satisfy the Engel algebra. Remark 3.10. R.Montgomery uses also the approach of classical particles in magnetic fields to describe the Martinet case, see 1 4 . 4
Linear magnetic fields, and Cartan's five dimensional case
We study now the system corresponding to Bz(x,y) being a linear function in the two variables x and y. This apparently simple case, leads naturally to the famous Cartan five dimensional Pfaffian system 4 . According to the last section, the points on which the magnetic field is zero are always straight lines parallel to the y—axis. Such a selection is in fact particularly simple, however, the generic case would be straight lines which are not necessarily parallel to the vertical axis, but have a nontrivial slope. For this purpose we take the function ^Bz with a2 + P2 = 1.
= b1(ax + l3y) + bo,
196
This case does not reduce to the case TV = 1 of the Goursat system (3.3) d>i = du — zdx u>2 = dz — ydx,
(4.1)
since we must add the following 1-form
Q3 = dv - -zdy.
(4.2)
The vector fields of the rank-two distribution denoted as V, corresponding to these forms are the following Xi — dx + zdu + ydz X2 = dy+
Z
-dv.
(4.3)
Let us denote as ns the nilpotent five dimensional Lie algebra generated by T>, the non-trivial Lie brackets are as follows [xltX2]
=^dv-dz=:X3
[x1,X3]=du=:Xi
(4.4)
[x2,X3] =8v=:X5. The growth vector of T> is (2,3,5). This system is usually called a system of Cartan type, it has been largely studied beginning with E. Cartan 4 , who showed their relation with the exceptional Lie algebra Q2- A modern treatment can be found for instance in 3 . The Lie algebra ns is more general than the algebra (3.4) corresponding to N = 1, since it contains the additional (central) generator X&. Let us denote as N5 Lie group corresponding to ns. This group can be represented by M5 endowed with the following group law
(ai,a 2 ,a3,0!4,a:5)(/3i,/?2,/33,/?4,/?5) = («i + / ? i , a 2 + /32,a'3,a'4,a'5), here
197 a3 = a3 + fa + - ( Q I / ? 2 -
a2Pi)
a'i = a 4 + Pi + 2("i^3 - a3Pi) - — (/?i - a i ) ( a 1 ^ 2 - a 2 f t ) a^ = a 5 + ^5 + - ( a ^ - 0:3^2) - y ^ C ^ ~ a2)(ai/S 2 -
a20i).
The group JV5 acts on itself by left multiplication leaving the following two vector fields invariant
x,=fc-|«,-(j| + i)a.-£*,. These vector fields span the kernel of the Pfaffian system wi = dz + %(ydx — xdy), Z
X
u2 = du + -dx + jz(ydx Z
- xdy),
(4.5)
1J
u3 = dv + -dy + jziydx
-
xdy),
that we call the Cartan Pfaffian system. A direct calculation shows that
[xl,x2] = dz + ^du + y-dv.= x3. Therefore taking X4 := X4 and X5 := X5, we recover the commuting relations (4.4) for the vector fields Xi, i = 1 , . . . , 5. In summary we have the following Proposition 4.1. The group N$ acts on itself by left multiplication leaving the vector fields Xi,i = 1 , . . . , 5 invariant. Moreover the Lie algebra generated by {Xi) is isomorphic to ns 4-1
The action of the semi-direct product N$ x S 0 2
As in the Heisenberg case there is a rotational action on N5, which is encoded in the left invariant vector field W = xdy — ydx + udv — vdu,
198 which satisfies the following commuting relations [XUW}= X2, [X2,W] = -X1, [X4,W}= X5, [X5,W]=-Xi, these brackets together with (4.4), allow us to consider the semi-direct sum ns ® s so 2 , from which the action of iV5 x SO2 becomes transparent. As usual, we take the product (x, z, w, R) • (x1, z',, w', R!) to be equal to (x+Rx*,z + z'+^x*JRxH,w with R,R' e S 0 2 ,
+ Rw' + hz'x-zRxH)
&-{x,y),
uf = (u,v),
+
^x4JRx'(x-R&),RR')
z £ E, and
We have the following Theorem 4.2. The group (iV5 x SO2, •) acts on N$ leaving the Cartan Pfaffian system (4-5) invariant. 4-2
Sub-Riemannian geodesies for linear magnetic field
As in the last section we take a curve C : [0, Tc] -> E 2 , t i-> C(t), with initial point (a;0, yo) = C(0) and with p0 in the fiber 7r_1 (XO, yo)- The parallel transport determines the curve C which projects by it onto C. Proposition 4.3. The normal extremals project to the curve t t-^ C(t) — (x(t),y(t)) which satisfies the system x =
m
—Bz(x,y)y
V=
Bz(x,y)x m with qBz(x,y) linear in x andy. The complete system in E 5 can be integrated by quadratures. Furthermore there are not strictly abnormal extremals. Proof. The Lagrangian for the non-holonomic constraints in this case is given as follows
199
Cc = A o y ( i 2 + f) + ^(u+-x
+
+ Ai(i + - ( i / i - xy)) ^x-^)
+
X3(v+-y
+
—
--y),
we take first the normal case, Ao = 1, to obtain easily x =
—Bz{x,y)y
V
Bz(x,y)x m with ^-Bz = bi(ax +/3y) + bo as required. Furthermore, the remaining EulerLagrange equations yield
z .
x .
z .
y
This system can be written in a simpler way by means of the following rotations
" P\ fx\ -fx\
( a 0\ [A
-fu\
-/3a)\yJ-\Y)'
\-/3aj{vJ
\V J
to obtain X = {hX + b0)Y, Y = -{hX + b0)X, Z=±(XY-YX),
Z V
Y
•
(4.6)
Y +
•
= -2 -6ZThe equation for X is just an elementary elliptic curve and its solution can be easily given in terms of doubly periodic functions. The corresponding algebraic equation takes the form
200
£2 = a 0 + a i X + a2X2 + a 3 X 3 + a 4 X 4 , here ao = X$, a\ = 2boYo, a2 = biYo — b\, a 3 = — &0&1 and 04 = —b\/A. The algebraic equation can be given in terms of the Weierstrass p-function by a linear fractional transformation X =
ap + b ;, cp + d
ad — be = 1,
where the p-function satisfies (p') 2 = 4 ( P - ei)(p - e 2 )(p - e 3 ) for ei, e 2 and e 3 constants. The function y ( i ) can be also obtained in terms of elliptic functions as follows
= Y0t- f (bo + h—^T.
2 the integration can be performed again analytically. For the old variables (x,y), the straight lines for which ^Bz = b\{ax + 0y) + bo vanishes are particular solutions of the equations of motion for the normal extremals. Since for the abnormal extremals, Ao = 0, the same straight line solutions are obtained, we conclude that also in this case the abnormal extremals are not strictly abnormal. Further, every horizontal vector is tangent to an abnormal extremal for this distribution.
•
Remark 4.4. Not surprisingly, in the coordinates (x,y,z,u) the system (4-6) corresponds to the case of an original Engel structure. In general, if the magnetic field does not variates strongly as a function of the coordinates, this case corresponds to the first order approximation. Remark 4.5. A simple characterization of the above elliptic curve is obtained in terms of the cross-ratio
ei - e 3 Most important is the fact that the modular invariant
201
tf_ (A2 - A + l ) 3 32 ' A 2 ( A - 1 ) 2 ' is a true modulus, that is, it can be used to define an equivalence between curves having the same J. If e? — ez,e\ = e-i or e\ — e$, the cross-ratio takes the values (0,1, oo) and J = oo. The curve degenerates in equivalent stable singular cubic curves. Topologically, these curves are associated with a sphere with two points identified. In our problem, if we let b\ —> 0 the curve degenerates in a rational curve. Acknowledgements Part of this work was done during a sabbatical stay of the first Author at the Arnold Sommerfeld Institute, Clausthal, Germany with support of DAAD. References 1. Bonnard B., Chyba M. and Kupka I., Lieu conjugue en geometrie sousRiemannienne. Le cas Martinet plat, Rapport de Recherche No.90, University de Bourgogne, Laboratoire de Topologie, Dijon, Prance, (1996). 2. Brockett R.W., Control theory and singular Riemannian geometry, in New directions in applied mathematics, Hilton, P.J. and Young G.S. Eds., (Springer-Verlag, 11-27, 1981). 3. Bryant R., Hsu L., Rigidity of Integral Curves of Rank-two distributions, Invent. Math., 114, 435-461 (1993) 4. Cartan E., Les systemes de Pfaff a cinque variables et les equations aux derivees partielles du second ordre, Ann. Sci. Ecole Normale, 27, No.3, 109-192 (1910). 5. Chandrasekhar, S., Plasma Physics, (The University of Chicago Press, Chicago, 1960). 6. Chow, W.L., Uber Systeme von Linearen partiellen Differentialgleichungen erster Ordnung, Math. Ann., 117, 98-105 (1939). 7. Gromov M., Carnot-Caratheodory spaces seen from within, in SubRiemannian geometry, Eds. A. Bellaiche, J.J. Risler, (Birkhauser, 79323, 1996). 8. Kupka I., Geometrie sous-Riemanniene, Seminaire Bourbaki, (1996). 9. Kupka I., Abnormal extremals, preprint, (1992). 10. Liu W., Sussmann H., Shortest paths for sub-Riemannian metrics on rank-two distributions, Memoirs of the American Mathematical Society,
202
118, No.564, (1995). 11. Monroy-Perez F. and Anzaldo-Meneses A., Optimal control on the Heisenberg group, Jour. Dyn. Control. Syst, 5, No.4, 473-499 (1999). 12. Monroy-Perez F. and Anzaldo-Meneses A., Optimal control on certain nilpotent groups, preprint, (1999). 13. Montgomery, R., The Isoholonomic Problem and some Applications, Comm. Math. Phys., 128, 565-592 (1990). 14. Montgomery, R., A Survey of Singular Curves in Sub-Riemannian Geometry, Jour. Dyn. Control. Syst, 1, 49-90 (1995). 15. Montgomery, R., A tour of Sub-Riemannian Geometries, Geodesies and Applications, to be published, (2000). 16. Tilbury D., Murray R., Sastry S., Trajectory Generation for the N-trailer Problem Using Goursat Normal Form, IEEE Transactions on Automatic Control, 40, 5, 802-819 (1995). 17. Y.L. Sachkov, Symmetries of Flat Rank Two Distributions and SubRiemannian Structures, Rapport de Recherche No.151, Universite de Bourgogne, Laboratoire de Topologie, Dijon, France, (1998). 18. Spivak M., A comprehensive Introduction to Differential Geometry, Vol. II, (Publish or Perish, 1979). 19. Strichartz R.S., Sub-Riemannian Geometry, Journal of Differential Geometry, 24, 221-263 (1986).
203
TOPOLOGICAL V E R S U S S M O O T H LINEARIZATION OF CONTROL SYSTEMS LAURENT BARATCHART INRIA, B.P. 93, 06902 Sophia Antipolis cedex, France E-mail: Laurent. [email protected]
Dept. of Mathematics,
MONIQUE CHYBA Univ. of California, Santa Cruz, CA 95064, U. S. A. E-mail: [email protected]
JEAN-BAPTISTE POMET INRIA, B.P. 93, 06902 Sophia Antipolis cedex, France E-mail: [email protected] This note deals with "Grobman-Hartman like" theorems for control systems (or in other words under-determined systems of ordinary differential equations). The main results (proved elsewhere) is that when a control system is topologically conjugate to a linear controllable one, then it is also "almost" differentiably conjugate. We focus on the meaning of this result, and on an open question resulting from it.
1
Introduction
In this note, we discuss the local behavior of a nonlinear control system x = f(x,u),
xeW1
, u£Rm
,
(1.1)
say around (0,0) € E n + m . For general control systems (as opposed e.g. to affine in the control), "local" has to be understood with respect to both state and control. The first reaction when dealing with local properties is to compute the linear approximation of (1.1). When this linear control system happens to be controllable, all the local usual control objectives can be met using linear control, based on the linear approximation. For instance, a linear control that asymptotically stabilizes the linear approximation will also stabilize the nonlinear system, locally; minimizing a quadratic cost can also be achieved up to first order based on the linear approximation only. Hence, the linear approximation is a good enough model for the purpose of designing controllers achieving a desired behavior for small states and controls. We believe that all control engineers or control theorists agree on this statement, arising from practice, although we would welcome some contradiction.
204
Rephrasing the above statement without reference to control objectives leads to an imprecise statement, grounded mostly on some necessarily subjective intuition, and that should rather be taken as an opening sentence to launch a debate than as a conjecture : (nothing distinguishes qualitatively the behavior of a nonlinear control ]system from the one of its linear approximation if the latter is controllable. (1.2) It is natural to try to formalize this statement, as a prerequisite to any proper theory of nonlinear modeling and identification of control systems, in a very preliminary manner since it only deals with local phenomena. A nice way to turn that belief into a sound, and correct, assertion would be to find some equivalence relation between control systems (or models) that preserves at least "qualitative" behavior, and for which these two systems (a nonlinear system and its controllable linear approximation) are in general equivalent. We assume controllability of the linear approximation because when this fails none of the above is correct, at least in most common case when the nonlinear system is itself controllable. Indeed, (non-)controllability is a qualitative phenomenon : for instance, feeding a linear non controllable system with "random" inputs, one observes that the state is confined in leafs of positive codimension, while for a controllable system the whole state space is explored.. To enlighten the discussion on local behavior of control systems, let us recall the situation for ordinary differential equations x = F(x) (particular case of (1.1) where the control u has dimension 0) : • If F(0) ^ 0, the "flow-box theorem" (see e.g. 1 ) , gives local coordinates,
(o\ smooth if F is smooth, in which F is of the form
:
w
• If F(Q) = 0 and the square matrix F'(0) has no pure imaginary eigenvalue (hyperbolic equilibrium), then Grobman-Hartman Theorem 5 tells us that the flow of the differential equation is locally conjugate to the flow of its linear approximation via a homeomorphism that need not, in general, be smooth if F is smooth (and in fact smooth conjugation requires more assumption, resonances are obstructions to it) (see e.g. 2 ) . • If -F(O) = 0 and the square matrix -F'(O) has some pure imaginary eigenvalue, then the situation is more intricate even locally, namely the phase
205
portrait of the nonlinear dynamical system x = F(x) can be very different locally from the one of a linear system. This case is of high interest in the theory of dynamical systems, but can be considered as "degenerate", in the same way as non controllability of the linear approximation for control systems. Since conjugation of flows does preserve qualitative phenomena like the overall aspect of the phase portrait, one can indeed assert that, locally around all points except non hyperbolic equilibria, a differentiable dynamical system "behaves like" a linear one, and this is translated by conjugation via a homeomorphism, although conjugation via a smooth diffeomorphism preserves some more subtle local invariants (resonances, e t c . ) . Coming back to control systems, first of all, the equivalent of conjugation by a smooth change of coordinates is (smooth) feedback equivalence, whose study was initiated in 4 , see a survey in 7 . In fact this is conjugation via a smooth diffeomorphism on the state and control, forced to have a triangular structure (see Proposition 2.5 below). The conditions under which a control system (1.1) is smoothly feedback equivalent to a linear controllable one are well known 8 ' 6 (and contrary to the case of ordinary differential equations, they are very simple), but they imply that very few nonlinear systems are locally feedback equivalent to a linear one, even when the linear approximation is controllable. This remark and the review of the situation for ordinary differential equations naturally brings about the question whether for control systems, relaxing the regularity of the conjugating maps, i.e. considering conjugacy by homeomorphisms instead of smooth diffeomorphisms would make more systems equivalent to a linear one. After recalling some basic facts in section 2, we give in section 3 an essentially negative answer to the question evoked above, based on quoting a result to appear in 3 , that topological conjugacy to a linear controllable system implies conjugacy by "almost" smooth feedback (but the gap is really small). Section 4 recalls, also from 3 , a technical open question that would allow a nicer result and a nicer description of that "almost" smooth conjugacy, and finally section 5 extends the discussion of the results from section 3, their implications, and the questions they raise in nonlinear modeling.
206
2 2.1
Preliminaries on equivalence of control systems Definitions
Consider two smooth control systems with state x (resp. z) and input u (resp. v):
x = f(x,u), x e i " , u e r , 1
z = g{z,v),
1
zeW '
, veW '
(2.1)
,
(2.2)
or, expanded in coordinates, Xi=fi(xi,...
,xn,ui,...
,um),
Zj=gj(zi,...
,zn-,vi,...
,vm<),
1 < i < n, 1 < j < n', with the /j's and g^s some smooth (i.e. C°°) maps. We assume that / and g are defined respectively on the whole of E n x Km and E" x E m because it simplifies many of the statements below; this is actually no loss of generality to us for all the results we prove are local with respect to x,u,z,v, so that / and g can be extended using partitions of unity outside some neighborhoods of the arguments under consideration without affecting the results. Definition 2.1. By a solution of (2.1) that remains in an open set ft C jjn+m ^ we mean a mapping j defined on a real interval : 7
: 7
~* ^
(2 3)
with 7i(t) € E" and 71 (t) £ Rm, such that 7 is measurable, locally bounded, 71 is absolutely continuous and, whenever [Ti,T2] C / , we have : 7i(T 2 ) - 71(^1)
=
/
2
f(li(t), Mt))
dt .
Solutions of (2.2) that remain in Q,' C M" + m are likewise defined to be mappings 7' : / —> ft' having the corresponding properties with respect to g. We now define the notion of conjugacy for control systems. Definition 2.2. Let X :
U
^n> (x,u) i-> x(x,u)
(24) = (xi(x,u),
XTL{X,U))
be a bijective mapping between two open subsets of ffira+m and K™ + m respectively. We say that \ conjugates 7 : 7 — ^ 0 and 7' : I —• ft' if and only if i = x ° 7-
207
We say that \ conjugates systems (2.1) and (2.2) if, for any real interval I, a map 7 : / —> SI is a solution of (2.1) that remains in SI if, and only if, X ° 7 is a solution of (2.2) that remains in SI'. We say that systems (2.1) and (2.2) are locally topologically conjugate at (0,0) if we can chose SI and SI' to be neighborhoods of the origin and x a homeomorphism. We say that they are locally smoothly conjugate if, in addition, x and X"1 are smooth. Here the word smooth means C°°. In case there is no control, so that m = m' = 0 and we omit u and xn, Definition 2.2 coincides with the classical notion of local topological conjugacy for non controlled differential equations, and may serve as a definition in this case too. Let us write more formally the classical local results on ordinary differential equations that we recalled in the introduction : Theorem 2.3 (Flow-box theorem). If m = 0 and /(0) ^ 0, system (2.1) is locally smoothly conjugate at 0 to the linear system z\ = 1, z^ = • • • = zn = 0. Theorem 2.4 (The Grobman-Hartman theorem). If m = 0, /(0) = 0, and /'(0) has no pure imaginary eigenvalue, system (2.1) is locally topologically conjugate at 0 to the linear system z = f'(0)z. Prom now on, we consider control system, i.e. we assume m > 1. 2.2
Some properties of conjugating maps
It turns out that conjugating homeomorphisms preserve the dimension of both the state and the control and must have a triangular structure : Proposition 2.5. With the notations of Definition 2.2, suppose that (2.1) and (2.2) are topologically conjugate via a homeomorphism x '• fi —> fJ'. Then n = n', m = m', and xi depends only on x: X{x,u)
=
( x i ( z ) , Xn(x,u))
.
(2.5)
Moreover, xi : ^R" —>• ^R™ is a homeomorphism. Proof. Let x, u, v! be such that (x, u) and (x, u') belong to fl. Let further x(t) be the solution to (2.1) with a;(0) = x and u(t) = u for t < 0 and u(t) = u' for t > 0. By conjugacy, z(t) = xi{x(t),u(t)) is a solution to (2.2) with v given by v(t) = xn(x(t),u(t)), for t 6 (—e,c) and some e > 0. In particular Xi(x(t),u(t)) is continuous in t so its values at 0 + and 0 - are equal. Hence Xi(x,u) = xi{x,u') so that xi : ^K" -> 0^„< is well defined and continuous. Similarly, ( x - 1 ) j induces a continuous inverse SI' , -» OR». • In view of Proposition 2.5, we will only consider conjugacy between systems having the same number of states and inputs. Hence the distinction between
208
(n,m) and (n',m') from now on disappears. Taking into account the triangular structure of \ m Proposition 2.5, one may describe conjugation as the result of changing coordinates in the statespace (by setting z = xi(x)) a n d feeding the system with a function both of the state and of a new control variable v (by setting u = (x - 1 )n(z,^)), in such a way that the correspondence (x, u) i-> (z,v) is invertible. In the language of control, this is known as a static feedback transformation, and two conjugate systems in the sense of Definition 2.2 would be termed equivalent under static feedback. This notion has received much attention, although only in the differentiable setting (i.e. when the triangular transformation ^ is a diffeomorphism), see e.g. 4 ' 7 . 2.3
Linearization
Recall that / is assumed to be smooth (of class C°°). Let us make a formal definition of topological and smooth linearizability. Definition 2.6. The system (2.1) is said to be locally topologically linearizable at (x, u) € R n + m if it is locally topologically conjugate, in the sense of Definition 2.2, to a linear controllable system z = Az + Bv. Definition 2.7. The system (2.1) is said to be locally smoothly linearizable at (x,u) € R" + m if it is locally smoothly conjugate, in the sense of Definition 2.2, to a linear controllable system z — Az + Bv. Explicit necessary and sufficient conditions for a nonlinear system to be locally smoothly linearizable at a point were given in 8 ' 6 , and also in 9 (the previous two references dealt with control affine systems only), and is recalled in many nonlinear control textbooks. Without mentioning these conditions, let us simply say that they require a certain number of distributions to be involutive, and that this is a very non-generic property. 3
Main result on topological linearization
Let us now give a —basically negative— answer to the natural question raised at the end of section 1 : for control systems, removing the differentiability requirement on the conjugacy does not allow many more control systems to be (topologically) conjugate to a linear controllable system, contrary to the situation of ordinary differential equations (without control), (see section 1 and Theorems 2.3 and 2.4). Recall that / is assumed to be smooth (of class C°°).
Theorem 3.1 ( 3 ). System (2.1) is locally topologically linearizable at (0,0) if, and only if there exists an open neighborhood ft of (0,0) in Rn+m and a
209 homeomorphism
x:
ft
-> fv
_
/ 3 Xx
(a;, w) (->• x(x,u) = ( x i ( z ) , Xn(z,")) (possibly different from the homeomorphism defining topological linearizability of the system) such that 1. x conjugates system (2.1) to a linear controllable system z = Az + Bv, in the sense of Definition 2.2, 2. Xi : H n —> Q'n defines a smooth (C°°) diffeomorphism. This does not state that topological linearizability implies smooth linearizability for x need not be a diffeomorphism even though xi is. In 3 , the conclusion of the theorem is called quasi smooth linearizability. A thorough discussion as well as the proof of Theorem 3.1 is given there. Let us recall here what is necessary to make this theorem clearer. Proposition 3.2. The conclusions of Theorem 3.1 imply that 1. BXTL • 0 -*• Km is smooth,
2. the rank of B is the maximum rank of df/du the origin.
in small neighborhoods of
Proof. Computing z at the origin of a trajectory starting from (x,u) 6 0 implies, by the smoothness of xi, ^-(x)f(x,u)
=
Axi(x) + Bxn(x,u) .
(3.2)
This gives an obviously smooth expression of Bxn- The second point is proved using Corollary 3.5° at points close to the origin where the rank of df/du is maximum, and hence locally constant. • If B is left invertible (i.e. has rank m), the first point implies that xn itself is smooth, and we have the following immediate corollary : Corollary 3.3. If there are points arbitrarily close to (0,0) where the rank of df/du is m (i.e. where this linear map is injective), then x in Theorem 3.1 is a smooth mapping. Of course if B has rank strictly less that m, xn need not be smooth. This is discussed in section 4. " T h e proof of Corollary 3.5 does not use Proposition 3.2.
210
Note that the assumption of Corollary 3.3 is very "reasonable": for instance for single input systems, the only case where it is not met is when / does not depend on u in a neighborhood of (0,0), but then the system cannot be topologically conjugate to a controllable linear system : Corollary 3.4. If m = 1, i.e. if (2.1) is a single input system, then \ »" Theorem 3.1 is a smooth mapping. This is however still not "smooth linearizability" because even though \ is smooth, its inverse might fail to be differentiable at the point of interest. The simplest example is the system x = u3, x e E , i i £ l
,
(3.3)
3
clearly conjugate by (z, v) = \(x, u) = (x, u ) to the linear controllable system z = v. Obviously, x ls smooth, x _ 1 is continuous, xi is the identity smooth diffeomorphism, but the inverse of x itself fails to be differentiable at the origin. In fact, no smooth diffeomorphism can conjugate these two systems. This can easily be proved but is also a consequence of the necessity part of the following result that tells us exactly when smooth linearizability is implied by topological linearizability : Corollary 3.5. When f is of class C°°, system (2.1) is locally smoothly linearizable at (0,0) if and only if it is locally topologically linearizable at (0,0) and the rank of df/du is constant around (0,0). Proof. Smooth linearizability is a particular case of topological linearizability, and it implies constant rank of df/du because differentiability of the smooth diffeomorphism and its inverse allow one to get a formula for df/du(x,u). Let us prove the converse. Suppose that the rank of df/du is r < m in a neighborhood of (0,0) and that system (2.1) is locally topologically linearizable at (0,0). From Theorem 3.1, this implies that there exists a triangular homeomorphism (x,u) >-)• (z,v) = x(x,u) = (xi(x),xn(x,u)) that conjugates system (2.1) to a linear controllable system z = Az + Bv with the additional property that xi defines a smooth diffeomorphism from a neighborhood of 0 € M™ onto its image. Let r' < m be the rank of the matrix B. There are invertible n x n and m x m matrices P and Q such that ' Ir, Bc
= PBQ
=
(3.4) 0
V where Iri is the r' x r' identity matrix.
o\ 0
211
Computing z at the origin of a trajectory starting from (x, u) £ Q implies (3.2) by the smoothness of xi- Hence the map BcQ~xXi is smooth where it is denned, and differentiating (3.2) with respect to u yields :
Since P^-(x) is invertible and the rank of df/du is r, both sides have constant rank r. This implies r < r'. This also implies that the mapping Rn+m _j. K n+ r ' defined by (x,u)
H->
(x,
BCQ~1XTL{X,U))
,
has a constant rank n + r i n a neighborhood of the origin, hence, by the constant rank theorem applied to this mapping, there i s a r x m matrix K of rank r (selects r lines that are independent among the m lines of (x,u)), 9u n+m r a neighborhood ft of (0,0) in R , two smooth mappings a : K"+ -> Rn+m and ft : Rn+m -> Mr ~ r (in fact they only need to be defined in suitable neighborhoods of the origin) such that x is defined on fi, and BcQ~lU-,u)
=
(«(*,Jrfleg-ix.(z,«))J
(3.5)
for all (a;, u) £ fi and (x,u)
*-> ( a r . J f B c Q ^ x i t a r . u J . ^ i . u ) ) ,
(3.6)
defines a smooth diffeomorphism from ft onto its image. This implies that r = r' because from (3.5, r < r' would prevent x from being one-to-one. Hence K can be taken the identity matrix. Define x : fi -* IR"+m by \ — L ° V' with ^(x,w)
(Fxi(a;), i f 5 c Q _ 1 x n ( 3 ; , u ) ,
=
1
0(x,u))
1
and L(z,v) = (P~ z,Q~ v). ijj is a smooth diffeomorphism because (3.6) is one, and L is obviously a (linear) smooth diffeomorphism. Setting (z, v) — x(x, u) conjugates system (2.1) to z = Az + Bv. D 4
A n open question
It is a reasonable question to ask whether the conclusion of Corollary 3.3 holds in general, namely whether Theorem 3.1 can be strengthened so as to state that x is, on top of its other properties, a smooth mapping (when the rank of df/du is not locally constant, x would fail to be be differentiable, from the necessity part of Corollary 3.5).
212
Let us examine the case where the assumptions of Corollaries 3.3, 3.4 and 3.5 fail (these three corollaries already state the desired conclusion), namely the case of systems with m < 2 controls where the rank of df/du is everywhere strictly smaller than m, studied locally around a point where this rank is not constant (i.e. the rank at the point is strictly less than the maximum rank in arbitrary small neighborhoods of this point, itself strictly smaller than m. The smallest dimensions where this occurs is n = 1, m = 2, i.e. systems x = f(x,ui,U2) with x, ui and u2 scalar. In order to state our open question in the smallest dimension possible, let us drop the dependence on the righthand side on x and consider systems x = a(ui,u2),
i £ l , u = (tti,u 2 ) £ E 2 ,
(4.1)
2
where a : E -» E is smooth. Let us assume that this system is locally topologically linearizable around (x,u) — (0,0,0). The only canonical controllable linear system with one state z € IK and two controls (v\,v2) 6 E 2 is z = vi, hence local topological linearizability means existence of a homeomorphism X : (x,u1,u2)
>-• (z,v1,v2)
= (Xi(x),
\2(x,ui,u2), an
ls
X3(x,ui,u2))
(4.2)
tnat
(in the terms of Definition 2.6, xi is xi d Xi (X2,X3)) conjugates (4.1) to the linear system z — v\. From Theorem 3.1, this implies existence of another homeomorphism x of the same triangular form, that we denote by X instead of x, such that xi is a smooth diffeomorphism (from a real interval containing zero onto an open interval) and X2 is a smooth mapping from an open neighborhood of the origin in E 3 to E, while our results do not grant that X3 has any more regularity than continuity. In fact the conjugation reads dxi -jr— (x)a(ui,u2) - X2(x,ui,u2). (4.3) This implies in particular that X2 does not depend on x, and then one can replace v2 = X3(^7^1,1*2) with v2 = X 3 ( 0 J M I > U 2 ) without changing the conjugating property. Composing x given by (4.2) with (z,Vi,v2) H* (XI _ 1 iz), i l r (Xi_1 (•z)) _1 ^i. v2), one finally gets a conjugating homeomorphism of the form (x,u1:u2)
H-» (x, a(ui,u2),
P(ui,u2))
(4.4)
where f3(u\,u2) = X3(0,ui,U2)- Hence local topological linearizability amounts to existence of a continuous mapping /? from an open neighborhood of the origin in E 2 to E such that (u\,u2) i-> (a(ui,u2),/3(ui,u2)) defines a homeomorphism from a neighborhood of the origin in E 2 onto its image (we just proved it is necessary, but conversely, it makes (4.4) a local homeomorphism, that obviously conjugates (4.1) to z = vi). Similarly, conjugacy via
213
a homeomorphism that is a smooth map amounts to existence of a smooth mapping having the same property. Hence the question whether \ c a n D e taken a smooth mapping in Theorem 3.1 reduces to the following Open Question 4.1. Let a and /3 be two mappings ] — e,e[2 —> E, e > 0, such that a is smooth, j3 is continuous, and (111,112) *-> {a(ui,U2),fi(ui,U2)) defines a homeomorphism from ] — e,e[2 onto its image. Does there exist a smooth mapping b :] - £',e'[2-t R, 0 < e' < e, such that (1^,1*2) >-> (a(ui,U2),b(ui,ii2)) defines a homeomorphism from]—e' ,e'[2 onto its image ? This question in differential topology can be posed in higher dimension of course, see below. It is of interest in its own right and seems to have no answer so far, even for p — q = 1. Open Question 4.2. Let O be a neighborhood of the origin in W+q and F : O —»• W a smooth map. Suppose there is a continuous map G : O —• K? such that F x G : O —>• Rp x l ' is a local homeomorphism at 0. Does there exist another neighborhood of the origin O' C O and a smooth mapping H : O' ->• W such that F x H : O' ->• E p x W is again a local homeomorphism atO? 5
Implications in Control Theory
Let us come back to the discussion we started in the Introduction. Consider a control system (1.1), assume for simplicity that we work around an equilibrium, i.e. /(0,0) = 0, and let us write its linear approximation, i.e. f(x,u)
= Ax + Bu + F(x,u) dF dF with F(0,0) = — (0,0) = — (0,0) = 0 ,
(5.1) (5.2)
so that the nonlinear system (1.1) reads x
= Ax + Bu + F(x,u)
.
(5.3)
From the remarks made in the introduction, the relevant situation is the one where the linear system i
=
Az + Bv
(5.4)
is controllable. Let us assume slightly more to stay away from the pathologies evoked in the previous section. The additional assumption is very mild and is, for instance, always true when the constant n x m matrix B has rank m; it is implied by linear controllability for single input systems. Assumption 1. The pair {A,B) is controllable and the rank of B + dF — (x,u) is equal to the rank of B for small (x,u).
214
The question raised in the introduction was the one of finding a reasonable equivalence relation that would make the two systems (5.3) and (5.4) locally equivalent. Comparing the situation of ordinary differential equations (without control), a candidate was local topological conjugacy as in Definitions 2.2 and 2.6, and if that candidate was successful, we would have a result making precise the vague statement (1.2). Corollary 3.5 implies that, for A, B and F satisfying Assumption 1, systems (5.3) and (5.4) are locally topologically conjugate if and only if they are locally smoothly conjugate, and it is known from 8-6 that this is false for a generic F, even satisfying (5.2). This discards topological conjugacy as a candidate for the above mentioned equivalence relation, but this does not contradict the basic belief behind statement (1.2). A way to contradict that statement would be to find at least one example satisfying the assumption, but where the nonlinear system (5.3) displays some local "qualitative" phenomenon that do not occur for the linear system (5.4). In the qualitative theory of dynamical systems (without control), the phase portrait gives a picture of the behavior, on which phenomena like attractors, invariant set, (stable) closed orbits can just be "seen". A control system is more complex : it describes how the behavior of the state (at least in the state space representation) is linked to the control. It is not very clear what a qualitative phenomenon should be for a control system. The least to require is that it be invariant by topological conjugacy as defined here. In the introduction, we pointed out that (non-)controllability is a qualitative property, but it is of no help here since (1.2) only refers to controllable systems. We do believe that clarifying the status of a statement like (1.2) is very relevant to control theory and modeling. Our negative results (section 3) say that topological conjugacy is not the right tool to answer this. A looser equivalence could be a way to state (1.2) properly. It could also be that the intuition behind (1.2) is totally wrong and that some nonlinearities F allow system (5.3) to display some qualitative phenomena locally that cannot occur on a linear system (5.4).
Acknowledgements The authors wish to thank Prof. I. Kupka, from Universite Pierre et Marie Curie (Paris VI) for many enriching discussions. Thanks are also due to Prof. C.T.C. Wall from the University of Liverpool for his comments on the "Open Question 4.2" in section 4.
215
References 1. V. I. Arnold, Equations Differentielles Ordinaires, 3 ed. (MIR, 1974). 2. V. I. Arnold, Chapitres supplementaires de la theorie des equations differentielles ordinaires (MIR, 1980). 3. L. Baratchart, M. Chyba, and J.-B. Pomet, On the Grobman-Hartman theorem for control systems, in preparation. 4. R. W. Brockett, Feedback invariants for nonlinear systems, IFAC World Congress (Helsinki), 1115-1120 (1978). 5. P. Hartman, Ordinary differential equations, 2 ed., (Birkhauser, 1982). 6. L. R. Hunt, R. Su, and G. Meyer, Design for multi-input nonlinear systems, in Differential Geometric Control Theory, R.W. Brockett, Ed., 258298, (Birkhauser, 1983). 7. B. Jakubczyk, Equivalence and invariants of nonlinear control systems, in Nonlinear Controllability and Optimal Control, Hector J. Sussmann, Ed., (Marcel Dekker, New-York, 1990). 8. B. Jakubczyk and W. Respondek, On linearization of control systems, Bull. Acad. Polonaise Sci. Ser. Set. Math., 28, 517-522 (1980). 9. A. J. van der Schaft, Linearization and input-output decoupling for general nonlinear systems., Syst. & Control Lett., 5, 27-33 (1984).
This page is intentionally left blank
217
LOCAL A P P R O X I M A T I O N OF T H E R E A C H A B L E SET OF CONTROL PROCESSES ROSA MARIA BIANCHINI Department of Mathematics U. Dini, University of Florence, Viale Morgagni 67/A, 50134 Firenze, Italy E-mail: bianchiniQmath. unifi. it This paper concerns the variational approach to the study of controls problems. We construct local approximations of the reachable set from which sufficient conditions for a trajectory to be locally controllable and necessary conditions for a reference pair to be a weak solution of a Mayer control problem with end constraints can be derived.
1
Introduction
The knowledge of the geometry of the reachable set can help greatly in several control problems. In particular what is really useful is to find conditions which the boundary points have to fulfill. For example a reference trajectory is locally controllable if its final point is not a boundary point, which surely happens if the point does not satisfies the necessary conditions. An other example is given by Mayer optimization problems without constraints on the final point: under standard hypothesis, if a reference trajectory solves the optimization problem then its final point is a boundary point of the reachable set and hence has to satisfies the necessary conditions. This is the basis of Pontriagin Maximum Principle and of its generalizations 1, 2 etc. Since it is difficult to compute directly the reachable set, one tries to approximate it near a point x by means of tangent vectors, objects which can be computed easier. But the collection of tangent vectors provides a good approximation of the set only in the case in which the boundary is sufficiently regular; for an example it works if the set is locally convex. Unfortunately the boundary of the reachable set may be irregular even in the analytic case, see 1. This has been the starting point for searching subsets of tangent vectors which could provide the informations one needs in concrete problems, see 3 , 1 and the references therein. In this paper I will start with reviewing some local approximations of the reachable set of a control process pointing out their relations with the study of some control problems. Later I will construct a local approximation of the reachable set of an affine control process near the final point of the trajectory
218
relative to the drift term; this local approximation can be used to test either the local controllability of the trajectory or its optimality respect to a Mayer control problem with constraints on the end points. In the last section I will show by means of some examples how the theory can be applied. The natural setting for this variational approach, is the one of differential geometry; the control process are family of differential equation on a differential manifold, M, finite dimensional, sufficiently regular and the tangent vectors at y is an element of the tangent space of M at y. However for simplicity sake I am going to examine the particular case in which the manifold is an Euclidean space. 2
Tangent cones
Let us consider a control process x = f(t,x,u)
u(-)EU
(2.1)
where the state x belongs to M" , the function / and the set of admissible control U are such that the following standard assumption is verified A) for each admissible control u(-) e U the Cauchy problem (x =
f(t,x,u(t))
\ X(t0) = X0
has an unique maximal solution whatever is the initial condition. We will denote by S(t,to,x0,u) the value at time t of the solution of (2.1) relative to the control u which at time to takes the value xo and by R(t, to, xo) the reachable set at time t from the initial conditions (to,£o) R(t,t0,x0)
= | S(t,t0,x0,u)
:
ueU>.
We are interested in the following problems: LC Local controllability of a trajectory, x* : t -» [£o>£i], i-e. x*(ti) € m«i?(ti,t 0 ,'a;*(
Vt > 0.
Mayer optimization problem, i.e. locally minimize the value of a C 1 functional, /o, over the set R(ti,t0,x0).
219 COP
Mayer optimization problem with constraints on the final point, i.e. locally minimize the value of a C 1 functional, /o, over the intersection of the set R(ti,t0,x0) with a given subset C.
A possible approach to these problems is to derive either necessary or sufficient conditions from a local approximation of the reachable set at the final point of the trajectory 1 4 5 6 7 . The local approximations used in the quoted papers are suitable subsets of the intermediate tangent cone, a subset of the contingent tangent cone; the difference among these papers depends on the subsets considered. I want to make some comments about this approach and I want to state the results I am going to use in the next paragraph. Let us start with the definition of the intermediate tangent cone to a subset of an eucleadian vector space, 8 : Definition 2.1. Let K be a subset of Mn and let y E K. The itermediate, or adjacent, tangent cone to K at y, IK{V) , is the set of vectors tangent at y to the curves contained in K passing from y IK(V) = [v
: y + ev + o(e) £K
ee[0,e]|.
The vectors belonging to IK{V) are named tangent vectors to K at y. For studying the LC property, the intermediate tangent cone to the reachable set at the final point of the trajectory is a too large set because it can be the whole space even if the property does not hold, see the example in x. However one can derive sufficient conditions for this property to hold by considering only subsets, H, of lR(tltt0,x0)(x*(Ti)) chosen in such a way that the following property holds: A) if the set H contains a positive basis of tangent vectors, then the point is an interior point of the reachable set. I recall that a set of vectors is positive basis of W1 if 0 belongs to the interior of convex hull of the set. Notice that condition A) could be replaced by the weaker condition: A ' ) if the set H is the whole space, then the point is an interior point of the reachable set. however property A) is more useful in the applications. Let us consider the optimal problems. The first thing to notice concerning these problems, is that the set /fi(t1,t0,a:o)(2/) is constructed by means of the points close to y which can be reached from (t0,x0) at time t\ independetly from the trajectories by means of which this can be done, meanwhile in the
220
definition of the O P and of C O P problems, locally has to be understood in the sense of the calculus of variations, i.e. either strong or weak solutions of the problem. Let me state the definitions of strong and of weak solutions which I am going to use. An admissible pair of a control process in a given interval [to,*i], is a couple (x* ,u*), x* solution relative to u* on [to>*i] • Definition 2.2. A pair (x*,u*) is a strong solutions of O P if the final point of the reference trajectory, x*(ti), is a point of minimum of the functional /o on the set of points reachable from the initial point by means of a trajectory which are near the trajectory x* in the C°([£o;*i]] topology. Weak solution of O P may be defined if it is given a topology on the set of control with respect to which the solution map is continuous. In the sequel we will assume that such a topology, II, is a data of the problem. Definition 2.3. A reference pair (x*,u*) is a weak solutions of O P if the final point of the reference trajectory, x*(ti), is a point of minimum of the functional /o on the set of points reachable from the initial point by means of pairs (x, u) belonging to a neighborhood of the reference pair in the C°([to, ti]) x U topology. For taking in account this fact, only particular tangent vectors to R(ti,to, XQ>) at x*(ti) have been considered; roughly speaking we look for the tangent vectors to the curves obtained by slightly modifying the control u*. Tangent vectors of this type are the ones introduced by A. Bressan 5 for the affine systems. I will name these tangent vectors, weak trajectory variations because they depend on the reference pair considered, not only on the final point of the trajectory. The definition of the weak trajectory variations for affine system is the following Definition 2.4. Let t \-t x*{t) be a solution of the C1 control process m
X = fo(x) + Y2Uifi(X) on the interval [to,ti] relative to the control u*. A vector v is a weak trajectory variation of (x*,y*) if there exist a family of admissible control maps, u(e) , e G [0,e] continuous in the L1 topology, such that 1. l i m ^ 0 + / £ \\u{e){s) - u*(s)\\ ds = 0 2. 5(*i,i0,a;*(*o),M(e)) = x*{tx) + ev + o(e). Notice that since the solution map of an affine control process depends continuously from the control in the L1 topology, from property 1 it follows that lime_+0+ \\S(-,t0,x*(t0),u(s)) -x*(-)))\\ = 0 in the C° norm, and hence
221
the weak trajectory variations are tangent vectors at x*(*i) to the set of points which can be reached from (to,xo) by means of trajectories which lay near the reference one. The definition of weak trajectory variations can be generalized to any control process if there exists a topology on the set of controls with respect to which the solution map restricted to a compact interval is continuous. If (x*,u*) is a weak solution of the O P problem, then Dfo{x*{h))v
>0
Vu weak variation of {x*, u*).
(2.2)
This implies that if we find a positive basis whose elements are weak trajectory variations of (x*,u*), then (x*,u*) is not a weak solution of O P . An example provides by A. Bressan in 5 proves that if there are constraints on the final point, then condition (2.2) is no longer a necessary condition for (x*,u*) to be a weak minimum. In fact in that example the reference pair is given by x*(t) = 0, t € [0,3], u* = 0; the reachable set from the origin at time 3 is i?(3,0,0) = { ( x , 2 / , 2 ) e K 3
:
xy>0}
the set of weak trajectory variations of (x*,u*) contains a positive basis, but if C = {x — —y, z = 0 } then (x*,u*) is a weak minimum of C O P independetly from the cost / 0 . The condition which a weak solution of C O P has to fulfill is £>/o(x*(ti))w>0
(2-3)
for each weak trajectory variation w , which belongs to the intermediate tangent cone of the intersection of the reachable set with the set of constraints, C. The intermediate tangent cone to the intersection of two sets does not coincide with the intersection of the tangent cones of the sets considered. This implies that (2.3) holds only for the vectors belonging to a collection of trajectory variations, H, which have the following property 1,3: B) if the convex closure of the set H cannot be separated from a convex cone V, and if coH and V are not two complementary subspaces, then the set V n co H contains at least one half line. The previous arguments lead to search for subsets of weak trajectory variations which have either property A) or property B ) . Bressan, in the quoted paper, has single out subsets of weak trajectory variations which have both the properties. A point to underline about this result, is that these subsets are particular collections of weak trajectory variations and they are not a collection of particular weak trajectory variations.
222
Other authors have chosen a different way to select weak trajectory variations with the required properties. They introduce a more restrictive definition of trajectory variations, 6 , 7 , 9 ecc, the needle-like variations. We will assume that it is given a topology on the set of controls with respect to which the solution map is continuous and continuously differentiable with respect to the initial state. This hypothesis is not necessary for introducing the needle-like variations, but it let the definition simpler. For conditions which insure that this hypothesis is fulfilled see 10 . Definition 2.5. Let (x*,u*) be a reference pair on the interval [to,ti] and let T € [io^i] • A vector v is a needle-like trajectory variation of x* at r if for each e £ [0,e] there exists an admissible control map u(e) with the following properties: 1. e >-> u(e) is continuous 2. u(e) coincides with the reference control outside the interval, [a(e),b(e)\ 3. lime_^0+ He) = lime_>0+ a(e) = r 4. S(ti,to,x*{to)),u(e))=x*(ti)
+ ev + o(e).
More general needle-like variations can be denned. I have chosen this definition because it is rather simple but sufficiently general to illustrate the main properties of this type of variations. The needle-like variations at r indicates the controllable directions of the reference trajectory from X*(T) . Notice that, if the values of the control u(e) are uniformly bounded, then from 3 it follows that u(e) tends to u* in any Lv norm, therefore for a large class of control processes 10 the needle-like variations are weak trajectory variations. It is an open question if the set of needle-like variations has property A)or property B)but both the properties has been proved for some subsets of them. It is known that any collection of needle-like variations each occurring at a time different from all the others has the properties we are speaking about. This implies that also any set of the needle-like variations which are limit point of sequence of variations each occurring at a different time, have the properties A)and B ) , see 6 , 7 . We will call this type of variations, K-variations. More precisely the definition of K-variation at time r is the following: Definition 2.6. A vector v is a K-variation atr if there exists a non stationary sequence {r„} converging to r and for each r n a needle-like variation, vn at rn, such that {vn} converges to v. The K-variations depends on the behavior of the control process along an arc of trajectory. In 4 G. Stefani and myself have single out a subsets of needle-
223
like trajectory variations which are of local nature and which have property A and property B. In the next section I am going to use these variations in a simplified version which can be found in u . Let us start with the definition of good variations. Definition 2.7. A vector v is a right good-variation, (left good-variation) of the pair (x*,u*) at r if there exists positive numbers k,c,e and for each e € [0, e] a family of admissible control maps, ue (c), c € [0, c] with the following properties: 1. we(c) coincides with the reference control outside the interval [r + e ,T + (1 + a)ek] 2. for each e, c H-> ue(c) is continuous 3. S(T+(a+l)ek,
r+ek,
(S(r-ek, r-{a+l)ek, uniformly w.r.t. c.
x*(r+ek),
ue(c)) = x*(T + {a+l)ek) + cev + o(e)
x*(T-(a+l)ek),
us(c)) = x*{T~ek)+cev+o(t)
)
The good variations will be simpler named g-variations. Let G(t, T) denote the transport along the flow generated by the reference control from x*(r) to x*(t); G(t,r) is the evolution matrix of the linearization along the reference trajectory. If v is a g-variation at r, then G(ti,r)v is a needle-like variation at r. Definition 2.8. The varational cone of the reference pair (x*,u*), /C, is given by /C = co< G(ti,r)v
,
v g-variation at
T\
It n it is proved that K, has both the properties A)and B)and that, under mild hypothesis, it contains the set of K-variations. Properties A)and B)imply the following theorems: Theorem 2.9. Let x* be a trajectory relative to the control u* defined in the interval [^o^i] • If the set of g-variations of (x*,u*) at to contains a positive basis of the state space, then the trajectory is STLC. / / the variational cone coincides with all the tangent space at x*{t{), then the trajectory x* is LC in the interval [to,ti]. I want to remark that it can be proved that if the variational cone is the whole space, then the trajectory x* is LC also in the interval [£o, *i — e], for e sufficiently small. This last property imply, for a large class of control process, that if x* is time optimal in this interval, then its variational cone cannot be the whole tangent space.
224
Theorem 2.10. Let {x*,u*) be a weak solution of COP and let N be the Dubovitskij-Miljutin tangent conea 8 of the constraints set C at x* (t\). Under these hypothesis there exists Ao < 0 and a linear functional v at least one of which different from zero, such that vw>0, (XoDfoix*^))
s
+ V) y < 0
Vw<EN
(2.4)
Vy e K
(2.5)
Prom the previous theorem one can derive high order Maximum Principle. Let me give an example of this type of results. I recall that if the control process is C 1 and if the values of the controls are bounded, then the "right" topology for the set of controls is the Lp([t0,ti]) one. This implies that the Pontriagin variations are g-variations. From Theorem 2.10 it follows: Theorem 2.11. Let
x = f(t,x,u)
u € {/
be a C1 control process and let U be a bounded set. If (x*,u*) is a weak solution of COP and if Dfo(x*(ti)) ^ 0, then there exist a non trivial solution X(t) of the adjoint equation
X=
-Xfx(t,x*(t),u*(t))
such that X(ti) = AoD fo(x* (ti)) + v X(t) v < 0
Ao
and
v
as in Theorem 2.10 W, g-variationat T
and
X(t)f(t,x*(t),u*(t))
=maxX(t)f(t,x*(t),u)
a.e. t£
[t0,ti].
Notice that a strong solution of a COP is also a weak one therefore the previous theorem is also a necessary condition for the pair be a strong solution. a
t h e vector v belongs to this tangent cone if for all s sufficiently small I * ( ( I ) + £ » G C
225
3
Examples of g-variations
In this section I am going to consider a single input, C°°, affine control process (£)
x = f{x) +ug(x)
|u| < S
(3.1)
the admissible controls are the locally integrable maps satisfying the constraints ||u(i)|| < S endowed with the L\oc topology. In the following the reference pair will be (x*,0) with x* : [0,T] -> W1 , t !->• exp t / o O , i.e. the reference trajectory is the one relative to the drift term of the process and the reference control is the null one. g-variations of this pair have been constructed by means of the "neutralization of the obstructions". To recall this result I need to introduce some notations. Let LieX denote the free algebra generated by two indeterminate .Xo, X\; if Z,Y £ LieX, [Z,Y] denotes the Lie bracket of Z and Y and adkzY is defined inductively by ad°zY = Y,
ad%+1Y = [Z, adzY].
Let A € UeX; |A|j is the number of times that Xi appears in A. Definition 3.1. Sussmann 12, Bianchini-Stefani 13 The bad brackets are the brackets in Lie X which contain XQ an odd number of times and X\ an even number of times. Let B be the set of bad brackets B = {A , |Ajo is odd |A|i is even }. The set of the obstructions is the set B* = Lie (X0, B) \ {aX0 , a G R}. The name of obstructions come from the fact that if all these brackets are equal to zero at the initial point of the reference trajectory, then the trajectory is STLC and hence the final point of the reference trajectory is an interior point of the reachable set. The same result holds if the obstructions which are different from 0, are neutralized by means of a "weight". Definition 3.2. An admissible weiaht for the process (3.1) is a couple of non negative numbers, I— (lo, l\), which verify the relations 0 < lo < l\ . Definition 3.3. Let 1 = {lo,h} be an admissible weight, the \-weight of a bracket $ is given by ||*||i = 'o|*|o + *i|*|iAn element 0 £ Lie X is said l-homogeneous if it is linear combination of brackets with the same \-weight, which we name the l-weight of the element.
226
The weight of a bracket, $ , with respect to the standard weight 1 = {1,1} coincides with its length and it is denoted by | | $ | | . Let 0 6 Lie X; with 0 s we denote the element in the Lie algebra generated by the vector fields / , g obtained from 0 substituting to XQ the vector field / and to Xi the vector field g. Definition 3.4. Let 0 € Lie X; following Sussmann 12 we say that 0 is ly.-neutralized at a point y if the value at y of 0 s is linear combination of the values of brackets with less l-weight, i.e. &T,(y) — 5Z ai ^s(2/) > 11 ^ J 111 <
lieili. The result in 4 states that the directions individuate by evaluating at r those elements of the Lie algebra associated to the system with the property that each obstruction which has less or equal l-weight is ls-neutralized at r , is a g-variation at r. Theorem 3.5. Letr € [0, T] and let A € LieX ; if there exists an admissible weight 1 such that each obstruction whose l-weight is less than or equal to \\A\\\ is ly.-neutralized at X*(T) then ±As(a;*(r)) are g-variations at r . This theorem implies that to each admissible weight 1 and to each time r we can associate a subspace of g-variations at r, the subspace spanned by AY,(X*(T)), A 1-homogeneous element whose weight is not greater than a positive number, p(l, r ) . In 14 it is proved that if the neutralization of the obstructions holds on an arc of trajectory containing x* ( r ) , then the set of g-variations which can be associated to 1 and r, is a larger set since to the subspace described above one can add an other g-variation whose direction is given by obstructions; this further variation, v, is of unilateral type, i.e. —v may be not a g-variation. Notice that variations of unilateral type are very important in optimization theory since they distinguish between minimization and maximization problems. I refer to 14 for the statement of the general result because it is very technical; I limit myself to quote two results which can be deduced from it. Further investigation are necessary to derive from the general result other explicit computable g-variations. Proposition 3.6. Let 1 be an admissible weight such that each obstruction whose l-weight is less than (2kli + lo) is Is -neutralized on an arc of trajectory containing x* ( r ) , then
(adlkf)(x*(t)) is a g-variation at T . Let me remark that since whatever is 1 there are no obstruction of weight
227
less than (2Zi + lo), then (ad2g)f(x*(t)) is a g-variation at each t £ [0, T]. Proposition 3.7. If there exists an admissible weight 1 such that each bad bracket of l-weight less than (2n + l)Zo + 2Zi is l-neutralized on an arc containing x* (T) , then (-ir+i[g,adf+'g](x*(T)) is a g-variation at T. The Legendre-Clebsch condition can be deduced from the previous proposition. In fact the neutralization by means of the weight 1 = (0,1) is given by brackets which contain a less number of g so that the following proposition holds. Proposition 3.8. Let Li(x*{t)) = span {Ax(x*(t)) : ||A||i = 1} and let p be an integer with the property that for each t in a non degenerate interval, J, contained in [0, T] ; [5,[a4,5]](x*(i))€Li(x*(t))
:t = l,...,p-l
for each t E J. If \g, [adpp] {x*(t)) $ Li(x*(t)), and
(3.2)
then p is an odd integer
(-l)ip+1)/2[g,[^f,g)]{x*(t)) is a g-variation at t for each t £ J. Remark 3.9. It can be proved u that the neutralization on an arc of trajectory implies that the integer p has the property that if A 6 Lie X contains two Xi and i times Xo, i < p, then A, is Is -neutralized on the interval. In Propositions 3.6 and 3.7 it is required the neutralizations of some obstructions on an arc of the reference trajectory, meanwhile in Theorem 3.5 only the neutralization in one point of the trajectory is required. I don't know if the neutralization in only one point by means of any admissible weight is sufficient for constructing unilateral g-variations, but in a forthcoming paper I am going to prove that, if the neutralization is done by means of the weight (0,1), then to the subspace of g-variations given by Theorem 3.5, one can add an unilateral g-variation. The analogous of Proposition 3.6 is Theorem 3.10. If r 6 [0,T] and each obstructions which contains (2p— 2) times g is neutralized at x* (T) by means of brackets which either contain a less number of g or contain an equal number of g but a less number of f, then
(adff){x*{T))
228
is a g-variation at r . Up to now it is not clear what is the analogous of Proposition 3.7. 4
Applications
In this section I want to show how the theory developed in the previous sections can be applied. Let me start with a L C problem. We want to know if there exists T > 0 such that the stationary trajectory x* (t) = 0 of the system ' i\ = u X2=X! X3 = X4
^ X4 = -X3 + x\ \u\ < 1, is locally controllable in the interval [0, T]. Let us calculate the variational cone of the pair (x*, 0) in the interval [0, T]. Since the trajectory is a stationary one any neutralization holds on the whole trajectory and the only obstructions which have to be neutralized are the bad brackets, 13 . The only bad brachets non vanishing at 0 contain two g and three / ; they cannot be neutralized by any weight, g = d/dxi and [f>d] = —d/dx2 have less 1-weight of these bracketts whatever is the weight 1, therefore the subspace span{ei, e 2 } is a subspace of g-variations at each time; [/,g], [[f,g],f]\x*(t) ^ 0 implies that the number p of Proposition 3.7 is equal to 3; therefore v = 9J [/>[/>[/>d]]] \x*(t) = 2d/8x4 is an unilateral g-variation at each r. It can be proved that the trajectory cannot be STLC; however if T > TT then the conic convex hull of the set
U
GT T
(>>
T€[0,T]
is the subspace spanned by {e 3 , e^] . Therefore if T > ix, then the variational cone is equal to M4 . We can conclude that the trajectory is locally controllable in any interval larger than IT. Let me notice that we cannot a priori exclude that the trajectory is locally controllable in a shorter interval of time, but it is really probably that it is not.
229
Let us examine now an application to an optimization problem with constraints on the end point. Consider the following C O P : minimize the functional fo(xi,X2,x3,X4,x5,X6) = -x5 + x\ over the set of points reachable in time 1 by means of the trajectories of the control process ±1 = 1 X2 = U X3 = X4
xh XQ
X2
Xz Xo
Xn
X^ -p X3
—
starting at 0 and satisfying the constraint x5+x6
(4.1)
= 0.
Let us calculate the variational cone of the pair (x*(t) = 0, u*(t) = 0) in the interval [0,1]. The obstructions which do not vanishing along the trajectory contain two g and at least three / , therefore span < e%, e3, a \ , the subspace spanned by brackets which contains only one g and at most 2 / , is a subspace of g-variations at any t € [0,1]. The obstruction adj. -,f(x*(t)) is proportional to the bracket adzgf{x*{t)); therefore each obstructios which contain two g and at most four / is 1-neutralized along the trajectory by means of the weight (1,1), 14 . By Proposition 3.7, ±ad3gf{x*(t)) = ±6d/dx5, -[g,[ad5fg\] = —2d/dxe are variations at any t. The linearization of the process along the reference pair is given by: 2/1=0 2/2 = 0 2/3 = 2 / 2 2/4 = 2 / 3
2/5 = 0 2/6=0 therefore the variational cone of the reference pair is the half-space: { x$ < 0} . If the reference pair is a weak solution of C O P , then by Proposition 3.7 there exist y € C1- and A < 0 such that (AV/ 0 (a;*(l)) + 2/, v) < 0 T
(4.2)
v G /C. T
Since Vf0(x*(h)) = (0,0,0,0, - 1 , 0 ) and y = ( 0 , 0 , 0 , 0 , a , a ) , for (4.2) to hold there exists a number a > 0 and a number A < 0 such that the vector (0, 0, 0, 0, - A + a, a)T
230
is orthogonal to span {e 2 , e%, e\, e 5 }. Since this is impossible, the reference pair is not a weak solution of the problem. 5
Open problems
The main open problem of this theory is the following: is it necessary to limit ourselves to consider only very particular tangent vectors to the reachable set for the variational approach either of COP or of LC problem? Taking in account what is known, I suggest to investigate to these specific points: 1. The weak trajectory variations has not the property A)and hence cannot have the property B)). Does any its convex subset has property B)? Is it true that if the set of weak trajectory variations is the whole tangent space, then the trajectory is LC? 2. Is the set of needle-like variations at a given time a convex set? 3. Have any convex subset of needle-like variations property A) and/or property B)? References 1. Bianchini, R.M. , Variational Approach to some Optimization Control Problems, in Geometry in Nonlinear Control and Differential Inclusions, Banach Center Publication, Warszawa, 32, 83- 94 (1995). 2. Mirica, S., New proof and some generalizations of the minimum principle in optimal control J. Optim.Theory Appl., 74, 487-508 (1992). 3. Mirica, S., Intersection Properties of Tangent Cones and Generalized Multipler rules, Optimization, 46, 135-163 (1999). 4. Bianchini, R.M., and Stefani, G., Controllability along a Reference Trajectory: a Variational Approach, SIAM Journal on Control and Optimization, 3 1 , 900-927 (1993). 5. Bressan, A., A high order test for optimality of bang-bang controls, SIAM Journal on Control and Optimization, 23, 38-48 (1985). 6. Krener, A. , The High Order Maximal Principle and its Applications