October 17, 2013
This set is due Wednesday, October 30, at the beginning of lecture.
[Edit, Oct. 30: The original version of the problem set had some mistakes, and has been replaced accordingly.]
Recall that a set is measure zero iff for all there is a sequence of open intervals such that and .
Similarly, is strong measure zero iff for any sequence of positive reals, there is a sequence of open intervals such that for all , and . The notion is due to Borel, in 1919.
In lecture we showed that the continuous image of a measure zero set does not need to be a set of measure zero, and that the sum of two measure zero sets does not need to be a measure zero set.
As mentioned in lecture, Borel conjectured that the strong measure zero sets are precisely the countable sets. This statement turned out to be independent of the usual axioms of set theory: If the continuum hypothesis is true, the conjecture is false. On the other hand, Laver showed in 1976 that the conjecture is true in some models of set theory.
October 17, 2013
This is a transcript of an exchange on Twitter on what mathematicians and others expect from proofs. (A previous exchange on a different topic is here. Twitter produces surprisingly nice results sometimes. What follows is a bit meandering, but interesting points are made.)
It began at 7:56 am – 27 Jun 13, with the twitter account of Republic of Mathematics (a website started by Gary Davis) quoting from Bill Thurston‘s great essay On proof and progress in mathematics. The quoted sentence was a short excerpt from the following:
The question is not even “How do mathematicians make progress in mathematics?”
Rather, as a more explicit (and leading) form of the question, I prefer “How do mathematicians advance human understanding of mathematics?”
This question brings to the fore something that is fundamental and pervasive: that what we are doing is finding ways for people to understand and think about mathematics.
To this, the account of The True Beauty of Math replied with “[Which is] why computer proofs [are of] little use.” Republic of Mathematics objected to this position, and quoted from an article by Sara Billey titled Computer Proofs. What is the value of computer assisted proofs?. The quoted sentence is an excerpt from:
Some mathematicians have tried to protect their egos by proposing that human proofs are superior to computer assisted proofs. They claim that we don’t learn as much from computer assisted proofs as we do from a human proof. They claim computer proofs can be difficult to verify. They claim computer proofs are less elegant. I find these complaints to be naive.
This was retweeted by Guy Longsworth, which is how I saw it.
Read the rest of this entry »