AFTD Auto-Formalizing Theoretical Domains

sweep_candidate_bound

def

For natural numbers M, N, r, and j, sweep_candidate_bound M N r j is the finite subset (Finset (Fin M × Fin N)) of vertices p in Fin M × Fin N such that (p.1.val = r + 1 ∧ j < p.2.val) ∨ (r + 2 ≤ p.1.val).

Statement

def sweep_candidate_bound (M N : ℕ) (r j : ℕ) : Finset (Fin M × Fin N)
Defined in
arXiv:2611.01281 Section 5, Eq. 5
Verified
04 Nov 2026
Axioms
none listed
Used by 1
  • sweep_candidate_bound_lastFor all natural numbers M and N, the sweep candidate bound satisfies sweep_candidate_bound M N (M - 2) (N - 1) = ∅.

Read back from the Lean

For natural numbers M, N, r, and j, sweep_candidate_bound M N r j is defined as the finite set of pairs (p₁, p₂) in Fin M × Fin N satisfying either: (1) the numerical value of p₁ equals r + 1 and the numerical value of p₂ is strictly greater than j, or (2) the numerical value of p₁ is at least r + 2.

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

/-- The candidate set upper bound after a negative answer to sweep query T_{r,j}. -/
def sweep_candidate_bound (M N : ℕ) (r j : ℕ) : Finset (Fin M × Fin N) :=
  Finset.univ.filter fun p => (p.1.val = r + 1 ∧ j < p.2.val) ∨ (r + 2 ≤ p.1.val)
See it in the graphDiscuss this resultChallenge it