Erdős Problem 97: K Equidistant
Erdős also conjectured that there is a for which every convex polygon has a vertex with no other vertices equidistant from it.
Mathematical statement
Erdős also conjectured that there is a for which every convex polygon has a vertex with no other vertices equidistant from it.
Statement source: Erdős Problems statement material
Statement terms: Source-specific
Source-specific terms. Therefore does not assert reuse rights beyond attributed display.
Statement artifacts, not proofs
These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.
Pinned Lean formulation 1
erdos_97.variants.k_equidistant
theorem erdos_97.variants.k_equidistant : answer(sorry) ↔ ∃ k : ℕ, ∀ A : Finset ℝ², A.Nonempty → ConvexIndep A → ¬HasNEquidistantProperty k A := by sorry- Statement source
- Formal Conjectures
- Lean version
- v4.27.0
- Placeholder
- Present; no proof artifact
- Source evidence
- Pinned source index
- Fidelity review
- Community formulation
References