# John Nash and the theory of games

John Forbes Nash and his wife Alicia were tragically killed in a car crash on May 23, having just returned from a ceremony in Norway where John Nash received the prestigious Abel Prize in Mathematics (which, along with the Fields Medal, is the closest thing mathematics has to a Nobel Prize). Nash’s long struggle with mental illness, as well as his miraculous recovery, are depicted vividly in Sylvia Nasar’s book “A Beautiful Mind” and the Oscar-winning film which it inspired. In this post, I want to give a brief account of Nash’s work in game theory, for which he won the 1994 Nobel Prize in Economics. Before doing that, I should mention, however, that while this is undoubtedly Nash’s most influential work, he did many other things which from a purely mathematical point of view are much more technically difficult. Nash’s Abel Prize, for example (which he shared with Louis Nirenberg), was for his work in non-linear partial differential equations and its applications to geometric analysis, which most mathematicians consider to be Nash’s deepest contribution to mathematics. You can read about that work here. Continue reading

# Real Numbers and Infinite Games, Part II

In my last post, I wrote about two infinite games whose analysis leads to interesting questions about subsets of the real numbers.  In this post, I will talk about two more infinite games, one related to the Baire Category Theorem and one to Diophantine approximation.  I’ll then talk about the role which such Diophantine approximation questions play in the theory of dynamical systems.

The Choquet game and the Baire Category Theorem

The Cantor game from Part I of this post can be used to prove that every perfect subset of ${\mathbf R}$ is uncountable.  There is a similar game which can be used to prove the Baire Category Theorem.  Let $X$ be a metric space.   In Choquet’s game, Alice moves first by choosing a non-empty open set $U_1$ in $X$.  Then Bob moves by choosing a non-empty open set $V_1 \subseteq U_1$.  Alice then chooses a non-empty open set $U_2 \subseteq V_1$, and so on, yielding two decreasing sequences $U_n$ and $V_n$ of non-empty open sets with $U_n \supseteq V_n \supseteq U_{n+1}$ for all $n$.  Note that $\bigcap U_n = \bigcap V_n$; we denote this set by $U$.  Alice wins if $U$ is empty, and Bob wins if $U$ is non-empty. Continue reading