Who cares about topology? (Inscribed rectangle problem)

When I was a kid, since I loved math and sought out mathy things, I would occasionally find myself at some talk or seminar where people wanted to get the youth excited about the things mathematicians care about.

A common go-to topic to excite our imaginations was topology. We might be shown something like a Möbius strip, maybe building it out of construction paper by twisting a rectangle and gluing its ends. “Look,” we’d be told as we were asked to draw a line along the surface, “it’s a surface with just one side!”

Or we might be told that topologists view a coffee mug and a doughnut as the same thing, since each has one hole.

Animation heavily inspired by that of Lucas Vieira.

But these kinds of demos always left a lurking question: How is this math? How does any of this actually help solve problems?

It wasn’t until I saw the problem I’m about to show you, with its elegant and surprising solution, that I started to understand why mathematicians actually care about some of these shapes and the properties they have.

The Inscribed Square Problem

No one knows the answer to the following question:

If you have a closed curve in 2D space, will you always be able to find four points on this curve that make up a square?

This is known as the Toeplitz' conjecture. By "closed curve", we mean you squiggle some line through space in a potentially crazy way and end at the point where you started.

We can find four points on this closed loop that form a square. But can we do the same for any loop?

If your closed loop is a circle, for example, it’s quite easy to find an inscribed square. Infinitely many squares, in fact. If your loop was an ellipse, it’s still pretty easy to find an inscribed square.

Finding inscribed squares in circles and ellipses is easy. But what about other, wilder loops?

This tweet shows a bunch of crazy loops, and at every frame there is indeed a square inscribed inside:

This problem has been solved for some special cases, for example curves which are smooth are known to always contain inscribed squares. However, the general case where the only assumption you make is that the curve is continuous, which includes much wilder curves like fractals, remains unsolved.

The Inscribed Rectangle Problem

To me it’s fascinating that the current tools of math can neither confirm nor deny the existence of a loop that has no inscribed square. But what about a slightly weaker question? Can we prove that any closed continuous curve always has an inscribed rectangle?

It’s still pretty hard, but there is a beautiful solution that might actually be my favorite piece of math. We start with a seemingly trivial shift in perspective. Instead of asking whether we can find four points forming a rectangle, we ask whether it’s possible to find two distinct pairs of points which form a rectangle.

Considering the points as diagonal pairs makes the problem easier.

We’ll use the following key fact about rectangles: If you label the vertices of a rectangle aa, bb, cc, and dd, then the distance between aa and cc equals the distance between bb and dd, and the midpoint of aa and cc is the same as the midpoint of bb and dd.

A rectangle with points labeled aa, bb, cc, and dd.

In fact, any time you have two separate pairs of points in space, (a,c)(a, c) and (b,d)(b, d), if you can guarantee that they share a midpoint, and the distance between aa and cc equals the distance between bb and dd, it’s enough to guarantee that these four points make up a rectangle.

So what we’re going to do is try to prove that for any closed loop it’s possible to find two distinct pairs of points on that loop that share a midpoint, and which are the same distance apart.

Take a moment to make sure that idea is clear: We’re finding two distinct pairs of points on the loop with a common midpoint, and which are the same distance apart.

Why is this a useful reframing? As you’ll see, it lets us phrase the question in terms of surfaces and properties of those surfaces.

If you were to encode the important information about a pair of points, it would involve three numbers: Two to describe the midpoint, and one more to specify the distance. To a mathematician, if you are describing something with three numbers, it’s very enticing to think of it as a single point in 3D space.

We want to encode the three important pieces of information about a pair of points as a single point in 3D space.

Consider our closed loop to be sitting on the xy-plane in 3D space. For a given pair of points, label their midpoint MM, which will be somewhere on the xy-plane. If the distance between them is dd, then plot the point which is exactly dd units above the point MM in the z direction.

This defines a function that takes in a pair of points on the loop, and outputs a single point in 3D space. It’s kind of like a graph, but be mindful of the difference. We’re not describing a function that takes in a pair of numbers (x,y)(x, y) and spits out one number zz. What we’re dealing with is a much richer function which takes in a pair of points on the loop and spits out a triplet (x,y,z)(x, y, z).

