The Book of Mathematical Proofs/Proof style

From testwiki
Revision as of 08:04, 22 December 2007 by imported>Shahab (Notes: added a note)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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


The square root of 2 is irrational theorem


The square root of 2 is irrational, 2

Proof

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

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

Since the left-hand side of the equation is divisible by 2, then so must the right-hand side, i.e., 2|a2. Since 2 is prime, we must have that 2|a.

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

Dividing both sides with 2 yields b2=2a2, 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 were 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.