Which are the deepest theorems with the most elementary proofs?
I give two examples:
i) Proof_of_the_Euler_product_formula_for_the_Riemann_zeta_function
ii) Proof that the halting problem is undecidable using diagonalization
Deepest theorems with simplest proofs
4
$\begingroup$
soft-question
elementary-number-theory
intuition
-
5This should be community wiki, I think. – 2011-10-22
-
1Proving the incompleteness theorems requires a little more than just diagonalization. – 2011-10-22
-
0Something like this got asked in MO IIRC. Now if only I could find it... – 2011-10-22
-
2Isn't depth, by definition, inversely proportional to the elementariness of proofs? – 2011-10-22
-
0How do you define the "deapness" of a proof or of a theorem? – 2011-10-22
-
2If you read Spivak's "Calculus on Manifolds", he specifically structures the whole book around making Stokes' Theorem trivial to prove... does that count? – 2011-10-22
-
1@detly I don't know the particular example to which you are referring, but I don't think it counts as "simple" if you tuck away all the hard work in lemma after lemma and use them produce a two-line proof of a big result. – 2011-10-23
-
0I am sure this is not what you had in mind, but I am tempted to mention the "elementary" proofs of the Prime Number Theorem due to Erdős and Selberg. :) – 2011-10-23
-
0possible duplicate of [Surprising Generalizations](http://math.stackexchange.com/questions/1352/surprising-generalizations) – 2011-10-23
-
1Why is this closed? Reopen, thank you. Leave reason if you vote to close? – 2011-10-26
-
4How about "reopen, please"?!? Also "PLZ reopen" in the title is obnoxious. – 2011-10-26
-
6@GM2001: Please stop editing titles to contain messages like "AWESOME" or " REOPEN !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!...please!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!". This is not the first time you're doing it. – 2011-10-26
-
7@GM2001: If you edit this question any more, I will lock it, which will prevent further edits, comments, and answers. – 2011-10-26