Why Topology Matters: An Inscribed Rectangle Argument

Grant Sanderson turns pairs of points on a curve into a Möbius strip.

GSGrant SandersonAnime
Chaîne
3Blue1Brown
Publié
4 nov. 2016
Vidéo
16:29
Lecture
2 min
Original
anglais
Ouvrir sur YouTube
En faisant défiler, la vidéo se réduit en bas à droite et continue. Les sous-titres suivent votre langue de lecture.
Langue de lectureDisponible en 2 langues
Cet article n’est pas encore disponible en français ; il s’affiche dans l’original en anglais.
RÉSUMÉ

En 30 secondes

In this 2016 lesson, Grant Sanderson explains an inscribed-rectangle argument through a map of point pairs and a Möbius strip. The video gives an intuitive topological step rather than a complete rigorous proof, and its description links to a newer version.

  1. 1The questionThe video considers a rectangle version of the inscribed-square question.
  2. 2Equal diagonalsEqual diagonals with a shared midpoint determine a rectangle.
  3. 3A three-dimensional mapA collision of midpoint-and-distance values provides the rectangle.
  4. 4Ordered pairsOrdered pairs of points on a loop form a torus.
  5. 5Unordered pairsUnordered pairs form a Möbius strip.
  6. 6The topological stepThe proof uses a topological fact whose rigorous justification is omitted.

À retenir

  1. The video considers a rectangle version of the inscribed-square question.
  2. Equal diagonals with a shared midpoint determine a rectangle.
  3. A collision of midpoint-and-distance values provides the rectangle.
  4. Ordered pairs of points on a loop form a torus.
  5. Unordered pairs form a Möbius strip.
  6. The proof uses a topological fact whose rigorous justification is omitted.
TEXTE INTÉGRAL

Lire le texte remanié, chapitre par chapitre

Transcription seule
01

The inscribed rectangle

A geometric problem and its reformulation.

In this 2016 version of his topology lesson, Grant Sanderson uses an inscribed-rectangle problem to show why the subject’s shapes help solve concrete questions. The video description links to a newer version.

The inscribed-square problem asks whether every simple closed plane curve contains four points forming a square. Sanderson describes it as unsolved at the time of the video; he instead develops a weaker rectangle result.

A rectangle’s diagonals have the same midpoint and length. Conversely, two distinct pairs of points with a common midpoint and equal positive distance determine the vertices of a rectangle.

For each unordered pair on the curve, plot its midpoint in the plane and use the distance between the points as height. A collision of two distinct pairs under this map would give the equal diagonals needed for a rectangle.

When the two points approach one another, their distance tends to zero and the plotted point approaches the curve. Coincident pairs map exactly onto the original curve in the plane.

02

The space of pairs

From a torus to a Möbius strip.

To understand all pairs, first consider ordered pairs. Cutting the loop into an interval gives a square of parameter pairs; identifying opposite edges restores the original loop and produces a torus.

For an unordered pair, swapping its points makes no difference. Identifying (x, y) with (y, x) folds the square along its diagonal; after the remaining edge identifications, the resulting parameter space is a Möbius strip.

The boundary of that strip represents coincident pairs. Under the midpoint-and-distance map, this boundary is attached to the original curve in the plane.

03

Why topology matters

The argument and the remaining rigorous step.

Sanderson invokes the topological fact that a Möbius strip with its boundary embedded in the plane cannot remain embedded entirely on one side of the plane. Hence the mapped surface must identify distinct interior points, producing the required rectangle.

He notes that making the topological step rigorous requires more than the visual intuition shown here. The point is that the torus and Möbius strip arose naturally from the structure of point pairs, rather than as decorative examples.

Sur la même chaîne

20 diapositives40:44EN
3Blue1Brown· 16 oct. 2026Grant Sanderson: There's never been a better time to go into mathGrant Sanderson, Constantin Kogler · 3Blue1BrownStudents fear AI has solved mathematics. Grant Sanderson argues the opposite: even if machines prove theorems better than we do, the institution of math stays valuable—and this is a rare moment when newcomers can reshape it.MathematicsAI for scienceHuman-AI Collaboration+2
29 diapositives51:55EN
3Blue1Brown· 18 sept. 2026The last IMO problem AI could not solveGrant Sanderson · 3Blue1BrownGrant Sanderson walks through IMO 2025 Problem 6 — a tiling puzzle that frontier models missed — and the visual patience it takes to prove a construction is optimal.MathematicsAI researchReasoning & test-time compute+2
0:55EN
3Blue1Brown· 24 juil. 2026The 64 Sugar Cubes Puzzle: Six Equal DistancesA 4×4×4 block has three colors; prove that six same-colored pairs share a distance.MathematicsEducation
33:51EN
3Blue1Brown· 16 juil. 2026What Cross-Entropy Connects: Compression, Language Models and KL DivergenceGrant Sanderson · 3Blue1BrownGrant Sanderson builds cross-entropy from code lengths and uses it to explain next-token training and distillation.MathematicsMachine LearningFoundation Models+1
Diapositives2:25EN
3Blue1Brown· 12 juin 2026How Shannon Measured the Entropy of EnglishA guessing game helped Claude Shannon estimate how much information English text contains, and why prediction is central to compression.MathematicsAI History
Diapositives1:02EN
3Blue1Brown· 10 juin 2026A Robot Walk and the Puzzle of Optimal Binary EncodingHow few bits does it take to send directions that occur with unequal frequencies?MathematicsScience Communication