Vela

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_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

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) S
formal-conjectures/1071.lean ↗

status

solved

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 04270cf073adbb1a797fd1fc77809e2992d1b1e0764aae78ea5db28513c8bfa0

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.