AFTD Auto-Formalizing Theoretical Domains

is_coverable

def

A subset S of the complex plane is coverable by non-overlapping closed unit disks if there exists a set C of disk centers such that ||c - c'|| >= 2 for all distinct c, c' in C, and for every point x in S there exists c in C such that ||x - c|| <= 1.

Statement

def is_coverable (S : Set ℂ) : Prop
Defined in
arXiv:2611.13535, Definition 2.1
Verified
11 Nov 2026
Axioms
none listed
Used by 3

Read back from the Lean

is_coverable S asserts that there exists a subset C ⊆ ℂ such that: 1. For all distinct points c, c' ∈ C (with c ≠ c'), the Euclidean distance ‖c - c'‖ is at least 2. 2. For every point x ∈ S, there exists some point c ∈ C such that ‖x - c‖ ≤ 1 (that is, x lies within the closed unit disk centered at c).

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 set in the complex plane is coverable by non-overlapping closed unit disks. -/
def is_coverable (S : Set ℂ) : Prop := ∃ C : Set ℂ, (∀ ⦃c c' : ℂ⦄, c ∈ C → c' ∈ C → c ≠ c' → 2 ≤ ‖c - c'‖) ∧ ∀ x ∈ S, ∃ c ∈ C, ‖x - c‖ ≤ 1
See it in the graphDiscuss this resultChallenge it