Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Neighbors at a specified distance

Definition
Esgk_DistanceDesign

by mysticflounder · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

finite-combinatoricsgeometry

This defines the finite set of indices different from a given index whose configuration points lie at a specified Euclidean distance from it.

Definition code
-- Extracted dependency interfaces and their necessary proofs.
import Definitions.Def_Esgk_Foundation
import Mathlib

/-
Copyright (c) 2026 Adam McKenna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam McKenna
-/


namespace Esgk

open EuclideanGeometry
open scoped BigOperators

variable {n : ℕ} {α : Type*}


noncomputable def DistanceOutNeighborsAtValue {n : ℕ} (p : Config n) (i : Fin n) (r : ℝ) :
    Finset (Fin n) :=
  Finset.univ.filter (fun j : Fin n => i ≠ j ∧ dist (p i) (p j) = r)


end Esgk

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me