Timeline for Quick proofs of hard theorems
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Feb 13, 2014 at 22:37 | comment | added | Greg Friedman | It's also possible to more-or-less avoid complex analysis machinery and get at this via fundamental groups. There's a nice proof in Hatcher. | |
| Jan 25, 2011 at 0:43 | comment | added | Todd Trimble | Of course there are many proofs of the fundamental theorem of algebra. Recently I have come to like those that hinge on openness of holomorphic mappings: if f is polynomial, there cannot be a nonzero minimum value |f(z_0)|, because f takes an open neighborhood of z_0 to an open neighborhood of f(z_0). For a very elementary proof based on a similar idea, see ncatlab.org/nlab/show/… | |
| May 19, 2010 at 12:35 | history | undeleted | Regenbogen | ||
| May 19, 2010 at 12:03 | history | deleted | Regenbogen | ||
| May 18, 2010 at 6:10 | comment | added | Matt | Also, there is the Rouche's Theorem method in a similar vein. | |
| May 16, 2010 at 21:39 | history | edited | Harald Hanche-Olsen | CC BY-SA 2.5 |
Link to Schep's variant
|
| May 16, 2010 at 20:32 | history | answered | Regenbogen | CC BY-SA 2.5 |