Skip to content

Erdős Problem #1071

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

Put straight line segments of length one inside a square. They must be disjoint, so we cannot add a segment crossing one already chosen. A family is called maximal when there is no further admissible unit segment that can be added while preserving the disjointness rule.

Erdős Problem #1071 asks two surprisingly different questions. Can such a family inside the unit square be finite and maximal? Can some region contain a countably infinite maximal family?

“Maximal” means cannot add anything, not has the largest possible cardinality. Whether line segments include their endpoints also affects how disjointness is formalized.

A small example

Consider the open horizontal unit segment from \((0,0)\) to \((1,0)\) in the unit square. This singleton family is not maximal. A second horizontal open segment from \((0,1)\) to \((1,1)\) can be added without intersection.

The observation proves only that this particular arrangement is extendible; it does not rule out a different finite maximal arrangement. Rotating and placing segments can create much more restrictive patterns than parallel segments do.

What is known

The catalogue records an affirmative finite construction by Ludwig Danzer, discussed in Erdős's 1987 geometric survey. It also attributes a countably infinite maximal-family construction to a 1999 source and reports a more recent Boris Alexeev result in Lean for a unit-square variant.

The catalogue therefore marks #1071 proved (Lean). These are externally established or externally reported results; GCL has not independently reconstructed the original drawings or replayed the formal proof.

GCL's current state

Authenticated source audit #2342 directly inspected the frozen Lean formulation. Its definition of segment disjointness allows intersection only at endpoints, matching an important aspect of the open-segment convention.

The frozen statement also requires an open, connected region for its second part. External Lean proofs are linked, but the pinned file's own theorem bodies have unproved placeholders. Consequently, their existence in a catalogue is not a GCL proof certificate.

What remains

GCL should compare the exact 1987 source drawings and later countable construction to their Lean representations, including endpoint intersections, whole-segment containment, region connectedness, and genuine inclusion-maximality. It should then replay the external Lean proofs against exact immutable commits and check for assumptions or unproved lemmas.

Sources and claim boundaries

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2342 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction