/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import FormalConjecturesUtil

Erdős Problem 103

References:

@[expose] public sectionopen Filter EuclideanGeometrynamespace Erdos103

The sets of $n$ points in $\mathbb{R}^2$ whose pairwise distances are all at least $1$.

def separatedSets (n : ℕ) : Set (Finset ℝ²) := {B | B.card = n ∧ Metric.IsSeparated' 1 (B : Set ℝ²)}

A is a minimiser for n if it is a separated set of n points whose diameter is at most the diameter of every separated set of n points (compare Erdos99.erdos_99).

def IsMinimiser (n : ℕ) (A : Finset ℝ²) : Prop := A ∈ separatedSets n ∧ IsMinOn (fun B : Finset ℝ² => Metric.diam (B : Set ℝ²)) (separatedSets n) A

Two finite sets of points are congruent if an isometry of the plane maps one onto the other.

def Congruent (A B : Finset ℝ²) : Prop := ∃ f : ℝ² ≃ᵢ ℝ², f '' A = B

h n is the number of congruence classes of minimisers for n points, as an element of ℕ∞: the supremum of the cardinalities of finite families of pairwise incongruent minimisers, which is ⊤ when there are infinitely many classes.

noncomputable def h (n : ℕ) : ℕ∞ := ⨆ (S : Finset (Finset ℝ²)) (_ : (∀ A ∈ S, IsMinimiser n A) ∧ ∀ A ∈ S, ∀ B ∈ S, A ≠ B → ¬ Congruent A B), (S.card : ℕ∞)

Let $h(n)$ count the number of incongruent sets of $n$ points in $\mathbb{R}^2$ which minimise the diameter subject to the constraint that $d(x,y)\geq 1$ for all points $x\neq y$. Is it true that $h(n)\to \infty$?

@[category research open, question, AMS 52] theorem erdos_103 : Tendsto h atTop (nhds ⊤) := ⊢ Tendsto h atTop (nhds ⊤) All goals completed! 🐙

It is not even known whether $h(n)\geq 2$ for all large $n$.

@[category research open, question, AMS 52] theorem erdos_103.variants.two_le : ∀ᶠ n in atTop, 2 ≤ h n := ⊢ ∀ᶠ (n : ℕ) in atTop, 2 ≤ h n All goals completed! 🐙end Erdos103