All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsConvex geometry

Erdős Problem 100: Strong

Stronger conjecture: diameter n1\geq n - 1 for sufficiently large nn.

Mathematical statement

Stronger conjecture: diameter n1\geq n - 1 for sufficiently large nn.

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_100.variants.strong

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_100.variants.strong :    ᶠ n in atTop,  A : Finset ²,      A.card = n       DistancesSeparated A       diam (A : Set ²)  n - 1 := 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