Famous Theorems of Mathematics/Proof style: Difference between revisions

From testwiki
Jump to navigation Jump to search
imported>THNTU
 
(No difference)

Latest revision as of 11:19, 3 December 2019

This is an example on how to design proofs. Another one is needed for definitions and axioms.

Irrationality of the square root of 2

The square root of 2 is irrational, 2

Proof

This is a proof by contradiction, so we assume that 2 and hence 2=ab for some a, b that are coprime.

This implies that 2=a2b2. Rewriting this gives 2b2=a2.

Since b2, we have that 2|a2. Since 2 is prime, 2 must be one of the prime factors of a2, which are also the prime factors of a, thus, 2|a.

So we may substitute a with 2k,k, and we have that 2b2=4k2.

Dividing both sides with 2 yields b2=2k2, and using similar arguments as above, we conclude that 2|b.

Here we have a contradiction; we assumed that a and b were coprime, but we have that 2|a and 2|b.

Hence, the assumption was false, and 2 cannot be written as a rational number. Hence, it is irrational.

Notes

  • As a generalization one can show that the square root of every prime number is irrational.
  • Another way to prove the same result is to show that x22 is an irreducible polynomial in the field of rationals using Eisenstein's criterion.

Template:BookCat