AFTD Auto-Formalizing Theoretical Domains

is_crescent_configuration

def

A finite subset S of Euclidean space ℝ^d is a crescent configuration if it is in general position and the set of its distinct pairwise distances has cardinality |S| - 1 with multiplicities 1, ..., |S| - 1.

Statement

def is_crescent_configuration {d : ℕ} (S : Finset (EuclideanSpace ℝ (Fin d))) : Prop
Defined in
arXiv:2610.38368, Section 1
Verified
01 Nov 2026
Axioms
none listed
Built on 2
  • in_general_positionA finite subset S of Euclidean space ℝ^d is in general position if no d + 1 of its points lie in an affine hyperplane (every subset of…
  • distance_multiplicityThe multiplicity of a distance r in a finite subset S of a metric space is the number of 2-element subsets of S whose two elements have…
Used by 1
  • crescent_min_dimensionThe minimum dimension D(n) is the least integer d ≥ 2 such that there exists an n-point crescent configuration in ℝ^d.

Read back from the Lean

Given a dimension $d : ℕ$ (implicit) and a finite subset $S$ of $d$-dimensional Euclidean space $\mathbb{R}^d$ (EuclideanSpace ℝ (Fin d)), is_crescent_configuration S asserts that: 1. $S$ is in general position in $\mathbb{R}^d$: - every subset $s \subseteq S$ of size $d + 1$ is affinely independent over $\mathbb{R}$; and - for every subset $s \subseteq S$ of size $d + 2$, there does not exist a center $c \in \mathbb{R}^d$ and a radius $r \in \mathbb{R}$ such that every point $x \in s$ has $\operatorname{dist}(x, c) = r$ (no $d+2$ points are cospheric). 2. There exists a finite set of real numbers $D$ such that: - the cardinality of $D$ is $|S| - 1$ (with $\mathbb{N}$-subtraction); - for every 2-element subset $u \subseteq S$, there exists $r \in D$ and distinct $x, y \in u$ such that $\operatorname{dist}(x, y) = r$ (i.e., the Euclidean distance between any two points in $S$ belongs to $D$); and - the image of $D$ under the function distance_multiplicity S is the interval of natural numbers $\{1, \dots, |S| - 1\}$ (Finset.Icc 1 (S.card - 1)), where distance_multiplicity S r is the number of 2-element subsets of $S$ whose points are at distance $r$ apart.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A crescent configuration in d-dimensional Euclidean space is a set in general position whose distinct pairwise distances have multiplicities 1, ..., |S| - 1. -/
def is_crescent_configuration {d : ℕ} (S : Finset (EuclideanSpace ℝ (Fin d))) : Prop :=
  in_general_position d S ∧
  ∃ D : Finset ℝ, D.card = S.card - 1 ∧
    (∀ u ∈ S.powersetCard 2, ∃ r ∈ D, ∃ x ∈ u, ∃ y ∈ u, x ≠ y ∧ dist x y = r) ∧
    D.image (distance_multiplicity S) = Finset.Icc 1 (S.card - 1)
See it in the graphDiscuss this resultChallenge it