DOCSLIB.ORG

Proofs from the BOOK

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Proofs from the BOOK Proofs from THE BOOK Martin Aigner G¨unter M. Ziegler with illustrations by Karl H. Hofmann Springer-Verlag Heidelberg/Berlin to appear August 1998 Preface Paul Erd˝os liked to talk about The Book, in which God maintains the perfect proofs for mathematical theorems, following the dictum of G. H. Hardy that there is no permanent place for ugly mathematics. Erd˝os also said that you need not believe in God but, as a mathematician, you should believe in The Book. A few years ago, we suggested to him to write up a first (and very modest) approximation to The Book. He was enthusiastic about the idea and, characteristically, went to work immediately, filling page after page with his suggestions. Our book was supposed to appear in March 1998 as a present to Erd˝os’ 85th birthday. With Paul’s unfortunate death in the summer of 1997, he is not listed as a co-author. Instead this book is dedicated to his memory. Paul Erd˝os We have no definition or characterization of what constitutes a proof from The Book: all we offer here is the examples that we have selected, hop- ing that our readers will share our enthusiasm about brilliant ideas, clever insights and wonderful observations. We also hope that our readers will enjoy this despite the imperfections of our exposition. The selection is to a great extent influenced by Paul Erd˝os himself. A large number of the topics were suggested by him, and many of the proofs trace directly back to him, or were initiated by his supreme insight in asking the right question or in making the right conjecture. So to a large extent this book reflects the views of Paul Erd˝os as to what should be considered a proof from The Book. “The Book” A limiting factor for our selection of topics was that everything in this book is supposed to be accessible to readers whose backgrounds include only a modest amount of technique from undergraduate mathematics. A little linear algebra, some basic analysis and number theory, and a healthy dollop of elementary concepts and reasonings from discrete mathematics should be sufficient to understand and enjoy everything in this book. We are extremely grateful to the many people who helped and supported us with this project — among them the students of a seminar where we discussed a preliminary version, to Benno Artmann, Stephan Brandt, Stefan Felsner, Eli Goodman, Torsten Heldmann, and Hans Mielke. We thank Margrit Barrett, Christian Bressler, Ewgenij Gawrilow, Elke Pose, and J¨org Rambau for their technical help in composing this book. We are in great debt to Tom Trotter who read the manuscript from first to last page, to Karl H. Hofmann for his wonderful drawings, and most of all to the late great Paul Erd˝os himself. Berlin, March 1998 Martin Aigner Gunter¨ M. Ziegler Table of Contents Number Theory 1 1. Six proofs of the infinity of primes :::::::::::::::::::::::::::::: 3 2. Bertrand’s postulate ::::::::::::::::::::::::::::::::::::::::::: 7 3. Binomial coefficients are (almost) never powers ::::::::::::::::: 13 4. Representing numbers as sums of two squares :::::::::::::::::::17 5. Every finite division ring is a field ::::::::::::::::::::::::::::: 23 6. Some irrational numbers ::::::::::::::::::::::::::::::::::::::27 Geometry 35 7. Hilbert’s third problem: decomposing polyhedra :::::::::::::::: 37 8. Lines in the plane and decompositions of graphs :::::::::::::::::45 9. The slope problem ::::::::::::::::::::::::::::::::::::::::::: 51 10. Three applications of Euler’s formula :::::::::::::::::::::::::: 57 11. Cauchy’s rigidity theorem :::::::::::::::::::::::::::::::::::::63 12. The problem of the thirteen spheres :::::::::::::::::::::::::::: 67 13. Touching simplices :::::::::::::::::::::::::::::::::::::::::::73 14. Every large point set has an obtuse angle ::::::::::::::::::::::: 77 15. Borsuk’s conjecture :::::::::::::::::::::::::::::::::::::::::: 83 Analysis 89 16. Sets, functions, and the continuum hypothesis :::::::::::::::::::91 17. In praise of inequalities ::::::::::::::::::::::::::::::::::::::101 18. A theorem of P´olya on polynomials :::::::::::::::::::::::::::109 19. On a lemma of Littlewood and Offord :::::::::::::::::::::::::117 VIII Table of Contents Combinatorics 121 20. Pigeon-hole and double counting ::::::::::::::::::::::::::::: 123 21. Three famous theorems on finite sets ::::::::::::::::::::::::::135 22. Cayley’s formula for the number of trees :::::::::::::::::::::: 141 23. Completing Latin squares ::::::::::::::::::::::::::::::::::::147 23. The Dinitz problem ::::::::::::::::::::::::::::::::::::::::: 153 Graph Theory 159 25. Five-coloring plane graphs :::::::::::::::::::::::::::::::::::161 26. How to guard a museum :::::::::::::::::::::::::::::::::::::165 27. Tur´an’s graph theorem :::::::::::::::::::::::::::::::::::::::169 28. Communicating without errors ::::::::::::::::::::::::::::::: 173 29. Of friends and politicians :::::::::::::::::::::::::::::::::::: 183 30. Probability makes counting (sometimes) easy :::::::::::::::::: 187 About the Illustrations 196 Index 197 Six proofs Chapter 1 of the infinity of primes It is only natural that we start these notes with probably the oldest Book Proof, usually attributed to Euclid. It shows that the sequence of primes does not end. fp ;::: ;p g r Euclid’s Proof. For any finite set 1 of primes, consider n = p p p +1 n p p 2 r the number 1 .This has a prime divisor .But is p p n not one of the i : otherwise would be a divisor of and of the product p p p n p p :::p = 1 2 r 1 2 r 1 , and thus also of the difference ,which fp ;::: ;p g r is impossible. So a finite set 1 cannot be the collection of all prime numbers. = f1; 2; 3;:::g Before we continue let us fix some notation. N is the set = f::: ;2; 1; 0; 1; 2;:::g of natural numbers, Z the set of integers, and = f2; 3; 5; 7;:::g P the set of primes. In the following, we will exhibit various other proofs (out of a much longer Lagrange’s Theorem list) which we hope the reader will like as much as we do. Although they If G is a finite (multiplicative) group use different view-points, the following basic idea is common to all of them: jU j and U is a subgroup, then The natural numbers grow beyond all bounds, and every natural number Gj divides j . 2 P n has a prime divisor. These two facts taken together force to be infinite. The next three proofs are folklore, the fifth proof was proposed by Proof. Consider the binary rela- Harry F¨urstenberg, while the last proof is due to Paul Erd˝os. tion 1 a b : ba 2 U: The second and the third proof use special well-known number sequences. It follows from the group axioms P p Second Proof. Suppose is finite and is the largest prime. We that is an equivalence relation. p 1 consider the so-called Mersenne number 2 and show that any prime The equivalence class containing an p a 2 1 p factor q of is bigger than , which will yield the desired conclusion. element is precisely the coset p p 2 1 2 1 q p Let q be a prime dividing ,sowehave mod .Since is Ua = fxa : x 2 U g: p prime, this means that the element 2 has order in the multiplicative group Z nf0g Z q 1 q q of the field . This group has elements. By Lagrange’s Uaj = jU j Since clearly j ,wefind theorem (see the box) we know that the order of every element divides the that G decomposes into equivalence j q 1 p<q size of the group, that is, we have p , and hence . U j classes, all of size j , and hence U j jGj that j divides . n 2 F =2 +1 Third Proof. Next let us look at the Fermat numbers n for In the special case when U is a cyclic =0; 1; 2;::: n . We will show that any two Fermat numbers are relatively 2 m a; a ;::: ;a g prime; hence there must be infinitely many primes. To this end, we verify subgroup f we find the recursion that m (the smallest positive inte- m = 1 ger such that a , called the n1 Y jGj order of a) divides the size of F = F 2 n 1; n k the group. k =0 4 Six proofs of the infinity of primes m = 3 F from which our assertion follows immediately. Indeed, if is a divisor of, 0 F F k < n m m = 1 2 F = 5 1 n say, k and ,then divides 2, and hence or .But F = 17 m =2 2 is impossible since all Fermat numbers are odd. F = 257 3 n n =1 F =3 To prove the recursion we use induction on .For we have 0 F = 65537 4 F 2= 3 and 1 . With induction we now conclude F = 641 6700417 5 n n1 Y The first few Fermat numbers Y F = F F = F 2F = k k n n n k =0 k =0 n n n+1 2 2 2 =2 12 +1 = 2 1 = F 2: n+1 Now let us look at a proof that uses elementary calculus. x:=fp x : p 2 Pg Fourth Proof. Let be the number of primes that are less than or equal to the real number x. We number the primes P = fp ;p ;p ;:::g 2 3 1 in increasing order. Consider the natural logarithm R x 1 x log x = dt log , defined as . 1 t 1 1 t= Nowwecomparetheareabelowthegraphoff with an upper step t function. (See also the appendix on page 10 for this method.) Thus for x<n+1 n we have 1 1 1 1 log x 1+ + + ::: + + 2 3 n 1 n 1 2 n X 1 1 t= Steps above the function f ; m 2 N t where the sum extends over all which have m x only prime divisors p . Since every such m can be written in a unique way as a product of the form Q k p p , we see that the last sum is equal to px Y X 1 : k p p2P k 0 px The inner sum is a geometric series with ratio 1 , hence p x Y Y Y p 1 p k = log x = : 1 p 1 p 1 1 k p p2P p2P k =1 px px p k +1 Now clearly k , and thus p 1 1 k +1 k = 1+ 1+ = ; p 1 p 1 k k k k and therefore x Y k +1 log x = x+1: k k =1 x x Everybody knows that log is not bounded, so we conclude that is unbounded as well, and so there are infinitely many primes.
Load more