For any pair of points on the loop (pink) we have an associated point in 3D space (blue).

As you do this for many possible pairs of points, you’ll effectively be drawing through 3D space. When you do it for all possible pairs of points on the loop, you will draw some kind of surface above the plane.

By finding the 3D points associated with every possible pair of two points on the loop, we have created a surface!

If we choose two points on the loop with (x, y) coordinates of (1, 2) and (1, 4), what is the corresponding point in 3D space based on the function we’ve defined?

Since this surface is defined for any closed curve, we can draw our own custom curves and calculate the corresponding 3D surface. This interactive demo allows you to do just that:

While drawing your own curves, it can be helpful to ask questions about why the corresponding surface looks the way it does. For example, you might notice that straight edges on your loop will produce triangular regions on the surface. Can you figure out why?

confused pi creature

Why do straight segments on the loop produce triangles?

Your answer:
Our answer:

The pair of points at opposite ends of the straight segment produce a point in 3D space at the very top of the triangle. As one point moves inward on the segment, the distance dd between the points decreases, and the midpoint remains on the line segment a distance d/2d/2 from each of them, so the resulting point in 3D space traces out a downward sloping line, specifically with slope 2, which forms the edge of the triangle. Moving both points inward produces points that fill in the area under the triangle.

Also, notice how the 3D surface always ends up perfectly touching the 2D loop. This will actually be important later, so let’s think about why it happens.

confused pi creature

Why does the surface hug the curve?

Consider what happens when we choose two points on the loop which are close together. As the pair of points on the loop gets closer and closer, the plotted point gets lower, since its height is by definition equal to the distance between the points. Also, the midpoint gets closer and closer to the loop as the points approach each other.

As the points on the loop (pink) approach a single point XX, the point in 3D space (blue) also approaches XX.

When the two points eventually coincide at a single point XX, the corresponding point on the 3D surface will also be XX. That is, f(X,X)=Xf(X, X) = X. This fact is the reason why the surface hugs the loop, rather than floating above it.

Another important fact is that this function is continuous, which means that if you slightly adjust a given pair of points, the corresponding output in 3D space is only slightly adjusted as well. There is never a sudden, discontinuous jump.

Our goal, then, is to show that this function has a collision; that two distinct pairs of points each map to the same spot in 3D space. The only way for that to happen is if they share a common midpoint, and if their distance dd apart from each other is the same.

So in some sense, finding an inscribed rectangle comes down to showing that this surface must intersect itself. That’s an admittedly ill-defined phrasing, but we can make it more precise if we find a new geometric representation for the pairs of points on the loop as a surface, and think of the mapping above as a way of embedding that new surface into 3D-space, hopefully with a forced self-intersection along the way.

Stop to think: Why does the surface intersecting itself tell us that there is a rectangle inscribed in the original loop?

Answer: If the surface intersects itself, it means that two different pairs of points both map to the same point in 3D space. Based on the way we’ve defined our surface, this means that both pairs have the same midpoint and the same distance apart. Therefore, we have a rectangle!

A New Way to Think About Pairs of Points

Think about how we represent pairs of real numbers using individual points on a two-dimensional coordinate plane. Analogous to this, we’ll seek out a certain 2D surface which naturally represents all pairs of points on a loop.

Now, when I say "pair of points", there are two things I could be talking about: The first is ordered pairs of points, where the pairs (a,b)(a, b) and (b,a)(b, a) would be considered distinct; that is, there’s some notion of which point is "first".

The second is unordered pairs of points, where {a,b}\{a, b\} and {b,a}\{b, a\} would be considered the same thing. Where all that matters is what the points are, and it doesn’t matter which one is first.

Ultimately we want to understand unordered pairs of points, but to get there we need to start by thinking about ordered pairs.

Ordered Pairs As a Surface

We’ll start by straightening out the loop, cutting it at some point and deforming it into an interval. For the sake of having some labels, let’s say this is the interval on the number line from 00 to 11.

