It seems to appear that I have somehow managed to pass the 100,000 score milestone for reputation on MathOverflow. A hundred kiloreps! Does this qualify me for micro-celebrity status? I have clearly been spending an inordinate amount of time on MO… Truly, it has been a great time.

MathOverflow, an eternal fountain of mathematics, overflows with fascinating questions and answers on every imaginable mathematical topic, drawing unforeseen connections, seeking generalizations, clarification, or illustrative examples, questioning assumptions, or simply asking for an explanation of a subtle mathematical point. The mathematics is sophisticated and compelling. How could a mathematician not immediately plunge in?

I first joined MathOverflow in November 2009, when my colleague-down-the-hall Kevin O’Bryant dropped into my office and showed me the site. He said that it was for “people like us,” research mathematicians who wanted to discuss mathematical issues with other professionals, and he was completely right. Looking at the site, I found Greg Kuperberg’s answer to a question on the automorphism tower problem in group theory, which was one of the first extremely popular questions at that time, the top-rated question. I was hooked immediately, and I told Kevin on that very first day that it was clear that MathOverflow was going to take a lot of time.

I was pleased to find right from the beginning that, although there were not yet many logicians participating on MO, there were nevertheless many logic questions, revealing an unexpectedly broad interest in math logic issues amongst the general mathematical community. I found questions about definability, computability, undecidability, logical independence, about the continuum hypothesis and the axiom of choice and about large cardinals, asked by mathematicians in diverse research areas, who seemed earnestly to want to know the answer. How pleased I was to find such a level of interest in the same issues that fascinated me; and how pleased I was also to find that I was often able to answer.

In the early days, I may have felt a little that I should be a kind of ambassador for logic, introducing the subject or aspects of it to those who might not know all about it yet; for example, in a few answers I explained and introduced the topic of cardinal characteristics of the continuum and the subject of Borel equivalence relation theory, since I had felt that mathematicians outside logic might not necessarily know much about it, even when it offered connections to things they did know about. I probably wouldn’t necessarily answer the same way today, now that MO has many experts in those subjects and a robust logic community. What a pleasure it has become.

A while back I wrote a post The use and value of MathOverflow in response to an inquiry of François Dorais, and I find the remarks I made then are as true for me today as ever.

I feel that mathoverflow has enlarged me as a mathematician. I have learned a huge amount here in the past few years, particularly concerning how my subject relates to other parts of mathematics. I’ve read some really great answers that opened up new perspectives for me. But just as importantly, I’ve learned a lot when coming up with my own answers. It often happens that someone asks a question in another part of mathematics that I can see at bottom has to do with how something I know about relates to their area, and so in order to answer, I must learn enough about this other subject in order to see the connection through. How fulfilling it is when a question that is originally opaque to me, because I hadn’t known enough about this other topic, becomes clear enough for me to have an answer. Meanwhile, mathoverflow has also helped me to solidify my knowledge of my own research area, often through the exercise of writing up a clear summary account of a familiar mathematical issue or by thinking about issues arising in a question concerning confusing or difficult aspects of a familiar tool or method.

Mathoverflow has also taught me a lot about good mathematical exposition, both by the example of other’s high quality writing and by the immediate feedback we all get on our posts. This feedback reveals what kind of mathematical explanation is valued by the general mathematical community, in a direct way that one does not usually get so well when writing a paper or giving a conference talk. This kind of knowledge has helped me to improve my mathematical writing in general.

Thanks very much again, MathOverflow! I am grateful.

A few posts come to mind:

- My highest-voted answer is to the question What are some reasonable-sounding statements that are independent of ZFC?, a very early question on MO asked by Anton Geraschenko, the founder of MathOverflow. In my answer, I explained that the the implication $\kappa<\lambda\implies 2^\kappa<2^\lambda$ is independent of ZFC. I have become fascinated by the reception of this answer, which surprised me, and I now often mention it in talks on the philosophy of set theory, for it provides an example of a principle that is (1) extremely appealing to non-set-theorists; (2) affirms many pre-theoretic expectations that one might have for a concept of “size” in mathematics; (3) known to be consistent with the axioms of set theory; and yet (4) almost universally rejected by set-theorists when it is proposed as a fundamental principle. So it provides a counterpoint to what might seem otherwise to be a reasonable philosophical position, that the first three properties would be grounds for general acceptance.
- My very first question, Does every set admit a rigid binary relation? led to a paper by Justin Palumbo and myself, where we introduce the rigid relation principle, which asserts that indeed every set has a rigid binary relation, and which, we prove, is neither provable in ZF without the axiom of choice nor is it equivalent to the axiom of choice. Thus, it is a new weak choice principle.
- There was a fascinating flock of questions on the topic of infinite chess, including especially Johan Wästlund’s question Checkmate in $\omega$ moves? and Richard Stanley’s question on the decidability of infinite chess, which I pondered for some time. Eventually, Philipp Schlicht and I proved that The mate-in-$n$ problem of infinite chess is decidable, and Cory Evans and I discovered very high Transfinite game values in infinite chess, finding new finite positions with value $\omega$, infinite positions with values up to $\omega^3$, and proving that the omega one of 3D infinite chess is true $\omega_1$.
- I became truly obsessed with Ewan Delanoy’s question, who asked for an easy way to see that the countable models of set theory were not linearly ordered by embeddability (on our companion site math.stackexchange). After having worked furiously on the problem, I finally discovered to my astonishment, contrary to all our initial expectations, that this collection of models actually was linearly ordered after all! This work led directly to my theorem showing that every countable model of set theory is isomorphic to a submodel of its own constructible universe, and to a question, Can there can be an embedding $j:V\to L$ from the set-theoretic universe $V$ into the constructible universe $L$, when $V\neq L$?, which remains open.
- Cole Leahy’s extremely interesting question on Pointwise algebraic models of set theory led to our joint paper on Algebraicity and implicit definability in set theory, and to further open questions on Imp, the inner model of implicitly constructible sets.

