{"id":731,"date":"2017-09-05T09:57:21","date_gmt":"2017-09-05T13:57:21","guid":{"rendered":"http:\/\/blog.richmond.edu\/math320\/?p=731"},"modified":"2017-09-05T12:33:44","modified_gmt":"2017-09-05T16:33:44","slug":"muddiest-point-2","status":"publish","type":"post","link":"https:\/\/blog.richmond.edu\/math320\/2017\/09\/05\/muddiest-point-2\/","title":{"rendered":"Muddiest Point."},"content":{"rendered":"

I thought the muddiest part of the class on Thursday was the second part of the proof for showing that \"sup(ca). The reason why I thought this was the muddiest point is because it is easy to confuse the difference between the upper-bound and the least upper-bound of a set and that once you have shown that something is the upper-bound of a set it is easy to forget that you must show that it is the least upper-bound.
\nThe reason why there is a second part of this proof is that in the first part we have only shown that \"cs\" is an upper-bound of set \"cA\", where \"s and \"c. In order to complete the proof we must show that \"cs\" is the least upper bound which as the name indicates means that \"cs\" is less than all other upper-bounds for the set \"cA\". This is the difference between an upper-bound and a least upper-bound. Once we know that we must show that \"cs\" is a least upper-bound we start by letting \"d\" be and upper-bound for \"cA\". Now we have two different cases. One where \"c and the other where \"c> because as you will see the mathematics are different for each case. For the case that \"c>0\" we know that \"d\geq \"\forall. Then by dividing by c we can see that \"\frac{d}{c} \"\forall. This means that \"\frac{d}{c}\" is an upper-bound for \"A\" which means \"s since we already know s is the least upper-bound of \"A\". Now with the inequality \"s we can multiply both sides by \"c\" and we see that \"cs. Now we know that \"cs\" is the least upper-bound if \"c>0\", so now we must do the case that \"c. If \"c then \"cs. From here it is easy to deduce that \"d because \"d.Now it is apparent why two cases are needed. As you can see the case where \"c>0\" cannot be done if \"c\" could be zero as that would involve dividing by zero. In addition to this the case where \"c is much simpler due to the nature of multiplying by zero.<\/p>\n

 <\/p>\n","protected":false},"excerpt":{"rendered":"

I thought the muddiest part of the class on Thursday was the second part of the proof for showing that . The reason why I thought this was the muddiest point is because it is easy to confuse the difference between the upper-bound and the least upper-bound of a set and that once you have […]<\/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-731","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-bN","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/posts\/731","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=731"}],"version-history":[{"count":0,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/posts\/731\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/media?parent=731"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/categories?post=731"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.richmond.edu\/math320\/wp-json\/wp\/v2\/tags?post=731"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}