Erdős Problem #1121
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: proved (not automatically the live result).
Subject areas: geometry.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Suppose several circles lie in the plane and cannot be divided into two nonempty groups by a straight line that avoids all of them.
Erdős Problem #1121 asserts that these circles can all fit inside a larger disk whose radius is no greater than the sum of their radii:
The condition is called nonseparability. It does not require every pair of circles to intersect; rather, no single line missing every circle may separate the whole collection into two nonempty subcollections.
The theorem was proved by Goodman and Goodman (1945).
A small example
For just two filled disks with radii \(r_1,r_2\) and center separation \(d\), nonseparability means the disks overlap or touch:
Their minimal enclosing disk has radius
Under the nonseparability condition, each term is at most \(r_1+r_2\), proving the required inequality for two disks.
For example, radii \(2\) and \(3\) at center distance \(4\) have a smallest enclosing radius \(9/2\), which is less than the sum \(5\).
The exact two-disk formula is independently checked with rational arithmetic. It does not establish the general theorem for a nonseparable family of arbitrarily many disks.
What is known
The maintained catalogue credits Goodman and Goodman (1945) with the original affirmative theorem, which also generalizes to higher dimensions.
Later work includes a convex-body generalization by Hadwiger (1947) and an alternative proof by Bezdek and Litvak (2016).
In April 2026 the catalogue was updated to PROVED (LEAN) after a reported Aristotle formalization of the Goodman–Goodman result. This formal proof has not been independently downloaded and kernel-replayed by GCL; a label or external discussion is not itself a certificate.
GCL's current state
Authenticated source audit #2392 derives and checks the two-disk formula and records the distinction between pairwise overlap and family nonseparability.
The current historical revisions document the newly reported Lean status. The frozen formal-conjectures snapshot used by GCL predates this and does not include the newer formal proof.
What remains
Inspect the 1945 proof and its exact definition of a separating line. Obtain the versioned April 2026 formalization, review its statement and dependencies, and independently kernel-check it before claiming formal certification. Extend the elementary two-disk calculation to selected three-disk chains that are nonseparable without all pairs intersecting.
Sources and claim boundaries
Erdős Problem #1121; dated revision history; Goodman–Goodman (1945); Hadwiger (1947); Bezdek–Litvak (2016); GCL audit. The two-disk case is independently verified; the full theorem is externally proved and the Lean result only reported. Unaccepted draft.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2392 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.