{"id":1641,"date":"2017-12-05T00:28:48","date_gmt":"2017-12-05T05:28:48","guid":{"rendered":"http:\/\/blog.richmond.edu\/math320\/?p=1641"},"modified":"2017-12-06T19:16:53","modified_gmt":"2017-12-07T00:16:53","slug":"muddiest-point-1130","status":"publish","type":"post","link":"https:\/\/blog.richmond.edu\/math320\/2017\/12\/05\/muddiest-point-1130\/","title":{"rendered":"Muddiest Point 11\/30"},"content":{"rendered":"

I thought that the muddiest point from last Thursday’s class was when we went over proving that \"\int. The reason why I thought that this was the muddiest is because the proof required to cases. A case in which k was negative and a case that case was positive . This is often a detail that is easy to look over as it seems so trivial which is why it is important to go over it. To start the proof we assume that f is integrable and that \"k>0\". Then we see that \"U(kf,P). We already know from earlier this semester that \"csup(A) therefore we can say that $latex\u00a0sup\\{kf(x): x \\in [x_{k-1},x_k] \\} = ksup\\{f(x): x \\in [x_{k-1},x_k] \\}$ and in turn \"U(kf,P). we can use the same logic for the lower sums as well. Since\u00a0\"L(kf,P) we can once again use our knowledge about infinums and supremums from earlier in the semester that \"kinf(A) to justify the statement that\u00a0\"inf\{kf(x): and \"L(kf,P). Since the lower sums and Upper sums are unchanged by the location of the \"k\" we can conclude that if \"k\" is positive then\u00a0\"\int and that there exists a partition \"P_n\" such that $ \\lim_{n \\to \\infty} [U(kf, P_n) \u2212 L(kf, P_n)] = \\lim_{n \\to \\infty} k[U(f,P_n) \u2212 L(f,P_n)] = 0$. Now we must consider the case that \"k\" is negative. If k is negative \"U(f,p)\" will be flipped when multiplied by k and in turn \"L(f,P)\" will be flipped when multiplied by \"k\". This distinction is important to make and is why the second case is needed. With the lower and upper sums flipped by the multiplication by \"k\" we now have that \"U(kf,P) and \"kU(f,P). Therefore it is still the case that\u00a0$ \\lim_{n \\rightarrow \\infty} [U(kf, P_n) \u2212 L(kf, P_n)] = \\lim_{n \\rightarrow \\infty} k[U(f,P_n) \u2212 L(f,P_n)] = 0$. So we can conclude that\u00a0\"\int regardless of the value of \"k\".<\/p>\n","protected":false},"excerpt":{"rendered":"

I thought that the muddiest point from last Thursday’s class was when we went over proving that . The reason why I thought that this was the muddiest is because the proof required to cases. A case in which k was negative and a case that case was positive . This is often a detail […]<\/p>\n","protected":false},"author":3524,"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-1641","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-qt","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/posts\/1641","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\/3524"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/comments?post=1641"}],"version-history":[{"count":0,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/posts\/1641\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/media?parent=1641"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/categories?post=1641"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/tags?post=1641"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}