i “main” — 2011/10/12 — 12:06 — page i — #1 i i i
Beautiful Mathematics
i i
i i i “main” — 2011/10/12 — 12:06 — page ii — #2 i i i
c 2011 by the Mathematical Association of America, Inc.
Library of Congress Catalog Card Number 2011939398 Print edition ISBN: 978-0-88385-576-8 Electronic edition ISBN: 978-1-61444-509-8 Printed in the United States of America Current Printing (last digit): 10987654321
i i
i i i “main” — 2011/10/12 — 12:06 — page iii — #3 i i i
Beautiful Mathematics
Martin Erickson Truman State University
Published and Distributed by The Mathematical Association of America
i i
i i i i “main” — 2012/2/3 — 11:55 — page iv — #4 i i
Council on Publications and Communications Frank Farris, Chair Committee on Books Gerald Bryce, Chair Spectrum Editorial Board Gerald L. Alexanderson, Editor RobertE.Bradley SusannaS.Epp Richard K. Guy Keith M. Kendig ShawneeL. McMurran Jeffrey L. Nunemacher KennethA.Ross FranklinF.Sheehan James J. Tattersall Robin Wilson
i i
i i i “main” — 2011/10/12 — 12:06 — page v — #5 i i i
SPECTRUM SERIES
The Spectrum Series of the Mathematical Association of America was so named to reflect its pur- pose: to publish a broad range of books including biographies, accessible expositions of old or new mathematical ideas, reprints and revisions of excellent out-of-print books, popular works, and other monographs of high interest that will appeal to a broad range of readers, including students and teachers of mathematics, mathematical amateurs, and researchers.
777 Mathematical Conversation Starters, by John de Pillis 99 Points of Intersection: Examples—Pictures—Proofs, by Hans Walser. Translated from the original German by Peter Hilton and Jean Pedersen Aha Gotcha and Aha Insight, by Martin Gardner All the Math That’s Fit to Print, by Keith Devlin Beautiful Mathematics, by Martin Erickson Calculus Gems: Brief Lives and Memorable Mathematics, by George F. Simmons Carl Friedrich Gauss: Titan of Science, by G. Waldo Dunnington, with additional material by Jeremy Gray and Fritz-Egbert Dohse The Changing Space of Geometry, edited by Chris Pritchard Circles: A Mathematical View, by Dan Pedoe Complex Numbers and Geometry, by Liang-shin Hahn Cryptology, by Albrecht Beutelspacher The Early Mathematics of Leonhard Euler, by C. Edward Sandifer The Edge of the Universe: Celebrating 10 Years of Math Horizons, edited by Deanna Haunsperger and Stephen Kennedy Euler and Modern Science, edited by N. N. Bogolyubov, G. K. Mikhailov, and A. P. Yushkevich. Translated from Russian by Robert Burns. Euler at 300: An Appreciation, edited by Robert E. Bradley, Lawrence A. D’Antonio, and C. Edward Sandifer Expeditions in Mathematics, edited by Tatiana Shubin, David F. Hayes, and Gerald L. Alexanderson Five Hundred Mathematical Challenges, by Edward J. Barbeau,Murray S. Klamkin, and William O. J. Moser The Genius of Euler: Reflections on his Life and Work, edited by William Dunham The Golden Section, by Hans Walser. Translated from the original German by Peter Hilton, with the assistance of Jean Pedersen. The Harmony of the World: 75 Years of Mathematics Magazine, edited by Gerald L. Alexanderson with the assistanceof Peter Ross A Historian Looks Back: The Calculus as Algebra and Selected Writings, by Judith Grabiner History of Mathematics: Highways and Byways, by Amy Dahan-Dalm´edicoand JeannePeiffer, trans- lated by Sanford Segal How Euler Did It, by C. Edward Sandifer Is Mathematics Inevitable? A Miscellany, edited by Underwood Dudley I Want to Be a Mathematician, by Paul R. Halmos Journey into Geometries, by Marta Sved JULIA: a life in mathematics, by Constance Reid The Lighter Side of Mathematics: Proceedings of the Eug`ene Strens Memorial Conferenceon Recre- ational Mathematics & Its History, edited by Richard K. Guy and Robert E. Woodrow Lure of the Integers, by Joe Roberts Magic Numbers of the Professor, by Owen O’Shea and Underwood Dudley Magic Tricks, Card Shuffling, and Dynamic Computer Memories: The Mathematics of the Perfect Shuffle, by S. Brent Morris Martin Gardner’s Mathematical Games: The entire collection of his Scientific American columns
i i
i i i “main” — 2011/10/12 — 12:06 — page vi — #6 i i i
The Math Chat Book, by Frank Morgan Mathematical Adventures for Students and Amateurs, edited by David Hayes and Tatiana Shubin. With the assistance of Gerald L. Alexanderson and Peter Ross Mathematical Apocrypha, by Steven G. Krantz Mathematical Apocrypha Redux, by Steven G. Krantz Mathematical Carnival, by Martin Gardner Mathematical Circles Vol I: In Mathematical Circles Quadrants I, II, III, IV, by Howard W. Eves Mathematical Circles Vol II: Mathematical Circles Revisited and Mathematical Circles Squared, by Howard W. Eves Mathematical Circles Vol III: Mathematical Circles Adieu and Return to Mathematical Circles, by Howard W. Eves Mathematical Circus, by Martin Gardner Mathematical Cranks, by Underwood Dudley Mathematical Evolutions, edited by Abe Shenitzer and John Stillwell Mathematical Fallacies, Flaws, and Flimflam, by Edward J. Barbeau Mathematical Magic Show, by Martin Gardner Mathematical Reminiscences, by Howard Eves Mathematical Treks: From Surreal Numbers to Magic Circles, by Ivars Peterson Mathematics: Queen and Servant of Science, by E.T. Bell Mathematics in Historical Context,, by Jeff Suzuki Memorabilia Mathematica, by Robert Edouard Moritz Musings of the Masters: An Anthology of Mathematical Reflections, edited by Raymond G. Ayoub New Mathematical Diversions, by Martin Gardner Non-Euclidean Geometry, by H. S. M. Coxeter Numerical Methods That Work, by Forman Acton Numerology or What Pythagoras Wrought, by Underwood Dudley Out of the Mouths of Mathematicians, by Rosemary Schmalz Penrose Tiles to Trapdoor Ciphers ...and the Return of Dr. Matrix, by Martin Gardner Polyominoes, by George Martin Power Play, by Edward J. Barbeau Proof and Other Dilemmas: Mathematics and Philosophy, edited by Bonnie Gold and Roger Simons The Random Walks of George P´olya, by Gerald L. Alexanderson Remarkable Mathematicians, from Euler to von Neumann, by Ioan James The Search for E.T. Bell, also known as John Taine, by Constance Reid Shaping Space, edited by Marjorie Senechaland George Fleck Sherlock Holmes in Babylon and Other Tales of Mathematical History, edited by Marlow Anderson, Victor Katz, and Robin Wilson Student Research Projects in Calculus, by Marcus Cohen, Arthur Knoebel, Edward D. Gaughan, Douglas S. Kurtz, and David Pengelley Symmetry, by Hans Walser. Translated from the original German by Peter Hilton, with the assistance of Jean Pedersen. The Trisectors, by Underwood Dudley Twenty Years Before the Blackboard, by Michael Stueben with Diane Sandford Who Gave You the Epsilon? and Other Tales of Mathematical History, edited by Marlow Anderson, Victor Katz, and Robin Wilson The Words of Mathematics, by Steven Schwartzman MAA Service Center P.O. Box 91112 Washington, DC 20090-1112 800-331-1622 FAX 301-206-9789
i i
i i i “main” — 2011/10/12 — 12:06 — page vii — #7 i i i
To Rodman Doll, who mentored me in mathematics when I was a high school student
i i
i i i “main” — 2011/10/12 — 12:06 — page viii — #8 i i i
i i
i i i “main” — 2011/10/17 — 16:31 — page ix — #9 i i i
Preface
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 ERDOS˝ (1913–1996) This book is about beautiful mathematical concepts and creations. Some people believe that mathematics is the language of nature, others that it is an abstract game with symbols and rules. Still others believe it is all calculations. Plato equated mathematics with “the good.” My approach to mathematics is as an art form, like painting, sculpture, or music. While the artist works in a tangible medium, the mathematician works in a medium of numbers, shapes, and abstract patterns. In mathematics, as in art, there are constraints. The most stringent is that mathematical results must be true; others are conciseness and elegance. As with other arts, mathematical ideas have an esthetic appeal that can be appreciated by those with the willingness to investigate. I hope that this book will inspire readers with the beauty of mathematics. I present math- ematical topics in the categories of words, images, formulas, theorems, proofs, solutions, and unsolved problems. We go from complex numbers to arithmetic progressions, from Alcuin’s sequence to the zeta function, and from hypercubes to infinity squared. Who should read this book? I believe that there is something new in it for any mathemat- ically-minded person. I especially recommend it to high school and college students, as they need motivation to study mathematics, and beauty is a strong motivation; and to pro- fessional mathematicians, because we always need fresh examples of mathematical beauty to pass along to others. Within each chapter, the topics require progressively more prerequi- site knowledge. Topics that may be too advanced for a beginning reader will become more accessible as the reader progresses in mathematical study. An appendix gives background definitions and theorems, while another gives challenging exercises, with solutions, to help the reader learn more. Thanks to thepeople who have kindlyprovided suggestionsconcerning thisbook:Roland Bacher, Donald Bindner, Robert Cacioppo, Robert Dobrow, Shalom Eliahou, Ravi Fer- nando, Suren Fernando, David Garth, Joe Hemmeter, Daniel Jordan, Ken Price, Khang Tran, Vincent Vatter, and Anthony Vazzana. Thanks also to the people affiliated with pub- lishing at the Mathematical Association of America, including Gerald Alexanderson, Don Albers, Carol Baxter, Rebecca Elmo, Frank Farris, Beverly Ruedi, and the anonymous readers, for their help in making this book a reality.
ix
i i
i i i “main” — 2011/10/12 — 12:06 — page x — #10 i i i
i i
i i i “main” — 2011/10/12 — 12:06 — page xi — #11 i i i
Contents
Preface ix 1 ImaginativeWords 1 1.1 Lemniscate ...... 1 1.2 Centillion...... 3 1.3 GoldenRatio ...... 3 1.4 BorromeanRings...... 5 1.5 SieveofEratosthenes ...... 5 1.6 TransversalofPrimes...... 6 1.7 WaterfallofPrimes ...... 7 1.8 Squares,TriangularNumbers,andCubes ...... 7 1.9 Determinant...... 8 1.10ComplexPlane ...... 8 2 Intriguing Images 13 2.1 SquarePyramidalSquareNumber ...... 13 2.2 BinaryTrees ...... 15 2.3 BulgingHyperspheres ...... 16 2.4 ProjectivePlane...... 16 2.5 Two-ColoredGraph...... 17 2.6 Hypercube...... 18 2.7 FullAdder...... 19 2.8 Sierpi´nski’s Triangle ...... 20 2.9 SquaringMap...... 21 2.10RiemannSphere...... 22 3 CaptivatingFormulas 25 3.1 ArithmeticalWonders...... 25 3.2 Heron’sFormulaandHeronianTriangles ...... 25 3.3 Sine,Cosine,andExponentialFunctionExpansions ...... 28 3.4 TangentandSecantFunctionExpansions ...... 29 3.5 SeriesforPi...... 30 3.6 ProductforPi...... 31 3.7 FibonacciNumbersandPi ...... 32 3.8 VolumeofaBall ...... 32 3.9 Euler’sIntegralFormula ...... 34 3.10Euler’sPolyhedralFormula...... 35
xi
i i
i i i “main” — 2011/10/12 — 12:06 — page xii — #12 i i i
xii Contents
3.11TheSmallestTaxicabNumber ...... 36 3.12InfinityandInfinitySquared ...... 37 3.13ComplexFunctions ...... 38 3.14TheZetaFunctionandBernoulliNumbers ...... 40 3.15TheRiemannZetaFunction ...... 41 3.16TheJacobiIdentity ...... 42 3.17Entropy ...... 43 3.18RookPaths ...... 44
4 Delightful Theorems 49 4.1 ASquareinsideEveryTriangle...... 49 4.2 Morley’sTheorem ...... 50 4.3 TheEulerLine ...... 52 4.4 Monge’sTheorem...... 54 4.5 PowerMeans ...... 54 4.6 RegularHeptagon...... 58 4.7 IsometriesofthePlane ...... 59 4.8 SymmetriesofRegularConvexPolyhedra ...... 61 4.9 PolynomialSymmetries...... 63 4.10KingsandSerfs...... 65 4.11 The Erd˝os--Szekeres Theorem ...... 66 4.12Minkowski’sTheorem ...... 67 4.13Lagrange’sTheorem ...... 69 4.14VanderWaerden’sTheorem ...... 72 4.15LatinSquaresandProjectivePlanes ...... 76 4.16TheLemniscateRevisited ...... 79
5 Pleasing Proofs 83 5.1 ThePythagoreanTheorem ...... 83 5.2 The Erd˝os--Mordell Inequality ...... 84 5.3 TriangleswithGivenAreaandPerimeter ...... 85 5.4 APropertyoftheDirectrixofaParabola...... 86 5.5 AClassicIntegral...... 87 5.6 IntegerPartitions ...... 88 5.7 IntegerTriangles ...... 89 5.8 TriangleDestruction ...... 92 5.9 SquaresinArithmeticProgression ...... 94 5.10RandomHemispheres...... 95 5.11OddBinomialCoefficients ...... 95 5.12Frobenius’PostageStampProblem...... 96 5.13Perrin’sSequence...... 99 5.14OntheNumberofPartialOrders ...... 99 5.15PerfectError-CorrectingCodes...... 101 5.16BinomialCoefficientMagic ...... 104 5.17AGroupofOperations ...... 106
i i
i i i “main” — 2011/10/12 — 12:06 — page xiii — #13 i i i
Contents xiii
6 Elegant Solutions 109 6.1 ATetrahedronandFourSpheres ...... 109 6.2 AlphabetCubes...... 110 6.3 ATriangleinanEllipse...... 110 6.4 AbouttheRootsofaCubic...... 111 6.5 DistanceonPlanetX ...... 113 6.6 ATiltedCircle ...... 114 6.7 TheMillionthFibonacciNumber...... 116 6.8 TheEndofaConjecture ...... 117 6.9 AZero-SumGame ...... 117 6.10AnExpectedMaximum...... 119 6.11WalksonaGraph...... 120 6.12RotationsofaGrid ...... 123 6.13StampRolls...... 125 6.14MakingaMillion ...... 128 6.15ColoringaProjectivePlane...... 129 7 Creative Problems 131 7.1 Two-DimensionalGobblingAlgorithm...... 131 7.2 NonattackingQueensGame ...... 132 7.3 Lucas Numbers Mod m ...... 132 7.4 ExactColoringsofGraphs ...... 133 7.5 QueenPaths...... 134 7.6 TransversalAchievementGame ...... 136 7.7 BinaryMatrixGame ...... 136 A Harmonious Foundations 139 A.1 Sets ...... 139 A.2 Relations ...... 141 A.3 Functions ...... 141 A.4 Groups ...... 142 A.5 Fields ...... 145 A.6 VectorSpaces...... 146 B Eye-Opening Explorations 151 B.1 Problems ...... 151 B.2 Solutions ...... 155 Bibliography 165 Index 169 About the Author 177
i i
i i i “main” — 2011/10/12 — 12:06 — page xiv — #14 i i i
i i
i i i “main” — 2011/10/12 — 12:06 — page 1 — #15 i i i
1 Imaginative Words
It is impossible to be a mathematician without being a poet in soul. SOFIA KOVALEVSKAYA (1850–1891) The objects of mathematics can have fascinating names. Mathematical words describe numbers, shapes, and logical concepts. Some are ordinary words adapted for a specific pur- pose, such as cardinal, cube, group, face, field, ring, and tree. Others are unusual, like cose- cant, holomorphism, octodecillion, polyhedron, and pseudoprime. Some sound peculiar— deleted comb space, harmonic map, supremum norm, twisted sphere bundle, to name a few. Mathematical words have appeared in poems (see [19]). Let us look at some mathematical words.
1.1 Lemniscate Consider the lemniscate, a curve shaped like a figure-eight1 as shown in Figure 1.1. We learn in [46] that it gets its name from the Greek word lemniskos, a ribbon used for fas- tening a garland on one’s head, derived from the island Lemnos where they were worn. By a coincidence, the end of the word lemniscate sounds like “skate,” and one can (with practice and skill) skate a figure-eight. Skating a lemniscate is portrayed in the animated Schoolhouse Rock segment “Figure Eight,” with the theme sung by jazz vocalist Blossom Dearie (1926–2009). She sings that a figure-eight is “double four,” which is probably the Indo-European origin of the word “eight.” In the animation, a girl daydreams of skating a figure-eight that turns into the infinity symbol . 1
Figure 1.1. A lemniscate.
1Another curve, known as the Eight Curve, is perhaps closer to a figure-eight, but we will stick with the lemniscate because it is so graceful.
1
i i
i i i “main” — 2011/10/12 — 12:06 — page 2 — #16 i i i
2 1. Imaginative Words
y
x
Figure 1.2. A lemniscate graph. y
x
Figure 1.3. A lemniscate and a hyperbola as circular inverses.
As in Figure 1.2, a lemniscate can be graphed on an xy coordinate system by the para- metric equations cos t x D 1 sin2 t C sin t cos t y ; < t < : D 1 sin2 t 1 1 C As the parameter t moves along the real number line, a point .x; y/ in the plane traces the lemniscate over and over, followingthe right lobe counterclockwise and the left lobe in the clockwise direction. Where do the parametric equations for the lemniscate come from? One way to obtain a lemniscate is by circular inversion of a hyperbola. In Figure 1.3, we see the hyperbola
x2 y2 1 D and the lemniscate as inverses with respect to the unit circle centered at the origin. Each point on the hyperbola is joined by a line segment to the origin. The point where it crosses the lemniscate is indicated. The length of the segment from the origin to the lemniscate is the reciprocal of the length of the segment from the origin to the hyperbola. The self- intersection point of the lemniscate corresponds to a point at infinity on the hyperbola. The distance from the origin to a point .x; y/ is x2 y2. To find the point on the C lemniscate corresponding to .x; y/ on the hyperbola, we make the transformation p x y .x; y/ ; : 7! x2 y2 x2 y2 Â C C Ã
i i
i i i “main” — 2011/10/12 — 12:06 — page 3 — #17 i i i
1.2. Centillion 3
This transforms the equation for the hyperbola into an equation for the lemniscate:
.x2 y2/2 x2 y2: C D Starting with parametric equations for the hyperbola,
x sec t D y tan t; < t < ; D 1 1 we obtain, upon making the same transformation, the parametric equations for the lemnis- cate.
1.2 Centillion What is the largest number you can name? A million is 103 thousand. A billion is 106 thou- sand. A trillionis 109 thousand. The largest number given in a dictionary list of numbers is typically a centillion, which is 1 followed by 100 groups of three zeros followed by another group of three zeros, or 10300 thousand, or
10303:
A centillionis much larger than a googol,a coinedterm for 10100, but much smaller than a googolplex, defined as 1 followed by a googol of zeros. If you have ten dollars and seven cents in pennies then you have, in a way, a centil- lion. The number of ways of selecting a subset of the pennies is 21007, which is about 1:4 centillion.
1.3 Golden Ratio Figure 1.4 shows a golden rectangle. If we remove the square on the shorter side, the remaining rectangle has the same proportionsas the original rectangle. The golden ratio is y x : x D y x This is y 1 ; x D y 1 x or y 2 y 1: x x D Á Completing the square, y 1 2 5 ; x 2 D 4 Â Ã so y 1 p5 ; x 2 D ˙ 2
i i
i i i “main” — 2011/10/12 — 12:06 — page 4 — #18 i i i
4 1. Imaginative Words
x y – x
x
y
Figure 1.4. The golden rectangle.
and hence y 1 p5 ˙ : x D 2 Since y=x is greater than 1, the positive sign applies. Therefore, the golden ratio, denoted by , is 1 p5 : C 1:6: D 2 D A rational number is a ratio of two integers, such as 4=7 or 2=1. An irrational number is a real number that isn’t rational. The golden ratio is an irrational number. If were rational, then we could write y=x, where x and y are positive integers. From Figure 1.4, we D see that also equals x=.y x/. This is a representation of as a ratio of a pair of smaller positive integers. We could repeat the process, representing as ratios of smaller and smaller pairs of positive integers. But this would imply an infinite decreasing chain of positive integers, which is impossible. Therefore is irrational. In Euclidean geometry, we can construct a line through any two points, a circle with any center and passing through any given point, and the intersection of two given lines, a line and a circle, or two circles. Figure 1.5 shows a construction of the golden rectangle using four lines and six circles. For more about the golden ratio, see the delightful book [52].
Figure 1.5. Construction of the golden rectangle.
i i
i i i “main” — 2011/10/12 — 12:06 — page 5 — #19 i i i
1.4. Borromean Rings 5
Figure 1.6. Borromean rings. 1.4 Borromean Rings Figure 1.6 shows three interlocking rings called Borromean rings, named after the Bor- romeo family in Italy whose coat of arms depicted them. No two rings are linked but if we remove one of them then the other two come apart. Borromean rings exist as an abstract concept, but they do not exist in reality. The rings cannot be represented by three circles in 3-dimensional Euclidean space, even with arbi- trary radii. The problem is that one cannot make rigidcircles pass over and under each other in the required way. For a proof, see [31]. However, the sculptor John Robinson has shown that the interlocking configuration can be made with three squares or equilateral triangles instead of circles.
Figure 1.7. Sieve of Eratosthenes.
1.5 Sieve of Eratosthenes A primenumber is an integer greater than 1 with no positive divisorsother than 1 and itself. For example, 13 is a prime number, but 10 is not because it is divisible by 2 and 5. There
i i
i i i “main” — 2011/10/12 — 12:06 — page 6 — #20 i i i
6 1. Imaginative Words
are infinitely many prime numbers, as proved in Euclid’s Elements. Every integer greater than 1 is the product of primes in a unique way, the Fundamental Theorem of Arithmetic. The Sieve of Eratosthenes, invented by Eratosthenes of Cyrene (c. 276–195 BCE), is an algorithm for listingall the primes up to a given number. The method is to eliminate proper multiples of known primes. Figure 1.7 shows the result of the Sieve of Eratosthenes on the numbers 2 through 400. In the figure, the boxes represent the integers 2 through 400, reading left-to-rightand top- to-bottom. Unshaded squares represent prime numbers and shaded squares represent com- posite (non-prime) numbers. The algorithm starts with the boxes unshaded. Then proper multiples of the first prime (2) are shaded (since they are divisible by 2 and hence com- posite). The next remaining number in order, 3, is a prime, and its proper multiples are shaded. The next remaining number is the prime 5, and its proper multiples are shaded. This continues for all primes up to 19 (those in the first row of the array). We need to sift out multiples of the primes 2, 3, 5, 7, 11, 13, 17, and 19, since 19 is the largest prime whose square is less than 400. Any composite number up to 400 must be divisibleby one of them.
1.6 Transversal of Primes
Let p beaprimenumber.Ina p p square array consisting of the numbers 1 through p2 (in left-to-right, top-to-bottom order), is there always a collection of p primes with no two of them in the same row or column? The solutions for p 2, 3, and 5 are unique. D Figure 1.8 shows an example for p 11. D A transversal of an n n array is a selection of n cells of the array with no two in the same row or column. We are asking whether there is a transversal of primes in a p p array. Adrien-Marie Legendre (1752–1833) conjectured that there exists at least one prime number between consecutive squares N 2 and .N 1/2. This conjecture is still open. Leg- C endre’s conjecture is a necessary condition for our problem, since there must be a prime in the last row of the grid. Is the answer to our question possibly “no” for some prime p?
987654321 1110 2221201918171615141312 3332313029282726252423 4443424140393837363534 5554535251504948474645 6665646362616059585756 7776757473727170696867 8887868584838281807978 9998979695949392919089 110109108107106105104103102101100 121120119118117116115114113112111
Figure 1.8. A transversal of primes.
i i
i i i “main” — 2011/10/12 — 12:06 — page 7 — #21 i i i
1.7. Waterfall of Primes 7
1.7 Waterfall of Primes Primes greater than 2 are odd and therefore upon division by 4 leave a remainder of 1 or 3. For example, 11 4 2 3 and 13 4 3 1. Among the first 1000 odd primes, 495 are D C D C of the form 4n 1 and 505 are of the form 4n 3. Thus, there are about half of each type. C C As the sequence of primes goes on, the distribution of primes into the two types is closer and closer to half-half. The waterfall of primes in Figure 1.9 depicts the way that prime numbers fall into the two classes, primes of the form 4n 1 on the rightand primes of the C form 4n 3 on the left. As the waterfall continues for all eternity, the difference between C the number of primes of the two forms changes sign infinitely often. Primes of different forms have different properties. For example, an odd prime is the sum of two squares of integers if and only if it is of the form 4n 1. C
Figure 1.9. A waterfall of primes.
1.8 Squares, Triangular Numbers, and Cubes Number theory is the study of properties of the counting numbers, 1, 2, 3,.... A theorem of Joseph-Louis Lagrange (1736–1813) says that every positive integer is equal to the sum of four squares of integers. For example,
132 92 72 12 12: D C C C A similar theorem, due to Carl Friedrich Gauss (1777–1855), asserts that every positive integer is equal to the sum of at most three triangular numbers. A triangular number is a number of the form 1 2 k, for some positive integer k. So 10 1 2 3 4 is a C C C D C C C triangular number. The reason for this term is that dots representing the numbers 1 through
i i
i i i “main” — 2011/10/12 — 12:06 — page 8 — #22 i i i
8 1. Imaginative Words
k can be stacked in the shape of a triangle. An example of Gauss’s theorem is
100 91 6 3: D C C A thirdtheorem of number theory, due to Pierre de Fermat (1601–1665),says that a cube (a positiveinteger of the form n3) is never equal to thesum of twocubes. For instance, there is noway towrite 103 1000 as thesum of twocubes. This result is part of a more general D assertion known as Fermat’s Last Theorem, which was proved by Andrew Wiles in 1995. It says there are no positive integer solutions to the equation xn yn zn, where n is an C D integer greater than 2. Figure 1.10 represents these three theorems pictorially. In his diary, Gauss wrote an equivalent of the second equation accompanied by the exclamation Eureka! A good reference on number theory is [37].
Figure 1.10. Three theorems of number theory.
1.9 Determinant A determinant is an algebraic quantity that determines whether or not a system of linear equations has a solution. Perhaps you are familiar with the formula for 2 2 determinants: a b ad bc: c d D ˇ ˇ ˇ ˇ ˇ ˇ Did youknow that thedeterminantˇ is theareaˇ of a parallelogram? In Figure1.11, thearea of the gray parallelogram, spanned by the vectors .a; b/ and .c; d/, is the area of the rectangle minus the areas of two triangles and two trapezoids: 1 1 1 1 .a c/.b d/ ab cd c.b b d/ b.c a c/ C C 2 2 2 C C 2 C C ad bc: D In any dimension, a determinant is equal to the signed volume of the parallelepiped spanned by its row vectors.
1.10 Complex Plane Complex numbers were treated with skepticism when they were first introduced in the 1500s. What sense can be made of the number p 1?
i i
i i i “main” — 2011/10/12 — 12:06 — page 9 — #23 i i i
1.10. Complex Plane 9
(0,b + d ) (a + c b , + d )
(,)c d (0,d ) (,)a b
(0, 0) (a , 0) (a + c , 0)
Figure 1.11. A 2 2 determinant as an area.
Since the square of a positive number is positive, and the square of a negative number is positive, and zero squared is zero, it appears that the square of no number can be 1. However, this is the definition of i, the imaginary unit. The equation x2 1 0 has no solutionin the field of real numbers R. But it is possible C D to solve it in a field that contains R. The field is created by adding a new element, i, to R that has the property that i 2 1 0. Once i is added, other numbers must be added in C D order to ensure that the structure is a field. We call this field the field of complex numbers, C. In this field, every polynomial equation with complex coefficients has a complex root. The field C can be identified with the plane R2 in a natural way. However, the two structures are different. Multiplication of two vectors in R2 cannot be defined to produce a new vector so as to form a field. (The dot product of two vectors produces a number, not a vector. The cross product is defined for two vectors in R3, but this multiplication does not produce a field, since it isn’t commutative.) However, a vector multiplication is possible in C. The main reason for defining this new field is the realization of these two properties: algebraic closure and existence of a multiplication. In the construction identifying C and R2, we identify each real number r R with the 2 ordered pair .r; 0/, we identify i with the ordered pair .0; 1/, and we identify the number a bi with the ordered pair .a; b/. This constructionwas first carried out by the Norwegian C mathematician Caspar Wessel (1745–1818). For an engaging account of the early history of complex numbers, see [36]. Once we have defined the element i such that the equation i 2 1 holds, we have D defined the field of complex numbers C. The relation i 2 1 induces a rotational product D for the whole complex plane. Hence, .R2; ; / forms a field where addition is ordinary C vector addition. We call .R2; ; / the complex plane, and the points .a; b/ R2 are called C 2 complex numbers. They are ordinarypointsinthe ordinaryplane, butwitha way tomultiply them to get another point. Thus, the plane with vector addition and this rotational product is a field. See Figure 1.12. Many polynomials don’t have real zeroes, for example, x2 1. The complex numbers are C built upon the reals and a zero of this polynomial. The nontrivialfact that every polynomial has a real zero was first proved by Carl Friedrich Gauss (1777–1850) in the early 1800s, and is called the Fundamental Theorem of Algebra.
i i
i i i “main” — 2011/10/12 — 12:06 — page 10 — #24 i i i
10 1. Imaginative Words
¡A imaginary axis
4 i 2 i C C r r real axis ¨ 0 0i H H C ¨ r
2 2i r
4 4i r ¡A Figure 1.12. The complex plane.
We define the sum of two complex numbers by
.a bi/ .c di/ .a c/ .b d/i; C C C D C C C or, in terms of ordered pairs,
.a; b/ .c; d/ .a c; b d/: C D C C Multiplicationis defined based on the rule that i 2 1, so that D .a bi/.c di/ .ac bd/ .ad bc/i; C C D C C or, in terms of ordered pairs,
.a; b/ .c; d/ .ac bd; ad bc/: D C The formula for multiplication can be remembered by writing .a; b/ as a bi and using C ordinary multiplication of binomials, replacing i 2 by 1 wherever it occurs. Since .a; 0/ .b; 0/ .a b; 0/ and .a; 0/ .b; 0/ .ab; 0/, we can identifythe x-axis C D C D with the real line. We call .x; 0/ a real number. As .0; 1/ .0; 1/ . 1; 0/, we can identify .0; 1/ with i. This is also denoted by i and D the y-axis is called the imaginary axis. We call .0; y/ a pure imaginary number. We see that .b; 0/ .0; 1/ .0; b/ and thus .a; b/ .a; 0/ .0; b/ .a; 0/ .b; 0/ .0; 1/. D D C D C That is, .a; b/ a bi where a and b are real numbers called the real and imaginary parts D C of the complex number a bi. We denote the real part of z by z and its imaginary part C < by z. =
i i
i i i “main” — 2011/10/12 — 12:06 — page 11 — #25 i i i
1.10. Complex Plane 11
We define .a bi/ to be the complex number corresponding to the ordered pair C . a; b/. Also, we define the difference of a bi and c di to be .a bi/ .c di/ C C C C D .a c/ .b d/i. C To prove that C is a field, we need to show that an arbitrary complex number z a bi D C has a multiplicative inverse z 1. We can do this by rationalizing the denominator: 1 a bi a bi a b z 1 i: D a bi D .a bi/.a bi/ D a2 b2 D a2 b2 a2 b2 C C C C C 1 To evaluate the complex quotient z1=z2 is easy; we compute z1z2 . We can show that complex multiplication is associative, commutative, distributive over addition, and has the unit 1 1 0i .1; 0/. This means that .R2; ; / isa field, and we D C D C denote it by C. The modulus or absolute value of a complex number a bi is its distance, as a point in C the plane, from the origin .0; 0/. That is, a bi pa2 b2. j C j D C The distance between the complex numbers z1 a1 b1i and z2 a2 b2i is the D C D C usual Euclidean distance in the plane between .a1; b1/ and .a2; b2/, which is
2 2 .a2 a1/ .b2 b1/ : C The conjugate of z a bipis z a bi. Geometrically, the vector z is reflected in D C D the x-axis to produce the vector z. Leonhard Euler (1707–1783) discovered a fundamental connection between the sine and cosine functions and the exponential function. When we consider them as functions of a real variable, there doesn’t appear to be any connection among them. Sine and cosine are bounded, periodic and take on negative values, which contrasts with the behavior of the exponential function, which has none of these properties. To see the relationship, we look at the exponential function with a purely imaginary argument, or, more precisely, determine how the exponential function should be extended to the y-axis of R2. The functions have power series expansions 2 4 6 cos 1 D 2Š C 4Š 6Š C 3 5 7 sin D 3Š C 5Š 7Š C x x2 x3 x4 x5 x6 x7 ex 1 : D C 1Š C 2Š C 3Š C 4Š C 5Š C 6Š C 7Š C Euler considered ei . Because i 4kC2 1 and i 4k 1, the coefficients of even powers of D D in the expansions of ei and cos are the same. And because i 4kC1 i and i 4kC3 i, D D the coefficients of odd powers of in the expansion of ei and i sin are the same. Thus, we have Euler’s formula ei cos i sin : D C This is not really a derivation since we haven’t defined the cosine, sine, or exponential functions with complex arguments, much less determined their power series. So, actually, Euler’s formula is an insight into what becomes the definition of the exponential function with a pure imaginary argument.
i i
i i i “main” — 2011/10/12 — 12:06 — page 12 — #26 i i i
12 1. Imaginative Words
Using Euler’s formula, we can write a complex number z a bi in polar coordinates D C form as z rei . For example, D 5 5ei0; 5 5ei ; i ei.=2/; i ei. =2/; 1 i p2ei.3=4/: D D D D C D
As a further example, the circle of radius 5 centered at z0 is z z0 5, or equivalently, i j j D z z0 5e , where 0 < 2. D C Ä We have seen that we can represent a complex number as an ordered pair of real numbers or in polar coordinates. We can also represent it as a vector
a ; b Ä where a and b are real numbers. And we can represent a complex number as a 2 2 matrix: a b cos sin or r : b a sin cos Ä Ä The second matrix is a rotation matrix corresponding to counterclockwise rotation about the origin by the angle in radians. Multiplication by a fixed matrix is a linear transformation of the plane. This allows us to apply complex numbers to problems of geometry. An example of the interplay between complex numbers and plane geometry is the description of the isometries of the Euclidean plane in terms of complex numbers. See Isometries of the Plane in Chapter 4.
i i
i i i “main” — 2011/10/12 — 12:06 — page 13 — #27 i i i
2 Intriguing Images
Mathematics, rightly viewed, possesses not only truth, but supreme beauty—a beauty cold and austere, like that of sculpture, without ap- peal to any part of our weaker nature, without the gorgeous trappings of painting or music, yet sublimely pure, and capable of a stern perfection such as only the greatest art can show. The true spiritof delight,the exal- tation, the sense of being more than Man, which is the touchstone of the highest excellence, is to be found in mathematics as surely as poetry. —BERTRAND RUSSELL (1872–1970), The Study of Mathematics Many mathematical concepts are embodied in diagrams, drawings, and other kinds of images. A sketch may illustrate a theorem. A picture may point the way to new mathe- matics. Let us look at some mathematical images and learn about the mathematics behind them.
2.1 Square Pyramidal Square Number The equation 12 22 32 242 702 C C C C D might seem, at first glance, to be a miscellaneous mathematical fact, but it is special. Edouard´ Lucas (1842–1891) posed a problem, called the Cannonball Puzzle, which asked for a number N such that N cannonballs (spheres) can be placed in a square array, or in a pyramidal array with a square base. Thus, Lucas asked for a solution in integers1 to the equation 12 22 32 m2 n2; C C C C D where N n2. From the formula for the sum of the first consecutive m squares, the D equation becomes m.m 1/.2m 1/ C C n2: 6 D Lucas suspected, but was unableto prove, that the only solutionis m 24 and n 70, with D D N 4900, as above. That is, 4900 is the only square pyramidal square number greater D 1A polynomial equation required to have integer solutions is called a Diophantine equation, after Diophantus of Alexandria (c. 200–c.284 B.C.E.), whose book Arithmetica treats equations of this kind.
13
i i
i i i “main” — 2011/10/12 — 12:06 — page 14 — #28 i i i
14 2. Intriguing Images
Figure 2.1. A pyramid of 4900 spheres.
than 1. Mathematicians after Lucas succeeded in proving this (see [4] for a particularly clear treatment). Figure 2.1 shows the pyramid of 4900 spheres. The set of solutionsto
x.x 1/.2x 1/ C C y2 6 D
comprise what is called an elliptic curve. The study of elliptic curves is an active and fascinating area of mathematics. An excellent book is [53]. The solutionto the Cannonball Puzzle is the basis for the existence of a famous lattice in 24 dimensions known as Leech’s lattice, discovered by John Leech (1926–1992). A lattice is a regularly repeating pattern ofpoints,such as the intersection pointsofgraph paper. If we put a sphere of the same radius around each lattice point so that the spheres just touch, then the lattice yields a sphere packing. Leech’s lattice has a remarkably high contact number (the number of nearest neighbors of each lattice point): 196;560. In the sphere packing associated with Leech’s lattice, every sphere touches exactly 196;560 other spheres. This is the maximum contact number for a lattice sphere packing in 24 dimensions. Leech’s lattice can be constructed from a Lorentzian lattice in 26 dimensional space. The vector w .0;1;2;3;:::;24 70/ has length 0 in this space, since in the Lorentzian metric D I we compute length to be the square root of the sum of the squares of the coordinates with the exception that the last coordinate square is subtracted. Leech’s lattice (a 24-dimensional linear space) is the quotient space w?=w of the orthogonal space to w (dimension 25) and the space spanned by w (dimension 1). The definitive reference on lattices and sphere packing is [14].
i i
i i i “main” — 2011/10/12 — 12:06 — page 15 — #29 i i i
2.2. Binary Trees 15
1
3 2
4 5 11 8
9 10 7 6 14 13 15 12
Figure 2.2. An order-preserving labeling of the full binary tree of order 4. 2.2 Binary Trees
Consider
2 22 2n 2 2n 2 2n 1 2 2n 2 2 2 ::: ; n 1: 2n 1 1 2n 2 1 2n 3 1 1 ! ! ! ! The expression counts the number of order-preserving labelings of the full binary tree of order n, with the integers 1,..., 2n 1. The full binary tree of order n is a directed graph with a top node joined by arrows to two nodes at the next level down; each of these is joined by arrows to two nodes at the next level down, and so on for n levels in all. In an order-preserving labeling, each node is labeled with a smaller number than the labels of any of its descendents. Figure 2.2 shows an example with n 4. D To see that this is what is counted, notice that the 1 must go at the top node of the tree. Then there is a choice of half of the remaining elements to go into the left subtree. It may 2n 2 be made in 2n 1 1 ways. This leaves the other elements in the right subtree. The least element in each subtree must go on top. Repeating, allowing for all the choices in all the branches at each level, gives the expression. Call this number f .n/. The table below gives some numerical values.
n f .n/ 1 1 2 2 3 80 4 21964800 5 74836825861835980800000
If n 1, the expression is an empty product which we define to be 1. D The labeled binary tree in Figure 2.2 is an example of a data structure in computer sci- ence called a heap. A heap can be viewed as a labeled subtree of a full binary tree. Fig- ure 2.3 illustrates a heap on the set 1;2;3;4;5;6;7;8;9 . Heaps allow for quick insertion f g or deletion of minimum or maximum values, and they are used in a sorting algorithmcalled heapsort.
i i
i i i “main” — 2011/10/12 — 12:06 — page 16 — #30 i i i
16 2. Intriguing Images
1
3 2
4 5 8
9 7 6
Figure 2.3. A heap. 2.3 Bulging Hyperspheres Figure 2.4 shows a square of side length 4 circumscribing four circles of radius 1. By the Pythagorean theorem, the radius of the small circle in the middle of the larger circles is p2 1. What happens if we generalize to any dimension d 1? Suppose that we have a hypercube of side 4 in d-dimensional space, containing 2d hyperspheres of radius 1. See Volume of a Ball in Chapter 3. We can place the hypercube so that its center is at the origin and the unit hyperspheres are centered at . 1; 1; : : : ; 1/. By the Pythagorean theorem, ˙ ˙ ˙ the distance between the center of one of the unit hyperspheres and the hypersphere that sits in the middleof them is r pd. Hence the radius of the small hypersphere is D r pd 1: D For d 4, the radius of the small hypersphere is 1, the same as the radii of the other D hyperspheres. For d > 4, the small hypersphere is larger than those that surround it. For d 9, the radius is 2 and the small hypersphere touches the sides of the hypercube. For D d > 9, the small hypersphere bulges outside the hypercube!
4
Figure 2.4. A circle surrounded by other circles.
2.4 Projective Plane A projective plane is a geometry in which every two points determine a line and every two lines intersect in exactly one point. There are no parallel lines! Figure 2.5 shows a thirteen-point projective plane.
i i
i i i “main” — 2011/10/12 — 12:06 — page 17 — #31 i i i
2.5. Two-Colored Graph 17
1
r
02 12 22 @ r@ r r @ 01@ 11 21 0 @ r r@ r r @ @ 00 10 20@ r r r @ @ @ 1 r r2 Figure 2.5. A projective plane of order three.
The thirteen-pointprojective plane has thirteen lines (in the figure, some of the lines are curved). Every line contains four points and every point is on four lines. Nine of the points are labeled with coordinates 00 through 22. The other four points, called ideal points, are labeled 0, 1, 2, and . 1 We call this little universe a projective plane of order three (one less than the number of points per line). A projective plane of order n is a collection of n2 n 1 points and C C n2 n 1 lines such that each line contains n 1 points, each point lies on n 1 lines, C C C C every two pointsdetermine a unique line, and every two lines intersect in exactly one point. There exists a projective plane of order equal to any power of a prime number. No one knows if there is a projective plane whose order is not a prime power. The smallest integer greater than 1 that isn’t a prime power is 6, and Gaston Tarry (1843–1913) proved that there is no projective plane of order 6. The next feasible order, 10, has been ruled out by a combination of mathematics and computer calculations: there is no projective plane of order 10. The existence of a projective plane of order 12 remains an open question. If it exists, it would have 157 points and 157 lines. 2.5 Two-Colored Graph In graph theory, a graph is a collection of vertices and a collection of edges joiningpairs of vertices. The edges may be straight or curved and may cross. Figure 2.6 shows a complete graph on 17 vertices. It is complete because every two vertices are joined by an edge. The edges of the graph are colored with two colors, indicated by dark lines and light lines. The coloring has the property that there exist no four vertices all of whose six edge connections are the same color. However, every two-coloring of the edges of the complete graph on 18 vertices must have four vertices all of whose edge connections are the same color. This statement is an instance of a combinatorial result called Ramsey’s theorem. Ramsey’s theorem, discovered by Frank Ramsey (1903–1930), says that for every n, there exists a least integer R.n/ so that no matter how the edges of a complete graph on R.n/ vertices are two-colored, there exist n vertices all of whose edge connections are the same color. Thus R.4/ 18. Can you show that R.3/ 6? D D
i i
i i i “main” — 2011/10/12 — 12:06 — page 18 — #32 i i i
18 2. Intriguing Images
The coloringof Figure 2.6 has a cyclic symmetry, with every vertex joined by dark edges to the vertices at steps 1, 2, 4, 8, 9, 13, 15, and 16 clockwise around the circle. A good reference on graph theory is [54].
Figure 2.6. A two-coloring of the complete graph on 17 vertices.
2.6 Hypercube To sketch a two-dimensional drawing of a cube, draw two squares separated by a little distance and draw four lines joining corresponding vertices. We can go a step further and draw a hypercube, a four-dimensionalcube. Draw two cubes a littledistance apart and draw lines joiningcorresponding vertices. The drawing has sixteen vertices and thirty-twoedges, each vertex joined to four other vertices. Figure 2.7 shows one way to draw the picture. A hypercube can be defined combinatorially as the set of sixteen binary strings of length four, e.g., 0110, where two strings are joined if and only if they differ in exactly one place. For example, the strings 0110 and 0111 are joined. This way of thinkingabout a hypercube is useful in constructing an example of a graph coloring. In the exercises in Appendix B, you are asked to give a three-coloring of the edges of a complete graph on 16 vertices such that there exists no triangle all of whose edges are the same color. In such a coloring, each single-color subgraph is a hypercube with the diagonals added.
Figure 2.7. A hypercube.
i i
i i i “main” — 2011/10/12 — 12:06 — page 19 — #33 i i i
2.7. Full Adder 19
input1 input2 output
carry
nextcarry
Figure 2.8. A full adder. 2.7 Full Adder Figure 2.8 shows a logic diagram for an integrated circuit known as a full adder. It is the backbone of the arithmetic unit of a computer. The circuit performs binary addition. Given two input bits (0 or 1) and a previous carry bit,the circuit adds the numbers in binary and yieldsan outputbit and a next carry bit.Here is the truth table for this circuit. input1 input2 carry output nextcarry 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 1 1 1 1 1
The elements in a full adder are called logic gates. The basic types are AND gates, OR gates, and NOT gates. They perform the logical operations described by their names. In combination they can create complex circuits such as the full adder. The NOT gate is the simplest. It changes an input of 1 to 0, and 0 to 1.
input output
input output 0 1 1 0
The AND gate yields an output of 1 if and only if both inputs are 1. input2 output input1
i i
i i i “main” — 2011/10/12 — 12:06 — page 20 — #34 i i i
20 2. Intriguing Images
input1 input2 output 0 0 0 0 1 0 1 0 0 1 1 1 The OR gate yields an output of 1 if either input is 1. input2 output input1
input1 input2 output 0 0 0 0 1 1 1 0 1 1 1 1 All aspects of a computer’s thinking, including memory, are formed from these building blocks. The mathematical underpinnings are discussed in [43].
2.8 Sierpin´ski’sTriangle Figure 2.9 shows a fractal shape called Sierpi´nski’s triangle, introduced by Wacław Sier- pi´nski (1882–1969). The triangle is shown at the sixth step of its formation. Starting with a solid equilateral triangle, at the first step the triangle is divided into four equal-size equi- lateral triangles and the middle one is removed. At each subsequent step, this process is repeated on the remaining solid equilateral triangles. The area of the Sierpi´nski triangle is 0. Suppose that the starting equilateral triangle has area 1. At thefirst step,thearea is 3=4 of the original area since one of the four sub-triangles is removed. At each further step, the area is reduced to 3=4 of the previous area. Hence, the area at step k is 3 k ; 4 Â Ã
Figure 2.9. The Sierpi´nski triangle.
i i
i i i “main” — 2011/10/12 — 12:06 — page 21 — #35 i i i
2.9. Squaring Map 21
and this tends to 0 as k tends to infinity. Sierpi´nski’s triangle isn’t one-dimensional or two- dimensional. It has a fractional dimension, called Hausdorff dimension, equal to log 3 1:585 : : : : log 2 D The reason is that Sierpi´nski’s triangle is the union of three copies of itself, each scaled down by a factor of two.
2.9 Squaring Map Define a graph whose vertices are the integers modulo n. For two vertices A and B, draw a directed arrow from vertex A to vertex B if A2 mod n B: D We call this graph the squaring map modulo n. You may want to draw the squaring map for some small values of n, such as 2 n 10. Here is the squaring map modulo 25. Ä Ä
10 7
5 0 20 24 1
15 18
17 23
8 14 4 2
21 16
11 6
12 19 9 3
13 22
The arrows for the vertices that map to themselves, 0 and 1, aren’t shown. There is a directed cycle of length four, namely, 6 11 21 16 6: ! ! ! !
i i
i i i “main” — 2011/10/12 — 12:06 — page 22 — #36 i i i
22 2. Intriguing Images
We call the sets 0 , 1 , and 6; 11; 21; 16 attractors. If we start at a vertex and followthe f g f g f g arrows, we end up in an attractor. If there is a directed path from one vertex to another, we say that the vertices are in the same component of the graph. The squaring map modulo 25 has three components. The squaring map modulo n always has exactly one attractor in each component (exer- cise). Hence, the squaring map modulo n always has at least two components, correspond- ing to the attractors 0 and 1 . It can be shown (more difficult) that the squaring map f g f g modulo n has exactly two components if and only if n is a power of 2 or a Fermat prime. 2j A Fermat prime is a prime of the form Fj 2 1, where j 0. The only known D C Fermat primes are F0 3, F1 5, F2 17, F3 257, and F4 65537. What does the D D D D D squaring map look like when n 17? The graph appears, with a few minor differences, as D a figure earlier in this chapter. Using a computer, can you find the number of components and the size of a largest attractor when n is 1;000;000? For a complete solution to the squaring map problem, see [24].
2.10 Riemann Sphere The Riemann sphere builds on the definition of the complex plane as a representation of complex numbers. It is possible to model the real line and the plane by including a new point that we call . The models are called the extended real line or plane. What do they look like? 1 The extended real line is a circle, since are the same point. Similarly, the extended ˙1 plane is a sphere called the Riemann sphere, named after Bernhard Riemann (1826–1866); see Figure 2.10. Stereographic projection is a bijection between points in the plane and points on the punctured Riemann sphere (with the North Pole removed). The North Pole is identified with . We take the1 Riemann sphere to be a unit sphere centered at .0; 0; 0/. The North Pole is .0; 0; 1/ and the South Pole is .0; 0; 1/. In stereographic projection, a point z x D C yi .x; y; 0/ in the complex plane (which is equivalent to the xy-plane) is mapped to the Á point .x0; y0; z0/ on the sphere so that .0; 0; 1/, .x; y; 0/, and .x0; y0; z0/ are collinear. The origin is mapped to the South Pole; the unit circle in the plane is mapped to the equator; circles centered at the origin of radius greater than (respectively, less than) 1 are mapped to latitudinal circles in the northern (respectively, southern) hemisphere; and lines through the origin are mapped to longitudinal circles. (0, 0, 1)
(,,)x¢ y ¢ z ¢
(x y , , 0)
Figure 2.10. Stereographic projection.
i i
i i i “main” — 2011/10/12 — 12:06 — page 23 — #37 i i i
2.10. Riemann Sphere 23
We define the extended complex plane C to be the complex plane C together with the point at infinity ; that is, C C . Stereographic projection is a correspondence 1 D [ f1g between C and the Riemann sphere. b Let’s find the correspondenceb between .x; y; 0/ and .x0; y0; z0/. The line determined by .0; 0; 1/ andb .x; y; 0/ has parametric form
x0 x; y0 y; z0 1 ; R: D D D 2 Since .x0; y0; z0/ lies on the unit sphere,
.x/2 .y/2 .1 /2 1; C C D or 2.x2 y2 1/ 2 0; C C D a quadratic equation in . One of the roots is 0, which corresponds to the North Pole. D The other is 2 2 : D x2 y2 1 D z 2 1 C C j j C This yields 2 z 2 z z 2 1 x0 < ; y0 = ; z0 j j : D z 2 1 D z 2 1 D z 2 1 j j C j j C j j C In the reverse direction, we obtain from the parametric formulas
x0 y0 x ; y : D 1 z0 D 1 z0 Stereographic projection gives a correspondence between lines and circles in the plane and circles on the sphere. A curve that is either a line or a circle is called a “lircle.” See Figure 2.11. ∞
circle
line
0
Figure 2.11. Lircles on the Riemann sphere.
Let’s prove this. The equation for a lircle is
A.x2 y2/ Bx Cy D 0: C C C C D
i i
i i i “main” — 2011/10/12 — 12:06 — page 24 — #38 i i i
24 2. Intriguing Images
If A 0, then we have a line. The condition that the circle is not degenerate is D 4AD < B2 C 2: C We see this by completing squares. Substitution gives x0 2 y0 2 x0 y0 A B C D 0; 1 z0 C 1 z0 C 1 z0 C 1 z0 C D "Â Ã Â Ã # which simplifies to A.x02 y02/ Bx0.1 z0/ Cy0.1 z0/ D.1 z0/2 0: C C C C D Since x02 y02 z02 1, we have C C D A.1 z02/ Bx0.1 z0/ Cy0.1 z0/ D.1 z0/2 0; C C C D which upon division by 1 z0 yields A.1 z0/ Bx0 Cy0 D.1 z0/ 0; C C C C D the equation of a plane. This is obvious if the lircle is a line. The intersection of a plane and the sphere is a circle. Finally, the condition that the plane intersects the circle is the nondegeneracy condition for lircles. To see this, use the formula for distance from a point to a plane. It is clear that the steps are reversible and hence all circles on the sphere are stereographic images of lircles in the complex plane. A nice property of stereographic projection is that it preserves angles. Suppose that ax C by c 0 and dx ey f 0 are two lines in the complex plane. We know that C D C C D their images under stereographic projection are circles that intersect at the North Pole and another point. The angles of the curves at the intersections are the same (by symmetry), so let us determine the angle of intersection at the North Pole. From the equation for the plane of stereographic projection of a lircle, we see that the stereographic projections of the lines lie on the planes ax0 by0 c.1 z0/ 0 and dx0 ey0 f .1 z0/ 0, C C D C C D respectively. A tangent to a circle lying on a sphere lies in the tangent plane to the sphere at the point of tangency. Hence, tangents to the circles lie in the plane z 1; they are D given by ax0 by0 0, z 1 and dx0 ey0 0, z 1. It is evident from the form of C D D C D D the equations that the angle between the tangent lines is the same as the angle between the original lines. The Riemann sphere has many pleasing properties. Any two lines intersect at .A 1 neighborhood of is a spherical cap on the Riemann sphere; it corresponds, under stere- 1 ographic projection, to the outside of a circle centered at the origin. Thus, any path that moves away from the origin (a ray or spiral, for example) is said to tend to . This is 1 different from the real line, where we distinguishes between and . Another nice C1 1 property of the Riemann sphere is that stereographic projections of the points z and 1=z are antipodal. The symmetries (self-similarities) of the Riemann sphere are the M¨obius functions, also called linear fractional transformations, of the form az b z C ; a; b; c; d C: 7! cz d 2 C
i i
i i i “main” — 2011/10/12 — 12:06 — page 25 — #39 i i i
3 Captivating Formulas
Mathematicians do not study objects, but relations among objects; they are indifferent to the replacement of objects by others as long as the re- lations don’t change. Matter is not important, only form interests them. —HENRI POINCARE´ (1854–1912)
Mathematical formulas, whether simple or complicated, convey in symbols the essence of mathematicians’ discoveries. Some formulas are well known, such as Euler’s formula ei cos i sin . Some are less known.We willlook at a few formulas I find beautiful, D C some stark and some ornate. You may find them beautiful too.
3.1 Arithmetical Wonders Here are three arithmetical curiosities:
123456789 8 9 987654321 C D 123456789 9 10 1111111111 C D 111111111 111111111 12345678987654321: D It is easy to verify their truth, but why do they work? What happens when you do the multiplication?
3.2 Heron’s Formula and Heronian Triangles Heron’s formula, discovered by Heron of Alexandria (c. 10–70), gives the area of a tri- angle in terms of its side lengths. Suppose that a triangle has side lengths a, b, c, and semiperimeter s .a b c/=2. Then the area of the triangleis D C C A s.s a/.s b/.s c/: D p For instance, a triangle with sides 10, 11, and 13 has semiperimeter s 17 and area D p17 7 6 4 2p714: D 25
i i
i i i “main” — 2011/10/12 — 12:06 — page 26 — #40 i i i
26 3. Captivating Formulas
We will prove Heron’s formula. Let vectors a and b represent the sides of lengths a and b. By the determinant formula of Chapter 1, the area of the triangle is 1 A det M ; D 2j j where M is the 2 2 matrix whose rows are a and b. Since the transpose M t of M has the same determinant,
a2 a b 4A2 det M det M t det.MM t / : D D D a b b2 ˇ ˇ ˇ ˇ The third side of the triangle is represented by the vectorˇc a b, andˇ ˇ D ˇ c2 .a b/ .a b/ a2 2a b b2: D D C Solving for a b, we obtain a2 .a2 b2 c2/=2 4A2 C ; D .a2 b2 c2/=2 b2 ˇ ˇ ˇ C ˇ ˇ 2a2 a2 b2 c2 ˇ 16A2 ˇ C ˇ D a2 b2 c2 2b2 ˇ ˇ ˇ C ˇ ˇ4a2b2 .a2 b2 c2/2 ˇ D ˇ C ˇ .2ab a2 b2 c2/.2ab a2 b2 c2/ D C C C ..a b/2 c2/.c2 .a b/2/ D C .a b c/.a b c/.c a b/.c a b/; D C C C C C A2 s.s c/.s b/.s a/; D A s.s a/.s b/.s c/: D A Heronian triangle isp a triangle with rational side lengths and area. An example is the familiar right triangle with sides 3, 4, 5, and area 6. We will give a formula that generates all Heronian triangles. Since the area of a triangle is half of its base times its height, the altitudes of a Heronian triangle are rational. Hence, we may scale a Heronian triangle by a rational factor so that it has an altitude of 2. We will assume that this altitude is to a longest side of the triangle. Thus, the triangle splits into two right triangles, as in the diagram.
y 2 z
w x
i i
i i i “main” — 2011/10/12 — 12:06 — page 27 — #41 i i i
3.2. Heron’s Formula and Heronian Triangles 27
By hypothesis, the lengths w x, y, and z are rational. We will show that w and x are C rational. By the Pythagorean theorem,
w2 4 y2 C D x2 4 z2: C D Subtraction gives .w x/.w x/ y2 z2; C D and hence w x is rational. It follows that .w x/ .w x/ 2w is rational, and thus C C D w and x are rational. From w2 4 y2, we have 4 .y w/.y w/. Set C D D C y w 2p C D 2 y w ; D p where p is a rational number. By the triangle inequality, y w > 2 and so p > 1. Solving C for y and w, we obtain 1 1 w p ; y p ; p > 1: D p D C p This gives rational side lengths for the right triangle on the left in the diagram. The other right triangle has a similar form: 1 1 x q ; z q ; q > 1: D q D C q Allowing for a rational scaling factor of r, every Heronian triangle has side lengths given uniquely, up to an interchange of p and q, by 1 1 1 1 r p ; r q ; r p q ; p;q>1;r>0; C p C q p C q  à  à  à with area 1 1 r 2 p q : p C q  à For instance, the Heronian triangle corresponding to p 7=2, q 13=5, and r 10=19 D D D has side lengths 265 388 4941 ; ; ; 133 287 1729 and area 49410 : 32851 The 3–4–5 right triangle comes from p 2, q 3, r 6=5. D D D Many questions can be asked about Heronian triangles. For example, can we find all Heronian triangles with consecutive integer side lengths? (easy) Are there Heronian trian- gles whose medians are rational numbers? (unsolved) A gem about Heronian triangles is that they can be scaled so that their vertices have integer coordinates in the plane (see [55]).
i i
i i i “main” — 2011/10/12 — 12:06 — page 28 — #42 i i i
28 3. Captivating Formulas
3.3 Sine, Cosine, and Exponential Function Expansions The power series expansions of the sine, cosine, and exponential functions have esthetic appeal. A power series expansion of a function is an infinite series of the form
2 3 4 a0 a1x a2x a3x a4x ; C C C C C
where the an are numbers and x is a variable. How do we find the power series expansion of ex? Assume that
x 2 3 4 e a0 a1x a2x a3x a4x ; D C C C C C for all real numbers x. If we let x 0, then the right side of this expression collapses to 0 D a0, while the left side is e 1. Hence a0 1. Now we know that D D x 2 3 4 e 1 a1x a2x a3x a4x : D C C C C C x x To determine a1, differentiate both sides. As the derivative of e is e , we obtain
x 2 3 e a1 2a2x 3a3x 4a4x : D C C C C
Letting x 0, we have 1 a1, so D D x 2 3 4 e 1 2a2x 3a3x 4a4x 5a5x : D C C C C C Taking another derivative, we obtain
x 2 3 e 2a2 3 2a3x 4 3a4x 5 4a5x : D C C C C
Letting x 0, we have 1 2a2, so a2 1=2. Repeating, we obtain a power series D D D expansion for the exponential function: x2 x3 x4 ex 1 x : D C C 2Š C 3Š C 4Š C The series converges for all real numbers x. In fact, the variable can be any complex number z. Setting x 1, we obtain a formula for e, the base of natural logarithms: D 1 1 1 : e 1 1 2:71828: D C C 2Š C 3Š C 4Š C D If we do the same for sine and cosine, we find that x3 x5 x7 sin x x D 3Š C 5Š 7Š C x2 x4 x6 cos x 1 : D 2Š C 4Š 6Š C Leonhard Euler (1707–1783) observed that the expansion for the exponential function works just as well if x is a complex variable, and if we replace x by i, where i is the imaginary unit (i 2 1), then we have a relation among the exponential, sine, and cosine D functions: ei cos i sin : D C
i i
i i i “main” — 2011/10/12 — 12:06 — page 29 — #43 i i i
3.4. Tangent and Secant Function Expansions 29
Letting yields D ei cos i sin 1; D C D and hence ei 1 0: C D This relation unites five important mathematical constants, , e, i, 1, and 0, in one formula.
3.4 Tangent and Secant Function Expansions We found in the previous section that the power series expansions of sin x and cos x follow a simple pattern. What about the power series expansions of tan x and sec x? They are
2x3 16x5 272x7 7936x9 tan x x D C 3Š C 5Š C 7Š C 9Š C x2 5x4 61x6 1385x8 sec x 1 : D C 2Š C 4Š C 6Š C 8Š C What is the pattern of the sequences 1;2;16;272;7936;::: and 1;1;5;61;1385;::: ? f g f g Suppose that
a x0 a x1 a x2 a x3 tan x 0 1 2 3 D 0Š C 1Š C 2Š C 3Š C b x0 b x1 b x2 b x3 sec x 0 1 2 3 : D 0Š C 1Š C 2Š C 3Š C From the differentiation formula .tan x/0 sec2 x, we obtain D a2 a3 2 a1 x x C 1Š C 2Š C b b b b b b b b b b b2 0 1 1 0 x 0 2 1 1 2 0 x2 : D 0 C 0Š 1Š C 1Š 0Š C 0Š 2Š C 1Š 1Š C 2Š 0Š C Â Ã Â Ã Equating coefficients of like powers of x, we have