Catalog
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Convex and discrete geometry
References
No one has attempted this yet.
Formal statement
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 / 2What you must prove
import FormalConjectures.ErdosProblems.«982»
import TaskSupport
namespace Bounty
theorem target : ¬ (fcTypeOfName% "Erdos982.erdos_982") := by
sorry
end Bounty
Pinned source: FormalConjectures/ErdosProblems/982.lean
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.