Reductio ad absurdum

(Difference between revisions)
Jump to: navigation, search
(wording)
(one more improvement: "q=" right next to arithmetic expression)
Line 13: Line 13:
 
* Assume there are finitely many prime numbers; in particular, say there are ''N'' of them.
 
* Assume there are finitely many prime numbers; in particular, say there are ''N'' of them.
 
* We can therefore list all ''N'' prime numbers: 2, 3, 5, 7,&nbsp;..., ''p''<sub>''N''</sub>. (Note that the proof doesn't rely on knowing the actual value of any of the primes. The list given here is merely to illustrate the argument.)
 
* We can therefore list all ''N'' prime numbers: 2, 3, 5, 7,&nbsp;..., ''p''<sub>''N''</sub>. (Note that the proof doesn't rely on knowing the actual value of any of the primes. The list given here is merely to illustrate the argument.)
* Consider a number ''q'' that is one greater than the product of all these prime numbers: (2&nbsp;&times;&nbsp;3&nbsp;&times;&nbsp;5&nbsp;&times;&nbsp;7&nbsp;&times;&nbsp;&middot;&middot;&middot;&nbsp;&times;&nbsp;''p''<sub>''N''</sub>)&nbsp;+&nbsp;1.
+
* Consider a number ''q'' that is one greater than the product of all these prime numbers: ''q''&nbsp;=&nbsp;(2&nbsp;&times;&nbsp;3&nbsp;&times;&nbsp;5&nbsp;&times;&nbsp;7&nbsp;&times;&nbsp;&middot;&middot;&middot;&nbsp;&times;&nbsp;''p''<sub>''N''</sub>)&nbsp;+&nbsp;1.
 
* Clearly ''q'' is greater than ''p''<sub>''N''</sub> and thus cannot be prime (since ''p''<sub>''N''</sub> was the largest prime).
 
* Clearly ''q'' is greater than ''p''<sub>''N''</sub> and thus cannot be prime (since ''p''<sub>''N''</sub> was the largest prime).
 
* This means that ''q'' must be divisible by one of our listed primes. (By definition, if ''q'' is greater than 1 and not prime, it must be divisible by some number other than 1 and itself. But by a separate argument not reproduced here, every non-prime number greater than 1 must be divisible by at least one prime. Thus it suffices to check whether ''q'' is divisible by any of our prime numbers.)
 
* This means that ''q'' must be divisible by one of our listed primes. (By definition, if ''q'' is greater than 1 and not prime, it must be divisible by some number other than 1 and itself. But by a separate argument not reproduced here, every non-prime number greater than 1 must be divisible by at least one prime. Thus it suffices to check whether ''q'' is divisible by any of our prime numbers.)

Revision as of 04:43, 22 October 2010

Wikipedia-logo-en.png
For more information, see the Wikipedia article:

Reductio ad absurdum is a type of logical argument where one assumes a claim for the sake of argument, arrives at an "absurd" result (often a contradiction), and then concludes that the original assumption must have been wrong, since it led to this absurd result.

This is a logically valid technique that usually takes the form:

  • Assume P is true.
  • From this assumption, deduce that Q is true.
  • Also deduce that Q is false.
  • Thus, P implies both Q and not Q (a contradiction, which is necessarily false).
  • Use modus tollens to conclude that P itself must be false.

An example of this type of argument (from number theory) follows. It proves that there are infinitely many prime numbers by first assuming the opposite. Note that the term number is being used here to refer to positive integers only.

  • Assume there are finitely many prime numbers; in particular, say there are N of them.
  • We can therefore list all N prime numbers: 2, 3, 5, 7, ..., pN. (Note that the proof doesn't rely on knowing the actual value of any of the primes. The list given here is merely to illustrate the argument.)
  • Consider a number q that is one greater than the product of all these prime numbers: q = (2 × 3 × 5 × 7 × ··· × pN) + 1.
  • Clearly q is greater than pN and thus cannot be prime (since pN was the largest prime).
  • This means that q must be divisible by one of our listed primes. (By definition, if q is greater than 1 and not prime, it must be divisible by some number other than 1 and itself. But by a separate argument not reproduced here, every non-prime number greater than 1 must be divisible by at least one prime. Thus it suffices to check whether q is divisible by any of our prime numbers.)
  • Note that q is not divisible by any of the listed primes, since the remainder, when q is divided by any the primes, will always be 1. (For example, q divided by 2 gives the quotient 3 × 5 × 7 × ··· × pN, with remainder 1.)
  • Thus assuming finitely many primes we have deduced that there is a number q that is both divisible by one of our primes and not divisible by any of our primes. This is a contradiction.
  • Therefore, we have to reject our original assumption. There must be infinitely many prime numbers.

(This is essentially Euclid's proof of the same result from The Elements.)

Counter-apologetics

See Can God create a rock so heavy that he can't lift it? for an example in the context of counter-apologetics (the claim being assumed is that God is all-powerful).

The problem with this type of argument is that the "absurdity" one reaches must actually be a logical contradiction in order for the argument to be valid. If the consequence is simply unlikely, then the argument doesn't necessarily work. For example:

  • If God doesn't exist, then life arose by purely natural means.
  • This is absurd (read: very, very unlikely).
  • Therefore, God exists.

Well... no. Ignoring the fact that the premise is faulty (as its possible, however unlikely that life arose by something other than purely natural means) the absurdity is not shown. The assertion that its absurd is only used to come to the conclusion that God did it. The person that would be making this argument does not know how life arose, so to assume anything other than a deity seems absurd. (See: God of the gaps)

Personal tools
Namespaces
Variants
Actions
wiki navigation
IronChariots.Org
Toolbox