Difference between revisions of "Diagonalization"

From Conservapedia
Jump to navigation Jump to search
(Fixed this load of absolute rubbish.)
Line 2: Line 2:
  
 
==Proof of the non-countability of real numbers==
 
==Proof of the non-countability of real numbers==
−
There exists a map <math>f:[0,1]\rightarrow\mathbb{R}</math> (in fact all infintitly supported probability distribution does this). Therefor there are as many number in <math>[0,1]</math> as <math>\mathbb{R}</math>.
+
There exists a map <math>f:[0,1]\rightarrow\mathbb{R}</math> (in fact all infinitly supported probability distribution does this). Therefor there are as many number in <math>[0,1]</math> as <math>\mathbb{R}</math>.
  
 
We will now use [[proof by contradiction]] to show that the numbers in <math>[0,1]</math> are uncountable.
 
We will now use [[proof by contradiction]] to show that the numbers in <math>[0,1]</math> are uncountable.

Revision as of 00:00, June 15, 2008

Diagonalization is a technique first used by George Cantor, a German mathematician. He used it to show that the cardinality of the real numbers is not equal to the cardinality of the natural numbers, thereby demonstrating the real numbers are not countable.

Proof of the non-countability of real numbers

There exists a map (in fact all infinitly supported probability distribution does this). Therefor there are as many number in as .

We will now use proof by contradiction to show that the numbers in are uncountable.

Assume that that they are countable then we can list them as such,

Where

Construct the number,

, where


when and when .

Therefor is not in the list and so we have a contradition so our assumption is false hand the number are not countable. Therefor is uncountable.

References

Komolgorov, Introduction to Real Analysis. (You can find it inalmost any book store).