Equichordal point problem¶

The plane-geometry question whether a convex body can have two distinct interior points through each of which every chord has the same point-specific length, answered negatively.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4403
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Convex Geometry History → Mathematics

Core Idea¶

An equichordal point is one for which all boundary-to-boundary chords passing through it share one length; the classical problem asked whether a bounded convex planar domain could possess two such points. Radial distance functions from the two candidate points satisfy coupled chord equations; analytic and geometric constraints force incompatibility except for the single-center case. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

The Two Magic Dots Puzzle

Put a dot in the very middle of a circle. Every straight stick that goes through the dot from edge to edge is the same length. People wondered whether a round-ish shape with no dents could have two different dots that both work like that. The answer turned out to be no: such a shape can have at most one special dot.

Equal Lines Through a Point

Draw a shape with no dents, like a circle or an egg. Pick a point inside and draw straight lines through it that go all the way from one edge to the other; these are called chords. If every chord through that point has the same length, the point is "equichordal" (the center of a circle is one). The equichordal point problem asked whether one dent-free shape could have two such points. Mathematicians proved that it can't: only the single-center case works.

Two Equichordal Points Problem

In a bounded convex region of the plane, a chord is a segment through the region joining two boundary points. An interior point is equichordal if every full chord through it — measured from boundary to boundary, not just to the point — has the same length, with that length specific to the point. A disk's center is the obvious example. The equichordal point problem asked whether a convex region could have two distinct equichordal points. It has been solved: writing the distance to the boundary from each candidate point as a function of direction gives linked chord equations, and the constraints they impose turn out to be incompatible except in the single-center case.

Let K be a bounded convex planar domain. An interior point p is equichordal if every chord of K through p has the same length c_p. The classical equichordal point problem asked whether K can have two distinct equichordal points, with possibly different constants. Describing the boundary through the radial distance functions from each candidate point turns the condition into coupled functional equations on those radial functions. Analytic and geometric constraints show these equations are incompatible except in the single-center case, so the problem has a negative, proved answer. Its exact identity depends on the stated conventions: regularity and convexity of the body, interior points, full chords rather than half-chords, point-specific constants, and the theorem's status as solved. Change any of these and you are dealing with a neighboring problem rather than this one.

Scope of Application¶

Equichordal point problem belongs to convex geometry history and is useful where the analyst can specify the typed convex geometry history carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate body regularity and convexity, interior points, full chord rather than half-chord convention, point-specific constants, and theorem status match the solved problem. The scope is broad within that domain but bounded by the need for body regularity and convexity, interior points, full chord rather than half-chord convention, point-specific constants, and theorem status match the solved problem. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making body regularity and convexity, interior points, full chord rather than half-chord convention, point-specific constants, and theorem status match the solved problem the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Equichordal point problem can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Equichordal point problem. Equichordal point problem compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed convex geometry history carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express body regularity and convexity, interior points, full chord rather than half-chord convention, point-specific constants, and theorem status match the solved problem independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of convex geometry history because they reuse the typed convex geometry history carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Radial distance functions from the two candidate points satisfy coupled chord equations; analytic and geometric constraints force incompatibility except for the single-center case., and type the carrier, state every parameter and convention in the definition, test that body regularity and convexity, interior points, full chord rather than half-chord convention, point-specific constants, and theorem status match the solved problem, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Equichordal point problem Domain-specific

Parents (1) — outgoing typed relations

Equichordal point problem is a kind of Constraint Prime

What makes it its own entry: the domain-specific identity determined by body regularity and convexity, interior points, full chord rather than half-chord convention, point-specific constants, and theorem status match the solved problem.

Hierarchy path (1) — routes to 1 parentless root

Equichordal point problem → is a kind of Constraint

Neighborhood in Abstraction Space¶

Equichordal point problem sits in a crowded region of the domain-specific corpus (13^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Euclidean & Geometric Structures (25 abstractions)

Nearest neighbors

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