# Quick proofs of hard theorems

Mathematics is rife with the fruit of abstraction. Many problems which first are solved via "direct" methods (long and difficult calculations, tricky estimates, and gritty technical theorems) later turn out to follow beautifully from basic properties of simple devices, though it often takes some work to set up the new machinery. I would like to hear about some examples of problems which were originally solved using arduous direct techniques, but were later found to be corollaries of more sophisticated results.

I am not as interested in problems which motivated the development of complex machinery that eventually solved them, such as the Poincare conjecture in dimension five or higher (which motivated the development of surgery theory) or the Weil conjectures (which motivated the development of l-adic and other cohomology theories). I would also prefer results which really did have difficult solutions before the quick proofs were found. Finally, I insist that the proofs really be quick (it should be possible to explain it in a few sentences granting the machinery on which it depends) but certainly not necessarily easy (i.e. it is fine if the machinery is extremely difficult to construct).

In summary, I'm looking for results that everyone thought was really hard but which turned out to be almost trivial (or at least natural) when looked at in the right way. I'll post an answer which gives what I would consider to be an example.

I decided to make this a community wiki, and I think the usual "one example per answer" guideline makes sense here.

Here is my example. In the 1930's (I think), Wiener gave a proof that if $f$ is a continuous nonvanishing function on the circle with absolutely convergent Fourier series, then so is $1/f$. The proof was a long piece of hard analysis, involving detailed local calculations and complicated estimates. Later (in the 1940's?), Gelfand found that the statement follows from the basic theory of Banach algebras as follows. The functions on the circle with absolutely convergent Fourier series can be characterized as the image of the Gelfand transform $\Gamma: l^1(\mathbb{Z}) \to C(S^1)$. In general if $\Gamma: B \to C(M)$ is the Gelfand transform from a commutative Banach algebra to the ring of continuous functions on its maximal ideal space, then $x$ is invertible in $B$ if and only if $\Gamma(x)$ is invertible in $C(M)$. So the hypotheses on $f$ imply that $f = \Gamma(x)$ for some invertible $x$ in $l^1(\mathbb{Z})$, and a simple calculation shows that $1/f = \Gamma(x^{-1})$.

• Gelfand's result was first published in 1939 ("On normed rings" announces the basics of the new theory, "To the theory of normed rings II" has this application and more), although a 1941 paper ("Normierte Ringe") which provides more details and proofs seems to be more often cited. These are in the Collected papers, volume 1. May 17, 2010 at 1:01
• For Wiener's proof, see Lemma IIe in "Tauberian theorems", 1932: jstor.org/stable/1968102. May 17, 2010 at 1:12
• It's a great example, of course. The Banach algebra in question is $l^1$ with the algebra multiplication being convolution. I haven't looked at this in a while, but when I did look at Weiner's original work, it struck me that he was using convolution in a very modern way -- the whole argument was based on properties of convolution, and the algebraic properties in particular were key. I've occasionally wondered if Gelfand noticed this aspect and if it was in any way an inspiration for what he did. May 30, 2010 at 14:59

There is a theorem in finite group theory, that if $$a$$, $$b$$, and $$c$$ are integers all greater than $$1$$, there exists a finite group $$G$$ with elements $$x$$ and $$y$$ such that: $$x$$ has order $$a$$, $$y$$ has order $$b$$, and $$xy$$ has order $$c$$. I think the first person to prove this was G.A. Miller, whose proof looked at lots of separate cases, and had tons of long, tedious calculations in symmetric groups (I will try and find the paper and post the reference later). I don't know who discovered the more modern proofs, but Derek Holt posted a proof on the group-pub that is one of the most elegant things I've ever seen. Unfortunately, it doesn't seem to be available on the archive of the list, so I will just post it here verbatim:

Let $$q$$ be a prime power such that $$q-1$$ is divisible by $$2a$$, $$2b$$, and $$2c$$. We will construct elements $$x, y$$ of $$\operatorname{SL}(2,q)$$ such that $$x$$, $$y$$, and $$xy$$ have orders $$2a$$, $$2b$$, and $$2c$$, and then the images of $$x,y,xy$$ in $$\operatorname{PSL}(2,q)$$ will have orders $$a$$, $$b$$, and $$c$$ as required.

