Here's a nice 3blue1brown video about the easier version of the inscribed rectangle problem, that <i>some</i> inscribed rectangle exists: <a href="https://www.youtube.com/watch?v=AmgkSdhK4K8" rel="nofollow">https://www.youtube.com/watch?v=AmgkSdhK4K8</a><p>And I remember thinking this was a nice overview of some aspects of the "square peg problem" (the Toeplitz conjecture): <a href="https://www.ams.org/notices/201404/rnoti-p346.pdf" rel="nofollow">https://www.ams.org/notices/201404/rnoti-p346.pdf</a>
> It starts with a closed loop — any kind of curvy path that ends where it starts. The problem Greene and Lobb worked on predicts, basically, that every such path contains sets of four points that form the vertices of rectangles of any desired proportion.<p>> Their final proof — showing the predicted rectangles do indeed exist — transports the problem into an entirely new geometric setting. There, the stubborn question yields easily.<p>Except that the article then contradicts itself by saying how they haven't actually proved this. They proved it for smooth closed curves, not for any closed curves.<p>This is a really bizarre article. They seem like they want to describe the math. But they can't bring themselves to do it in a way that might be helpful. They're just waving words around.<p>And then there's this:<p>> it’s possible to rotate the Möbius strip in four-dimensional space so that you only change one of the coordinates in each point’s four-coordinate address — like changing the street numbers of all the houses on a block, but leaving the street name, city and state unchanged. (For a more geometric example, think about how holding a block in front of you and shifting it to the right only changes its x coordinates, not the y and z coordinates.)<p>You can certainly translate a space along an axis without affecting its coordinates along other axes. But that's not a rotation.
Wait a minute.<p>> It starts with a closed loop — any kind of curvy path that ends where it starts. The problem Greene and Lobb worked on predicts, basically, that every such path contains sets of four points that form the vertices of rectangles of any desired proportion.<p>> Their final proof — showing the predicted rectangles do indeed exist — transports the problem into an entirely new geometric setting. There, the stubborn question yields easily.<p>> The rectangular peg problem is a close offshoot of a question posed by the German mathematician Otto Toeplitz in 1911. He predicted that any closed curve contains four points that can be connected to form a square. His “square peg problem” remains unsolved.<p>How can the square problem possibly remain unsolved if the article is celebrating a proof that you can find the corners of a rectangle <i>of any proportion</i> in any closed curve. What if I choose the proportion "length = 1 times width"?
I've seen the trick with describing rectangles as middlepoint, diagonal length and angle used in solving an interview questions, it was great. <a href="https://youtu.be/EuPSibuIKIg" rel="nofollow">https://youtu.be/EuPSibuIKIg</a>