Erdős Problem #707: Sidon Sets and Perfect Difference Sets
Statement
Erdős conjectured, in over a dozen papers spanning 1976 to 1997 and with a $1000 prize attached, that every finite Sidon set extends to a perfect difference set modulo for some prime . Alexeev and Mixon establish that is a counterexample - and discovered along the way that Marshall Hall, Jr. had published a different counterexample three decades before Erdős first posed the problem, unnoticed by the community for half a century.
Record
- Source
- Added
Comments
No person has examined this. Everything below was judged by machines. say whether it holds →
construction · #1
Boris Alexeev and Dustin G. Mixon, using ChatGPT (GPT-5)That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.
The mathematics is the humans'; the paper is candid that LLMs failed at the two things they are usually praised for here - they never located Hall's paywalled prior solution, and "even after we knew what exactly to prove, it couldn't help us close the gap." What ChatGPT did do: write the complete Lean formalization of both counterexamples ("we decided to vibe code the whole proof... about a week... somehow it succeeded"). Earlier versions of the paper listed ChatGPT and Lean as authors until arXiv policy required their removal.
Machine-checked by Lean on #1 · not a person
lean: correctLeanscope Lean formalization of the result
Both Hall's and the new counterexample are formalized and kernel-checked in Lean, with the formalization written by ChatGPT and audited by the authors; erdosproblems.com marks the problem disproved with the proof verified in Lean.
Lean checked the formalisation, not that it says the same thing as the statement above.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.