Every point on the loop maps to a single number between 0 and 1 (with one exception).

By following where each point ends up, every point on the loop corresponds with a unique number on this interval... except for the point where the cut happened, which corresponds simultaneously to both endpoints of the interval, meaning the numbers 00 and 11.

This mapping allows us to turn any pair of two points on the loop into a pair of two numbers between 00 and 11, which is much easier to reason about.

Every point on the loop corresponds to a number between 00 and 11. So a pair of points on the loop corresponds to a pair of numbers between 00 and 11.

We can place one of the two values on a new y-axis, using a second interval, so that each pair of values between 00 and 11 (and thus each pair of points on the loop) is associated with a single point in a 1×11 \times 1 square.

By giving each of the two numbers (corresponding to our original two points on the loop) a unique axis to live on, we can represent any pair of points on the loop with a single point in a 1×11 \times 1 square of 2D space.

Remember, we’re trying to find a surface that naturally represents the set of all pairs of points on the loop. This square is the first step to doing that.

Stop to think: If you have a pair of points on the loop, how do you find the corresponding point on the square?

Answer: This assumes you've already chosen a parameterization of the loop, meaning a continuous way to associate individual points with numbers between 0 and 1. From there, consider the numbers associated with the two points as the x and y coordinates in the square.

The problem is that there’s some ambiguity when it comes to the edges of this square. Remember, the endpoints 00 and 11 on the interval really correspond to the same point of the loop, so they need to be glued together if we are to faithfully map back to the loop.

So all the points on the left edge of the square really represent the same pair of points on the loop as the corresponding coordinates on the right edge of the square. If this square is going to represent pairs on the loop in a unique way, we’ll need to glue this left edge to the right edge.

Likewise, the bottom edge needs to be glued to the top edge, since the y-coordinates of 00 and 11 each really represent the same second point in a given pair of points on the loop.

Let’s mark each edge with some arrows to remember how the edges should be lined up:

Matching points along opposite edges of the square both correspond to the same pair of points on the loop. To represent this faithfully, we need to glue together the edges of the square as indicated by the arrows.

If you bend this square to perform the gluing, first rolling it into a cylinder to glue the left and right edges, then gluing the ends of the cylinder, which represent the top and bottom edges, we get a torus, the surface of a doughnut.

When the square is wrapped up and its edges glued together following the arrows, it becomes a torus.

By gluing together the corresponding edges, we’ve solved the problem of duplicate mappings. Every individual point on this torus corresponds to a unique pair of points on the closed loop, and likewise every pair of points on the loop corresponds to a unique point on the torus.

The torus is to pairs of points on the loop as the xy-plane is to pairs of points on the real number line.

The torus serves as a 2D surface for encoding pairs of positions on a loop, much like how the xy-plane encodes pairs of positions on the number line.

The key property of this association is that it’s continuous both ways, meaning if you nudge any point on the torus by just a tiny amount, it corresponds to only a slight nudge in the pair of points on the loop, and vice versa.

What does a single point on the torus correspond to?

Now we’re really getting into the heart of what topology is all about. By representing a set of things we care about, like pairs of points on a loop, as individual points on a surface, we can begin tackling our original question by understanding various properties of this surface. But the torus is not quite the surface that you and I care about today.

Unordered Pairs As a Surface

If the torus is the natural shape for ordered pairs of points on the loop, what’s the natural shape for unordered pairs?

Remember, the whole reason we’re doing this is to show that two distinct pairs of points on the loop share a midpoint and are the same distance apart. But if we consider the pair (a,b)(a, b) to be distinct from (b,a)(b, a), that would give us two separate pairs which trivially have the same midpoint and distance apart! That’s like saying you can always find a rectangle as long as you consider any pair of points to be a rectangle. Not helpful!

To find a surface representing unordered pairs, let’s look back at our unit square. We want the coordinates (0.2,0.3)(0.2, 0.3), say, to represent the same pair as (0.3,0.2)(0.3, 0.2). In general the coordinates (x,y)(x, y) should represent the same thing as (y,x)(y, x).

