In this post I’d like to illustrate how one can use infinite games to prove theorems about the real numbers. I’ll begin with a game-theoretic proof that the set of real numbers is uncountable, following the exposition in this paper of mine. This will lead us somewhat unexpectedly into the realm of descriptive set theory, where we will discuss how games are used in cutting-edge explorations of the Axiom of Choice, the Continuum Hypothesis, and the foundations of second-order arithmetic. In a sequel post I will discuss how infinite games can be used to study Diophantine approximation, with applications to complex dynamics.
Countable versus uncountable infinities
When my daughter was 5 years old, she asked me if there is just one infinity. I proudly kissed her on the forehead and told her what an excellent question that was. I told her no, infinity comes in many different flavors. I pretty much left it at that, but since she’s 10 now, here are some more details for her. (The reader familiar with the basics of set theory can move on to the next section.) Continue reading
I am very sad to report that my Ph.D. advisor, Robert Coleman, died last night in his sleep at the age of 59. His loving wife Tessa called me this afternoon with the heartbreaking news. Robert was a startlingly original and creative mathematician who has had a profound influence on modern number theory and arithmetic geometry. He was an inspiration to me and many others and will be dearly missed.
Robert and Bishop in Paris
Robert was born on November 22, 1954 and earned a mathematics degree from Harvard University. He subsequently completed Part III of the mathematical tripos at Cambridge, where he worked with John Coates and made important contributions to local class field theory. By the time he entered graduate school at Princeton, Robert had essentially already written his doctoral dissertation, but his formal thesis advisor was Kenkichi Iwasawa. He began teaching at UC Berkeley in 1983 and was a recipient of a MacArthur “Genius” Fellowship in 1987. Robert published 63 papers, including 8 papers in the prestigious journal Inventiones Mathematicae and 5 in the Duke Mathematical Journal. He had an amazing intuition for everything p-adic. Long before the invention of Berkovich spaces, Robert could somehow visualize paths and structures in p-adic geometry which no one else in the world saw as keenly or as profoundly. I rarely saw him reading papers or books. He seemed to figure out whatever he needed to know almost from scratch, which often made his papers quite difficult to read but this went hand in hand with his brilliance and originality.
When I was a graduate student at Berkeley, Robert hosted an invitation-only wine and cheese gathering in his office every Friday afternoon code-named “Potatoes”. Among the regular attendees were Loïc Merel and Kevin Buzzard, who were postdocs at the time. It was a wonderful tradition. In the summer of 1997, while I was still a graduate student, Robert invited me to accompany him for three weeks in Paris to a workshop on p-adic Cohomology at the Institut Henri Poincare. That was the first time I met luminaries like Faltings, Fontaine, and Mazur. Since the workshop was (a) totally in French and (b) on a topic I knew almost nothing about, I was in completely over my head. But I fell in love with Paris (which I’ve since returned to many times) and my best memories from that trip are of dining with Robert and seeing the city with him.
The trip also taught me to appreciate the significant challenges which Robert, who had Multiple Sclerosis, bravely faced every day. I remember helping Robert check into his hotel room near the Luxembourg Gardens, only to find out that his wheelchair did not fit in the elevator. We had to find another hotel room for him, which was not so easy given the level of our French! Curbs were a constant challenge for Robert, as finding on- and off- ramps for wheelchairs in Paris was like trying to get a vegan meal in rural Arkansas.
This past weekend I had the privilege to speak at the Southern California Number Theory Day along with Manjul Bhargava, Elena Fuchs, and Chris Skinner. Manjul and Chris spoke about a series of remarkable results which, when combined, prove that at least 66.48% of elliptic curves over satisfy the (rank part of the) Birch and Swinnerton-Dyer (BSD) Conjecture (and have finite Shafarevich-Tate group). Bhargava’s work with Arul Shankar also proves that at least 20.6% of elliptic curves over have rank 0, at least 83.75% have rank at most 1, and the average rank is at most 0.885. Conjecturally, 50% of elliptic curves have rank 0, 50% have rank 1, and 0% have rank bigger than 1, and thus the average rank should be 0.5. (And conjecturally, 100% of elliptic curves satisfy the BSD conjecture. :)) Before the work of Bhargava-Shankar and Bhargava-Skinner (which makes use of recent results of Skinner-Urban. Wei Zhang, and the Dokchitser brothers among others), the best known unconditional results in this direction were that at least 0% of elliptic curves have rank 0, at least 0% have rank 1, the average rank is at most infinity, and at least 0% of curves satisfy the BSD conjecture.
I will attempt to briefly summarize some of the main ideas from their talks; see these papers by Bhargava-Skinner and Bhargava-Shankar for more details and references. (The paper of Bhargava, Skinner, and Wei Zhang showing 66.48% is forthcoming. [Note added 7/8/14: that paper has now appeared at http://arxiv.org/abs/1407.1826.]) Continue reading
In this post I’ll talk about another favorite recreational math puzzle, the (in)famous “Pentagon Problem”. First, though, I wanted to provide a solution to the Ghost Bugs problem from my last blog post. The puzzle is the following:
You are given four lines in a plane in general position (no two parallel, no three intersecting in a common point). On each line a ghost bug crawls at some constant velocity (possibly different for each bug). Being ghosts, if two bugs happen to cross paths they just continue crawling through each other uninterrupted. Suppose that five of the possible six meetings actually happen. Prove that the sixth does as well.
Here is the promised solution. The idea (like in Einstein’s theory of general relativity) is to add an extra dimension corresponding to time. We thus lift the problem out of the page and replace the four lines by the graph of the bugs’ positions as a function of time. Since each bug travels at a constant speed, each of the four resulting graphs is a straight line. By construction, two lines and intersect if and only if the corresponding bugs cross paths.
Suppose that every pair of bugs cross paths except possibly for bugs 3 and 4. Then the lines each intersect one another (in distinct points) and therefore they lie in a common plane. Since line intersects lines and in distinct points, it must lie in the same plane. The line cannot be parallel to , since their projections to the page (corresponding to forgetting the time dimension) intersect. Thus and must intersect, which means that bugs 3 and 4 do indeed cross paths.
Cool, huh? As I mentioned in my last post, I can still vividly remember how I felt in the AHA! moment when I discovered this solution more than 15 years ago.
I just moved into a new house and haven’t had time to blog much lately. But I did want to advertise my friend Manya Raman-Sundström’s upcoming Workshop on Beauty and Explanation in Mathematics at Umeå University in Sweden: http://mathbeauty.wordpress.com/wbem/
The list of invited speakers includes Hendrik Lenstra, one of my graduate school teachers. (If you haven’t see it before, you should check out Lenstra’s lovely short article Profinite Fibonacci Numbers.) Continue reading
In this post, I’d like to sketch some of the interesting results contained in my Ph.D. student Spencer Backman’s new paper “Riemann-Roch theory for graph orientations”.
First, a bit of background. In a 2007 paper, Emeric Gioan introduced the cycle-cocycle reversal system on a (finite, connected, unoriented) graph G, which is a certain natural equivalence relation on the set of orientations of G. Recall that an orientation of G is the choice of a direction for each edge. A cycle flip on an orientation consists of reversing all the edges in a directed cycle in . Similarly, a cocycle flip consists of reversing all the edges in a directed cocycle in , where a directed cocycle (also called a directed cut) is the collection of all oriented edges connecting a subset of vertices of G to its complement. The cycle-cocycle reversal system is the equivalence relation on the set of orientations of G generated by all cycle and cocycle flips. In his paper, Gioan proves (via a deletion-contraction recursion) the surprising fact that the number of equivalence classes equals the number of spanning trees in G. A bijective proof of this result was subsequently obtained by Bernardi. Continue reading
In an earlier post, I described a graph-theoretic analogue of the Riemann-Roch theorem and some of its applications. In this post, I’d like to discuss a proof of that theorem which is a bit more streamlined than the one which Norine and I gave in our original paper [BN]. Like our original proof, the one we’ll give here is based on the concept of reduced divisors. Continue reading
This is a sequel to last week’s blog post “Two applications of finite fields to computational number theory“. The main reason I decided to write a follow-up is that I’ve learned a lot about Concluding Observations #1 and #6 from that post during the last week. In Observation #1, I mentioned without further comment a recursive procedure for computing square roots modulo a prime; it turns out that this procedure is essentially equivalent to Cipolla’s algorithm, but was discovered independently by Lehmer (who it seems did not know about Cipolla’s work). I learned this from the wonderful book “Édouard Lucas and Primality Testing” by Hugh C. Williams, which I highly recommend to anyone interested in the history of mathematics. In explaining the connection between the algorithms of Cipolla and Lehmer, I’ll make a digression into the general theory of Lucas sequences, which I had some vague knowledge of before but which I’ve learned a lot about in the last week from reading Williams’ book. In Observation #6, I asked if there was a conceptual explanation for the fact that the Chebyshev polynomial shows up in the Lucas-Lehmer test; Greg Kuperberg sent me just such an explanation and I will expand on his comments below. Continue reading
In this post I’d like to discuss how finite fields (and more generally finite rings) can be used to study two fundamental computational problems in number theory: computing square roots modulo a prime and proving primality for Mersenne numbers. The corresponding algorithms (Cipolla’s algorithm and the Lucas-Lehmer test) are often omitted from undergraduate-level number theory courses because they appear, at first glance, to be relatively sophisticated. This is a shame because these algorithms are really marvelous — not to mention useful — and I think they’re more accessible than most people realize. I’ll attempt to describe these two algorithms assuming only a standard first-semester course in elementary number theory and familiarity with complex numbers, without assuming any background in abstract algebra. These algorithms could also be used in a first-semester abstract algebra course to help motivate the practical utility of concepts like rings and fields.
In researching this blog post on Wikipedia, I learned a couple of interesting historical tidbits that I’d like to share before getting on with the math.
The French mathematician Edouard Lucas (of Lucas sequence fame) showed in 1876 that the 39-digit Mersenne number is prime. This stood for 75 years as the largest known prime. Lucas also invented (or at least popularized) the Tower of Hanoi puzzle and published the first description of the Dots and Boxes game. He died in quite an unusual way: apparently a waiter at a banquet dropped what he was carrying and a piece of broken plate cut Lucas on the cheek. Lucas developed a severe skin inflammation and died a few days later at age 47.
Derrick Henry Lehmer was a long-time professor of mathematics at U.C. Berkeley. In 1950, Lehmer was one of 31 University of California faculty members fired for refusing to sign a loyalty oath during the McCarthy era. In 1952, the California Supreme Court declared the oath unconstitutional, and Lehmer returned to Berkeley shortly thereafter. Lehmer also built a number of fascinating mechanical sieve machines designed to factor large numbers. Continue reading
This morning I attended Martin Hellman’s stimulating keynote address at the 2013 Georgia Tech Cyber Security Summit. Martin Hellman is the co-inventor, with Whitfield Diffie, of the Diffie-Hellman Key Exchange Protocol, which began the (public) public-key cryptography revolution. Among the interesting things I learned during Martin Hellman’s talk are:
1. Hellman feels that Ralph Merkle deserves equal credit for inventing public-key cryptography and refers to his own invention as the Diffie-Hellman-Merkle key exchange protocol. (Merkle was the director of the Georgia Tech Information Security Center from 2003-2006.)
2. Hellman came up with the famous “double padlock” thought experiment after the invention of the Diffie-Hellman-Merkle key exchange protocol, as a way to explain it to others. The mathematics came first. (I had always wondered about this.)
3. Most interestingly, Hellman said that he got the idea to use modular exponentiation/discrete logarithms as a “one-way function” from the engineer and mathematician John Gill (who I never heard of before this morning). John Gill’s other suggestion was to use multiplication/factoring, which forms the basis of RSA! It’s all the more amazing that I’ve never heard of John Gill because he earned his bachelor’s degree in Applied Mathematics from Georgia Tech (where I now teach) and his Ph.D. in Mathematics from U.C. Berkeley (where I got my Ph.D.)! Hellman also recounted a conversation in which Gill (who is African-American) mentioned having encountered very little racial intolerance during his undergraduate studies in the 1960′s — apparently Georgia Tech was (relatively speaking) an oasis of tolerance among southern universities during that time.
Now on to the mathematical part of this post, which is an unusual proof of the existence of primitive roots modulo primes which I came up with recently while preparing a lecture for my course on Number Theory and Cryptography. The proof is much less elementary than every other proof I’ve seen, but I would argue that it nevertheless has some merit. Continue reading
I plan to write several posts related to the Riemann-Roch Theorem for Graphs, which was published several years ago in this paper written jointly with Serguei Norine. In this post I want to explain the statement of the theorem, give some anecdotal background, and mention a few applications which have been discovered in recent years.
The Riemann-Roch Theorem
The (classical) Riemann-Roch Theorem is a very useful result about analytic functions on compact one-dimensional complex manifolds (also known as Riemann surfaces). Given a set of constraints on the orders of zeros and poles, the Riemann-Roch Theorem computes the dimension of the space of analytic functions satisfying those constraints. More precisely, if denotes the set of constraints and is the dimension of the space of analytic functions satisfying those constraints, then the Riemann-Roch theorem asserts that
where is the genus (“number of holes”) of the Riemann surface , is the total number of constraints, and is the “canonical divisor” on . See the Wikipedia page for much more information.
Before formulating the combinatorial analogue of this result which Norine and I discovered, I want to briefly reminisce about how this result came about. In the summer of 2006, my Georgia Tech REU (Research Experience for Undergraduates) student Dragos Ilas worked on a graph-theoretic conjecture which I had made some time earlier. Dragos spent eight weeks working on the problem and compiled a lot of experimental evidence toward my conjecture. He gave a talk about the problem one Friday toward the end of the summer in an REU Mini-Conference that I was organizing at Georgia Tech. Serguei Norine (then a postdoc working with my colleague Robin Thomas) was in the audience. On Monday morning, Serguei knocked on my office door and showed me an extremely clever proof of my conjecture. I told Serguei about my real goal, which was to prove a graph-theoretic analogue of the Riemann-Roch theorem. I outlined what I had in mind and within a week, we had exactly the kind of Riemann-Roch formula that I had hoped for… thanks in large part to Serguei’s amazing combinatorial mind! Continue reading