Timeline for Examples of proofs by making reduction to a finite set [closed]
Current License: CC BY-SA 4.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 16, 2019 at 0:55 | review | Reopen votes | |||
| Sep 16, 2019 at 5:06 | |||||
| Sep 15, 2019 at 2:26 | history | closed |
LSpice Pace Nielsen darij grinberg Andrés E. Caicedo mme |
Needs more focus | |
| Sep 14, 2019 at 20:47 | answer | added | Arun Debray | timeline score: 1 | |
| Sep 14, 2019 at 17:47 | answer | added | lhf | timeline score: 2 | |
| Sep 14, 2019 at 16:03 | comment | added | polfosol | Since I am no expert I leave this as a comment rather than an answer. The proof of the Poincare conjecture comes to mind which -as described here (see the section: Transparencies), is based on reduction of different manifolds to a finite set of well-defined ones. | |
| Sep 14, 2019 at 2:18 | answer | added | Timothy Chow | timeline score: 9 | |
| Sep 14, 2019 at 2:05 | answer | added | Timothy Chow | timeline score: 6 | |
| Sep 14, 2019 at 1:58 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| Sep 14, 2019 at 1:10 | history | became hot network question | |||
| Sep 13, 2019 at 23:56 | answer | added | Wlod AA | timeline score: 5 | |
| Sep 13, 2019 at 23:18 | answer | added | Wlod AA | timeline score: 5 | |
| Sep 13, 2019 at 22:52 | answer | added | Gerry Myerson | timeline score: 5 | |
| Sep 13, 2019 at 22:17 | history | edited | kodlu | CC BY-SA 4.0 |
Spelling of planar
|
| Sep 13, 2019 at 15:44 | comment | added | user36212 | There are certainly a lot of proofs which are vaguely similar to the Four Colour Theorem; search for 'discharging method' which is a (the most common but certainly not the only) way to reduce a general graph problem to a finite set of cases to check. For a rather different example, in some sense Helfgott's proof of the weak Goldbach conjecture is of this form: he reduces the problem to checking finitely many cases and then does the check. I think this is an example of what you don't want to see (because without the finite check Helfgott still proves something; that's not true for 4CT). | |
| Sep 13, 2019 at 15:40 | review | Close votes | |||
| Sep 15, 2019 at 2:30 | |||||
| Sep 13, 2019 at 15:22 | history | edited | LSpice |
Added tag
|
|
| Sep 13, 2019 at 15:22 | comment | added | LSpice | I think that this is a very interesting question, but I think it doesn't fit the MO mission of focussed questions with a definite answer. MO has some tolerance for big-list questions, so maybe it would be appropriate if made community wiki. (You can do this by flagging your own post for moderator attention, if you agree.) | |
| Sep 13, 2019 at 15:20 | review | First posts | |||
| Sep 13, 2019 at 15:22 | |||||
| Sep 13, 2019 at 15:17 | history | asked | SomeoneHAHA | CC BY-SA 4.0 |