DOCSLIB.ORG

View This Volume's Front and Back Matter

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
View This Volume's Front and Back Matter 100 YEARS OF MATH MILESTONES The Pi Mu Epsilon Centennial Collection Stephan Ramon Garcia Steven J. Miller 100 YEARS OF MATH MILESTONES The Pi Mu Epsilon Centennial Collection 10.1090/mbk/121 100 YEARS OF MATH MILESTONES The Pi Mu Epsilon Centennial Collection Stephan Ramon Garcia Steven J. Miller 2010 Mathematics Subject Classification. Primary 00A08, 00A30, 00A35, 05-01, 11-01, 30-01, 54-01, 60-01. For additional information and updates on this book, visit www.ams.org/bookpages/mbk-121 Library of Congress Cataloging-in-Publication Data Names: Garcia, Stephan Ramon, author. | Miller, Steven J., 1974- author. Title: 100 years of math milestones : the Pi Mu Epsilon centennial collection / Stephan Ramon Garcia, Steven J. Miller. Other titles: One hundred years of math milestones | Pi Mu Epsilon centennial collection Description: Providence, Rhode Island : American Mathematical Society, [2019] | Includes bibli- ographical references and indexes. Identifiers: LCCN 2019000982 | ISBN 9781470436520 (alk. paper) Subjects: LCSH: Mathematics–United States–History. | Pi Mu Epsilon. | AMS: General – General and miscellaneous specific topics – Philosophy of mathematics. msc | General – General and miscellaneous specific topics – Methodology of mathematics, didactics. msc | Combinatorics – Instructional exposition (textbooks, tutorial papers, etc.). msc | Number theory – Instruc- tional exposition (textbooks, tutorial papers, etc.). msc | Functions of a complex variable – Instructional exposition (textbooks, tutorial papers, etc.). msc | General topology – Instruc- tional exposition (textbooks, tutorial papers, etc.). msc | Probability theory and stochastic processes – Instructional exposition (textbooks, tutorial papers, etc.). msc Classification: LCC QA27.U5 G37 2019 | DDC 510.9–dc23 LC record available at https://lccn.loc.gov/2019000982 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy select pages for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for permission to reuse portions of AMS publication content are handled by the Copyright Clearance Center. For more information, please visit www.ams.org/publications/pubpermissions. Send requests for translation rights and licensed reprints to [email protected]. c 2019 by the authors. All rights reserved. Printed in the United States of America. ∞ The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability. Visit the AMS home page at https://www.ams.org/ 10987654321 242322212019 Stephan Ramon Garcia dedicates this book to his wife, Gizem Karaali, and their children, Reyhan and Altay. Thanks also go to his parents for their constant support and affection. Steven Miller dedicates this book with thanks to his many colleagues and stu- dents who assisted in writing this book, to his in-laws Jeffrey and Judy Gelfand for providing a hospitable environment where many of these entries were written and edited, and to his friends at Pi Mu Epsilon (especially Harold Reiter, a previous editor of the Problem Section) for their support of this project. Contents Preface xi Notation xiii 1913. Paul Erd˝os 1 1914. Martin Gardner 7 1915. General Relativity and the Absolute Differential Calculus 11 1916. Ostrowski’s Theorem 17 1917. Morse Theory, but Really Cantor 21 1918. Georg Cantor 27 1919. Brun’s Theorem 33 1920. Waring’s Problem 39 1921. Mordell’s Theorem 45 1922. Lindeberg Condition 51 1923. The Circle Method 57 1924. The Banach–Tarski Paradox 61 1925. The Schr¨odinger Equation 67 1926. Ackermann’s Function 71 1927. William Lowell Putnam Mathematical Competition 75 1928. Random Matrix Theory 79 1929. G¨odel’s Incompleteness Theorems 85 1930. Ramsey Theory 89 1931. The Ergodic Theorem 95 1932. The 3x + 1 Problem 101 1933. Skewes’s Number 107 1934. Khinchin’s Constant 113 vii viii CONTENTS 1935. Hilbert’s Seventh Problem 117 1936. Alan Turing 121 1937. Vinogradov’s Theorem 127 1938. Benford’s Law 131 1939. The Power of Positive Thinking 137 1940. A Mathematician’s Apology 141 1941. The Foundation Trilogy 145 1942. Zeros of ζ(s) 151 1943. Breaking Enigma 157 1944. Theory of Games and Economic Behavior 163 1945. The Riemann Hypothesis in Function Fields 169 1946. Monte Carlo Method 175 1947. The Simplex Method 181 1948. Elementary Proof of the Prime Number Theorem 187 1949. Beurling’s Theorem 193 1950. Arrow’s Impossibility Theorem 199 √ 1951. Tennenbaum’s Proof of the Irrationality of 2 205 1952. NSA Founded 209 1953. The Metropolis Algorithm 215 1954. Kolmogorov–Arnold–Moser Theorem 221 1955. Roth’s Theorem 227 1956. The GAGA Principle 233 1957. The Ross Program 235 1958. Smale’s Paradox 241 1959. QR Decomposition 247 1960. The Unreasonable Effectiveness of Mathematics 251 1961. Lorenz’s Nonperiodic Flow 257 1962. The Gale–Shapley Algorithm and the Stable Marriage Problem 263 1963. Continuum Hypothesis 269 CONTENTS ix 1964. Principles of Mathematical Analysis 275 1965. Fast Fourier Transform 281 1966. Class Number One Problem 287 1967. The Langlands Program 293 1968. Atiyah–Singer Index Theorem 299 1969. Erd˝os Numbers 305 1970. Hilbert’s Tenth Problem 311 1971. Society for American Baseball Research 317 1972. Zaremba’s Conjecture 323 1973. Transcendence of e Centennial 329 1974. Rubik’s Cube 333 1975. Szemer´edi’s Theorem 339 1976. Four Color Theorem 345 1977. RSA Encryption 351 1978. Mandelbrot Set 357 1979. TEX 363 1980. Hilbert’s Third Problem 369 1981. The Mason–Stothers Theorem 375 1982. Two Envelopes Problem 381 1983. Julia Robinson 385 1984. 1984 391 1985. The Jones Polynomial 395 1986. Sudokus and Look and Say 401 1987. Primes, the Zeta Function, Randomness, and Physics 407 1988. Mathematica 413 1989. PROMYS 421 1990. The Monty Hall Problem 427 1991. arXiv 433 1992. Monstrous Moonshine 439 xCONTENTS 1993. The 15-Theorem 445 1994. AIM 451 1995. Fermat’s Last Theorem 457 1996. Great Internet Mersenne Prime Search (GIMPS) 463 1997. The Nobel Prize of Merton and Scholes 469 1998. The Kepler Conjecture 475 1999. Baire Category Theorem 481 2000. R 487 2001. Colin Hughes Founds Project Euler 493 2002. PRIMES in P 499 2003. Poincar´e Conjecture 505 2004. Primes in Arithmetic Progression 511 2005. William Stein Developed Sage 519 2006. The Strong Perfect Graph Theorem 525 2007. Flatland 531 2008. 100th Anniversary of the t-Test 537 2009. 100th Anniversary of Brouwer’s Fixed-Point Theorem 543 2010. Carmichael Numbers 549 2011. 100th Anniversary of Egorov’s Theorem 555 2012. National Museum of Mathematics 561 Index of People 565 Index 571 Preface In 2013, the second named author had the honor of succeeding Ashley Ahlin and Harold Reiter as the editor of the Problem Department of the ΠME Journal. This event essentially coincided with the 100th anniversary of Pi Mu Epsilon, so Miller thought it would be fun and appropriate to recognize this milestone in some way. Many others agreed. For example, Mike Pinter, from Belmont University in Nashville, Tennessee, proposed the base-16 celebratory equation PMEMATH +SOCIETY HUNDRED (which was used in the Spring 2014 issue). Many readers submitted correct solu- tions, the first being Jessica Lehr of Elizabethtown College. We leave the task of determining all possible solutions as a fun exercise for you. Being still somewhat young, energetic, and new to the job, while also gravely worried about finding enough good problems for issue after issue (not yet aware of the excellent submissions that would consistently arrive), Miller decided to celebrate with one hundred problems related to important mathematical milestones of the past century. Since one hundred is a large number of problems relative to the normal operation of the Problem Department (there are typically five or six problems per issue), he asked many colleagues for contributions. This resulted in four centennial articles, which appeared in The Pi Mu Epsilon Journal in 2013–2014 (13 (2013), no. 9, 513–534; 13 (2014), no. 10, 577–608; 14 (2014), no. 1, 65–99; and 14 (2014), no. 2, 100–134). The four articles were well received and there was strong interest in converting them into a book. The first named author came on board early in the process as a collaborator. Every entry was either expanded jointly by us from the four centennial articles or simply written anew. The second option was an essential step in converting the collection from a series of disjointed problems into a unified whole. We have used the original descriptions as springboards to introduce a variety of mathematical ideas, techniques, and applications. Whenever possible, we have quoted primary sources. Concepts are often introduced early on and then threaded through and expanded upon in later entries. The final result is a tour through much of mathematics, with an emphasis on beauty, big ideas, and interesting problems. There are several influential collections of problems that have motivated and guided mathematics. Hilbert’s problems and the Clay Millennium Problems are notable examples. We have a different emphasis here. Pi Mu Epsilon is an un- dergraduate mathematics honor society and thus, in addition to being important, the problems must be accessible to students. Although some of them do require analysis or algebra, number theory or probability, as a whole we hope they will be xi xii PREFACE appealing to energetic and enthusiastic math majors of all stripes. We wanted to create a collection that would motivate people who are still trying to decide what to do with their lives, as well as those who already have. No list can be complete and there are far too many items to celebrate. This book necessarily misses many old favorites. It is largely a reflection of the personal tastes and inclinations of the two authors.
Load more

