Vela

Is there a dense subset of such that all pairwise distances are rational?

Worked, still open.

geometry · open · 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

This is exactly the **Erdős–Ulam problem**:

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

candidate solution ↗

formal

AMS 52 · open (literature)

theorem erdos_212 : answer(sorry) ↔
    ∃ u : Set ℂ, Dense u ∧ u.Pairwise fun c₁ c₂ => dist c₁ c₂ ∈ Set.range Rat.cast
formal-conjectures/212.lean ↗

a blogpost · paper

status

open

notary

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

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.