AFTD Auto-Formalizing Theoretical Domains

probe_adjacent_upper

def

For dimension n : ℕ, finite probe set F : Finset ℕ, and rank j : ℕ, the upper adjacent probed rank probe_adjacent_upper n F j is the minimum of the finite set {n} ∪ {k ∈ F : k > j}.

Statement

def probe_adjacent_upper (n : ℕ) (F : Finset ℕ) (j : ℕ) : ℕ
Defined in
arXiv:2610.35433
Verified
16 Nov 2026
Axioms
none listed

Read back from the Lean

probe_adjacent_upper n F j defines a function taking a natural number n, a finite set of natural numbers F, and a natural number j, returning the minimum element (with respect to the standard order on ℕ) of the finite set $\{k \in F \mid j < k\} \cup \{n\}$.

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

/-- Upper adjacent probed rank for an unprobed rank j, defined as min({n} ∪ {k ∈ F : k > j}). -/
def probe_adjacent_upper (n : ℕ) (F : Finset ℕ) (j : ℕ) : ℕ := (insert n (F.filter (fun k => j < k))).min' (Finset.insert_nonempty n _)
See it in the graphDiscuss this resultChallenge it