AFTD Auto-Formalizing Theoretical Domains

IsClosestCandidate

def

c ∈ C and d(y, c) ≤ d(y, c') for every c' ∈ C.

Statement

def IsClosestCandidate {X : Type*} [MetricSpace X] (C : Finset X) (y c : X) : Prop
Source
helper notion for the closest candidate location t(i) of arXiv:2610.18006 (Truthful two-facility location with candidate locations in metric spaces), Sec. 2
Verified
18 Oct 2026
Axioms
none listed
Used by 10

Lean source view module on GitHub

/-- `c` is a closest point of the finite set `C` to `y` (ties allowed). -/
def IsClosestCandidate {X : Type*} [MetricSpace X] (C : Finset X) (y c : X) : Prop :=
  c ∈ C ∧ ∀ c' ∈ C, dist y c ≤ dist y c'
See it in the graphDiscuss this resultChallenge it