Since we’re interested in unordered pairs, the points (x,y)(x, y) and (y,x)(y, x) on the square both represent the same pair of points on the loop.

Once again, we capture this idea by gluing points together when they’re supposed to represent the same pair, which in this case requires folding the square diagonally.

Points on opposite sides of the diagonal line both correspond to the same pair of points on the loop, so we fold the square in half to prevent duplication.

Notice this diagonal line. It represents all pairs that look like (X,X)(X, X), meaning the "pairs" which are really just a single point on the loop written twice. Right now it’s marked with a red line, and you should remember it; it will become important later to know where all the pairs like (X,X)(X, X) live.

We now need to glue together this bottom edge with the right edge, but the orientation with which we do this is important. Points towards the left of the bottom edge have to be glued to points towards the bottom of the right edge, and points towards the right of the bottom edge have to be glued to points towards the top of the right edge.

We need to glue the bottom and right edges as indicated by the blue arrows.

It’s weird to think about, right?

Sometimes we must take a step back before we can progress forward. The clever trick here is to make a new diagonal cut, which of course we need to remember to glue back together at some point.

We cut the triangle in half (yellow) to gain some maneuverability. Don’t worry; we’ll glue it back together soon.

This frees us up to flip the bottom triangle around to the right and glue the blue edges like so...

Now notice the orientation of the yellow arrows here: To glue back what we just cut, we don’t simply connect the edges of this rectangle to get a cylinder. We have to make a twist! Doing this in 3D space, the shape we get is a Möbius strip.

Connecting the yellow edges of the square requires a twist, which gives us a Möbius strip!

Isn’t that awesome!? Evidently the surface which represents all possible unordered pairs of points on a loop is the Möbius strip! The Möbius strip is to unordered pairs of points on a loop what the xy-plane is to ordered pairs of real numbers. This totally blew my mind when I first saw it.

dance_kick pi creature

And notice, the red edge of this strip, which was originally the diagonal fold in the square, represents the pairs of points that look like (X,X)(X, X); those which are really just a single point listed twice.

Stepping back, remember that we had defined a special kind of graph in 3D space, where the loop was sitting in the xy-plane. For each pair of points, you consider their midpoint MM on the xy-plane, and their distance apart, dd, then you plot a point which is exactly dd units above MM.

Because of the continuous 1-to-1 association between points on the Möbius strip and pairs of points on the loop, there’s a natural map from the Möbius strip to this surface in 3D space: For every point on the Möbius strip, consider the pair of points on the loop it corresponds to. Then plug that pair of points into our special function.

Points on the Möbius strip correspond to pairs of points on the loop which correspond to points on the 3D surface.

These two mappings combined give us a way to map points on the Möbius strip directly to points on the 3D surface. But what does this mapping look like, visually? Which points on the Möbius strip map to which points on the 3D surface?

To get a hint, consider the pairs of points (X,X)(X, X). Where do these points fall on the Möbius strip, and where do they fall on the 3D surface?

Answer: Pairs like (X,X)(X, X) correspond to points on the red edge of the Möbius strip. And for the 3D surface, the corresponding points are exactly on the loop. So when the Möbius strip is mapped onto this surface, it must be done in such a way that the edge of the strip maps onto the loop in the xy-plane.

Alright, let's watch and see how this Möbius mapping pans out.

Here we take the original Möbius strip and stretch it in all kinds of wonky ways so that every point on the Möbius strip aligns with its corresponding point on the 3D surface. The red edge of the Möbius strip aligns with the original loop in the xy-plane.

Now, if you think about it for a moment, considering the strange shape of the Möbius strip, there’s no way to glue its edge onto something two-dimensional without forcing the strip to intersect itself.

Since each point of the Möbius strip represents a pair of points on the loop, if the strip intersects itself, it means at least two distinct pairs of points correspond to the same output on this surface. This, in turn, means they share a midpoint and are the same distance apart, which implies that these two distinct pairs of points form a rectangle!

