Skip to content

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
v1 · 2026-08-30 · History
Domain-specific #
2077
Origin domain
geometry
Subdomain
inscribed configurations
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.

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

Local relationship map for Inscribed Square ProblemParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.InscribedSquare ProblemDOMAINPrime abstraction: Embeddability — presupposesEmbeddabilityPRIME

Current abstraction Inscribed Square Problem Domain-specific

Parents (1) — more general patterns this builds on

  • Inscribed Square Problem presupposes Embeddability Prime

    The Inscribed Square Problem presupposes Embeddability.

Hierarchy paths (2) — routes to 2 parentless roots

Neighborhood in Abstraction Space

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

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08