Archive for March, 2006

Speculation in mathematics

Wednesday, March 29th, 2006

Ronnie Brown, of the University of Wales at Bangor, UK, recently posted some very interesting remarks on mathematical speculation to the categories list. With his permission, I am reposting them here:

“The situation is more complicated in that what could be classed as speculation may get published as theorem and proof. For example, in algebraic topology, sometimes proofs of continuity are omitted as if this was an exercise for the reader, yet the formulation of why the maps are continuous (if they are necessarily so) may contain a key aspect of what should be a complete proof. This difficulty was pointed out to me years ago by Eldon Dyer in relation to results on local fibration implies global fibration (for paracompact spaces) where he and Eilenberg felt Dold’s paper on this contained the first complete proof. I have been unable to complete the proof in Spanier’s book, even the second edition. (I sent a correction to Spanier as the key function in the first edition was not well defined, after Spanier had replied `Isn’t it continuous?’) Eldon speculated (!) that perhaps 50% of published algebraic topology was seriously wrong!

van Kampen’s original 1935 `proof’ of what is called his theorem is incomprehensible today, and maybe was then also.

Efforts to give full details of a major result, i.e. to give a proof, are sometimes derided. Of course credit should be given to the originator of the major steps towards a proof.

Grothendieck’s efforts to develop structures and language which would reduce proofs to a sequence of tautologies are notable here. Colin McLarty’s excellent article on `The rising sea: Grothendieck on simplicity and generality ‘ is relevant.Some scientists snear at the mathematical notion of rigour and of proof. On the other hand many are attracted to math because it can give explanations of why something is true. But `explanations’ need a higher level of structural language than for what might be called proofs.

I can’t resist mentioning that one student questionaire on my first year analysis wrote `Professor Brown puts in too many proofs.’ So I determined to rectify the situation, and next year there were no theorems, and no proofs. However there were lots of statements labelled `FACT’ followed by several paragraphs labelled `EXPLANATION’. This did modify the course because something labelled `explanation’ ought really to explain something! I leave you all to puzzle this out!

In homotopy theory, many matters, such as the homotopy addition lemma, had clear proofs only years after they were well used.Surely much early algebraic topology is speculative, in that the language has not yet been developed to express concepts with rigour so that a clear proof can be written down. It would be a curious ahistorical assumption that there is not at this date another future level of concepts which require a similar speculative approach to reach towards them.”

(Ronnie Brown, posted 2006-03-14 to the categories list).

April Notices

Sunday, March 26th, 2006

The April Notices of the AMS is up. The bulk of the issue is devoted to the centennial of Kurt Goedel’s birth. Sadly, the internet has managed the rather remarkable feat of making me sick of the Incompleteness Theorems, but the issue also has an article about one of my favorite mathematical topics, syzygies, in Roger Wiegand’s article, What is… a syzygy?.

The Only Flame War You’ll Ever Need

Monday, March 20th, 2006

This post on Scott Aaronson’s weblog is every internet discussion thread in microcosm (except for ours, which are shockingly polite by internet standards). Scott thought he was explaining the notion of non-constructive proof to a dense but argumentative student. If you read the comment thread, though, you’ll discover that the “student” thought Scott was some sort of nut who imagined he’d invented a computer more powerful than a Turing machine.

Back from vacation

Sunday, March 19th, 2006

I’m back from vacation. Tragically, my laptop, one that I literally took with me around the world, has died. But my commitment to your mathematical pleasure is so high that I plan on breaking into my neighbors’ houses to use their computers to post to the site.

My way or the highway.

Friday, March 17th, 2006

I have to admit that I have a somewhat dismissive nature sometimes, and have been known to make critical remarks for non-public consumption; “Programmers cannot do math at ALL” (hi Dale!) Of course, this is more out of shock than a belief in any natural order. I firmly believe that anyone of everyday intelligence can learn math. I am of the opinion that I could teach calculus* to a dead twig if the twig where sufficiently motivated.

Which is why I was happy to see that someone had written a blog entry on learning math being what you make of it. The only thing I would criticize is that he is completely wrong.

Ok..just kidding, but I do have to say that I would not follow his councel on exercises. When I read a GTM on a new subject (papers don’t usually have many exercises :), I don’t really view the problem sets as seperate from the explanitory text - I do every single problem. This is because the author of the text did not view the problem sets as seperate either. It goes beyond “having been shown the idea, cement it in your mind with the excercises”. Most of the time, realizations that the author wants you to have are set up in the problem sets because they would be TOO padantic and verbose in the main text.

*This isn’t restricted to calculus of course.

Enigma Machines

Friday, March 17th, 2006

The Enigma machine was a mechanical encoding/decoding device used by the German military in WWII and which the British were able to successfully crack on occasion. It is now possible to purchase a Do-it-yourself Enigma machine and even a paper-version of one.

Popular Math

Thursday, March 16th, 2006

The mathematicians Ron Brown and Tim Porter, at the University of Wales in Bangor, UK, have long been at the forefront of mathematics popularization in Britain. (This is in addition to their very valuable contributions to algebraic topology, category theory and theoretical computer science!) Their web-pages include a page of articles and links about popular mathematics, reasons for studying math, the teaching of math, etc.

Week 227

Wednesday, March 15th, 2006

More logic can be found in John Baez’s latest This Week’s Finds in Mathematical Physics (no. 227), along with pictures of Martian sand-dunes.

Knowing what you don’t know is hard

Tuesday, March 14th, 2006

Epistemic modal logic was invented by Finnish philosopher Jaako Hintikka to represent knowledge and belief (in a book published in 1962), and is now used by computer scientists to model and design systems of autonomous software agents. It uses modal operators to indicate which propositions are known to which agents.

A common modal system for beliefs is C. I. Lewis‘ system S5, which (among other axioms) assumes that agents know what it is they know (positive introspection) and know what it is that they don’t know (negative introspection). (In other words, if an agent does not know whether or not some proposition is true, then the agent knows that he does not know whether or not that proposition is true). These are quite strong assumptions, and have been criticized as being unrealistic. Two computer scientists, Joseph Halpern and Leandro Chaves Rego, have now identified negative introspection as the axiom which makes the satisfiability problem for S5 NP-complete.

As an aside, discussion of positive and negative introspection by epistemic logicians meant that they fully understood Donald Rumsfeld’s statements about known unknowns vs. unknown unknowns.

In Our Time

Friday, March 10th, 2006

Over at the BBC, Melvyn Bragg presents a weekly radio programme called In Our Time in which are discussed a wide variety of subjects ranging from art and philosophy to politics and drama. Surprisingly, considering the wide range of human culture covered, Bragg devotes a good proportion of episodes to mathematics. He’s just presented a programme on the Negative Numbers and recently presented one on Prime Numbers. If you dig into the science archives you’ll find recordings of programmes on Zero, Infinity, π, Chaos Theory and Renaissance Mathematics. Some of these are conveniently available as podcasts.

(Note that some of the comments about the mathematical topics on the In Our Time website are a little inaccurate, eg. “a team of researchers…calculated the highest prime number”, but the actual guests on these shows are generally mathematicians or historians of mathematics who know what they are talking about.)