# April Fool

* Non-jokes on April Fool’s Day *

Nun’s Priest’s Tale source |

Faadosly Polir is the older brother of Lofa Polir. You may recall he invented new ways to apply powerful mathematical techniques to prove trivial theorems, and she once claimed a great result on integer factoring. We have heard from both since, but they haven’t given us any new April Fool’s Day material, mainly because they weren’t fooling to begin with.

Today Ken and I wished to help you enjoy April Fool’s day.

We usually try to have fun on this day, but this year we have no idea that seems to be funny. We considered fooling that some university had created a faculty line for a computer mathematician. We’ve considered making light of some recent data on theory and rankings, but it’s high noon of hiring season hence serious. Chess cheating jokes?—no, Ken has been dealing with more cases at once than ever before. Even our recent shout-out to co-pilots has been overcome by events beyond our ability to give other than condolences. Nor were we able to create a phony result to celebrate this day—because *good* phony results still require much research effort. We thought about re-running an old April Fool discussion, as something easy while lots of other stuff is happening. But we are committed to give you, our readers, your money’s worth. So we rejected the re-run idea.

April Fool’s Day itself may have begun because of a typographical error. Reading between the lines of Wikipedia’s account, Geoffrey Chaucer may have intended to write “Since March be gone, thirty days and two” in order to place the events of “The Nun’s Priest’s Tale” on the May 2 anniversary of a royal engagement. The text in surviving copies of his *Canterbury Tales* reads, however, “Since March began, thirty days and two”—placing on April 1 the action in which the proud rooster Chanticleer is tricked by a fox.

## So…

So since we ran out of ideas we decided to give up on April fooling and list results that sound like April Fool jokes, but are actually true. We hope this is still fun, interesting, and informative.

*Smale’s Paradox*:

Stephen Smale proved in 1958 that there is a regular homotopy between the standard immersion of the sphere in 3-space and , which represents the sphere being turned inside-out. He proved this indirectly, by showing that there was only one homotopy class for a category that includes and , by virtue of both causing the corresponding homotopy group in the Stiefel manifold to vanish. When faced with this particular example, Smale’s graduate adviser, Raoul Bott, retorted that the result was “obviously wrong.” The resulting **eversion** of the sphere—a process of turning it inside out differentiably continuously (allowing self-intersection but not creasing)—was first visualized concretely by Arthur Shapiro in consultation with others including Bernard Morin, who has been blind since childhood. An animation is included in Vladimir Bulatov’s gallery of geometrical VRML movies.

*Nikodym Set*:

A Nikodym set, named for Otto Nikodym who powerfully extended a theorem by Johan Radon in measure theory, is a set of points in the unit square such that:

- For every point , there is a straight line that goes through no other point in but , and yet:
- The Lebesgue measure of is .

This is not like the Banach-Tarski paradox involving tricks with non-measurable sets: everything works nicely according to Hoyle or at least according to Henri Lebesgue.

*Needle Sets*:

A needle embedded in a circular disk of diameter 1 can be rotated continuously and snugly by 180 degrees within the disk. The same needle can also be inverted by rotating it inside a deltoid curve whose three points poke somewhat outside the circle but has smaller overall area. How small can a shape allowing the needle to rotate be? Soichi Kakeya raised the question and Abram Besicovitch answered it by showing that its Lebesgue measure can be as close to zero as desired. Moreover, if we only require that the needle can be placed pointing in any direction, without the continuous rotation, the measure can be zero. Then it supplements the Nikodym set. Zeev Dvir has written a nice survey connecting conjectured properties of analogous sets in higher dimensions to constructions over finite fields that relate to randomness extractors.

*Potato Paradox*:

Let’s move from topology and measure to simple counting. Suppose we have a 100-pound sack of hydrated potatoes that is 99% water. We let the sack dry out until it is 98% water. How much does it weigh now? The answer surprisingly is not but rather . The simplest of various reasonings given here is that the 1% non-water of 100 pounds has stayed the same while becoming 2% of something, so that something must be 50 pounds.

April Fool’s quotes source |

*Polynomial Time is Big*:

For all real numbers the complexity classes are all distinct owing to the Time Hierarchy Theorem: whenever there is a language

Moreover the classes nest, so . Since there are uncountably many real numbers , this seems to suggest there must be uncountably many languages involved. But contains only countably many languages.

What is the answer? The answer is that over a hundred years before people defined complexity classes we had this kind of ‘paradox’ just in the number line. Define to be the set of rational numbers between and . There are only countably many rational numbers, and yet whenever .

*Probabilistic Polynomial Time Goes Hyper*:

For any real number we can also define to be the class of languages such that for some relation decidable in time polynomial in ,

where ranges over for some polynomial . The standard complexity class uses . It is not difficult to show that for any rational , indeed any for which the first decimal places in binary are computable in time, . However, when is uncomputable, contains undecidable languages. Indeed, take to be simply the relation , take , and take to be the “standard right cut” of :

Then , but is undecidable. The paradox is, why should the complexity class stay equal to the nice class on a dense subset of and yet suddenly jump up in power to include “hyper-computable” languages when infinitesimally passes through an uncomputable value?

From math and complexity we go on to physics.

*Mpemba Effect*:

Erasto Mpemba of Tanzania, while a secondary school student in 1963, observed that ice cream mixes froze faster when they had been initially heated, compared to mixes that had been kept in cold storage before freezing. This effect is still under debate even at the level of basic controlled evidence. This must be the simplest natural physical phenomenon for which the human race, despite splitting the atom and finding the Higgs Boson, has been unable to devise a convincing closed-form experiment, let alone verify. Even subjective matters such as whether tea tastes different depending on whether milk or the tea has been added to the cup first have been verified by rigorous experiments.

*Table-top Dark Energy*:

This compact device enables extracting the ubiquitous tension energy of space in order to power homes in regions with too frequent cloud-cover for reliable solar energy. It departs from previously patented approaches based on the Casimir effect and improves a previous design for a room-temperature power device in 1989 by Martin Fleischmann and Stanley Pons. “This is after all almost 70% of the entire mass-energy content of the Universe, so we should be able to harness it,” said a spokesperson. Indeed according to equations of physics the device should have about times the yield of a standard home gas furnace, and it was no surprise when Faadosly and Lofa told us they’d spent their year investing in it.

## Open Problems

Have a fun and safe April Fool’s Day.

“March 32” is the kind of arch reference to April 1 by which to estimate a wit like Chaucer’s most highly; hence I reject both the reading “Syn [since] March was gone…” in the account referenced by Wikipedia and my own attempt above to better it. Chaucer also appears to be the earliest solid source for our contemporary understanding of Valentine’s Day. He should have founded a greeting-card business, or maybe he did…

The $10,000

Gömböc Prize Problemremains open … and it isknownthat concrete solutions exist.Don’t the Time Hiearchy Theorem results require that $n^a,n^b$ must be time-constructible? There are only countably many programs so there are only countably many real numbers such that $n^a$ is time-constructible.

Yes, but you can always find rational numbers a’ < b' between them (a < a' < b' < b), and then the time constructibility is satisfied. A good reminder though—sometimes you file a fact away in your mind (or from previous posts) and forget what it depends on.