Inscribed square problem


The inscribed square problem, also known as the square peg problem or the Toeplitz' conjecture, is an unsolved question in geometry: Does every plane simple closed curve contain all four vertices of some square? This is true if the curve is convex or piecewise smooth and in other special cases. The problem was proposed by Otto Toeplitz in 1911. Some early positive results were obtained by Arnold Emch and Lev Schnirelmann., the general case remains open.

Problem statement

Let C be a Jordan curve. A polygon P is inscribed in C if all vertices of P belong to C. The inscribed square problem asks:
It is not required that the vertices of the square appear along the curve in any particular order.

Examples

Some figures, such as circles and squares, admit infinitely many inscribed squares. If C is an obtuse triangle then it admits exactly one inscribed square; right triangles admit exactly two, and acute triangles admit exactly three.

Resolved cases

It is tempting to attempt to solve the inscribed square problem by proving that a special class of well-behaved curves always contains an inscribed square, and then to approximate an arbitrary curve by a sequence of well-behaved curves and infer that there still exists an inscribed square as a limit of squares inscribed in the curves of the sequence. One reason this argument has not been carried out to completion is that the limit of a sequence of squares may be a single point rather than itself being a square. Nevertheless, many special cases of curves are now known to have an inscribed square.

Piecewise analytic curves

showed that piecewise analytic curves always have inscribed squares. In particular this is true for polygons. Emch's proof considers the curves traced out by the midpoints of secant line segments to the curve, parallel to a given line. He shows that, when these curves are intersected with the curves generated in the same way for a perpendicular family of secants, there are an odd number of crossings. Therefore, there always exists at least one crossing, which forms the center of a rhombus inscribed in the given curve. By rotating the two perpendicular lines continuously through a right angle, and applying the intermediate value theorem, he shows that at least one of these rhombi is a square.

Locally monotone curves

has proved that every local monotone plane simple curve admits an inscribed square. The condition for the admission to happen is that for any point, the curve should be locally represented as a graph of a function.
In more precise terms, for any given point on, there is a neighborhood and a fixed direction such that no chord of -in this neighborhood- is parallel to.
Locally monotone curves include all types of polygons, all closed convex curves, and all piecewise C1 curves without any cusps.

Curves without special trapezoids

An even weaker condition on the curve than local monotonicity is that, for some ε > 0, the curve does not have any inscribed special trapezoids of size ε. A special trapezoid is an isosceles trapezoid with three equal sides, each longer than the fourth side, inscribed in the curve with a vertex ordering consistent with the clockwise ordering of the curve itself. Its size is the length of the part of the curve that extends around the three equal sides. If there are no such trapezoids, the limiting argument for general curves can be carried to completion, showing that curves with this property always have an inscribed square.

Curves in annuli

If a Jordan curve is inscribed in an annulus whose outer radius is at most times its inner radius, and it is drawn in such a way that it separates the inner circle of the annulus from the outer circle, then it contains an inscribed square. In this case, if the given curve is approximated by some well-behaved curve, then any large squares that contain the center of the annulus and are inscribed in the approximation are topologically separated from smaller inscribed squares that do not contain the center. The limit of a sequence of large squares must again be a large square, rather than a degenerate point, so the limiting argument may be used.

Symmetric curves

The affirmative answer is also known for centrally symmetric curves, even fractals such as the Koch snowflake, and curves with reflective symmetry across a line.

Lipschitz graphs

In 2017, Terence Tao published a proof of the existence of a square in curves formed by the union of the graphs of two functions, both of which have the same value at the endpoints of the curves and both of which obey a Lipschitz continuity condition with Lipschitz constant less than one. Tao also formulated several related conjectures.

Variants and generalizations

One may ask whether other shapes can be inscribed into an arbitrary Jordan curve. It is known that for any triangle T and Jordan curve C, there is a triangle similar to T and inscribed in C. Moreover, the set of the vertices of such triangles is dense in C. In particular, there is always an inscribed equilateral triangle.
It is also known that any Jordan curve admits an inscribed rectangle. In 2020, Morales and Villanueva characterized locally connected plane continua that admit at least one inscribed rectangle. In 2020, Joshua Evan Greene and Andrew Lobb proved that for every smooth Jordan curve and rectangle R in the Euclidean plane there exists a rectangle similar to R whose vertices lie on C. This generalizes both the existence of rectangles and the existence of squares on smooth curves, which has been known since the work of.
Some generalizations of the inscribed square problem consider inscribed polygons for curves and even more general continua in higher dimensional Euclidean spaces. For example, Stromquist proved that every continuous closed curve C in Rn satisfying "Condition A" that no two chords of C in a suitable neighborhood of any point are perpendicular admits an inscribed quadrilateral with equal sides and equal diagonals. This class of curves includes all C2 curves. Nielsen and Wright proved that any symmetric continuum K in Rn contains many inscribed rectangles. H.W. Guggenheimer proved that every hypersurface C3-diffeomorphic to the sphere Sn−1 contains 2n vertices of a regular Euclidean n-cube.