{"id":120,"date":"2020-11-08T05:02:54","date_gmt":"2020-11-08T05:02:54","guid":{"rendered":"https:\/\/www.perfectly-logical.com\/?p=120"},"modified":"2020-11-08T05:39:00","modified_gmt":"2020-11-08T05:39:00","slug":"tips-for-proving-statements","status":"publish","type":"post","link":"https:\/\/www.perfectly-logical.com\/index.php\/2020\/11\/08\/tips-for-proving-statements\/","title":{"rendered":"Tips for Proving Statements"},"content":{"rendered":"\n\n\n

Here are some tips from me to you that I hope will help you prove statements or be a refresher on techniques that you have at your disposal. This is by no means an all-encompassing guide on proving. This is just my experience bottled up and sent via HTML ;-).<\/p>\n\n\n\n

Dissecting a Statement<\/h2>\n\n\n\n

Math builds on itself. It is rigid and everything is clearly defined… or at least it should be. So, when you are presented with a statement that needs to be proved, read it. Note all the words that you don’t know. You should look up the definitions to these words. Then, if there are words in definitions of those words that you don’t know. Look them up. Repeat this process until you get to words that you know. Then, build yourself back up to the statement at hand. Think about what you need to prove and how what you know will help you prove the statement. <\/p>\n\n\n\n

As a side note, this also works well in life situations. <\/p>\n\n\n\n

Writing a Mathematical Proof<\/h2>\n\n\n\n

This is the structure that I use when I am attempting to prove a statement. <\/p>\n\n\n\n

  1. State what you know that is given to you by the statement. Then,\n if necessary, define variables and other objects from what you are\n given.<\/li>
  2. Continue to use what you know to arrive at the result of the\n statement, using theorems, definitions, lemmas, and so on.<\/li>
  3. Conclude your proof with “Therefore” followed with the\n proven statement.<\/li><\/ol>\n\n\n\n

    Everyone proves differently but I try to make my proofs as efficient as possible. In my opinion, you should avoid flowery statements and mentioning things that don’t pertain to the proof or what is given to you. It is a waste of space and time for you and your reader. <\/p>\n\n\n\n

    Proof by Contradiction<\/h2>\n\n\n\n

    There are some statements that are best proven by contradiction. To do this, you negate the statement then try to prove it. You know that the statement is false so there will be a contradiction as you try to prove the negated statement. Once you find the contradiction, you have proven the original statement. <\/p>\n\n\n\n

    Proof by Contrapositive<\/h2>\n\n\n\n

    Much like proving by contradiction, but you negate the statement twice. By proving the doubly negated statement, you prove the original statement since, in mathematics, the contrapositive is equivalent to the original statement. <\/p>\n\n\n\n

    Mathematical Induction<\/h2>\n\n\n\n

    There are two versions of mathematical induction: weak and strong. Technically, they are both the same but, in practice, they are different. Mathematical induction is useful in proving a statement when the statement iterates in someway that can be proven at each iteration. The following is summary of how to use weak induction which is a much more common technique of the two. <\/p>\n\n\n\n

    There are two steps to proving a statement using mathematical induction: <\/p>\n\n\n\n

    1. Prove the statement’s base case. The base case will be the lowest, or first, case that the statement is attempting to be proven at.<\/li>
    2. Assume the statement is true for k where n\u2264k. Then, prove that the statement is true for k+1. (You will use the assumption to prove this.)<\/li><\/ol>\n\n\n\n

      Here is a short example of using mathematical induction to prove a statement involving Fibonacci numbers. Remember that Fibonacci numbers are described by the formula: Fn<\/sub>=Fn-1<\/sub>+Fn-2<\/sub> where F1<\/sub>=F2<\/sub>=1. <\/p>\n\n\n\n

      Prove that F1<\/sub>+F3<\/sub>+F5<\/sub>…+F2n-1<\/sub> = F2n<\/sub> for n\u22651.<\/span><\/strong> <\/p>\n\n\n\n

      Consider F1<\/sub>+F3<\/sub>+F5<\/sub>…+F2n-1<\/sub>=F2n<\/sub>. Suppose n=1. Then, F1<\/sub>=1 and F2n<\/sub>=F2(1)<\/sub>=F2<\/sub>=1. Hence, F1<\/sub>+F3<\/sub>+F5<\/sub>…+F2n-1<\/sub>=F2n<\/sub> when n=1. <\/span> <\/p>\n\n\n\n

      Suppose F1<\/sub>+F3<\/sub>+F5<\/sub>…+F2k-1<\/sub>=F2k<\/sub> where n\u2264k. Consider F1<\/sub>+F3<\/sub>+F5<\/sub>…+F2k-1<\/sub>+F2k+1<\/sub>. Then, F1<\/sub> + F3<\/sub> + F5<\/sub> + …+ F2k-1<\/sub> + F2k+1 <\/sub>= F2k<\/sub>+F2k+1<\/sub>=F2k+2<\/sub>=F2(k+1)<\/sub>. <\/span> <\/p>\n\n\n\n

      Therefore, F1<\/sub>+F3<\/sub>+F5<\/sub>…+F2n-1<\/sub>=F2n<\/sub> for n\u22651 by mathematical induction. <\/span> <\/p>\n\n\n\n

      “If and only if” statements<\/h2>\n\n\n\n

      An if and only if statement has two directions that need to be proven since if and only if statements are particularly strong statements. For example, saying, “a number is even if and only the number is divisible by 2” means two things. It means, if a number is even, it is divisible by 2 and it means that if a number is divisible by 2 the number is even. So, in order to prove such a statement, you must prove both statements to prove the original if and only if statement. <\/p>\n\n\n\n

      \u03b5-\u03b4 Limit Proofs<\/h2>\n\n\n\n

      Below is the precise definition of a limit. <\/p>\n\n\n\n

      Let f(x) be a function and x, a, L\u2208\u211b. Then, for \"lim_{x \rightarrow a} f(x)=L\", given any real number \u03b5>0, there exists another real number \u03b4>0 so that if 0<|x-a|<\u03b4, then |f(x)-L|<\u03b5.<\/strong>
      <\/p>\n\n\n\n

      In order to prove a limit using this definition, you will want to do some scratch work on the side. This will lead to finding a delta to choose. I think it would be best to see this with an example… <\/p>\n\n\n\n

      Prove that \"lim_{x \rightarrow 1}4x+5=9\".<\/span><\/p>\n\n\n\n

      First, we need to find a \u03b4 value that we will use later in the proof so that when we consider 0<|x-a|<\u03b4, |(4x+5)-9|<\u03b5. Your goal will be to simplify |(4x+5)-9| so that the term |x-1| is included in the expression: |(4x+5)-9|=|4x-4|=|4(x-1)|= |4||x-1|. Now, take what is not |x-1| and let \u03b4 equal \u03b5 divided by what is not |x-1| which is 4 in this case. So, we want to choose a \u03b4=\"\frac{ε}{4}\". With our \u03b4 in hand, we are ready to write the formal proof.<\/span><\/p>\n\n\n\n

      Let \u03b5\u2208\u211b, \u03b5>0, and \u03b4=\"\frac{ε}{4}\". Then, since \u03b5>0 and \u03b4=\"\frac{ε}{4}\", \u03b4>0. Consider |x-1|< \u03b4. So, |x-1|<\u03b4=\"\frac{ε}{4}\", 4|x-1|<\u03b5, |4x-4|<\u03b5, and |4x+5-9|<\u03b5. <\/span> <\/p>\n\n\n\n

      Therefore, \"lim_{x \rightarrow 1}{4x+5}=9\". <\/span> <\/p>\n\n\n\n

      In general, you will be doing some scratch work for \u03b5-\u03b4 proofs to find a proper \u03b4 to choose. <\/p>\n\n\n\n

      Vacuous Proofs<\/h2>\n\n\n\n

      A statement that can not be proven false is said to be true is called a vacuous statement. <\/p>\n","protected":false},"excerpt":{"rendered":"

      Here are some tips from me to you that I hope will help you prove statements or be a refresher on techniques that you have at your disposal. This is by no means an all-encompassing guide on proving. This is just my experience bottled up and sent via HTML ;-). Dissecting a Statement Math builds […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6,31],"tags":[17,19,8,18,20],"class_list":["post-120","post","type-post","status-publish","format-standard","hentry","category-math","category-tips","tag-help","tag-logic","tag-math","tag-prooving","tag-statement"],"_links":{"self":[{"href":"https:\/\/www.perfectly-logical.com\/index.php\/wp-json\/wp\/v2\/posts\/120","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.perfectly-logical.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.perfectly-logical.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.perfectly-logical.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.perfectly-logical.com\/index.php\/wp-json\/wp\/v2\/comments?post=120"}],"version-history":[{"count":4,"href":"https:\/\/www.perfectly-logical.com\/index.php\/wp-json\/wp\/v2\/posts\/120\/revisions"}],"predecessor-version":[{"id":129,"href":"https:\/\/www.perfectly-logical.com\/index.php\/wp-json\/wp\/v2\/posts\/120\/revisions\/129"}],"wp:attachment":[{"href":"https:\/\/www.perfectly-logical.com\/index.php\/wp-json\/wp\/v2\/media?parent=120"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.perfectly-logical.com\/index.php\/wp-json\/wp\/v2\/categories?post=120"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.perfectly-logical.com\/index.php\/wp-json\/wp\/v2\/tags?post=120"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}