What makes a theorem 'good'? - MathOverflow [closed] most recent 30 from http://mathoverflow.net 2013-06-19T14:41:16Z http://mathoverflow.net/feeds/question/68301 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/68301/what-makes-a-theorem-good What makes a theorem 'good'? Stanley Yao Xiao 2011-06-20T16:45:11Z 2011-06-20T17:08:37Z <p>I have been pondering the issue of what makes a theorem noteworthy. There are many famous examples of 'outstanding' theorems, such as Roth's theorem in Diophantine approximation, Szemeredi's Theorem, Vinogradov's Theorem, etc. There are also examples of theorems that are only marginal improvements despite significant effort... such as Dyson's theorem (which only improved Siegel's theorem from $2\sqrt{d}$ to $\sqrt{2d}$, where $d$ is the degree of the algebraic number being approximated). In fact I was told that Dyson gave up mathematics because he worked so hard only to get what he thought was a very small improvement. </p> <p>So what do you think is a 'good' theorem? Presumably when you set out to work out a theorem, you intend your theorem to be good. So how do you decide what is a good theorem to prove? How do you decide which results are important achievements that are noteworthy?</p> <p>Some of my criteria include:</p> <p>1) The perceived strength of the hypothesis and the conclusion. For example, the following theorem is surely not good: Suppose every element of a set $A$ is a power of 2 larger than 1. Then every element of $A$ is even. In this case the hypothesis is extremely strong, and the conclusion extremely weak. </p> <p>However, here's an example of what I consider to be an outstanding theorem, based solely on the weakness of the hypothesis and the strength of the result: Suppose $\alpha$ is an algebraic number of degree $d$, and suppose that $\epsilon > 0$. Then there exists only finitely many integers $p,q$ with $\gcd(p,q) = 1$ such that $$\displaystyle \left | \alpha - \frac{p}{q} \right| &lt; \frac{1}{q^{2 + \epsilon}}$$</p> <p>Here all we are assuming that $\alpha$ is algebraic, which is not a particularly strong assertion... but the conclusion is very strong. This is compared to Thue's theorem, Siegel's theorem, and Dyson's theorem where $2 + \epsilon$ is replaced with $d/2 + \epsilon$, $2\sqrt{d} + \epsilon$, and $\sqrt{2d} + \epsilon$ respectively.</p> <p>2) How much it improved on the previous best result. For example, Szmeredi's theorem which asserted that the assumption of a subset $A \subset \mathbb{N}$ having positive upper density is sufficient for $A$ to have arithmetic progressions of length $k$ for any $k \geq 3$ is a significant improvement over Roth's (other) theorem which asserted the same for length three arithmetic progressions. </p> <p>3) How much it spurred further research. Examples in this category could include the $h$-cobordism theorem, Falting's theorem, and Roth's theorem.</p> <p>So what qualities do you think make up a magnificent theorem and what are some examples?</p> http://mathoverflow.net/questions/68301/what-makes-a-theorem-good/68304#68304 Answer by Charles Matthews for What makes a theorem 'good'? Charles Matthews 2011-06-20T17:06:14Z 2011-06-20T17:06:14Z <p>Quadratic reciprocity and Riemann-Roch. Any theorem that still powers research a century later, in other words. But that is 'great', not just 'good'.</p>