Recommended publications
  • Game Theory Lecture Notes
    Game Theory: Penn State Math 486 Lecture Notes Version 2.1.1 Christopher Griffin « 2010-2021 Licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 United States License With Major Contributions By: James Fan George Kesidis and Other Contributions By: Arlan Stutler Sarthak Shah Contents List of Figuresv Preface xi 1. Using These Notes xi 2. An Overview of Game Theory xi Chapter 1. Probability Theory and Games Against the House1 1. Probability1 2. Random Variables and Expected Values6 3. Conditional Probability8 4. The Monty Hall Problem 11 Chapter 2. Game Trees and Extensive Form 15 1. Graphs and Trees 15 2. Game Trees with Complete Information and No Chance 18 3. Game Trees with Incomplete Information 22 4. Games of Chance 24 5. Pay-off Functions and Equilibria 26 Chapter 3. Normal and Strategic Form Games and Matrices 37 1. Normal and Strategic Form 37 2. Strategic Form Games 38 3. Review of Basic Matrix Properties 40 4. Special Matrices and Vectors 42 5. Strategy Vectors and Matrix Games 43 Chapter 4. Saddle Points, Mixed Strategies and the Minimax Theorem 45 1. Saddle Points 45 2. Zero-Sum Games without Saddle Points 48 3. Mixed Strategies 50 4. Mixed Strategies in Matrix Games 53 5. Dominated Strategies and Nash Equilibria 54 6. The Minimax Theorem 59 7. Finding Nash Equilibria in Simple Games 64 8. A Note on Nash Equilibria in General 66 Chapter 5. An Introduction to Optimization and the Karush-Kuhn-Tucker Conditions 69 1. A General Maximization Formulation 70 2. Some Geometry for Optimization 72 3.
    [Show full text]
  • Frequently Asked Questions in Mathematics
    Frequently Asked Questions in Mathematics The Sci.Math FAQ Team. Editor: Alex L´opez-Ortiz e-mail: [email protected] Contents 1 Introduction 4 1.1 Why a list of Frequently Asked Questions? . 4 1.2 Frequently Asked Questions in Mathematics? . 4 2 Fundamentals 5 2.1 Algebraic structures . 5 2.1.1 Monoids and Groups . 6 2.1.2 Rings . 7 2.1.3 Fields . 7 2.1.4 Ordering . 8 2.2 What are numbers? . 9 2.2.1 Introduction . 9 2.2.2 Construction of the Number System . 9 2.2.3 Construction of N ............................... 10 2.2.4 Construction of Z ................................ 10 2.2.5 Construction of Q ............................... 11 2.2.6 Construction of R ............................... 11 2.2.7 Construction of C ............................... 12 2.2.8 Rounding things up . 12 2.2.9 What’s next? . 12 3 Number Theory 14 3.1 Fermat’s Last Theorem . 14 3.1.1 History of Fermat’s Last Theorem . 14 3.1.2 What is the current status of FLT? . 14 3.1.3 Related Conjectures . 15 3.1.4 Did Fermat prove this theorem? . 16 3.2 Prime Numbers . 17 3.2.1 Largest known Mersenne prime . 17 3.2.2 Largest known prime . 17 3.2.3 Largest known twin primes . 18 3.2.4 Largest Fermat number with known factorization . 18 3.2.5 Algorithms to factor integer numbers . 18 3.2.6 Primality Testing . 19 3.2.7 List of record numbers . 20 3.2.8 What is the current status on Mersenne primes? .
    [Show full text]
  • QUARTIC CM FIELDS 1. Background the Study of Complex Multiplication
    QUARTIC CM FIELDS WENHAN WANG Abstract. In the article, we describe the basic properties, general and specific properties of CM degree 4 fields, as well as illustrating their connection to the study of genus 2 curves with CM. 1. Background The study of complex multiplication is closely related to the study of curves over finite fields and their Jacobian. Basically speaking, for the case of non-supersingular elliptic curves over finite fields, the endomorphism ring is ring-isomorphic to an order in an imaginary quadratic extension K of Q. The structure of imaginary extensions of Q has beenp thoroughly studied, and the ringsq of integers are simply generated by f1; Dg if D ≡ 1 mod 4, f D g ≡ or by 1; 4 if D 0 mod 4, where D is the discriminant of the field K. The theory of complex multiplication can be carried from elliptic curves to the (Jacobians) of genus 2 (hyperelliptic) curves. More explicitly, the Jacobian of any non-supersingular genus 2 (and hence, hyperelliptic) curve defined over a finite field has CM by an order in a degree 4, or quartic extension over Q, where the extension field K has to be totally imaginary. Description of the endomorphism ring of the Jacobian of a genus 2 curve over a finite field largely depends on the field K for which the curve has CM by. Many articles in the area of the study of genus two curves lead to the study of many properties of the field K. Hence the main goal of this article is, based on the knowledge of the author in the study of the genus 2 curves over finite fields, to give a survey of various, general or specific, properties of degree 4 CM fields.
    [Show full text]
  • Properties of N-Sided Regular Polygons
    PROPERTIES OF N-SIDED REGULAR POLYGONS When students are first exposed to regular polygons in middle school, they learn their properties by looking at individual examples such as the equilateral triangles(n=3), squares(n=4), and hexagons(n=6). A generalization is usually not given, although it would be straight forward to do so with just a min imum of trigonometry and algebra. It also would help students by showing how one obtains generalization in mathematics. We show here how to carry out such a generalization for regular polynomials of side length s. Our starting point is the following schematic of an n sided polygon- We see from the figure that any regular n sided polygon can be constructed by looking at n isosceles triangles whose base angles are θ=(1-2/n)(π/2) since the vertex angle of the triangle is just ψ=2π/n, when expressed in radians. The area of the grey triangle in the above figure is- 2 2 ATr=sh/2=(s/2) tan(θ)=(s/2) tan[(1-2/n)(π/2)] so that the total area of any n sided regular convex polygon will be nATr, , with s again being the side-length. With this generalized form we can construct the following table for some of the better known regular polygons- Name Number of Base Angle, Non-Dimensional 2 sides, n θ=(π/2)(1-2/n) Area, 4nATr/s =tan(θ) Triangle 3 π/6=30º 1/sqrt(3) Square 4 π/4=45º 1 Pentagon 5 3π/10=54º sqrt(15+20φ) Hexagon 6 π/3=60º sqrt(3) Octagon 8 3π/8=67.5º 1+sqrt(2) Decagon 10 2π/5=72º 10sqrt(3+4φ) Dodecagon 12 5π/12=75º 144[2+sqrt(3)] Icosagon 20 9π/20=81º 20[2φ+sqrt(3+4φ)] Here φ=[1+sqrt(5)]/2=1.618033989… is the well known Golden Ratio.
    [Show full text]
  • The Monty Hall Problem in the Game Theory Class
    The Monty Hall Problem in the Game Theory Class Sasha Gnedin∗ October 29, 2018 1 Introduction Suppose you’re on a game show, and you’re given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what’s behind the doors, opens another door, say No. 3, which has a goat. He then says to you, “Do you want to pick door No. 2?” Is it to your advantage to switch your choice? With these famous words the Parade Magazine columnist vos Savant opened an exciting chapter in mathematical didactics. The puzzle, which has be- come known as the Monty Hall Problem (MHP), has broken the records of popularity among the probability paradoxes. The book by Rosenhouse [9] and the Wikipedia entry on the MHP present the history and variations of the problem. arXiv:1107.0326v1 [math.HO] 1 Jul 2011 In the basic version of the MHP the rules of the game specify that the host must always reveal one of the unchosen doors to show that there is no prize there. Two remaining unrevealed doors may hide the prize, creating the illusion of symmetry and suggesting that the action does not matter. How- ever, the symmetry is fallacious, and switching is a better action, doubling the probability of winning. There are two main explanations of the paradox. One of them, simplistic, amounts to just counting the mutually exclusive cases: either you win with ∗[email protected] 1 switching or with holding the first choice.
    [Show full text]
  • The Kronecker-Weber Theorem
    The Kronecker-Weber Theorem Lucas Culler Introduction The Kronecker-Weber theorem is one of the earliest known results in class field theory. It says: Theorem. (Kronecker-Weber-Hilbert) Every abelian extension of the rational numbers Q is con- tained in a cyclotomic extension. Recall that an abelian extension is a finite field extension K/Q such that the galois group Gal(K/Q) th is abelian, and a cyclotomic extension is an extension of the form Q(ζ), where ζ is an n root of unity. This paper consists of two proofs of the Kronecker-Weber theorem. The first is rather involved, but elementary, and uses the theory of higher ramification groups. The second is a simple application of the main results of class field theory, which classifies abelian extension of an arbitrary number field. An Elementary Proof Now we will present an elementary proof of the Kronecker-Weber theoerem, in the spirit of Hilbert’s original proof. The particular strategy used here is given as a series of exercises in Marcus [1]. Minkowski’s Theorem We first prove a classical result due to Minkowski. Theorem. (Minkowski) Any finite extension of Q has nonzero discriminant. In particular, such an extension is ramified at some prime p ∈ Z. Proof. Let K/Q be a finite extension of degree n, and let A = OK be its ring of integers. Consider the embedding: r s A −→ R ⊕ C x 7→ (σ1(x), ..., σr(x), τ1(x), ..., τs(x)) where the σi are the real embeddings of K and the τi are the complex embeddings, with one embedding chosen from each conjugate pair, so that n = r + 2s.
    [Show full text]
  • Lecture 9: Newton Method 9.1 Motivation 9.2 History
    10-725: Convex Optimization Fall 2013 Lecture 9: Newton Method Lecturer: Barnabas Poczos/Ryan Tibshirani Scribes: Wen-Sheng Chu, Shu-Hao Yu Note: LaTeX template courtesy of UC Berkeley EECS dept. 9.1 Motivation Newton method is originally developed for finding a root of a function. It is also known as Newton- Raphson method. The problem can be formulated as, given a function f : R ! R, finding the point x? such that f(x?) = 0. Figure 9.1 illustrates another motivation of Newton method. Given a function f, we want to approximate it at point x with a quadratic function fb(x). We move our the next step determined by the optimum of fb. Figure 9.1: Motivation for quadratic approximation of a function. 9.2 History Babylonian people first applied the Newton method to find the square root of a positive number S 2 R+. The problem can be posed as solving the equation f(x) = x2 − S = 0. They realized the solution can be achieved by applying the iterative update rule: 2 1 S f(xk) xk − S xn+1 = (xk + ) = xk − 0 = xk − : (9.1) 2 xk f (xk) 2xk This update rule converges to the square root of S, which turns out to be a special case of Newton method. This could be the first application of Newton method. The starting point affects the convergence of the Babylonian's method for finding the square root. Figure 9.2 shows an example of solving the square root for S = 100. x- and y-axes represent the number of iterations and the variable, respectively.
    [Show full text]
  • Formulas Involving Polygons - Lesson 7-3
    you are here > Class Notes – Chapter 7 – Lesson 7-3 Formulas Involving Polygons - Lesson 7-3 Here’s today’s warmup…don’t forget to “phone home!” B Given: BD bisects ∠PBQ PD ⊥ PB QD ⊥ QB M Prove: BD is ⊥ bis. of PQ P Q D Statements Reasons Honors Geometry Notes Today, we started by learning how polygons are classified by their number of sides...you should already know a lot of these - just make sure to memorize the ones you don't know!! Sides Name 3 Triangle 4 Quadrilateral 5 Pentagon 6 Hexagon 7 Heptagon 8 Octagon 9 Nonagon 10 Decagon 11 Undecagon 12 Dodecagon 13 Tridecagon 14 Tetradecagon 15 Pentadecagon 16 Hexadecagon 17 Heptadecagon 18 Octadecagon 19 Enneadecagon 20 Icosagon n n-gon Baroody Page 2 of 6 Honors Geometry Notes Next, let’s look at the diagonals of polygons with different numbers of sides. By drawing as many diagonals as we could from one diagonal, you should be able to see a pattern...we can make n-2 triangles in a n-sided polygon. Given this information and the fact that the sum of the interior angles of a polygon is 180°, we can come up with a theorem that helps us to figure out the sum of the measures of the interior angles of any n-sided polygon! Baroody Page 3 of 6 Honors Geometry Notes Next, let’s look at exterior angles in a polygon. First, consider the exterior angles of a pentagon as shown below: Note that the sum of the exterior angles is 360°.
    [Show full text]
  • DRAFT Uncountable Problems 1. Introduction
    November 8, 9, 2017; June 10, 21, November 8, 2018; January 19, 2019. DRAFT Chapter from a book, The Material Theory of Induction, now in preparation. Uncountable Problems John D. Norton1 Department of History and Philosophy of Science University of Pittsburgh http://www.pitt.edu/~jdnorton 1. Introduction The previous chapter examined the inductive logic applicable to an infinite lottery machine. Such a machine generates a countably infinite set of outcomes, that is, there are as many outcomes as natural numbers, 1, 2, 3, … We found there that, if the lottery machine is to operate without favoring any particular outcome, the inductive logic native to the system is not probabilistic. A countably infinite set is the smallest in the hierarchy of infinities. The next routinely considered is a continuum-sized set, such as given by the set of all real numbers or even just by the set of all real numbers in some interval, from, say, 0 to 1. It is easy to fall into thinking that the problems of inductive inference with countably infinite sets do not arise for outcome sets of continuum size. For a familiar structure in probability theory is the uniform distribution of probabilities over some interval of real numbers. One might think that this probability distribution provides a logic that treats each outcome in a continuum-sized set equally, thereby doing what no probability distribution could do for a countably infinite set. That would be a mistake. A continuum-sized set is literally infinitely more complicated than a countably infinite set. If we simply ask that each outcome in a continuum- sized set be treated equally in the inductive logic, then just about every problem that arose with the countably infinite case reappears; and then more.
    [Show full text]
  • Construction of Regular Polygons a Constructible Regular Polygon Is One That Can Be Constructed with Compass and (Unmarked) Straightedge
    DynamicsOfPolygons.org Construction of regular polygons A constructible regular polygon is one that can be constructed with compass and (unmarked) straightedge. For example the construction on the right below consists of two circles of equal radii. The center of the second circle at B is chosen to lie anywhere on the first circle, so the triangle ABC is equilateral – and hence equiangular. Compass and straightedge constructions date back to Euclid of Alexandria who was born in about 300 B.C. The Greeks developed methods for constructing the regular triangle, square and pentagon, but these were the only „prime‟ regular polygons that they could construct. They also knew how to double the sides of a given polygon or combine two polygons together – as long as the sides were relatively prime, so a regular pentagon could be drawn together with a regular triangle to get a regular 15-gon. Therefore the polygons they could construct were of the form N = 2m3k5j where m is a nonnegative integer and j and k are either 0 or 1. The constructible regular polygons were 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 32, 40, 48, ... but the only odd polygons in this list are 3,5 and 15. The triangle, pentagon and 15-gon are the only regular polygons with odd sides which the Greeks could construct. If n = p1p2 …pk where the pi are odd primes then n is constructible iff each pi is constructible, so a regular 21-gon can be constructed iff both the triangle and regular 7-gon can be constructed.
    [Show full text]
  • Functional Analysis
    Functional Analysis Marco Di Francesco, Stefano Spirito 2 Contents I Introduction 5 1 Motivation 7 1.1 Someprerequisitesofsettheory. ............... 10 II Lebesgue integration 13 2 Introduction 15 2.1 Recalling Riemann integration . ............ 15 2.2 A new way to count rectangles: Lebesgue integration . .............. 17 3 An overview of Lebesgue measure theory 19 4 Lebesgue integration theory 23 4.1 Measurablefunctions................................. ............ 23 4.2 Simplefunctions ................................... ............ 24 4.3 Definition of the Lebesgue integral . ............ 25 5 Convergence properties of Lebesgue integral 31 5.1 Interchanging limits and integrals . ............... 31 5.2 Fubini’sTheorem................................... ............ 34 5.3 Egorov’s and Lusin’s Theorem. Convergence in measure . .............. 36 6 Exercises 39 III The basic principles of functional analysis 43 7 Metric spaces and normed spaces 45 7.1 Compactnessinmetricspaces. ............. 45 7.2 Introduction to Lp spaces .......................................... 48 7.3 Examples: some classical spaces of sequences . ............... 52 8 Linear operators 57 9 Hahn-Banach Theorems 59 9.1 The analytic form of the Hahn-Banach theorem . .......... 59 9.2 The geometric forms of the Hahn-Banach Theorem . .......... 61 10 The uniform boundedness principle and the closed graph theorem 65 10.1 The Baire category theorem . .......... 65 10.2 Theuniformboundednessprinciple . ................ 66 10.3 The open mapping theorem and the closed graph theorem . ............ 67 3 4 CONTENTS 11 Weak topologies 69 11.1 The inverse limit topology of a family of maps . ........... 69 11.2 The weak topology σ(E, E ∗) ........................................ 69 11.3 The weak ∗ topology σ(E∗, E )........................................ 73 11.4 Reflexive spaces and separable spaces . .............. 75 11.5 Uniformly Convex Space . .......... 78 12 Exercises 79 IV Lp spaces and Hilbert spaces 87 13 Lp spaces 89 p p 13.1 Density properties and separability of L spaces.
    [Show full text]
  • Old Notes from Warwick, Part 1
    Measure Theory, MA 359 Handout 1 Valeriy Slastikov Autumn, 2005 1 Measure theory 1.1 General construction of Lebesgue measure In this section we will do the general construction of σ-additive complete measure by extending initial σ-additive measure on a semi-ring to a measure on σ-algebra generated by this semi-ring and then completing this measure by adding to the σ-algebra all the null sets. This section provides you with the essentials of the construction and make some parallels with the construction on the plane. Throughout these section we will deal with some collection of sets whose elements are subsets of some fixed abstract set X. It is not necessary to assume any topology on X but for simplicity you may imagine X = Rn. We start with some important definitions: Definition 1.1 A nonempty collection of sets S is a semi-ring if 1. Empty set ? 2 S; 2. If A 2 S; B 2 S then A \ B 2 S; n 3. If A 2 S; A ⊃ A1 2 S then A = [k=1Ak, where Ak 2 S for all 1 ≤ k ≤ n and Ak are disjoint sets. If the set X 2 S then S is called semi-algebra, the set X is called a unit of the collection of sets S. Example 1.1 The collection S of intervals [a; b) for all a; b 2 R form a semi-ring since 1. empty set ? = [a; a) 2 S; 2. if A 2 S and B 2 S then A = [a; b) and B = [c; d).
    [Show full text]