erdős #1071
Is there a finite set of unit line segments (rotated and translated copies of ) in the unit square, no two of which intersect, which are maximal with respect to this property?Is there a region with a maximal set of disjoint unit line segments that is countably infinite?
Worked, still open.
geometry · solved · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
No for the unit square; yes for a suitable region $R$.
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 52 · solved (literature)
theorem erdos_1071.parts.i :
answer(True) ↔ ∃ S : Finset (ℝ² × ℝ²),
Maximal (fun T : Finset (ℝ² × ℝ²) =>
(∀ seg ∈ T, dist seg.1 seg.2 = 1 ∧
seg.1 0 ∈ Icc 0 1 ∧ seg.1 1 ∈ Icc 0 1 ∧
seg.2 0 ∈ Icc 0 1 ∧ seg.2 1 ∈ Icc 0 1) ∧
(T : Set (ℝ² × ℝ²)).Pairwise SegmentsDisjoint) Sformal-conjectures/1071.lean ↗status
solved