Convex and discrete geometry
Date added
$5,155 bounty2 pieces 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-100Command line, then a pull request on GitHub.
2 pieces · 9 lemmas
31 Aug 2026
[test] Counting bounds for EuclideanGeometry.distinctDistances
5Hn8NE…hth574 · 4 lemmas
[test] Hereditary and contrapositive API for Erdos100.DistancesSeparated
5Hn8NE…hth574 · 5 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos100-erdos-100-5481b2860f0cb2334a462f3e-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-100 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«100»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos100.erdos_100" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∃ C > 0,
∀ᶠ (n : ℕ) in Filter.atTop,
∀ (A : Finset (EuclideanSpace ℝ (Fin 2))), A.card = n → Erdos100.DistancesSeparated A → Metric.diam ↑A > C * ↑nOriginal conjecture source: FormalConjectures/ErdosProblems/100.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.