Recommended publications
  • Proofs from the BOOK.Pdf
    Martin Aigner Günter M. Ziegler Proofs from THE BOOK Fourth Edition Martin Aigner Günter M. Ziegler Proofs from THE BOOK Fourth Edition Including Illustrations by Karl H. Hofmann 123 Prof. Dr. Martin Aigner Prof.GünterM.Ziegler FB Mathematik und Informatik Institut für Mathematik, MA 6-2 Freie Universität Berlin Technische Universität Berlin Arnimallee 3 Straße des 17. Juni 136 14195 Berlin 10623 Berlin Deutschland Deutschland [email protected] [email protected] ISBN 978-3-642-00855-9 e-ISBN 978-3-642-00856-6 DOI 10.1007/978-3-642-00856-6 Springer Heidelberg Dordrecht London New York c Springer-Verlag Berlin Heidelberg 2010 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: deblik, Berlin Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) Preface Paul Erdosliked˝ to talk aboutThe Book, in which God maintainsthe perfect proofsfor mathematical theorems, following the dictum of G.
    [Show full text]
  • Exploring Topics of the Art Gallery Problem
    The College of Wooster Open Works Senior Independent Study Theses 2019 Exploring Topics of the Art Gallery Problem Megan Vuich The College of Wooster, [email protected] Follow this and additional works at: https://openworks.wooster.edu/independentstudy Recommended Citation Vuich, Megan, "Exploring Topics of the Art Gallery Problem" (2019). Senior Independent Study Theses. Paper 8534. This Senior Independent Study Thesis Exemplar is brought to you by Open Works, a service of The College of Wooster Libraries. It has been accepted for inclusion in Senior Independent Study Theses by an authorized administrator of Open Works. For more information, please contact [email protected]. © Copyright 2019 Megan Vuich Exploring Topics of the Art Gallery Problem Independent Study Thesis Presented in Partial Fulfillment of the Requirements for the Degree Bachelor of Arts in the Department of Mathematics and Computer Science at The College of Wooster by Megan Vuich The College of Wooster 2019 Advised by: Dr. Robert Kelvey Abstract Created in the 1970’s, the Art Gallery Problem seeks to answer the question of how many security guards are necessary to fully survey the floor plan of any building. These floor plans are modeled by polygons, with guards represented by points inside these shapes. Shortly after the creation of the problem, it was theorized that for guards whose positions were limited to the polygon’s j n k vertices, 3 guards are sufficient to watch any type of polygon, where n is the number of the polygon’s vertices. Two proofs accompanied this theorem, drawing from concepts of computational geometry and graph theory.
    [Show full text]
  • Paul Erdős Mathematical Genius, Human (In That Order)
    Paul Erdős Mathematical Genius, Human (In That Order) By Joshua Hill MATH 341-01 4 June 2004 "A Mathematician, like a painter or a poet, is a maker of patterns. If his patterns are more permanent that theirs, it is because the are made with ideas... The mathematician's patterns, like the painter's or the poet's, must be beautiful; the ideas, like the colours of the words, must fit together in a harmonious way. Beauty is the first test: there is no permanent place in the world for ugly mathematics." --G.H. Hardy "Why are numbers beautiful? It's like asking why is Beethoven's Ninth Symphony beautiful. If you don't see why, someone can't tell you. I know numbers are beautiful. If they aren't beautiful, nothing is." -- Paul Erdős "One of the first people I met in Princeton was Paul Erdős. He was 26 years old at the time, and had his Ph.D. for several years, and had been bouncing from one postdoctoral fellowship to another... Though I was slightly younger, I considered myself wiser in the ways of the world, and I lectured Erdős "This fellowship business is all well and good, but it can't go on for much longer -- jobs are hard to get -- you had better get on the ball and start looking for a real honest job." ... Forty years after my sermon, Erdős hasn't found it necessary to look for an "honest" job yet." -- Paul Halmos Introduction Paul Erdős (said "Air-daish") was a brilliant and prolific mathematician, who was central to the advancement of several major branches of mathematics.
    [Show full text]
  • Proofs from the BOOK Third Edition Springer-Verlag Berlin Heidelberg Gmbh Martin Aigner Gunter M
    Martin Aigner Gunter M. Ziegler Proofs from THE BOOK Third Edition Springer-Verlag Berlin Heidelberg GmbH Martin Aigner Gunter M. Ziegler Proofs from THE BOOK Third Edition With 250 Figures Including Illustrations by Karl H. Hofmann Springer Martin Aigner Gunter M. Ziegler Freie Universitat Berlin Technische Universitat Berlin Institut flir Mathematik II (WE2) Institut flir Mathematik, MA 6-2 Arnimallee 3 StraBe des 17. Juni 136 14195 Berlin, Germany 10623 Berlin, Germany email: [email protected] email: [email protected] Cataloging-in-Publication Data applied for A catalog record for this book is available from the Library of Congress Bibliographic information published by Die Deutsche Bibliothek Die Deutsche Bibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data is available in the Internet at http://dnb.ddb.de. Mathematics Subject Classification (2000): 00-01 (General) ISBN 978-3-662-05414-7 ISBN 978-3-662-05412-3 (eBook) DOl 10 .1007/978-3 -662-05412-3 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag. Viola­ tions are liable for prosecution under the German Copyright Law. © Springer-Verlag Berlin Heidelberg 1998,2001,2004 Originally published by Springer-Verlag Berlin Heidelberg New York in 2004.
    [Show full text]
  • The Art Gallery Theorem
    Outline The players The theorem The proof from THE BOOK Variations The Art Gallery Theorem Vic Reiner, Univ. of Minnesota Monthly Math Hour at UW May 18, 2014 Vic Reiner, Univ. of Minnesota The Art Gallery Theorem Outline The players The theorem The proof from THE BOOK Variations 1 The players 2 The theorem 3 The proof from THE BOOK 4 Variations Vic Reiner, Univ. of Minnesota The Art Gallery Theorem Outline The players The theorem The proof from THE BOOK Variations Victor Klee, formerly of UW Vic Reiner, Univ. of Minnesota The Art Gallery Theorem Outline The players The theorem The proof from THE BOOK Variations Klee’s question posed to V. Chvátal Given the floor plan of a weirdly shaped art gallery having N straight sides, how many guards will we need to post, in the worst case, so that every bit of wall is visible to a guard? Can one do it with N=3 guards? Vic Reiner, Univ. of Minnesota The Art Gallery Theorem Outline The players The theorem The proof from THE BOOK Variations Klee’s question posed to V. Chvátal Given the floor plan of a weirdly shaped art gallery having N straight sides, how many guards will we need to post, in the worst case, so that every bit of wall is visible to a guard? Can one do it with N=3 guards? Vic Reiner, Univ. of Minnesota The Art Gallery Theorem Outline The players The theorem The proof from THE BOOK Variations Vasek Chvátal: Yes, I can prove that! Vic Reiner, Univ.
    [Show full text]
  • 3.1 Prime Numbers
    Chapter 3 I Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocks in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime if its only positive integer multiplicative factors are 1 and n. Furthermore, every integer can be expressed as a product of primes, and this expression is unique up to the order of the primes in the product. This important insight into the multiplicative structure of the integers has become known as the fundamental theorem of arithmetic . Beneath the simplicity of the prime numbers lies a sophisticated world of insights and results that has intrigued mathematicians for centuries. By the third century b.c.e. , Greek mathematicians had defined prime numbers, as one might expect from their familiarity with the division algorithm. In Book IX of Elements [73], Euclid gives a proof of the infinitude of primes—one of the most elegant proofs in all of mathematics. Just as important as this understanding of prime numbers are the many unsolved questions about primes. For example, the Riemann hypothesis is one of the most famous open questions in all of mathematics. This claim provides an analytic formula for the number of primes less than or equal to any given natural number. A proof of the Riemann hypothesis also has financial rewards. The Clay Mathematics Institute has chosen six open questions (including the Riemann hypothesis)—a complete solution of any one would earn a $1 million prize. Working toward defining a prime number, we recall an important theorem and definition from section 2.2.
    [Show full text]
  • Formalization of Some Central Theorems in Combinatorics of Finite
    Kalpa Publications in Computing Volume 1, 2017, Pages 43–57 LPAR-21S: IWIL Workshop and LPAR Short Presentations Formalization of some central theorems in combinatorics of finite sets Abhishek Kr Singh School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai [email protected] Abstract We present fully formalized proofs of some central theorems from combinatorics. These are Dilworth’s decomposition theorem, Mirsky’s theorem, Hall’s marriage theorem and the Erdős-Szekeres theorem. Dilworth’s decomposition theorem is the key result among these. It states that in any finite partially ordered set (poset), the size of a smallest chain cover and a largest antichain are the same. Mirsky’s theorem is a dual of Dilworth’s decomposition theorem, which states that in any finite poset, the size of a smallest antichain cover and a largest chain are the same. We use Dilworth’s theorem in the proofs of Hall’s Marriage theorem and the Erdős-Szekeres theorem. The combinatorial objects involved in these theorems are sets and sequences. All the proofs are formalized in the Coq proof assistant. We develop a library of definitions and facts that can be used as a framework for formalizing other theorems on finite posets. 1 Introduction Formalization of any mathematical theory is a difficult task because the length of a formal proof blows up significantly. In combinatorics the task becomes even more difficult due to the lack of structure in the theory. Some statements often admit more than one proof using completely different ideas. Thus, exploring dependencies among important results may help in identifying an effective order amongst them.
    [Show full text]
  • 1 Books 2 Papers
    1 Books • J. Matoušek, Lectures on Discrete Geometry • N. Alon and J. Spencer, The Probabilistic Method, 3rd edition • M. Aigner and G. Ziegler, Proofs from the BOOK • B. Bollobás, The art of mathematics (Coffee time in Memphis) • J. Matousek, Thirty-three miniatures: mathematical and algorithmic ap- plications of linear algebra • S. Jukna, Extremal combinatorics 2 Papers • P. Erdős and S. Fajtlowicz, On a conjecture of Hajós, Combinatorica 1 (1981), 141-143. and C. Thomassen, Some remarks on Hajós conjecture, J. Combin. Theory Ser. B 93 (2005), 95-105. • F. Chung, R. Graham, and R. Wilson, Quasi-random graphs, Combina- torica 9 (1989), 345-362. • J. Shearer, A note on the independence number of triange-free graphs, Discrete Math 46 (1983), 83-87. • A. Schrijver, A short proof of Minc’s conjecture, J. Combinatorial Theory Ser. A 25 (1978), 80-83. (see also Alon and Spencer book, page 22) • P. Erdős, J. Pach, J. Pyber, Isomorphic subgraphs in a graph, in: Com- binatorics (Eger, 1987), Colloq. Math. Soc. János Bolyai, 52, North- Holland, Amsterdam, 1988, 553–556. • M. Goemans and D. Williamson, Improved algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995), 1115-1145. • P. Erdős and S. Shelah, On a problem of Moser and Hanson, Graph the- ory and applications, Lecture Notes in Math., Vol. 303, Springer, Berlin (1972), 75-79. • S. Brandt, On the structure of graphs with bounded clique number, Com- binatorica 23 (2003), 693-696. 1 • Hamiltonicity and pancyclicity, G. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc., 2 (1952), 69-81.
    [Show full text]
  • Monskyn Lause Neliölle
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Helsingin yliopiston digitaalinen arkisto Monskyn lause neliölle Linda Lumio 17. marraskuuta 2016 HELSINGIN YLIOPISTO — HELSINGFORS UNIVERSITET — UNIVERSITY OF HELSINKI Tiedekunta/Osasto — Fakultet/Sektion — Faculty Laitos — Institution — Department Matemaattis-luonnontieteellinen Matematiikan ja tilastotieteen laitos Tekijä — Författare — Author Linda Lumio Työn nimi — Arbetets titel — Title Monskyn lause nelille Oppiaine — Läroämne — Subject Matematiikka Työn laji — Arbetets art — Level Aika — Datum — Month and year Sivumäärä — Sidoantal — Number of pages Pro gradu -tutkielma Marraskuu 2016 36 s. Tiivistelmä — Referat — Abstract Tässä työssä tutkitaan neliön tasaosittamiseen liittyvää Monskyn lausetta sekä esitellään sen todistamisessa tarvittava matemaattinen koneisto. Monskyn lause on matemaattinen lause, joka yhdistää kaksi toisistaan näennäisesti erillistä matematiikan osa-aluetta. Lauseen mukaan neliötä ei voida osittaa parittomaan määrään kolmioita, joilla on keskenään sama pinta-ala. Päämää- ränä on esitellä Monskyn lauseen todistamiseen tarvittava koneisto sekä itse lause ja tämän todistus. Monskyn lauseen merkittävyys piilee siinä, että sen todistus rakentuu kahdesta (tai kolmesta) osasta, jotka yhdistävät kaksi näennäisesti erillistä matematiikan osa-aluetta, topologian ja al- gebran. Todistuksen topologinen osuus tiivistyy niin kutsuttuun Spernerin lemmaan, josta on työssä esitetty useampi versio. Todistuksen algebrallinen osuus puolestaan sisältää valuaatiot
    [Show full text]
  • Proofs from the BOOK
    Martin Aigner · Günter M. Ziegler Proofs from THE BOOK Fifth Edition Martin Aigner Günter M. Ziegler Proofs from THE BOOK Fifth Edition Martin Aigner Günter M. Ziegler Proofs from THE BOOK Fifth Edition Including Illustrations by Karl H. Hofmann 123 Martin Aigner Günter M. Ziegler Freie Universität Berlin Freie Universität Berlin Berlin, Germany Berlin, Germany ISBN978-3-662-44204-3 ISBN978-3-662-44205-0(eBook) DOI 10.1007/978-3-662-44205-0 © Springer-Verlag Berlin Heidelberg 2014 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Coverdesign: deblik, Berlin Printed on acid-free paper Springer is Part of Springer Science+Business Media www.springer.com Preface Paul Erdos˝ liked to talk about The Book, in which God maintains the perfect proofs for mathematical theorems, following the dictum of G. H. Hardy that there is no permanent place for ugly mathematics.
    [Show full text]
  • Formalization of Some Central Theorems in Combinatorics of Finite Sets
    Formalization of some central theorems in combinatorics of finite sets Abhishek Kr Singh Tata Institute of Fundamental Research, Mumbai Abstract We present fully formalized proofs of some central theorems from combinatorics. These are Dilworth’s decomposition theorem, Mirsky’s theorem, Hall’s marriage theorem and the Erdős-Szekeres theorem. Dilworth’s decomposition theorem is the key result among these. It states that in any finite partially ordered set (poset), the size of a smallest chain cover and a largest antichain are the same. Mirsky’s theorem is a dual of Dilworth’s decomposition theorem, which states that in any finite poset, the size of a smallest antichain cover and a largest chain are the same. We use Dilworth’s theorem in the proofs of Hall’s Marriage theorem and the Erdős-Szekeres theorem. The combinatorial objects involved in these theorems are sets and sequences. All the proofs are formalized in the Coq proof assistant. We develop a library of definitions and facts that can be used as a framework for formalizing other theorems on finite posets. 1 Introduction Formalization of any mathematical theory is a difficult task because the length of a formal proof blows up significantly. In combinatorics the task becomes even more difficult due to the lack of structure in the theory. Some state- ments often admit more than one proof using completely different ideas. Thus, exploring dependencies among important results may help in identifying an ef- fective order amongst them. Dilworth’s decomposition theorem, first proved by arXiv:1703.10977v1 [cs.LO] 31 Mar 2017 R. P.
    [Show full text]
  • 2018 Leroy P. Steele Prizes
    AMS Prize Announcements FROM THE AMS SECRETARY 2018 Leroy P. Steele Prizes Sergey Fomin Andrei Zelevinsky Martin Aigner Günter Ziegler Jean Bourgain The 2018 Leroy P. Steele Prizes were presented at the 124th Annual Meeting of the AMS in San Diego, California, in January 2018. The Steele Prizes were awarded to Sergey Fomin and Andrei Zelevinsky for Seminal Contribution to Research, to Martin Aigner and Günter Ziegler for Mathematical Exposition, and to Jean Bourgain for Lifetime Achievement. Citation for Seminal Contribution to Research: Biographical Sketch: Sergey Fomin Sergey Fomin and Andrei Zelevinsky Sergey Fomin is the Robert M. Thrall Collegiate Professor The 2018 Steele Prize for Seminal Contribution to Research of Mathematics at the University of Michigan. Born in 1958 in Discrete Mathematics/Logic is awarded to Sergey Fomin in Leningrad (now St. Petersburg), he received an MS (1979) and Andrei Zelevinsky (posthumously) for their paper and a PhD (1982) from Leningrad State University, where “Cluster Algebras I: Foundations,” published in 2002 in his advisor was Anatoly Vershik. He then held positions at St. Petersburg Electrotechnical University and the Institute the Journal of the American Mathematical Society. for Informatics and Automation of the Russian Academy The paper “Cluster Algebras I: Foundations” is a of Sciences. Starting in 1992, he worked in the United modern exemplar of how combinatorial imagination States, first at Massachusetts Institute of Technology and can influence mathematics at large. Cluster algebras are then, since 1999, at the University of Michigan. commutative rings, generated by a collection of elements Fomin’s main research interests lie in algebraic com- called cluster variables, grouped together into overlapping binatorics, including its interactions with various areas clusters.
    [Show full text]