A Century of Advancing Mathematics c 2015 by The Mathematical Association of America (Incorporated) Library of Congress Control Number: 2015936096 Print ISBN: 978-0-88385-588-1 Electronic ISBN: 978-1-61444-522-7 Printed in the United States of America Current Printing (last digit): 10987654321 A Century of Advancing Mathematics
Stephen F. Kennedy, Editor Associate Editors Donald J. Albers Gerald L. Alexanderson Della Dumbaugh Frank A. Farris Deanna B. Haunsperger Paul Zorn
®
Published and distributed by The Mathematical Association of America
Contents
Preface ...... ix Part I Mathematical Developments 1 The Hyperbolic Revolution: From Topology to Geometry, and Back ...... 3 Francis Bonahon A CenturyofComplexDynamics ...... 15 Daniel Alexander and Robert L. Devaney Map-ColoringProblems ...... 35 Robin Wilson SixMilestonesinGeometry ...... 51 Frank Morgan Defying God: the Stanley-Wilf Conjecture, Stanley-Wilf Limits, and a Two-GenerationExplosionof Combinatorics ...... 65 Eric S. Egge WhatIstheBestApproachtoCountingPrimes? ...... 83 Andrew Granville A CenturyofEllipticCurves ...... 117 Joseph H. Silverman Part II Historical Developments 133 The Mathematical Association of America: Its First 100 Years ...... 135 David E. Zitarelli The Stratification of the American Mathematical Community: The Mathematical Association of America and the American Mathematical Society, 1915–1925 . . . 159 Karen Hunger Parshall Time and Place: Sustainingthe American Mathematical Community ...... 177 Della Dumbaugh Abstract (Modern) Algebra in America 1870–1950:A Brief Account ...... 191 Israel Kleiner Part III Pedagogical Developments 217 The History of the Undergraduate Program in Mathematics in theUnitedStates ..... 219 Alan Tucker
v vi A Century of Advancing Mathematics
Inquiry-BasedLearningThroughthe LifeoftheMAA ...... 239 Michael Starbird A PassporttoPleasure ...... 253 Bob Kaplan and Ellen Kaplan Strength in Numbers: Broadening the View of the Mathematics Major ...... 257 Rhonda Hughes A Historyof Undergraduate Research in Mathematics ...... 263 Joseph A. Gallian The CalculusReformMovement: A Personal Account ...... 275 Paul Zorn Introducing ex ...... 283 Gilbert Strang Part IV Computational Developments 295 Computational Experiences in the Pre-Electronic Days ...... 297 Philip J. Davis A CenturyofVisualization:One Geometer’s View ...... 301 Thomas F. Banchoff TheFutureofMathematics:1965to2065 ...... 313 Jonathan M. Borwein Part V Culture and Communities 331 Philosophy of Mathematics: What Has Happened Since G¨odel’s Results? ...... 333 Bonnie Gold Twelve Classics People who Love Mathematics Should Know; or, “Whatdoyoumean, youhaven’t read E.T.Bell? ...... 351 Gerald L. Alexanderson The Dramatic Life of Mathematics: A Centennial History of the Intersection of Mathematics and Theater in a Prologue, Three Acts, and an Epilogue ...... 365 Stephen D. Abbott 2007:TheYearofEuler ...... 379 William Dunham The PutnamCompetition:Origin,Lore, Structure ...... 387 Leonard F. Klosinski GettingInvolvedwiththeMAA:APath Less Traveled ...... 393 Ezra “Bud” Brown HenryL.Alder ...... 397 Donald J. Albers and Gerald L. Alexanderson LidaK.Barrett ...... 401 Kenneth A. Ross RalphP.Boas ...... 405 Daniel Zelinsky Contents vii
LeonardGillman—Reminiscences ...... 407 Martha J. Siegel PaulHalmos:NoApologies ...... 411 John Ewing IvanNiven ...... 415 Kenneth A. Ross GeorgeP´olyaandtheMAA ...... 421 Gerald L. Alexanderson
Preface
Searching, in the early years of the twentieth century, for a source of support for the fledg- ing and financially unstable American Mathematical Monthly Herbert Ellsworth Slaught conceived the idea of a new society. Our MAA was founded in 1915 to serve as a home for the Monthly. The full details of that story are contained in David Zitarelli’s contribution to this volume beginning on page 135. Within a decade we had published our first book, Calculus of Variations by G. A. Bliss. We now publishthree world-class print journals, one magazine, a newsmagazine, eight book series, and a host of online material. Our identity, from our inceptionrising from the Monthly’sneed for support up to the present-day centen- nial celebration, is firmly rooted in extraordinary exposition of mathematics. This makes it fitting to produce a volume of essays by some of the great mathematicians and expositors writing today as part of that celebration. But, Slaught’s vision was larger and the MAA’s mission has always been much more than just producing great expository mathematics. That mission—to advance the mathe- matical sciences, especially at the collegiate level—has been reflected in the Association’s deep engagement with pedagogical practices and public policy issues, with the history and philosophy of mathematics, and with the connections between mathematics and the arts and other sciences. It seems only natural for this volume to sample from the entire broad cultural sweep of mathematics throughout the century of the MAA’s existence. To organize this broad collection of material, the present volume is divided thematically into five sections. First, of course, comes the mathematics. The MAA century began, mathematically speaking, at the tail end of the move towards axiomatization and formalism that started in the nineteenth century. That movement, finished off by Kurt G¨odel’s stunner in the early thirties, gave way to a movement towards deep abstraction and ever increasing distance be- tween, so-called, pure and applied mathematics. The introduction of computing machines has, over the past decades, heightened interest in heuristic and algorithmicthinking and en- ergized areas like chaotic dynamics and combinatorics where computing power can reveal new phenomena and prime new intuitions. Our section on mathematical developments includes some legendary, and some new, voices in mathematical exposition. Bob Devaney and Dan Alexander chronicle the early history of complex dynamics, touring the highlights up to the present day. Eric Egge takes on the challengingtask of givingus a lookat the explosionof interest in combinatoricsover the last few decades, focusing on the astounding developments surrounding the Stanley- Wilf Conjecture. Along the lines of famous conjectures that have fallen—Joe Silverman will show us some of the details that unraveled Fermat’s Last Theorem and Robin Wil- son takes us on a historico-mathematical magic ride through the story of the Four-Color
ix x A Century of Advancing Mathematics
Theorem. Frank Morgan chooses his favorite half-dozen geometric milestones of the last few decades and Andrew Granville gives us a new way to think about the Prime Number Theorem after a deep, and deeply historical, tour through our efforts to count the primes. Finally, Francis Bonahon pays tribute to the contributions of Bill Thurston in unearthing the deep connections between geometry, particularly hyperbolic geometry, and topology. From the very beginning the MAA has been about more than just world-class expo- sition; within three months of our founding the organization had constituted the National Committee on Mathematics Requirements charged with investigating the teaching of sec- ondary and post-secondary mathematics, making curricular recommendations, and working towards improving the teaching of mathematics. It is fitting that we devote a section of this volume to the pedagogy of mathematics. A commitment to effective teaching and learning of mathematics is in the organization’s DNA; the perceived lack of such a commitment from our sister organization contributed to the movement that led to the MAA’s found- ing. Alan Tucker leads off with a fascinating history of the evolution of the undergraduate mathematics major. Joe Gallian, the founding father of the mathematics REU, recounts the early history of that pedagogical innovation. Michael Starbird writes historically and per- suasively about inquiry-based pedagogy, while Bob and Ellen Kaplan—the founders of the original Math Circle—write, passionately and lyrically, on the same topic. Rhonda Hughes offers advice on attracting underrepresented groups to our subject. Gil Strang tells us how we ought to teach the exponential function; and Paul Zorn, a key player in the Calculus Reform movement, tells us what that movement hoped to achieve. Zorn’s contributionhighlightshow calculus teaching was changed, even given new life, by computing technology. Egge and Alexander & Devaney made clear that massive compu- tational power wrought seismic changes on mathematics itself—and on the kinds of math- ematics we find interesting and exciting. In the Computing section of this volume we have Phil Davis reminiscing about his days in the pre-electronic era when he computed with ana- logue devices, many of which you will never have heard of. Tom Banchoff recounts some of the advances arising from our increased powers of visualization. Jon Borwein argues that the very nature of mathematics and mathematical practice have been revolutionarily ruptured by computing. He daringly speculates about where this disruption might lead. A centennial, of course, prompts reflection on our century of activity. In our History section David Zitarelli tells the story of the founding and growth of the MAA. Karen Par- shall relates the early history of MAA-AMS relations. Della Dumbaugh reflects on the establishment of an American mathematical infrastructure by considering the work of, and relationship between, Leonard Eugene Dickson and Oswald Veblen. Israel Kleiner prac- tices history-by-biography by presenting a biography-driven tale of a century of progress in abstract algebra. In the final section on Cultures and Communities, Bill Dunham recalls the MAA’s Year of Euler, Jerry Alexanderson tells us about some of his favorite books, and Steve Abbott outlines the history of mathematically inspired theater. Bonnie Gold fills us in on what has happened in the philosophy of mathematics post-G¨odel, and Leonard Klosinski muses on the history and structure of the Putnam. Finally, we offer a handful of reminiscences of and by leading figures in the MAA over the years. These short pieces not only succeed in introducingus to some of the giants of our Association, they also bring to lighta wonderful MAA tradition of mentoring and welcoming. Every single one of these pieces tells, inci- Preface xi dentally, one or more stories of a national MAA figure drawing a younger colleague into lifelong engagement with this organization. Taken together, these reflections tell a powerful story of the role of community in the lives of mathematicians, and in our discipline. It has been an extraordinary century for mathematics—more mathematics has been created and published since 1915 than in all of previous recorded history. We’ve solved age-old mysteries, created entire new fields of study, and changed our conception of what mathematics is. More mathematicians have lived and practiced in the MAA century than in all previous millennia combined. Those mathematicians have explored more than just mathematics; they have, as this volume tries to make evident, investigated mathematical connections to pedagogy, history, the arts, technology, literature, every field of intellectual endeavor. Mathematics is the most thrilling, the most human, area of intellectual inquiry. We hope you find in this volume compelling proof of that claim. The editors are grateful to the authors of the following essays. Their erudition, ex- pository skill, and enthusiasm for this project have made the production of this volume a joyous labor. We also must express our profound gratitude to Ivars Peterson, Carol Baxter and, especially, Beverly Ruedi of MAA Press. Their collective encouragement, craftsman- ship, humoring of our foibles, and attention to detail are simply extraordinary and made this volume possible. —The Editors
Part I Mathematical Developments
The Hyperbolic Revolution From Topology to Geometry, and Back
Francis Bonahon1 University of Southern California
Dedicated to the memory of Bill Thurston (1946–2012)
The late nineteen seventies and early eighties saw a surprising convergence between topol- ogy and rigid geometry. This followed the groundbreaking work of Bill Thurston on the geometrization of three-dimensional manifolds, but this was also part of a larger trend that resulted in a period of intense cross-fertilization between topology, geometry, dynamical systems, combinatorial group theory, and complex analysis. First, we should begin with the traditional difference between topology and geometry. Both fields consider geometric objects, but topologists allow themselves to deform these objects and stretch distances, whereas geometers tend to focus on the fine properties of these distances. As an illustration, it is well-known that topologists like to turn doughnuts into coffee mugs, whereas a typical result in geometry would be the Polyhedron Rigidity Theorem of Cauchy, which says that it is impossible to deform a convex polyhedron in euclidean space without changing the shape of any of its faces.
1 The hyperbolic space Among the geometries that can occur in dimension three, the more fundamental one is hyperbolic geometry. The n-dimensional hyperbolic space is the half-space Hn Rn 1 Œ0; / in Rn, D 1 endowed with the hyperbolicmetric defined as follows. First, for every differentiable curve n Œa; b H with .t/ x1.t/; x2.t/; : : : ; xn.t/ , we define its hyperbolic arc length W ! D ` . / b 1 n x .t/2 dt (differing from the usual arc length only by the 1 hyp a xn.t/ i 1 i0 xn.t/ D D n factor). The hyperbolicq distance dhyp.P; Q/ between two points P , Q H is then defined R P 2 as the infimum of the hyperbolic arc lengths `hyp. / over all curves joining P .a/ to D Q .b/. D What is not obviousfrom the above description isthat the hyperbolicspace Hn is highly symmetric. In fact Hn is homogeneous in the sense that, for every P , Q Hn, there is n 2 an isometry ' of the metric space .H ; dhyp/ that sends P to Q. It is even isotropic in the
1This work was partially supported by the grants DMS-1105402 and DMS-1406559 from the U.S. National Science Foundation,and by a Research Fellowship from the Simons Foundation (grant 301050).
3 4 A Century of Advancing Mathematics sense that we can require the isometry ' to send an arbitrary direction at P to an arbitrary direction at Q. In this regard, it is as symmetric as the usual euclidean space Rn. Hyperbolic geometry made its first appearance in the context of Euclid’s Fifth Postu- late, in the early nineteenth century. Henri Poincar´e[34, 35] was the first to connect it to other major branches of mathematics, namely complex analysis and the theory of linear differential equations. About a century later, Thurston placed hyperbolic geometry at the center of three-dimensional topology.
2 Knots in space As an introduction to Thurston’s geometrization results for three-dimensional manifolds, let us focus on their applications to knot theory. The results are then easier to state, and give a good illustrationof the more general ideas. The author likes to say that knot theory is to the topologist what the fruit fly is to the biologist: a small laboratory example where big theories can be tested, which is easier to handle and to visualize than the long-term problems motivating these theories, and which nevertheless is sufficiently complex to offer a challenging testing ground. A knot is a closed curve K in the euclidean space R3 that is smooth, i.e., has a well- defined tangent (with no switchback) at each point, and that has no self-intersection. The main problem in knot theory is to decide when two knots K and K0 can be deformed to each other, that is whether there exists a continuous family of homeomorphisms .'t /t Œ0;1 3 2 of R such that '0 is the identity and '1.K/ K . D 0
Figure 1. A few knots.
Figure 1 offers a few examples. It is not immediately obvious that two of these knots can be deformed to each other, and deep mathematics is required to prove that no two of the remaining four knots can be deformed to each other. This situation is fairly typical. To tackle the challenge of rigorously proving that two knots that appear different cannot be deformed one to the other, mathematicians have tra- ditionally used techniques of algebraic topology. One of the early successes of such an approach was due to James W. Alexander and Garland B. Briggs [2] who showed in 1927 that the knots of up to nine crossings listed in the nineteenth–century knot tables by Tait, Kirkman and Little [45, 16, 17, 20, 21] were actually different.2 They did so by compar- ing the homology groups of certain branched covers of these knot. The following decades saw the development of ever more sophisticated methods of algebraic topology to attack problems in knot theory. A less common approach to knot theory involved the cut-and-paste analysis of special surfaces in the complement of the knot, as in the innovative work of Horst Schubert [41, 42, 43].
2To be completely accurate, there were a very small number of exceptions that Alexander and Briggs could not settle. The Hyperbolic Revolution: From Topology to Geometry, and Back 5
Thurston’s Hyperbolization Theorem for knot complements provided a completely dif- ferent type of knot invariants. To state this result, we need to mention a couple of classical constructions of knots. The first one is that of torus knots. These are the knotsthat can be drawn on the surface of a standard torus in R3. More precisely, for coprime integers p and q, the p; q –torus f g knot is represented by the curve parametrized by
t .R r cos qt/ cos pt; .R r cos qt/ sin pt; r sin qt 7 ! C C for arbitrary 0 < r < R. For instance, Figure 2 represents the 5; 4 –torus knot, and f g the first three knots of Figure 1 are the 1;0 , 2; 3 and 2; 3 –torus knots, respectively. f g f g f g Torus knots are very well understood. In particular, when p and q are different from 1, ˙ the p; q –torusknot can be deformed to the p ; q –torusknot if and only ifthe set p; q f g f 0 0g f g is equal to p ; q or to p ; q ; when p or q are equal to 1, the p; q –torus knot f 0 0g f 0 0g ˙ f g can be deformed to the unknot, the first knot of Figure 1.
Figure 2. A torus knot.
The second construction that we need is that of satellite knots. Suppose that we are given a first knot K R3 that cannot be deformed to the unknot, as well as another knot L contained in the standard solid torus
V .R cos v/ cos u; .R cos v/ sin u; sin v u; v; R; 0 r D C C I 2 Ä Ä n o consisting of those points which are at distance at most r from the horizontal circle C of radius R centered at the origin, for arbitrary r, R with 0 < r < R. We assume in addition that L is non-trivial in the solid torus V , in the sense that it cannot be deformed in V to a knot L0 which is disjoint from one of the cross-section disks where the coordinate u is constant, or to the central circle C of V .
3 3 The knot K R The knot L V The satellite K0 R Figure 3. A satellite knot.
We can then tie V as a tube around the knot K, and consider the image of L. More precisely, choose an injective continuous map V R3 which sends the central circle W ! C to the knot K. Assume in addition that ' is differentiable, and that its jacobian is every- where different from 0, so that the image K '.L/ is now a new knot in R3. Any knot 0 D K0 obtained in this way is said to be a satellite of the knot K. 6 A Century of Advancing Mathematics
Theorem 1 (Hyperbolization Theorem for knot complements). Let K be a knot in R3, and let R3 R3 be obtained by adding to R3 a point at infinity. Then, exactly one D [ f1g 1 of the followingholds: 1. bK is a torus knot; 2. K is a satellite of a non-trivial knot; 3. the complement R3 K admits a complete metric d which induces the same topology as the euclidean metric of R3 and which is locally isometric to the hyperbolic metric of the hyperbolic spaceb H3. The first alternative is somewhat trivial, since torus knots are very well understood (and very rare). The second alternative can be essentially reduced to the other two, through a unique factorization process of satellite knots into non-satellite links [42, 14, 13, 5]. In practice, almost all knots satisfy the third alternative, and therefore admit a hyperbolic metric, that is, a metric d as in this third alternative. The Hyperbolization Theorem is greatly enhanced by the following earlier result of George Mostow [27, 28]. Theorem 2 (Mostow’s Rigidity Theorem). When the third case of Theorem 1 holds, the metric d is unique up to isometry. That is, for any two such metrics d and d 0, there exists a map R3 K R3 K such that d .x/; .y/ d.x; y/ for every x, y R3 K. W ! 0 D 2 The incredible power of the combination of Theorems 1 and 2 is that they turn the topologicalb problemb of deciding when two knots can be deformed to each otherb into the rigidgeometric problem of deciding when their associated hyperbolicmetrics are isometric. These metrics carry a lot of information. For instance they have a well-defined volume. Theorem 2 then shows that, if two knots satisfy the third conclusion of Theorem 1 and can be deformed to each other, then they must have the same volume. This simple test is remarkably efficient to show that two knots cannot be deformed to each other.
Figure 4. Two very similar knots.
A more powerful invariant of the hyperbolic metric of a knot complement is its Ford domain. This object was introduced in a two-dimensional setting [10] by Lester Ford,3 and generalized to knot complements by Bob Riley [38, 39, 40]. They provide a tessellation of the euclidean plane by polygons, which is invariant under two linearly independent trans- lations and which carries additional pairing information. See for instance [4 , 12.4]fora more precise description. It then follows from Theorem 2 that two knots can be deformed to each other if and only if there is a similitude (the composition of an isometry with a homothety) of the Euclidean plane that carries the tessellation associated to the first knot
3Also famous for being the President of the Mathematical Association of America from 1947 to 1948. The Hyperbolic Revolution: From Topology to Geometry, and Back 7 to the tessellation associated to the second one, and that preserves the pairing information. The “if and only if” part of this statement is particularly impressive and useful. As an example taken from [4], consider the two knots of Figure 4. These are some- what difficult to distinguish with the tools of algebraic topology that were available before hyperbolic geometry techniques became available, and their complements even have the same hyperbolic volume. However a quick inspection, for instance counting the number of edges emanating from each vertex, shows that there is no similitude of the euclidean plane that exchanges their respective Ford tessellations, represented in Figure 5. It immediately follows that these two knots cannot be deformed to each other.
Figure 5. The Ford tessellations of the knots of Figure 4.
Another important property of these results is that they can be explicitly implemented on a computer. Following up on the early pioneering work of Bob Riley [38, 39], the soft- ware SnapPea developed by Jeff Weeks [53] has been particularly influential among re- searchers in knottheory; see [9] for a current incarnation, Python-based and called SnapPy, of the same tool.
3 Geometrization of general three-dimensional manifolds Theorem 1 is a special case of a more general geometrization result for three-dimensional manifolds. An n-dimensional (topological) manifold is a topological space that is locally homeomorphic to the usual n-dimensional euclidean space Rn. For instance, a surface is a two-dimensional manifold. The space R3 R3 of Theorem 1 is a three-dimensional D [f1g manifold, even near the point (and is homeomorphic to the three-dimensional sphere 1 S3 R4); a knot complement R3 Kbis also a three-dimensional manifold. More generally, an n-dimensional manifold-with-boundary is a topological space M locally homeomorphic to Rn 1b Œ0; /, and its boundary @M consists of the points that 1 go to Rn 1 0 under the corresponding local homeomorphisms. In particular, a manifold f g as defined in the previous paragraph is a manifold-with-boundary with empty boundary. The general Geometrization Theorem for three-dimensional manifold is a little difficult to state precisely while remaining within the scope of this article, and we just want to give the flavor of this result. 8 A Century of Advancing Mathematics
First of all, the Geometrization Theorem involves more geometries than hyperbolic ge- ometry. A geometric structure on a manifold can be interpreted as a metric that is locally homogeneous, in the sense that any two points have isometric neighborhoods. These ge- ometries are locally modeled on the homogeneous spaces associated to Lie groups and, in dimension three, the classification of Lie groups shows that there is a limited number of possible models. In fact, there are only eight geometries that are relevant for the Ge- ometrization Theorem: 1. the three isotropic geometries of the euclidean space R3, the three-dimensional sphere S3 R4, and the three-dimensional hyperbolic space H3; 2. the two product geometries S2 R and H2 R, product of the euclidean line R with the 2-dimensional sphere S2 R3 and the hyperbolic plane H2, respectively; 3. two suitably defined twisted product geometries H2 R and R2 R; 4. the Sol geometry, related to the unique three-dimensional solvable Lie group. e e See [36, 3] for a precise description of these geometries. Then, one needs a topological notion of triviality for a surface contained in a three- dimensional manifold. We cannot precisely describe this concept here, except by saying that the definition is consistent with the terminology: a trivial surface is obtained by a method that is too straightforward to be of much use. For instance, the boundary of a small ball in a three-dimensional manifold M is a trivial sphere in M ; similarly, the boundary of a thin tube around a simple closed curve in M gives a trivial torus. Theorem 3 (Geometrization Theorem for three-dimensional manifolds). Let M be a con- nected three-dimensional manifold that is topologically finite, in the sense that M D M @M is obtained by removing its (possibly empty) boundary from a compact manifold- with-boundary M . Then, at least one of the followingholds: 1. M admits a complete metric d which is locally isometric to one of the eight geometric models listed above; 2. M contains a non-trivial sphere, projective plane, torus or Klein bottle. In most cases, the geometry that occurs in the first case is that of the hyperbolic space H3, and the other geometries occur only for a limited array of three-dimensional manifolds. In that case, and under the additional hypothesis that each component of the boundary @M is a torus or a Klein bottle, the same Mostow’s Rigidity Theorem as in Theorem 2 guarantees that the hyperbolic metric on M is unique up to isometry. There is a small possible overlap between the two conclusions of Theorem 3, but no possible overlap in the case of hyperbolic geometry. In particular, non-trivial spheres, pro- jective planes, tori or Klein bottles appear as topological obstructions to the existence of a hyperbolic geometric structure, and of several of the other geometric structures. We then benefit from two earlier pieces of work: one is the Kneser-Milnor [19, 23] unique factorization of a three-dimensional manifold into prime manifolds that contain no essen- tial spheres or projective planes; the other one is the Waldhausen-Jaco-Shalen-Johannson [13, 14] canonical splitting (originally developed for completely different purposes) of a prime manifold into pieces that, either contain no essential tori or Klein bottles, or admit one of the seven non-hyperbolic geometries. In practice, this reduces the problem of the topological classification of three-dimensional manifolds to the isometric classification of The Hyperbolic Revolution: From Topology to Geometry, and Back 9 hyperbolic three-dimensional manifolds. Three-dimensional hyperbolic geometry is still very rich, but our discussion of Ford domains in 2 should give an idea of the powerful techniques that are available in this field. Thurston proved Theorem 3 in many cases, in particular when M is non-compact (which includes the case of knot complements considered in 2), in the late nineteen sev- enties. He also conjectured Theorem 3 in its full generality, which was then known as the Thurston Geometrization Program until Grigori Perelman proved it around 2000. Neither Thurston nor Perelman provided a complete exposition of their proofs, but they circulated partial preprints [48, 50, 51, 31, 32, 33] and gave enough lectures to enable others to fill in all the details; see for instance [15, 29, 30, 7, 8, 18, 25, 26].
4 A broader perspective: using geometry to prove results in topology and algebra The Geometrization Program took place in, and contributed to, a broader trend which in the last quarter of the twentieth century saw a closer integration between topology, differential geometry, dynamical systems and group theory. We already indicated how the combination of Thurston’s Hyperbolization Theorem and Mostow’s Rigidity Theorem translates topological problems to hyperbolic geometry questions, and can be used to prove theorems in knot theory. This interaction between topology and geometry occurs, not just in the consequence of these results, but also in the novel ideas introduced by Thurston for the proof of his Hyperbolization Theorem. Indeed, the flexibility of topology comes with the curse of a very large number of degrees of freedom. Geometry can be used to introduce some rigidity in a topological situation,in order to make it easier to handle. As an example, consider the two-dimensional analogue of knot theory which studies, in a surface S, all simple (smooth and without self- intersection) closed curves in S up to deformation. There is of course an overwhelming abundance of simple closed curves, and of deformations between them. However, we can take advantage of the following consequence of the Uniformization Theorem in complex analysis: if the topology of the surface S is complicated enough that it does not belong to a small finite number of exceptions such as the plane or the torus, the surface S can be endowed with a hyperbolicmetric d. Once such a hyperbolicmetric is chosen, every simple closed curve can be deformed to a unique simple closed curve that is geodesic, i.e., provides the shortest arc between any two of its points that are sufficiently close to each other (a hyperbolic geodesic is thus the hyperbolic equivalent of a straight line). This provides a one-to-one correspondence between, simple closed curves considered up to deformation on the one hand, and simple closed geodesics on the other hand. This greatly simplifies the original problem by eliminating the need to consider deformations, provided that we restrict attention to a very specific type of simple closed curves. Thurston took advantage of this construction to introduce a certain completion ML.S/ of the set S.S/ of simple closed curves in the surface S considered up to deformation. The elements of ML.S/ are measure-theoretic, or probabilistic, generalizations of sim- ple closed geodesics and are called measured geodesic laminations. The space ML.S/ is endowed with a natural topology (for which, rather surprisingly, it is homeomorphic to a euclidean space Rn) and with a rescaling operation. In particular, given a sequence in 10 A Century of Advancing Mathematics
S.S/, it makes sense to talk of the limit of this sequence or, after suitably rescaling, of the asymptotic direction of this sequence in ML.S/. This method of taking limits of objects that are only defined up to deformation was a real conceptual breakthrough. It played a critical rˆole in Thurston’s work on surface diffeo- morphisms [49] and on three-dimensional hyperbolic geometry [46, 47, 52]. Together with similar rigidification techniques, it also provided the impetus and technical tools for much subsequent work by the low-dimensional geometry and topology community. At about the time when Thurston was pioneering the use of geometry to prove results in topology, Mikhail Gromov [12] was translating insights from geometry to abstract group theory. This comes from another situation where one considers closed curves up to defor- mation in a topologicalspace M , namely in the definitionof the fundamental group 1.M / of M . The Milnor-Svarcˇ Lemma [37, 24] asserts that, for a compact space M , the large– scale properties of the fundamental group 1.M / are essentially the same as those of the universal cover M . In particular, this has far–reaching consequences when M is a compact riemannian manifold of negative curvature. Building on the insights provided by the geom- etry, Gromov wasf able to identify the key algebraic features that yield these consequences, and to develop a purely algebraic theory of “groups that behave like fundamental groups of negatively curved manifolds” (now called Gromov hyperbolic groups or negatively curved groups); see [12], as well as for instance [6, 11]. This gave an important boost to the field of combinatorial group theory, further enhanced by the rich families of examples provided by the Geometrization Theorem. The Geometrization Program also greatly energized another area of mathematics. We already mentioned how Poincar´ehad inserted two- and three-dimensional hyperbolic ge- ometry intothe world of complex analysis. In the century that followed, the connection had become a little more tenuous (however, see for instance [1, 22]), but was greatly invigo- rated by Thurston’s Hyperbolization Theorem. Indeed, Thurston’s original proof combined both the complex analytic and the hyperbolic geometric aspects of kleinian groups. Con- versely, the three-dimensional point of view provided strong tools and insights for the cor- responding complex analytic problems. These insights were pushed one step further, first by Thurstonand then by Dennis Sullivan,to the dynamics of rational maps on Riemann sur- faces; see for instance Sullivan’s “dictionary” [44] between the theories of kleinian groups and of complex dynamics. Thurston’s Geometrization Program provided great results and tools that were used to solve many topological problems. However, its even more lasting impact may be the inte- gration and cross-fertilization between numerous branches of mathematics that it triggered: topology, geometry, complex analysis, combinatorial group theory, dynamical systems, etc. From a sociological point of view, mathematics historians may trace the germs of these de- velopments to the Berkeley mathematical school of the late nineteen sixties, where the same group of people were working on topology, dynamical systems and rigid geometry. How- ever, it is Bill Thurston’s extraordinary talent that initiated this technical and conceptual revolution, which led to one of the most productive periods in mathematics.
Bibliography [1] Lars V. Ahlfors, Fundamental polyhedrons and limit point sets of Kleinian groups, Proc. Nat. Acad. Sci. USA 55 (966), 251–254. The Hyperbolic Revolution: From Topology to Geometry, and Back 11
[2] James W. Alexander, Garland B. Briggs, On types of knotted curves, Ann. of Math. 28 (1926), 562–586. [3] Francis Bonahon, Geometric structures on 3-manifolds, in Handbook of geometric topology edited by R.J. Daverman and R.B. Sher, North-Holland, 2002, pp. 93–164. [4] ———, Low-dimensional geometry: from euclidean surfaces to hyperbolic knots, Student Math. Library 49, American Math. Soc., Providence, RI, 2009. [5] Francis Bonahon,LaurenceC. Siebenmann, New geometric splittings of classicalknots, and the classification and symmetries of arborescentknots, unpublished monograph, 1979–2009, avail- able at www-bcf.usc.edu/˜fbonahon/Research/Preprints/BonSieb.pdf. [6] Martin R. Bridson, Andr´eHaefliger, Metric spaces of non-positive curvature, Grundlehren der Math. Wiss. 319, Springer-Verlag, 1999. [7] Huai-Dong Cao, Xi-Ping Zhu, A complete proof of the Poincar´eand geometrization conjecture — application of the Hamilton-Perelman theory of the Ricci flow, Asian J. Math. 10 (2006), 165–492; Erratum, Asian J. Math. 10 (2006), 663. [8] B. Chow, S.-C. Chu, D. Glickenstein, C. Guenther,J. Isenberg, T. Ivey, D. Knopf, P. Lu, F. Luo, L. Ni, The Ricci flow: techniques and applications, Part I. Geometric aspects, Math. Surveys and Monographs 135, American Math. Soc., 2007; Part II. Analytic aspects, Math. Surveys and Monographs 144, American Math. Soc., 2008. [9] Marc Culler, NathanM. Dunfield,andJeffrey R.Weeks, SnapPy,a computerprogramfor study- ing the geometry and topology of 3–manifolds, snappy.computop.org. [10] Lester R. Ford, The fundamentalregion for a Fuchsiangroup, Bull. Amer. Math. Soc. 31 (1935), 531–539. [11] Etienne´ Ghys, Pierre de la Harpe (Eds.), Sur les groupes hyperboliques d’apr`es Mikhael Gro- mov, Progress in Mathematics 83, Birkh¨auser Boston, 1990. [12] Mikhail Gromov, Hyperbolic groups, in Essays in group theory, Math. Sci. Res. Inst. Publ. 8, Springer, 1987, pp. 75–263. [13] William H. Jaco, Peter B. Shalen, Seifert fibered spaces in 3–manifolds, Memoirs Amer. Math. Soc. 220, American Math. Soc., 1979. [14] Klaus Johannson, Homotopy equivalences of 3–manifolds with boundary, Lecture Notes in Math. 761, Springer-Verlag, 1979. [15] Michael Kapovich, Hyperbolic manifolds and discrete groups, Progress in Math. 183, Birkh¨auser, 2001. [16] Thomas P. Kirkman, The enumeration, description, and construction of knots of fewer than 10 crossings, Trans. Roy. Soc. Edinburgh 32 (1883–84), 281–309. [17] ———, The 364 unifilar knots of ten crossings, enumerated and described, Trans. Roy. Soc. Edinburgh 32 (1884–85), 483–491. [18] Bruce Kleiner, John Lott, Notes on Perelman’s papers, Geom. Top. 12 (2008), 2587–2855. [19] Hellmuth Kneser, Geschlossene Fl¨achen in dreidimensionalen Mannigfaltigkeiten, Jahr. Deutschen Math. Verein. 38 (1929), 248–260. [20] Charles N. Little, On knots, with a census for order 10, Trans. Connecticut Academy Sci. 18, Vol. 7 (1885), 27–43. [21] ———, Non-alternate ˙ knots of ordereight andnine, Trans.Royal. Soc. Edinburgh 35 (1890), 253–255. [22] Albert Marden, The geometry of finitely generated kleinian groups, Ann. of Math. 99 (1974), 383–462. 12 A Century of Advancing Mathematics
[23] John W. Milnor, A unique decomposition theorem for 3–manifolds, Amer. J. Math. 84 (1962), 1–7. [24] ———, A note on curvature and fundamental group, J. Diff. Geom. 2 (1968) 1–7. [25] John W. Morgan, Gang Tian, Ricci flow and the Poincar´econjecture, Clay Mathematics Mono- graphs 3, American Math. Soc., 2007. [26] ———, The Geometrization Conjecture, Clay Mathematics Monographs 5, American Math. Soc., 2014. [27] George D. Mostow, Quasi-conformal mappings in n-space and the rigidity of hyperbolic space forms, I.H.E.S.´ Pub. Math. 34 (1968), 53–104. [28] ———, Strong rigidity of locally symmetric spaces, Ann. of Math. Studies 78, Princeton Uni- versity Press, 1973. [29] Jean-Pierre Otal, Le th´eor`eme d’hyperbolisation pour les vari´et´es fibr´ees de dimension 3, Ast´erisque, 235, Soci´et´eMath´ematique de France, 1996. [30] ———, Thurston’s hyperbolization of Haken manifolds, in Surveys in differential geometry, Vol. III (Cambridge, MA, 1996), International Press, 1998, pp. 77–194. [31] Grigori Y. Perelman, The entropy formula for the Ricci flow and its geometric applications, unpublished preprint, arxiv.org/abs/math/0211159. [32] ———, Ricci flow with surgery on three-manifolds, unpublished preprint, arXiv:math/ 0303109. [33] ———, Finite extinction time for the solutions to the Ricci flow on certain three-manifolds, arXiv:math/0307245. [34] Henri Poincar´e, Th´eorie des groupes fuchsiens, Acta Math. 1 (1882), 1–62. [35] ———, M´emoire sur les groupes klein´eens, Acta Math. 3 (1883), 49–92. [36] G. Peter Scott, The geometries of 3–manifolds, Bull. London Math. Soc. 15 (1983), 401–487. [37] Albert S. Schwartz(Svarc),ˇ A volume invariant of coverings (Russian), Dokl. Akad. Nauk SSSR 105 (1955), 32–34. [38] Robert F. Riley, Applications of a computer implementation of Poincar´e’s theorem on funda- mental polyhedra, Math. Comp. 40 (1983), 607–632. [39] ———, An elliptical path from parabolic representations to hyperbolic structures, in Topology of low-dimensional manifolds (Proceedings of the Second Sussex Conference, Chelwood Gate, 1977), Lecture Notes in Math. 722, Springer, 1979, pp. 99–133. [40] ———, Seven excellent knots, in Low-dimensional topology (Bangor, 1979), London Math. Soc. Lecture Note Series 48, Cambridge Univ. Press, 1982, pp. 81–151. [41] Horst Schubert, Die eindeutige Zerlegbarkeit eines Knotens in Primknoten, Sitz.-Ber. Heidel- berger Akad. Wiss. Math.-Nat. (1949), 57–104. [42] ———, Knoten und Vollringe, Acta Math. 90 (1953), 131–286. [43] ———, Knoten mit zwei Br¨ucken, Math. Z. 65 (1956), 133–170. [44] Dennis P. Sullivan, Quasiconformal homeomorphisms and dynamics. I. Solution of the Fatou- Julia problem on wandering domains, Ann. of Math. 122 (1985), 401–418. [45] PeterG. Tait, On knotsI, Trans. Roy. Soc. Edinburgh 28 (1876-7), 145–190;II, Trans. Roy. Soc. Edinburgh 32 (1883-4), 327–342; III, Trans. Roy. Soc. Edinburgh 32 (1884–5),493–506. [46] William P. Thurston, The geometry and topology of three-manifolds, lecture notes, Princeton University, 1976-80. [47] ———, Three-dimensional manifolds, Kleinian groups and hyperbolic geometry, Bull. Amer. Math. Soc. 6 (1982), 357–381. The Hyperbolic Revolution: From Topology to Geometry, and Back 13
[48] ———, Hyperbolic structures on 3-manifolds, I: Deformation of acylindrical manifolds, Ann. of Math. 124 (1986), 203–246. [49] ———, On the geometry and dynamicsof diffeomorphisms of surfaces, Bull. Amer.Math. Soc. 19 (1988), 417–431. [50] ———, Hyperbolic structures on 3-manifolds, II: Surface groups and 3-manifolds which fiber over the circle, unpublished preprint, ca. 1980, arXiv:math/9801045. [51] ———, Hyperbolic structures on 3-manifolds, III: Deformations of 3-manifolds with incom- pressible boundary, unpublished preprint, ca. 1980, arXiv:math/9801058. [52] ———, Three-dimensional geometry and topology, Vol. 1 (Edited by Silvio Levy), Princeton Math. Series 35, Princeton University Press, 1997. [53] Jeffrey R. Weeks, SnapPea, computer program, www.geometrygames.org/SnapPea/ index.html.
Department of Mathematics, University of Southern California, Los Angeles, CA 90089-2532 [email protected]
A Century of Complex Dynamics
Daniel Alexander and Robert L. Devaney1 Drake University Boston University
1 Introduction
Like the MAA, the field of mathematics known as complex dynamics has been around for about one hundred years. Unlike the MAA, complex dynamics has had its ups and downs during this period. While the origins of complex dynamics stretch back into the late 1800s, the foundationsof the contemporary studywere established in the last years of World War I with the pioneering work of Gaston Julia and Pierre Fatou. Althoughone hundred years ago complex dynamics was a predominantly French field, there are some important American connections dating back to 1915, with some interesting historical connections to the MAA. Fatou and Julia continued to explore and expand complex dynamics in the 1920s, but as open questions were successfully addressed, developments slowed. After World War II, aside from a growing body of work by Irvine Noel Baker beginning in the early 1950s concerning the iteration of entire maps, and a few isolated papers, such as those by Hans Brolinand Thomas Cherry in the mid-1960s, interest in the subject dwindled,and toan out- side observer the field appeared dormant. This changed dramatically around 1980 with the discovery of the Mandelbrot set when the availability of computers and computer graphics suddenly revealed the beautiful objects that Julia and Fatou could only see in their minds. Throngs of mathematicians (including Fields medalists John Milnor, William Thurston, Jean-Pierre Yoccoz, and Curt McMullen, as well as numerous other eminent individuals) entered the field and complex dynamics was reborn. In this paper we give a brief overview of the early and later history of the development of complex dynamics, including a discussion of the early American connections. For more historical details see [1], [2], and [3]. We also include a brief description of some of the major results that have come forward during the past century, and we describe briefly some of the dynamical behavior on what are now known as the Julia and Fatou sets, at least for the simplest types of complex functions, namely those with a single free critical orbit.
2 Preliminaries
In complex dynamics, the goal is to understand what happens when an analytic function in the complex plane C (or the Riemann sphere C) is iterated. Recently, this goal has been
1Robert L. Devaney was partially supported by Simons Fundation Grant #208870.
15 16 A Century of Advancing Mathematics expanded to include iteration in Cn as well, although we will not touch upon this subject in this paper. Different types of complex analytic functions—polynomials,rational maps, entire tran- scendental maps, and meromorphic functions—can lead to very different dynamical behav- iors. For simplicity we will initially concentrate on polynomials, since many of the basic properties and definitions we describe for polynomials extend to other kinds of functions. We will also sketch some of the different behaviors that arise in other maps towards the end of this paper. Let P be a polynomial in the complex plane. The goal is to understand the behavior of this function when it is iterated. So let the second iterate of P be P 2 P P and, D ı inductively, let the nth iterate of P be P n P P n 1. Given z C, then the ques- D ı 2 tion is: what happens to the orbit of z, i.e., the sequence of points z; P.z/; P 2.z/; : : :? Many different types of orbits can occur. For example, the orbit of z could be periodic of period n; that is, for some n > 0 we have P n.z/ z. Or it could be eventually periodic, D meaning that P j n.z/ P j .z/ for some n; j > 0. The orbit could also tend to in the C D 1 plane. And, as we shall see later, there are various other possibilities for the behavior of these orbits. One of the most important objects in complex dynamics is the Julia set of P which we denote by J.P /. This set has several equivalent definitions. Since P is a polynomial, there is an open set surrounding in the Riemann sphere that consists of points whose 1 orbits simply tend to . This leads to a definition of the Julia set from a geometric pointof 1 view: J.P / is the boundary of the set of points whose orbits tend to . From a dynamical 1 systems point of view, the Julia set is also the closure of the set of repelling periodicpoints. Here a repelling (resp., attracting) periodic point is a point z for which P n.z/ z and D .P n/ .z/ > 1 (resp., .P n/ .z/ < 1). j 0 j j 0 j These two equivalent definitions imply that the Julia set is the chaotic set, for arbitrarily close to any pointin theJuliaset, there are pointswhoseorbitstend to as well as periodic 1 points whose orbitsreturn to themselves. This is sensitive dependence on initial conditions, the hallmark of chaotic behavior. The complement of the Julia set is called the Fatou set; this is the set where the dynamical behavior is usually quite tame. From a complex analysis point of view, J.P / is also the set of points in C at which the family of iterates of P fails to be a normal family in the sense of Montel. This means that, by Montel’s Theorem, any neighborhood of a point in J.P /, no matter how small, is eventually mapped over the entire complex plane (minusat most one point),which provides us with another way to see that the map P is extremely sensitive to initial conditions on its Julia set. There are other types of periodicpoints that will come up later in this paper. A periodic point z of period n is super-attracting if .P n/ .z/ 0. The periodic point is neutral if 0 D .P n/ .z/ e2i . When is rational, the periodic point is called parabolic (or rationally 0 D neutral) and the nearby dynamics are completely understood. But when is irrational the periodic point is irrationally neutral, and there are certain -values where we still have no idea what happens near z. Finally, a periodic point of period one is called a fixed point. Before going into more detail about the mathematics of complex dynamics, let’s first pause and turn back the clock to see how this field emerged one hundred years ago. A Century of Complex Dynamics 17
3 Complex dynamics through 1942 The early study of complex dynamics is dominated by French mathematicians. Nonethe- less significant early developments (and perhaps even its origins) occurred elsewhere in Germany, Poland, Italy, Japan and, in the year of the MAA’s birth, the United States. In order to set the stage for a discussion of the works of Fatou and Julia—as well as the work of the Americans—we will briefly discuss the origins of the field. Those curious to know more about the beginnings of complex dynamics should see [1]. To find find out more about the events discussed in this section, also see [2] and [3].
The origins Beginning in 1883 the French mathematician Gabriel Kœnigs wrote a series of papers out- lining the local theory of the iteration of a complex analytic function. He proved fundamen- tal results involving the existence of repelling and attracting fixed points and developed a surprisingly robust local theory describing the dynamics of iteration on a neighborhood of an attracting (but not super-attracting) fixed point. Other French mathematicians, including mathematicians on whose dissertation committees he served, soon filled in details regarding the local behavior of super-attracting and rationally neutral fixed points. One of Kœnigs’s primary tools was the Schr¨oder functional equation given by S ı f f .p/ S. Given a function f with an attracting (but not super-attracting) fixed D 0 point at p, Kœnigs rigorously demonstrated in [29] that an invertible function S exists on a neighborhood of p satisfying the Schr¨oder equation. Since S f f .p/ S implies ı D 0 that f n.z/ S 1..f .p//n S.z//, solving the Schr¨oder equation models iteration near D 0 p via the linear mapping z f .p/ z on a neighborhood of the origin. That is, in a 7! 0 neighborhood of p, f is analytically conjugate to this linear map. One of the major foci of post-Kœnigs study of iteration was the solution of related functional equations. Kœnigs, however, was not the first to consider iteration of complex functions in a dy- namical context. In 1870–1871, the German mathematician and logician Ernst Schr¨oder (of the Schr¨oder-Bernstein Theorem) wrote two papers [40] and [41] on iterative algo- rithms for solving equations. His interest was piqued by the Newton’s method algorithm f .zn/ zn 1 zn 0 used to approximate solutions to f .z/ 0. When things go well, C D f .zn/ D Newton’s method generates a sequence zn converging to a root of f . f g Schr¨oder’s curiosity about Newton’s method led him into a brief but insightful study of iteration on the complex plane where he discovered the phenomena of attracting fixed f .z/ points. Viewing Newton’s method as the complex function Nf .z/ z , he dis- D f 0.z/ covered that a possibly complex root p of f is also a super-attracting fixed point of Nf . This not only explained to Schr¨oder why Newton’s method works, but led him to general- ize Newton’s method and create a family of root-solvingalgorithms that continues to draw interest today. Schr¨oder also became interested in the Schr¨oder functional equation. Althoughhe could not solve it for arbitrary f , as Kœnigs did roughly fifteen years later, he used a Schr¨oder 2z equation based on the trigonometric identity i tan.2 arctan.iz// to iterate 1 z2 D 2 C 1 z 2 Nq.z/ C , the Newton’smethod functionfor the quadratic q.z/ z 1. He showed D 2z D 18 A Century of Advancing Mathematics that on the left (resp., right) half-plane N n.z/ 1 (resp., 1). He observed sensitive q ! dependence on initial conditions on the imaginary axis and called attention to behavior we would now term chaotic. In the late 1870s Arthur Cayley independently used very different methods to obtain this same result in [8], but his examination did not involve general principles of iteration, as did Schr¨oder’s. Buoyed by their successful examinations of Newton’s method for the quadratic, Cayley and Schr¨oder each attempted without any success to the find the conver- gence regions for Newton’s method for higher degree polynomials. Both remarked that the obstacles to such a study were quite formidable.
The announcement of the 1918 Grand Prize While neither Kœnigs nor his immediate successors were able to describe iteration in the case where a periodic point p is irrationally neutral, Kœnigs’s greatest frustration appeared to be his inability to extend his study beyond the local behavior of iteration near a fixed point, a fact he explicitly lamented at the conclusion of his 1884 paper on iteration. Things had not improved by 1897, when Leau expressed a similar frustration that he could not find the full domains of solutions to functional equations such as the Schr¨oder equation. Kœnigs wondered aloud whether it was possible to expand the study beyond a neighborhood of a fixed point. Leau thought such an attempt “impractical.” The reasons for Kœnigs and Leau’s failure to move their focus beyond the local are in large measure historical. In France, at least, set theory and point set topology were in their infancy. Important tools in analysis had yet to be invented: for example, Montel’s theory of normal families, which would prove instrumental to the successes of Fatou and Julia, would not be unveiled for almost another decade. It would then be another ten years before its applicability to complex dynamics would be understood, and even then Julia (and to a lesser extent Fatou) kept this insight under wraps for a bit longer. In Kœnigs’sinabilityto extend the study ofiteration beyond thefixed pointare the seeds of the works of Fatou and Julia. Not only did both mathematicians adopt the terminology and techniques of Kœnigs, including the study of functional equations,2 but his failure to extend knowledge of iteration beyond a neighborhood of a fixed point became a primary motivation for their studies. Fatou’s first published work regarding complex dynamics [13] appeared in 1906, and one of its accomplishments is a description of the global properties of iteration for the fam- zk ily of functions z . He continued to study the iteration of complex functions for 7! zk 2 several years before publishingagainC on the subject in 1917 (see [3] for more details about this).There were also other French mathematicians who studied iterationin theearly 1900s, most notably Samuel Latt`es, who published several papers between 1903–1918 on iteration focusing on the iteration of functions with more than one (possibly complex) variable. The desire to extend the study of iteration beyond the neighborhood of a fixed point became central in late 1915 when the French Academy of Sciences announced that the 1918 Grand Prize in Mathematics would be devoted to the study of iteration of complex functions. The Academy cited Kœnigs’s work and suggested that entrants might want to
2Julia, however, intentionally postponed his use of functional equations until after the appearance of his 1918 monograph. A Century of Complex Dynamics 19 focus on the iteration of rational complex functions of a single variable. With the prize came 3000 francs, a tidy sum in its time. While Fatou had already begun a study of iteration almost ten years before the Grand Prize was announced, Julia had little if any previous experience in complex dynamics and was almost certainly inspired by the announcement.
The awarding of the prize When the contest was announced in 1915, Julia was in the midst of a long recovery from a terrible and disfiguring war injury that he later customarily covered with a nose patch. Julia had entered the war as an exceptionally promising 21 year-old mathematics stu- dent at the Ecole´ Normale Sup´erieure and suffered his wound in January 1915 in the battle of the Chemin des Dames. His recuperation was long and painful, and the severity of his injuries made it difficult for him to do mathematics for quite some time. However, as his recuperation progressed, he took up mathematics again to resounding success. He read mathematics deeply and in 1917 completed his doctoral thesis, which also earned him the Academy’s 1917 BordinPrize. Atsome pointin late 1916 or early 1917, he decided to enter the competition for the 1918 Grand Prix, and by spring 1917 his work was well underway. Meanwhile, Fatou had also been hard at work. The deadline for official entries was December 31, 1917, but results were often announced before formally submitting an entry, and in May 1917 Fatou published [14] which contains several preliminary findings that grew out of his 1906 publication. It is not knownif eithermathematician had suspected theother was planningtoenter the contest before this, but the results Fatou put forth in 1917 evidently startled Julia, who had already independently achieved many of them. At this point, Julia made the tactical decision to submit his own preliminary results to the Academy through a series of sealed letters that would remain unopened until Julia decided otherwise. There was nothing unusual in this, and the Academy even had a special registry dedicated to processing sealed submissions. By the end of May it seems that neither mathematician had thought to apply Montel’s theory of normal families. That changed on June 4 with a short publicationby Montel [33]. During its course, Montel applied his theory of normal families to a sequence of functions. Although neither the application nor the sequence had anything to do with iteration, it wouldbe difficult for eitherFatou and Julia tolookat the sequence that Montel expressed as “f1.z/; f2.z/; : : : ; fn.z/; : : : ” and not think of iteration. This publication evidently opened both men’s eyes to the potential of normal families. However, it seems that neither knew that the other had had the same insight, at least initially. Over the next few months both men found the theory of normal families powerful, and each, mostly likely operating in ignorance—but perhaps in suspicion—of what the other was doing, established a series of now fundamental results including the partitioning of the sphere into domains of normality (the Fatou set) and non-normality (the Julia set). While Julia submitted his preliminary findings to the Academy via the sealed letters, Fatou readied the short publication [15] announcing additional preliminary results that appeared on December 17. Since he had submitted his letters prior to the appearance of Fatou’s December 17 announcement, Julia no doubt felt he had established and deserved priority for the results 20 A Century of Advancing Mathematics they contained, and so on December 24 he asked the Academy in [23] for a formal priority judgment. Following established procedures, on December 31, the deadline for the contest, the Academy ruled in Julia’s favor, saying he had indeed communicated his results before the appearance of Fatou’s December 17 announcement. It is unclear, however, what advantage Julia gained by his tactics—unless his goal was to drive Fatou out of the contest—since Fatou decided not to submit an entry. It was a curious decision on Fatou’s part, but he evidently kept his own counsel, and the reasoning behind it remains a mystery. Mich`ele Audin argues in [3] that, had he entered, the Academy would have split the prize between Julia and Fatou, and at the meeting in late December 1918 when the results of the Grand Prize were announced, Fatou did receive a 2000 franc prize for his work in analysis throughout his career. Clearly, the Academy wanted to recognize Fatou, but perhaps they would have chosen the same route and still awarded the Grand Prize to Julia even if Fatou had submitted an entry. The events surrounding the prize proved controversial, and Audin presents a strong case that they were polarizing. For example, Montel and Lebesgue seemed to have had great sympathy for Fatou. On the other hand, other Parisian mathematicians, particularly Emile´ Picard, championed Julia. To complicate matters further, the personalities of Fatou and Julia were quite different. Although Fatou came from a prominent naval family, he suffered from ill health (and per- haps anxiety) much of his life, and consequently did not serve in the military. Despite his friendship with Montel and Lebesgue, he worked as an astronomer at the Paris Observatory rather than as academician in a department of mathematics. Fatou was by nature reticent, and L´eon Bloch, a physicist and friend of Fatou, said that Fatou found it difficult to speak in front of an audience, which suggests, perhaps, a reason why he sought work at the Paris Observatory rather than a teaching position. However, this may not be entirely accurate since Fatou evidently applied to the Coll`ege de France in the early 1920s. Perhaps Fatou’s career choice and lack of military service in the time of war made him a bit of an outsider. Julia on the other hand was a war hero, and during his recuperation from his battle wounds was often visited by Picard and Georges Humbert (the latter of whom issued the Academy’s priority judgement in favor of Julia). Moreover, Julia was a rising young star fifteen years Fatou’s junior. Many young French intellectuals had died in the war, Picard’s elder son included, and to many in the older generation, Julia represented the future. It is important to keep in mind, however, that there is no evidence that any of this came into play during the priority judgement or the awarding of the prize. Much of Humbert’s report cannot be debated. It stated that Julia’s results stemming from the theory of normal families were submitted first, which is true. It claims that the results from Fatou’s publica- tion are by and large present in Julia’s sealed envelopes, also true. The only matter than can be debated is Humbert’s claim that Julia’s results are at times more general.
The work of Fatou and Julia Julia’s prize entry [24] is an almost 200-page monograph concerning the iteration of ratio- nal complex functions of a single variable that was published in 1918. Fatou’s monograph A Century of Complex Dynamics 21
[16], well over 200 pages, also focuses almost exclusively on rational functions and was published in three parts beginning in 1919. One assumes that at least part of Fatou’s mono- graph was originally intended to be submitted for the Grand Prize. Fatou and Julia’s monographs collectively form the bedrock of contemporary complex dynamics. Partitioning the plane into domains of normality and non-normality, they ex- ploited the deep connections between Montel’s theory of normal families and complex dynamics. Fatou and Julia each understood the topological structure of the Julia and Fatou sets, as well as thedynamics of iterationon each, includingthefact that theforward orbitof a neighborhoodof a point in the Julia set encompasses the entire sphere, with the exception of at most two points. Likewise, they each showed that the domain of normality contains zero, one, two or infinitely many components.3 This last result helps explain the difficulty that Schr¨oder and Cayley had in extending their analysis of Newton’s method to the cubic: since each of the three roots of a cubic corresponds to a separate component of the Fatou set, there must be infinitely many, and their methods were simply not up to the task of understanding this. Fatou and Julia each offered proofs that fractal Julia sets were the norm, not the ex- ception, and explored many now famous examples. One fascinating aspect of their work was their ability to understand what now famous Julia sets looked like. Despite lacking the computational means to visualize such sets, they were able to explain what they perceived using existing examples from mathematics such as the Koch snowflake, which Helge von Koch introduced in 1906. Julia’s schematic of the Julia set for z . z3 3z/=2 (which 7! C bears some similarity to the left image in Figure 1), is based on the Koch curves, and Fatou invoked Koch as well. Fatou explored hypothetical regions that he called singular domains, that is, compo- nents of the Fatou set on which the family of iterates of f forms a normal family but is not contained in a domain of attraction for a periodic orbit.He was perfectly candid that he did know whether such regions even exist; nonetheless he established a limit upon them. The reader might recognize these regions as Siegel disks or Herman rings;4 to Fatou, how- ever, their ultimate character was unknown, and he was careful not to speculate what they might look like. In contrast, Julia doubted the existence of such regions, and in a brief 1919 follow-up to his monograph outlined a proof that Siegel disks could not exist [25]. In the mid-1930s, Julia realized that his argument contained an error, yet this did not seem to shake his confidence that his claim was correct. While the studies of each man are remarkably similar there are differences. Most strik- ing among them perhaps is Fatou’s openness about the possible existence of singular do- mains whose existence Julia denied. Interestingly, Fatou even remarked upon Julia’s denial and seemed not to take it as gospel. There were also differences in style: Julia wrote in an austere axiomatic style while Fatou’s account was looping and discursive, often revisiting ideas, much as a novelist might return to a character many times to better depict her maturation.
3At the time of Julia’s submission, Latt`es’ example of a function whose Julia set encompasses the entire Riemann sphere was unknown to Julia, although he speculated that such functions quite possibly exist. Once Latt`es’ result was known, both Fatou and Julia seemed rather nonplussed by it. 4A Siegel disk is a componentof the Fatou set on which the map is conjugate to rotation of a disk and will be discussed in more detail later in this section and in 4. A Herman ring is a componentof the Fatou set on which the map is conjugateto a rotation of an annulus. Herman rings will be discussed in 5. 22 A Century of Advancing Mathematics
Complex dynamics in the US: 1915–1917 Perhaps the most stubborn problem Julia and Fatou encountered involved iteration around an irrationally neutral fixed point p, that is, one whose derivative is f .p/ e2i with 0 D irrational. We know now that such a fixed point could be in the Fatou set, in which case a Siegel disk exists, or p could be in the Julia set, J.f /. The only result that either mathematician stated regarding this case was Julia’s mistaken proof that Siegel disks do not exist. Unbeknownst to them, however, a mathematician in the United States, George Pfeiffer, had already proved a substantial result. In April 1917 he published the paper [35] in the Transactions of the American Mathematical Society in which he found conditions on the derivative f 0.p/ of an irrationally neutral fixed point p that precluded the existence of a convergent solution S to the Schr¨oder equation S f f .p/ S. In other words,he found ı D 0 conditions which imply that an irrationally neutral fixed point is in J.f /. Pfeiffer had already announced this result in presentations to the AMS in October 1915 and April 1916,as well as ina footnotein the 1915 paper [34] on conformal arcs published in the American Journal of Mathematics. His 1917 paper cited the work of Kœnigsas well as others who investigated the iteration of complex functions and the associated functional equations, and explicitly noted that his was the first to produce any definitive result in the case where the derivative of the fixed point f 0.p/ was an irrational root of unity. Pfeiffer constructed a function f with an irrationally neutral fixed point at p whose derivative f 0.p/ satisfies a convoluted recursion relation. Next, he deduced a function k S 1 sk.z p/ which algebraically satisfies S f f .p/ S by assuming D k 0 ı D 0 such a functionD exists, and then solving for its coefficients. He showed that the denomina- P tors of the sk become quite small as k forcing the coefficients to grow quite large ! 1 which causes S to diverge on any neighborhood of p. In other words, Pfeiffer constructed a function S with small divisors. He remarked in his paper that he had received a helpful (but unspecified) suggestion from George David Birkhoff. Birkhoff was no doubt familiar with small divisors problems in celestial mechanics, and perhaps he gave Pfeiffer advice on treating them. Pfeiffer observed that he became interested in Schr¨oder equation via the lectures of another American mathematician, Edward Kasner,5 a founding member of the MAA who taught Pfeiffer at Columbia. Kasner’s lectures involved conformal invariants, which link to the Schr¨oder equation, though not in the context of complex dynamics. In 1918 Pfeiffer published a follow-up [36] to his 1917 paper concerning a related functional equation, g2 f , where f is given, but was known more as a teacher than D a researcher, although he did serve as an editor for the Annals in the 1920s. Pfeiffer later taught at Princeton before settling in at Columbia where he taught until his death in 1943. It is probably not surprising that Julia and Fatou worked in ignorance of Pfeiffer’s results. The war no doubt made the transportation of American journals and mathematical ideas problematic, and it is not clear that they even looked to America for help.
5Kasner is perhaps most famous for his association with the words “googol” and “googolplex”, which he coined, he says, after asking his nephews,who were young children at the time, what they might call a very large number. Others might know him in conjunction with his co-authoring of Mathematics and the Imagination with James R. Newman. A Century of Complex Dynamics 23
Nonetheless, there was a burgeoning interest in iteration in America in 1915 which, in addition to Pfeiffer’s announcements, saw the publication of papers involving iteration by two other American mathematicians. As was the case with Pfeiffer’s announcements, these works also predated the French Academy of Sciences’ December 1915 Grand Prize announcement. The first paper [4] was written by another founding member of the MAA, Albert A. Bennett, and the other [37] by the mathematician Joseph Fels Ritt, who later published periodically in the MAA circle of magazines and became a life-long member of the MAA in the early 1920s. Bennett’s paper, appearing in the Annals in September 1915, came before Ritt’s and represents the first American research paper to look at the iteration of complex functions. While Bennett’s paper does not contain any important new results, its greatest benefit was an introductionto US readers of the results of Kœnigs and others. Bennett followed up this paper with [5] the next year on the iteration of functions of several variables. While Pfeiffer traced his interest in functional equations to problems arising out of lectures by Kasner, it is not clear what sparked Bennett’s interest in iteration. A 1914 letter written by Oswald Veblen to Birkhoff discussed a conversation he had with Bennett while they were both in Paris in which he had urged Bennett to seek new mathematical directions. Perhaps Bennett’s paper is the fruit of that discussion. Bennett went on to a distinguished mathematical career at Brown after teaching at Princeton. He also served the MAA in several capacities including as a member of the Council (equivalent to the current-day Board of Governors), Vice-President, Trustee, and Editor-in-Chief of the Monthly. In 1967 he wrote a history of the pre-World War II MAA [6] that appeared in the Fiftieth Anniversary Issue of the Monthly.He died in 1971. Ritt’s paper appeared in the Annals in December 1915 and concerned the so-called Babbage functional equation, f n f for a real function f , an equation that the British D logician and mathematician George Babbage examined in early 1800s. This paper was the first of several by Ritt to concern iteration, some of which made lasting contributionsto the field, especially his 1923 paper [39] in the Transactions on complex permutable functions, that is, functions f and g which satisfy f g g f which Fatou and Julia had also ı D ı studied. Setting g f n, it follows that f n f f f n, so permutable functions are D ı D ı linked to the process of iteration. Ritt, an important American mathematician who enjoyed a long career at Columbia untilhisdeath in 1951,was a student of Kasner. He publishedhis first results onthe iteration of complex functions in France in early 1918 in the same journal that Fatou published his preliminary results [38]. Since Ritt’s interest in iteration stems back to 1915 prior to the announcement of the 1918 Grand Prize, one wonders if he considered submitting an entry to it. While the American interest in iteration waned, it did not disappear. As we will see, a paper fundamental to the study of complex dynamics was published in the Annals in 1942, although the author was not an American mathematician.
1920–1942 Following their great monographs on the iteration of rational complex functions, Julia and Fatou each studied dynamics well into the 1920s, writinghundreds of pages and over forty 24 A Century of Advancing Mathematics publications between them. While none of these works had the majesty of their mono- graphs, there were important works among them. Beginning in 1919 Julia applied techniques involving normal families honed in his study of iteration to the so-called “curves of Julia,” which result from examining the values a function f takes along an angle whose vertex is an isolated essential singularity [26]. In 1922 Fatou examined the dynamics of a particular kind of algebraic function in [17], and in 1926 published a foundational work on the iteration of transcendental functions [20], each of which opened new lines of inquiry. In the early 1920s, both wrote important papers on permutable functions [18], [27] (another topic introduced by Kœnigs!) and explored the iteration of functions of more than one variable [19], [28]. There were others abroad who were inspired by their studies. The renowned Japanese complex analyst, Kiyoshi Oka, became intrigued by complex dynamics in the late 1920s, and even travelled to Paris where he began a long, still unpublished paper on permutable functions that drew upon the studies of Ritt, Fatou and Julia.6 In Germany, Hubert Cremer steeped himself in Fatou and Julia’s monographs and in 1924 gave a presentation at the Mathematics Colloquiumat the University of Berlin that introduced their ideas to a German audience. Cremer’s interest in the subject grew. Beginning in 1927, he took up the study of irra- tionally neutral fixed points, which he continued through a series of papers over the next decade. Unlike Fatou and Julia, he read and acknowledged Pfeiffer’s work, and Cremer’s best known result is actually a refinement of Pfeiffer’s discovery of (to use the contempo- rary point of a view) irrationallyneutral points p that belong to the Julia set [9].
The conditionsthat Pfeiffer placed on f 0.p/ defy concise explanation. It was Cremer’s genius to find conditions that can be easily expressed: Let f be a rational function of a single complex variable of degree s with an irrationally neutral fixed point at p. If
sn n lim inf .f 0.p// 1 0; n 1;2;::: j j D D p then a convergent solution to the associated Schr¨oder equation S f f .p/ S does not ı D 0 exist. A few years later, in connection with his interest in maps of annuli, Cremer obtained another important result in [10], namely, that if a singular domain (a component of the Fatou set that is not part of a domain of attraction) exists for a rational function, its degree of connection is at most two. Moreover, he also showed that doubly connected singular domains could not exist if f was entire. While he did not prove such domains exist, his result serves as an anticipation of Herman rings. Like Fatou, Cremer remained agnostic towards the existence of Siegel disks or Herman rings throughout his study but seemed skeptical of the validity of Julia’s proof that Siegel disks could not exist. It seems reasonable to assume that Cremer tried to show the existence of irrationally neutral fixed points that were not in the Julia set, that is, that Siegel disks exist. If so, he was unsuccessful, but his work suggests an explicit connection between number theory and the center problem, one that was also implicit in Pfeiffer’s paper: Cremer showed that the
6This paper is available on the web at www.lib.nara-wu.ac.jp/oka/ikou/s19/p000-1.html. It is speculated, but not documented,that Oka met and perhapsstudied with Julia. A Century of Complex Dynamics 25 lim-inf conditions that he imposed upon f .p/ e2i (stated above) forces to be a 0 D Liouville number, which are said to be well-approximated by rational numbers.
It turns out that in order for a Siegel disk to exist, the conditions on f 0.p/ need to be flipped: if is “highly irrational,” that is, the continued fraction expansion of consists of a collection of integers that are bounded above, then a Siegel disk surrounding p exists and p is in the Fatou set. Indeed, in 1942 Karl Ludwig Siegel, a German mathematician who came to Princeton to escape Nazi Germany, published a remarkably important paper whose slenderness—six pages—belies its impact [24]. Siegel showed that if is highly irrational, then a convergent solution to the Schr¨oder equation S f f .p/ S exists. In other words, iteration around ı D 0 such an irrationally neutral fixed point is conjugate to an irrational rotation by 2. Siegel’s construction of S relies on delicate bounds on the coefficients of S whose denominators are quite small. Siegel’s solution thus represents a successful resolution of a small divisors problem—itself an important achievement. Indeed, J¨urgen Moser, who after the war was a student of Siegel’s back in Germany, found inspiration in Siegel’s work for his own studies of what was to become known as KAM theory.7 Siegel’s result closed a door on a phase in the development of complex dynamics that began with Fatou’s 1906 paper. The center problem in complex dynamics was arguably the most obvious of the problems Fatou and Julia left unresolved in their monographs. While research in the iteration of complex dynamics never completely stopped—soon after the war Paul Charles Rosenbloom published a short paper on fixed points of entire functions and Irvine Noel Baker began his own exploration of entire functions in 1955—it is safe to say that the subject no longer received the attention it had prior to the war, nor would it for quite some time.
4 The renaissance of complex dynamics
While there certainly was some work going on in the field of complex dynamics in the period 1942–79, nothing compares to what happened in 1979. At that time, Benoit Man- delbrot was working at the IBM Thomas J. Watson Research Center, home to some of the most powerful computers of the day. Interestingly,BenoitMandelbrot had an uncle, Szolem Mandelbrojt, who was also a mathematician. Szolem was a student of Jacques Hadamard and later succeeded him as a Professor at the Coll`ege de France. Mandelbrojt worked in the field of complex analysis and was familiar with the work of Julia and Fatou. He eventually informed Benoit Mandelbrot about the interesting objects that Julia and Fatou had thought about so many years earlier, and so Mandelbrot decided to have a look at these objects us- ing computer graphics. What he saw astounded him (as well as the rest of the mathematical community). Mandelbrot decided to concentrate for simplicity on quadratic polynomials. It is well known that any such quadratic map is dynamically equivalent to one of the form Pc .z/ D z2 c where c is a complex parameter. Now, when c 0, the Julia set of z2 is the unit C D circle; all pointsoutside the unit circle have orbitsthat tend to , while all pointsinsidethe 1 unit circle have orbits that tend to 0, which is therefore an attracting fixed point. Similarly,
7For more about Siegel’s solution and its connection to KAM theory, see [2]. 26 A Century of Advancing Mathematics the Julia set of z2 2 is the interval Œ 2; 2 on the real axis in C, though this is a little harder to prove. It turns out that these are the only two “computable” Julia sets for z2 c; C all other Julia sets for z2 c are fractals. C Without going into details, a fractal object is a set that is everywhere self-similar (if you zoom in on the set, you see the same structure over and over again) and that also has the property that its “fractal” dimension (usually the Hausdorff dimension) exceeds its topological dimension. For Julia sets of z2 c, the topological dimension is just 1 if this set C is connected and it is 0 otherwise, but when c 0; 2, the fractal dimension is often not ¤ an integer. For example, the Julia set for c 1 is the “basilica” and for c :12 :75i D D C it is the “Douady rabbit.” See Figure 1. Zooming in to the rabbit shows that the rabbit’s ears have ears, and those sub-ears have ears, etc., etc. That is self-similarity. Mandelbrot, the father of fractal geometry, was intrigued.
Figure 1. The Julia sets for z2 1 (the basilica) and z2 0:12 C :75i (the Douady rabbit). Colored points have orbits that escape to 1 while black points have orbits that tend to a periodic orbit of period 2 in the basilica case and of period 3 in the rabbit case. So the Julia sets here are the boundaries of the black and colored regions.
Mandelbrot plunged more deeply into the quadratic case. Julia and Fatou knew that the Julia set of z2 c was either a connected set or else a Cantor set, i.e., a totally disconnected C set. There are no quadratic Julia sets that consist of 2 or 20 or 200 components; either the Julia set is one piece or it consists of uncountably many pieces, each of which is a point. And Julia and Fatou also knew that, amazingly, it was the orbit of 0 that determines this: if n P .0/ , then J.Pc / is a Cantor set, but if the orbit of 0 behaves otherwise, J.Pc / is c ! 1 a connected set. The reason that the orbit of 0 determines this is that 0 is the only critical point for z2 c and the fate of the “critical orbits” essentially determines everything in C complex dynamics, something Fatou and Julia both understood well. (For higher degree polynomials, there are usually more critical orbits and so the structure for these maps is more “complex.”) So Mandelbrot decided to draw the picture of all those c-values in the complex plane for which the orbit of 0 does not tend to . What astonishingly comes out is one of the 1 most famous and most beautiful objects in all of mathematics, the set that now bears his name, the Mandelbrot set. See Figure 2. A Century of Complex Dynamics 27
Figure 2. The Mandelbrot set and a magnification. Colored points are c-values for which the orbits of 0 escape to 1; black points are c-values for which this does not happen. So the Mandelbrot set is the black region in these images.
The black bulbs visible in the Mandelbrot set each contain parameters for which there is an attracting periodic orbit of some given period. For c-values in the large main cardioid, each Pc has an attracting fixed point, and the corresponding Julia set is a simple closed curve. The large bulb to the left of the main cardioid is actually an open disk of radius 1=4 centered at c 1 and c-values here give rise to an attracting cycle of period 2 (the D basilica is the Julia set that arises when c is at the center of this disk). And the two large disks above and below the main cardioid correspond to parameters for which there is an attracting cycle of period 3; the Douady rabbit sits at the center of the northern period-3 bulb. After the appearance of the Mandelbrot set, many mathematicians jumped in and con- tinued the work of Fatou and Julia. Luckily, the areas of mathematics known as dynamical systems and complex analysis had made important strides forward during the prior fifty years, and many new tools were therefore available to extend the earlier results. One of the most important new results was Sullivan’s No-Wandering Domains Theorem [45] from 1985. In this paper Sullivan showed that any component of the Fatou set must be eventu- ally periodic in the case of polynomials or rational maps.8 In particular, it then follows that there are only three types of Fatou components in the polynomial case: 1. Attracting basins, in which all points tend to a particular attracting periodic orbit which therefore lies in the Fatou set; 2. Parabolic basins, in which all pointstend to a periodic orbit of period n that now lies in the Julia set and for which the derivative of P n is of the form exp.2i.p=q//; 3. Siegel disks. Along the boundaries of the bulbs in the Mandelbrot set are the c-values for which n Pc has a cycle that is neutral, i.e., the derivative of P is of the form exp.2i/. If is rational, then we are in the case of a parabolic basin. If is “highly irrational” we are in
8Although it is a natural to ask if wandering domains exist, neither Fatou nor Julia seem to have raised this question in their published works. 28 A Century of Advancing Mathematics the Siegel disk case. See [32] for the precise technical definitions of highly irrational. But there are certain irrational values of , for example the ones Pfeiffer and Cremer found, for which we do not have a Siegel disk. What happens here dynamically is stillnot understood. Think about this: if the quadratic function z2 c has a fixed point whose multiplier is a C not-so-irrational number, we still do not know what happens near this fixed point. This is one of the major open problems in complex dynamics. Another important contribution in the 1980s was made by Douady and Hubbard [12]. It is well known that the basin of attraction Bc of in the Riemann sphere is an open disk 1 when c lies in the Mandelbrot set. Hence, by the Riemann Mapping Theorem, there is an analytic homeomorphism c Bc D that takes to 0 and for which .0/ a > 0. W ! 1 c0 D Douady and Hubbard showed that this map actually conjugates the map z2 on the disk D 2 to Pc in Bc. That is, c.Pc .z// .c .z// . This implies that Pc behaves dynamically 2 D 2 on Bc just like z does in D. Since z interchanges the straight rays lying in the unit disk and given by exp.2it/, the curves that are mapped to these straight rays by c are also interchanged by Pc. These curves are called external rays of angle and we denote them by .t/. If the limit as t 1 of .t/ is a unique point in J.Pc /, then we say that ! the external ray lands at this limit point. And, if all such external rays land, then we essentially know the dynamics on the Julia set since the straight rays are permuted by z2. This may not happen, however. For example, if the Julia set is a locally connected set, then all of the external rays do indeed land. But if J.Pc / is not locally connected, then some rays may only accumulate on a portion of J.Pc /. This is what may happen when we have those not-so-irrational parameters in the boundary of the Mandelbrot set. More importantly, the same external ray construction can be carried over to the pa- rameter plane. Let ˆ be the map defined on the complement of the Mandelbrot set in the c-plane given by ˆ.c/ c .c/. Douady and Hubbard [12] also show that ˆ is an analytic D homeomorphism onto D. The main open problem involving the Mandelbrot set is then: Conjecture. The boundary of the Mandelbrot set is a locally connected set. If this conjecture is true, then all of the corresponding external rays in the parameter plane land at unique points in the boundary of the Mandelbrot set. In this case, we would then get a complete map of the Mandelbrot set that tells us everything about its struc- ture: how the bulbs containing periodic cycles are arranged; how the parameters along the “antennas” on the bulbs are situated, etc. Despite the fact that we are dealing here with the relatively simple map z2 c, this conjecture seems to be a long way from being re- C solved. In particular, a recent result of Buff and Ch´eritat [7] shows that certain Julia sets for quadratic polynomials that contain those not-so-irrationalfixed points can have positive Lebesgue measure. This means that things are even more complicated than most complex dynamicists had thought back in the 1980s. Furthermore, a result of Shishikura [42] states that the Hausdorff dimension of the boundary of the Mandelbrot set is 2, so this boundary is also an extremely complicated object.
5 Rational maps Complex rational maps are naturally more complicated than polynomials, primarily be- cause there often is no basin of attraction at and there are usually many more critical 1 A Century of Complex Dynamics 29 orbits. So, to simplify matters, we concentrate here on the family of degree 2n rational maps given by
n F.z/ z D C zn n where we assume n 2. It turns outthat is an attracting fixed point in C since F z 1 when z is large, so we do have an immediate basin B of . Also, one checks easily j j 1 that the critical points are given by 1=2n. However, there are only two critical values given by 2p. And, just as in the case of z2 c, there really is only one critical orbit (up to ˙ C symmetry). This follows from the fact that, if n is even, both critical values then map to the same point, whereas, if n is odd, the map is symmetric under z z, so the orbitsof both 7! 2p behave symmetrically. ˙ The Fatou set for a rational map can now contain a kind of set that does not occur with a polynomial, namely a Herman ring. First discovered by Herman in 1979 [22] right
1=4 1=16 D D
0:01 0:001 D D Figure 3. Various Sierpinski curve Julia sets drawn from the family z2 C=z2; all of thesesetsare homeomorphic, but it is known that the dynamical behavior on each of these sets is very different. The red regions are the preimages of B. 30 A Century of Advancing Mathematics around the time the Mandelbrot set was first observed (although, as noted above, Cremer anticipated Herman rings in the early 1930s), these regions are (eventually) periodic an- nular regions of period n in which all points rotate around distinct simple closed curves under a given irrational rotation. The reasons these types of Fatou domains do not occur for polynomials is that there has to be a pole inside one of these Herman rings; otherwise, all points inside these annuli would be mapped to corresponding points inside the image annuli. So the iterates would form a normal family in these disks. Unlike quadratic polynomials where there were only two types of Julia sets depending on the escape behavior of the critical orbit, there is now an “escape trichotomy” for this family. Since we have a basin of attraction B at and a pole at 0, there is a neighborhood 1 of 0 that is mapped to B. If this neighborhood is disjoint from B we call it the trap door T since any orbit that eventually enters B must do so by passing through T. Then there are three possible types of Julia sets depending upon the behavior of the critical orbit:
1. If the critical values lie in B (if one does, the other must also due to the z z 7! symmetry), then the Julia set of F is a Cantor set;
2. If the critical values lie in T, then J.F/ is a Cantor set of simple closed curves sur- rounding the origin [31];
3. In all other cases J.F/ is a connected set, and if the critical values do not lie in B or T but the critical orbit eventually enters B, then J.F/ is a Sierpinski curve. A Sierpinski curve is a planar set that is homeomorphic to the well-known Sierpinski carpet fractal. See Figure 3 for several Sierpinski curve Julia sets that arise in the family z2 =z2. These sets are very important from a topologicalpoint of view in that they form C a dictionary of all possible plane curves. More precisely, given any one-dimensional plane continuum, this curve can be homeomorphically manipulated so that it can be embedded in the Sierpinski carpet [44].
6 Entire functions Now we turn to the very different case of entire transcendental functions where the pos- sibilities for Fatou sets (as well as Julia sets, as we will soon see) become even richer. Wandering domains are now possible. These are Fatou domains that are never eventually periodic. For example, the map z z 2 sin z has a wandering domain. The vertical 7! C lines given by Re z 2k for k Z are easily seen to be invariant under this map and D 2 each lies in the Julia set. However, neighborhoodsof the critical points given by =2 2k C lie in the Fatou set and all wander off to . 1 Another new possibilitythat arises for the Fatou set is a Baker domain. These are open sets extending to in which all orbits tend to . But, unlike the quadratic polynomial 1 1 case, there is no longer an open disk that completely surrounds the point at . Since is 1 1 an essential singularity there are points in the Julia set that are arbitrarily close to . An 1 example of this arises in the map z z e z 1, where points in the right half-plane 7! C C tend to . This was shown by Fatou in 1926 in [20]. 1 The analogue of quadratic polynomials in the entire transcendental case is the expo- nential function E.z/ exp.z/. There are no critical points for this function, but there D A Century of Complex Dynamics 31
Figure 4. A small piece of the Cantor bouquet for E with < 1=e and the ensuing explosion when > 1=e. Colored points again have orbits that escape to 1 and so, in this case,lie in the Julia set. is what is known as an asymptotic value, namely 0. This is the omitted value for the ex- ponential maps and, moreover, any curve tending to in the far left half-plane is mapped 1 to a curve that limits on the asymptotic value. As a consequence, 0 plays the same role as the critical points do in the case of polynomials or rational maps. But now, a very different phenomenon occurs. A theorem of Goldberg, Keen, and Sullivan [21], [45] says that, if the orbit of the asymptotic value 0 tends to , then J.E/ is now the entire complex plane. 1 Now consider the family E where R . The graphs of E along the real axis show 2 C that, if > 1=e, then the orbitof 0 (in fact, all orbitson the real axis) tend to . So, in this 1 case, J.E/ C. But, if < 1=e, there exist one attracting and one repelling fixed point D in RC. Moreover, it is easy to check that all points to the left of the repelling fixed point in RC are contracted into a disk lying to the left of this half-plane. So, by the Contraction Mapping Principle, these points all have orbits that tend to the attracting fixed point, and so this half-plane lies in the Fatou set. In fact, when 1=e, it is known that J.E/ is a Ä Cantor bouquet, i.e., a collection of infinitely many disjoint smooth curves with endpoints that extend to in the right half-plane. 1 So there is an amazing explosion in the Julia sets for these maps when passes through 1=e. See Figure 4. When 1=e, the Julia set lies in the right half-plane, but when Ä > 1=e, suddenly J.E/ C. No new periodic points are born as passes through 1=e; D rather, all of the repelling periodic points move continuously and suddenly become dense in the complex plane. What a change! See Figure 4.
7 The future of complex dynamics The natural question is: where is the field ofcomplex dynamics heading in the next century? Already there have been many excursions into areas outside of polynomial dynamics, like the study of rational and entire maps alluded to above. But much more is beginning to hap- pen and likely to expand in the future. This includes the study of other complex maps (like meromorphic functions) as well as higher dimensional complex analytic maps. Another recent topic of interest is algebraic dynamics where questions involving algebraic aspects 32 A Century of Advancing Mathematics
(rather than the dynamical behavior) of iterated functions arise. And much more is on the horizon. The beauty of this expansion includes the fact that many distinct areas of math- ematics now enter the picture, including dynamical systems, complex analysis, topology, number theory, and algebraic geometry. And one final note. Complex dynamics is a field that is quite accessible to undergrad- uate students. After all, the primary topic of interest is the simplest nonlinear function, z2 c. Many undergrads can begin by studying the quadratic family and then move on C to investigate other families of functions (their own choice: cubics, quartics, trigonometric functions, etc.) The beauty of this is, while the complete understanding of these maps will certainly be elusive, nonetheless, in many cases, the students become the first mathemati- cians to see the interesting behavior in their chosen family of interest. This definitely sparks their interest in research-level mathematics.
Bibliography [1] D. Alexander, A History of Complex Dynamics: From Schr¨oder to Fatou and Juila, Aspects of Mathematics, Vol. 24, Vieweg, Heidelberg, 1994. [2] D. Alexander, F. Iavernaro, and A. Rosa, Early Days in Complex Dynamics: A History of Com- plex Dynamics in One Variable During 1906–1942, History of Mathematics Vol. 38, American Mathematical Society, Providence, and London Mathematical Society, London, 2011. [3] M. Audin, Fatou, Julia, Montel, The Great Prize of the Mathematical Sciences of 1918, and Beyond, Lecture Notes In Mathematics Vol. 2014, History of Mathematics subseries vol. 1, Berlin, Springer-Verlag, 2011. [4] A. A. Bennett, The iteration of functions of one variable. Ann. Math. 17 no. 1 (1915), 23–60. [5] ———, A case of iteration in several variables. Ann. Math. 17 no. 4 (1916), 188–196. [6] A. A. Bennett, Brief history of the Mathematical Association of America before World War II. MAA Monthly 74 no. 1, pt 2: Fiftieth Anniversary Issue (Jan, 1967), 1–11. [7] X. Buff and A. Ch´eritat, Julia sets with positive measure. Ann. Math 176 2012, 673–746. [8] A. Cayley, Applications of the Newton–Fourier method to an imaginary root of an equation. J. Math. Pur. Appl. 16 (1879), 179–185. [9] H. Cremer, Zum zentrumproblem, Math. Ann. 98 (1927), 151–163. [10] ———, Uber¨ die Schr¨odersche funktionalgleichung und das Schwarzsche eckenabbil- dungsproblem. Leipziger Berichte 84 (1932), 291–324. [11] R. L. Devaney, D. M. Look, and D. Uminsky, The escape trichotomy for singularly perturbed rational maps. Indiana Univ. Math.J. 54 (2005), 1621–1634. [12] A. Douady, and J. Hubbard, It´eration des polynomes quadratiques. C. R. Acad. Sci. Paris 294 (1985), 123–126. [13] P. Fatou, Sur les solutions uniformes de certaines ´equations fonctionnelles. C. R. Acad. Sci. Paris 143 (1906), 546–548. [14] ———, Sur les substitutions rationnelles. C. R. Acad. Sci. Paris 164 (1917), 806–808. [15] ———, Sur les substitutions rationnelles. C. R. Acad. Sci. Paris 165 (1917), 992–995. [16] ———, Sur les ´equations fonctionnelles. Bull. SMF 47 (1919), 161–271; Bull. SMF 48 (1920), 33–94 and 208–314. [17] ———, Sur l’it´eration de certaines fonctions alg´ebriques. Darboux Bull. 2 no. 46 (1922), 188– 198. A Century of Complex Dynamics 33
[18] ———, Sur l’it´eration analytique et les substitutions permutables. J. Math. Pur. Appl. 2 (1923), 343–384; 3 (1924), 1–49. [19] ———, Substitutions analytiques et ´equations fonctionnelles `adeux variables. Ann. Sc. Ec.´ Norm. Sup. 3 no. 41 (1924), 67–142. [20] ———, Sur l’it´eration des fonctions transcendantes enti`eres. Acta Math. 47 (1926), 337–370. [21] Goldberg, L. and Keen, L. A finiteness theorem for a dynamical class of entire functions. Er- godic Theory and Dynamical Systems 6 (1986), 183–192. [22] M. Herman, Sur la conjugasion diff´erentiable des diff´eomorphisms du cercle `ades rotations. Publ. Math. de IHES 49, (1979), 5–233. [23] G. Julia, Sur les substitutions rationnelles. C. R. Acad. Sci. Paris 165 (1917), 1098–1100. [24] ———, M´emoire sur l’it´eration des fonctions rationnelles. J. Math. Pur. Appl. 8 no. 1 (1918), 47–245. [25] ———, Sur quelques probl`emes relatifs `al’it´eration des fractions rationnelles. C. R. Acad. Sci. Paris 168 (1919), 147–149. [26] ———, Sur quelques propri´et´es nouvelles des fonctions enti`eres ou m´eromorphes. Ann. Sc. Ec.´ Norm. Sup. 3 no. 36 (1919), 93–125;37, 3 no. 37 (1920), 165–218; 3 no. 38 (1921), 165–181 [27] ———, M´emoire sur la permutabilit´edes fractions rationnelles. Ann. Sc. Ec.´ Norm. Sup. 3 no. 39 (1922), 131–215. [28] ———, Sur les substitutions rationnelles `adeux variables. C. R. Acad. Sci. Paris 175 (1922), 1182–85; 176 (1923), 58–60 [29] G. Kœnigs, Recherches sur les int´egrales de certaines ´equations fonctionnelles. Ann. Sc. Ec.´ Norm. Sup. 3 no. 1 (1884), 1–41. [30] L. Leau, Etude´ sur les ´equations fonctionelles `aune ou plusieurs variables. Ann. Fac. Sci. Toulouse 1 no. 11 (1897), 1–110. [31] C. McMullen, Automorphisms of rational maps. Holomorphic Functions and Moduli. Vol. 1. Math. Sci. Res. Inst. Publ. 10. Springer, New York, 1988. [32] J. Milnor, Dynamics in One Complex Variable, Third Ed. Princeton University Press, 2006. [33] P. Montel, Sur la repr´esentation conforme. C. R. Acad. Sci. Paris 164 (1917), 879–881. [34] G. A. Pfeiffer, On the conformal geometry of analytic arcs. Amer. J.. Math. 37 (1915), 395–430. [35] ———, On the conformal mapping of curvilinear angles. The functional equation ˚Œf .x/ D a1˚.x/. Trans. AMS 18 (1917), 185–198. [36] ———, The functional equation f Œf .x/ D g.x/. Ann. Math. 2 no. 20 (1918), 13–22. [37] J. F. Ritt, On certain real solutions of Babbage’sfunctional equation. Ann. Math. 2 no. 17 (1915), 113–123. [38] ———, Sur l’it´eration des fonctions rationnelles. C. R. Acad. Sci. Paris 166 (1918), 380–381. [39] ———, Permutable rational functions. Trans. AMS 25 (1923), 399–448. [40] E. Schroder, Uber¨ unendlich viele algorithmen zur aufl¨osung der gleichungen. Math. Ann. 2 (1870), 317–365. [41] ———, Uber¨ iterirte funktionen. Math. Ann. 3 (1871), 296–322. [42] M. Shishikura, The Hausdorff dimension of the boundary of the Mandelbrot set. Ann. Math. 147 (1987), 225-267. [43] C. L. Siegel, Iterations of analytic functions. Ann. Math. 43 (1942), 607–612. [44] W. Sierpinski, Sur une courbe Cantorienne qui contient une image biunivoque et continue de toute courbe donn´ee. C. R. Acad. Sci. 162 1916, 629–632. 34 A Century of Advancing Mathematics
[45] D. Sullivan, Quasiconformal homeomorphisms and dynamics I: Solution of the Fatou-Julia problem on wandering domains. Ann. Math. 122 (1985), 401–418.
Daniel Alexander Mathematics Department, Drake University, 2507 University Avenue, Des Moines, IA 50311 [email protected] Robert L. Devaney Mathematics Department, Boston University, 111 Cummington Mall, Boston, MA 02215 [email protected] Map-Coloring Problems
Robin Wilson Open University, UK
Dedicated to the memory of Kenneth Appel
In 1852 Augustus De Morgan was asked whether all plane maps can be colored with just four colors in such a way that neighboringcountries are always colored differently. In 1976 Kenneth Appel and Wolfgang Haken answered this question in the affirmative. But why did this easily stated question take 124 years to be answered, and what was involved in its solution? And since maps drawn on a plane are equivalent to maps drawn on a sphere, can the problem be extended to the coloring of maps drawn on other surfaces? And once these problems were solved, what was there left for map-colorers to do?
1 Early days The earliest reference to map-coloring problems occurs in a letter dated October 23, 1852 from Augustus De Morgan, Professor of Mathematics at University College, London, to Sir William Rowan Hamilton, the distinguished Irish mathematician and astronomer. In this letter, De Morgan described how one of his students had asked whether every map can be colored with only four colors so that neighboring countries are colored differently. A student of mine asked me today to give him a reason for a fact which I did not know was a fact — and do not yet. He says that if a figure be anyhow divided and the compartments differently coloured so that figures with any portion of common boundary line are differently coloured — four colours may be wanted, but not more ...Query cannot a necessity for five or more be invented...My pupil says he guessedit in colouring a map of England. The more I think of it, the more evident it seems. The student was later identified as Frederick Guthrie, who claimed that the problem was due to his brother Francis. Francis Guthrie went on to a mathematical career, but never published anything on the problem. De Morgan became intrigued with the problem and communicated it to other mathe- maticians, so that it soon became part of mathematical folklore. He also stated his belief that the sufficiency of four colors could not actually be proved, but had to be taken as a postulate—a “necessary truth.” The first known printed reference to the four-color problem was a note by F. G. in The Athenaeum of June 10, 1854.It is not known who “F. G.” was: it may have been one of the Guthrie brothers, or possibly Francis Galton, the geographer and gentleman of science who was seeking admission to the Athenaeum Club around that time.
35 36 A Century of Advancing Mathematics
But it was not until after De Morgan’s death that any progress was made in solving it. On July 13, 1878, at a meeting of the London Mathematical Society, the Cambridge mathematician Arthur Cayley enquired whether the problem had yet been solved. Soon afterwards, at Galton’srequest, he wrotea short note[6] for the Royal Geographical Society in which he attempted to explain where the difficulties lay. Cayley also showed that when trying to prove that four colors are always sufficient, one may assume that exactly three countries meet at each point of intersection. To see this, suppose that at each point where more than three countries meet, we stick a circular “patch” over the point, as shown in Figure 1. The resulting map is cubic—it has three countries meeting at each point. If we now color the new cubic map with four colors, we can then obtain a four-coloringof the originalmap by shrinkingeach patch down to a point.In view of this, when desirable, we can assume that all maps under consideration are cubic maps.
1 2 1 2
4 3 1 3 1 2 2
original map add patch color map shrink patch Figure 1. It suffices to consider only cubic maps.
2 Kempe’s ‘‘proof ’’ We now come to one of the most famous mistakes in mathematics. It was made by Alfred Kempe, a London barrister who had studied with Cayley in Cambridge. Kempe published his “proof” that all maps can be four-colored in the newly founded American Journal of Mathematics, edited by Cayley’s friend J. J. Sylvester [11]. Although Kempe’s argument was incorrect, it nevertheless contains some important ideas that resurfaced in the eventual solution to the problem. Indeed, his error is somewhat subtle and his proof was regarded as correct by the mathematicians of the day. Before summarizing the main ideas of Kempe’s fallacious argument, we need a simple lemma. Lemma 1. Every map contains at least one country with at most five neighbors. Proof We use an important result of Leonhard Euler, who observed in 1750 that, for any polyhedron with F faces, V vertices, and E edges, F V E 2: By projecting C D C the polyhedron onto a plane we deduce that, for any map with C countries, P points of intersection, and L boundary lines, C P L 2: C D C Using Euler’s formula, we deduce that L 3C 6: For, at least three lines meet at Ä each of the P intersection points, so 2L 3P (the factor 2 arising since each line has two ends and is counted twice), and so P 2 L; substituting this into Euler’s formula and Ä 3 rearranging gives the desired inequality. To prove the lemma we now assume that every country has at least six neighbors. Counting up the lines bounding all the countries, we obtain 6C 2L (the factor 2 arising Ä Map-Coloring Problems 37 since each line borders two countries and is counted twice); so 3C L 3C 6, which Ä Ä is a contradiction. This proves the result. We can now present Kempe’s argument. Theorem 2. Every map can be colored with four colors in such a way that neighboring countries are assigned different colors. Proof (Kempe) We assume that the result is false and that a map M is a minimal counter- example—thus, M cannot be four-colored but any map with fewer countries can be. It follows from the above lemma that M contains a digon, triangle, square, or pentagon (see Figure 2). We now show that each possibilityleads to a contradiction.
digon triangle square pentagon Figure 2. Every map contains one of these.
Digon or triangle If the map M contains a triangle (a digon is similarly treated), we remove one of its sides, merging the triangle with one of its neighbors. The resulting map has fewer countries and so, by our assumption, this map can be four-colored. When we reinstate the triangle, we can color it with a color not used for its (at most three) neighbors (see Figure 3). This gives a coloring of M —a contradiction.
r b r b y
g g
original map obtain new map color new map color original map Figure 3. Triangle case.
Square If the map M contains a square, we remove one of its sides, merging the square with one of its neighbors. The resultingmap has fewer countries and so, by our assumption, this map can be four-colored. A difficulty may then arise when we try to reinstate the square, since the countries surrounding the square may all be colored differently, leaving no “spare” color to color the square (see Figure 4).
r r
y b y ? b
g g
original map obtain new map color new map try to color original map Figure 4. The problem with the square case. 38 A Century of Advancing Mathematics
To get out of this difficulty we use a Kempe-chain argument, as follows. Consider the red and green countries above and below the square S and investigate whether the map M contains a chain of red and green countries joining the red country and the green country next to S (see Figure 5).
r r g g r g g g r g r r r b b g y S b y S b y y r b g b g g r r g r g r
case 1 case 2 Figure 5. Two situations for the square case.
If there is no such red-green chain of countries,as in case 1,then we can interchangethe colors of the red and green countries above S without affecting the colors of those below S. The square is then surrounded by only the three colors green, yellow, and blue, and so can be colored red. This gives a coloring of M in this case—a contradiction. If, however, there is a connecting chain of red and green countries, as in case 2, then interchanging the colors red and green does not help. But, in this case, we can consider the blue and yellow countries on the left and right of the square. There can be no chain of blue and yellow countries connecting these countries since the red-green chain gets in the way (see Figure 6). So instead we interchange the colors of the blue and yellow countries to the right of S without affecting the colors of those to the left of S. The square is then surrounded by only the three colors yellow, green, and red, and so can be colored blue, giving rise to a coloring of M in this case—a contradiction.
r r g g r g g g r g r r r r b b g g y S b y S y y r b r b g b g g g r g r g r g r r g r
Figure 6. Completing the square case.
Pentagon If the map M contains a pentagon, we remove one of its boundaries, giving a map with fewer countries which, by our assumption, can be four-colored. As for the square, a difficulty arises when we try to reinstate the pentagon, since the countries surroundingthe pentagon may use all four colors, as shown in Figure7. To get around this difficultyKempe used two Kempe-chain arguments. First consider the yellow and red countries above and below the pentagon P . If there is no yellow-red chain connecting these countries, then we can interchange the colors of the yellow and red countries above P without affecting those below P . We can then color the Map-Coloring Problems 39
y g y g
? b b b b
r r
original map obtain new map color new map try to color original map Figure 7. The problem with the pentagon case. pentagon yellow, giving a contradiction. So we may assume that there is a yellow-red chain connecting these countries. Similarly, we consider the green and red countries above and below the pentagon P . If there is no green-red chain connecting these countries, then we can interchange the colors of the green and red countries above P without affecting those below P . We can then color the pentagon green, giving a contradiction. So we may assume that there is a green-red chain connecting these countries. The situation now looks like Figure 8.
y r r g y g r r y P g y b b g r g r y r y y g g r r r y g r
Figure 8. Double Kempe-chain picture for the pentagon case.
We next observe that blue-yellow part to the right of P is separated from the blue- yellow part to the left of P , since the red-green chain gets in the way. Thus, we may interchange the colors of the blue-yellow countries on the right of P without affecting those on the left of P , Similarly, we may interchange the colors of the blue-green countries to the left of P without affecting those on the right of P . The pentagon is then surrounded by only the three colors red, green, and yellow (see Figure 9), so the pentagon can be colored blue and we get a four-coloring of the original map M —a contradiction.
y r r g y g r r y P g y g y g r b r b r y y g g r r r y g r
Figure 9. Double Kempe-chain picture for the pentagon case with the colors switched.
Since we have considered all possibilities and obtained a contradiction in each case, no such counterexample M can exist. This proves the theorem. 40 A Century of Advancing Mathematics
3 Heawood’s bombshell In 1890 Percy Heawood, a lecturer in mathematics at the Durham Colleges (later Durham University), published an article [9] in the QuarterlyJournalofPureandAppliedMathe- matics. In it he apologetically pointed out a fundamental flaw in Kempe’s accepted proof of the four-color theorem, and salvaged enough from it to deduce that every map drawn on a plane or sphere can be colored with five colors. He also generalized the map-coloring problem to surfaces other than the sphere, as we see later. Kempe admitted his error, but could not correct it. He spent the rest of his life as a very effective treasurer of the Royal Society of London, being rewarded with a knighthood. As Heawood observed, where Kempe went wrong was in his treatment of the pentagon. Using a Kempe-chain argument twice, Kempe had made two interchanges of color. Either on its own is valid, but doing both at once may cause two neighboring countries, formerly colored differently, to receive the same color—which is disallowed. An example in which this can occur was presented by Heawood (see Figure 10). In this map every country has been colored red, blue, yellow, or green, except for the central pentagon.
Figure 10. Heawood’s example.
Heawood’s argument was as follows. In Figure 11(a) the blue and yellow neighbors of the pentagon P are connected by a blue- yellow chain, so the red and green countries above P are separated from the red and green countries below P . So we can interchange the reds and greens above P without affecting those below P , as shown in Figure 11(b). Alternatively, in Figure 11(c) the blue and green neighbors of P are connected by a blue- green chain, so the red and yellow countries above P are separated from the red and yellow countries below P . So we can interchange the reds and yellows below P without affecting those above P , as shown in Figure 11(d). Either of these color interchanges is permissible on itsown. Kempe’s error was in trying to do them simultaneously. For, if we interchange the reds and greens and the reds and Map-Coloring Problems 41
g g r
y y y b r b r b g g y g g y g r y r r b r b r b r b g b g b P P P y r y r y r g g g b b b r r r b y g b y g b y g g y g y g y r b r b r b y y y
(a) (b)
g g g
y y y b r b r b r g y g g y g g y g r b r b r b r b r b r b P P P y r y r y y g g g b b b r r y b y g b y g b r g g y g y g r r b r b y b y y r
(c) (d) Figure 11. Heawood’s argument. yellows as described above, then the green country A and the yellow country B in Figure 12 both become red, which is disallowed (see p. 42). So Kempe’s proof, which allowed the possibility of such simultaneous color interchanges, is invalid.
4 From 1890 to 1960
Progress on the four-color problem came slowly, with a number of mathematicians misled by its apparent simplicity. Several investigators chose to study the properties of maps that cannot be colored with four colors, hoping either to prove that such maps cannot possibly exist or to obtain so many restrictions on one that it could actually be constructed. In par- ticular, the American mathematician Philip Franklin [7] proved that such a map must have at least 26 countries, and over the ensuing decades a succession of investigators gradually increased this number to 95. Thus, any counterexample to the four-color theorem would necessarily be complicated. 42 A Century of Advancing Mathematics
A r y originally green b g r y r g b g b P y y g b y b r g g r y b originally yellow
r B
Figure 12. Heawood’s argument.
The eventual proof of the four-color theorem in 1976 depended on two complementary ideas, both of which have their origins in Kempe’s 1879 paper. These fundamental ideas, of an unavoidable set and a reducible configuration,were developed by a number of math- ematicians during the years 1890 to 1976. We now look at these two approaches and see how they led to an eventual solution to the problem. In what follows we assume that all maps under consideration are cubic maps; the justification for doing so was given above. Under this assumption we can deduce from Euler’s formula the following useful counting formula which generalizes Lemma 1. Theorem 3. Given a cubic map with C countries, L boundary lines, and P points of intersection, let Ck be the number of countries with k boundary lines. Then
12 4C2 3C3 2C4 C5 C7 2C8 .6 k/Ck : D C C C D k 2 X Proof On counting up the countries, we get
C C2 C3 C4 C5 C6 C7 : D C C C C C C Counting up the boundary lines around each country, and noting that each boundary line bounds two countries and is therefore counted twice, we have
2L 2C2 3C3 4C4 5C5 6C6 7C7 : D C C C C C C Counting up the points of intersection around each country, and noting that each point lies on the boundary of three countries and is therefore counted three times, we have
3P 2C2 3C3 4C4 5C5 6C6 7C7 : D C C C C C C Substituting these values for C , L, and P into Euler’s formula gives the result. A consequence of the counting formula is that every cubic map must contain a digon, triangle, square, or pentagon, since otherwise (with C2 C3 C4 C5 0) 12 would D D D D equal a negative quantity. We express this by saying that this set of countries forms an Map-Coloring Problems 43 unavoidable set. More generally, a set of configurations of countries is an unavoidable set if every map must contain at least one of them. In 1904 Paul Wernicke [19] proved that the set of configurations in Figure 13 is also an unavoidable set—so if a cubic map contains no digon, triangle, or square, then it must contain either two adjacent pentagons or a pentagon adjacent to a hexagon.
digon triangle square two pentagons pentagon/hexagon Figure 13. An unavoidable set.
To see why, suppose that there exists a cubic map containing none of these configu- rations. Then every pentagon adjoins only countries bounded by at least seven edges. Let us assign to each country in the map an “electrical charge”: if the country has k boundary edges, we assign the charge 6 k; thus pentagons receive a charge of 1, hexagons receive zero charge, heptagons receive a charge of 1, and so on. By the above counting formula, the total charge on the countries of the map is 12. Now transfer one-fifth of a unit of charge from each pentagon to its five negatively charged neighbors. Then the total charge on the map remains 12, but each pentagon now has zero charge, each hexagon still has zero charge, each heptagon still has a negative charge (since a heptagon can acquire a positive charge only if it has at least six neighboring pentagons, but two of these pentagons would then have to be adjacent, which is not permis- sible), and similarly octagons, nonagons, etc., retain a negative charge. Thus, each country now has a negative or zero charge, and so the total charge on the map cannot be 12. This contradiction proves that the above set of configurations is an unavoidable set. A reducible configuration of countries in a map is an arrangement of countries that cannot appear in a counterexample to the four-color theorem—in particular, as Kempe showed, a digon, triangle, and square are all examples of reducible configurations. Thus, a configuration of countries is reducible if a four-coloring of the rest of the map can be extended to the configuration. A celebrated example of a reducible configuration is the Birkhoff diamond (see Fig- ure 14), introduced by the American mathematician G. D. Birkhoff [5], who initiated the subject of reducibility in 1913.
6 1
5 2
4 3
Birkho diamond Figure 14. A reducible configuration. 44 A Century of Advancing Mathematics
To see why theBirkhoffdiamond is reducible,let us remove itfrom a map, givinga new map which we can assume has been colored with the four colors red, green, blue, and yel- low. We now investigate whether every such four-coloring can be extended to the diamond. To do so, we list all the thirty-one essentially different colorings of the six surrounding countries 1–6. These are: rgrgrg rgrbrg* rgrbgy* rgbrgy rgbryb rgbgbg* rgbyrg rgbygy* rgrgrb* rgrbrb rgrbyg* rgbrbg* rgbgrg* rgbgby rgbyby rgbybg* rgrgbg rgrbry rgrbyb* rgbrby rgbgrb* rgbgyg rgbyry* rgbyby rgrgby* rgrbgb* rgbrgb rgbryg rgbgry* rgbgyb rgbygb
Sixteen of these colorings (indicated by *) can immediately be extended to the dia- mond. It can also be shown that the remaining colorings can be extended to the diamond by using Kempe-chain arguments to interchange specific pairs of colors. Thus, all thirty-one colorings of the surrounding countries can be extended to the diamond, either directly or after a change of colors, and so the Birkhoff diamond is reducible. It was noted by the German mathematician Heinrich Heesch that, in order to prove the four-color theorem, it is sufficient to find an unavoidable set consisting entirely of reducible configurations. For, since the set is unavoidable, all maps must contain at least one of the configurations, but since all of the configurations are reducible, none of them can appear in a minimal counterexample. Thus, no such counterexample can exist and the theorem is proved.
5 Enter the computer By the early 1970s large numbers of reducible configurations had been discovered, as were a few methods for constructing unavoidable sets, but no one had been able to find an unavoidable set of reducible configurations. (One writer on unavoidable sets was Henri Lebesgue [12], mainly known for his work on integration.) Probabilistic arguments had indicated that such sets should exist, but that they might contain many thousands of config- urations, far too many for the largest computers then available. The usual approach was to generate large collections of reducible configurations and then to try to package them up into an unavoidable set, but no one had succeeded in do- ing so. Two mathematicians from the University of Illinois, Kenneth Appel and Wolfgang Haken, took a different approach. Over several years they developed the knack of being able to recognize at sight (with over eighty per cent accuracy) whether a given configu- ration is reducible. They then focused on unavoidable sets, constructing sets of “likely- to-be-reducible” configurations and then testing them for reducibility, modifying the un- avoidable set as necessary. This procedure saved them a great deal of time and, together with a graduate student named John Koch, they eventually obtained an unavoidable set of 1936 configurations (later reduced to 1482), thereby settling the 124-year-old problem (see [2, 3, 4]). The methods employed by Appel and Haken were basically those described above, although the technical details were far more complicated and involved massive testing on a computer, totaling some 1200 hours of computer time. In particular, while developing methods for moving units of charge around a map, they used much trial and error, together Map-Coloring Problems 45 with a great deal of insight and experience, and eventually obtained a systematic procedure that could be applied by hand. As mentioned above, the configurations were then tested for reducibility, and those that were not reducible were replaced by other configurations until an unavoidable set of reducible configurations was obtained. In fact, Appel and Haken’s method produced many thousands of unavoidable sets of reducible configurations, thereby yielding thousands of proofs of the four-color theorem. Minor errors were located and corrected, and the computer programs were made more efficient. The achievement of Appel and Haken in settling the four-color problem was a substan- tial one. At first many mathematicians were unhappy with a computer-assisted proof, as we shall see, but as the underlying methods of proof became clearer and computers came more into general use the solution gradually came to be accepted by the mathematical commu- nity. At the University of Illinoisthere was general rejoicing, and the proofof the four-color theorem was commemorated by a specially designed postmark (see Figure 15).
Figure 15. The University of Illinois’s celebratory postmark.
6 Maps on other surfaces By stereographic projection, coloring maps on a plane corresponds to coloringmaps on the surface of a sphere, and this suggests investigating the coloring of maps on other surfaces. The number of colors needed for maps on orientablesurfaces (that is, spheres with handles) was raised by Percy Heawood in the 1890 paper [9] in which he pointed out the flaw in Kempe’s proof of the four-color theorem. Heawood began with the torus. For a map with C countries, L boundary lines, and P points of intersection embedded on a torus, Euler’s formula takes the form C L C P 0. Using arguments similar to those for the plane, one can easily prove that every D toroidal map contains a digon, triangle, quadrilateral, pentagon, or hexagon, and thus (as Heawood observed), every map embedded on a torus can be colored with seven colors. He also presented a toroidal map that needs seven colors (see Figure 16).
Figure 16. A toroidal map requiring seven colors. 46 A Century of Advancing Mathematics
Heawood then went on to consider orientable surfaces of genus g (that is, spheres with g handles), for which the corresponding version of Euler’s formula is C L P 2 2g. C D He deduced that, for each g 1, every map embedded on such a surface can be colored with H.g/ colors, where H.g/ .7 p1 48g/=2 ; this formula yields seven colors D b C C c for a torus and eight for a double-torus. Unfortunately, except for the torus, Heawood failed to prove that this formula is best possible—that is, on every orientable surface of genus g there are maps that need H.g/ colors. In 1891 Lothar Heffter [10] obtained proofs for several small values of g, but prov- ing this in general turned out to be incredibly difficult, and the unproved statement became known as the Heawood conjecture. Proving the Heawood conjecture took 78 years. The eventual proof split up into twelve separate arguments, and was finally completed in 1968 after a long struggle by Gerhard Ringel and J. W. T. Youngs and others (see [13]). For non-orientable surfaces, H. Tietze [17] proved in 1910 that every map drawn on a projective plane can be colored with six colors, and that there are projective plane maps that need six colors. Later, in 1934, Philip Franklin [8] proved that every map drawn on a Klein bottlecan be colored with six colors, and that there are Klein bottlemaps that require six colors. The general result was obtained in 1952 by Gerhard Ringel, who considered non- orientable surfaces of genus k (that is, spheres with k cross-caps), for which the corre- sponding version of Euler’s formula is C L P 2 k. He deduced that, for k 1 C D D and k 3, every map embedded on such a surface can be colored with H.k/ colors, where H.k/ .7 p1 24k/=2 , and there are maps that need this number of colors. When D b C C c k 2 (the Klein bottle), the formula gives 7, whereas the correct answer is 6, as noted D above. It is surprising that the non-orientablecase proved to be simpler than the orientable case and was solved earlier, and also that the number of colors needed for orientable surfaces of genus h, for all h 1, took less time to solve than the case h 0 (the sphere)—but that is D all part of the fascination of map coloring!
7 Is it a proof? In the 1970s the use of a computer to prove mathematical results was highly controver- sial. Don Albers [1] described the scene when Wolfgang Haken presented the four-color theorem to a joint meeting of the American Mathematical Society and the Mathematical Association of America at the University of Toronto in August 1976: The elegant and old lecture hall was jammed with mathematicians anxious to hear Professor Haken give the proof. It seemed like the perfect setting to announce a great mathematical result. He proceededto outline clearly the computer-assistedproof that he and his colleagues had devised. At the conclusion of his remarks I had expected the audience to erupt with a great ovation. Instead, they responded with polite applause. Mathematician after mathematician expressed uneasiness with a proof in which a computer played a major role. They were bothered by the fact that more than 1000 hours of computer time had been expended in checking some 100,000 cases and often suggested (hoped?) that there might be an error buried in the hundreds of pages of computer printouts. Beyond that concern was a hope that a much shorter proof could be found. Map-Coloring Problems 47
The computer-assisted proof of Appel and Haken did indeed raise a number of issues. Several small errors were found in it, but these were quickly corrected. More serious was the philosophical question as to whether a mathematical proof can be considered correct if it cannot readily be checked by hand. The fact that everything that the computer had done was essentially routine work that could in principle be done by hand (althoughnot quickly) was largely discounted. In contrast it is interesting to compare the different standards tolerated by the math- ematical community towards purported proofs of the four-color theorem and two major results in group theory. In the 1960s the 250-page proof of the Feit–Thompson theorem on solvable groups was enthusiastically accepted, even though its length might indicate a substantial likelihood of human error (indeed, its proof initially contained a number of minor errors, later corrected), so that hardly anyone could check the details. Later, the clas- sification of finite simple groups involved many thousands of pages of work by hundreds of contributors, and parts of it made substantial use of computers. But in the 1980s most mathematicians were happy to accept the classification as correct, even though there were gaps in the argument that were still being filled more than twenty years later. Whatever the philosophical issues raised, it was undoubtedly the case that Appel and Haken’s methods had been somewhat ad hoc, and in the mid-1990s a more systematic approach was developed by Neil Robertson, Daniel Sanders, Paul Seymour, and Robin Thomas. Using essentially the same general method as Appel and Haken, they produced a shorter and more robust proof [14, 15] involving only 633 reducible configurations— indeed, the steps in their proof can be externally verified on one’s home computer in just a few hours. Moreover, their methods led to a quadratic algorithm for map coloring: the running time required to color a map with n countries is proportional to n2, whereas for Appel and Haken it had been n4. RobinThomas later wrote an article [16] outliningthe main ideas of the improved proof and emphasizing the four-color problem’s importance by listing some results from other fields that are equivalent to it—these include results on the algebra of three-dimensional vectors and the divisibilityof integers and one relating to matrices and tensors. The correctness of a large computer-assisted proof is difficult to verify. In 2004 the French computer scientist Georges Gonthier provided a fully machine-checked proof of the four-color theorem: this was a formal language implementation and machine verification of the approach of Robertson and his co-workers. Gonthier’s first step was to provide an axiomatic formulation of the terms “map” and “four-colorable.” A respected and widely used machine proof-checker called Coq then verified some sixty thousand lines of formal language proof before pronouncing the proof valid. The doubters could no longer doubt!
8 Conclusion Once the four-color problem had been solved, what else was there for map-colorers to do? The English combinatorialist Bill Tutte [18] asked this question back in 1978: I imagine one of them outgribing in despair crying ’What shall I do now?’ To which the proper answer is ‘Be of good cheer. You can continue in the same general line of research.’ For the four-colortheorem is by no means the end of the line—indeed, there are several current mathematical problems that extend the four-color theorem and develop its ideas in 48 A Century of Advancing Mathematics new and exciting directions. Solving the four-color problem is just one special instance of these much harder problems, such as Hadwiger’s conjecture and the five-flow conjecture, on which good progress has already been made. With these thoughtsof the future, we leave our last poetic musings to Bill Tutte: The Four Colour Theorem is the tip of the iceberg, the thin end of the wedge and the first cuckooof Spring.
Acknowledgement Most of the material in this chapter is described in much greater detail in Robin Wilson, Four Colors Suffice (revised color edition), Princeton Science Li- brary, Princeton University Press, 2014. The pictures in this chapter are all taken from this book and are reproduced with the per- mission of the publisher.
Bibliography [1] D. Albers, Polite applausefor a proof of one of the great conjectures of mathematics: what is a proof today?, College Mathematics Journal 12 (2) (March 1981), 82. [2] K. Appel and W. Haken, Every planar map is four colorable, Bulletin of the American Mathe- matical Society 82 (1976), 711–712. [3] K. Appeland W.Haken,Every planarmap is four colorable,Part I: Discharging, Illinois Journal of Mathematics 21 (1977), 429–490. [4] K. Appel, W. Haken, and J. Koch, Every planar map is four colorable, Part II: Reducibility, Illinois Journal of Mathematics 21 (1977), 491–567. [5] G. D. Birkhoff, The reducibility of maps, American Journal of Mathematics 35 (1913), 115– 128. [6] A. Cayley, On the colouring of maps, Proceedings of the Royal Geographical Society 1 (1979), 259–261. [7] P. Franklin, The four color problem, American Journal of Mathematics 44 (1922), 225–236. [8] P. Franklin, A six color problem, Journal of Mathematical Physics 13 (1934), 363–369. [9] P. J. Heawood, Map colour theorem, Quarterly Journal of Pure and Applied Mathematics 24 (1890), 332–338. [10] L. Heffter, Ueber das Problem der Nachbargebiete, Mathematische Annalen 38 (1891), 477– 508. [11] A. B. Kempe, On the geographical problem of the four colours, American Journal of Mathe- matics 2 (1879), 193–200. [12] H. Lebesgue,Quelques consequencessimple de la formule d’Euler, Journal de Math´ematiques Pures et Appliqu´ees 9 (1940), 27–43. [13] G. Ringel, Map Color Theorem, Springer, 1974. [14] N. Robertson, D. Sanders, P. Seymour, and R. Thomas, A new proof of the four-colour theo- rem, Electronic Research Announcements of the American Mathematical Society 2 (1) (August 1996), 17–25. [15] P. Seymour, Progress on the four-color theorem, Proceedings of the International Congress of Mathematicians, Z¨urich, Birkh¨auser, 1995. Map-Coloring Problems 49
[16] R. Thomas,An updateon the four-color theorem, Notices of the AmericanMathematical Society 45 (7) (August 1998), 848–859. [17] H. Tietze, Einer Bemerkungen ¨uber das problem des Kartenf¨arbens auf einseitingen Fl¨achen, Jahresber.Deut. Math.-Verein. 19 (1910), 155–159. [18] W. T. Tutte, Colouring problems, The Mathematical Intelligencer 1 (1978), 72–75. [19] P. Wernicke, Uber¨ den kartographischen Vierfarbensatz, Mathematische Annalen 58 (1904), 413–426.
Emeritus Professor of Pure Mathematics, The Open University, UK, and Emeritus Professor of Geometry, Gresham College, London [email protected]
Six Milestones in Geometry
Frank Morgan Williams College
Dear MAA, What would you say are the six largest advances in geometry during your 100-year life- time? You say you remember only the more recent ones? Me too. Here are my choices.
1 Regularity of area-minimizing surfaces An oldtheme in mathematics is that nice problems shouldhave nice solutions,although this can be hard to prove and is sometimes false. The nicest problem about curves has the nicest possible solution: the shortest distance between two points is a straight line. Similarly the nicest problem about surfaces has a nice solution: given a smooth curve in R3, a least-area surface bounded by the curve as in Figure 1 is a nice, smooth surface (Fleming [7], 1962).
Figure 1. A least-area surface is smooth. Wikimedia Commons.
In 1966, Fred Almgren [2] extended the result to R4, proving that a least-area hyper- surface is smooth by showing singularities unstable. In 1968 Jim Simons [32] extended the result through R7. Then in 1969 E. Bombieri, E. De Giorgi, and E. Giusti [4] gave a counterexample in R8 (the cone over S3 S3, with a singular point at the origin). In Rn, an area-minimizing hypersurface can have a singular set of dimension up to n 8. In higher codimension (much more difficult), an m-dimensional area-minimizing sur- face in Rn can have a singular set of dimension up to m 2. For example, two orthogonal discs in R4 are area minimizing with an isolated singularityat the origin. Regularity in gen- eral codimension was the subject of Fred Almgren’s 995-page Big Regularity Paper [1]. We are still far from any classification of singularities. An early fundamental question asked which unions of oriented m-planes are area minimizing. The answer depends on the
51 52 A Century of Advancing Mathematics geometric relationship between the planes, described by m angles
0 ˛1 ˛2 ˛m: Ä Ä Ä Ä The Angle Conjecture said that the planes are area minimizing if and only if the largest angleisless thanorequal tothesumof theothers.For m 1 thisoccurs onlywhen ˛1 0, D D i.e., when the two lines coincide. For m 2 this occurs only when the two angles are D equal, i.e., when the two planes are simultaneously complex for some orthogonal complex structure on their span. For m 3 this occurs for open sets of planes. This is one conjecture D for which both directionswere difficult. Sufficiency was proved in 1987 by “calibration” by Dana Nance (Mackenzie) [28], now a popular mathematics writer. Necessity was proved in 1989 by my PhD student Gary Lawlor [23], by providing beautiful families of comparison surfaces. A still open question asks whether the singular set in an area-minimizing surface is a stratified manifold. At the other extreme, for all we know, the singular set could be frac- tional dimensional. The subject of regularity has many technical subtleties, suppressed here. For some de- tails and references, see Morgan’s Geometric Measure Theory book [26].
2 Kepler’s sphere-packing conjecture (Thomas Hales) In 1611 Johannes Kepler [21] conjectured that the standard way of packing unit spheres (Figure 2) is actually the densest. In 1993 the International Journal of Mathematics pub- lished a purported proof by Wu-Yi Hsiang [18]. The incredible features were that the proof considered only close neighbors (centers within 2.18) and used mainly trigonometry. As far as I know, there are no counterexamples to the method and the first observed mistakes have been repaired, but Hsiang’s proof has not been generally accepted by the mathematics community. A few years later Thomas Hales submitted his proof [13] to AnnalsofMathematics. In his expository article “Cannonballs and Honeycombs” in the April 2000 Notices [12], he reported that, A jury of twelve referees has been deliberating on the proof since September 1998.
Figure 2. The standard “cannonball” way of packing spheres is the densest. Wikimedia Commons. Six Milestones in Geometry 53
They did have a toughjob. It was a momentous result. After the controversies over Hsiang’s published proof, they had to be careful. And it was a difficult body of work to referee, consisting of six papers, including the thesis of Hales’s PhD student Samuel Ferguson. The proof involved extensive computer analysis. Many cases initially would have required more computation time than the age of the universe. The proof had to be continually modified and aided by intricate analysis and geometry. In their paper on “A formulationof the Kepler conjecture,” Hales and Ferguson [14] wrote: As our investigations progressed, we found that it was necessary to make some adjustments. However, we had no desire to start over, abandoning the results of “Sphere Packings I” and “Sphere Packings II.” “A Formulation” gives a new de- composition of space [but] shows that all of the main theorems from “Sphere Pack- ings I” and “Sphere Packings II” can be easily recovered in this new context with a few simple lemmas. After years of effort, the referees gave up. Meanwhile, Hales and the world were waiting for the referees’ conclusions. Annals finally decided on an unprecedented course of action: to publish the work with a disclaimer that the referees had been unable to verify the proof. At the Joint Mathematics Meetings in Baltimore in January 2003, Hales received the Chauvenet Prize of the Mathematical Association of America for his Notices article. In his acceptance speech, he read from a letter he received from the editors of the Annals, leaving the impression that they would be unable to publish his result. According to Hales, Annals had written [32]: The news from the referees is bad.... They have not been able to certify the cor- rectness of the proof, and will not be able to certify it in the future, because they have run out of energy ... One can speculate whether their process would have converged to a definitive answer had they had a more clear manuscript from the beginning, but this does not matter now. In the lively discussions after the prize ceremony, it was apparent that Hales was not at all satisfied with the Annals delays and with its eventual decision to publish the work with a disclaimer. Annals then decided to call on another referee, who got Hales to reorganize his papers into more readable, checkable mathematics. Annals finally published without disclaimer a single paper with the overall mathematical strategy of the proof. The entire mathematical proof, in six papers, appeared in a special issue of Discrete and Computational Geometry, edited by some of the referees. (See [14].) Some of the computer programs and data are on an Annals website. Meanwhile, Hales launched a world-wide cooperative project called “Flyspeck” (based on the letters FPK for “Formal Proof of Kepler”) to produce a verification of the proof by computer. This sounded nearly impossible to me, but Hales [11] now reports that the work has been completed. Shortly after Hales finished his proof of Kepler’s Conjecture, Denis Weaire recom- mended to him an even older problem, the Hexagonal Honeycomb Conjecture. It says that regular hexagons as in Figure 3 provide the least-perimeter way to partition the plane into unit areas. Widely believed and often asserted as fact, even by such notables as Hermann Weyl [41], it was the longest standing open problem in mathematics, going back thousands of 54 A Century of Advancing Mathematics
Figure 3. The Hexagonal Honeycomb Conjecture said that regular hexagons provide the least- perimeter way to partition the plane into unit areas. Wikipedia. years. Around 36 BC, before his death, Marcus Terentius Varro [39] wrote an epistle to his young wife on how to take care of their farming estate, including honey bees. He gave two reasons for the hexagonal shape in their honeycombs: first, that a bee has six feet; second, The geometricians prove that this hexagon inscribed in a circular figure encloses the greatest amount of space.
Actually the Greek mathematician Zenodorus ( 200 BC) probably had considered only hexagons, triangles, and parallelograms [17, pp. 206–212]. Varro’s knowledge of bees was not perfect. He also observed that, They follow their king wherever he goes. The fact that the leader is not a king but a queen was not discovered until the seventeenth century. So Weaire recommended the Hexagonal Honeycomb problem to Hales: “Given its cel- ebrated history, it seems worth a try.” Hales promptly dispatched it in under a year. “In contrast with the years of forced labor that gave the proof of the Kepler Conjecture, I felt as if I had won a lottery.” [35, Chapt. 14] One major difficulty in proving regular hexagons optimal is that the result is not true locally. A hexagon is not the least-perimeter way to enclose unit area: a circle is. Of course you cannot partition the plane into unit circular regions. For a single region, a circle is best, but its favorable outward convexity would cause adjacent regions to have unfavorable inward concavity, so such outward convexity should carry a penalty, and inward concavity a corresponding credit. Similarly polygons with more than six edges can do better than hexagons, but by Euler the average number of edges should be at most six, so that extra edges should also carry a penalty and fewer edges a credit. Using such penalties and credits, Hales created a new problem in which the regular hexagons are best locally as well as globally. Since globally the penalties and credits must all cancel out, hexagons also solve the originalHexagonal Honeycomb Conjecture. The proof involves careful considerationof maybe a dozen cases and subcases, depending for example on the size of the penalty terms. Just as for the Hexagonal Honeycomb Conjecture, a major difficultyin provingKepler’s Conjecture is that the result is not true locally. The densest way to pack spheres around one central sphere is modeled on the regular dodecahedron, but such an arrangement cannot be continued, because dodecahedra do not tile space. Hales added local penalties and credits Six Milestones in Geometry 55
(which cancel out globally) to produce a new problem for which the standard packing would even locally beat the dodecahedral and all other packings. The appropriate penalties are very hard to find. Simple convexity and extra faces do not work; for starters, there is no formula for the average number of faces of a polyhedral partition of space. Earlier workers had tried to fix on features of the associated polyhedral partition into so-called Voronoi cells. (Each Voronoi cell consists of the set of points in space closer to the center of one particular sphere than to the center of any other.) Hales originally had the idea of using instead features of the so-called Delaunay triangulation, with vertices at the centers of the spheres, dual to the Voronoi decomposition. His main conceptual breakthrough may have been when he decided to use both. Unlike for the planar Hexagonal Honeycomb Conjecture, there were thousands of cases to check, some too difficult for the computer. As he advanced to more and more difficult cases, Hales had to make intricate revisionsof the penalties to get the proof to work. The set of penalties finally used was arrived at in collaboration with Ferguson, whose PhD thesis handled the most difficult case. So despite similarities,Kepler’s Conjecture on sphere packing in R3 was orders of mag- nitudemore difficult than the Hexagonal Honeycomb Conjecturein R2, mainly because R3 provides so many more geometric possibilities than R2. But it was easier in one aspect: it is a packing problem, whereas the Honeycomb Conjecture is a partitioning problem. The optimal two-dimensional packing, with six circles fitting perfectly around every circle, is relatively easy and was proved in 1890 by Thue. Packing problems are in general much eas- ier because you “just” have to determine where to put the centers of the circles or spheres. For partitioningproblems, you have to find the shape or shapes of the regions: hexagons in R2, stillopen in R3, despite a milestone result, the subject of the next section. This section is closely based on my review [27] of Kepler’s Conjecture [35] by G. Szpiro. For more details and references, see my review, Szpiro’s book, and my Geometric Measure Theory book [26].
3 Weaire-Phelan counterexample to Kelvin conjecture In 1994 came striking news of the disproof of Lord Kelvin’s 100-year-old conjecture by Denis Weaire and Robert Phelan [40] of Trinity College, Dublin. Kelvin sought the least- area way to partition all of space into regions of unit volumes. His basic building block was a truncated octahedron, with its six square faces of truncation and eight remaining hexagonal faces, which packs perfectly to fill space as suggested by Figure 4. (The regular
Figure 4. Lord Kelvin conjectured that the least-area way to partition space into unit volumes uses relaxed truncated octahedra. Graphics by Ken Brakke in his Surface Evolver [5]. 56 A Century of Advancing Mathematics
Figure 5. Kelvin loved his truncated octahedron, constructed models, and exhibited the pic- tured stereoscopic images. (Crossing your eyes to superimpose the two images produces a three- dimensional view.) [37, p. 15] dodecahedron, with its twelve pentagonal faces, has less area, but it does not pack.) The whole structure relaxes slightly into a curvy equilibrium, which is Kelvin’s candidate. All regions are congruent. Kelvin loved this shape, constructed models, and exhibited stereo- scopic images as in Figure 5. Weaire and Phelan recruited a crystal structure from certain chemical “clathrate” com- pounds, which uses two different building blocks: an irregular dodecahedron related to Fool’s Gold and a tetrakaidecahedron with twelve pentagonal faces and two hexagonal faces. The tetrakaidecahedra are arranged in three orthogonal stacks, stacked along the hexagonal faces, as in Figure 6. The remaining holes are filled by dodecahedra. Again, the structure is allowed to relax into a stable equilibrium. Computation in the Brakke Evolver [5] shows an improvement over Kelvin’s conjecture of approximately 0.3%. The rigorous proof, by Kusner and Sullivan [22], proves only approximately 0.01%. Weaire and Phelan [40] thus provided a new conjectured minimizer. Proving the Weaire-Phelan structure opti- mal looks perhaps a century beyond current mathematics to me, but I understand that Hales is already thinkingabout it.
Figure 6. The relaxed stacked tetrakaidecahedra and occasionaldodecahedraof Weaire and Phelan beat Kelvin’s conjecture by approximately 0.3%. Graphics by Ken Brakke in his Surface Evolver [5]. Six Milestones in Geometry 57
The counterexample was almost discovered many times earlier. The clathrate com- pounds that inspired Weaire and Phelan had just three years earlier inspired counterex- amples by Tibor Tarnai [36] to related conjectures on the optimal way to cover a sphere withdiscs. As early as 1890, J. Dana [6] described similar structures in volcanic lava, more recently observed in popcorn. Brakke spent hours at his grandfather’s old desk seeking counterexamples. Had he reached for his father’s copy of Linus Pauling’s classic, The Na- ture of the Chemical Bond, it would doubtless have fallen open to the illustration, in the clathrate compound section, of the chlorine hydrate crystal, essentially the Weaire-Phelan counterexample. R. Williams [42], after spending years seeking a Kelvin counterexample, finally gave up and later published a well-illustrated The Geometrical Foundation of Natu- ral Structure: A Source Book of Design. In one of his figures, he picturedthe Weaire-Phelan counterexample without realizing it. Of course, it would have been difficult to check with- out Brakke’s Surface Evolver. In 1988 at the Geometry Center, John M. Sullivan, inspired by Fred Almgren, computed Voronoi cells of equal volumes, but Weaire-Phelan requires weighted Voronoi cells (with the distance to each point weighted differently). Weights also play an essential role in Gary Lawlor’s new proof of the Double Bubble Theorem, featured in the next section, and in Perelman’s proof of the Poincar´eConjecture in the following section. This section is closely based on Chapter 15 of my Geometric Measure Theory book [26], which can be consulted for further details and references.
4 Double bubble conjecture A round spherical soap bubble provides the least-area way to enclose a given volume of air, as was proved mathematically by H. Schwarz in 1884. Similarly, the familiar double soap bubble of Figure 7a, consisting of three spherical caps meeting at 120 degrees, provides the least-area way toenclose and separate twogiven volumes of air. But the proofof that double bubble conjecture had to wait until 2002. Indeed, it was not stated as an open mathematical
(a)
(b)
Figure 7. (a) The double bubble provides the least-area way to enclose and separate two given volumes of air. It consists of three spherical caps meeting at 120 degrees. If the volumes are equal, the central cap is planar. Computer graphics copyright c John M. Sullivan; color version at www.math.uiuc.edu/˜jms/Images/. (b)Foisyetal.[9] proved that the planar double bubble provides the least-perimeter way to enclose and separate two given areas. 58 A Century of Advancing Mathematics conjecture until a 1991 undergraduate thesis by Joel Foisy [8] at Williams College. The previous summer, Foisy, Manuel Alfaro, Jeff Brock, Nickelous Hodges, and Jason Zimba [9], my NSF undergraduate research Geometry Group, had proved the planar version: that three circular arcs as in Figure 7b meeting at 120 degrees provide the least-perimeter way to enclose and separate two given areas. Fred Almgren and Jean Taylor (see [3]) had proved that a least-area doublebubbleexists and consists of smooth, constant-mean-curvature surfaces meeting in threes along curves. Furthermore, by symmetry, it had to be a surface of revolution, although the argument was a bit tricky. First you use a ham sandwich theorem to get a plane that splits both volumes in half, so that by regularity you can assume that it has reflectional symmetry. Then you similarly get reflectional symmetry across an orthogonal plane. Composing the two symmetries yields symmetry under 180-degree rotation about say the z-axis. Therefore all vertical planes through the z-axis split both volumes in half. By regularity, it must meet all these planes orthogonally. Therefore it must be a surface of revolution. Thus symmetry reduced the problem to one about curves in the plane. No one realized how hard it was. The main difficulty was that in principle each of the two regions could have many components. Even if you tried to make the problem easier by not allowing several compo- nents, in the limit the minimizer might have several components. What made the problem accessible was a theory developed by one of my former undergraduate research students, Michael Hutchings [19], now Professor of Mathematics at UC Berkeley. Hutchings realized he could generalize the symmetry argument to get bounds on the number of components. In the case of equal volumes, each region had just one component. For this case, Joel Hass and Roger Schafly [16] were able to finish off the proof computationally.At the time it was a cutting-edge use of computers, requiring careful error estimates. In the end they reduced the problem to 200,260 integrals, which a PC accomplished in about twenty minutes. The result appeared in Annals of Mathematics in 2000. The proof [20] of the general case of unequal volumes appeared two years later. Hutch- ings was one of my coauthors. The other two, Manuel Ritor´eand Antonio Ros hailed from the University of Granada, which has become the world center for minimal surface theory. The computer analysis was replaced by an instability argument. My undergraduate Geometry Group [31] promptly generalized the result to R4, where the difficult cases multiplied from six to about two hundred. The group leader, Ben Re- ichardt [30], eventually generalized the result to Rn, so perfecting the instability argument that the Hutchings bound on the number of components became unnecessary. Recently Gary Lawlor [24] has found a much simpler proof based on a deep, new idea, which he calls unification. He replaces the infinite family of problems of minimizing sur- face area for given volumes to a single problem: minimize the ratio of surface area to the surface area of the standard double bubble over all volumes. Now not only would a coun- terexample have less total surface area than the standard double bubble, but every one of its interfaces would have less area and smaller mean curvature than the corresponding inter- faces of the standard double bubble. This makes it relatively easy to derive a contradiction by comparing areas via the Gauss map. Lawlor’s proof works in a larger context where the various interfaces carry weights, as occurs physically when the two regions and the exterior are immiscible fluids with the energy of an interface depending on which pair of fluids it separates. Six Milestones in Geometry 59
Along the way Lawlor discovered a beautiful, simple, new symmetry argument using stretching to prove that the minimizer S is a surface of revolution, a rather astonishing accomplishment given the thousands of years of close attention to symmetry arguments. Roughly as in the standard symmetry argument he gets a “quarter” of S in say x; y 0 f g with a quarter of each volume and a quarter of the surface area. But now he maps the polar coordinate to 2 to get a surface with half of each volume in y 0 and less than half f g the surface area, unless it is a surface of revolution. Reflection across y 0 now yields f D g a surface with the original volumes and less than the original surface area (contradiction), unless the portion came from a surface of revolution. A big advantage of Lawlor’s new symmetry stretching argument is that it does not use regularity, which is not known in the larger context of weighted interfaces. For more details and references on this section, see my Geometric Measure Theory book [M1] and Lawlor’s new paper [24].
5 Poincaré conjecture (Grigori Perelman) It has long been known that among connected compact two-dimensional manifolds, such as the sphere, the torus, and the two-holed torus, the sphere is characterized by the fact that any loop can be contracted to a point, whereas a loop around a torus, for example, cannot be contracted to a point. The Poincar´eConjecture, suggested by Henri Poincar´ein 1904, proposed the analogous result for three-dimensional manifolds: a simply connected compact three-dimensional manifold must be a sphere. At the 2006 International Congress of Mathematicians, Grigori Perelman [29] was awarded the Fields Medal for its proof, althoughhe declined to accept it. In 2010 the Clay Mathematics Institutionoffered him their million-dollar Millennium prize, but he turned that down too. An article in The Moscow Times (29 April 2011) reported that Perelman said that his research is too interestingdue to its vast implications—both practical and philosophical—to spend time on other matters. “I know how to control the universe. Tell me, why would I need to chase a million [dollars]?” For a Russian these days, such money could well be more trouble than it’s worth. High-dimensional versions of the Poincar´eConjecture, with more space to do geo- metric constructions, are easier. Stephen Smale [33] proved the analogous conjecture for dimensions at least five and won the Fields Medal in 1966. Michael Freedman [10] proved the four-dimensional case and won the Fields medal in 1986. The basic idea of Perelman’s proof, due to Richard Hamilton [15], is to start with any simply connected compact three-manifold and let it shrink at each point in each direction at a rate proportionalto its Ricci curvature. If you can show that you eventually end up with a round sphere, with perhaps other spheres pinched off along the way, you can conclude that you must have started with a (deformed) sphere. Unfortunately singularities sometimes form, as in Figure 8. So the fundamental difficulty is to obtain some control over the formation of singu- larities. One has global estimates (Perelman’s “monotonicity of energy”), but one needs local control. Here I’d like to explain a point not emphasized by other expositors, but the starting point in Perelman’s paper. As in Lawlor’s [24] new proof of the Double Bubble Theorem, the key technique is using a weighting function. To focus attention about a point p of concern, Perelman gives the manifold large weight or density about that point and lets 60 A Century of Advancing Mathematics
1995 M. Fried Institut f. Angewandte Mathematik Uni Freiburg Figure 8. The Ricci flow applied to a dumbbell shape leads to a singularity. mathematik.uni-freiburg.de the metric flow by an associated generalized Ricci curvature. If one fixes the measure, then the density evolves as a modified backwards heat equation and approaches a delta function at p. His general monotonicity of energy now provides the requisite local information in- stead of the usual global information.(Actually, in the proof, to facilitate surgery, Perelman moves to a localized version of the density called the length function.) Remarkably, modulo diffeomorphisms, this generalized Ricci flow is equivalent to the standard Ricci flow. As Perelman puts it, “The remarkable fact here is that different choices of [density] lead to the same flow, up toa diffeomorphism; that is, the choice of [density]is analogous tothe choice of gauge.” This means that duringthe proof one can choose any density for convenience. In summary, weightings provide a convenient technical context for applying diffeomorphisms to focus attention on regions of concern. In his paper Perelman concludes: “...we apply our monotonicity formula to prove that for a smooth solution on a finite time interval, the injectivity radius at each point is controlled by the curvatures at nearby points. This result removes the major stumbling block in Hamilton’s approach to geometrization.” Perelman’s proof used geometry to solve a topologyproblem,much as the original1896 proofs of the prime number theorem by Hadamard and de la Vall´e-Poussin used complex analysis. It was another half century until Selberg and Erd˝os provided elementary proofs. I think it will be another half century until someone gives a purely topological proof of Poincar´e, fulfilling the promise of earlier work of Thurston. In fair exchange, the next section includes a crucial role for topology in the proof of a geometric result, the Willmore Conjecture.
6 Willmore conjecture (Fernando Marques and Andre Neves) In 2012 mathematicians Fernando C. Marques of IMPA in R´ıo de Janeiro, Brazil, and Andr´eNeves [25] of Imperial College, London, proved the 1965 Willmore Conjecture for the best shape for a torus or doughnut,pictured in Figure 9, with the narrow holeonly about 17 percent (3 2p2) of the width of the torus. “Best” means minimizing the integral of the mean curvature squared, a physically natural elastic bending energy, used for example to model certain cell membranes. Six Milestones in Geometry 61
Figure 9. Marques and Neves prove the torus or doughnut which minimizes the integral of the mean curvature squared. Left image courtesy of geom.uiuc.edu/˜banchoff, thanks to Tom Banchoff, all rights reserved; right image from Wikipedia.
Thomas J. Willmore [43], an English geometer (see Figure 10), guessed the best shape in a 1965 paper. He died February 20, 2005, seven years, almost to the day, before its solution.
Figure 10. Marques (left) spoke at the 2012 Geometry Festival on the proof of the conjecture by Thomas J. Willmore (right, photo by John M. Sullivan, used with permission, all rights reserved).
Actually since the curvature energy is invariant under the conformal group of symme- tries, there are infinitely many equally good shapes, as in Figure 11. Such “Dupin cyclides” are being used in modeling and architecture, where they piece together to design beautiful structures.
Figure 11. One of infinitely many conformally equivalent solutions. Image courtesy of www.chem.ucla.edu/, thanks to Xavier Michalet, all rights reserved. 62 A Century of Advancing Mathematics
A key to the proof of the Willmore Conjecture is moving the problem from R3 to the compact sphere S3, conformally related by stereographic projection. On the sphere the energy becomes area plus the integral of mean curvature squared, and a minimizer is the Clifford torus T S1 S1, a minimal submanifold with zero mean curvature. A major D step along the way is to show that among minimal tori T has least area. Of course, among all surfaces, T does not minimize area since it can shrink or degenerate into a sphere in a five-parameter family of ways, but it does minimize area in directions orthogonal to that family—just as a mountain pass does not minimize height, although it does in the direction orthogonal to the highway. F. Urbano [38] had earlier proved that T was the only minimal torus with that much stability. The theory of such hybrid “mini-maxima” was developed by my own late thesis advisor Fred Almgren of Princeton University and his PhD student Jon Pitts now of Texas A&M. The key to the proof of the Willmore Conjecture is a pre- cise understanding of the topology of a partially singular five-parameter space associated with any competitor. Thus in fine counterpoint to Perelman’s geometric proof of Poincar´e’s topological conjecture, topology is the key to this new proof of the (geometric) Willmore Conjecture. Still an open question is the optimal shape for a two-holed torus, perhaps something like the two-holed torus of Figure 12. Robert Kusner of the University of Massachusetts at Amherst has a conjecture for the optimal torus of any given number of holes, a family of minimal surfaces in S3 discovered in 1970 by Blaine Lawson of the State University of New York at Stony Brook.
Figure 12. Candidate optimal two-holed doughnuts.Image courtesy of www.chem.ucla.edu/, thanks to Xavier Michalet, all rights reserved. Six Milestones in Geometry 63
Bibliography [1] F. J. Almgren, Jr., Q-valued functions minimizing Dirichlet’s integral and the regularity of area- minimizing rectifiablecurrentsup to codimension2. World Scientific Publishing Co., Inc., River Edge, NJ, 2000. [2] ——— Some interior regularity theorems for minimal surfaces and an extension of Bernstein’s theorem, Ann. of Math. 84 (1966) 277–292. [3] F. J. Almgren, Jr. and J. Taylor, Geometry of soap films, Sci. Am. 235 (1976) 82–93. [4] E. Bombieri, E. De Giorgi, and E. Giusti, Minimal cones and the Bernstein problem, Invent. Math. 7 (1969) 243–268. [5] K. Brakke,The SurfaceEvolver, www.susqu.edu/brakke/evolver/evolver.html. [6] K. Cashman and H. Wright, Pattern and structure of basaltic reticulite: foam formation in lava fountains, Geophys. Res. Abstr. 8 (2006) 05398. [7] W. H. Fleming, On the oriented Plateau problem, Rend. Circ. Mat. Palermo (2) 11 (1962) 1–22. [8] J. Foisy, Soap Bubble Clusters in R2 and R3. Undergraduate thesis. Williams College, Williamstown, MA, 1991. [9] J. Foisy, M. Alfaro, J. Brock, N. Hodges, and J. Zimba, The standard double soap bubble in R2 uniquely minimizes perimeter, Pac. J. Math. 159 (1993) 47–59. [10] M. Freedman, The topology of four-dimensional manifolds, J. Diff. Geom. 17 (1982) 357–453. [11] T. Hales, Announcement of completion of Flyspeck, code.google.com/p/flyspeck/ wiki/AnnouncingCompletion. [12] ———, Cannonballs and honeycombs, Notices Amer. Math. Soc. 47 (2000) 440–449. [13] ———, A proof of the Kepler conjecture, Ann. of Math. (2) 162 (2005) 1065–1185. [14] T. Hales and S. Ferguson, A formulation of the Kepler conjecture, Discrete Comput. Geom. 36 (2006) 21–69. [15] R. Hamilton, Three-manifolds with positive Ricci curvature, J. Diff. Geom. 17 (1982) 255–306. [16] J. Hass and R. Schlafly, Double bubbles minimize, Ann. of Math. 151 (2000) 459–515. [17] Sir Thomas Heath, A History of Greek Mathematics Vol. II. Oxford University Press, London, 1921. [18] W.-Y. Hsiang, On the sphere packing problem and the proof of Kepler’s conjecture, Internat. J. Math. 4 (1993) 739–831. [19] M. Hutchings, The structure of area-minimizing double bubbles, J. Geom. Anal. 7 (1997) 285– 304. [20] M. Hutchings, F. Morgan, M. Ritor´e, and A. Ros, Proof of the Double Bubble Conjecture, Ann. of Math. 155 (2002) 459–489. [21] J. Kepler, The Six-cornered Snowflake. Oxford Clarendon Press, Oxford, 1966. [22] R. Kusner and J. M. Sullivan, Comparing the Weaire-Phelan equal-volume foam to Kelvin’s foam, Forma 11 (1996) 233–242; reprinted in The Kelvin Problem. Foam Structures of Minimal Surface Area (D. Weaire, ed.), Taylor & Francis, London, 1996. [23] G. Lawlor, The angle criterion, Invent. Math. 95 (1989) 437–446. [24] ———, Double bubbles for immiscible fluids in Rn, J. Geom. Anal., 24 (2014) 190–204. [25] F. Marques and Andr´eNeves, Min-max theory and the Willmore conjecture, Ann. of Math. (2) 179 (2014) 683–782. [26] F. Morgan, Geometric Measure Theory. Academic Press, San Diego, 2009. 64 A Century of Advancing Mathematics
[27] ———, Review of Kepler’s Conjecture by G. Szpiro, Notices Amer. Math. Soc. 52 (2005). [28] D. Nance, Sufficient conditions for a pair of n-planes to be area-minimizing, Math. Ann. 279 (1987) 161–164. [29] G. Perelman, The entropy formula for the Ricci flow and its geometric applications, arXiv.org (2002). [30] ———, Proof of the double bubble conjecture in Rn, J. Geom. Anal. 18 (2008) 172–191. [31] B. Reichardt, C Heilmann, Y. Lai, and A. Spielman, Proof of the double bubble conjecture in R4 and certain higher dimensional cases, Pac. J. Math. 208 (2003) 347–366. [32] J. Simons, Minimal varieties in Riemannian manifolds, Ann. of Math. 88 (1968) 62–105. [33] S. Smale, Generalized Poincar´e’s conjecture in dimensions greater than four, Ann. of Math. (2) 74 (1961) 391–406. [34] G. Szpiro, Does the proof stack up? Nature 424 (July 3, 2003) 12–13. [35] ———, Kepler’s Conjecture:How Some of the GreatestMinds in History Helped Solve One of the Oldest Math Problems in the World. John Wiley & Sons, Inc., 2003. [36] T. Tarnai, The observed form of coated vesicles and a mathematical covering problem, J. Mol. Biol. 218 (1991) 485–488. [37] W. Thomson (Lord Kelvin), On the homogeneous division of space, Proc. R. Soc. London 55 (1894) 1–16. [38] F. Urbano, Minimal surfaces with low index in the three-dimensional sphere, Proc. Amer. Math. Soc. 108 (1990) 989–992. [39] M. Varro, On Agriculture. The Loeb Classical Library. Harvard University Press, Cambridge, MA, 1934. [40] D. Weaire and R. Phelan, A counter-example to Kelvin’s conjecture on minimal surfaces, Phil. Mag. Lett. 69 (1994) 107–110. [41] H. Weyl, Symmetry. Princeton University Press, Princeton, NJ, 1952; Princeton Sci. Lib. ed., 1989. [42] R. Williams, The Geometrical Foundation of Natural Structure: A Source Book of Design. Dover, New York, 1979. [43] T. Willmore, Note on embedded surfaces, An. Sti. Univ.“Al. I. Cuza” Iasi Sect. I a Mat. (N.S.) 11B (1965) 493–496.
Department of Mathematics and Statistics, Williams College, Williamstown, MA 01267 [email protected] Defying God The Stanley-Wilf Conjecture, Stanley-Wilf Limits, and a Two-Generation Explosion of Combinatorics
Eric S. Egge Carleton College
In 2005, at the Third International Conference on Permutation Patterns in Gainesville, Florida, Doron Zeilberger declared that “Not even God knows a1000.1324/.” Zeilberger’s claim raises thorny theological questions, which I am happy to ignore in this article, but it also raises mathematical questions. The quantity a1000.1324/ is the one-thousandth term in a certain sequence an.1324/. God may or may not be able to compute the thousandth term in this sequence, but how far can mortals get? If we can’t get beyond the fortieth or fiftieth term, can we at least approximate the one-thousandth term? How fast does an.1324/ grow, anyway? And what does an.1324/ even mean? The answers to these questions involve fast computers, fascinating mathematics, and remarkable human ingenuity. But their stories, which are ongoing, also reflect important undercurrents and developments that have influenced all of mathematics, but especially combinatorics, over the past two generations and more.
1 Knuth’s railroad problems
The story of a1000.1324/ begins with a gap in the railroad literature, which Donald Knuth began tofillin 1968inthefirst editionof thefirst volumeof hismasterpiece The Art ofCom- puter Programming. In the second section of Chapter 2, Knuth included several exercises exploring a problem involvingsequences of railcars one can obtain using a turnaround.One of Knuth’s exercises is equivalent to the following problem.
At dawn we have n railroad cars positionedon the rightside of the track in Figure 1, numbered 1 through n from rightto left. Duringthe day we gradually move the cars to the left side of the track, by moving each car into and back out of the turnaround area. There can be any number of cars in the turnaround around area at a time, and at the end of the day the cars on the left side of the track can be in many different orders. Each possible order determines a permutation of the numbers 1; 2; : : : ; n. Show that a permutation 1; : : : ; n (this time reading from left to right along the tracks) is attainable in this way if and only if there are no indices i < j < k such that i < k < j .
65 66 A Century of Advancing Mathematics
p p ... p p ... 1 2 n1– n n n–1 2 1
Figure 1. Knuth’s railroad tracks.
The solution to this problem is a fun exercise in careful bookkeeping. If such a subse- quence exists, then consider the situation when car i enters the turnaround. Since i is the smallest of our three car numbers, cars j and k have already entered the turnaround, in that order. Furthermore, in order for car i to appear to the left of cars j and k, cars j and k must both still be in the turnaround when car i enters. But now cars j and k will leave the turnaround in the wrong order.
Conversely, suppose we have a target permutation 1; : : : ; n with no subsequence of the forbidden type. We can always move 1 into position, and when car 1 leaves the turnaround, the cars in the turnaround are, from bottom to top, n; n 1; : : : ; 1 1. Now C notice that 2 cannot be larger than 1 1, since thiswouldmean 1, 2, and 1 1 form a C C forbidden subsequence. So if 2 is in theturnaround,then it is the top car there. Either way, we can move car 2 intoposition.In general, ifwe have just moved car j into position,and b is the smallest entry greater than j which has not yet left the turnaround,then j 1 b, C Ä since otherwise would have a forbidden subsequence j , j 1, b. Therefore, if j 1 has C C entered the turnaroundthen it is the top car there, and we can move it into place. Knuth was interested in this railcars problem because it models the data structure com- monly called a stack, which arises in numerous programming problems, so he introduced no particular notation for the permutations he obtained. Indeed, no general notation for these permutations appeared in print until 1985, when Simion and Schmidt [31] published the first systematic study of permutations with forbidden subsequences of the type Knuth uses. Today, if and are permutations of lengths n and k respectively, then we say a subsequence of of length k has type whenever its entries are in the same relative order as the entries of . For example, the subsequence 829 of the permutation 718324695 has type 213, since its smallest entry is in the middle, its largest entry is last, and its middle entry is first. In this context, we say avoids , or is -avoiding, whenever has no subsequence of type , and we write Sn./ to denote the set of all permutations of length n which avoid . We might also say that is a forbidden subsequence or a forbidden pattern. With this terminology, the permutations Knuth obtains with his railcars are exactly the 132-avoiding permutations, and the term a1000.1324/ that Zeilberger’s God finds so perplexing is none other than the size of S1000.1324/. In Table 1 we have the first ten values of Sn.1324/ . j j Defying God: the Stanley-Wilf Conjecture, Stanley-Wilf Limits, and . . . 67
n 0 1 2 3 4 5 6 7 8 9
Sn.1324/ 1 1 2 6 23 103 513 2762 15793 94776 j j Table 1. The first ten values of jSn.1324/j. 2 A scattered history
Of course, combinatorial problems predate computers, the MAA, and even railroads. In fact, we can find evidence of people studying combinatorial problems nearly as far back in time as we can find evidence of people doing mathematics. For example, in the following quotation from Plutarch’s Table-Talk [25, VIII.9, 732], we find Chrysippus (circa 200 BCE) and Hipparchus (circa 300 BCE) discussing how to form logical expressions. Chrysippus says that the number of compound propositions that can be made from only ten simple propositions exceeds a million. (Hipparchus, to be sure, re- futed this by showing that on the affirmative side there are 103; 049 compound statements, and on the negative side 310,952.) Plutarch doesn’t say what a compound proposition is, but it seems reasonable to assume it’s a combinatorial object of some kind. Indeed, in 1994 David Hough, who was then a graduate student at George Washington University, observed that 103,049 is the tenth small Schr¨oder number [34, 17, 1]. This means 103,049 is, among other things, the number of ways to parenthesize a sequence of eleven letters. To give a sense of what this means, there are three ways to parenthesize a sequence of three xs, namely xxx, .xx/x, and x.xx/, and eleven ways to parenthesize a sequence of four xs, namely xxxx, .xxx/x, ..xx/x/x, .x.xx//x, x.xxx/, x..xx/x/, x.x.xx//, .xx/.xx/, .xx/xx, x.xx/x, and xx.xx/. Plutarch’s account of Chrysippus and Hipparchus’s debate over the number of com- pound propositions is not the most ancient combinatorial reference, nor does it involve the most common combinatorial quantities. In Sushruta Samhita, a sixth century BCE Sanskrit text on surgery attributed to the Indian physician Sushruta, the author observes that we can make sixty-three combinations out of six different tastes, when we take them one at a time, two at a time, etc. This gives us all but one of the entries of the sixth row of Pascal’s tri- angle, more than two millennia before Pascal. And Sushruta’s discussion of what would come to be called the binomial coefficients is not an isolated occurrence in ancient Indian literature. The Bhagabati Sutra, a religious text of the Jains which appeared around 300 BCE, contains a more general rule for computing binomial coefficients, and the Jain math- ematician Mahavira gives a completely general rule in his Ganita Sara Sangraha, which was written around 850 AD [20, p. 27]. Combinatorics is ancient, but for much of its history it has also been scattered, arising in diverse contexts but having few or no adherents of its own. Hipparchus solves a com- binatorial problem to refute Chrysippus, but he does it to make a larger point. Sushruta solves a combinatorial problem in the midst of a landmark text on surgery, which barely contains any other mathematics at all. And this is how it goes for centuries: Euler invents graph theory to solve the K¨onigsberg bridge problem, Pascal (re)discovers the binomial coefficients in his quest to resolve interrupted games of chance, Kempe “proves” the four color theorem to answer a question posed almost thirty years earlier by a student trying to color a map of England, Cayley studies partitions as a tool in invariant theory, Young 68 A Century of Advancing Mathematics introduces the tableaux that now bear his name to build on Cayley’s work in invariant the- ory, and Kirchhoff proves his matrix-tree theorem for counting spanning trees in a graph to solve a problem in electrical engineering. To be sure, some combinatorial problems were studied for their own sake a century or two ago, and there were even people we would recognize today as combinatorialists. For instance, in the early 1880s J. J. Sylvester and his students devoted themselves to the study of partitions, pioneering the use of Ferrers diagrams to develop a general theory [24]. But in the nineteenth century and the first half of the twentieth, Sylvester’s work and life are the exceptions, not the rule, as most combinatorial problems were treated as isolated curiosities, not fundamental examples around which one might build a theory.
3 How fast does the number of Knuth railcar permutations grow?
Fortunately for us, the problem of estimating the rate at which Sn.1324/ grows is not j j an isolated curiosity, but is instead part of a general theory, which means we can gain some insight by looking at a related problem. For instance, since 132 is part of 1324, every permutation which avoids 132 also avoids 1324, so let’s try to first estimate Sn.132/ . j j To get a crude upper bound on this quantity, first recall that a left-to-right minimum in a permutation is an entry which is smaller than every entry to its left.For example, the left- to-right minima in 694853127 are 6, 4, 3, and 1. Somewhat surprisingly, if avoids 132, then it is determined by the values and positions of its left-to-right minima. For example, suppose S9.132/ has left-to-right minima 6, 3, and 1, which are in the first, third, and 2 fifth positions. Since the left-to-right minima must be in decreasing order, we can start to construct as in Figure 2. Now the second entry of must be greater than 6, since it’s
6 3 1
Figure 2. A permutation 2 S9.132/ with prescribed left-to-right minima. not a left-to-rightminimum. But if we put 8 (resp. 9) there, then the 6, the 8 (resp. 9), and the 7, which must appear somewhere to the right, will form a subsequence of type 132. Therefore, the second entry must be 7. Similarly, the fourth entry must be the smallest available number greater than 3, and each successive entry is the smallest available number which is greater than the nearest left-to-right minimum on its left. Following this recipe, we find that in our example 673412589. D Returning to our bound on Sn.132/ , the leftmost entry of a permutation is always a j j n 1 left-to-right minimum, as is 1, so there are at most 2 sets of values for the left-to-right n 1 n 1 minima, and 2 sets of positions for these values. Therefore, Sn.132/ 4 when j j Ä n 1. Since 4n 1 is much less than nŠ when n is even reasonably large, the chances we can put our railcars into any particular order is almost zero for any train more than a few cars long. n 1 We expect our 4 bound on Sn.132/ to be terrible, because there are many ways a j j given choice of numbers and positions can fail to be the values and positions of the left- to-right minima for any permutation. For example, we made no effort to ensure that we have the same number of left-to-right minima as we have positions for them. And even Defying God: the Stanley-Wilf Conjecture, Stanley-Wilf Limits, and . . . 69 when we have the same number of values as positions, the values and positions may not be compatible. For instance, if we insist on having left-to-right minima 1, 5, and 7 in the first, third, and eighth positionsof a permutationof length 9, then we’re goingto have a bad time, since at least one of 2, 3, and 4 must appear between the 5 and the 1, and this entry will be another left-to-right minimum. Nevertheless, a miracle of sorts occurs: while it is 4 n 1 possible to improve our bound on Sn.132/ to 4 , the base 4 of the exponential j j n3=2p factor cannot be replaced with a smaller number. To see why no base less than four will work, we return to Knuth, who doesn’t bother to estimate Sn.132/ at all in his solution to the railroad problem. Instead, he notes that we j j can encode each permutation in the set uniquely by writing down the sequence of moves that generate it. In particular, if we write N each time we move a railcar intothe turnaround and E each time we move a railcar out of the turnaround on the other side, then we get a bijection between Sn.132/ and the set of sequences of n N s and n Es in which every initial segment has at least as many N s as it has Es. Such sequences are called ballot sequences, and it was already well known in 1969 that they are counted by the Catalan 1 2n Cn 4n 2 Cn number Cn n 1 n . In particular, we have C n 1 , so limn C 4 and n 1 !1 n 1 n D C D C D limn Sn.132/ 4. !1 j j D Introducingp the notion of the type of a subsequence, and the associated idea of pattern avoidance, opens a panorama of fruitfulgeneralizations and questions.For example, for any permutation of length n, let r denote the reverse of , which has r .j / .n 1 j / 1 D C for 1 j n. Similarly, let denote the group-theoretic inverse of . Then it’s not Ä Ä r r 1 hard to show that avoids if and only if avoids , which occurs if and only if 1 avoids . Combining these, we find Sn.132/ Sn.213/ Sn.231/ Sn.312/ j j D j j D j j D j j and Sn.123/ Sn.321/ for all n. Furthermore, it’s already implicit in work of Percy j j D j j MacMahon [21] in 1915 and Craige Schensted [30] in 1961 that Sn.123/ Cn. As a n j j D result, we have limn Sn./ 4 for all S3. All of which leads to the natural !1 j j D 2 question: what happens if is bigger? p
4 The rise of the machines in combinatorics
Computer programming questions motivated Knuth’s railcars problem, and they continued to drive the study of patterns in permutations for the next decade and a half. Rotem [29] was the next person to look at permutations which can be produced with one pass through a stack. He called these permutations stack-sortable, and in his main results he gave a bijection from these permutations to binary trees, which he used to analyze the average length of a monotonic subsequence in these permutations. Even after Simion and Schmidt kicked off the study of restricted permutations for their own sake, others continued to in- vestigate restricted permutation problems arising from data structures. The next major step in this direction came in Julian West’s thesis [39], where he studied permutations one can obtain using two passes through a stack, which he called 2-stack-sortable. Relying on the language of pattern-avoidance, West showed that these permutations are the ones which avoid 2341 and whose only subsequences of type 3241 are those which are contained in a subsequence of type 35241. West also conjectured that the number of 2-stack-sortable 70 A Century of Advancing Mathematics
2 3n permutations of length n is , which Zeilberger proved [41] shortly .n 1/.2n 1/ n C C ! after hearing West describe his conjecture at a talk in May of 1991. Since then a thriving industry has developed, in which people use the language of permutation patterns to study permutations generated by parallel queues, dequeues, networks of stacks, ordered stacks, token passing in graphs, and even forklifts, to name just a few. There are more relevant references than I can comfortably list here, but the interested reader would do well to start with the summary in Section 2.1 of Kitaev’s encyclopedic monograph [19]. Questions from computer science lead to interesting problems throughout combina- torics, but for the past thirty years computers have played a more explosive role in the field, letting mathematicians generate reams of data that would be impossible to produce by hand. These data, in turn, suggest new conjectures, and eventually lead to new theo- rems. Simion and Schmidt’s paper, for example, enumerates more than a dozen families of restricted permutations, with sequences like powers of two, the Fibonacci numbers, the n central binomial coefficients n , and the triangular numbers plus one. With a computer, 2 one can essentially peek in theb c back of the book, generating the first ten or so terms of each sequence, and then seeing what needs to be proved. West’s conjecture on the num- ber of 2-stack sortable permutations of length n would also be much harder to discover without computational assistance: one could certainly write down the 91 2-stack-sortable permutations of length five in half an hour or so, and perhaps get the 408 2-stack-sortable permutations of length six in another hour, but the 1938 2-stack-sortable permutations of length seven would present a challenge, and examining all 40320 permutations of length eight to find the 9614 which are 2-stack-sortable would take days, or even weeks, to do by hand. With a computer, obtaining all of these values and more is the work of a pleasant afternoon. When evening comes, and our programming work has told us that our sequence begins with the terms 1;2;6;22;91;408;1938, and 9614, we still need to formulate a conjecture about the general term before we can make more progress. Here, too, computers have be- come indispensable. Forty years ago we might have asked a dozen of our closest friends whether they had ever seen this sequence. Sometimes, this actually worked! For example, David Robbins first discovered that alternating-sign matrices are connected with the de- scending plane partitions first introduced by George Andrews by asking Richard Stanley whether he had ever seen the sequence 1;2;7;42;429;7436;::: [28]. But most of the time, our friends’ memories are no better than our own. In the area of remembering integer sequences, computers have completely replaced hu- man beings. Neil Sloane began this process in 1964, when he started collecting sequences he encountered on index cards, and in 1973 he published his collection in his book A Hand- book of Integer Sequences, which included 2372 sequences. In 1995 Sloane and Simon Plouffe published a second edition of Sloane’s book, with the new title The Encyclopedia of Integer Sequences, which included 5487 sequences. Books can’t keep up with computers, though, and in 1996 Sloane established the On-Line Encyclopedia of Integer Sequences [23], which he singlehandedly maintained until 2002. The OEIS, as it is affectionately known, is now run as a wiki by a devoted group of users. It grows by more than 10000 entries each year, and would require more than 750 volumes of more than 500 pages each if it were published in book form today. Defying God: the Stanley-Wilf Conjecture, Stanley-Wilf Limits, and . . . 71
When we enter our terms 1;2;6;22;91;408;1938;9614 into the OEIS search box, we are rewarded with a description of the sequence that includes several more terms, a general formula, code for generating even more terms, a list of related references, comments from other users about the sequence, families of objects the sequence is known or conjectured to count, and more. In hindsight it’s amusing that Sloane called his book “A Handbook,” as though there might be competitors. There are none, and the OEIS is a required stop for anyone who encounters an integer sequence they don’t recognize. It’s no exaggeration to observe that in certain parts of combinatorics, the OEIS alone has increased the rate of new discoveries by an order of magnitude.
5 The Stanley-Wilf conjecture In keeping with the prevailing sense that combinatorics was just an offshoot of other sub- jects, few papers even mentioned patterns in permutations before 1985, and those that did generally followed Knuth in approaching the subject from a computer science point of view. Nevertheless, throughout the 1970s and into the 1980s, combinatorics was becoming a proper, and popular, subject of study in its own right, and the study of patterns in permu- tations was a current in this wave of acceptance. In particular, by 1980 a handful of people behind the scenes had begun to ask what sorts of sequences can appear as Sn./ , and in j j particular, how fast such a sequence can grow. Just as we bounded Sn.132/ with an exponential function, we can also bound j j Sn.12 : : : k/ with an exponential function in an elementary way. Inspired by the clas- j j sic pigeonholeprinciple proof of the Erd˝os-Szekeres theorem on increasing and decreasing subsequences in permutations, we first label each entry m of a given Sn.12 : : : k/ with 2 the length of the longest increasing subsequence of whose last entry is m. In Figure 3 each entry of the permutation 381426975 has its label above it in bold. Since has no
1 2 1 2 2 3 4 4 3 3 8 1 4 2 6 9 7 5 Figure 3. Labeling the entries of the permutation 381426975. increasing subsequence of length k, all of these labels will be among 1; 2; : : :; k 1. In ad- dition, for each j the entries with label j will be in decreasing order: if an entry labelled j has a larger entry to its right,then that larger entry must be labelled at least j 1. Therefore C is a disjoint union of k 1 or fewer decreasing subsequences. There are .k 1/n ways to choose one of these subsequences for each of 1; 2; : : : ; n to be in, and there are no more than .k 1/n ways to choose which positions belong to which subsequences. Therefore, 2n Sn.12 : : : k/ .k 1/ . In fact, in 1981 Regev used [27] analytical machinery to prove j j Ä results which imply n 2 lim Sn.12 : : : k/ .k 1/ : (1) n j j D !1 However, the relationship betweenp Regev’s work and subsequences of permutations is not visible to the naked eye, in part because his actual results have to do with certain sums arising in the study of the representations of the symmetric group. Unaware at first of Regev’s work and the bound on Sn.12 : : : k/ , around 1980 Herb n j j Wilf asked whether Sn./ .k 1/ for all Sk. At nearly the same time, Richard j j Ä C 2 72 A Century of Advancing Mathematics
n 2 Stanley independently asked whether limn Sn./ .k 1/ for all Sk. Per- !1 j j D 2 haps responding to Stanley’s conjecture or Regev’s results, Wilf soon asked whether there p n exists, for each permutation , a finite constant c./ such that limn Sn./ c./. !1 j j D Eventually, two conjectures emerged: the upper bound conjecture and the limit conjecture, p which together came to be known as the Stanley-Wilf conjecture. Conjecture (The Stanley-Wilf Upper Bound Conjecture). For every permutation , there n is a real number c./ such that Sn./ c./ . j j Ä Conjecture (The Stanley-Wilf Limit Conjecture). For every permutation , there is a real n number c./ such that limn Sn./ c./. !1 j j D It’s routine to show that the limitp conjecture implies the upper bound conjecture, and in 1999 Arratia showed [4] that these two conjectures are equivalent. More specifically, Arra- tia gave a simple combinatorial proof that for any permutation and all m; n 1, we have Sn m./ Sn./ Sm./ . This implies that f .n/ ln. Sn./ / has the property j C j j jj j D j j that f .n m/ f .n/ f .m/ for all m; n 1; we call such functions subadditive [40]. C Ä C Now we can use a result, Fekete’s subadditivity lemma, which says that if f is subadditive f .n/ ln. Sn./ / then limn n exists, though it might be . This means limn j n j exists, !1 1 !1 n 1 n 1 so limn S ./ exists. The upper bound conjecture implies that S ./ is bounded !1 n n 1 j j j j below by c./q, and the limit conjecture follows. q For nearly a quarter of a century the Stanley-Wilf conjecture stood against all who tried to prove it. Indeed, by the dawn of the new millenniumno proof was in sight,though many of the problem’s sharp corners had been chipped away. Mikl´os B´ona sheared off one of the sharpest of these corners in 1999, when he showed that the Stanley-Wilf conjecture holds for layered permutations [7]. B´ona’s result is an extension of the fact that the conjecture holds for monotone permutations, since a layered permutation is one obtained by first list- ing the smallest `1 numbers in decreasing order, then listing the next smallest `2 numbers in decreasing order, etc. For example, 321765498 is the layered permutation with `1 3, D `2 4, and `3 2. Noga Alon and Ehud Friedgut [3] chiseled away another sharp cor- D D ner in 1999, when they showed that the Stanley-Wilf conjecture holds for all permutations consisting of an increasing sequence followed by a decreasing sequence, as well as for all permutations which avoid 123. Fissures one might use to break the problem open were also noted throughoutthe1990s. For instance, Alon and Friedgut showed [3] that the Stanley-Wilf conjecture almost holds, .n/n by showing that Sn./ c./ for a certain slow-growing function , which they j j Ä constructed from the inverse of the Ackermann function. In the same paper, Alon and Friedgut also proved that if there is a linear upper bound on the lengths of certain words over an ordered alphabet, then the Stanley-Wilf conjecture will follow. Another fissure in the problem appeared in the early 1990s, but it was only visiblefrom a certain angle. To describe this new point of view, we first recall that each permutation Sn has an associated permutation matrix, namely the n n matrix of 0s and 1s 2 whose ij th entry is 1 if .i/ j and 0 if .i/ j . It is not difficult to translate the D ¤ notions of pattern avoidance and containment we’ve been discussing into the language of permutation matrices, but our new point of view actually depends on a different, more permissive definition of containment. Specifically, we say an mA nA matrix A of 0s and 1s contains an mB nB matrix B of 0s and 1s whenever there is an mB nB submatrix Defying God: the Stanley-Wilf Conjecture, Stanley-Wilf Limits, and . . . 73
B1 of A such that if the ij th entry of B is 1 then the ij th entry of B1 is 1. Note that 0s in B impose no restriction on the corresponding entry of B1. For example, the matrix 1 1 1 1 1 1 0 1 1 0 1 contains the matrix exactly twice: once in bold here 1 0 1 and 0 1 1 1 0 1 1 1 0 Â Ã 1 1 0 @ A 1 1 1 @ A once in bold here 1 0 1 . 01 1 01 One can ask the@ same questionA about matrices that we have asked about permutations, namely, how many m n matrices do not contain a given matrix? However, the fact that our matrices need not contain any particular number of 1s inspired Zolt´an F¨uredi and P´eter Hajnal [16] to ask a different question: if we have a certain matrix C , all of whose entries are 0s and 1s, how many 1s can we put into an n n matrix before it must contain C ? F¨uredi and Hajnal answered this question for a variety of specific C , some of which were permutation matrices, and others of which were not. At the end of their paper, tucked in among several other open questions, they asked whether there exists, for any permutation matrix C , a constant c.C / such that the number of 1s an n n matrix can contain before it must contain C is bounded above by a linear function of n, namely c.C / n. F¨uredi and Hajnal asked the question, but it was Martin Klazar who, in 2000, promoted F¨uredi and Hajnal’s question to the status of a conjecture. Conjecture (The F¨uredi-Hajnal Conjecture). For every permutation matrix C , there is a real number c.C / such that if an n n matrix of 0s and 1s containsat least c.C / n entries equal to 1, then it contains C . Klazar’s promotion of this idea from a question to a conjecture may have been justified by his main result [20], which is that the F¨uredi-Hajnal conjecture implies the Stanley-Wilf conjecture. The problem had another hairline crack, but it wasn’t clear whether anyone could get some explosives, or a crowbar, or even a chisel, into it.
6 More machines in combinatorics As we mentioned earlier, over the past two generations computers have become essential tools that many mathematicians, and especially combinatorialists, use to generate mathe- matical data. These data lead to conjectures, and, if all goes well, to theorems. But com- puters can be more than just data-generating devices; more and more frequently, computers play a central role in generating conjectures, and even in proving theorems. The first, and certainly most famous, proof in which computers played a substantial role is Appel and Haken’s 1976 proof of the four-color theorem. Although several people have found ways to streamline this proof over the past forty years, its overall structure remains the same: this is a proof by several hundred cases. More specifically, to prove the four-color theorem we first show that if G is a planar graph which cannot be properly colored with four colors, and every planar graph with fewer vertices than G can be properly colored with four colors, then G must contain one of several hundred configurations of vertices. We then show that for each of these configurations, it’s possible to reduce the number of vertices in G to obtain a smaller counterexample. The computer’s role in this proof is twofold: it uses human-generated heuristics to help find a family of unavoidable configurations of vertices, and it aids in constructing proofs that each configuration can be reduced. (For more details 74 A Century of Advancing Mathematics on the four-color theorem, its history, and its proof, see Robin Wilson’s contributionto this volume.) Since Appel and Haken’s work, combinatorialists enumerating pattern-avoiding per- mutations have found ways to use computers that go beyond generating data (though this remains an important computer task) or checking numerous cases. For example, in the first few steps of his proof of West’s formula for the number of 2-stack-sortable permutations of length n, Zeilberger used Maple to find a functional equation for the generating function for these permutations with respect to length and another statistic. But Zeilberger took the ability of computers to do mathematics to a new level in 1998, when he taught his com- puter Shalosh B. Ekhad to enumerate pattern-avoiding permutations. More specifically, Zeilberger wrote code that enables his computer to generate, for each set R of forbidden patterns an object called an enumeration scheme, which can be readily converted into a recursive formula for Sn.R/ [42]. Following Zeilberger’s construction, Shalosh B. Ekhad j j was able to recover most of the enumerations then known, and even to discover (and in the process prove) some new ones. Since then Vince Vatter [37], Lara Pudwell [26] and others have refined Zeilberger’s work on pattern-avoiding permutations, and extended it to more general objects and definitions of pattern containment.
7 The proof of the Füredi-Hajnal conjecture: too nice to be true
At the turn of the millennium the Stanley-Wilf conjecture was widely seen as one of the most important and difficultopen problems in the study of permutation patterns, and several of the top researchers in the field were trying everything they could to crack the problem. In spite of their efforts, by late 2003 they had made no further progress. Meanwhile, un- beknownst to anyone studying permutation patterns, Adam Marcus and G´abor Tardos had become interested in a nice collection of questions involving 0-1 matrices that F¨uredi and Hajnal had posed a decade before. Although Marcus and Tardos didn’t know it yet, these questions included the one Klazar had elevated to conjecture status. It didn’t seem to Mar- cus and Tardos that these questions had attracted much attention, even though they were intriguing and approachable. Marcus and Tardos didn’t care about permutations in partic- ular, and they had never heard of the Stanley-Wilf conjecture, but they did find they could make progress on one of F¨uredi and Hajnal’s questions involving permutation matrices. Soon they had settled one of F¨uredi and Hajnal’s questions: they had shown that if C is a permutation matrix then there is a real number c.C / such that if an n n matrix of 0s and 1s contains at least c.C /n entries equal to 1, then it contains C [22]. But they didn’t hear the crowd cheering their result until weeks later, when Marcus found some of Klazar’s other work related to F¨uredi and Hajnal’s paper, and Klazar told him about the Stanley-Wilf conjecture. Marcus and Tardos’s proof of the F¨uredi-Hajnal conjecture was a major advance in the study of patterns in permutations, but it’s not a long proof, and it doesn’t involve any complicated technical machinery. It is a product of human ingenuity, not fast computers. Nevertheless, it took the permutation patterns community by storm. B´ona had just submit- ted the first edition of his book Combinatorics of Permutations [8] to the publisher when Defying God: the Stanley-Wilf Conjecture, Stanley-Wilf Limits, and . . . 75 he learned of Marcus and Tardos’s proof. Rather than publish a book that would be out of date before it went to press, B´ona insisted that the publisher wait for him to add a new section on Marcus and Tardos’s work before moving ahead with publication. The proof is accessible enough that Zeilberger has given a one-page account in the personal journal of Ekhad and Zeilberger [43], and Tardos gave the entire proof in detail, on the blackboard, in a 45-minute talk at the Second International Permutation Patterns conference in Nanaimo, British Columbia, in early July of 2004. Marcus and Tardos’s proof is so elegant that when they first discovered it, Marcus and Tardos themselves thought it was too simple to be cor- rect. They gave themselves the weekend to find the error they were certain was hidden within. We need not give all of the details of Marcus and Tardos’s proof here, but we can outline it. Suppose C is a k k permutation matrix, and for each positive integer n, let f .n/ denote the largest number of 1s an n n matrix of 0s and 1s can contain without containing a copy of C . For simplicity, let n be a multiple of k2. If M is an n n matrix of 0s and 1s which does not contain C , then divide it into contiguous k2 k2 blocks. Call a block wide whenever it has at least k columns which contain a 1, and call a block tall whenever it has at least k rows which contain a 1. Essentially, Marcus and Tardos show that there are few wide blocks and few tall blocks, and that blocks which are neither wide nor tall contain few 1s. Let’s look at the blocks which are neither wide nor tall first. Any block with more than .k 1/2 1s must be tall or wide, so the number of 1s in a block which is not tall or wide is at most .k 1/2. But we can also bound the number of these blocks which contain any f n 1s at all. In particular, if there are more than k2 blocks which contain a 1, then there is a pattern of type C of these blocks. By choosing appropriateÁ rows and columns, we can select each of the 1s we need to form a copy of C in M , since C has exactly one 1 in f n every row and column. Therefore, there are at most k2 blocks which are neither tall nor wide, but which still contain a 1. Combiningthese observations, Á we find that the blocks which are neither wide nor tall contain no more than .k 1/2f n 1s in total. k2 Now let’s consider the wide blocks and the tall blocks. Each blockÁ is k2 k2, so each wide block and each tall block contains at most k4 1s. Marcus and Tardos use the pigeon- n k2 hole principle to show that there are no more than k k wide blocks and no more than n k2 2 k2 k k tall blocks, so these blocks contain at most 2k k n 1s in total. Combining these estimates with our earlier work, we find n k2 f .n/ .k 1/2f 2k2 n: 2 Ä k C k ! Á Now it’s not hard to show by induction that
k2 f .n/ 2k4 n: (2) Ä k !
The coefficient of n on the right side of (2) is large as a function of k, but we have what F¨uredi and Hajnal (through Klazar) promised: a linear bound on f .n/. 76 A Century of Advancing Mathematics
8 Undergraduates in combinatorics
Marcus and Tardos’s proof of the F¨uredi-Hajnal conjecture is remarkable in many ways, one of which is that Marcus had barely finished his undergraduate work when they found it. In particular, Marcus spent his junior year in 2001–02 as an undergraduate in the Budapest Semesters in Mathematics program, and after graduating from Washington University, he returned to Budapest on a Fulbright fellowship in 2003. It was during Marcus’s Fulbright year that he and Tardos proved the F¨uredi-Hajnal conjecture, which places their work in the middle of another crucial development in the explosion of combinatorics that has taken place over the past two generations: student research, and especially undergraduate re- search. The tradition of involving students in combinatorics research actually goes back more than a century: Sylvester did much of his foundationalwork on the theory of partitions[36] in collaboration with the nine graduate students who were taking a class with him on the subject at Johns Hopkins University in the spring of 1882. But the practice was rare in the United States when the National Science Foundation began funding the URP (Undergrad- uate Research Program) in 1958, and undergraduate research in mathematics was still not widespread when the NSF began funding mathematics REUs in 1987. Since then, however, undergraduate research in mathematics has blossomed: there were eight NSF-funded REU sites in mathematics in 1987, and by 2003 there were more than fifty. Combinatorics has played a central role in this flowering. To see how extensively combinatorics is intertwined with undergraduate research, one need look no further than the NSF’s own website: of the forty-seven REU sites listed there as being funded for the summer of 2014, twenty-three include projects on combinatorics and/or graph theory. (For more details on the history of undergraduate research in mathematics in the United States, see Joseph Gallian’s contri- bution to this volume.) Combinatorics and graph theory are also well-represented among undergraduate research award winners: in three of the last four years a Morgan Prize winner or runner-up has been recognized for her or his substantial work in combinatorics. Not only is undergraduate research ubiquitous in combinatorics and vice versa, but the quality of the contributions undergraduates have made to the subject has been remarkably high. In 1989 Bill Doran contributed [13] a key piece of theenumeration of the totallysym- metric self-complementary plane partitions which fit in a 2n 2n 2n box, by explaining how to reformulate these objects as collections of nonintersectinglattice paths, which could then be counted using determinants or permanents of matrices of binomial coefficients. In 2002 Joshua Greene won the Morgan Prize for his simplified proof of the Kneser conjec- ture, which involves the chromatic numbers of certain Kneser graphs. Undergraduates have also contributed substantially to the study of patterns in permutations, even beyond Mar- cus and Tardos’s work. For instance, in 2004 Reid Barton won the Morgan Prize for his work on the number of copies of a given pattern which can be packed into a permutation of a given length, and in the early 1990s Zvezdelina Stankova gave combinatorial proofs [32, 33 ] that Sn.4132/ Sn.3142/ and Sn.1234/ Sn.4123/ for all n 0. These j j D j j j j D j j last two results will save us a substantial amount of work when we start to look beyond the n results of Marcus and Tardos, by investigating the actual values of limn Sn./ for !1 j j various permutations . p Defying God: the Stanley-Wilf Conjecture, Stanley-Wilf Limits, and . . . 77
9 Stanley-Wilf limits Marcus and Tardos’s proof of the F¨uredi-Hajnal conjecture made it official: for every per- n mutation there is a constant L./ such that limn Sn./ L./. Today we refer !1 j j D to the number L./ as a Stanley-Wilf limit, and we’d liketo know the value of L./ for as p many permutations as possible. We have seen that L.123/ L.132/ 4, and we’ve D D also seen how to use some easy symmetries to show that L./ 4 for every S3. In D 2 addition, we have seen evidence that L.1234:::k/ .k 1/2, a fact which follows from D the work of Regev [27]. The values of L./ given above are the only values that were known by the mid 1990s, and they all support the idea that L./ depends only on the length of . In other words, it appears that all permutations of a given length are equally difficult to avoid, at least asymp- totically. In fact, these data are also consistent with Stanley’s much older conjecture that L./ .k 1/2 for any permutation of length k. It turns out, though, that making true D conjectures about Stanley-Wilf limits is much harder than making false ones. Indeed, in his thesis [6] B´ona used a connection between 1342-avoiding permutations and plane trees to find an exact formula for Sn.1342/ as a sum of terms involving binomial coefficients, and j j from this formula he extracted the fact that L.1342/ 8. This is shocking! Not only does D this result disprove two longstanding conjectures at once, it also says that at a fundamental level, 1342 is harder to avoid than 1234. With L.1234/ and L.1342/ in hand, we might thinkthat we have 22 more permutations of length four to consider. However, thanks to the symmetries we mentioned earlier and work of West and Stankova, we know that if is a permutationof length four, then Sn./ j j is equal to one of Sn.1234/ , Sn.1423/ , or Sn.1324/ for all n. As a result, we have j j j j j j just one more Stanley-Wilf limit to compute for a forbidden pattern of length four, namely L.1324/. All of which means that we have returned to our original question: how fast does an.1324/ grow, anyway? We can start to get a feel forthe growthrate of an.1324/ by lookingat the data in Table n 2, where we have the values of Sn.1324/ when n is a multiple of four. Our table ends j j at n 36, because this is the largest value for which Sn.1324/ is currently known. All D p j j of these terms are available in the On-Line Encyclopedia of Integer Sequences; the terms with n 31 are due to recent work of Fredrik Johansson and Brian Nakamura [18], and Ä the rest are due to even more recent work of Andrew Conway and Anthony Guttmann [12]. n 4 n 5=2 It is known that Sn.1234/ 9 n and Sn.1342/ 8 n , so we might ask for a j j j j n constants and for which Sn.1324/ is asymptotic to a function of the form n . In j j fact, Johansson and Nakamura, with a computational assist from Shalosh B. Ekhad, have found that if Sn.1324/ is asymptotic to a function of this form, then 10:45 and j j 8:64 are the most consistent with the values of Sn.1324/ for n 31. If Johansson j j Ä and Nakamura’s values of and are in the right neighborhoods, then the fact that the value of for Sn.1324/ is so much greater than the corresponding values for the other j j j j n two sequences explains the slow convergence we see in the data for Sn.1324/ . j j p n 4 8 12 16 20 24 28 32 36
n Sn.1324/ 2:19 3:348 4:141 4:728 5:186 5:559 5:869 6:134 6:363 j j n p Table 2. Values of jSn.1324/j for small n. p 78 A Century of Advancing Mathematics
Unfortunately, Johansson and Nakamura’s values might not be in the right neighbor- hoods. Even more troubling, as Johansson and Nakamura themselves point out, it’s un- n likely that there is an asymptotic formula for Sn.1324/ of the form n at all. Indeed, j j in May of 2014 Conway and Guttmann gave compelling evidence that Sn.1324/ actually n pn g j j behaves like a function of the form B 1 n for constants B, , 1, and g. In addition, they estimated that 11:60 0:01, 1 0:0398 0:0010, g 1:1 0:2, and D ˙ D ˙ D ˙ B 9:5 1:0. Conway and Guttmann’s methods strongly suggest they have the right D ˙ asymptotic form for Sn.1324/ , but these methods do not seem powerful enough to prove j j a claim like this. Which means that if we want to understand how fast an.1324/ grows, then we should probably try to bound it.
There is a natural lower bound on L.1324/: since Sn.132/ Sn.1324/, we must have L.1324/ 4. Beyond this, little progress was made on the problem of bounding L.1324/ below until 2006, when Michael Albert, Murray Elder, Andrew Rechnitzer, Paul Westcott, and Mike Zabrocki [2] used a finite automaton which accepts only sequences construct- ing certain elements of Sn.1324/ to show that L.1324/ 9:47. This result was the first nontrivial lower bound on L.1324/, but it also showed conclusively that 1234 is neither the most restrictive nor the least restrictive forbidden pattern of length four, a fact which is at odds with our intuitionabout which permutations are at the extremes of the set of all permutations. We continue to see incremental progress on this problem: in early June of 2014, David Bevan submitted a paper to arXiv [5] in which he uses interleaved trees and Łukasiewicz paths to construct a large class of permutationsin Sn.1324/, thus showing that L.1324/ 9:81. One of the nice features of Marcus and Tardos’s proof of the Stanley-Wilf conjecture, in addition to its simplicity, is that it gives an explicit upper bound on L./ in terms of the length of : if has length k, then the proof tells us that L./ 15a, where a 4 k2 Ä D 2k k . Even better, in 2009 Josef Cibulka improved [10] this general bound significantly, 2 k2 to L./ 2:88 4k8 . Since Ä k k2 k2.k2 1/.k2 2/ .k2 k 1/ C k D k.k 1/.k 2/ 2 1 !
2 k2 is at least a polynomial of degree k in k, the factor k in Cibulka’s bound is at least 2k ln k. Ever since Stanley and Wilf’s first conjectures about L./, people had hoped this bound could be improved to some polynomial in k. But Jacob Fox dashed these hopes in the fall of 2013, by showing [15 ] that L./ is exponential in k for almost all permutations of length k. Nevertheless, Cibulka’s work gives us a starting point in our quest to bound L.1324/ in particular: it says L.1324/ 2:50078 1012. However, because this bound Ä is general, it’s not at all sharp, so we turn our attention to finding tighter upper bounds on L.1324/ in particular. To start to improve our upper bound on L.1324/, recall that we saw earlier how to reconstruct a permutation which avoids 132 from the positions and values of its left-to- right minima. This observation effectively divides the set of all permutations of a given length into classes, each of which contains no more than one element of Sn.132/. Since n 1 n 1 there are at most 4 classes, there are at most 4 elements of Sn.132/. In his thesis Defying God: the Stanley-Wilf Conjecture, Stanley-Wilf Limits, and . . . 79
B´ona expanded on this idea, by proving that each of these classes contains at most 8n elements of Sn.1324/. Thus, L.1324/ 32. n Ä The numerical data regarding Sn.1324/ in Table 2 suggest that our upper bound j j on L.1324/ is worse than our lower bound, but B´ona’s thesis work represented the state p of the art for nearly a decade and a half. A new idea was required, and in 2012 Anders Claesson, V´ıt Jel´ınek, and Einar Steingr´ımsson provided one [11]. To each Sn.1324/, 2 we associate a sequence of colors, red or blue, one for each entry of . To do this, we first color the leftmost entry 1 red. Proceeding from left to right, if we have colored the entries 1; : : : ; j 1, then we color the entry j according to the following rules. 1. If coloring j red would create a red subsequence of type 132, then we color it blue.
2. If one of 1; : : : ; j 1 is blue, and is less than j , then we color j blue. 3. If neither of the first two rules applies, then we color j red. For example, if 749538612 then we would color the entries as in 749538612 (here the D red entries are in bold), obtaining the color sequence RRRBRBBRR. Note that we color the 5 blue because otherwise the 4, the 9, and the 5 would create a red subsequence of type 132. On the other hand, we color both the 8 and the 6 blue for two reasons: otherwise they would be part of a red subsequence of type 132, and they each have a smaller blue entry (namely, the 5) to their left. We can show (go ahead! it’s not hard) that if avoids 1324, then its sequence of red entries avoids 132 and its sequence of blue entries avoids 213. Claesson, Jel´ınek, and Ste- ingr´ımsson use some standard computations with binomial coefficients to show that this implies L.1324/ 16, but we can also follow B´ona [9] to really see where this bound Ä comes from. Having colored each entry of Sn.1324/ red or blue, we now separate 2 the entries of each color into two classes. To do this, first replace each red entry which is a left-to-right minimum in with the letter A, and then replace each remaining red entry with the letter B. Similarly, inspired by the fact that 1324 is its own reverse-complement and 132 and 213 are reverse-complements of each other, replace each blue entry which is a right-to-left maximum with the letter C , and replace each of the other blue entries with the letter D. For example, we’ve seen that if 749538612 then our color sequence is D RRRBRBBRR. Following our new prescription, we find that the associated string of As, Bs, C s, and Ds is AABDACCAB. We have now seen that for each Sn.1324/, we obtain a string w./ of As, Bs, 2 C s, and Ds by listing which of these letters is assigned to the first entry, which to the second, etc. Similarly, we obtain a second such string z./ by listing which of these letters is assigned to the entry 1, which to the entry 2, etc. For instance, if 749538612 then D we’ve seen that w./ AABDACCAB, and we also have z.p/ ABAADCACB. D D Note that our constructions of w./ and z./ amount to an elaboration on our earlier use of the positions and values of the left-to-right minima in a permutation Sn.132/. 2 B´ona’s main result is that while some pairs of strings correspond to no permutation, no pair of strings corresponds to two or more permutations. Since there are 16n pairs of strings of length n, we have L.1324/ 16. In fact, B´ona also shows that none of these strings Ä contains a B which is immediately followed by a C , so some standard computations with linear recurrence relations gives us L.1324/ 7 4p3 13:928, a result which B´ona Ä C has recently improved to L.1324/ 13:73718. Ä 80 A Century of Advancing Mathematics
10 New frontiers: getting closer to God For more information on the state of the permutation pattern art, I would refer the reader to B´ona’s book [8], Kitaev’s monograph [19], and Steingr´ımsson’s survey of open prob- lems [35]. In the meantime, Table 3 summarizes the Stanley-Wilf limits we’ve discussed in this paper, and the reader can find more information about these limits in Section 6.1.4
L./ 132 4 1342 8 1324 Œ9:81; 13:73718 123 : : : k .k 1/2 Table 3. The Stanley-Wilf limits in this paper. of Kitaev’s monograph. We still have much to discover about these quantities. In addition, there are several closely related topics that fall outside the scope of this article. For exam- ple, while it follows from the Marcus-Tardos theorem (as the Stanley-Wilf conjecture is now known) that for every set R of forbidden patterns there is a constant c.R/ such that n n Sn.R/ c.R/ , it is still not known whether limn Sn.R/ exists for every set R j j Ä !1 j j of forbidden patterns. Nevertheless, this limit does exist for many sets R, and Vatter has p found some amazing structure in the set of real numbers which can appear as one of these limits [38]. Finally, Steingr´ımsson has recently stepped up to challenge Zeilberger’s original claim about the difficulty of finding S1000.1324/ , saying, “I’m not sure how good Zeilberger’s j j God is at math, but I believe that some humans will find this number in the not so distant future.” In fact, in 2013 Steingr´ımsson and Zeilberger made a bet about whether someone will find S1000.1324/ by 2030. If someone finds this value in year n for n 2030, j j Ä then Zeilberger will pay Steingr´ımsson e 10.2030 n/. Otherwise, Steingr´ımsson will pay Zeilberger e 170. Until Zeilberger and Steingr´ımsson settle their bet, we’ll have to let Conway and Guttmann have the last word on the subject. They write, “While making no Messianic claims, our asymptotics permit the approximate answer 4:6 101017.” Acknowledgements Several people gave me helpful and extensive comments, suggestions and corrections on various drafts of this paper, and brought me up to date on recent developments related to Stanley-Wilf limits. In particular, I would like to thank Mikl´os B´ona, Stephen Kennedy, Darla Kremer, Adam Marcus, Lara Pudwell, Kailee Rubin, Einar Steingr´ımsson, G´abor Tardos, and Doron Zeilberger for their thorough and thoughtful feedback on various drafts of this article. Their comments led to a much-improved final version. Of course, blame for any remaining errors or shortcomings is mine alone.
Bibliography [1] F. Acerbi, On the shoulders of Hipparchus:a reappraisal of ancient Greek combinatorics, Arch. Hist. Exact Sci. 57 (2003) 465–502. Defying God: the Stanley-Wilf Conjecture, Stanley-Wilf Limits, and . . . 81
[2] M. H. Albert, M. Elder, A. Rechnitzer, P. Westcott, M. Zabrocki, On the Wilf-Stanley limit of 4231-avoiding permutations and a conjecture of Arratia, Adv. in Appl. Math. 36 no. 2 (2006) 95–105. [3] N. Alon, E. Friedgut, On the number of permutations avoiding a given pattern, J. Combin. Theory, Series A 89 (2000) 133–144. [4] R. Arratia, On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern, Electron. J. Combin. 6 (1999). [5] D. Bevan, Permutations avoiding 1324 and patterns in Łukasiewicz paths (2014), available at http://arxiv.org/abs/1406.2890. [6] M. B´ona, Exact and Asymptotic Enumeration of Permutations with Subsequence Conditions. Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 1997. [7] M. B´ona, The solution of a conjecture of Stanley and Wilf for all layered patterns, J. Combin. Theory Ser. A 85 (1999) 96–104. [8] M. B´ona, Combinatorics of Permutations, second edition. Chapman & Hall, 2012. [9] M. B´ona, A new upper bound for 1324-avoiding permutations (2012), available at arxiv.org/abs/1207.2379. [10] J. Cibulka, On constants in the F¨uredi-Hajnal and the Stanley-Wilf conjecture, J. Combin. The- ory Ser. A 116 (2009) 290–302. [11] A. Claesson, V.Jel´ınek,, E. Steingr´ımsson, Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns, J. Combin. Theory Ser. A 119 no. 8 (2012) 1680–1691. [12] A. R. Conway, A. J. Guttmann, On the growth rate of 1324-avoiding permutations (2014), available at arxiv.org/abs/1405.6802. [13] W. F. Doran IV, A connection between alternating sign matrices and totally symmetric self- complementary plane partitions, J. Combin. Theory Ser. A 64 (1993) 289–310. [14] A. W. F. Edwards, Pascal’s Arithmetical Triangle. Oxford University Press, Oxford, 1987. [15] J. Fox, Stanley-Wilf limits are typically exponential (2013), available at arxiv.org/abs/1310.8378. [16] Z. F¨uredi, P. Hajnal, Davenport-Schinzel theory of matrices, Discrete Math. 103 (1992) 233– 251. [17] L. Habsieger, M. Kazarian, S. Lando, On the second number of Plutarch, Amer. Math. Monthly 105 no. 5 (1998) 446. [18] F. Johansson, B. Nakamura, Using functional equations to enumerate 1324-avoiding permuta- tions (2013), available at arxiv.org/abs/1309.7117. [19] S. Kitaev, Patterns in Permutations and Words. Springer-Verlag, Berlin, 2011. [20] M. Klazar, The F¨uredi-Hajnal conjecture implies the Stanley-Wilf conjecture, in Formal Power Series and Algebraic Combinatorics: 12th International Conference,FPSAC’00, Moscow, Rus- sia, June 2000, Proceedings, Edited by D. Krob, A. Mikhalev, Springer-Verlag, Berlin, 2000. 250–255. [21] P. MacMahon, Combinatory Analysis. Cambridge University Press, 1915. [22] A. Marcus, G. Tardos, Excluded permutation matrices and the Stanley-Wilf conjecture, J. Com- bin. Theory Ser. A 107 (2004) 153–160. [23] The On-Line Encyclopedia of Integer Sequences, published electronically at oeis.org. [24] K. H. Parshall, James Joseph Sylvester: Jewish Mathematician in a Victorian World. The Johns Hopkins University Press, Baltimore, 2006. [25] Plutarch, Moralia, vol. IX (introduction by E. L. Minar, Jr. ). Loeb Classical Library, Harvard University Press, Cambridge, MA, 1961. 82 A Century of Advancing Mathematics
[26] L. Pudwell, Enumeration schemes for words avoiding permutations, in Permutation Patterns, London Math. Soc. Lecture Note Ser., Vol. 376, Cambridge University Press, 2010. 193–211. [27] A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Adv. Math. 41 (1981) 115–136. [28] D. P. Robbins, The story of 1;2;7;42;429;7436;::: , Math. Intelligencer 13 no. 2 (1991) 12– 19. [29] D. Rotem, Stack sortable permutations, Discrete Math. 33 (1981) 185–196. [30] C. Schensted, Longest increasing and decreasing subsequences, Canad. J. Math. 13 (1961) 179–191. [31] R. Simion, F. W. Schmidt, Restricted permutations, Europ. J. Combin. 6 (1985) 383–406. [32] Z. Stankova, Forbidden subsequences, Discrete Math. 132 no. 1–3 (1994) 291–316. [33] Z. Stankova, Classification of forbidden subsequences of length 4, European J. Combin. 17 no. 5 (1996) 501–517. [34] R. P.Stanley, Hipparchus,Plutarch, Schr¨oderand Hough, Amer.Math. Monthly 104 no. 4 (1997) 344–350. [35] E. Steingr´ımsson, Some open problems on permutation patterns, in Surveys in Combinatorics, Edited by S. R. Blackburn, S. Gerke, M. Wildon, London Math. Soc. Lecture Note Ser., Vol. 409, Cambridge University Press, London, 2013. [36] J. J. Sylvester, F. Franklin, A constructive theory of partitions, arranged in three acts, an interact and an exodion, American Journal of Mathematics 5 no. 1 (1882) 251–330. [37] V. Vatter, Enumeration schemes for restricted permutations, Combin. Probab. Comput. 17 no. 1 (2008) 137–159. [38] V. Vatter, Permutation classes of every growth rate above 2.48188, Mathematika 56 no. 1 (2010) 182–192. [39] J. West, Permutations with Forbidden Subsequences and Stack-sortable Permutations, Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 1990. [40] Wikipedia contributors, Subadditivity, Wikipedia, The Free Encyclopedia, available at wikipedia.org/wiki/Subadditivity. [41] D. Zeilberger, A proof of Julian West’s conjecture that the number of two-stack-sortable per- mutations of length n is 2.3n/Š=..n C 1/Š.2n C 1/Š/, Discrete Math. 102 no. 1 (1992) 85–93. [42] D. Zeilberger, Enumeration schemes and, more importantly, their automatic generation, Ann. Comb. 2 no. 2 (1998) 185–195. [43] D. Zeilberger, A loving rendition of the Marcus-Tardos amazing proof of the F¨uredi- Hajnal conjecture, available at www.math.rutgers.edu/˜zeilberg/mamarim/ mamarimhtml/martar.html.
Department of Mathematics and Statistics, Carleton College, Northfield, MN 55057 [email protected] What Is the Best Approach to Counting Primes?
Andrew Granville Universit´ede Montr´eal
As long as people have studied mathematics, they have wanted to know how many primes there are. Getting precise answers is a notoriously difficult problem and the first suitable technique, due to Riemann, inspired an enormous amount of great mathematics, the tech- niques and insights permeating many different fields. In this article we will review some of the best techniques for counting primes, centering our discussion around Riemann’s seminal paper. We will go on to discuss its limitations, and then recent efforts to replace Riemann’s theory with one that is significantly simpler.
1 How many primes are there? Predictions
You have probably seen a proof that there are infinitely many prime numbers, and were perhaps curious as to roughly how many primes there are up to a given point. With the advent of substantial factorization tables,1 it was possible to make predictions supported by lots of data. On December 24th, 1849, Gauss wrote to his “most honored friend,” Encke, describing his own attempt to guess at an approximation as to the number of primes up to x (which we will denote throughout by .x/). Gauss describes his work:
First beginning ...in 1792 or 1793 [when Gauss was 15 or 16] ...I ...directed my attention to the decreasing frequency of prime numbers, to which end I counted them up in several chiliads [blocks of 1000 consecutive integers] and recorded the results ...I soon recognized ...it is nearly inversely proportional to the logarithm, so that the number of all prime numbers under a given boundary x were nearly expressed through the integral x dt log t Z2 where the logarithm is understood to be the natural logarithm.
x dt Gauss went on to compare his guess 2 log t , which we denote by Li.x/, with .x/, the actual count of the number of primes up to x: R 1See Appendix 1.
83 84 A Century of Advancing Mathematics
Under .x/ # primes x Li.x/ Error D f Ä g ˙ 500000 41556 41606:4 50:4 1000000 78501 79627:5 126:5 1500000 114112 114263:1 151:1 2000000 148883 149054:8 171:8 2500000 183016 183245:0 229:0 3000000 216745 216970:6 225:6 Table 1. Primes up to various points and a comparison with Gauss’s prediction.
In his Th´eorie des Nombres, Legendre proposed x log x A with A 1:08366 as a good approximationfor .x/, in which case the comparative errors D are 23:3; 42:2; 68:1; 92:8; 159:1; and 167:6; C C C C C respectively. These are smaller than the errors from Gauss’s Li.x/, though both seem to be excellent approximations. Nevertheless Gauss retained faith in his prediction: These differences are smaller than those with the integral, though they do appear to grow more quickly than [the differences given by the integral] with increasing x, so that it is possible that they could easily surpass the latter, if carried out much farther. Today we have data that goes “much farther”:
x .x/ # primes x Gauss’s error term Legendre’s error term D f Ä g 1020 2220819602560918840 222744644 2981921009910364 1021 21127269486018731928 597394254 27516571651291205 1022 201467286689315906290 1932355208 254562416350667927 1023 1925320391606803968923 7250186216 2360829990934659157 Table 2. Comparing the errors in Gauss’s and Legendre’s predictions.
It is now obvious that Gauss’s prediction is indeed better, that Legendre’s error terms quickly surpass those of Gauss and keep on growing bigger. Table 3 has some of the most recent data and a comparison to Gauss’s guesstimate, Li.x/. When looking at this data, compare the widths of the righttwo columns. The rightmost column is about half the width of the middle column ... How do we interpret that? Well, the width of a column is given by the number of digits of the integer there, which corresponds to the number’s logarithm in base 10. If the log of one number is half that of a second number, then the first num- ber is about the square-root of the first. Thus this data suggests that when we approximate .x/, the number of primes upto x, by Gauss’s guesstimate, Li.x/, the error isaround px, which is really tiny in comparison to the actual number of primes. In other words, Gauss’s prediction is terrific. What Is the Best Approach to Counting Primes? 85
x .x/ # primes x Overcount: ŒLi.x/ .x/ D f Ä g 103 168 10 104 1229 17 105 9592 38 106 78498 130 107 664579 339 108 5761455 754 109 50847534 1701 1010 455052511 3104 1011 4118054813 11588 1012 37607912018 38263 1013 346065536839 108971 1014 3204941750802 314890 1015 29844570422669 1052619 1016 279238341033925 3214632 1017 2623557157654233 7956589 1018 24739954287740860 21949555 1019 234057667276344607 99877775 1020 2220819602560918840 222744644 1021 21127269486018731928 597394254 1022 201467286689315906290 1932355208 1023 1925320391606803968923 7250186216 Table 3. Primes up to various x, and the overcount in Gauss’s prediction.
We still believe that Gauss’s Li.x/ is always that close to .x/. Indeed in section 6, we will sketch how the, as yet unproved, Riemann Hypothesis implies that
.x/ Li.x/ x1=2 log x (RH1) j j Ä for all x 3. This would be an extraordinary thing to prove as there would be many beautiful consequences. For now we will just focus on the much simpler statement that the ratio of .x/ Li.x/ tends to 1 as x . Since Li.x/ is well-approximated by x= logx,2 W ! 1 this quest can be more simply stated as
x lim .x/ exists and equals 1: x log x !1 ı This is known as the Prime Number Theorem, and it took more than a hundred years, and some earth-shaking ideas, to prove it (as we’ll outline in sections 4 to 7 of this article).
2To prove this, try integrating Li.x/ by parts. 86 A Century of Advancing Mathematics
2 Elementary techniques to count the primes
It is not easy to find a way to count primes at all accurately. Even proving good upper and lower bounds is challenging. One effective technique to get an upper bound is to try to use the principle of the sieve of Eratosthenes. This is where we “construct” the primes up to x, by removing the multiples of all of the primes px. One starts by removing the multiplies of 2, from a list of all Ä of the integers up to x, then the remaining multiples of 3, then the remaining multiples of 5, etc. Hence once we have removed the multiples of the primes y we have an upper Ä bound:
# p prime y < p x # n x p − n for all primes p y : f W Ä g Ä f Ä W Ä g At the start this works quite well. If y 2 the quantity on the right is 1 x 1, and so D 2 ˙ bounded above by 1 x 1. If y 3 then we remove roughly a third of the remaining 2 C D integers (leaving two-thirds of them) and so the bound improves to 2 1 x 2. For y 5 3 2 C D we have four-fifths of the remaining integers to get the upper bound 4 2 1 x 4. And, in 5 3 2 C general, we obtain an upper bound of no more than
1 1 x 2.y/ 1: p C p y  à YÄ The problem withthisbound is thesecond term ...as onesieves by each consecutive prime, the second term, which comes from a bound on the rounding error, doubles each time and so quickly becomes larger than x (and thus this is a useless upper bound). This formula does allow us, by letting y slowly with x, to prove that ! 1 .x/ lim 0 x x D I !1 that is the primes are a vanishing proportionof the integers up to x, as x gets larger.3 There has been a lot of deep and difficult work on improving our understanding of the sieve of Eratosthenes, but we are stillunable to get a very good upper bound for the number of primes in this way. Moreover we are unable to use the sieve of Eratosthenes (or any other sieve method) to get good lower bounds on the number of primes up to x The first big leap in our ability to give good upper and lower bounds on .x/ came from an extraordinary observation of Chebyshev in 1851. The observation (as reformulated 2n by Erd˝os in 1933) is that the binomial coefficient n is an integer, by definition, and is divisible once by each prime p in .n; 2n, since p is a term in the expansion of the numerator .2n/Š, but not of the denominator, nŠ2. Therefore
2n p : Ä n p prime ! n 3 1 To deduce this we need to know that limy!1 pÄy 1 0, a fact established by Euler. p D Q Á What Is the Best Approach to Counting Primes? 87 Now, by the binomial theorem, 2n 2n 2n .1 1/2n 22n. Moreover for each n Ä j 0 j D C D p .n; 2n we have p > n and so D 2 P 2n n.2n/ .n/ n p 22n: D Ä Ä n Ä p prime n