A true continuum is simply something connected in itself and cannot be split into separate pieces; that contradicts its true nature.

I find this line of reasoning completely unconvincing as motivation for allowing the reals to have nilpotent infinitesimals. I can grant, for the sake of argument, that maybe its unnatural that our model of the line can be split cleanly into two or more parts, but to me this is an argument for constructivism, not infinitesimals.

The math librarian at Drexel University, Peggy Dominy, has a blog. Most of the posts are about acquisitions by Drexel’s library, but some are about new public math resources. For example, from this post I learned that the Hiroshima Mathematical Journal is now open access.

Via God Plays Dice.

This is of course the Sierpinski carpet. What’s interesting to me is that many objects that, in a previous age dominated by a picture of the physical world as a continuum, seemed deeply pathological, have straightforward computer-language descriptions. For example, you can check whether or not a point in the plane is on the Sierpinksi plane by looking at the ternary expansion of its coordinates, which is a couple of lines of computer code. From the point of view of the computer, the Sierpinksi carpet is not much more complicated than a parabola. I suspect that the popularity of fractals marks a change in the popular imagination of the dominant metaphor for mathematics, from mathematics as mechanics to mathematics as computer program.

Thompson is most famous for his work on the Feit-Thompson theorem, that every group of odd order is solvable. Solvable groups resemble upper triangular matrices: a solvable group is constructed in layers out of abelian groups.

Tits invented the notion of BN pairs and buildings. The opposite of a solvable group is a simple group, which cannot be split up into layers. Simple groups tend to resemble the set of all invertible n-by-n matrices over a field (which itself is not simple, but is pretty close to it). Tits identified the key property that makes the resemblence work: the existence of special subgroups B and N. For the group of invertible matrices, B is the set of upper-triangular matrices, while N is the set of permutation matrices. Buildings are a geometric explanation of BN pairs.

The style of my own proofs tends towards alternating sentences that begin with “Let” and sentences that begin with “Thus”.

The Schwartz-Christoffel mapping an explicit mapping from the inside of a polygon to the unit disk that is conformal: it preserves angles (it does usually preserve straight lines). The recent work extends this to give conformal mappings from polygonal regions with polygonal holes to circular regions with circular holes. It was known before this that you couldn’t necessarily map any polygon region with holes to any circular region with holes while preserving angles. The two regions must share the same moduli, which are a sets of numbers you can associate with a region. (These moduli are related to the moduli that arise in the theory of Riemann surfaces.)

The breakthrough is not showing that a conformal map exists when the moduli agree, but giving an explicit means of calculating it. The result is not as explicit as the original Schwartz-Christoffel result, but can be calculated numerically.

When Scoop Jackson was in Congress, a running joke was that he was the Senator from Boeing, abbreviated Jackson (D-Boeing). Now, Congress has an honest-to-God Representative from Fermilab. Bill Foster , a physicist who worked at Fermilab for 22 years, ran in the special election to fill Dennis Hastert’s seat in Congress, and won. The Chicago-area district includes the laboratory. Foster (D-Fermilab) will fill out the remainder of Hastert’s term, which only lasts until November, at which point he will be up for reelection.

Let (,) be an inner product. From the definition, we know that for two vectors x, y and two scalars a, b that

(ax+by, ax+by) = a² (x,x) + 2ab (x,y) + b² (y,y) ≥ 0

This is a positive-definite quadratic form in a, b, which means that its associated matrix has positive determinant:

(x,x) (y,y) - (x,y) (x,y) ≥ 0,

which is the result.

The real advantage of the proof, I suppose, is that if you already have the linear algebra background there’s no trick involved. It also means that using the same determinant argument there are analogues of the inequality that involve n vectors instead of two.