Convex and discrete geometry
Date added
$5,155 bounty1 piece from 1 personlast one 2 months ago
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
A lemma, a definition, a special case. There is no race: when someone closes the problem, up to half of its bounty can go to the recognised pieces that led there.
contrib new erdos-212Command line, then a pull request on GitHub.
1 piece · 32 lemmas
2 Sept 2026
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos212-erdos-212-68f089f0e23f081f94b37cb8-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-212 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«212»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos212.erdos_212" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∃ u, Dense u ∧ u.Pairwise fun c₁ c₂ => dist c₁ c₂ ∈ Set.range Rat.castOriginal conjecture source: FormalConjectures/ErdosProblems/212.lean
References
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.