Instabilities in the SunJupiterAsteroid Three Body Problem


 Colin Gilmore
 1 years ago
 Views:
Transcription
1 Noname manuscript No. (will be inserted by the editor) Instabilities in the SunJupiterAsteroid Three Body Problem John C. Urschel Joseph R. Galante Received: date / Accepted: date Abstract We consider dynamics of a SunJupiterAsteroid system, and, under some simplifying assumptions, show the existence of instabilities in the motions of an asteroid. In particular, we show that an asteroid whose initial orbit is far from that of the orbit of Mars can be gradually perturbed into one that crosses Mars orbit. Properly formulated, the motions of the asteroid can be described as a Hamiltonian system with two degrees of freedom, with the dynamics restricted to a large open region of the phase space reduced to an exact area preserving map. Instabilities arise in regions where the map has no invariant curves. The method of MacKay and Percival is used to explicitly rule out the existence of these curves, and results of Mather abstractly guarantee the existence of diffusing orbits. We emphasize that finding such diffusing orbits numerically is quite difficult, and is outside the scope of this paper. Keywords Hamiltonian Systems Restricted Problems Instabilities Asteroid Belt 1 Introduction We consider the restricted circular planar three body problem (RCP3BP) with two massive primaries, which we call the Sun and Jupiter, that perform uniform John C. Urschel Department of Mathematics, Penn State University University Park, State College, PA Tel.: Fax: Joseph Galante Unaffiliated, formerly Department of Mathematics, University of Maryland
2 2 John C. Urschel, Joseph R. Galante circular motion about their center of mass. The system is normalized to mass one so the Sun has mass 1 µ and Jupiter mass µ. We further normalize so that Jupiter rotates with unit speed, resulting in a period of 2π for the primaries. The distance from the Sun to Jupiter is constant and also normalized to one. Our goal is to understand the behavior of the massless asteroid, whose position in polar coordinates is denoted by (r, ψ). It is convenient to consider the system in a rotating frame of reference which rotates with unit speed in the same direction as Jupiter. In this system, the Sun and Jupiter are fixed points on the xaxis corresponding to ψ = 0. We let (r, ϕ) = (r, ψ t) denote the motion of the asteroid in this rotating frame of reference. Our system has a Hamiltonian of the form: H P olar = H 2BP (SA) + H(r, ϕ) := P r P ϕ 2 2r 2 P ϕ 1 + H(r, ϕ; µ) r where P r and P ϕ are the momenta variables conjugate to r and ϕ respectively (Arnol d et al. 2006) and H is the µsmall perturbation of the associated Sun Asteroid two body problem (2BP(SA)) by the presence of Jupiter. This system arises by initially considering the planar 3BP where the asteroid has mass m, and letting m 0. From this, we have the following equations of motion to describe the motion of our asteroid: ϕ = H P olar P ϕ = P ϕ r 2 1 P ϕ = H P olar ϕ ṙ = H P olar = P r P r = H P olar P r r = P 2 ϕ r 3 = H ϕ 1 r 2 H r In addition, the RCP3BP has a conserved quantity known as the Jacobi constant. J(r, ϕ, ṙ, ϕ) = r2 2 + µ + 1 µ ṙ2 + r 2 ϕ 2 =: U(r, ϕ) ṙ2 + r 2 ϕ 2 d J d S 2 2 where d J and d S are distances from the asteroid to Jupiter and the Sun, respectively. d J (r, ϕ) = ( r 2 2(1 µ)r cos(ϕ) + (1 µ) 2) 1 2 d S (r, ϕ) = ( r 2 + 2µr cos(ϕ) + µ 2) 1 2 (1) The Jacobi constant can be thought of as the total energy of our massless asteroid, with respect to our rotating frame. For a derivation of this conserved quantity, refer to sections and of the text by Arnol d, Kozlov, and Neishtadt (2006). Denote by H(J 0 ) = {(r, ϕ) : U J 0 } a set of points on the plane of motion (configuration space). The connected components of this set are called the Hill regions associated with the Jacobi constant J 0. These regions are the locations in the (r, ϕ) plane (shaded regions in figure 6)
3 Instabilities in the SunJupiterAsteroid Three Body Problem 3 Fig. 1 Disjoint Hill Regions for µ = 10 3 and J (Galante et at. 2011) Fig. 2 Eccentricity vs. Aphelion and Perihelion Radii for J 0 = 1.55 where the asteroid is allowed to move. Fixing the Jacobi constant restricts dynamics to an invariant energy surface, denoted S(J 0 ) := {(r, ϕ, ṙ, ϕ) : J(r, ϕ, ṙ, ϕ) = J 0 } Most of these surfaces are smooth 3dimensional manifolds. Let us denote by RCP 3BP (µ, J 0 ) the RCP3BP with SunJupiter mass ratio µ and dynamics restricted to the surface S(J 0 ). For µ 10 3 and J , the set H(J 0 ) consists of three disjoint connected components: a region around the Sun called the inner Hill region, a region around Jupiter called the lunar Hill region, and a noncompact region called the outer Hill region. The boundary of these regions can be found by considering the zero velocity curves, given by ṙ 2 + r 2 ϕ 2 = 0, which are on the boundary of the Hill regions (Arnol d et al. 2006). In this paper, we consider only orbits contained in the inner Hill region, denoted by H in (J 0 ). For convenience, denote S in (J 0 ) = H in (J 0 ) S(J 0 ). When dynamics S in (J 0 ) is considered, we refer exclusively to the case when the inner Hill region is disjoint from the other two. For J 0 greater than 1.52, asteroids stay uniformly bounded away from Jupiter for all time by the energy surface constraint. However, for high eccentricities, the asteroid can make near collisions with the Sun (referred to as sungrazers; see figure 2). A general result states that there are KAM tori near the Sun which prevent
4 4 John C. Urschel, Joseph R. Galante collision (Chenciner et al. 1988). For small µ and away from collisions, the RCP3BP is nearly integrable and can be approximated with the SunAsteroid two body problem (2BP(SA)), corresponding to µ = 0. Elliptic motions of a 2BP have two special points where the radial velocity ṙ of the asteroid is zero. The perihelion is the closest point to the Sun 1, denoted r perih, and the aphelion is the farthest point from the Sun, denoted r aph. We define the osculating (or instantaneous) eccentricity e(t) for the RCP3BP to be the eccentricity of the asteroid in the unperturbed 2BP(SA) system, with initial conditions taken to be those of asteroid in the RCP3BP at time t. Theorem 1 Consider the restricted circular planar three body problem with Sun Jupiter mass ratio µ = Fix a Jacobi Constant J 0 = 1.55, so that there are three disjoint Hill regions and consider dynamics in the inner Hill region. Moreover, assume that ϕ(t ) P ϕ0 > 0 for all trajectories in a set Ω twist {e [0.09, 0.8]} which start on the surface Σ = {ṙ = 0, r 0, ϕ > 0} and return to Σ after time T. Then there exist constants e and e + where e 0.2 and e + 0.6, and trajectories of an asteroid with initial eccentricity e that increase to eccentricity e +. Remark: In section 2.1 we state that under these conditions, there exist orbits that become Mars crossing. We build a mathematical framework and obtain a sufficient condition for Theorem 1 to hold. This condition guarantees applicability of socalled AubryMather theory. Then we run numerical tests and evaluate the region of applicability of this theory in terms of eccentricity. Convincing numerical data shows for the Jacobi constant J 0 = 1.55 there existences of orbits whose eccentricity is varying from 0.2 to 0.6. For applicability of AubryMather theory for the outer Hill region of the RCP3BP, refer to the works of Galante and Kaloshin (2011). For a treatment of diffusion in the Elliptic Restricted 3BP, refer to Liao and Saari (1998). In addition, for a treatment of Mars crossing orbits for the elliptic case, refer to the works of Wisdom (1982, 1983, 1985). 2 Numerical Aspects, AubryMather Theory, and Regions of Instability Let us begin to describe the mathematical framework we employ by first noting that a Jacobi energy surface is a 3dimensional manifold. Fix µ 10 3 and Jacobi constant J The section Σ = {ṙ = 0, r 0, ϕ > 0} is a welldefined Poincaré section in the inner Hill region. This leads to a welldefined (Poincaré) 1 To be precise, the perihelion is the point where the asteroid is at the closest point to the center of mass of the system, and the Sun is within µ of the center of mass. However, in our Solar System, the radius of the Sun is approximately the SunJupiter distance, so we allow this slight abuse in terminology for small µ.
5 Instabilities in the SunJupiterAsteroid Three Body Problem 5 return map on an open set Ω. One can show that Ω is homeomorphic to a 2 dimensional cylinder and can be parametrized by angle ϕ and conjugate momenta P ϕ, or, alternatively, by ϕ and eccentricity e = e(p ϕ, J 0 )). Suppose T 2 S in (J 0 ) is an invariant set of the RCP3BP that is diffeomorphic to a 2dimensional torus. Call T 2 rotational if it cannot be continuously deformed inside S in (J 0 ) into a closed curve or a single point. When µ = 0 (i.e., when there is no perturbation), the problem reduces to the 2BP(SA) system and every such rotational 2torus is defined by {e = e 0 0}. Bounded motions correspond to e 0 [0, 1). In general, for e bounded away from 1 and µ sufficiently small, many of these rotational 2tori survive due to KAM (Siegel et al. 1971). Celletti and Chierchia gave a computer assisted proof using µ 10 3 and J in the inner Hill region to show that near e = 0.3 there is a rotational 2torus T 2 separating S in (J 0 ) into a compact Below T 2 component and a noncompact Above T 2 component (Celletti et al. 2007). We present a complementary method for a specific value of J 0 = 1.55; however, the method works for any µ 10 3 and J Define a Region of Instability (RI) as an open invariant set in S in (J 0 ) which is homeomorphic to an annulus, and has no rotational 2dimensional tori inside. If there is a rotational 2torus, then it separates S in (J 0 ) into above and below regions. This provides a topological obstruction to instability. To construct regions of instability, one must know about the existence of invariant curves in a given region. Theorem 2 In the setting of Theorem 1, the RCP3BP, restricted to the inner Hill region of a Jacobi energy surface, has a welldefined Poincaré map F : Ω( Σ) Σ. Its restriction to Ω twist is an exact areapreserving twist map, and there is a subregion Ω AM Ω twist with [e, e + ] T Ω AM, such that for any rotation number ω [ω, ω + ] (ω ± = ω ± (e ± )) there exists a corresponding AubryMather set Σ ω Ω twist with Σ ω Ω AM. Moreover, none of the AubryMather sets Σ ω with ω [ω, ω + ] are ever invariant curves. Abstractly, it is not clear that e < e + (or that ω < ω + ). We fix µ = 10 3 and J 0 = 1.55 for the sake of working with concrete numbers. It is shown numerically for these parameters that on the subset T {e [0.09, 0.8]} Ω twist Ω, the Poincaré map, denoted F = F µ,j0, is an exact, areapreserving twist (EAPT) map. EAPT maps of this region can be studied using AubryMather theory. However it is important to emphasize that AubryMather (AM) theory does not apply directly as Ω may not be an invariant set. Only through a refined study of properties of F can it be shown that AM theory can be applied. A brief review of AM theory is found in section 6 for unfamiliar readers. The cone crossing condition introduced by MacKay and Percival (1985) is used to obtain a sufficient condition to rule out invariant curves, as well as establish the existence of a range of AubryMather invariant sets. In particular, it is used to 2 For J 0 near or less than 1.52 collisions with Jupiter are hard to exclude.
6 6 John C. Urschel, Joseph R. Galante establish that there are e ±, e < e + with T [e, e + ] Ω AM. It is the set Ω AM that AM theory is ultimately applied to in order to obtain the existence of orbits making large deviations in eccentricity. The cone crossing condition exploits the fact that AubryMather sets are Lipschitz graphs. The MacKayPercival sufficient condition is obtained in two steps: Establish bounds on the Lipschitz slope of potential invariant curves as well as AubryMather sets. This gives rise to a conefield in the tangent space to Ω twist, and a range of rotation numbers such that the corresponding AubryMather sets are contained in Ω AM. Show that there is a vertical strip of initial conditions such that there are tangent vectors crossing this conefield. This rules out invariant curves in Ω twist. Once a region free of invariant curves is established inside the region of twist, an application of Mather s variational method provides the existence of an orbit crossing Ω AM, completing the proof of Theorem 1 (Mather et al. 1994). It is important to emphasize that the orbits in Theorem 1 are not constructed by means of numerical integration, but through abstract variational principles found in Aubry Mather theory. Convincing numerical data is presented to obtain concrete bounds. To make the proof fully rigorous, our initial numerical tests must be verified, for example by using the machinery of interval arithmetic. 2.1 Mars crossing orbits On S in (1.55), an asteroid with e = 0.2 has radius r [0.533, 0.800]. The semimajor axis of the orbit of Mars is 1.5AU and the semimajor axis of the orbit of Jupiter is 5.2AU which places Mars at position r = in normalized coordinates. Also on S in (1.55), an asteroid with e = 0.6 has radius r [0.204, 0.818]. Thus we have the following: Corollary 3 Under the hypothesis of Theorem 1, there exist orbits of the asteroid which become Mars crossing. In the Asteroid belt there are approximately 1.7 million asteroids of radius of at least 1km. The orbits with J 0 = 1.55 and e = 0.2 are at the boundary of the main Asteroid belt. Some of them might have had significant oscillations of eccentricity as this theorem suggests. Even though an asteroid whose orbit is Mars crossing has a small chance of being captured by it (see section of Arnol d, Kozlov, and Neishtadt (2006)), enough attempts could have led to a capture. However, we stress that Mars is a not a part of our model, and, therefore, this claim cannot be completely justified by the numerics in this paper. For larger eccentricity asteroids, the perturbative effects of Mars become less negligible. Letting Jupiter have positive eccentricity leads to the socalled Restricted Planar Elliptic Three Body Problem. This is a Hamiltonian system of two and a half degrees of freedom. It has more room for instabilities. The wellknown instabilities occur in Kirkwood gaps, when the period of Jupiter and of an asteroid are
7 Instabilities in the SunJupiterAsteroid Three Body Problem 7 given by a rational with both numerators and denominators small, e.g. 1/3, 2/5. Mathematically, these instabilities have been recently studied by Fejoz, Guardia, Kaloshin, and Roldan (2011). For a review of diffusion in asteroid belt resonances, refer to the work of FerrazMello (1999). 3 Plan of the Proof The overall plan of our proof is as follows: we convert the dynamics to a return map, eliminate the existence of invariant curves over a section of the return map, and, finally, use existing theory to conclude that this nonexistence of invariant curves results in an orbit which diffuses over the interval [e, e + ]. These three steps combined form the numerical proof of the main theorem. More explicitly, the general flow of the remainder of the paper is as follows: Step 1: The dynamics is formulated as that of an exact area preserving twist map (EAPT) F µ. In the case µ = 0, it is easy to show that F µ is a twist map. For µ > 0, numerics are used to confirm this for a large region of the phase space. Step 2: Approximate the EAPT F µ by G. The approximated map G shares the same qualitative behaviors as F µ, has some desired properties that F µ lacks, and is much easier to deal with numerically. However, G is not guaranteed to be area preserving. Step 3: Rule out the the presence of invariant curves for G. We use the aforementioned cone crossing condition. By design, if this condition holds for an areapreserving twist map F µ in a region Ω, then F µ has no rotational invariant curves in Ω. This condition relies on a certain conefield. We construct a conefield for the map G and verify that the cone crossing condition holds for G in a certain region Ω. Then we show that this condition is robust and also holds for F µ. This implies that F µ has no rotational invariant curves in Ω. Step 4: Apply the Mather Connecting Theorem We utilize the Mather Connecting Theorem and AubryMather theory to conclude there exists an orbit which diffuses in the manner we prescribed. 4 Formulation of a Twist Map Recall that motions of the asteroid in rotating polar coordinates (r, ϕ) can be viewed as the solutions to Hamilton s equations of motion with a Hamiltonian of
8 8 John C. Urschel, Joseph R. Galante the form H P olar = H 2BP (SA) + H(r, ϕ) := P r P ϕ 2 2r 2 P ϕ 1 + H(r, ϕ; µ) (2) r With the notations in (1), H can be written H := 1 r µ d J 1 µ d S = 0 T µ(µ 1)(1 + 3 cos(2ϕ)) 4r 3 + O( µ r 4 ) Denote the flow of the RCP3BP at time t with initial conditions (r 0, ϕ 0, P r0, P ϕ0 ) RCP 3BP by Φt (r 0, ϕ 0, P r0, P ϕ0 ). Restricting the dynamics to the energy surface S in (J 0 ) has the effect of implicitly defining one of the variables (r, ϕ, P r, P ϕ ) in terms of the other three. Further reduction of the dynamics is possible. Consider the section Σ = {ṙ = 0, r 0, ϕ > 0}, i.e., the perihelion surface, and take a perihelion to perihelion return map. Denote this map by F µ. Let T = T (ϕ 0, P ϕ0 ) be the return time to the section. Then F µ (ϕ 0, P ϕ0 ) = (ϕ 1, P ϕ1 ) is given by T ( ϕ 1 = ϕ P ) ϕ Φt (ϕ 0,P ϕ0 )dt P ϕ1 = P ϕ0 + 0 r 2 ( H ϕ ) Φt (ϕ 0,P ϕ0 )dt where the initial conditions r 0 and P r0 of the flow are determined implicitly by the restriction to the energy surface S in (J 0 ) and the section Σ. A computer can be programmed to compute this map numerically. We see the output in figure 3 for J 0 = Notice the apparent lack of invariant curves for e [0.2, 0.6]. 4.1 Reformulation of F µ For the two body problem there is a natural, well defined action angle coordinate system known as Delaunay variables, and for the RCP3BP, these coordinates are well defined for motions away from e = 0, 1. In short, there is a canonical transformation D(l, g, L, G) = (r, ϕ, P r, P ϕ ) from Delaunay to polar variables. The image of D is only defined for bounded motions of the 2BP(SA) with (l, g) T 2 and 0 G L. For the 2BP, L 2 is the semimajor axis of the ellipse of the orbit, so by Kepler s Third Law, the period T = 2πL 3. The variable G = P ϕ is the angular momentum, or, alternatively, LG is the semiminor axis of the ellipse of the orbit. The variable l T is the mean anomaly, which is l = π mod 2π at the aphelion, l = 0 mod 2π at the perihelion, and, in general, (l l 0 ) = 2π T t. The quantity g + t can be interpreted as the perihelion angle (in nonrotating coordinates g itself plays this role) (Goldstein et al. 2001). It is possible to recover the r and ϕ variables from Delaunay coordinates by noting that r = L 2 (1 e cos(u)), where the eccentricity e = 1 G2 L, and u, the 2
9 Instabilities in the SunJupiterAsteroid Three Body Problem 9 Fig. 3 Return Map F µ for J 0 = 1.55 and µ = (ϕ 0 vs. eccentricity)
10 10 John C. Urschel, Joseph R. Galante eccentric anomaly, is given implicitly by the Kepler equation u e sin(u) = l. The variable ( ) ϕ = g + f, where the variable f, known as the true anomaly, is given by tan f 1+e 2 = 1 e tan ( ) u 2 or, alternatively, r = L 2 (1 e 2 ) 1+ecos(f). Because the return map F µ is defined using trajectories corresponding to a full revolution of the asteroid, the variable u is periodic with period 2π. When u = 2πk, k Z, then f = 2πk. When µ = 0, there is no precession of the ellipse of orbit, i.e. g + t is constant in rotating coordinates, and hence ϕ + t = ψ in nonrotating coordinate is periodic. (This a restatement of the fact that the 2BP(SA) has a periodic solution, an ellipse.) Due to the 2π periodicity of the equations of motion in ϕ, ϕ 1 simplifies to ϕ 1 = ϕ 0 + T (ϕ 0, P ϕ0 ). In the 2BP(SA) case (µ = 0), it holds that T (ϕ 0, P ϕ0 ) = 2π(2J 0 2P ϕ0 ) 3/2. Hence, it is possible to write in general F µ : ( ϕ0 P ϕ0 ) ( ϕ1 P ϕ1 ) = ( ) ϕ0 + 2π(2J 0 2P ϕ0 ) 3/2 + µf ϕ (ϕ 0, P ϕ0 ; µ) P ϕ0 + µf Pϕ (ϕ 0, P ϕ0 ; µ) (3) where F ϕ (.; µ), F Pϕ (.; µ) are smooth functions in a domain bounded away from e = 1. We note that this map is similar in many ways to the Keplerian map describing highly eccentric cometary motion as described by Broucke and Petrovsky (1987). 4.2 F µ is an EAPT Because F µ arises as a return map of a Hamiltonian system, the map is area preserving. Additionally, due to the fact that the Hamiltonian has two degrees of freedom, the map is also exact. We claim the map is also a twist map. (See section 6 for precise definitions of exact, area preserving, and twist for an abstract map.) We say that F µ is a twist map in a region Ω if ϕ 1 P ϕ0 > 0 (ϕ 0, P ϕ0 ) Ω It is easy to see that this holds everywhere for µ = 0. Lemma 4 The unperturbed map F 0 is a twist map in the inner Hill Region for J 0 > 1.5. ϕ Proof: 1 P ϕ0 = 6π(2J 0 2P ϕ0 ) 5/2 > 0 since in the inner Hill region P ϕ0 < J 0 when J 0 > 1.5. For µ 0, careful estimates of the perturbation terms are needed to prove twisting over a domain. 3 Let Ω twist be the largest domain in Ω where the inequality ϕ 1 P ϕ0 > 0 holds. In practice, we are only able to find a subdomain of Ω twist 3 Notice that the angle ϕ enters into the perturbation H (see (2)). As the Poincaré map F µ is defined for approximately one revolution of the asteroid, then the change in the ϕ component should average out for higher order terms in the µ expansion of H.
11 Instabilities in the SunJupiterAsteroid Three Body Problem 11 which is selected experimentally to be the largest domain in which the twist inequality can be proven to hold using the current best estimates on the perturbation terms. The twist property is expected to fail near e = 1 because of close encounters with the Sun. The map F µ is not even defined near this region because of this. Current best estimates show the following: Claim 5 For µ = 10 3 and J 0 = 1.55, the map F µ is a twist map in the inner Hill Region for e [0.09, 0.8]. Numerical Proof: A computer is used to compute the map F µ. The annulus (ϕ, P ϕ ) [0, 2π] [0.39, 0.83] is divided up into boxes of size π 16 by The region e [0.09, 0.8] corresponds to P ϕ [0.39, 0.83], using conservation of the Jacobi constant 4. To compute the twist term, the partial derivative ϕ 1 P ϕ0 is estimated using a difference quotient with initial conditions varying by 10 7 in the P ϕ direction. The computer finds the required inequality holds in the specified region at each grid point using this approximation. The dominant factor in the computation of the partial derivatives for twist arises from the 2BP(SA) system (see proof of Lemma 4). Because we are away from singularities at e = 1 (which can cause near collisions with the sun), the approximation made is acceptable and the behavior is close to that of the unperturbed system. Remark: Currently this proof is verified using only numerics. To make this numerical evidence into a proof, one can use rigorous numerical integration to compute the partial derivative in question, and use interval arithmetic to make a uniform bound for each box in the annulus. This has been carried out for a few boxes in the grid using the CAPD package. Implementing rigorous numerical integration for cases when the asteroid makes a close approach to the sun requires extraordinarily good estimates on the perturbation term, meaning a high order integrator with small step size, and a very fine grid is needed. This can be quite costly in terms of computing power, and the authors were unable to show the result for every box in the grid covering the given annulus. 5 The Cone Crossing Condition First we consider an abstract setting and then apply it to the RCP3BP. This section follows the work found in MacKay and Percival s paper (1985). Suppose F (θ 0, I 0 ) = (θ 1, I 1 ) is an EAPT on an invariant domain Ω diffeomorphic to a cylinder T R (θ, I). A (rotational) invariant curve C Ω (in this paper we study only rotational invariant curves, so we omit rotational for brevity) is an invariant set of F which is diffeomorphic to a circle and cannot be continuously deformed to a single point in Ω. A theorem of Birkhoff states that invariant curves are graphs over T. 4 More precisely, it follows from the geometry of ellipses that e = 1 G2 L 2 in Delauney coordinates; a quick conversion to polar coordinates yields the formula e = 1 2J 0 Pϕ 2 + 2Pϕ. 3
12 12 John C. Urschel, Joseph R. Galante Theorem 6 (Birkhoff) Suppose C is an invariant curve of an EAPT. Then there exists a Lipschitz continuous function P such that C {(θ, P (θ)) : θ T}. Let D(x 1, x 2 ) = P (x 2) P (x 1 ) x 2 x 1, x 1 x 2. Recall that P is Lipschitz if there exist D ± such that for all x 1, x 2, D D(x 1, x 2 ) D +. Obtaining the Lipschitz property in Birkhoff s theorem is not hard. Simply consider the first image of the vertical line segment of height di. It can be shown ( ) I1 I ( 0 θ1 that the image of the line segment under F approximately has slope ). Taking sups over all such partial derivatives in Ω yields D +. Doing the same for F 1 I 0 yields D. Recall, that each AubryMather set is a Lipschitz graph (Mather et al. 1994). We obtain the following corollary. Corollary 7 Each invariant curve in Ω, at every point, has a slope inside [D, D + ]. The same is true about the Lipschitz constant for each AubryMather set contained in Ω. Consider tangent space orbits (F, DF ) : (x, v) (F (x), D x F (v)), where x = (θ, I) T R and v = (δθ, δi) T R. Theorem 8 (Cone Crossing Condition) Suppose {x i = F i (x 0 )} is an orbit and {v i } is the tangent component to the orbit. Additionally suppose v 0 is in the upper half cone (i.e. above lines of slope D ± originating at x 0 ), and suppose there exists an n > 0 so that v n is in the lower half cone (i.e. below the lines of slope D ± originating at x n ). Then the orbit does not belong to an invariant curve. Fig. 4 Cone Crossing Condition Proof: By continuity in initial conditions, a nearby orbit would cross the invariant curve. This is a contradiction (see fig. 4). MacKay and Percival include exposition regarding the equivalence of the cone crossing condition and actionminimizing orbits (MacKay et al. 1985). In short,
13 Instabilities in the SunJupiterAsteroid Three Body Problem 13 orbits which satisfy the cone crossing condition are not actionminimizing. This is because invariant curves are actionminimizing. See the associated paper for additional comments on other types of action minimizing (AubryMather) sets; also see section Some preliminary numerics In order to use the cone crossing condition in practice, tight bounds on the slopes of the cones must be obtained. It is inefficient to use the uniform upper bound on the entire phase space Ω, especially when the objects considered lay only in a smaller subset. The following algorithm attempts to rule out invariant curves by obtaining better bounds using more localized information about potentially invariant objects. 1. Input an initial condition x 0 = (θ 0, I 0 ) and a number of iterates n. In practice, n is chosen so that θ n θ 0 > 2π. 2. Compute a bound I(x 0, n) so that x i = F i µ(x 0 ) T [I 0 I(x 0, n), I 0 + I(x 0, n)] for i = 0,..., n. The interval is often referred to as a localization interval because it localizes the curve Compute D ± on the annulus T [I 0 I(x 0, n), I 0 + I(x 0, n)]. 4. Use the cone crossing condition to rule out invariant curves on the annulus T [I 0 I(x 0, n), I 0 + I(x 0, n)] using n iterates. It suffices to use the vector (1, D + ) for initial conditions of the equations of variation and observe whether images in the tangent space drop below the vector (1, D ). One does not need to apply the cone crossing condition at every point in the annulus to rule out invariant curves. It suffices to use a vertical strip in the I direction going from the bottom to the top. If all points in the vertical strip satisfy the cone crossing condition, then there are no invariant curves. (If there were, they would have have to pass through the strip by construction of I.) If not all points in strip satisfy the cone crossing condition, the test to rule out invariant curves is inconclusive. In this case, a higher number of iterates may be required to rule out invariant curves, there may be point of a periodic orbit on the vertical slice, or there may be an invariant curve in the domain. The cone crossing condition only applies to invariant domains. While all the points in the region Ω twist by definition satisfy the twist property, this domain might not be invariant. By first constructing bounded regions where potential invariant curves must lay, then using the conecrossing condition to rule out the possibility of existence invariant curves in those regions, this algorithm no longer requires invariance of the domain of twist. Instead, only the weaker condition that the localization interval remain inside in the domain of twist is required. Precise numerical estimates are required for concrete problems to ensure this condition is met. In practice this creates problems ruling out invariant curves in domains close to the boundary of Ω twist, however for a sufficiently large domain of twist, there 5 This construction actually localizes all AubryMather sets with rotation symbol ω [ n+1 +, 1 ]. See section 6 for definitions. 1 n
14 14 John C. Urschel, Joseph R. Galante will be a sizable region where the presence of invariant curves can be ruled out. Remarks on Application to the RCP3BP: For J 0 = 1.55, µ = 0.001, select T [0.39, 0.83] (ϕ, P ϕ ) 6 to pick points from. It follows from Claim 5 that F µ is an EAPT in this domain. Step 2 of the algorithm, the construction of the localization intervals, can be estimated simply estimating the largest jump in the action component, P ϕ. From the equations of motion for the RCP3BP map, this can be estimated by integrating upper bounds on the perturbation term over one revolution. A priori estimates for this are not hard to obtain and this step can be quick if one is willing to accept a larger localization interval. Step 3 can be implemented using interval arithmetic to bound domains on a vertical strip. MacKay and Percival adopted this approach, though for our purposes this is quite expensive. Step 4 requires bounds on the equations of variation. A computer is programmed to compute the map F µ using µ = and J 0 = The space (ϕ, P ϕ ) [0, 2π] [0.57, 0.8] (corresponding to e [0.2, 0.6]) is divided up into boxes of size π 16 by To compute localization intervals, 10 iterates of the map are computed and the difference from initial conditions is measured. In this region of the phase space the size of the localization interval is no larger than 39µ. Using the localization intervals, estimates of D ± are computed using all points in the grid. Unfortunately, the cone crossing condition is not usually satisfied using this technique. Better estimates are needed. Using either a smaller grid or better estimates on both the perturbation terms (section 7) and on the flow is a possible approach. We pursue the method that MacKay and Percival suggested of refining estimates on the bounds D ± and combine it with approximations specific to our map F µ to obtain the cone crossing condition. Specifically, MacKay and Percival note that the map DF induces a map on cones. Under repeated forward iterates of an initial vertical vector, the images of the vectors decrease uniformly, converging to an eigenvector of DF. Similarly for DF 1 (MacKay et al. 1985). This has the effect of refining the cones. Armed with sufficiently good approximations, a computer is able to estimate D ± in each strip of size 0.01 in P ϕ and find that D Similarly, D This might suggest some type of symmetry with respect to D + and D. However, we do not assume anything of the sort. Refining at each point produces a measurable increase the bounds obtained for D ± (4.5µ vs 39µ). However this is still not sufficient to obtain a large region with no invariant curves. Below we shall make explicit the approximations used to obtain the 4.5µ bound, and provide an additional method of refinement which shall ultimately yield our desired result. 6 From hereon out, results may be stated using the (ϕ, P ϕ) parameterization of annulus, as opposed to (ϕ, e). The former parameterization is easier to work with numerically; the later is better for intuition.
15 Instabilities in the SunJupiterAsteroid Three Body Problem 15 Remark: This method has the advantage that it does not require us to compute a fixed number of iterates n when running the algorithm to test for invariant curves. Instead, we can run a test trajectory for as long as needed to determine if the cone crossing condition is satisfied. 5.2 Some approximations To compute the improved cones in the case of the RCP3BP, the map DF needs to be precisely computed. This is rather complicated in the case of flows (MacKay and Percival used the standard map which is cheap to compute). Let us make several approximations to F µ. First, in the definition of F µ, assume that µf ϕ (.; µ) 0. This is reasonable, as changing ϕ 1 by a µ small quantity over one revolution has little effect, since the ϕ components enter into motions only in the H term, which is already µ small. The effect of µf Pϕ (.; µ) is significantly more important, as it dictates how diffusion in eccentricity occurs. To compute this quantity exactly requires integration of the equations of motion for the RCP3BP, which can be computationally expensive. Instead, we use the integrable 2BP(SA) to compute this term. With the exception of high eccentricity sun grazing comets, starting from the same initial conditions, flows for the RCP3BP and for the 2BP(SA) are quite similar (in fact O(µ) close) over one revolution, so this is a reasonable approximation. First note the following identities for the 2BP (which can be found on pg of the text by Arnol d, Kozlov, and Neishtadt (2006)): u e sin(u) = L 3 t = l r = L 2( 1 e cos(u) ) sin(ϕ ϕ 0 ) = sin(u) 1 e 2 1 e cos(u) cos(ϕ ϕ 0 ) = cos(u) e 1 e cos(u) where ϕ 0 is the angle the asteroid makes with respect to the xaxis (where Jupiter is in the RCP3BP) when it is at the perihelion, i.e., when u = 0 mod 2π and t = 0. Addition formulas for sine and cosine give that sin(ϕ) = sin(u) 1 e 2 cos(ϕ 0 ) + cos(u) e 1 e cos(u) 1 e cos(u) sin(ϕ 0) cos(ϕ) = cos(u) e 1 e cos(u) cos(ϕ 0) sin(u) 1 e 2 sin(ϕ 0 ) 1 e cos(u) We make the estimate µf Pϕ (ϕ 0, P ϕ0 ; µ) p(ϕ 0, P ϕ0 ; µ) := = T 0 2π 0 H ( ) r(t), ϕ(t) 2BP ϕ (SA) dt H ϕ ( )( du ) 1 2BP r(u), ϕ(u) dt (SA) du.
16 16 John C. Urschel, Joseph R. Galante where ϕ 0 is the perihelion angle and L 2 0 = a is the semimajor axis, and where the integration is performed over trajectories of the 2BP(SA). Note that for the 2BP(SA) it holds that ( du dt ) 1 2BP (SA) = Lr. Furthermore, due to the energy surface constraint, L = (2J 0 2P ϕ0 ) 1 2. Refer to section 8 for an evaluation of the bounds on the error between µf Pϕ (ϕ 0, P ϕ0 ; µ) and p(ϕ 0, P ϕ0 ; µ). In summary, they are small enough for our purposes. We introduce the map G defined by G := G(µ, J 0 ) : ( ϕ0 P ϕ0 ) ( ) ϕ0 + 2π(2J 0 2P ϕ0 ) 3/2 P ϕ0 + p(ϕ 0, P ϕ0 ; µ) (4) The map G captures many of the qualitative behaviors of F µ. See figure 5. The map G is clearly a twist map. However, G is not areapreserving. Fig. 5 Approximate Return Map G for J 0 = 1.55 (ϕ 0 vs. eccentricity) It follows that DF µ DG, where DG = ( ) 1 6π(2J0 2P ϕ0 ) 5/2 p ϕ p P ϕ0
17 Instabilities in the SunJupiterAsteroid Three Body Problem 17 Notice that knowledge of derivatives of the function p(ϕ, P ϕ ) are required to compute this quantity. p T (Pϕ ) ( ( 2 H )( r ) ( 2 ) H )( ϕ ) := + P ϕ 0 r ϕ P ϕ ϕ 2 P 2BP (SA) dt ϕ dt (P ϕ) H ( r(t (Pϕ )), ϕ(t (P ϕ )) ) dp ϕ ϕ p ϕ := T (Pϕ ) 0 ( 2 H ) 2BP ϕ 2 (SA) dt As in the definition of p(ϕ, P ϕ ) above, the integral can be expressed an integral over t, or over u, by including the appropriate Jacobian, Lr, in this case. Since only the 2BP approximation is considered, the period T = T (P ϕ ) = π 2 (J 0 P ϕ ) 3 2. The identities of section 4.1 imply the following: T (P ϕ ) P ϕ = 3π 2 2 (J 0 P ϕ ) 5 2 r = P ϕ(pϕ 2 r) P ϕ re 2 ϕ = L sin(u)(p ϕ 2 + r) P ϕ r 2 e For µ 0, generically det(dg) 1, and hence the map G is not area preserving. However p C 1 = O(µ), so the map G is µclose to the area preserving map F µ. We employ the cone crossing condition on the map G and later offer evidence that this is sufficient to draw conclusions about F µ. Doing so requires approximations of the map G 1. Computing this map precisely can be quite expensive since it typically requires shooting methods to obtain good numerics. To remedy this, consider the following numerical inverse of G: G inv := G inv (µ, J 0 ) : ( ϕ1 P ϕ1 ) ( ) ϕ1 2π(2J 0 2(P ϕ1 p(ϕ 0, P ϕ1 ; µ))) 3/2 P ϕ1 p(ϕ 0, P ϕ1 ; µ) where ϕ 0 is an approximation to ϕ 0, given by ϕ 0 = ϕ 1 2π(2J 0 2P ϕ1 ) 3/2. On the region ϕ [0, 2π], P ϕ [0.57, 0.8], numerics indicate that as defined G inv G(x) x C 1 < 5µ. Hence, the numerical inverse is µclose to the actual inverse of the map G. 5.3 Refined Numerics  Conefields
18 18 John C. Urschel, Joseph R. Galante Definition: A conefield C(X) is a collection ( x, v (x), v + (x) ) for each x X where v ± (x) T X are vectors in the tangent space with base point x. In the present application, the vectors in the conefield are taken to the be eigenvectors of Jacobian DF of the EAPT F at each point in the domain Ω twist. MacKay and Percival (1985) proposed to iteratively refine conefields to prove the nonexistence of invariant curves. The flow acts upon a conefield at a point through the action of the Jacobian matrix DF on the eigenvectors. For the RCP3BP, define the following refinements: v new + (x) := ( DG ) ( G (x)[ v+ G inv (x) )] (5) inv v new (x) := ( DG ) inv [ ( )] v G(x) G(x) (6) Remark: Further refinements can be obtained by using higher iterates and composition. The refinements work by flowing the eigenvectors for the map DG forward and backwards under the flow in the tangent space. This can be parlayed into an algorithm to refine conefields over an entire space. MacKay and Percival note that if at any point v lays above 7 v +, then the interior of the cone is empty and there is no invariant curve through the phase space at that point. This can be parlayed into the following algorithm. 1. Input n, m and divide the phase space (ϕ, P ϕ ) T R into blocks of size 1/n 1/m. 2. In each block, compute bounds on the eigenvectors of DG and DG inv. Use these eigenvectors to define the conefield for each point in the block. 3. Use refinements 5 and 6 to refine the conefields in each block, taking upper and lower bounds where appropriate. If v lays above v +, conclude there is no invariant curve inside of the block. If v lays below v +, take another refinement, or alternatively, stop and leave the block as inconclusive. A version of this algorithm is implemented. Specifically, a computer is programmed to compute the maps G, G inv and their derivatives, using µ = and J 0 = The space (ϕ, P ϕ ) [0, 2π] [0.57, 0.8] (corresponding to e [0.2, 0.6]) is divided up into boxes of size π 16 by The initial conefields are computed using the eigenvectors. The refinement algorithm is applied to all points on the grid. This provides strong numerical evidence of the following: Claim: For J 0 = 1.55, µ = 0.001, (ϕ, P ϕ ) [0, 2π] [0.57, 0.8] (corresponding to e [0.2, 0.6]) the map F µ has no invariant curves. Numerical Proof: A computer is programmed to compute the maps G, G inv, and their derivatives, using µ = and J 0 = The space (ϕ, P ϕ ) [0, 2π] [0.57, 0.8] (corresponding to e [0.2, 0.6]) is divided up into boxes of size π 16 7 For v = (a, b), let v = (1, b a ) be a normalization of v. A vector v 1 lays above v 2 iff x y, where v 1 = (1, x) and v 2 = (1, y).
19 Instabilities in the SunJupiterAsteroid Three Body Problem 19 by The initial conefields are computed using the eigenvectors for DG. The refinement algorithm given above is used for all points on the grid. Each box in the given domain requires only a finite number of iterates (an average of 15) to satisfy the cone crossing condition. Since the map G is µ close to F µ, then the eigenvectors for DG are of order µ close to those of DF µ. For a modest number of iterations, this difference appears to be negligible. Hence showing that the cone crossing condition holds for points in the domain using G implies it holds for F µ as well. Remark: While this provides strong numerical evidence that there are no invariant curves for F µ in the domain e [0.2, 0.6], the above numerical proof is not rigorous. To make it rigorous, upper and lower bounds for the cone fields and their refinements must be given for each box, not just for a representative point in the box. Interval arithmetic may be used to do this, as suggested by both Mackay and Percival (1985) and Galante and Kaloshin (2011). Alternatively, one may dispense with the map G entirely and compute everything using the map F µ at the cost of increased complexity in the interval arithmetic. We have shown that F µ cannot have invariant curves in the region corresponding to e [0.2, 0.6]. This region is contained inside the twist region Ω twist, however Ω twist is not invariant. It is not obvious that AubryMather theory can be applied to this entire noninvariant region. Abstractly, AubryMather (AM) sets arise as minimizers to a variational principle. To ensure their existence, it must be shown that orbits do not stray far from the domain where the minimization is taking place. One way to see this is the case for the RCP3BP is to recall that in section 5.1, localization intervals were constructed for AubryMather sets. Numerical estimates show that orbits with initial conditions inside of T {e [0.2, 0.6]} remain inside of T {e [0.09, 0.8]} Ω twist after one full revolution around the sun. Independent of these concrete estimates, there are theoretical bounds which arise due to the actionminimizing properties of AubryMather sets that keep the orbits we are interested in from straying too far from AM sets. These issues, along with a general review of AubryMather theory is addressed in section 6. In summary, it turns out that e [0.2, 0.6] is large enough for minimizers and connecting orbits to exist and remain bounded inside the twist region. 6 AubryMather Theory A compact invariant region C is bounded by two rotationally invariant curves C and C + such that there are no rotationally invariant curves in between C and C + is called a Birkhoff Region of Instability (BRI). In such BRIs, Birkhoff showed the existence of orbits coming arbitrarily close to C and C + (see the work of Mather and Forni (1994)). A much stronger result is given by Mather (1990), which allows one to specify neighborhoods of certain invariant sets which the orbit must pass through. Before stating this result, a quick overview of basic facts of AubryMather theory shall be given. This review is primarily drawn from the works of Bangert (1988), Mather and Forni (1994), Gole (2001), Moser (1986),
20 20 John C. Urschel, Joseph R. Galante Siburg (2004), Bourgain and Kaloshin (2005), and Xia. Suppose F : T R T R is a C r (r 1) map. Let F : R R R be the lift of F to the universal cover. Let π denote the canonical projection of R onto T. Call F an exact area preserving twist map (EAPT) if and only if F is area preserving: det(df ) = 1. F is exact: For any noncontractible curve γ, the oriented area between γ and its image F (γ) is zero. F is twist: For F = ( F θ, F I ) the sign of ( I Fθ ) is constant and nonzero. This implies that the image of a vertical line in the cylinder is tilted in one direction relative to the vertical direction. Consider the biinfinite sequence { F i ( θ 0, Ĩ0) = ( θ i, Ĩi)} i Z of images. It turns out that every EAPT can be described by a generating function h : R R R (Bangert 1988). This can be described via the generating function by Ĩ k = 1 h( θ k, θ k+1 ) Ĩ k+1 = 2 h( θ k, θ k+1 ) The definition of h is extended to segments by h( θ 0, θ 1,... θ n ) = n 1 i=0 h( θ i, θ i+1 ) Definition: A segment ( θ 0, θ 1,... θ n ) is minimizing if for any other segment ( θ 0, θ 1,... θ n) with θ 0 = θ 0 and θ n = θ n, then h( θ 0, θ 1,... θ n ) < h( θ 0, θ 1,... θ n) See the work of Moser (1986) for the connection between the generating function h and the Hamiltonian. It is essentially a discrete version of the action functional, the integration of the Lagrangian dual to the Hamiltonian. A sequence { θ i } i Z is minimal if every finite segment in the sequence is minimal. Minimal sequences are action minimizing, in terms of Lagrangian formalism (Mather et al. 1994). More specifically, the generating function h( θ 0, θ 1 ) gives the minimal action to move between θ 0 and θ 1 in one iterate of F. Notice that 2 h( θ k 1, θ k ) + 1 h( θ k, θ k+1 ) = 0 for all k Z is a discrete version of the EulerLagrange (EL) equations. Let St(h) denote the set of all orbits which satisfy the discrete (EL) equations. Call such orbits stationary orbits. Stationary orbits are extremizers. Let Σ(h) St(h) denote the set of all action minimizing orbits. Note that Σ(h) St(h). This implies that π( Σ(h)) = Σ(h) St(h) = π( St(h)). Action minimizing orbits correspond to orbits of F in the phase space (Bangert 1988, Mather et al. 1994, Xia). For a stationary configuration Θ = { θ k } call the piecewise linear graph connecting (k, θ k ) with (k + 1, θ k+1 ) for each k Z the Aubry graph. Suppose for a stationary configuration Θ = { θ k }, the limit θ k ω = ω(θ) = lim k k
1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationEstimated Pre Calculus Pacing Timeline
Estimated Pre Calculus Pacing Timeline 20102011 School Year The timeframes listed on this calendar are estimates based on a fiftyminute class period. You may need to adjust some of them from time to
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationExponentially small splitting of separatrices for1 1 2 degrees of freedom Hamiltonian Systems close to a resonance. Marcel Guardia
Exponentially small splitting of separatrices for1 1 2 degrees of freedom Hamiltonian Systems close to a resonance Marcel Guardia 1 1 1 2 degrees of freedom Hamiltonian systems We consider close to completely
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationPHY411. PROBLEM SET 3
PHY411. PROBLEM SET 3 1. Conserved Quantities; the RungeLenz Vector The Hamiltonian for the Kepler system is H(r, p) = p2 2 GM r where p is momentum, L is angular momentum per unit mass, and r is the
More informationSection 4: The Basics of Satellite Orbits
Section 4: The Basics of Satellite Orbits MOTION IN SPACE VS. MOTION IN THE ATMOSPHERE The motion of objects in the atmosphere differs in three important ways from the motion of objects in space. First,
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationUSING MS EXCEL FOR DATA ANALYSIS AND SIMULATION
USING MS EXCEL FOR DATA ANALYSIS AND SIMULATION Ian Cooper School of Physics The University of Sydney i.cooper@physics.usyd.edu.au Introduction The numerical calculations performed by scientists and engineers
More informationStochastic Inventory Control
Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the
More informationFIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
More information15 Limit sets. Lyapunov functions
15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior
More informationMA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More information4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
More information14.11. Geodesic Lines, Local GaussBonnet Theorem
14.11. Geodesic Lines, Local GaussBonnet Theorem Geodesics play a very important role in surface theory and in dynamics. One of the main reasons why geodesics are so important is that they generalize
More informationMATH 132: CALCULUS II SYLLABUS
MATH 32: CALCULUS II SYLLABUS Prerequisites: Successful completion of Math 3 (or its equivalent elsewhere). Math 27 is normally not a sufficient prerequisite for Math 32. Required Text: Calculus: Early
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationAlgebra 2 Chapter 1 Vocabulary. identity  A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity  A statement that equates two equivalent expressions. verbal model A word equation that represents a reallife problem. algebraic expression  An expression with variables.
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationArrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More informationThnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson
More informationSolutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture  17 ShannonFanoElias Coding and Introduction to Arithmetic Coding
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationRemarks on Lagrangian singularities, caustics, minimum distance lines
Remarks on Lagrangian singularities, caustics, minimum distance lines Department of Mathematics and Statistics Queen s University CRM, Barcelona, Spain June 2014 CRM CRM, Barcelona, SpainJune 2014 CRM
More informationExemplar Problems Physics
Chapter Eight GRAVITATION MCQ I 8.1 The earth is an approximate sphere. If the interior contained matter which is not of the same density everywhere, then on the surface of the earth, the acceleration
More information1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationComputer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science  Technion. An Example.
An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: WireFrame Representation Object is represented as as a set of points
More informationPrentice Hall Algebra 2 2011 Correlated to: Colorado P12 Academic Standards for High School Mathematics, Adopted 12/2009
Content Area: Mathematics Grade Level Expectations: High School Standard: Number Sense, Properties, and Operations Understand the structure and properties of our number system. At their most basic level
More informationMetrics on SO(3) and Inverse Kinematics
Mathematical Foundations of Computer Graphics and Vision Metrics on SO(3) and Inverse Kinematics Luca Ballan Institute of Visual Computing Optimization on Manifolds Descent approach d is a ascent direction
More informationSome Comments on the Derivative of a Vector with applications to angular momentum and curvature. E. L. Lady (October 18, 2000)
Some Comments on the Derivative of a Vector with applications to angular momentum and curvature E. L. Lady (October 18, 2000) Finding the formula in polar coordinates for the angular momentum of a moving
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationON FIBER DIAMETERS OF CONTINUOUS MAPS
ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there
More informationMATHEMATICS (CLASSES XI XII)
MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)
More informationPOWER SETS AND RELATIONS
POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty
More informationEstimating the Average Value of a Function
Estimating the Average Value of a Function Problem: Determine the average value of the function f(x) over the interval [a, b]. Strategy: Choose sample points a = x 0 < x 1 < x 2 < < x n 1 < x n = b and
More informationFactoring Patterns in the Gaussian Plane
Factoring Patterns in the Gaussian Plane Steve Phelps Introduction This paper describes discoveries made at the Park City Mathematics Institute, 00, as well as some proofs. Before the summer I understood
More informationMathematics 31 Precalculus and Limits
Mathematics 31 Precalculus and Limits Overview After completing this section, students will be epected to have acquired reliability and fluency in the algebraic skills of factoring, operations with radicals
More informationUNIFORMLY DISCONTINUOUS GROUPS OF ISOMETRIES OF THE PLANE
UNIFORMLY DISCONTINUOUS GROUPS OF ISOMETRIES OF THE PLANE NINA LEUNG Abstract. This paper discusses 2dimensional locally Euclidean geometries and how these geometries can describe musical chords. Contents
More informationSolving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the nonnegative
More informationClassroom Tips and Techniques: The Student Precalculus Package  Commands and Tutors. Content of the Precalculus Subpackage
Classroom Tips and Techniques: The Student Precalculus Package  Commands and Tutors Robert J. Lopez Emeritus Professor of Mathematics and Maple Fellow Maplesoft This article provides a systematic exposition
More informationPartitioning edgecoloured complete graphs into monochromatic cycles and paths
arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edgecoloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More informationRANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
More informationUnderstanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other
More informationIn mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data.
MATHEMATICS: THE LEVEL DESCRIPTIONS In mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data. Attainment target
More informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationx if x 0, x if x < 0.
Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the
More informationRotation Rate of a Trajectory of an Algebraic Vector Field Around an Algebraic Curve
QUALITATIVE THEORY OF DYAMICAL SYSTEMS 2, 61 66 (2001) ARTICLE O. 11 Rotation Rate of a Trajectory of an Algebraic Vector Field Around an Algebraic Curve Alexei Grigoriev Department of Mathematics, The
More informationPSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2
PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2 Abstract. We prove a BrucknerGarg type theorem for the fiber structure of a generic map from a continuum X into the unit interval I. We
More informationNaishul s Theorem for fibered holomorphic maps
Naishul s Theorem for fibered holomorphic maps Mario Ponce May 4, 2011 Abstract We show that the fibered rotation number associated to an indifferent invariant curve for a fibered holomorphic map is a
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationFigure 2.1: Center of mass of four points.
Chapter 2 Bézier curves are named after their inventor, Dr. Pierre Bézier. Bézier was an engineer with the Renault car company and set out in the early 196 s to develop a curve formulation which would
More information2.2. Instantaneous Velocity
2.2. Instantaneous Velocity toc Assuming that your are not familiar with the technical aspects of this section, when you think about it, your knowledge of velocity is limited. In terms of your own mathematical
More informationAP Calculus BC. All students enrolling in AP Calculus BC should have successfully completed AP Calculus AB.
AP Calculus BC Course Description: Advanced Placement Calculus BC is primarily concerned with developing the students understanding of the concepts of calculus and providing experiences with its methods
More informationOrbital Mechanics. Angular Momentum
Orbital Mechanics The objects that orbit earth have only a few forces acting on them, the largest being the gravitational pull from the earth. The trajectories that satellites or rockets follow are largely
More informationOrbital Dynamics with Maple (sll  v1.0, February 2012)
Orbital Dynamics with Maple (sll  v1.0, February 2012) Kepler s Laws of Orbital Motion Orbital theory is one of the great triumphs mathematical astronomy. The first understanding of orbits was published
More informationLecture 13. Gravity in the Solar System
Lecture 13 Gravity in the Solar System Guiding Questions 1. How was the heliocentric model established? What are monumental steps in the history of the heliocentric model? 2. How do Kepler s three laws
More informationDynamical Systems. Chapter 7
150 Chapter 7 Dynamical Systems Mathematical models of scientific systems often lead to differential equations in which the independent variable is time. Such systems arise in astronomy, biology, chemistry,
More informationResearch Article Stability Analysis for HigherOrder Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for HigherOrder Adjacent Derivative
More informationAstromechanics TwoBody Problem (Cont)
5. Orbit Characteristics Astromechanics TwoBody Problem (Cont) We have shown that the in the twobody problem, the orbit of the satellite about the primary (or viceversa) is a conic section, with the
More information1.7 Cylindrical and Spherical Coordinates
56 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE 1.7 Cylindrical and Spherical Coordinates 1.7.1 Review: Polar Coordinates The polar coordinate system is a twodimensional coordinate system in which the
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationStudent Performance Q&A:
Student Performance Q&A: AP Calculus AB and Calculus BC FreeResponse Questions The following comments on the freeresponse questions for AP Calculus AB and Calculus BC were written by the Chief Reader,
More informationSurface bundles over S 1, the Thurston norm, and the Whitehead link
Surface bundles over S 1, the Thurston norm, and the Whitehead link Michael Landry August 16, 2014 The Thurston norm is a powerful tool for studying the ways a 3manifold can fiber over the circle. In
More informationABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).
Degrees of Freedom Versus Dimension for Containment Orders Noga Alon 1 Department of Mathematics Tel Aviv University Ramat Aviv 69978, Israel Edward R. Scheinerman 2 Department of Mathematical Sciences
More informationCARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE
CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify
More informationParametric Curves. (Com S 477/577 Notes) YanBin Jia. Oct 8, 2015
Parametric Curves (Com S 477/577 Notes) YanBin Jia Oct 8, 2015 1 Introduction A curve in R 2 (or R 3 ) is a differentiable function α : [a,b] R 2 (or R 3 ). The initial point is α[a] and the final point
More informationFuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationFinite Sets. Theorem 5.1. Two nonempty finite sets have the same cardinality if and only if they are equivalent.
MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we
More informationSix questions, a proposition and two pictures on Hofer distance for hamiltonian diffeomorphisms on surfaces
1 Six questions, a proposition and two pictures on Hofer distance for hamiltonian diffeomorphisms on surfaces Frédéric Le Roux Laboratoire de mathématiques CNRS UMR 8628 Université ParisSud, Bat. 425
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More informationSection 3.7. Rolle s Theorem and the Mean Value Theorem. Difference Equations to Differential Equations
Difference Equations to Differential Equations Section.7 Rolle s Theorem and the Mean Value Theorem The two theorems which are at the heart of this section draw connections between the instantaneous rate
More informationPrecalculus REVERSE CORRELATION. Content Expectations for. Precalculus. Michigan CONTENT EXPECTATIONS FOR PRECALCULUS CHAPTER/LESSON TITLES
Content Expectations for Precalculus Michigan Precalculus 2011 REVERSE CORRELATION CHAPTER/LESSON TITLES Chapter 0 Preparing for Precalculus 01 Sets There are no statemandated Precalculus 02 Operations
More informationPersuasion by Cheap Talk  Online Appendix
Persuasion by Cheap Talk  Online Appendix By ARCHISHMAN CHAKRABORTY AND RICK HARBAUGH Online appendix to Persuasion by Cheap Talk, American Economic Review Our results in the main text concern the case
More informationComments on Quotient Spaces and Quotient Maps
22M:132 Fall 07 J. Simon Comments on Quotient Spaces and Quotient Maps There are many situations in topology where we build a topological space by starting with some (often simpler) space[s] and doing
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H1088 Budapest, Múzeum krt. 68. CONTENTS 1. SETS Set, equal sets, subset,
More informationSurface Normals and Tangent Planes
Surface Normals and Tangent Planes Normal and Tangent Planes to Level Surfaces Because the equation of a plane requires a point and a normal vector to the plane, nding the equation of a tangent plane to
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by MenGen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NPCompleteness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More informationShape Optimization Problems over Classes of Convex Domains
Shape Optimization Problems over Classes of Convex Domains Giuseppe BUTTAZZO Dipartimento di Matematica Via Buonarroti, 2 56127 PISA ITALY email: buttazzo@sab.sns.it Paolo GUASONI Scuola Normale Superiore
More informationA QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS
A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit Vectors
More informationSolutions to Exercises, Section 5.1
Instructor s Solutions Manual, Section 5.1 Exercise 1 Solutions to Exercises, Section 5.1 1. Find all numbers t such that ( 1 3,t) is a point on the unit circle. For ( 1 3,t)to be a point on the unit circle
More informationYou know from calculus that functions play a fundamental role in mathematics.
CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.
More informationLab 7: Rotational Motion
Lab 7: Rotational Motion Equipment: DataStudio, rotary motion sensor mounted on 80 cm rod and heavy duty bench clamp (PASCO ME9472), string with loop at one end and small white bead at the other end (125
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More information3. Reaction Diffusion Equations Consider the following ODE model for population growth
3. Reaction Diffusion Equations Consider the following ODE model for population growth u t a u t u t, u 0 u 0 where u t denotes the population size at time t, and a u plays the role of the population dependent
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationTHREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationSouth Carolina College and CareerReady (SCCCR) PreCalculus
South Carolina College and CareerReady (SCCCR) PreCalculus Key Concepts Arithmetic with Polynomials and Rational Expressions PC.AAPR.2 PC.AAPR.3 PC.AAPR.4 PC.AAPR.5 PC.AAPR.6 PC.AAPR.7 Standards Know
More information