And that’s the proof!

So Who Cares About Topology?

But of course, we haven’t really completed the proof. Our intuitive sense that the edge of the Möbius strip can’t be glued down to a 2D plane isn’t rigorous; it’s just something that seems true.

Perhaps you make a Möbius strip out of paper. No matter how you flex and bend the Möbius strip, placing the entire edge onto the surface of your table just isn’t going to work. But how do we prove that fact mathematically? How do we translate the intuitively, physically obvious into a mathematical model we can reason about formally?

As it turns out, this fact is actually false! As one counterexample, the illustration below shows a way to embed the Möbius strip into 3d space so that its boundary forms a perfect circle.

The Sudanese Möbius band is one example of a Möbius strip with its edge embedded perfectly in a 2D plane. This seemed impossible, but our intuition was wrong!

This is known as the "Sudanese Möbius Band", discovered by Blaine Lawson in his Ph.D. thesis. For another illustration, check out this video by Charles Gunn.

So our intuition, that the edge of a Möbius strip cannot exist in a 2D plane without self-intersection, was actually wrong. The important distinction, though, is that in the case of the Sudanese Möbius band, the surface dips both above and below the 2D plane, which is not the case in our original problem, where we were limited to points on or above the xy-plane.

Let’s get a little more precise. How would you phrase what fact we want to be true of the Möbius strip?

Possible Answer: Any continuous mapping from the Möbius strip into the half 3D space where the z0z \ge 0 which maps the boundary of the Möbius strip to the xyxy-plane must have two inputs which map to the same output. (More fancifully, such a mapping cannot be injective.)

If you understand the desire to turn your spatial intuitions into a rigorous air-tight line of reasoning, you understand the spirit of true topology. There is a popular conception of topology as a kind of rubber-sheet-geometry, where mathematicians dream up strange surfaces and spaces which they consider the same when you can stretch or morph one into the other without tearing it or gluing.

This is... well... kind of true, but it says nothing about why we’d care. The torus and Möbius strip arose for us as a way to represent and rephrase a completely separate non-topological problem. The mental picture of morphing without tearing or gluing is a way to conceptualize the idea of continuous one-to-one associations.

If you’re curious about which ideas from topology are useful to this problem, there are numerous theorems about which surfaces can and cannot be embedded into 3D space. While it’s possible to represent the Möbius strip and the torus in three-dimensions, there are other surfaces, like the Klein bottle, which can only live in four or more dimensions, unless you allow for self-intersection.

It turns out that gluing the edge of a Möbius strip to the edge of a disk gives us a surface which is topologically equivalent to something called the "real projective plane". So the surface we defined above for the inscribed rectangle problem, combined with the interior of the closed loop on the plane which it hugs, might be described by a mathematician as an embedding of the real projective plane into 3D space. And as you may have guessed, those mathematicians are a clever bunch, and they proved that you can’t have such an embedding. That is to say, trying to jam this surface into 3D space forces it to intersect itself.

If you're itching to understand why this is true, wonderful! Consider this an excuse to start digging more into topology. Facts about which surfaces are topologically distinct from others, and how many dimensions they can live in, can be surprisingly hard to formalize and prove. But if you understand this proof sketch to the inscribed rectangle problem, you'll understand how these kinds of facts are more than mere idle ponderings.

Notice a mistake? Submit a correction on Github


Special thanks to those below for supporting the original video behind this post, and to current patrons for funding ongoing projects. If you find these lessons valuable, consider joining.

Dave NicponskiJuan BenetLoo Yu JunTomOthman AlikhanMarkus PerssonJoseph John CoxAchille BrightonKirk WerklundLuc RitchieRipta PasayPatrickJMT Felipe DinizChrisAndrew McnabMatt ParlmerNaoki OraiDan DavisonJose Oscar Mur-MirandaAidan BonehamBrent KennedyHenry ReichSean BibbyPaul ConstantineJustin ClarkMohannad ElhamodDenisBen GrangerAli YahyaJeffrey HermanJacob Young


Table of Contents