Timeline for Ways to prove an inequality
Current License: CC BY-SA 2.5
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 9, 2010 at 14:32 | history | edited | user2529 | CC BY-SA 2.5 |
added 205 characters in body
|
| Jul 9, 2010 at 14:30 | vote | accept | CommunityBot | ||
| Jul 9, 2010 at 0:17 | answer | added | Gjergji Zaimi | timeline score: 9 | |
| Jul 8, 2010 at 20:01 | answer | added | Yiftach Barnea | timeline score: 3 | |
| Jul 8, 2010 at 14:50 | answer | added | Terry Tao | timeline score: 14 | |
| Jul 8, 2010 at 2:28 | history | edited | user2529 | CC BY-SA 2.5 |
added 915 characters in body
|
| Jul 7, 2010 at 17:00 | answer | added | Kevin O'Bryant | timeline score: 2 | |
| Jul 7, 2010 at 16:44 | answer | added | SandeepJ | timeline score: 8 | |
| Jul 7, 2010 at 15:42 | answer | added | Andrey Rekalo | timeline score: 4 | |
| Jul 7, 2010 at 15:27 | comment | added | Andrés E. Caicedo | How would you call bootstrapping arguments where, for example, to prove $A\le B$ you show $A\le B+\epsilon$ for all $\epsilon$? Or (what Tao refers to as the tensor product trick) you show that for all $n$, $A^n\le CB^n$ for some constant $C$ independent of $n$? | |
| Jul 7, 2010 at 15:21 | answer | added | Max Alekseyev | timeline score: 2 | |
| Jul 7, 2010 at 15:11 | answer | added | Jonathan Kariv | timeline score: 2 | |
| Jul 7, 2010 at 15:03 | answer | added | Mariano Suárez-Álvarez | timeline score: 4 | |
| Jul 7, 2010 at 14:59 | history | asked | user2529 | CC BY-SA 2.5 |