Inscribed Square Problem¶

The open square-peg conjecture that every planar Jordan curve contains four distinct points forming a nondegenerate Euclidean square, without requiring square order to match curve order.

Version: v2 · 2026-09-19 · History
Domain-specific #: 2077
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Geometry, Inscribed Configurations → Mathematics
Aliases: Square Peg Problem, Toeplitz Conjecture

Core Idea¶

The Inscribed Square Problem, also called the Square Peg Problem or Toeplitz Conjecture, asks whether every Jordan curve in the Euclidean plane contains the four vertices of a square of positive side length. A Jordan curve is the image of an injective continuous map \(\gamma:S^1\to\mathbb{R}^2\). “Inscribed” requires only that all four vertices lie on that image. The filled square need not lie inside the bounded region, and the order in which the curve visits the vertices need not agree with their cyclic order around the square.

How would you explain it like I'm…

Hidden Square in Loops

Draw a closed loop on paper without your line ever crossing itself — it can be as wiggly as you like. Can you always find four spots on your line that are the corners of a square? For lots of nice loops, people know the answer is yes. But for every possible crazy-wiggly loop, nobody knows yet!

The Square in Every Loop

The Inscribed Square Problem asks: if you draw any closed loop that never crosses itself, must there always be four points on the loop that form the corners of a real square (not a squashed-to-a-dot one)? The square only needs its four corners on the line; it can poke outside the loop. Mathematicians have proven it for smooth loops, for loops made of straight pieces, and for many other kinds. But for the most jagged, wild loops, the answer is still unknown.

Squares on Every Closed Curve?

The Inscribed Square Problem, also called the Square Peg Problem or Toeplitz Conjecture, asks whether every Jordan curve — a closed curve in the plane that never crosses itself — contains the four vertices of some square with positive side length. 'Inscribed' only means the four corners lie on the curve; the square can stick outside the enclosed region, and the curve need not pass through the corners in square order. It has been proven for smooth curves, convex curves, polygons, and several other classes, but the general case is still open. The hard part is not finding squares on nice shapes: when you approximate a very rough curve with nicer ones, the squares you find might shrink to a point and disappear in the limit.

The inscribed square problem asks whether every Jordan curve — the image of a continuous injective map from the circle into the plane — contains the four vertices of a square of positive side length. Inscription requires only that the vertices lie on the curve's image; the filled square need not lie in the bounded region, and the curve's visiting order need not match the square's cyclic order. The claim is universal over arbitrarily irregular simple closed curves. Positive results exist for smooth, convex, polygonal, locally monotone, and several lower-regularity or symmetry-constrained classes, but the general case is open. The central obstacle is degeneration: a limiting argument that approximates a wild curve by regular ones may produce squares whose side lengths shrink to zero. Research approaches include configuration spaces, parity and intersection counts, equivariant topology, compactness with scale control, integration methods, and symplectic or Floer techniques. A result for a restricted class is progress, not a solution: it adds enough structure to stop the square from vanishing.

Scope of Application¶

The home scope is plane geometry and geometric topology, especially inscribed-configuration problems. Research varies the regularity of the host curve, the target quadrilateral, the ordering convention, and the ambient dimension. The canonical problem holds the host at “all planar Jordan curves” and the guest at “one nondegenerate square.”

Known positive regimes explain the boundary. Emch treated curves built from analytic arcs. Stromquist proved existence under a local monotonicity condition that includes convex curves, polygons, and suitable piecewise \(C^1\) curves.

Clarity¶

The node clarifies four easily conflated choices. First, the host is a Jordan curve, not its filled interior. Second, inscription is a vertex condition, not containment of the square. Third, the square must be nondegenerate. Fourth, square order and curve order are separate.

It also clarifies what “open” means. The problem is not open for every curve anyone draws. It is open only because continuous injective curves can be extremely irregular.

Manages Complexity¶

The problem compresses a vast search over four-tuples on a curve into a configuration-space zero or intersection question. One can encode pairs of points by midpoint, direction, and chord length, or encode ordered quadruples and impose equal-side and diagonal equations. Symmetries of the square reduce redundant labels, while transversality makes isolated solutions countable in generic smooth cases.

Abstract Reasoning¶

Several reusable inferences follow. If \(\gamma_n\to\gamma\) uniformly and each \(\gamma_n\) has an inscribed square of side \(s_n\), compactness can produce a limiting quadruple. But it proves the desired result only if \(\inf s_n>0\). When \(s_n\to0\), all four vertices may converge to one point. Thus “approximate by smooth curves” is a proof plan only after a scale-separation lemma.

Knowledge Transfer¶

Within geometry, the problem transfers a standard workflow to other peg problems: encode a target configuration by distances or ratios, form a configuration space of curve points, quotient label symmetries carefully, identify degeneracy strata, and seek an intersection or obstruction that cannot vanish. This workflow applies to rectangles, rhombi, triangles, cyclic quadrilaterals, and higher-dimensional analogues, but each target has distinct constraints.

Relationships to Other Abstractions¶

Current abstraction Inscribed Square Problem Domain-specific

Parents (1) — outgoing typed relations

Inscribed Square Problem presupposes Embeddability Prime

The Inscribed Square Problem presupposes Embeddability.

Hierarchy paths (2) — routes to 2 parentless roots

Inscribed Square Problem → presupposes Embeddability → presupposes Constraint

Show alternative path (1)

Neighborhood in Abstraction Space¶

Inscribed Square Problem sits in a sparse region of the domain-specific corpus (95^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25