Everything to learn better...

Home

Maths

Proof II

Criticising proofs

Criticising proofs

Select Lesson

Exam Board

Select an option

Explainer Video

Loading...
Tutor: Dylan

Summary

Criticising proofs

​​In a nutshell

You need to be able to follow the logical steps in a proof, and identify where mistakes have been made in the proofs of others.



Implication notation

Given statements AA​ and BB​, the following arrow symbols can be used to indicate ways in which they relate to each other:


A BA \implies B​​

"AA​ implies BB​" - this means that if AA​ is true, then BB​ is also true.

A BA \impliedby B​​

"BB implies AA​" - this means that if BB​ is true, then AA​ is also true.

A BA \iff B​​

"AA​ if and only if BB​" - AA​ and BB​ are logically equivalent, i.e. one is true if and only if the other is true.



Negating statements

Suppose you have a statement of the form: "for all xx, P(x)P(x)" where P(x)P(x)​ is some statement dependent on xx​. The negation of this statement would not be of the form "for all xx​, ¬P(x)¬P(x)​" (where ¬P(x)¬P(x)​ is the negation of P(x)P(x)​). This is far stronger than is necessary to negate this; in fact, the negation would be "there exists an xx such that ¬P(x)¬P(x)​", as either P(x)P(x)​ is true for any xx​, or there exists an xx​ such that ¬P(x)¬P(x)​.


​​Example 1

Identify the error in the following attempt to prove that the sum of all the proper divisors of any positive integer is not equal to the integer itself.

(A proper divisor of a positive integer is another integer which divides it that is not equal to the integer itself.)


The proof proceeds by contradiction; assume the negation of the statement, i.e. that the sum of the proper divisors of any proper integer is equal to the integer itself. Consider any prime number pp. Its only proper divisor is 11​, but p1p \ne 1, so this is a contradiction, as you have assumed that the proper divisors of any number add to the number itself.


Therefore, the sum of the proper divisors of any integer is not equal to the integer itself.


The flaw in the proof comes at the point the negation is assumed: the negation of "the sum of all the proper divisors of any positive integer does not equal the integer itself" is "there exists an integer such that the sum of all its proper divisors does equal the integer". This statement cannot be used to derive a contradiction, as it is in fact true, e.g. 66, 2828, 496496, and many more.


Therefore, the error in the attempted proof is incorrectly negating the statement while trying to derive a contradiction.


Example 2

Identify the error in the following proof that 1=01 = 0​:


Let x=1x = 1​.


1=x 1x2=xx2 (1x)(1+x)=x(1x) 1+x=x 1=0\begin{aligned}1 &= x\\\iff1 - x^2 &= x - x^2\\\iff (1-x)(1+x) &= x(1-x)\\\iff1 + x &= x\\\iff 1 &= 0\end{aligned}


The error comes in dividing by 1x1-x - this is equal to 00, so you cannot divide by it.


Therefore, the error comes in dividing by zero.


Create an account to read the summary

Exercises

Create an account to complete the exercises

FAQs - Frequently Asked Questions

Does taking the negation of something twice leave it unchanged?

Why is the negation of a "for all" statement a "there exists" statement?

What is the negation of "for all x, P(x)"?

Beta

I'm Vulpy, your AI study buddy! Let's study together.