An element of $$\operatorname{SL}(2,q)$$ with distinct eigenvalues is diagonalizable in $$\operatorname{GL}(2,q)$$, and so its order is determined by its characteristic polynomial which is determined by its trace. In particular, since $$2a,2b,2c > 2$$, this applies to elements with these orders.

Let $$u$$ and $$v$$ be elements of the field $$\mathbb{F}_q$$ with multiplicative orders $$2a$$ and $$2b$$, and let $$x = \left( \begin{array}{cc} u & 1 \\ 0 & u^{-1} \end{array} \right)$$ and $$y = \left( \begin{array}{cc} v & 0 \\ t & v^{-1} \end{array} \right)$$ be in $$\operatorname{SL}(2,q)$$, where $$t$$ remains to be chosen. Then $$x$$ and $$y$$ have orders $$2a$$ and $$2b$$.

The trace of $$xy$$ is $$uv + t + u^{-1}v^{-1}$$, and so by suitable choice of $$t$$, we can make this equal to any value we like. So we can make it equal to the trace of an element of $$\operatorname{SL}(2,q)$$ with order $$2c$$, and then $$xy$$ will have order 2c.

• Nice! I can't help but feel like there should be a geometric proof based on looking at triangle groups: en.wikipedia.org/wiki/Triangle_group#von_Dyck_groups May 16, 2010 at 22:27
• Yes, you can do it with triangle groups; the hyperbolic case follows since those triangle groups are residually finite (basically my Malcev's theorem), and then you can do the spherical (already finite) and euclidean cases by hand. May 16, 2010 at 22:41
• (Or observe that the spherical and Euclidean cases are also residually finite. All these groups are linear!)
– HJRW
May 16, 2010 at 23:07
• Do you think that the theorem is hard or is it just the case of a messy initial proof? After all, both Steve's approach rely on methods from the 19th century. May 17, 2010 at 23:20
• Ha! I'd never seen a proof of this. It's an exercise in one of the group-theory texts I used (Alperin & Bell or Herstein—I don't remember which), with some teasing hint that it'll probably be difficult. Dec 24, 2013 at 17:41

Cantor's proof of the existence of transcendental numbers. With a (now) obvious one-line argument he showed that there are uncountably many of them --- when Liouville, Hermite and others had to take (putative) transcendental numbers one at a time ...

Newman's argument (especially Korevaar's and Zagier's version of it) turned the Prime Number Theorem, which took a century to be proved, into something that can be explained in a few minutes to any graduate student.

• Actually, Liouville's method already gives an uncountable infinity (although no one could have phrased it that way at the time). Mar 14, 2017 at 11:15
• Cantor's argument shows not only that there are uncountably many transcendental numbers, but co-countably many, a stronger result. Nov 16, 2017 at 21:33
• I'm not totally clear on this, but I have the impression that Cantor's proof used axiom of choice, while the work of Liouville didn't rely on that. Dec 2, 2019 at 23:38
• @WhatsUp No, it didn't - it's a direct consequence of the uncountability of the reals (which doesn't need choice), the fact that the union of two countable sets is countable (which also doesn't need choice), and the countability of the set of algebraic numbers (which also doesn't need choice - this is the only nontrivial bit, but the point is that we can whip up a totally concrete enumeration of the algebraic numbers). Feb 6, 2020 at 19:42
• @WhatsUp The diagonal method does not need choice to construct a transcendental - it gives a mechanism for doing so explicitly given any enumeration of the algebraic reals, and we cap produce such an enumeration without using choice. Feb 7, 2020 at 2:41

In 1917 Hardy and Ramanujan proved that all but $$o(x)$$ integers $$n \leq x$$ have $$\log\log n + O((\log\log n)^{1/2 + \epsilon})$$ distinct prime factors. The proof was long and relied on establishing (by induction!) an precise bound for the number of integers with exactly $$k$$ distinct prime factors (with $$k$$ arbitrary, and possibly tending to infinity with $$x$$). A short "two-line" proof was found by Turan in 1934.

Hardy disliked Turan's proof, because as he claimed, it did not give proper insight. However as it turned it was Turan's method that was prone to generalization. Twenty years later his inequality became the more general Turan-Kubilius inequality. Curiously enough it was later realized by Elliott that taking the "dual" of Turan-Kubilius's inequality yields immediately the arithmetic large sieve inequality! :-)

• As Persi Diaconis puts it (when discussing Hardy-Ramanujan's proof): "Impressive as the argument is, to a probabilist, the project seems out of focus; they are proving the weak law of large numbers by using the local central limit theorem. If all that is wanted is their theorem, there are much easier arguments. With all their work, one could reach much stronger conclusions". See www-stat.stanford.edu/~cgates/PERSI/papers/Hardy.pdf for the rest of Persi's nice article.
– maks
May 16, 2010 at 23:42

The Nielsen-Schreier subgroup theorem: subgroups of free groups are free. This has a very quick proof using the fact that a group is free precisely when it acts freely and without inversions on a tree.

• A fact which is itself easy to prove. May 17, 2010 at 15:23

The Cayley-Hamilton theorem. Apparently, Cayley only proved it for $2\times2$ and - in a horrendous calculation - for $3\times3$ matrices and then wrote something outrageous in the spirit of "and similarly, we can prove it for any $n$". Hamilton then proved another special case in a paper on linear operators on the space of quaternions. Nowadays, it is proven in full generality in just a couple of lines, using the fact that the set of diagonalisable matrices of a given dimension, for which the theorem is trivially true, is dense in the set of all matrices of the same dimension.

• Is there an easy and elementary proof that the diagonal matrices are Zariski dense? Oct 5, 2010 at 12:17
• The map that assigns to a matrix the discriminant of its characteristic polynomial is a polynomial function in the entries, hence continuous. Over an algebraically closed field, the set of non-diagonalisable matrices is the pre-image of 0 under this map, since a matrix is diagonalisable if and only if it has distinct eigenvalues. The assertion now easily follows. You have two options: either working over the complex numbers (a pretty cute little argument, also only 3 lines, reduces to this case) and then you can even use the Euclidean topology on C^{n^2}, or working with the Zariski topology. Oct 5, 2010 at 13:08
• @Alex: I think you mean the discriminant of its minimal polynomial. Oct 11, 2010 at 7:41
• I think I like the argument using the Zariski topology better. It is very direct. Let $c(t)$ be the characteristic polynomial function, let $f_{ij}$ be the polynomial map $a \mapsto c(a)_{ij}$ and let $\Delta$ be the discriminant of $c(t)$. So $\Delta$ and $f_{ij}$ are polynomial functions on the space of $n \times n$ matrices. Now $f_{ij}$ vanishes on any matrix $a$ with distinct eigenvalues: $f_{ij}(a) = 0$ whenever $\Delta(a) \neq 0$. So $\Delta f_{ij}$ is identically zero for all $i,j$. Hence $f_{ij} = 0$ for all $i,j$ as required. Sep 24, 2011 at 11:38
• @AlexB. "a matrix is diagonalisable if and only if it has distinct eigenvalues": this is not an if and only if. Nov 16, 2017 at 23:13

The Brouwer fixed point theorem might be such an example. With homotopy theory it's easy to prove, but the original proof was "hands on".

The fundamental theorem of algebra is a very easy consequence of Liouville's theorem in complex analysis.

There is also the (even simpler) proof due to Schep.

• Also, there is the Rouche's Theorem method in a similar vein.
– Matt
May 18, 2010 at 6:10
• 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/… Jan 25, 2011 at 0:43
• 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. Feb 13, 2014 at 22:37

Though the idea behind it all is childishly simple, yet the method of analytic geometry is so powerful that the very ordinary boys of seventeen can use it to prove results which would have baffled the greatest of Greek geometers--Euclid, Archimedes, and Apollonius.

---E.T. Bell, in Men of Mathematics

• adding to the answer by negative refraction Jul 11, 2010 at 12:23

The original article containing proof of the Radon-Nikodým theorem has about 50 pages. John von Neumann proved it by little trick and Riesz representation theorem (that one about Hilbert space functionals) in three lines.

• Is von Neumann's proof now the standard proof? Mar 15, 2017 at 1:55
• This article by Halmos has the proof (on page 90). It also states that these results are essentially equivalent. Nov 24, 2017 at 23:49

Lomonosov's 1973 proof that every compact operator $$T$$ has a hyperinvariant subspace (i.e., a subspace that is invariant for every operator that commutes with $$T$$) was much simpler than proofs existing then that every compact operator has an invariant subspace. See https://en.wikipedia.org/wiki/Invariant_subspace_problem. However, Wikipedia fails to mention that Lomonosov's proof was further simplified to replace the Schauder fixed point theorem by the spectral radius formula $$\lim \|T^n\|^{1/n}$$ (see e.g. Rudin's Functional Analysis), so that Lomonosov's theorem is taught (or assigned as an exercise) in classes in which the spectral radius formula is introduced.

• I actually remember doing that exercise - neat example! May 16, 2010 at 19:30
• Does such or other simplification work for not-normed version of Lomonosov theorem? Feb 7, 2020 at 16:06

The Van der Waerden conjecture for the permanents was stated in 1926 and remained open for over 50 years. It was considered "one of the famous open problems in combinatorial theory" (in van Lint's words). It turned out to be an easy consequence of the Alexandrov-Fenchel inequality from late 1930s. See this article for the history and basically the whole proof.

• This article homepages.cwi.nl/~lex/files/perma5.pdf from a recent issue of the American Mathematical Monthly describes the recent - and completely elementary - proof of Van der Waerden's theorem due to Leonid Gurvits. May 17, 2010 at 17:15
• The link is dead but I think it may have pointed to Gurvits's paper The Van der Waerden conjecture for mixed discriminants. Feb 6, 2020 at 18:59

The associativity of the group law on an elliptic curve can be proved by a tedious and unenlightening calculation, but it can be derived pretty quickly once you have developed some curve theory (Riemann-Roch, etc.).

• The theory of the Weierstrass p-function isn't entirely unenlightening. I assume you're referring to the chord-and-tangent proof, which is awful, but it's not so bad over C when elliptic functions are available. May 17, 2010 at 3:59
• @Timothy: Riemann-Roch seems like a lot just to prove associativity. You only need to note the $P+(Q+R)=(P+Q)+R$ holds separately for the obvious cases $P=O$ and $Q=O$, then apply the Rigidity Theorem. This has a simple proof (Theorem 7.13 of J.S. Milne's notes on Alg. Geom. ver 5.10. jmilne.org/math/CourseNotes/ag.html). Jan 25, 2011 at 2:20

I've lately have found myself admiring the proof of the fundamental theorem of algebra using linear algebra, due to H. Derksen, American Mathematical Monthly, 110 (7) (2003), 620–623.

He proves directly that linear operators on finite dimensional complex vector spaces admit eigenvectors, and deduces the fundamental theorem from this. I like the argument because it is completely elementary: All it uses is that odd dimensional polynomials over the reals have a real root, and that complex numbers have complex square roots (in particular, it avoids the machinery of complex or real analysis, and can even be presented without any reference to determinants). Moreover, the proof gives the result that $R(\sqrt{-1})$ is algebraically closed whenever $R$ is a real closed field, which before I had only seen proved using Galois theory or analogous, relatively sophisticated techniques.

Derksen's proof is a nice induction where first odd dimensions are taken care of, then dimensions of the form 4k+2, then of the form 8k+4, etc.

• Well, this is not really a quick proof. The proofs by complex variables are much faster (granting enough build-up in complex variables). To be fair, a few years ago I made Derksen's proof the goal of my undergraduate linear algebra course for math majors, but it took me two days to go through the argument carefully and I decided it might have been hard for them to appreciate when the argument goes on that long. May 16, 2010 at 23:48
• " Well, this is not really a quick proof. The proofs by complex variables are much faster (granting enough build-up in complex variables) " Oh, sure, "granting enough build-up" is the key here. This proof is perhaps the fastest I know from the ground up. But we rarely start at the ground anymore. May 17, 2010 at 0:09
• What about the topological proof? Building up to the fundamental group of the circle only takes about a page! May 17, 2010 at 1:08
• What I meant by "this (Derksen's proof) is not really a quick proof" is that even if you try to explain it to a mathematician I still think it will take a bit of lead-in to get into the argument and you don't walk away thinking "oh, that was very natural", which was the attitude which the original question was about. By the way, are you saying Derksen's proof is the fastest you know which starts from scratch? There are proofs by multivariable calculus which take less time. A proof with double integrals is at math.uconn.edu/~kconrad/blurbs/fundthmalg/… May 17, 2010 at 4:54
• Ha! @KConrad: I've been looking at the notes at your site. Very nice! May 17, 2010 at 15:12

Quadratic Reciprocity. Gauss' original proof is entirely elementary, but far from easy (I think I recall reading that Gauss himself said he spent more than a year tormented trying to find a proof).

There are many modern proofs. Using algebraic number theory and in particular the Kronecker-Weber theorem, we now have a conceptual proof, literally 4-5 lines in length.

• Gauss himself later found another 5 proofs; in particular, his proof based on Gauss sums (reproduced in Ireland and Rosen) is very short and uses all the cyclotomy that you can possibly need. May 18, 2010 at 2:26

It was about 20 years ago that I have learned it, so I migth not remember things correctly. However, I think Stoke's theorem was considered non-trivial originally. But using differential forms it can be proved by a one line argument.

• We are told by Maxwell in his A Treatise on Electricity and Magnetism (1873, p. 27), "This theorem was given by Professor Stokes, Smith’s Prize Examination, 1854, question 8." However, this does not mean that Stokes's theorem was considered easy -- those old Cambridge exams were possibly the most difficult of all time. May 18, 2010 at 5:07

I have two entries, although there is a wealth of elementary geometric examples similar to #1 and several alternative proofs of #2.

(1) Pascal's theorem: If H is hexagon whose vertices lie on a conic section Q then the points $A,B,C$ where the pairs of the opposite sides intersect are collinear.

I think that the first proof used Menelaus's criterion of collinearity and required a figure, as well as keeping track of various points and lines in order to use Menelaus's theorem. A beautiful short proof based on Bezout's theorem is in vol 1 of Shafarevich's "Algebraic geometry":

If the sides of H are given by the vanishing of linear forms $l_1,l_2,l_3$ and $m_1,m_2,m_3$ in homogeneous projective coordinates, where $l_i$ is the opposite of $m_i$, then $l_1 l_2 l_3 - \lambda m_1 m_2 m_3$ vanishes at the vertices of $H$ and one more arbitrarily chosen point on Q, for a suitable $\lambda$; since $6+1>2\cdot 3$, by Bezout, the cubic is reducible, so it consists of Q and another component, which is a line passing through $A,B,C$.

(2) Isoperimetric inequality: If a simple closed curve in the plane has length $L$ and bounds the region of area $A$ then $L^2-4\pi A\geq 0$ (with equality only in the case of a circle).

The first proof of the isoperimetric property of the circle was attempted by Jacob Steiner using the "four rod" method (related to "Steiner's symmetrization"), but it proceeded under the assumption that the minimum is attained and so was incomplete. Weierstrass gave the first rigorous proof based on variational calculus and it was painstaking. Adolf Hurwitz found an essentially one-line proof (after all the notation has been set up) that is reproduced in "Einfuhrung in die Differentialgeometrie" by Wilhelm Blaschke (p.33 of 1950 edition):

$$L^2-4\pi A = 2\pi^2 \sum_2^{\infty} \frac{a_k^2+{a_k}^{\prime 2}}{k^2-1}\geq 0.$$

Here $a_k$ and $a_k^{\prime}$ are the Fourier coefficients of the position vector of the curve w.r.t. unit tangent vector.

• The Menelaos proof isn't particularly complicated, if done right. Geometry books like to obscure it by giving the points arbitrary names, but if you follow the path of "rewriting the problem in terms of triangle geometry, and then applying Menelaos" (a very good general tactics, since triangles are probably the mathematical object we know most about), it becomes straightforward and quick. Pascal, rewritten in terms of triangles: Let ABC be a triangle, A' and A'' two points on the line BC, B' and B'' two points on the line CA, and C' and C'' two points on the line AB. [...] May 18, 2010 at 10:18
• [...] Then, if A', A'', B', B'', C', C'' lie on one circle, then the points of intersection of B''C' with BC, of C''A' with CA, and of A''B' with AB are collinear. Proof: Apply Menelaos to this points. In order to obtain their respective ratios, you have to apply Menelaos 3 more times, but each time it is immediately clear what points you are applying it to. At the end you must prove that the product of 6 fractions is 1, which follows from the intersecting chords theorem. Of course, the cubic curves proof is fascinating, but I would say the Menelaos proof is not harder. May 18, 2010 at 10:20
• Sure, the strategy is clear but I'd call it long and nontransparent: for example, I cannot do it in my head. Before I learned the Bezout argument, my favorite way had been through proving Briancon's theorem by "going into space" that I had read in Prasolov, if I'm not mistaken. Brianchon's theorem concerns circumscribed hexagons, so it's projective dual to Pascal's theorem. May 18, 2010 at 23:37
• Excellent! I should have thought of the isoperimetric inequality example; I went through both the calculus of variations approach and the Fourier series proof as an undergrad, and the Fourier series argument is a remarkable improvement. Fourier analysis is probably responsible for a lot of examples suitable for this question. May 20, 2010 at 13:49
• The proof of Pascals's theorem presented in jstor.org/stable/2324214 is also rather nice. It is perhaps not especially conceptual, but it uses essentially only the inscribed angle theorem. Oct 5, 2010 at 12:10

Don't know for sure if this example qualifies, but it certainly is a hard problem which becomes trivial from the right point of view. (I learned this from Martin Gardner, proper credits might be researched if necessary).

Problem: three circles in the plane, no two with the same radius, pairwise disjoint. For each pair of circles, there are four straight lines tangent to both; take the two which leave both circles on the same side; they intersect at a point. Repeat the construction for each pair of circles. We get three points: prove that they are collinear.

You may want to think a little about the problem; can be solved both by plane or analytic geometry, with some effort. Not too difficult, but not a one-liner.

Now consider the following solution: add a dimension. You have three spheres, and if you section them through their centers with a plane you get the original three circles. Consider the cones determined by each couple of spheres; the section is the couple of tangent lines seen above, and the tips of the cones are the three points in the problem. Now take two planes touching the three spheres from above and from below....

• There is another one-line solution to this. Each of the three points is the center of a homotopy which maps one of the three circles to another one. The composition of the three homotopies (in the right order) is id, since it fixes a circle and is not a 180° rotation. So the centers of the homotheties are collinear. Jan 24, 2011 at 23:25
• this uses more 'advanced' math, much beyond simple visualization, but it's very nice indeed Jan 25, 2011 at 15:12
• I think it was from one of Peter Winkler's books that I first became aware that the 3D proof doesn't quite work as nicely as it seems to at first glance. In particular, it doesn't apply in all cases. Perhaps the easiest example to see is the case of two giant spheres and a tiny sphere. Then there is no plane touching all three spheres from above or from below. Aug 11, 2011 at 14:39
• I encountered this youtube video illustrating the theorem that way: youtube.com/watch?v=LE3gQKeIyLM Jan 3, 2016 at 19:11
• @TimothyChow Does the slightly different proof shown in vhspdfg's video fix the problem? Mar 9, 2017 at 22:46

Short-time existence for the Ricci flow was initially proved by Hamilton by a long and involved argument using the Nash-Moser implicit function theorem. Then Dennis DeTurck found a nice trick which showed that the Ricci flow is equivalent to a standard parabolic problem.

The theorem that the left-hand trefoil knot is not isotopic to the right-hand trefoil knot was originally proved (by Max Dehn in 1914), by a rather grueling analysis of the automorphisms of the trefoil knot group. The theorem became much easier with the advent of the Jones polynomial in the 1980s.

• Surely it's much easier to just note that the signature is not zero and that it is alternating. The Jones polynomial looks to me like massive overkill. May 17, 2010 at 3:23
• Daniel, thanks for this information, which I have since found in Lickorish's An Introduction to Knot Theory, p.86. I still think it is debatable, however, whether the signature approach is easier than the Jones polynomial. May 17, 2010 at 7:08
• The proof became much easier even before the Jones polynomoal. Seifert's classification of Seifert fibred 3-manifolds does the job. See for example Hatcher's 3-manifolds notes (on-line). Jun 18, 2010 at 6:12

Here is another example from functional analysis. There are several basic results, such as the principle of uniform boundedness and the open mapping theorem, that follow easily from the Baire category theorem. However, I recall from reading Halmos's autobiography I Want to Be a Mathematician that the original proofs of these results were rather complicated and the theorems were considered to be significant achievements.

• I think the Baire category theorem is responsible for quick proofs of lots of hard theorems, such as the existence of continuous nowhere differentiable functions. I recently worked out a way to use it to prove the existence of bump functions, too. I think the Hahn-Banach theorem was also considered difficult in its time, and lots of its easy consequences started life as nontrivial theorems. I guess there are a wealth of examples in functional analysis, perhaps since analysis has been around for so long. For that reason I was expecting more examples in number theory and Algebraic geometry. May 20, 2010 at 14:00
• @Paul: can you explain (or link to) your argument about Baire and bump functions? It would be nice to see. May 21, 2010 at 12:42

I was told by my (graduate school) teacher of functional analysis that originally the complex case of the Hahn-Banach theorem was considered a major open problem. It was eventually shown to be such a simple consequence of the real case, that now, no one knows who came up with the trick.

• I've never actually looked this up, but I've seen in several places (including the notes to Chapter 3 of Rudin's Functional Analysis) that the complex version was proved by H.V. Bohnenblust and A. Sobczyk, Bull. Amer. Math. Soc., vol. 44, pp. 91-93, 1938, and by G.A. Soukhomlinoff, Mat. Sbornik, vol. 3, pp. 353-358, 1938. (And yes, the proof was both simple and unexpected.) May 30, 2010 at 16:05
• Yes, Yosida also quotes Bohnenblust and Sobczyk Jul 19, 2010 at 13:59

I believe Schur's Lemma was originally considered difficult (after all it did get named). However it is now a one-line proof in an undergraduate course.

I suspect Schur was interested in finite dimensional representations of finite dimensional algebras over the complex numbers. Then the lemma is that the endomorphism ring of an irreducible representation is the complex numbers. Don't ask me why this was considered difficult. The definition of an abstract algebra was not published until after Molien and Wedderburn's results so I can see the statement would have been convoluted.

• As far as I know, Schur's proof was the one that we still use. "After all it did get named" is not a good argument: it's an extremely important result, even though the proof is very easy, hence nomenclature "lemma". A better example within the same realm would be Hurwitz's proof of complete reducibility of representations of GL_n using averaging over the maximal compact subgroup: that had previously been known only in special cases, via the (complicated) Cayley $\Omega$ process. May 18, 2010 at 2:30
• Hmm. I still consider the $\Omega$ processes more interesting than the theorems they are used to prove... May 18, 2010 at 10:23
• I think Victor is right. In fact, according to Karin Erdman, Schur himself used to be quite embarassed by the fact that such a trivial statement would get his name attached to it, considering that he proved much bigger and more difficult (although possibly not more important) results. Oct 5, 2010 at 9:05
• I once simultaneously audited a physics course taught by J. Van Vleck (who later won a Nobel prize) and took a math course from George Mackey. Both of them proved Schur's Lemma, and only a few days apart. Van Vleck's proof was done entirely with complicated matrix manipulations and took about fifteen minutes. Mackey gave the easy one sentence proof without even writing anything on the board ! Jan 25, 2011 at 6:58

Bezout's theorem - You can prove it with grueling arguments about resultants, or you can use cohomological machinery to do it in one line.

• I think that this one is only a half victory. When I went through the cohomological machinery use to prove Bezout's theorem, it wasn't as quick as it first seemed. At the same time, I think that there is a resultant-ish proof based on the Hilbert-Poincare series of the projective varieties involved, which is comparable in difficulty to the homological proof. Note that if you want Bezout's theorem in positive characteristic, you have to either develop etale cohomology or do something more direct. May 18, 2010 at 3:26
• I think I've only ever seen the nasty resultant version. How does the cohomological proof go? If the cohomological machinery is hard to develop from scratch but Bezout's theorem falls out easily once you have it, this would be a great example. May 20, 2010 at 13:42
• Isn't the resultant proof in CP^n trivial? If you have n hypersurfaces of deg d_1,...,d_n and look at their resultant with an extra linear form u, saying Bezout's thm is the same as saying that the degree of this resultant wrt u is the product d_1...d_n. Moreover this polynomial in u is in the Brill locus of completely factorizable homogeneous polynomials and the linear factors are the intersection points of the n hypersurfaces. Jul 17, 2010 at 21:19

The most recent and astonishing one is Zeev Dvir's proof on Kakeya conjecture over finite field, it is surprisingly elementary and beautiful. It probably tells us sometimes it is just a change of thoughts we need to prove hard theorems.

https://terrytao.wordpress.com/2008/03/24/dvirs-proof-of-the-finite-field-kakeya-conjecture/

Another one is the elementary proof of the Gaussian correlation inequality, which is so simple that it has been a while for people to believe. Later people wrote another paper to explain it.

https://arxiv.org/abs/1512.08776

• Maybe someone could say what GCI stands for, so we don't all have to go look it up. Nov 17, 2017 at 4:46
• @GerryMyerson if $A, B$ are origin-symmetric convex sets in $\mathbb{R}^d$, the two events that a standard Gaussian random point belong to them positively correlate. Jan 27, 2019 at 23:21

Hindman's theorem : if I remember correctly, the original proof was elementary but very long and complicated; whereas a proof using an idempotent ultrafilter can be explained in less than a page.

Still with ultrafilters, there's also Tychonoff's theorem : the original proofs, either Tychonoff's with complete accumulation points, or the one with the Alexander subbase theorem are somewhat technical and require some imagination.

The proof using ultrafilters is extremely straightforward and anyone who has learned about ultrafilters can find it with little to no imagination. It also has the advantage of showing that if you work with Hausdorff spaces, you don't need the full axiom of choice, whereas the Alexander subbase theorem uses Zorn's lemma indistinctly.

Gelfand–Mazur theorem. "A complex Banach algebra, with unit 1, in which every nonzero element is invertible, is isometrically isomorphic to the complex numbers."

The proof is the one everybody knows.

• Do we?${}{}{}{}$ Mar 10, 2017 at 1:25

The alternating sign matrix conjecture was first proved by Doron Zeilberger; the proof was enormously computational. Later, Greg Kuperberg gave a much shorter proof using results from statistical mechanics. Kuperberg's proof is still not trivial, but it is more conceptual.

(It's worth mentioning that very recently, Fischer and Konvalinka have announced a bijective proof of the same theorem, which is pleasing to a combinatorialist, but far from trivial, and hence probably not an answer to the question.)

The incompressibility method based on Kolmogorov complexity is described in "Kolmogorov Incompressibility Method in Formal Proofs A Critical Survey", V Megalooikonomou - 1997, as often being more elegant, intuitive, simpler and shorter than counting arguments, or the probabilistic method, in areas such as lower bounds, average case complexity, random graphs or pumping lemmas in formal language theory.

How about de Branges' proof of the Bieberbach conjecture? My understanding is that his original proof ran to 100+ pages, but others soon found a way of bringing it down to considerably less than that - maybe not a quick proof, but a relatively quick proof.

• How does that fit the requirements? What is the sophisticated result with short proof from which it follows? de Branges' original "proof" was notorious for its complexity and gaps, so yes, anything else would be an advance... May 17, 2010 at 23:06