AFTD Auto-Formalizing Theoretical Domains

is_valid_threshold_candidate

def

For natural numbers $q$ and $N$, $N$ is a valid candidate threshold for $q$ if $N = 2 * q - 1 \\lor N = 2 * q \\lor N = 2 * q + 1$.

Statement

def is_valid_threshold_candidate (q N : ℕ) : Prop
Defined in
arXiv:2610.30613 Remark 6.1
Verified
07 Nov 2026
Axioms
none listed

Read back from the Lean

Given natural numbers $q$ and $N$, is_valid_threshold_candidate q N asserts that $N = 2 * q - 1$, $N = 2 * q$, or $N = 2 * q + 1$ (using natural number subtraction).

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

/-- For natural numbers q and N, N is a valid candidate threshold if N = 2*q - 1 ∨ N = 2*q ∨ N = 2*q + 1. -/
def is_valid_threshold_candidate (q N : ℕ) : Prop := N = 2 * q - 1 ∨ N = 2 * q ∨ N = 2 * q + 1
See it in the graphDiscuss this resultChallenge it