{"id":843,"date":"2010-02-07T19:35:49","date_gmt":"2010-02-07T19:35:49","guid":{"rendered":"http:\/\/scientopia.org\/blogs\/goodmath\/2010\/02\/07\/the-end-of-defining-chaos-mixing-it-all-together\/"},"modified":"2010-02-07T19:35:49","modified_gmt":"2010-02-07T19:35:49","slug":"the-end-of-defining-chaos-mixing-it-all-together","status":"publish","type":"post","link":"http:\/\/www.goodmath.org\/blog\/2010\/02\/07\/the-end-of-defining-chaos-mixing-it-all-together\/","title":{"rendered":"The End of Defining Chaos: Mixing it all together"},"content":{"rendered":"<p> The last major property of a chaotic system is topological mixing. You can<br \/>\nthink of mixing as being, in some sense, the opposite of the dense periodic<br \/>\norbits property. Intuitively, the dense orbits tell you that things that are<br \/>\narbitrarily close together for arbitrarily long periods of time can have<br \/>\nvastly different behaviors. Mixing means that things that are arbitrarily far<br \/>\napart will eventually wind up looking nearly the same &#8211; if only for a little<br \/>\nwhile.<\/p>\n<p> Let&#8217;s start with a formal definition.<\/p>\n<p> As you can guess from the name, topological mixing is a property defined<br \/>\nusing topology. In topology, we generally define things in terms of <em>open sets<\/em><br \/>\nand <em>neighborhoods<\/em>. I don&#8217;t want to go too deep into detail &#8211; but an<br \/>\nopen set captures the notion of a collection of points with a well-defined boundary<br \/>\nthat is <em>not<\/em> part of the set. So, for example, in a simple 2-dimensional<br \/>\neuclidean space, the contents of a circle are one kind of open set; the boundary is<br \/>\nthe circle itself. <\/p>\n<p> Now, imagine that you&#8217;ve got a dynamical system whose phase space is<br \/>\ndefined as a topological space. The system is defined by a recurrence<br \/>\nrelation: s<sub>n+1<\/sub> = f(s<sub>n<\/sub>). Now, suppose that in this<br \/>\ndynamical system, we can expand the state function so that it works as a<br \/>\ncontinous map over sets. So if we have an open set of points A, then we can<br \/>\ntalk about the set of points that that open set will be mapped to by f. Speaking<br \/>\ninformally, we can say that if B=f(A), B is the space of points that could be mapped<br \/>\nto by points in A.<\/p>\n<p> The phase space is topologically mixing if, for any two open spaces A<br \/>\nand B, there is <em>some<\/em> integer N such that f<sup>N<\/sup>(A) &cap; B &amp;neq; 0. That is, no matter where you start,<br \/>\nno matter how far away you are from some other point, <em>eventually<\/em>,<br \/>\nyou&#8217;ll wind up arbitrarily close to that other point. <em>(Note: I originally left out the quantification of N.)<\/em><\/p>\n<p> Now, let&#8217;s put that together with the other basic properties of<br \/>\na chaotic system. In informal terms, what it means is:<\/p>\n<ol>\n<li> Exactly where you start has a huge impact on where you&#8217;ll end up.<\/li>\n<li> No matter how close together two points are, no matter how long their<br \/>\ntrajectories are close together, at any time, they <em>can<\/em><br \/>\nsuddenly go in completely different directions.<\/li>\n<li> No matter how far apart two points are, no matter how long<br \/>\ntheir trajectories stay far apart, eventually, they&#8217;ll<br \/>\nwind up in almost the same place.<\/li>\n<\/ol>\n<p> All of this is a fancy and complicated way of saying that in a chaotic<br \/>\nsystem, you never know what the heck is going to happen. No matter how long<br \/>\nthe system&#8217;s behavior appears to be perfectly stable and predictable, there&#8217;s<br \/>\nabsolutely no guarantee that the behavior is actually in a periodic orbit. It<br \/>\ncould, at any time, diverge into something totally unpredictable.<\/p>\n<p> Anyway &#8211; I&#8217;ve spent more than enough time on the definition; I think I&#8217;ve<br \/>\npretty well driven this into the ground. But I hope that in doing so, I&#8217;ve<br \/>\ngotten across the degree of unpredictability of a chaotic system. There&#8217;s a<br \/>\nreason that chaotic systems are considered to be a nightmare for numerical<br \/>\nanalysis of dynamical systems. It means that the most miniscule errors<br \/>\nin any aspect of anything will produce drastic divergence. <\/p>\n<p> So when you build a model of a chaotic system, you know that it&#8217;s going to<br \/>\nbreak down. No matter how careful you are, even if you had impossibly perfect measurements,<br \/>\njust the nature of numerical computation &#8211; the limited precision and roundoff<br \/>\nerrors of numerical representations &#8211; mean that your model is going to break.<\/p>\n<p> From here, I&#8217;m going to move from defining things to analyzing things. Chaotic<br \/>\nsystems are a nightmare for modeling. But there are ways of recognizing when<br \/>\na systems behavior is going to become chaotic. What I&#8217;m going to do next is look<br \/>\nat how we can describe and analyze systems in order to recognize and predict<br \/>\nwhen they&#8217;ll become chaotic.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The last major property of a chaotic system is topological mixing. You can think of mixing as being, in some sense, the opposite of the dense periodic orbits property. Intuitively, the dense orbits tell you that things that are arbitrarily close together for arbitrarily long periods of time can have vastly different behaviors. Mixing means [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[77],"tags":[],"class_list":["post-843","post","type-post","status-publish","format-standard","hentry","category-chaos"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p4lzZS-dB","jetpack_sharing_enabled":true,"jetpack_likes_enabled":true,"_links":{"self":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/843","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/comments?post=843"}],"version-history":[{"count":0,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/843\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/media?parent=843"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/categories?post=843"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/tags?post=843"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}