AFTD Auto-Formalizing Theoretical Domains

probe_adjacent_lower

def

For a finite probe set F : Finset ℕ and a rank j : ℕ, the lower adjacent probed rank probe_adjacent_lower F j is the maximum of the finite set {0} ∪ {k ∈ F : k < j}.

Statement

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

Read back from the Lean

probe_adjacent_lower is a definition that takes a finite set of natural numbers F and a natural number j, and returns the maximum element of the finite set {0} ∪ {x ∈ F | x < j} (guaranteed to be non-empty since 0 is inserted). That is, it returns the greatest element of F strictly less than j, or 0 if no such element exists (or if the greatest such element is 0).

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

/-- Lower adjacent probed rank for an unprobed rank j, defined as max({0} ∪ {k ∈ F : k < j}). -/
def probe_adjacent_lower (F : Finset ℕ) (j : ℕ) : ℕ := (insert 0 (F.filter (· < j))).max' (Finset.insert_nonempty 0 _)
See it in the graphDiscuss this resultChallenge it