There have been so many more great questions and posts. If you are inclined, feel free to post comments below linking to your favorite MO posts!

Concerning the MO reputation system, I suppose some might suspect me of harboring unnatural thoughts on reputation — after all, I once proposed (I can’t find the link now) that the sole basis of tenure and promotion decisions for mathematics faculty, as well as choice of premium office space, should be: MO reputation, ha! — but in truth, I look upon it all as a good silly game. One may take reputation as seriously as one takes any game seriously, and many mathematicians can indeed take a game seriously. My honest opinion is that the reputation and badge system is an ingenious piece of social engineering. The designers must have had a good grasp on human psychology, an understanding of the kinds of reasons that might motivate a person to participate in such a site; one thinks, for example, of the intermittent reward theory. I find it really amazing what the stackexchange designers have created, and who doesn’t love a good game?

Announcement on History of MathOverflow

Congratulations, Joel! I have learned (and continue to learn) a great deal of set theory from your MO answers over the years! MO is an invaluable educational/research promoting tool and everyone should be encouraged to participate in it. I still remember being amazed last year, when I finally dared to ask my first questions, at getting answers from famous logicians. It was such a wonderful experience. Recently, I asked a question and got an answer from Asaf Karagila that clearly took a great deal of effort to put together. I am very thankful to people like you, Asaf, and many others who are willing to devote their time and effort to MO, making it into the amazing crowd-sourcing grand mathematical project that it is.

Oh, yes, I’ve had the same experience asking questions on MO, getting attention from people I didn’t expect at all, sometimes famous people, who had something interesting to contribute. Also, I have been impressed by several graduate students and young mathematicians, who really know something and how to explain it!

Congratulations Joel! I always like reading your thoughtful and detailed answers, questions, and comments on MathOverflow.

Thanks, Erin, I’m glad to hear it.

Congratulations, Joel!

Quite an achievement, representing a huge contribution to MathOverflow and to mathematical exposition more generally.

Thank you very much, Scott.

Congratulations, Joel. Your question Can we unify addition and multiplication into one binary operation? To what extent can we find universal binary operations? made me change my major from Computer Science to Pure Math, a decision I have yet to regret. Although my mathematical interests have changed since then, I feel that said question examplifies what attracts me to mathematics; thorough analysis of seemingly simple concepts. (Of course, this is not always the case in math, but I find it particularly beautiful when it is.) I am still too ignorant to engage actively in MO, but math.SE serves as an excellent alternative for non-experts.

Thank you for your many interesting questions, I hope that I’ll be able to fully appreciate all of them.

I am so glad to hear that you were inspired by that question! I also often find myself fascinated by simple-to-state mathematical questions, which offer an unexpected or puzzling phenomenon. And how fulfilling it is when one finally comes to understand a solution!

Those are some insane eyebrows. Keep them up!

Love,

Cathy

I’ll keep them up for you, Math Babe!

Congratulations on you first $10^5$ + something rep points, Professor Hamkins!

P.S. IMHO, the independence of the implication $\lambda < \kappa \Rightarrow 2^{\lambda} < 2^{\kappa}$ is TRULY a mind-blowing fact! Would you be so kind as to let me know where I can find more details about it?

Thanks very much for your congratulations.

The independence of that statement comes out of Paul Cohen’s proof of the independence of the continuum hypothesis using forcing, since Cohen produced a model where $2^\omega=2^{\omega_1}$, a statement known as Luzin’s hypothesis, which Luzin had proposed as an alternative to the continuum hypothesis. There are many accounts of Cohen’s work that are available, and this proof appears in any introductory graduate set theory text, such as Thomas Jech’s book Set Theory.

My congratulations too.

I hope you will catch 200k rep as soon as possible.

Thanks very much!