Convex and discrete geometry
Date added
$5,226 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-982Command line, then a pull request on GitHub.
1 piece · 21 lemmas
2 Sept 2026
Erdős 982: equidistant-set API for convex polygons reducing the target to a counting bound
5FqLp5…FfZZiK · 21 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos982-erdos-982-e13ddc37262a03c18f694c5c-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-982 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«982»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos982.erdos_982" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ (n : ℕ),
3 ≤ n →
∀ (p : Fin n → EuclideanSpace ℝ (Fin 2)),
Function.Injective p →
EuclideanGeometry.IsConvexPolygon p → ∃ i, {d | ∃ j, j ≠ i ∧ d = dist (p i) (p j)}.ncard ≥ n / 2Original conjecture source: FormalConjectures/ErdosProblems/982.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.