The Inscribed Square and Inscribed Rectangle Conjectures
This is part 1 of a two-part post, both dealing with the same pair of interesting mathematical problems in the realm of geometric topology. The statements of the two problems are accessible to a wide audience, even if the methods of solving them are not. Read on! Or go straight to part 2.
The first problem, the Inscribed Square Conjecture, was first asked more than 100 years ago and is still unsolved. A lot of partial progress has been made on it but a full solution is elusive; there’s a roadblock which is difficult to get around. The second problem, the Inscribed Rectangle Conjecture, is the first problem’s less famous cousin. It’s difficult for different reasons, though even if those different reasons were surmounted, one would still run into the same annoying roadblock that plagues the Square problem.
(Some mathematical problems have appeal precisely because they are easily stated, and also resist solution for very long periods of time. I’ve written some other reasons why I find some mathematical problems interesting.)
In this first part, I’ll describe these two problems, how some partial solutions have been attempted, and why they’re so difficult. For more historical context and state of current knowledge about these problems, see Benjamin Matschke’s excellent survey article [pdf].
In the second part, I describe some partial ideas I had on how to tackle the second problem, the Inscribed Rectangle Conjecture. This act goes against instincts I learned in graduate school and as a postdoc: any original ideas I might have about famous unsolved problems should be held close, because they are competitive advantages. But seeing as how I’ve already rejected advice commonly given to graduate students, postdocs, and new professors — namely to avoid like the plague famous unsolved problems, because you’ll fail and throw away effort with nothing to show for it — I will go ahead and post my ideas anyway, and maybe someone will take them somewhere interesting.
The Inscribed Square Conjecture
For any simple closed curve in the plane, are there necessarily four points on the curve which form the vertices of a square? The Inscribed Square Conjecture states that the answer is “yes”.
What’s a simple closed curve? The intuitive answer: draw a curve on a piece of paper without lifting your pen. “Simple” means it doesn’t intersect itself, so no figure eights allowed; “closed” means it joins up where it started, so the numeral zero is okay but the numeral seven is not. So basically, the numeral zero, except that it can be wiggly and bumpy instead of round.
The more precise definition of “simple closed curve” is quite technical, and for the purposes of this post I’d love to not have to mention it at all. However, as it turns out, the Inscribed Square Conjecture is known to be true for those simple closed curves which reasonably match the intuitive explanation I just gave, and is unknown for curves which match the technical definition but not the intuition.
To elaborate a bit: the technical definition of “simple closed curve” includes things like the smooth curves I described, and also things like polygons, and things like hybrids between smooth curves and polygons (which are smooth but with some corners). Those “regular” curves are known to have inscribed squares. But the technical definition also includes “irregular” weird monsters like the Koch Snowflake and other nowhere-smooth fractal messes, and those kinds of things are the ones for which the Inscribed Square Conjecture remains open. In other words, it might be that there’s some horrible fractal simple closed curve which has no inscribed squares; but no one knows.
How is this proved, that regular curves always have inscribed squares? There are different proof strategies for different kinds of regularity — one proof for smooth curves, another for polygons, another for convex curves — but they all rely on the strategy of showing that in fact regular curves have an odd number of inscribed squares. Zero is an even number, not odd, so the curve can’t have zero inscribed squares. The rough idea is something like the following (keeping in mind that this is only a rough schematic, not a precise proof).
Instead of trying to count the number of inscribed squares of just a single simple closed curve, look at a deformation of one simple closed curve into another, and keep track of the inscribed squares through the deformation.
In particular, start with an ellipse, which has a single inscribed square, and deform it to any other simple closed curve. So we have a 1–parameter family of simple closed curves. At each stage of the deformation we have some discrete set of inscribed squares, so taken all together we have a 1–parameter family of inscribed squares. Those form a collection of abstract curves of squares, pictured below in a schematic.
Squares appear and disappear two at a time during the deformation, and we started with one square in the ellipse, so we must end up with an odd number of squares, and in particular at least one square. (Well, we might end up with two squares having just collided into one, or one square about to separate into two, but we can’t actually have no squares.) That’s the essence of the proof — again, it’s just a schematic, and to make it precise requires assuming that the simple closed curves are regular enough (ie smooth, or polygonal, etc).
The Inscribed Rectangle Conjecture
Like the Square version, but harder
For any simple closed curve in the plane, are there necessarily four points on the curve which form the vertices of a rectangle with aspect ratio ? The Inscribed Rectangle Conjecture states that the answer is “yes”.
This can be seen as a generalization of the Square problem. Squares are just a special kind of rectangle, with aspect ratio 1 (aspect ratio is the ratio of the length of the longer side to the shorter side). Why should squares get their own conjecture and not all other rectangles too? Let’s be fair to all aspect ratios please.
This conjecture is unknown even for regular curves, because the strategy that works so well for squares fails for non-square rectangles. The reason is that, although regular curves have an odd (and therefore non-zero) number of squares, regular curves have an even number of rectangles.
An ellipse has two rectangles of every aspect ratio bigger than 1 (ie the non-square rectangles). If we start with an ellipse and deform it into some other curve, it might turn out that the two rectangles cancel each other out in the end.
No one knows of any example where they do end up canceling out, but for all anyone knows, it’s perfectly possible.
Some incomplete thoughts
I tried for a few months to find a solution to the Inscribed Rectangle Conjecture. There were at least three separate occasions where I was convinced I had found a partial or complete solution — and I was wrong every time. That is not a very unusual phenomenon. In fact even with this particular problem, someone published a proof 20 years ago where the author introduced a minus sign somewhere in a computation, and computed (which would have been a proof) but where the true answer was (not a proof). I’m very grateful to this author, because I made essentially the same mistake, and the knowledge of this published error inspired me to recheck my calculations even though I was “sure” I hadn’t made the same mistake.
In part 2, I describe what I think are my most promising ideas for solving this problem. They don’t (yet) lead to a solution but I think there’s room for taking them further.
If you’d like to play around with looking at inscribed squares and rectangles, Benjamin Matschke (who wrote the survey article I linked earlier) has a fantastic interactive online tool to view inscribed squares and rectangles.