{"id":1450,"date":"2017-11-14T12:34:01","date_gmt":"2017-11-14T17:34:01","guid":{"rendered":"http:\/\/blog.richmond.edu\/math320\/?p=1450"},"modified":"2017-11-26T12:37:46","modified_gmt":"2017-11-26T17:37:46","slug":"muddiest-point-11917","status":"publish","type":"post","link":"https:\/\/blog.richmond.edu\/math320\/2017\/11\/14\/muddiest-point-11917\/","title":{"rendered":"Muddiest Point 11\/9\/17"},"content":{"rendered":"<p>Any point that warrants use of more than one analogy is probably a fairly &#8220;muddy&#8221; point. In class, we discussed the negation of uniform convergence using a cattle analogy. For uniform convergence the idea is, if each cow is a value of x, and <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=f_n%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"f_n(x)\" class=\"latex\" \/> marks the positions of the cows at time <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"n\" class=\"latex\" \/> as they are herded to their final locations <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=f%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"f(x)\" class=\"latex\" \/>, then for each distance\u00a0<img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;epsilon\" class=\"latex\" \/> from the final location, there is some time <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=N&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"N\" class=\"latex\" \/> after which all cattle will be within <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;epsilon\" class=\"latex\" \/> of their final location. If the cattle do NOT uniformly converge, then there is no point in time that all cattle are within <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;epsilon\" class=\"latex\" \/> of <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=f%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"f(x)\" class=\"latex\" \/>. In other words, for all times <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=N&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"N\" class=\"latex\" \/>, there is one cow that is at is at least some distance <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon_0&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;epsilon_0\" class=\"latex\" \/> from its final position.<\/p>\n<p>Using the same analogy, pointwise convergence implies that each cow approaches a final location; for each distance <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;epsilon\" class=\"latex\" \/>, each cow has some time-value <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=N&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"N\" class=\"latex\" \/> after which that cow is within <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5Cepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;epsilon\" class=\"latex\" \/> of its own <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=f%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"f(x)\" class=\"latex\" \/>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Any point that warrants use of more than one analogy is probably a fairly &#8220;muddy&#8221; point. In class, we discussed the negation of uniform convergence using a cattle analogy. For uniform convergence the idea is, if each cow is a value of x, and marks the positions of the cows at time as they are [&hellip;]<\/p>\n","protected":false},"author":3531,"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":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[58822],"tags":[],"class_list":["post-1450","post","type-post","status-publish","format-standard","hentry","category-muddiest-point"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p7L4E1-no","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/posts\/1450","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/users\/3531"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/comments?post=1450"}],"version-history":[{"count":0,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/posts\/1450\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/media?parent=1450"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/categories?post=1450"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/tags?post=1450"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}