Timeline for Examples of major theorems with very hard proofs that have not dramatically improved over time
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 21, 2013 at 17:29 | comment | added | Gil Kalai | No no, Furstenberg's proof is indeed simpler (and there is a further simplification of his approach); The proof based on hypergraph regularity is also simpler than Endre's original proof. So is the polymath1 proof. (The last two are easier than the ergodic theoretic proof) So we do have several dramatic simplifications but none that can be presented in 4 hours. | |
| Dec 21, 2013 at 15:55 | comment | added | Asaf | Furstenberg's proof is much easier than Szemeradi's, and probably much more conceptual and influential (i.e. the Green-Tao theorem). But probably Gil wanted the improved proof to be in the same "flavour", and not doing a radical change as Hillel have done. | |
| Dec 20, 2013 at 16:15 | comment | added | Allen Knutson | Oops, I meant to include the "I'm not an expert" caveat! | |
| Dec 20, 2013 at 14:10 | comment | added | Gil Kalai | Dear Allen, This remarks referred to Endre's original proof. There are substantially simpler proofs available now. (But it would be great to have a proof that you can present in 4 hours, say.) | |
| S Dec 20, 2013 at 12:59 | history | answered | Allen Knutson | CC BY-SA 3.0 | |
| S Dec 20, 2013 at 12:59 | history | made wiki | Post Made Community Wiki by Allen Knutson |